%------------------------------------------------------------------------------
% File : E---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 : n019.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:40 PM UTC 2026
% Result : Unsatisfiable 0.82s 0.59s
% Output : CNFRefutation 0.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 32 ( 23 unt; 0 nHn; 20 RR)
% Number of literals : 44 ( 37 equ; 17 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 10 ( 3 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 51 ( 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(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(commutativity_of_add,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/ROB001-0.ax',commutativity_of_add) ).
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(lemma_3_4,axiom,
( ~ positive_integer(X4)
| negate(add(X1,negate(X2))) != X3
| negate(add(X1,negate(add(X2,multiply(X4,add(X1,X3)))))) = X3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_3_4) ).
cnf(one_times_x,axiom,
multiply(one,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/ROB001-1.ax',one_times_x) ).
cnf(one,axiom,
positive_integer(one),
file('/export/starexec/sandbox2/benchmark/Axioms/ROB001-1.ax',one) ).
cnf(c_0_9,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_10,axiom,
negate(add(negate(add(X1,X2)),negate(add(X1,negate(X2))))) = X1,
robbins_axiom ).
cnf(c_0_11,axiom,
add(X1,X2) = add(X2,X1),
commutativity_of_add ).
cnf(c_0_12,plain,
( negate(add(X1,negate(add(X2,X3)))) != negate(add(X2,negate(add(X1,X3))))
| X1 = X2 ),
c_0_9 ).
cnf(c_0_13,plain,
negate(add(negate(add(X1,X2)),negate(add(negate(X2),X1)))) = X1,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,hypothesis,
negate(add(negate(e),negate(add(d,negate(e))))) = d,
condition ).
cnf(c_0_15,axiom,
add(add(X1,X2),X3) = add(X1,add(X2,X3)),
associativity_of_add ).
cnf(c_0_16,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_17,plain,
( ~ positive_integer(X4)
| negate(add(X1,negate(X2))) != X3
| negate(add(X1,negate(add(X2,multiply(X4,add(X1,X3)))))) = X3 ),
inference(fof_simplification,[status(thm)],[lemma_3_4]) ).
cnf(c_0_18,plain,
( negate(add(X1,negate(add(X2,X3)))) != negate(add(X2,negate(add(X3,X1))))
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_19,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_13,c_0_14]),c_0_11]),c_0_11]) ).
cnf(c_0_20,plain,
add(X1,add(X2,X3)) = add(X2,add(X3,X1)),
inference(spm,[status(thm)],[c_0_15,c_0_11]) ).
cnf(c_0_21,negated_conjecture,
negate(add(e,multiply(one,add(d,negate(add(d,negate(e))))))) != negate(e),
c_0_16 ).
cnf(c_0_22,axiom,
multiply(one,X1) = X1,
one_times_x ).
cnf(c_0_23,plain,
( ~ positive_integer(X4)
| negate(add(X1,negate(X2))) != X3
| negate(add(X1,negate(add(X2,multiply(X4,add(X1,X3)))))) = X3 ),
c_0_17 ).
cnf(c_0_24,hypothesis,
( negate(add(negate(e),negate(add(negate(add(d,negate(e))),X1)))) != negate(add(X1,d))
| X1 = negate(e) ),
inference(spm,[status(thm)],[c_0_18,c_0_14]) ).
cnf(c_0_25,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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_19]),c_0_20]),c_0_11]),c_0_11]) ).
cnf(c_0_26,negated_conjecture,
negate(add(e,add(d,negate(add(d,negate(e)))))) != negate(e),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
( ~ positive_integer(X3)
| negate(add(X1,negate(add(X2,multiply(X3,add(X1,negate(add(X1,negate(X2))))))))) = negate(add(X1,negate(X2))) ),
inference(er,[status(thm)],[c_0_23]) ).
cnf(c_0_28,axiom,
positive_integer(one),
one ).
cnf(c_0_29,hypothesis,
negate(add(d,negate(add(e,add(d,negate(add(d,negate(e)))))))) != negate(add(d,negate(e))),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_11]),c_0_11]),c_0_26]) ).
cnf(c_0_30,plain,
negate(add(X1,negate(add(X2,add(X1,negate(add(X1,negate(X2)))))))) = negate(add(X1,negate(X2))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_22]),c_0_28])]) ).
cnf(c_0_31,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ROB014-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n019.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 04:23:34 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.42 Running first-order theorem proving
% 0.16/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
% 0.82/0.59 % Version: 3.5.1
% 0.82/0.59 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.82/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.82/0.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.82/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.82/0.59 % Starting new_bool_1 with 300s (1) cores
% 0.82/0.59 % Starting sh5l with 300s (1) cores
% 0.82/0.59 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1676258 completed with status 0
% 0.82/0.59 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.82/0.59 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.82/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.82/0.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.82/0.59 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.82/0.59 % No SInE strategy applied
% 0.82/0.59 % Search class: FHUSM-FFSF21-DFFFFFNN
% 0.82/0.59 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.82/0.59 % Starting SubtermCWHack with 136s (1) cores
% 0.82/0.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.82/0.59 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 271s (1) cores
% 0.82/0.59 % Starting new_bool_3 with 271s (1) cores
% 0.82/0.59 % Starting U----_206d_02_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.82/0.59 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1676264 completed with status 0
% 0.82/0.59 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.82/0.59 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.82/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.82/0.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.82/0.59 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.82/0.59 % No SInE strategy applied
% 0.82/0.59 % Search class: FHUSM-FFSF21-DFFFFFNN
% 0.82/0.59 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.82/0.59 % Starting SubtermCWHack with 136s (1) cores
% 0.82/0.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.82/0.59 % Preprocessing time : 0.001 s
% 0.82/0.59 % Presaturation interreduction done
% 0.82/0.59
% 0.82/0.59 % Proof found!
% 0.82/0.59 % SZS status Unsatisfiable
% 0.82/0.59 % SZS output start CNFRefutation
% See solution above
% 0.82/0.59 % Parsed axioms : 11
% 0.82/0.59 % Removed by relevancy pruning/SinE : 0
% 0.82/0.59 % Initial clauses : 11
% 0.82/0.59 % Removed in clause preprocessing : 0
% 0.82/0.59 % Initial clauses in saturation : 11
% 0.82/0.59 % Processed clauses : 534
% 0.82/0.59 % ...of these trivial : 17
% 0.82/0.59 % ...subsumed : 377
% 0.82/0.59 % ...remaining for further processing : 140
% 0.82/0.59 % Other redundant clauses eliminated : 1
% 0.82/0.59 % Clauses deleted for lack of memory : 0
% 0.82/0.59 % Backward-subsumed : 0
% 0.82/0.59 % Backward-rewritten : 1
% 0.82/0.59 % Generated clauses : 5830
% 0.82/0.59 % ...of the previous two non-redundant : 5551
% 0.82/0.59 % ...aggressively subsumed : 0
% 0.82/0.59 % Contextual simplify-reflections : 0
% 0.82/0.59 % Paramodulations : 5826
% 0.82/0.59 % Factorizations : 0
% 0.82/0.59 % NegExts : 0
% 0.82/0.59 % Equation resolutions : 4
% 0.82/0.59 % Disequality decompositions : 0
% 0.82/0.59 % Total rewrite steps : 3484
% 0.82/0.59 % ...of those cached : 2181
% 0.82/0.59 % Propositional unsat checks : 0
% 0.82/0.59 % Propositional check models : 0
% 0.82/0.59 % Propositional check unsatisfiable : 0
% 0.82/0.59 % Propositional clauses : 0
% 0.82/0.59 % Propositional clauses after purity: 0
% 0.82/0.59 % Propositional unsat core size : 0
% 0.82/0.59 % Propositional preprocessing time : 0.000
% 0.82/0.59 % Propositional encoding time : 0.000
% 0.82/0.59 % Propositional solver time : 0.000
% 0.82/0.59 % Success case prop preproc time : 0.000
% 0.82/0.59 % Success case prop encoding time : 0.000
% 0.82/0.59 % Success case prop solver time : 0.000
% 0.82/0.59 % Current number of processed clauses : 127
% 0.82/0.59 % Positive orientable unit clauses : 32
% 0.82/0.59 % Positive unorientable unit clauses: 4
% 0.82/0.59 % Negative unit clauses : 3
% 0.82/0.59 % Non-unit-clauses : 88
% 0.82/0.59 % Current number of unprocessed clauses: 5039
% 0.82/0.59 % ...number of literals in the above : 11518
% 0.82/0.59 % Current number of archived formulas : 0
% 0.82/0.59 % Current number of archived clauses : 12
% 0.82/0.59 % Clause-clause subsumption calls (NU) : 4974
% 0.82/0.59 % Rec. Clause-clause subsumption calls : 4974
% 0.82/0.59 % Non-unit clause-clause subsumptions : 337
% 0.82/0.59 % Unit Clause-clause subsumption calls : 41
% 0.82/0.59 % Rewrite failures with RHS unbound : 0
% 0.82/0.59 % BW rewrite match attempts : 523
% 0.82/0.59 % BW rewrite match successes : 41
% 0.82/0.59 % Condensation attempts : 0
% 0.82/0.59 % Condensation successes : 0
% 0.82/0.59 % Termbank termtop insertions : 152575
% 0.82/0.59 % Search garbage collected termcells : 15
% 0.82/0.59
% 0.82/0.59 % -------------------------------------------------
% 0.82/0.59 % User time : 0.117 s
% 0.82/0.59 % System time : 0.012 s
% 0.82/0.59 % Total time : 0.129 s
% 0.82/0.59 % Maximum resident set size: 3644 pages
% 0.82/0.59
% 0.82/0.59 % -------------------------------------------------
% 0.82/0.59 % User time : 0.444 s
% 0.82/0.59 % System time : 0.046 s
% 0.82/0.59 % Total time : 0.489 s
% 0.82/0.59 % Maximum resident set size: 4864 pages
% 0.82/0.59 % E exiting
%------------------------------------------------------------------------------