%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PLA007-1 : 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 : n004.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:48 PM UTC 2026
% Result : Unsatisfiable 0.04s 0.43s
% Output : CNFRefutation 0.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 18
% Syntax : Number of clauses : 56 ( 25 unt; 0 nHn; 51 RR)
% Number of literals : 145 ( 0 equ; 102 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 88 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_AD,negated_conjecture,
~ holds(on(a,d),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_AD) ).
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(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_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(differ_a_d,axiom,
differ(a,d),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',differ_a_d) ).
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(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(pickup_2,axiom,
( ~ holds(empty,X3)
| ~ holds(clear(X2),X3)
| ~ holds(on(X2,X1),X3)
| holds(clear(X1),do(pickup(X2),X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-0.ax',pickup_2) ).
cnf(clear_table,axiom,
holds(clear(table),X1),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',clear_table) ).
cnf(differ_d_table,axiom,
differ(d,table),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',differ_d_table) ).
cnf(initial_state3,axiom,
holds(on(c,d),s0),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',initial_state3) ).
cnf(differ_c_table,axiom,
differ(c,table),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',differ_c_table) ).
cnf(differ_a_c,axiom,
differ(a,c),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',differ_a_c) ).
cnf(initial_state5,axiom,
holds(clear(a),s0),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',initial_state5) ).
cnf(initial_state7,axiom,
holds(clear(c),s0),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',initial_state7) ).
cnf(initial_state8,axiom,
holds(empty,s0),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',initial_state8) ).
cnf(c_0_18,negated_conjecture,
~ holds(on(a,d),X1),
inference(fof_simplification,[status(thm)],[prove_AD]) ).
cnf(c_0_19,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_20,negated_conjecture,
~ holds(on(a,d),X1),
c_0_18 ).
cnf(c_0_21,plain,
( ~ holds(clear(X2),X3)
| ~ holds(holding(X1),X3)
| holds(on(X1,X2),do(putdown(X1,X2),X3)) ),
c_0_19 ).
cnf(c_0_22,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_23,plain,
( ~ differ(X2,X1)
| differ(X1,X2) ),
inference(fof_simplification,[status(thm)],[symmetry_of_differ]) ).
cnf(c_0_24,negated_conjecture,
( ~ holds(clear(d),X1)
| ~ holds(holding(a),X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
( ~ differ(X1,table)
| ~ holds(clear(X1),X2)
| ~ holds(empty,X2)
| holds(holding(X1),do(pickup(X1),X2)) ),
c_0_22 ).
cnf(c_0_26,axiom,
differ(a,table),
differ_a_table ).
cnf(c_0_27,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_28,plain,
( ~ differ(X2,X1)
| differ(X1,X2) ),
c_0_23 ).
cnf(c_0_29,axiom,
differ(a,d),
differ_a_d ).
cnf(c_0_30,negated_conjecture,
( ~ holds(empty,X1)
| ~ holds(clear(a),X1)
| ~ holds(clear(d),do(pickup(a),X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_31,plain,
( ~ differ(X1,X2)
| ~ holds(clear(X1),X3)
| holds(clear(X1),do(pickup(X2),X3)) ),
c_0_27 ).
cnf(c_0_32,plain,
differ(d,a),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,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_34,negated_conjecture,
( ~ holds(empty,X1)
| ~ holds(clear(d),X1)
| ~ holds(clear(a),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).
cnf(c_0_35,plain,
( ~ differ(X1,X3)
| ~ holds(clear(X1),X4)
| holds(clear(X1),do(putdown(X2,X3),X4)) ),
c_0_33 ).
cnf(c_0_36,negated_conjecture,
( ~ holds(clear(d),X3)
| ~ holds(empty,do(putdown(X2,X1),X3))
| ~ holds(clear(a),do(putdown(X2,X1),X3))
| ~ differ(d,X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_37,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_38,negated_conjecture,
( ~ holds(clear(a),X3)
| ~ holds(clear(d),X3)
| ~ holds(empty,do(putdown(X2,X1),X3))
| ~ differ(a,X1)
| ~ differ(d,X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_35]) ).
cnf(c_0_39,plain,
( ~ holds(clear(X2),X3)
| ~ holds(holding(X1),X3)
| holds(empty,do(putdown(X1,X2),X3)) ),
c_0_37 ).
cnf(c_0_40,negated_conjecture,
( ~ holds(clear(X1),X2)
| ~ holds(holding(X3),X2)
| ~ holds(clear(a),X2)
| ~ holds(clear(d),X2)
| ~ differ(a,X1)
| ~ differ(d,X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_41,plain,
( ~ holds(empty,X3)
| ~ holds(clear(X2),X3)
| ~ holds(on(X2,X1),X3)
| holds(clear(X1),do(pickup(X2),X3)) ),
inference(fof_simplification,[status(thm)],[pickup_2]) ).
cnf(c_0_42,negated_conjecture,
( ~ holds(empty,X3)
| ~ holds(clear(X2),X3)
| ~ holds(clear(X1),do(pickup(X2),X3))
| ~ holds(clear(a),do(pickup(X2),X3))
| ~ holds(clear(d),do(pickup(X2),X3))
| ~ differ(X2,table)
| ~ differ(a,X1)
| ~ differ(d,X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_25]) ).
cnf(c_0_43,plain,
( ~ holds(empty,X3)
| ~ holds(clear(X2),X3)
| ~ holds(on(X2,X1),X3)
| holds(clear(X1),do(pickup(X2),X3)) ),
c_0_41 ).
cnf(c_0_44,negated_conjecture,
( ~ holds(empty,X3)
| ~ holds(clear(X2),X3)
| ~ holds(on(X2,d),X3)
| ~ holds(clear(X1),do(pickup(X2),X3))
| ~ holds(clear(a),do(pickup(X2),X3))
| ~ differ(X2,table)
| ~ differ(a,X1)
| ~ differ(d,X1) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_45,negated_conjecture,
( ~ holds(empty,X3)
| ~ holds(clear(X2),X3)
| ~ holds(clear(a),X3)
| ~ holds(on(X2,d),X3)
| ~ holds(clear(X1),do(pickup(X2),X3))
| ~ differ(a,X2)
| ~ differ(X2,table)
| ~ differ(a,X1)
| ~ differ(d,X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_31]) ).
cnf(c_0_46,axiom,
holds(clear(table),X1),
clear_table ).
cnf(c_0_47,axiom,
differ(d,table),
differ_d_table ).
cnf(c_0_48,negated_conjecture,
( ~ holds(empty,X2)
| ~ holds(clear(X1),X2)
| ~ holds(clear(a),X2)
| ~ holds(on(X1,d),X2)
| ~ differ(a,X1)
| ~ differ(X1,table) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),c_0_26])]) ).
cnf(c_0_49,axiom,
holds(on(c,d),s0),
initial_state3 ).
cnf(c_0_50,axiom,
differ(c,table),
differ_c_table ).
cnf(c_0_51,axiom,
differ(a,c),
differ_a_c ).
cnf(c_0_52,axiom,
holds(clear(a),s0),
initial_state5 ).
cnf(c_0_53,axiom,
holds(clear(c),s0),
initial_state7 ).
cnf(c_0_54,axiom,
holds(empty,s0),
initial_state8 ).
cnf(c_0_55,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]),c_0_51]),c_0_52]),c_0_53]),c_0_54])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PLA007-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n004.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 03:31:35 UTC 2026
% 0.04/0.36 % CPUTime :
% 0.04/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.40 Running first-order theorem proving
% 0.04/0.40 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.04/0.43 % Version: 3.5.1
% 0.04/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.04/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.04/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.04/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.04/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.04/0.43 % Starting sh5l with 300s (1) cores
% 0.04/0.43 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2154150 completed with status 0
% 0.04/0.43 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.04/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.04/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.04/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.04/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.04/0.43 % No SInE strategy applied
% 0.04/0.43 % Search class: FHUNF-FFMM21-SFFFFFNN
% 0.04/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.04/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.04/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.04/0.43 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.04/0.43 % Starting new_bool_3 with 136s (1) cores
% 0.04/0.43 % Starting new_bool_1 with 136s (1) cores
% 0.04/0.43 % SubtermCWHack with pid 2154155 completed with status 0
% 0.04/0.43 % Result found by SubtermCWHack
% 0.04/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.04/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.04/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.04/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.04/0.43 % No SInE strategy applied
% 0.04/0.43 % Search class: FHUNF-FFMM21-SFFFFFNN
% 0.04/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.04/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.04/0.43 % Preprocessing time : 0.001 s
% 0.04/0.43
% 0.04/0.43 % Proof found!
% 0.04/0.43 % SZS status Unsatisfiable
% 0.04/0.43 % SZS output start CNFRefutation
% See solution above
% 0.04/0.43 % Parsed axioms : 31
% 0.04/0.43 % Removed by relevancy pruning/SinE : 0
% 0.04/0.43 % Initial clauses : 31
% 0.04/0.43 % Removed in clause preprocessing : 0
% 0.04/0.43 % Initial clauses in saturation : 31
% 0.04/0.43 % Processed clauses : 111
% 0.04/0.43 % ...of these trivial : 0
% 0.04/0.43 % ...subsumed : 12
% 0.04/0.43 % ...remaining for further processing : 99
% 0.04/0.43 % Other redundant clauses eliminated : 0
% 0.04/0.43 % Clauses deleted for lack of memory : 0
% 0.04/0.43 % Backward-subsumed : 7
% 0.04/0.43 % Backward-rewritten : 0
% 0.04/0.43 % Generated clauses : 115
% 0.04/0.43 % ...of the previous two non-redundant : 101
% 0.04/0.43 % ...aggressively subsumed : 0
% 0.04/0.43 % Contextual simplify-reflections : 7
% 0.04/0.43 % Paramodulations : 115
% 0.04/0.43 % Factorizations : 0
% 0.04/0.43 % NegExts : 0
% 0.04/0.43 % Equation resolutions : 0
% 0.04/0.43 % Disequality decompositions : 0
% 0.04/0.43 % Total rewrite steps : 38
% 0.04/0.43 % ...of those cached : 24
% 0.04/0.43 % Propositional unsat checks : 0
% 0.04/0.43 % Propositional check models : 0
% 0.04/0.43 % Propositional check unsatisfiable : 0
% 0.04/0.43 % Propositional clauses : 0
% 0.04/0.43 % Propositional clauses after purity: 0
% 0.04/0.43 % Propositional unsat core size : 0
% 0.04/0.43 % Propositional preprocessing time : 0.000
% 0.04/0.43 % Propositional encoding time : 0.000
% 0.04/0.43 % Propositional solver time : 0.000
% 0.04/0.43 % Success case prop preproc time : 0.000
% 0.04/0.43 % Success case prop encoding time : 0.000
% 0.04/0.43 % Success case prop solver time : 0.000
% 0.04/0.43 % Current number of processed clauses : 92
% 0.04/0.43 % Positive orientable unit clauses : 29
% 0.04/0.43 % Positive unorientable unit clauses: 0
% 0.04/0.43 % Negative unit clauses : 3
% 0.04/0.43 % Non-unit-clauses : 60
% 0.04/0.43 % Current number of unprocessed clauses: 15
% 0.04/0.43 % ...number of literals in the above : 117
% 0.04/0.43 % Current number of archived formulas : 0
% 0.04/0.43 % Current number of archived clauses : 7
% 0.04/0.43 % Clause-clause subsumption calls (NU) : 5787
% 0.04/0.43 % Rec. Clause-clause subsumption calls : 305
% 0.04/0.43 % Non-unit clause-clause subsumptions : 22
% 0.04/0.43 % Unit Clause-clause subsumption calls : 92
% 0.04/0.43 % Rewrite failures with RHS unbound : 0
% 0.04/0.43 % BW rewrite match attempts : 0
% 0.04/0.43 % BW rewrite match successes : 0
% 0.04/0.43 % Condensation attempts : 0
% 0.04/0.43 % Condensation successes : 0
% 0.04/0.43 % Termbank termtop insertions : 4802
% 0.04/0.43 % Search garbage collected termcells : 55
% 0.04/0.43
% 0.04/0.43 % -------------------------------------------------
% 0.04/0.43 % User time : 0.005 s
% 0.04/0.43 % System time : 0.005 s
% 0.04/0.43 % Total time : 0.010 s
% 0.04/0.43 % Maximum resident set size: 3660 pages
% 0.04/0.43
% 0.04/0.43 % -------------------------------------------------
% 0.04/0.43 % User time : 0.026 s
% 0.04/0.43 % System time : 0.017 s
% 0.04/0.43 % Total time : 0.043 s
% 0.04/0.43 % Maximum resident set size: 4608 pages
% 0.04/0.43 % E exiting
%------------------------------------------------------------------------------