%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : PLA020-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n020.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 08:54:03 AM UTC 2026
% Result : Unsatisfiable 0.21s 0.49s
% Output : Proof 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 5
% Syntax : Number of clauses : 14 ( 12 unt; 0 nHn; 14 RR)
% Number of literals : 20 ( 0 equ; 8 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 4 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(pickup_2,axiom,
( ~ holds(empty,State)
| ~ holds(clear(X),State)
| ~ holds(on(X,Y),State)
| holds(clear(Y),do(pickup(X),State)) ),
file('PLA001-0.ax',pickup_2) ).
cnf(initial_state3,axiom,
holds(on(c,d),s0),
file('PLA001-1.ax',initial_state3) ).
cnf(initial_state7,axiom,
holds(clear(c),s0),
file('PLA001-1.ax',initial_state7) ).
cnf(initial_state8,axiom,
holds(empty,s0),
file('PLA001-1.ax',initial_state8) ).
cnf(prove_D,negated_conjecture,
~ holds(clear(d),State),
file('theBenchmark.p',prove_D) ).
cnf(t1,plain,
~ holds(clear(d),do(pickup(c),s0)),
inference(start,[status(thm),parent(0:0)],[prove_D]) ).
cnf(t2,plain,
( ~ holds(on(c,d),s0)
| ~ holds(clear(c),s0)
| ~ holds(empty,s0)
| holds(clear(d),do(pickup(c),s0)) ),
inference(extension,[status(thm),parent(t1:1)],[pickup_2]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
holds(empty,s0),
inference(extension,[status(thm),parent(t2:2)],[initial_state8]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
holds(clear(c),s0),
inference(extension,[status(thm),parent(t2:3)],[initial_state7]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t2:3]) ).
cnf(t8,plain,
holds(on(c,d),s0),
inference(extension,[status(thm),parent(t2:4)],[initial_state3]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t2:4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PLA020-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.03 This is a CNF_UNS_RFO_NEQ_HRN problem
% 0.00/0.03 % Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.36 % Computer : n020.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Sat Sep 19 19:41:31 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.21/0.49 % SZS status Unsatisfiable for theBenchmark
% 0.21/0.49 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------