%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : PLA022-2 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n002.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 : Sun Sep 27 08:20:24 AM UTC 2026
% Result : Unsatisfiable 0.11s 0.40s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 14
% Syntax : Number of formulae : 42 ( 20 unt; 0 def)
% Number of atoms : 78 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 79 ( 43 ~; 36 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 54 ( 5 sgn 23 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(and_definition,axiom,
! [VAR_0,VAR_1,VAR_2] :
( ~ holds(VAR_1,VAR_2)
| ~ holds(VAR_0,VAR_2)
| holds(and(VAR_0,VAR_1),VAR_2) ),
file('theBenchmark.p',and_definition) ).
cnf(c_1,plain,
( ~ holds(B,C)
| ~ holds(A,C)
| holds(and(A,B),C) ),
inference(clausify,[status(thm)],[and_definition]) ).
fof(pickup_1,axiom,
! [VAR_0,VAR_1] :
( ~ differ(VAR_0,table)
| ~ holds(clear(VAR_0),VAR_1)
| ~ holds(empty,VAR_1)
| holds(holding(VAR_0),do(pickup(VAR_0),VAR_1)) ),
file('theBenchmark.p',pickup_1) ).
cnf(c_2,plain,
( ~ differ(A,table)
| ~ holds(clear(A),B)
| ~ holds(empty,B)
| holds(holding(A),do(pickup(A),B)) ),
inference(clausify,[status(thm)],[pickup_1]) ).
fof(pickup_3,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] :
( ~ differ(VAR_0,VAR_2)
| ~ holds(on(VAR_0,VAR_1),VAR_3)
| holds(on(VAR_0,VAR_1),do(pickup(VAR_2),VAR_3)) ),
file('theBenchmark.p',pickup_3) ).
cnf(c_4,plain,
( ~ differ(A,C)
| ~ holds(on(A,B),D)
| holds(on(A,B),do(pickup(C),D)) ),
inference(clausify,[status(thm)],[pickup_3]) ).
fof(pickup_4,axiom,
! [VAR_0,VAR_1,VAR_2] :
( ~ differ(VAR_0,VAR_1)
| ~ holds(clear(VAR_0),VAR_2)
| holds(clear(VAR_0),do(pickup(VAR_1),VAR_2)) ),
file('theBenchmark.p',pickup_4) ).
cnf(c_5,plain,
( ~ differ(A,B)
| ~ holds(clear(A),C)
| holds(clear(A),do(pickup(B),C)) ),
inference(clausify,[status(thm)],[pickup_4]) ).
fof(putdown_2,axiom,
! [VAR_0,VAR_1,VAR_2] :
( ~ holds(clear(VAR_1),VAR_2)
| ~ holds(holding(VAR_0),VAR_2)
| holds(on(VAR_0,VAR_1),do(putdown(VAR_0,VAR_1),VAR_2)) ),
file('theBenchmark.p',putdown_2) ).
cnf(c_7,plain,
( ~ holds(clear(B),C)
| ~ holds(holding(A),C)
| holds(on(A,B),do(putdown(A,B),C)) ),
inference(clausify,[status(thm)],[putdown_2]) ).
fof(putdown_4,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4] :
( ~ holds(on(VAR_0,VAR_1),VAR_4)
| holds(on(VAR_0,VAR_1),do(putdown(VAR_2,VAR_3),VAR_4)) ),
file('theBenchmark.p',putdown_4) ).
cnf(c_9,plain,
( ~ holds(on(A,B),E)
| holds(on(A,B),do(putdown(C,D),E)) ),
inference(clausify,[status(thm)],[putdown_4]) ).
fof(symmetry_of_differ,axiom,
! [VAR_0,VAR_1] :
( ~ differ(VAR_1,VAR_0)
| differ(VAR_0,VAR_1) ),
file('theBenchmark.p',symmetry_of_differ) ).
cnf(c_11,plain,
( ~ differ(B,A)
| differ(A,B) ),
inference(clausify,[status(thm)],[symmetry_of_differ]) ).
fof(differ_a_c,axiom,
differ(a,c),
file('theBenchmark.p',differ_a_c) ).
cnf(c_13,plain,
differ(a,c),
inference(clausify,[status(thm)],[differ_a_c]) ).
fof(differ_a_table,axiom,
differ(a,table),
file('theBenchmark.p',differ_a_table) ).
cnf(c_15,plain,
differ(a,table),
inference(clausify,[status(thm)],[differ_a_table]) ).
fof(initial_state3,axiom,
holds(on(c,d),s0),
file('theBenchmark.p',initial_state3) ).
cnf(c_24,plain,
holds(on(c,d),s0),
inference(clausify,[status(thm)],[initial_state3]) ).
fof(initial_state5,axiom,
holds(clear(a),s0),
file('theBenchmark.p',initial_state5) ).
cnf(c_26,plain,
holds(clear(a),s0),
inference(clausify,[status(thm)],[initial_state5]) ).
fof(initial_state7,axiom,
holds(clear(c),s0),
file('theBenchmark.p',initial_state7) ).
cnf(c_28,plain,
holds(clear(c),s0),
inference(clausify,[status(thm)],[initial_state7]) ).
fof(initial_state8,axiom,
holds(empty,s0),
file('theBenchmark.p',initial_state8) ).
cnf(c_29,plain,
holds(empty,s0),
inference(clausify,[status(thm)],[initial_state8]) ).
fof(prove_ACD,axiom,
! [VAR_0] : ~ holds(and(on(a,c),on(c,d)),VAR_0),
file('theBenchmark.p',prove_ACD) ).
cnf(c_31,plain,
~ holds(and(on(a,c),on(c,d)),A),
inference(clausify,[status(thm)],[prove_ACD]) ).
cnf(c_34,plain,
differ(c,a),
inference(resolve,[status(thm)],[c_11,c_13]) ).
cnf(c_1133,plain,
( ~ differ(A,table)
| ~ holds(clear(A),s0)
| holds(holding(A),do(pickup(A),s0)) ),
inference(resolve,[status(thm)],[c_2,c_29]) ).
cnf(c_1134,plain,
( ~ differ(a,table)
| holds(holding(a),do(pickup(a),s0)) ),
inference(resolve,[status(thm)],[c_1133,c_26]) ).
cnf(c_127,plain,
holds(holding(a),do(pickup(a),s0)),
inference(resolve,[status(thm)],[c_1134,c_15]) ).
cnf(c_160,plain,
( ~ holds(on(c,d),A)
| ~ holds(on(a,c),A) ),
inference(resolve,[status(thm)],[c_31,c_1]) ).
cnf(c_168,plain,
( ~ holds(on(c,d),C)
| ~ holds(on(a,c),do(putdown(A,B),C)) ),
inference(resolve,[status(thm)],[c_160,c_9]) ).
cnf(c_1135,plain,
( ~ differ(c,A)
| holds(clear(c),do(pickup(A),s0)) ),
inference(resolve,[status(thm)],[c_5,c_28]) ).
cnf(c_184,plain,
holds(clear(c),do(pickup(a),s0)),
inference(resolve,[status(thm)],[c_1135,c_34]) ).
cnf(c_1136,plain,
( ~ differ(c,A)
| holds(on(c,d),do(pickup(A),s0)) ),
inference(resolve,[status(thm)],[c_4,c_24]) ).
cnf(c_185,plain,
holds(on(c,d),do(pickup(a),s0)),
inference(resolve,[status(thm)],[c_1136,c_34]) ).
cnf(c_192,plain,
( ~ holds(clear(c),A)
| ~ holds(holding(a),A)
| ~ holds(on(c,d),A) ),
inference(resolve,[status(thm)],[c_168,c_7]) ).
cnf(c_1137,plain,
( ~ holds(clear(c),do(pickup(a),s0))
| ~ holds(on(c,d),do(pickup(a),s0)) ),
inference(resolve,[status(thm)],[c_127,c_192]) ).
cnf(c_1138,plain,
~ holds(clear(c),do(pickup(a),s0)),
inference(resolve,[status(thm)],[c_185,c_1137]) ).
cnf(c_1132,plain,
$false,
inference(resolve,[status(thm)],[c_184,c_1138]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PLA022-2 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.34 % Computer : n002.cluster.edu
% 0.07/0.34 % Model : x86_64 x86_64
% 0.07/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.34 % Memory : 8046.5625MB
% 0.07/0.34 % OS : Linux 6.8.0-71-generic
% 0.07/0.34 % CPULimit : 300
% 0.07/0.34 % WCLimit : 300
% 0.07/0.34 % DateTime : Sat Sep 26 04:47:20 UTC 2026
% 0.07/0.34 % CPUTime :
% 0.07/0.34 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.07/0.34 % Process 853568 was started by sandbox on n002,
% 0.07/0.34 % Sat Sep 26 04:47:20 2026
% 0.07/0.34 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.07/0.35
% 0.07/0.35 % From the command line: assign(max_seconds, 300).
% 0.11/0.40
% 0.11/0.40 % SZS status Unsatisfiable for theBenchmark
% 0.11/0.40
% 0.11/0.40 % Proof 1 at 0.03 (+ 0.02) seconds.
% 0.11/0.40 % Length of proof is 22.
% 0.11/0.40 % Level of proof is 4.
% 0.11/0.40 % Maximum clause weight is 32.000.
% 0.11/0.40 % Given clauses 106.
% 0.11/0.40
% 0.11/0.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------