## TPTP Problem File: PLA020-1.p

View Solutions - Solve Problem

```%--------------------------------------------------------------------------
% File     : PLA020-1 : TPTP v7.3.0. Released v1.1.0.
% Domain   : Planning (Blocks world)
% Problem  : Block D clear
% Version  : [SE94] axioms.
% English  :

% Refs     : [Sus73] Sussman (1973), A Computational Model of Skill Acquisi
%          : [SE94]  Segre & Elkan (1994), A High-Performance Explanation-B
% Source   : [SE94]
% Names    : - [SE94]

% Status   : Unsatisfiable
% Rating   : 0.17 v7.3.0, 0.00 v5.4.0, 0.11 v5.3.0, 0.15 v5.2.0, 0.08 v5.1.0, 0.06 v5.0.0, 0.00 v2.0.0
% Syntax   : Number of clauses     :   31 (   0 non-Horn;  20 unit;  28 RR)
%            Number of atoms       :   53 (   0 equality)
%            Maximal clause size   :    4 (   2 average)
%            Number of predicates  :    2 (   0 propositional; 2-2 arity)
%            Number of functors    :   14 (   7 constant; 0-2 arity)
%            Number of variables   :   37 (   5 singleton)
%            Maximal term depth    :    3 (   1 average)
% SPC      : CNF_UNS_RFO_NEQ_HRN

% Comments : The axioms are a reconstruction of the situation calculus
%            blocks world as in [Sus73].
%--------------------------------------------------------------------------
%----Include Blocks world axioms
include('Axioms/PLA001-0.ax').
%----Include Blocks world difference axioms for 4 blocks
include('Axioms/PLA001-1.ax').
%--------------------------------------------------------------------------
cnf(prove_D,negated_conjecture,
( ~ holds(clear(d),State) )).

%--------------------------------------------------------------------------
```