%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PLA022-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 : n006.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:51 PM UTC 2026
% Result : Unsatisfiable 0.15s 0.50s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 14
% Syntax : Number of clauses : 44 ( 17 unt; 0 nHn; 41 RR)
% Number of literals : 97 ( 0 equ; 62 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 : 75 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_ACD,negated_conjecture,
~ holds(and(on(a,c),on(c,d)),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ACD) ).
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_c,axiom,
differ(a,c),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',differ_a_c) ).
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(initial_state3,axiom,
holds(on(c,d),s0),
file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',initial_state3) ).
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_14,negated_conjecture,
~ holds(and(on(a,c),on(c,d)),X1),
inference(fof_simplification,[status(thm)],[prove_ACD]) ).
cnf(c_0_15,plain,
( ~ holds(X2,X3)
| ~ holds(X1,X3)
| holds(and(X1,X2),X3) ),
inference(fof_simplification,[status(thm)],[and_definition]) ).
cnf(c_0_16,negated_conjecture,
~ holds(and(on(a,c),on(c,d)),X1),
c_0_14 ).
cnf(c_0_17,plain,
( ~ holds(X2,X3)
| ~ holds(X1,X3)
| holds(and(X1,X2),X3) ),
c_0_15 ).
cnf(c_0_18,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_19,negated_conjecture,
( ~ holds(on(a,c),X1)
| ~ holds(on(c,d),X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
( ~ holds(clear(X2),X3)
| ~ holds(holding(X1),X3)
| holds(on(X1,X2),do(putdown(X1,X2),X3)) ),
c_0_18 ).
cnf(c_0_21,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_22,negated_conjecture,
( ~ holds(clear(c),X1)
| ~ holds(holding(a),X1)
| ~ holds(on(c,d),do(putdown(a,c),X1)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
( ~ holds(on(X1,X2),X5)
| holds(on(X1,X2),do(putdown(X3,X4),X5)) ),
c_0_21 ).
cnf(c_0_24,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_25,plain,
( ~ differ(X2,X1)
| differ(X1,X2) ),
inference(fof_simplification,[status(thm)],[symmetry_of_differ]) ).
cnf(c_0_26,negated_conjecture,
( ~ holds(clear(c),X1)
| ~ holds(holding(a),X1)
| ~ holds(on(c,d),X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
( ~ differ(X1,table)
| ~ holds(clear(X1),X2)
| ~ holds(empty,X2)
| holds(holding(X1),do(pickup(X1),X2)) ),
c_0_24 ).
cnf(c_0_28,axiom,
differ(a,table),
differ_a_table ).
cnf(c_0_29,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_30,plain,
( ~ differ(X2,X1)
| differ(X1,X2) ),
c_0_25 ).
cnf(c_0_31,axiom,
differ(a,c),
differ_a_c ).
cnf(c_0_32,negated_conjecture,
( ~ holds(empty,X1)
| ~ holds(clear(a),X1)
| ~ holds(clear(c),do(pickup(a),X1))
| ~ holds(on(c,d),do(pickup(a),X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
cnf(c_0_33,plain,
( ~ differ(X1,X3)
| ~ holds(on(X1,X2),X4)
| holds(on(X1,X2),do(pickup(X3),X4)) ),
c_0_29 ).
cnf(c_0_34,plain,
differ(c,a),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,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_36,negated_conjecture,
( ~ holds(empty,X1)
| ~ holds(clear(a),X1)
| ~ holds(on(c,d),X1)
| ~ holds(clear(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_37,plain,
( ~ differ(X1,X2)
| ~ holds(clear(X1),X3)
| holds(clear(X1),do(pickup(X2),X3)) ),
c_0_35 ).
cnf(c_0_38,negated_conjecture,
( ~ holds(empty,X1)
| ~ holds(clear(c),X1)
| ~ holds(clear(a),X1)
| ~ holds(on(c,d),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_34])]) ).
cnf(c_0_39,axiom,
holds(on(c,d),s0),
initial_state3 ).
cnf(c_0_40,axiom,
holds(clear(a),s0),
initial_state5 ).
cnf(c_0_41,axiom,
holds(clear(c),s0),
initial_state7 ).
cnf(c_0_42,axiom,
holds(empty,s0),
initial_state8 ).
cnf(c_0_43,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_38,c_0_39]),c_0_40]),c_0_41]),c_0_42])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PLA022-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.11/0.37 % Computer : n006.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 03:31:57 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.44 Running first-order theorem proving
% 0.15/0.44 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.15/0.50 % Version: 3.5.1
% 0.15/0.50 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.50 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.50 % Starting sh5l with 300s (1) cores
% 0.15/0.50 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1920838 completed with status 0
% 0.15/0.50 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.50 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.50 % No SInE strategy applied
% 0.15/0.50 % Search class: FHUNF-FFMM21-SFFFFFNN
% 0.15/0.50 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.50 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.50 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.15/0.50 % Starting new_bool_3 with 136s (1) cores
% 0.15/0.50 % Starting new_bool_1 with 136s (1) cores
% 0.15/0.50 % SubtermCWHack with pid 1920842 completed with status 0
% 0.15/0.50 % Result found by SubtermCWHack
% 0.15/0.50 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.50 % No SInE strategy applied
% 0.15/0.50 % Search class: FHUNF-FFMM21-SFFFFFNN
% 0.15/0.50 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.50 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.50 % Preprocessing time : 0.002 s
% 0.15/0.50
% 0.15/0.50 % Proof found!
% 0.15/0.50 % SZS status Unsatisfiable
% 0.15/0.50 % SZS output start CNFRefutation
% See solution above
% 0.15/0.50 % Parsed axioms : 31
% 0.15/0.50 % Removed by relevancy pruning/SinE : 0
% 0.15/0.50 % Initial clauses : 31
% 0.15/0.50 % Removed in clause preprocessing : 0
% 0.15/0.50 % Initial clauses in saturation : 31
% 0.15/0.50 % Processed clauses : 57
% 0.15/0.50 % ...of these trivial : 0
% 0.15/0.50 % ...subsumed : 3
% 0.15/0.50 % ...remaining for further processing : 54
% 0.15/0.50 % Other redundant clauses eliminated : 0
% 0.15/0.50 % Clauses deleted for lack of memory : 0
% 0.15/0.50 % Backward-subsumed : 0
% 0.15/0.50 % Backward-rewritten : 0
% 0.15/0.50 % Generated clauses : 44
% 0.15/0.50 % ...of the previous two non-redundant : 30
% 0.15/0.50 % ...aggressively subsumed : 0
% 0.15/0.50 % Contextual simplify-reflections : 1
% 0.15/0.50 % Paramodulations : 44
% 0.15/0.50 % Factorizations : 0
% 0.15/0.50 % NegExts : 0
% 0.15/0.50 % Equation resolutions : 0
% 0.15/0.50 % Disequality decompositions : 0
% 0.15/0.50 % Total rewrite steps : 20
% 0.15/0.50 % ...of those cached : 5
% 0.15/0.50 % Propositional unsat checks : 0
% 0.15/0.50 % Propositional check models : 0
% 0.15/0.50 % Propositional check unsatisfiable : 0
% 0.15/0.50 % Propositional clauses : 0
% 0.15/0.50 % Propositional clauses after purity: 0
% 0.15/0.50 % Propositional unsat core size : 0
% 0.15/0.50 % Propositional preprocessing time : 0.000
% 0.15/0.50 % Propositional encoding time : 0.000
% 0.15/0.50 % Propositional solver time : 0.000
% 0.15/0.50 % Success case prop preproc time : 0.000
% 0.15/0.50 % Success case prop encoding time : 0.000
% 0.15/0.50 % Success case prop solver time : 0.000
% 0.15/0.50 % Current number of processed clauses : 54
% 0.15/0.50 % Positive orientable unit clauses : 29
% 0.15/0.50 % Positive unorientable unit clauses: 0
% 0.15/0.50 % Negative unit clauses : 1
% 0.15/0.50 % Non-unit-clauses : 24
% 0.15/0.50 % Current number of unprocessed clauses: 4
% 0.15/0.50 % ...number of literals in the above : 17
% 0.15/0.50 % Current number of archived formulas : 0
% 0.15/0.50 % Current number of archived clauses : 0
% 0.15/0.50 % Clause-clause subsumption calls (NU) : 205
% 0.15/0.50 % Rec. Clause-clause subsumption calls : 62
% 0.15/0.50 % Non-unit clause-clause subsumptions : 4
% 0.15/0.50 % Unit Clause-clause subsumption calls : 0
% 0.15/0.50 % Rewrite failures with RHS unbound : 0
% 0.15/0.50 % BW rewrite match attempts : 0
% 0.15/0.50 % BW rewrite match successes : 0
% 0.15/0.50 % Condensation attempts : 0
% 0.15/0.50 % Condensation successes : 0
% 0.15/0.50 % Termbank termtop insertions : 1659
% 0.15/0.50 % Search garbage collected termcells : 55
% 0.15/0.50
% 0.15/0.50 % -------------------------------------------------
% 0.15/0.50 % User time : 0.011 s
% 0.15/0.50 % System time : 0.004 s
% 0.15/0.50 % Total time : 0.014 s
% 0.15/0.50 % Maximum resident set size: 3660 pages
% 0.15/0.50
% 0.15/0.50 % -------------------------------------------------
% 0.15/0.50 % User time : 0.033 s
% 0.15/0.50 % System time : 0.020 s
% 0.15/0.50 % Total time : 0.052 s
% 0.15/0.50 % Maximum resident set size: 4864 pages
% 0.15/0.50 % E exiting
%------------------------------------------------------------------------------