%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PLA014-2 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n017.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 01:58:50 PM UTC 2026
% Result : Unsatisfiable 0.13s 0.51s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 20
% Syntax : Number of clauses : 65 ( 24 unt; 0 nHn; 59 RR)
% Number of literals : 149 ( 0 equ; 98 neg)
% Maximal clause size : 4 ( 2 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 : 110 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_ABC,negated_conjecture,
~ holds(and(on(b,c),on(a,b)),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ABC) ).
cnf(and_definition,axiom,
( ~ holds(X2,X3)
| ~ holds(X1,X3)
| holds(and(X1,X2),X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-0.ax',and_definition) ).
cnf(putdown_2,axiom,
( ~ holds(clear(X2),X3)
| ~ holds(holding(X1),X3)
| holds(on(X1,X2),do(putdown(X1,X2),X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-0.ax',putdown_2) ).
cnf(putdown_4,axiom,
( ~ holds(on(X1,X2),X5)
| holds(on(X1,X2),do(putdown(X3,X4),X5)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-0.ax',putdown_4) ).
cnf(pickup_1,axiom,
( ~ differ(X1,table)
| ~ holds(clear(X1),X2)
| ~ holds(empty,X2)
| holds(holding(X1),do(pickup(X1),X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-0.ax',pickup_1) ).
cnf(symmetry_of_differ,axiom,
( ~ differ(X2,X1)
| differ(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',symmetry_of_differ) ).
cnf(differ_a_table,axiom,
differ(a,table),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',differ_a_table) ).
cnf(pickup_3,axiom,
( ~ differ(X1,X3)
| ~ holds(on(X1,X2),X4)
| holds(on(X1,X2),do(pickup(X3),X4)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-0.ax',pickup_3) ).
cnf(differ_a_b,axiom,
differ(a,b),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',differ_a_b) ).
cnf(pickup_4,axiom,
( ~ differ(X1,X2)
| ~ holds(clear(X1),X3)
| holds(clear(X1),do(pickup(X2),X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-0.ax',pickup_4) ).
cnf(putdown_1,axiom,
( ~ holds(clear(X2),X3)
| ~ holds(holding(X1),X3)
| holds(empty,do(putdown(X1,X2),X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-0.ax',putdown_1) ).
cnf(putdown_3,axiom,
( ~ holds(clear(X2),X3)
| ~ holds(holding(X1),X3)
| holds(clear(X1),do(putdown(X1,X2),X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-0.ax',putdown_3) ).
cnf(putdown_5,axiom,
( ~ differ(X1,X3)
| ~ holds(clear(X1),X4)
| holds(clear(X1),do(putdown(X2,X3),X4)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-0.ax',putdown_5) ).
cnf(differ_a_c,axiom,
differ(a,c),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',differ_a_c) ).
cnf(differ_b_table,axiom,
differ(b,table),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',differ_b_table) ).
cnf(differ_b_c,axiom,
differ(b,c),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',differ_b_c) ).
cnf(initial_state7,axiom,
holds(clear(c),s0),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',initial_state7) ).
cnf(initial_state6,axiom,
holds(clear(b),s0),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',initial_state6) ).
cnf(initial_state5,axiom,
holds(clear(a),s0),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',initial_state5) ).
cnf(initial_state8,axiom,
holds(empty,s0),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',initial_state8) ).
cnf(c_0_20,negated_conjecture,
~ holds(and(on(b,c),on(a,b)),X1),
inference(fof_simplification,[status(thm)],[prove_ABC]) ).
cnf(c_0_21,plain,
( ~ holds(X2,X3)
| ~ holds(X1,X3)
| holds(and(X1,X2),X3) ),
inference(fof_simplification,[status(thm)],[and_definition]) ).
cnf(c_0_22,negated_conjecture,
~ holds(and(on(b,c),on(a,b)),X1),
c_0_20 ).
cnf(c_0_23,plain,
( ~ holds(X2,X3)
| ~ holds(X1,X3)
| holds(and(X1,X2),X3) ),
c_0_21 ).
cnf(c_0_24,plain,
( ~ holds(clear(X2),X3)
| ~ holds(holding(X1),X3)
| holds(on(X1,X2),do(putdown(X1,X2),X3)) ),
inference(fof_simplification,[status(thm)],[putdown_2]) ).
cnf(c_0_25,negated_conjecture,
( ~ holds(on(b,c),X1)
| ~ holds(on(a,b),X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
( ~ holds(clear(X2),X3)
| ~ holds(holding(X1),X3)
| holds(on(X1,X2),do(putdown(X1,X2),X3)) ),
c_0_24 ).
cnf(c_0_27,plain,
( ~ holds(on(X1,X2),X5)
| holds(on(X1,X2),do(putdown(X3,X4),X5)) ),
inference(fof_simplification,[status(thm)],[putdown_4]) ).
cnf(c_0_28,negated_conjecture,
( ~ holds(clear(b),X1)
| ~ holds(holding(a),X1)
| ~ holds(on(b,c),do(putdown(a,b),X1)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,plain,
( ~ holds(on(X1,X2),X5)
| holds(on(X1,X2),do(putdown(X3,X4),X5)) ),
c_0_27 ).
cnf(c_0_30,plain,
( ~ differ(X1,table)
| ~ holds(clear(X1),X2)
| ~ holds(empty,X2)
| holds(holding(X1),do(pickup(X1),X2)) ),
inference(fof_simplification,[status(thm)],[pickup_1]) ).
cnf(c_0_31,plain,
( ~ differ(X2,X1)
| differ(X1,X2) ),
inference(fof_simplification,[status(thm)],[symmetry_of_differ]) ).
cnf(c_0_32,negated_conjecture,
( ~ holds(clear(b),X1)
| ~ holds(holding(a),X1)
| ~ holds(on(b,c),X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
( ~ differ(X1,table)
| ~ holds(clear(X1),X2)
| ~ holds(empty,X2)
| holds(holding(X1),do(pickup(X1),X2)) ),
c_0_30 ).
cnf(c_0_34,axiom,
differ(a,table),
differ_a_table ).
cnf(c_0_35,plain,
( ~ differ(X1,X3)
| ~ holds(on(X1,X2),X4)
| holds(on(X1,X2),do(pickup(X3),X4)) ),
inference(fof_simplification,[status(thm)],[pickup_3]) ).
cnf(c_0_36,plain,
( ~ differ(X2,X1)
| differ(X1,X2) ),
c_0_31 ).
cnf(c_0_37,axiom,
differ(a,b),
differ_a_b ).
cnf(c_0_38,negated_conjecture,
( ~ holds(empty,X1)
| ~ holds(clear(a),X1)
| ~ holds(clear(b),do(pickup(a),X1))
| ~ holds(on(b,c),do(pickup(a),X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]) ).
cnf(c_0_39,plain,
( ~ differ(X1,X3)
| ~ holds(on(X1,X2),X4)
| holds(on(X1,X2),do(pickup(X3),X4)) ),
c_0_35 ).
cnf(c_0_40,plain,
differ(b,a),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,plain,
( ~ differ(X1,X2)
| ~ holds(clear(X1),X3)
| holds(clear(X1),do(pickup(X2),X3)) ),
inference(fof_simplification,[status(thm)],[pickup_4]) ).
cnf(c_0_42,negated_conjecture,
( ~ holds(empty,X1)
| ~ holds(clear(a),X1)
| ~ holds(on(b,c),X1)
| ~ holds(clear(b),do(pickup(a),X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).
cnf(c_0_43,plain,
( ~ differ(X1,X2)
| ~ holds(clear(X1),X3)
| holds(clear(X1),do(pickup(X2),X3)) ),
c_0_41 ).
cnf(c_0_44,plain,
( ~ holds(clear(X2),X3)
| ~ holds(holding(X1),X3)
| holds(empty,do(putdown(X1,X2),X3)) ),
inference(fof_simplification,[status(thm)],[putdown_1]) ).
cnf(c_0_45,plain,
( ~ holds(clear(X2),X3)
| ~ holds(holding(X1),X3)
| holds(clear(X1),do(putdown(X1,X2),X3)) ),
inference(fof_simplification,[status(thm)],[putdown_3]) ).
cnf(c_0_46,negated_conjecture,
( ~ holds(empty,X1)
| ~ holds(clear(b),X1)
| ~ holds(clear(a),X1)
| ~ holds(on(b,c),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_40])]) ).
cnf(c_0_47,plain,
( ~ holds(clear(X2),X3)
| ~ holds(holding(X1),X3)
| holds(empty,do(putdown(X1,X2),X3)) ),
c_0_44 ).
cnf(c_0_48,plain,
( ~ holds(clear(X2),X3)
| ~ holds(holding(X1),X3)
| holds(clear(X1),do(putdown(X1,X2),X3)) ),
c_0_45 ).
cnf(c_0_49,plain,
( ~ differ(X1,X3)
| ~ holds(clear(X1),X4)
| holds(clear(X1),do(putdown(X2,X3),X4)) ),
inference(fof_simplification,[status(thm)],[putdown_5]) ).
cnf(c_0_50,negated_conjecture,
( ~ holds(clear(c),X1)
| ~ holds(holding(b),X1)
| ~ holds(clear(a),do(putdown(b,c),X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_26]),c_0_47]),c_0_48]) ).
cnf(c_0_51,plain,
( ~ differ(X1,X3)
| ~ holds(clear(X1),X4)
| holds(clear(X1),do(putdown(X2,X3),X4)) ),
c_0_49 ).
cnf(c_0_52,axiom,
differ(a,c),
differ_a_c ).
cnf(c_0_53,negated_conjecture,
( ~ holds(clear(a),X1)
| ~ holds(clear(c),X1)
| ~ holds(holding(b),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52])]) ).
cnf(c_0_54,axiom,
differ(b,table),
differ_b_table ).
cnf(c_0_55,axiom,
differ(b,c),
differ_b_c ).
cnf(c_0_56,negated_conjecture,
( ~ holds(empty,X1)
| ~ holds(clear(b),X1)
| ~ holds(clear(a),do(pickup(b),X1))
| ~ holds(clear(c),do(pickup(b),X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_33]),c_0_54])]) ).
cnf(c_0_57,plain,
differ(c,b),
inference(spm,[status(thm)],[c_0_36,c_0_55]) ).
cnf(c_0_58,negated_conjecture,
( ~ holds(empty,X1)
| ~ holds(clear(c),X1)
| ~ holds(clear(b),X1)
| ~ holds(clear(a),do(pickup(b),X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_43]),c_0_57])]) ).
cnf(c_0_59,negated_conjecture,
( ~ holds(empty,X1)
| ~ holds(clear(a),X1)
| ~ holds(clear(c),X1)
| ~ holds(clear(b),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_43]),c_0_37])]) ).
cnf(c_0_60,axiom,
holds(clear(c),s0),
initial_state7 ).
cnf(c_0_61,axiom,
holds(clear(b),s0),
initial_state6 ).
cnf(c_0_62,axiom,
holds(clear(a),s0),
initial_state5 ).
cnf(c_0_63,axiom,
holds(empty,s0),
initial_state8 ).
cnf(c_0_64,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61]),c_0_62]),c_0_63])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PLA014-2 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n017.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 03:27:26 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.46 Running first-order theorem proving
% 0.13/0.46 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.51 % Version: 3.5.1
% 0.13/0.51 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.51 % Starting sh5l with 300s (1) cores
% 0.13/0.51 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1334811 completed with status 0
% 0.13/0.51 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.51 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.51 % No SInE strategy applied
% 0.13/0.51 % Search class: FHUNF-FFMM21-SFFFFFNN
% 0.13/0.51 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/0.51 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.13/0.51 % Starting new_bool_3 with 136s (1) cores
% 0.13/0.51 % Starting new_bool_1 with 136s (1) cores
% 0.13/0.51 % SubtermCWHack with pid 1334816 completed with status 0
% 0.13/0.51 % Result found by SubtermCWHack
% 0.13/0.51 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.51 % No SInE strategy applied
% 0.13/0.51 % Search class: FHUNF-FFMM21-SFFFFFNN
% 0.13/0.51 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.51 % Preprocessing time : 0.002 s
% 0.13/0.51
% 0.13/0.51 % Proof found!
% 0.13/0.51 % SZS status Unsatisfiable
% 0.13/0.51 % SZS output start CNFRefutation
% See solution above
% 0.13/0.51 % Parsed axioms : 31
% 0.13/0.51 % Removed by relevancy pruning/SinE : 0
% 0.13/0.51 % Initial clauses : 31
% 0.13/0.51 % Removed in clause preprocessing : 0
% 0.13/0.51 % Initial clauses in saturation : 31
% 0.13/0.51 % Processed clauses : 81
% 0.13/0.51 % ...of these trivial : 0
% 0.13/0.51 % ...subsumed : 5
% 0.13/0.51 % ...remaining for further processing : 76
% 0.13/0.51 % Other redundant clauses eliminated : 0
% 0.13/0.51 % Clauses deleted for lack of memory : 0
% 0.13/0.51 % Backward-subsumed : 4
% 0.13/0.51 % Backward-rewritten : 0
% 0.13/0.51 % Generated clauses : 82
% 0.13/0.51 % ...of the previous two non-redundant : 67
% 0.13/0.51 % ...aggressively subsumed : 0
% 0.13/0.51 % Contextual simplify-reflections : 4
% 0.13/0.51 % Paramodulations : 82
% 0.13/0.51 % Factorizations : 0
% 0.13/0.51 % NegExts : 0
% 0.13/0.51 % Equation resolutions : 0
% 0.13/0.51 % Disequality decompositions : 0
% 0.13/0.51 % Total rewrite steps : 31
% 0.13/0.51 % ...of those cached : 15
% 0.13/0.51 % Propositional unsat checks : 0
% 0.13/0.51 % Propositional check models : 0
% 0.13/0.51 % Propositional check unsatisfiable : 0
% 0.13/0.51 % Propositional clauses : 0
% 0.13/0.51 % Propositional clauses after purity: 0
% 0.13/0.51 % Propositional unsat core size : 0
% 0.13/0.51 % Propositional preprocessing time : 0.000
% 0.13/0.51 % Propositional encoding time : 0.000
% 0.13/0.51 % Propositional solver time : 0.000
% 0.13/0.51 % Success case prop preproc time : 0.000
% 0.13/0.51 % Success case prop encoding time : 0.000
% 0.13/0.51 % Success case prop solver time : 0.000
% 0.13/0.51 % Current number of processed clauses : 72
% 0.13/0.51 % Positive orientable unit clauses : 29
% 0.13/0.51 % Positive unorientable unit clauses: 0
% 0.13/0.51 % Negative unit clauses : 2
% 0.13/0.51 % Non-unit-clauses : 41
% 0.13/0.51 % Current number of unprocessed clauses: 15
% 0.13/0.51 % ...number of literals in the above : 93
% 0.13/0.51 % Current number of archived formulas : 0
% 0.13/0.51 % Current number of archived clauses : 4
% 0.13/0.51 % Clause-clause subsumption calls (NU) : 1087
% 0.13/0.51 % Rec. Clause-clause subsumption calls : 120
% 0.13/0.51 % Non-unit clause-clause subsumptions : 9
% 0.13/0.51 % Unit Clause-clause subsumption calls : 21
% 0.13/0.51 % Rewrite failures with RHS unbound : 0
% 0.13/0.51 % BW rewrite match attempts : 0
% 0.13/0.51 % BW rewrite match successes : 0
% 0.13/0.51 % Condensation attempts : 0
% 0.13/0.51 % Condensation successes : 0
% 0.13/0.51 % Termbank termtop insertions : 3141
% 0.13/0.51 % Search garbage collected termcells : 55
% 0.13/0.51
% 0.13/0.51 % -------------------------------------------------
% 0.13/0.51 % User time : 0.012 s
% 0.13/0.51 % System time : 0.006 s
% 0.13/0.51 % Total time : 0.018 s
% 0.13/0.51 % Maximum resident set size: 3660 pages
% 0.13/0.51
% 0.13/0.51 % -------------------------------------------------
% 0.13/0.51 % User time : 0.054 s
% 0.13/0.51 % System time : 0.024 s
% 0.13/0.51 % Total time : 0.078 s
% 0.13/0.51 % Maximum resident set size: 4608 pages
% 0.13/0.51 % E exiting
%------------------------------------------------------------------------------