%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : PLA017-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n016.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.08s 0.58s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 29 ( 16 unt; 0 def)
% Number of atoms : 53 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 55 ( 31 ~; 24 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-2 aty)
% Number of variables : 26 ( 1 sgn 11 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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_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(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_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_AC,axiom,
! [VAR_0] : ~ holds(on(a,c),VAR_0),
file('theBenchmark.p',prove_AC) ).
cnf(c_31,plain,
~ holds(on(a,c),A),
inference(clausify,[status(thm)],[prove_AC]) ).
cnf(c_33,plain,
differ(c,a),
inference(resolve,[status(thm)],[c_11,c_13]) ).
cnf(c_159,plain,
( ~ holds(clear(c),A)
| ~ holds(holding(a),A) ),
inference(resolve,[status(thm)],[c_31,c_7]) ).
cnf(c_174,plain,
( ~ differ(c,A)
| holds(clear(c),do(pickup(A),s0)) ),
inference(resolve,[status(thm)],[c_5,c_28]) ).
cnf(c_165,plain,
holds(clear(c),do(pickup(a),s0)),
inference(resolve,[status(thm)],[c_174,c_33]) ).
cnf(c_175,plain,
( ~ differ(a,table)
| ~ holds(clear(a),A)
| ~ holds(empty,A)
| ~ holds(clear(c),do(pickup(a),A)) ),
inference(resolve,[status(thm)],[c_159,c_2]) ).
cnf(c_167,plain,
( ~ holds(clear(a),A)
| ~ holds(empty,A)
| ~ holds(clear(c),do(pickup(a),A)) ),
inference(resolve,[status(thm)],[c_15,c_175]) ).
cnf(c_176,plain,
( ~ holds(clear(a),s0)
| ~ holds(clear(c),do(pickup(a),s0)) ),
inference(resolve,[status(thm)],[c_167,c_29]) ).
cnf(c_177,plain,
~ holds(clear(a),s0),
inference(resolve,[status(thm)],[c_165,c_176]) ).
cnf(c_173,plain,
$false,
inference(resolve,[status(thm)],[c_26,c_177]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PLA017-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.56 % Computer : n016.cluster.edu
% 0.08/0.56 % Model : x86_64 x86_64
% 0.08/0.56 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.56 % Memory : 8046.5625MB
% 0.08/0.56 % OS : Linux 6.8.0-71-generic
% 0.08/0.56 % CPULimit : 300
% 0.08/0.56 % WCLimit : 300
% 0.08/0.56 % DateTime : Sat Sep 26 04:49:18 UTC 2026
% 0.08/0.57 % CPUTime :
% 0.08/0.57 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.57 % Process 13634 was started by sandbox2 on n016,
% 0.08/0.57 % Sat Sep 26 04:49:18 2026
% 0.08/0.57 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.08/0.57
% 0.08/0.57 % From the command line: assign(max_seconds, 300).
% 0.08/0.58
% 0.08/0.58 % SZS status Unsatisfiable for theBenchmark
% 0.08/0.58
% 0.08/0.58 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.08/0.58 % Length of proof is 15.
% 0.08/0.58 % Level of proof is 3.
% 0.08/0.58 % Maximum clause weight is 32.000.
% 0.08/0.58 % Given clauses 36.
% 0.08/0.58
% 0.08/0.58 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------