## TPTP Problem File: PLA029+2.p

View Solutions - Solve Problem

```%--------------------------------------------------------------------------
% File     : PLA029+2 : TPTP v7.3.0. Released v2.5.0.
% Domain   : Planning (Blocks world)
% Problem  : Blocks world axioms
% Version  : [Bau99] axioms.
% English  :

% Refs     : [Bau99] Baumgartner (1999), FTP'2000 - Problem Sets
%            [KS96]  Kautz & Selman (1996), Pushing the Envelope: Planning,
%            [KS92]  Kautz & Selman (1992), Planning as Satisfiability
% Source   : [Bau99]
% Names    :

% Status   : Satisfiable
% Rating   : 0.00 v6.1.0, 0.20 v6.0.0, 0.00 v5.4.0, 0.14 v5.2.0, 0.25 v5.0.0, 0.00 v3.2.0, 0.33 v3.1.0, 0.00 v2.7.0, 0.33 v2.5.0
% Syntax   : Number of formulae    :   24 (   0 unit)
%            Number of atoms       :  119 (   0 equality)
%            Maximal formula depth :   10 (   8 average)
%            Number of connectives :  120 (  25   ~;   0   |;  43   &)
%                                         (   0 <=>;  52  =>;   0  <=;   0 <~>)
%                                         (   0  ~|;   0  ~&)
%            Number of predicates  :   10 (   0 propositional; 1-3 arity)
%            Number of functors    :    1 (   0 constant; 1-1 arity)
%            Number of variables   :   64 (   0 sgn;  64   !;   0   ?)
%            Maximal term depth    :    2 (   1 average)
% SPC      : FOF_SAT_RFO_NEQ