%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : ROB014-2 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n002.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 02:06:44 PM UTC 2026
% Result : Unsatisfiable 1.67s 0.68s
% Output : CNFRefutation 1.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 27 ( 21 unt; 0 nHn; 15 RR)
% Number of literals : 33 ( 32 equ; 10 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 43 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(lemma_3_2,axiom,
( negate(add(X1,negate(add(X2,X3)))) != negate(add(X2,negate(add(X1,X3))))
| X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_3_2) ).
cnf(commutativity_of_add,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/ROB001-0.ax',commutativity_of_add) ).
cnf(robbins_axiom,axiom,
negate(add(negate(add(X1,X2)),negate(add(X1,negate(X2))))) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/ROB001-0.ax',robbins_axiom) ).
cnf(condition,hypothesis,
negate(add(negate(e),negate(add(d,negate(e))))) = d,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condition) ).
cnf(associativity_of_add,axiom,
add(add(X1,X2),X3) = add(X1,add(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/ROB001-0.ax',associativity_of_add) ).
cnf(prove_base_step,negated_conjecture,
negate(add(e,multiply(one,add(d,negate(add(d,negate(e))))))) != negate(e),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_base_step) ).
cnf(one_times_x,axiom,
multiply(one,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/ROB001-1.ax',one_times_x) ).
cnf(c_0_7,plain,
( negate(add(X1,negate(add(X2,X3)))) != negate(add(X2,negate(add(X1,X3))))
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[lemma_3_2]) ).
cnf(c_0_8,plain,
( negate(add(X1,negate(add(X2,X3)))) != negate(add(X2,negate(add(X1,X3))))
| X1 = X2 ),
c_0_7 ).
cnf(c_0_9,axiom,
add(X1,X2) = add(X2,X1),
commutativity_of_add ).
cnf(c_0_10,axiom,
negate(add(negate(add(X1,X2)),negate(add(X1,negate(X2))))) = X1,
robbins_axiom ).
cnf(c_0_11,plain,
( negate(add(X1,negate(add(X2,X3)))) != negate(add(X2,negate(add(X3,X1))))
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
negate(add(negate(add(X1,X2)),negate(add(negate(X2),X1)))) = X1,
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_13,hypothesis,
negate(add(negate(e),negate(add(d,negate(e))))) = d,
condition ).
cnf(c_0_14,axiom,
add(add(X1,X2),X3) = add(X1,add(X2,X3)),
associativity_of_add ).
cnf(c_0_15,negated_conjecture,
negate(add(e,multiply(one,add(d,negate(add(d,negate(e))))))) != negate(e),
inference(fof_simplification,[status(thm)],[prove_base_step]) ).
cnf(c_0_16,plain,
( negate(add(X1,negate(add(X3,X2)))) != negate(add(X2,negate(add(X3,X1))))
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_11,c_0_9]) ).
cnf(c_0_17,hypothesis,
negate(add(d,negate(add(e,negate(add(d,negate(e))))))) = negate(add(d,negate(e))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_9]),c_0_9]) ).
cnf(c_0_18,plain,
add(X1,add(X2,X3)) = add(X2,add(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_9]),c_0_14]) ).
cnf(c_0_19,plain,
negate(add(negate(add(X1,X2)),negate(add(X2,negate(X1))))) = X2,
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_20,negated_conjecture,
negate(add(e,multiply(one,add(d,negate(add(d,negate(e))))))) != negate(e),
c_0_15 ).
cnf(c_0_21,axiom,
multiply(one,X1) = X1,
one_times_x ).
cnf(c_0_22,plain,
( negate(add(negate(add(X3,X1)),X2)) != negate(add(X1,negate(add(X3,X2))))
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_16,c_0_9]) ).
cnf(c_0_23,hypothesis,
negate(add(negate(add(d,negate(e))),negate(add(e,add(d,negate(add(d,negate(e)))))))) = d,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_17]),c_0_18]),c_0_9]) ).
cnf(c_0_24,plain,
negate(add(X1,negate(add(X2,add(X1,negate(add(X1,negate(X2)))))))) = negate(add(X1,negate(X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_19]),c_0_9]),c_0_14]),c_0_9]) ).
cnf(c_0_25,negated_conjecture,
negate(add(e,add(d,negate(add(d,negate(e)))))) != negate(e),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_13])]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ROB014-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n002.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 04:26:01 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 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
% 1.67/0.68 % Version: 3.5.1
% 1.67/0.68 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.67/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.67/0.68 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.67/0.68 % Starting new_bool_3 with 300s (1) cores
% 1.67/0.68 % Starting new_bool_1 with 300s (1) cores
% 1.67/0.68 % Starting sh5l with 300s (1) cores
% 1.67/0.68 % new_bool_3 with pid 2422653 completed with status 0
% 1.67/0.68 % Result found by new_bool_3
% 1.67/0.68 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.67/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.67/0.68 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.67/0.68 % Starting new_bool_3 with 300s (1) cores
% 1.67/0.68 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.67/0.68 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.67/0.68 % Search class: FHUSM-FFSF21-DFFFFFNN
% 1.67/0.68 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.67/0.68 % Starting SubtermCWHack with 31s (1) cores
% 1.67/0.68 % SubtermCWHack with pid 2422660 completed with status 0
% 1.67/0.68 % Result found by SubtermCWHack
% 1.67/0.68 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.67/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.67/0.68 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.67/0.68 % Starting new_bool_3 with 300s (1) cores
% 1.67/0.68 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.67/0.68 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.67/0.68 % Search class: FHUSM-FFSF21-DFFFFFNN
% 1.67/0.68 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.67/0.68 % Starting SubtermCWHack with 31s (1) cores
% 1.67/0.68 % Preprocessing time : 0.002 s
% 1.67/0.68
% 1.67/0.68 % Proof found!
% 1.67/0.68 % SZS status Unsatisfiable
% 1.67/0.68 % SZS output start CNFRefutation
% See solution above
% 1.67/0.68 % Parsed axioms : 11
% 1.67/0.68 % Removed by relevancy pruning/SinE : 2
% 1.67/0.68 % Initial clauses : 9
% 1.67/0.68 % Removed in clause preprocessing : 0
% 1.67/0.68 % Initial clauses in saturation : 9
% 1.67/0.68 % Processed clauses : 459
% 1.67/0.68 % ...of these trivial : 232
% 1.67/0.68 % ...subsumed : 143
% 1.67/0.68 % ...remaining for further processing : 84
% 1.67/0.68 % Other redundant clauses eliminated : 1
% 1.67/0.68 % Clauses deleted for lack of memory : 0
% 1.67/0.68 % Backward-subsumed : 0
% 1.67/0.68 % Backward-rewritten : 0
% 1.67/0.68 % Generated clauses : 8346
% 1.67/0.68 % ...of the previous two non-redundant : 8059
% 1.67/0.68 % ...aggressively subsumed : 0
% 1.67/0.68 % Contextual simplify-reflections : 0
% 1.67/0.68 % Paramodulations : 8338
% 1.67/0.68 % Factorizations : 0
% 1.67/0.68 % NegExts : 0
% 1.67/0.68 % Equation resolutions : 8
% 1.67/0.68 % Disequality decompositions : 0
% 1.67/0.68 % Total rewrite steps : 4603
% 1.67/0.68 % ...of those cached : 2687
% 1.67/0.68 % Propositional unsat checks : 0
% 1.67/0.68 % Propositional check models : 0
% 1.67/0.68 % Propositional check unsatisfiable : 0
% 1.67/0.68 % Propositional clauses : 0
% 1.67/0.68 % Propositional clauses after purity: 0
% 1.67/0.68 % Propositional unsat core size : 0
% 1.67/0.68 % Propositional preprocessing time : 0.000
% 1.67/0.68 % Propositional encoding time : 0.000
% 1.67/0.68 % Propositional solver time : 0.000
% 1.67/0.68 % Success case prop preproc time : 0.000
% 1.67/0.68 % Success case prop encoding time : 0.000
% 1.67/0.68 % Success case prop solver time : 0.000
% 1.67/0.68 % Current number of processed clauses : 83
% 1.67/0.68 % Positive orientable unit clauses : 59
% 1.67/0.68 % Positive unorientable unit clauses: 4
% 1.67/0.68 % Negative unit clauses : 1
% 1.67/0.68 % Non-unit-clauses : 19
% 1.67/0.68 % Current number of unprocessed clauses: 7496
% 1.67/0.68 % ...number of literals in the above : 10024
% 1.67/0.68 % Current number of archived formulas : 0
% 1.67/0.68 % Current number of archived clauses : 0
% 1.67/0.68 % Clause-clause subsumption calls (NU) : 351
% 1.67/0.68 % Rec. Clause-clause subsumption calls : 351
% 1.67/0.68 % Non-unit clause-clause subsumptions : 54
% 1.67/0.68 % Unit Clause-clause subsumption calls : 6
% 1.67/0.68 % Rewrite failures with RHS unbound : 0
% 1.67/0.68 % BW rewrite match attempts : 1294
% 1.67/0.68 % BW rewrite match successes : 12
% 1.67/0.68 % Condensation attempts : 0
% 1.67/0.68 % Condensation successes : 0
% 1.67/0.68 % Termbank termtop insertions : 168779
% 1.67/0.68 % Search garbage collected termcells : 23
% 1.67/0.68
% 1.67/0.68 % -------------------------------------------------
% 1.67/0.68 % User time : 0.207 s
% 1.67/0.68 % System time : 0.015 s
% 1.67/0.68 % Total time : 0.222 s
% 1.67/0.68 % Maximum resident set size: 3644 pages
% 1.67/0.68
% 1.67/0.68 % -------------------------------------------------
% 1.67/0.68 % User time : 0.210 s
% 1.67/0.68 % System time : 0.020 s
% 1.67/0.68 % Total time : 0.230 s
% 1.67/0.68 % Maximum resident set size: 4608 pages
% 1.67/0.68 % E exiting
%------------------------------------------------------------------------------