%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PLA016-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n013.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.24s 0.55s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 17
% Syntax : Number of clauses : 52 ( 24 unt; 0 nHn; 47 RR)
% Number of literals : 139 ( 0 equ; 100 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 : 84 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_DA,negated_conjecture,
~ holds(on(d,a),X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_DA) ).
cnf(putdown_2,axiom,
( ~ holds(clear(X2),X3)
| ~ holds(holding(X1),X3)
| holds(on(X1,X2),do(putdown(X1,X2),X3)) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/PLA001-0.ax',pickup_1) ).
cnf(differ_d_table,axiom,
differ(d,table),
file('/export/starexec/sandbox/benchmark/Axioms/PLA001-1.ax',differ_d_table) ).
cnf(pickup_4,axiom,
( ~ differ(X1,X2)
| ~ holds(clear(X1),X3)
| holds(clear(X1),do(pickup(X2),X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/PLA001-0.ax',pickup_4) ).
cnf(differ_a_d,axiom,
differ(a,d),
file('/export/starexec/sandbox/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/sandbox/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/sandbox/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/sandbox/benchmark/Axioms/PLA001-0.ax',pickup_2) ).
cnf(clear_table,axiom,
holds(clear(table),X1),
file('/export/starexec/sandbox/benchmark/Axioms/PLA001-1.ax',clear_table) ).
cnf(differ_a_table,axiom,
differ(a,table),
file('/export/starexec/sandbox/benchmark/Axioms/PLA001-1.ax',differ_a_table) ).
cnf(initial_state3,axiom,
holds(on(c,d),s0),
file('/export/starexec/sandbox/benchmark/Axioms/PLA001-1.ax',initial_state3) ).
cnf(differ_a_c,axiom,
differ(a,c),
file('/export/starexec/sandbox/benchmark/Axioms/PLA001-1.ax',differ_a_c) ).
cnf(differ_c_table,axiom,
differ(c,table),
file('/export/starexec/sandbox/benchmark/Axioms/PLA001-1.ax',differ_c_table) ).
cnf(initial_state5,axiom,
holds(clear(a),s0),
file('/export/starexec/sandbox/benchmark/Axioms/PLA001-1.ax',initial_state5) ).
cnf(initial_state7,axiom,
holds(clear(c),s0),
file('/export/starexec/sandbox/benchmark/Axioms/PLA001-1.ax',initial_state7) ).
cnf(initial_state8,axiom,
holds(empty,s0),
file('/export/starexec/sandbox/benchmark/Axioms/PLA001-1.ax',initial_state8) ).
cnf(c_0_17,negated_conjecture,
~ holds(on(d,a),X1),
inference(fof_simplification,[status(thm)],[prove_DA]) ).
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(d,a),X1),
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,
( ~ 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_22,negated_conjecture,
( ~ holds(clear(a),X1)
| ~ holds(holding(d),X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
( ~ differ(X1,table)
| ~ holds(clear(X1),X2)
| ~ holds(empty,X2)
| holds(holding(X1),do(pickup(X1),X2)) ),
c_0_21 ).
cnf(c_0_24,axiom,
differ(d,table),
differ_d_table ).
cnf(c_0_25,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_26,negated_conjecture,
( ~ holds(empty,X1)
| ~ holds(clear(d),X1)
| ~ holds(clear(a),do(pickup(d),X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_27,plain,
( ~ differ(X1,X2)
| ~ holds(clear(X1),X3)
| holds(clear(X1),do(pickup(X2),X3)) ),
c_0_25 ).
cnf(c_0_28,axiom,
differ(a,d),
differ_a_d ).
cnf(c_0_29,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_30,negated_conjecture,
( ~ holds(empty,X1)
| ~ holds(clear(a),X1)
| ~ holds(clear(d),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_31,plain,
( ~ differ(X1,X3)
| ~ holds(clear(X1),X4)
| holds(clear(X1),do(putdown(X2,X3),X4)) ),
c_0_29 ).
cnf(c_0_32,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_30,c_0_31]) ).
cnf(c_0_33,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_34,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_32,c_0_31]) ).
cnf(c_0_35,plain,
( ~ holds(clear(X2),X3)
| ~ holds(holding(X1),X3)
| holds(empty,do(putdown(X1,X2),X3)) ),
c_0_33 ).
cnf(c_0_36,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_37,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_34,c_0_35]) ).
cnf(c_0_38,plain,
( ~ holds(empty,X3)
| ~ holds(clear(X2),X3)
| ~ holds(on(X2,X1),X3)
| holds(clear(X1),do(pickup(X2),X3)) ),
c_0_36 ).
cnf(c_0_39,negated_conjecture,
( ~ holds(empty,X3)
| ~ holds(clear(X2),X3)
| ~ holds(on(X2,d),X3)
| ~ holds(clear(X1),do(pickup(X2),X3))
| ~ holds(holding(X4),do(pickup(X2),X3))
| ~ holds(clear(a),do(pickup(X2),X3))
| ~ differ(a,X1)
| ~ differ(d,X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_40,negated_conjecture,
( ~ holds(empty,X4)
| ~ holds(clear(X2),X4)
| ~ holds(clear(a),X4)
| ~ holds(on(X2,d),X4)
| ~ holds(clear(X1),do(pickup(X2),X4))
| ~ holds(holding(X3),do(pickup(X2),X4))
| ~ differ(a,X2)
| ~ differ(a,X1)
| ~ differ(d,X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_27]) ).
cnf(c_0_41,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(X2,table)
| ~ differ(a,X2)
| ~ differ(a,X1)
| ~ differ(d,X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_23]) ).
cnf(c_0_42,axiom,
holds(clear(table),X1),
clear_table ).
cnf(c_0_43,axiom,
differ(a,table),
differ_a_table ).
cnf(c_0_44,negated_conjecture,
( ~ holds(empty,X2)
| ~ holds(clear(X1),X2)
| ~ holds(clear(a),X2)
| ~ holds(on(X1,d),X2)
| ~ differ(X1,table)
| ~ differ(a,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_24]),c_0_43])]) ).
cnf(c_0_45,axiom,
holds(on(c,d),s0),
initial_state3 ).
cnf(c_0_46,axiom,
differ(a,c),
differ_a_c ).
cnf(c_0_47,axiom,
differ(c,table),
differ_c_table ).
cnf(c_0_48,axiom,
holds(clear(a),s0),
initial_state5 ).
cnf(c_0_49,axiom,
holds(clear(c),s0),
initial_state7 ).
cnf(c_0_50,axiom,
holds(empty,s0),
initial_state8 ).
cnf(c_0_51,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_44,c_0_45]),c_0_46]),c_0_47]),c_0_48]),c_0_49]),c_0_50])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : PLA016-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.43 % Computer : n013.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Mon Sep 21 03:31:51 UTC 2026
% 0.17/0.43 % CPUTime :
% 0.17/0.43 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.50 Running first-order theorem proving
% 0.24/0.50 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.24/0.55 % Version: 3.5.1
% 0.24/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.55 % Starting sh5l with 300s (1) cores
% 0.24/0.55 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4052658 completed with status 0
% 0.24/0.55 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.24/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.55 % No SInE strategy applied
% 0.24/0.55 % Search class: FHUNF-FFMM21-SFFFFFNN
% 0.24/0.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.55 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.24/0.55 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.24/0.55 % Starting new_bool_3 with 136s (1) cores
% 0.24/0.55 % Starting new_bool_1 with 136s (1) cores
% 0.24/0.55 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4052664 completed with status 0
% 0.24/0.55 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.24/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.55 % No SInE strategy applied
% 0.24/0.55 % Search class: FHUNF-FFMM21-SFFFFFNN
% 0.24/0.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.55 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.24/0.55 % Preprocessing time : 0.001 s
% 0.24/0.55 % Presaturation interreduction done
% 0.24/0.55
% 0.24/0.55 % Proof found!
% 0.24/0.55 % SZS status Unsatisfiable
% 0.24/0.55 % SZS output start CNFRefutation
% See solution above
% 0.24/0.55 % Parsed axioms : 31
% 0.24/0.55 % Removed by relevancy pruning/SinE : 0
% 0.24/0.55 % Initial clauses : 31
% 0.24/0.55 % Removed in clause preprocessing : 0
% 0.24/0.55 % Initial clauses in saturation : 31
% 0.24/0.55 % Processed clauses : 194
% 0.24/0.55 % ...of these trivial : 0
% 0.24/0.55 % ...subsumed : 26
% 0.24/0.55 % ...remaining for further processing : 168
% 0.24/0.55 % Other redundant clauses eliminated : 0
% 0.24/0.55 % Clauses deleted for lack of memory : 0
% 0.24/0.55 % Backward-subsumed : 8
% 0.24/0.55 % Backward-rewritten : 0
% 0.24/0.55 % Generated clauses : 173
% 0.24/0.55 % ...of the previous two non-redundant : 159
% 0.24/0.55 % ...aggressively subsumed : 0
% 0.24/0.55 % Contextual simplify-reflections : 13
% 0.24/0.55 % Paramodulations : 173
% 0.24/0.55 % Factorizations : 0
% 0.24/0.55 % NegExts : 0
% 0.24/0.55 % Equation resolutions : 0
% 0.24/0.55 % Disequality decompositions : 0
% 0.24/0.55 % Total rewrite steps : 44
% 0.24/0.55 % ...of those cached : 30
% 0.24/0.55 % Propositional unsat checks : 0
% 0.24/0.55 % Propositional check models : 0
% 0.24/0.55 % Propositional check unsatisfiable : 0
% 0.24/0.55 % Propositional clauses : 0
% 0.24/0.55 % Propositional clauses after purity: 0
% 0.24/0.55 % Propositional unsat core size : 0
% 0.24/0.55 % Propositional preprocessing time : 0.000
% 0.24/0.55 % Propositional encoding time : 0.000
% 0.24/0.55 % Propositional solver time : 0.000
% 0.24/0.55 % Success case prop preproc time : 0.000
% 0.24/0.55 % Success case prop encoding time : 0.000
% 0.24/0.55 % Success case prop solver time : 0.000
% 0.24/0.55 % Current number of processed clauses : 129
% 0.24/0.55 % Positive orientable unit clauses : 29
% 0.24/0.55 % Positive unorientable unit clauses: 0
% 0.24/0.55 % Negative unit clauses : 3
% 0.24/0.55 % Non-unit-clauses : 97
% 0.24/0.55 % Current number of unprocessed clauses: 19
% 0.24/0.55 % ...number of literals in the above : 146
% 0.24/0.55 % Current number of archived formulas : 0
% 0.24/0.55 % Current number of archived clauses : 39
% 0.24/0.55 % Clause-clause subsumption calls (NU) : 15097
% 0.24/0.55 % Rec. Clause-clause subsumption calls : 571
% 0.24/0.55 % Non-unit clause-clause subsumptions : 42
% 0.24/0.55 % Unit Clause-clause subsumption calls : 160
% 0.24/0.55 % Rewrite failures with RHS unbound : 0
% 0.24/0.55 % BW rewrite match attempts : 0
% 0.24/0.55 % BW rewrite match successes : 0
% 0.24/0.55 % Condensation attempts : 0
% 0.24/0.55 % Condensation successes : 0
% 0.24/0.55 % Termbank termtop insertions : 7902
% 0.24/0.55 % Search garbage collected termcells : 55
% 0.24/0.55
% 0.24/0.55 % -------------------------------------------------
% 0.24/0.55 % User time : 0.021 s
% 0.24/0.55 % System time : 0.002 s
% 0.24/0.55 % Total time : 0.023 s
% 0.24/0.55 % Maximum resident set size: 3660 pages
% 0.24/0.55
% 0.24/0.55 % -------------------------------------------------
% 0.24/0.55 % User time : 0.082 s
% 0.24/0.55 % System time : 0.020 s
% 0.24/0.55 % Total time : 0.102 s
% 0.24/0.55 % Maximum resident set size: 4864 pages
% 0.24/0.55 % E exiting
%------------------------------------------------------------------------------