%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ROB014-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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 02:06:40 PM UTC 2026
% Result : Unsatisfiable 62.91s 10.58s
% Output : CNFRefutation 62.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 25 ( 25 unt; 0 nHn; 11 RR)
% Number of literals : 25 ( 24 equ; 5 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 12 ( 3 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 : 31 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(robbins_axiom,axiom,
negate(add(negate(add(X1,X2)),negate(add(X1,negate(X2))))) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/ROB001-0.ax',robbins_axiom) ).
cnf(commutativity_of_add,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/ROB001-0.ax',commutativity_of_add) ).
cnf(condition,hypothesis,
negate(add(negate(e),negate(add(d,negate(e))))) = d,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condition) ).
cnf(prove_base_step,negated_conjecture,
negate(add(e,multiply(one,add(d,negate(add(d,negate(e))))))) != negate(e),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_base_step) ).
cnf(one_times_x,axiom,
multiply(one,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/ROB001-1.ax',one_times_x) ).
cnf(associativity_of_add,axiom,
add(add(X1,X2),X3) = add(X1,add(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/ROB001-0.ax',associativity_of_add) ).
cnf(c_0_6,axiom,
negate(add(negate(add(X1,X2)),negate(add(X1,negate(X2))))) = X1,
robbins_axiom ).
cnf(c_0_7,axiom,
add(X1,X2) = add(X2,X1),
commutativity_of_add ).
cnf(c_0_8,plain,
negate(add(negate(add(X1,X2)),negate(add(negate(X2),X1)))) = X1,
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,hypothesis,
negate(add(negate(e),negate(add(d,negate(e))))) = d,
condition ).
cnf(c_0_10,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_11,plain,
negate(add(negate(add(X1,X2)),negate(add(X2,negate(X1))))) = X2,
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_12,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_8,c_0_9]),c_0_7]),c_0_7]) ).
cnf(c_0_13,negated_conjecture,
negate(add(e,multiply(one,add(d,negate(add(d,negate(e))))))) != negate(e),
c_0_10 ).
cnf(c_0_14,axiom,
multiply(one,X1) = X1,
one_times_x ).
cnf(c_0_15,axiom,
add(add(X1,X2),X3) = add(X1,add(X2,X3)),
associativity_of_add ).
cnf(c_0_16,plain,
negate(add(negate(add(X1,X2)),negate(add(X1,add(negate(add(X2,X3)),negate(add(X2,negate(X3)))))))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_6]),c_0_7]) ).
cnf(c_0_17,plain,
negate(add(negate(add(X1,negate(X2))),negate(add(X2,X1)))) = X1,
inference(spm,[status(thm)],[c_0_11,c_0_7]) ).
cnf(c_0_18,hypothesis,
negate(add(negate(add(d,negate(e))),negate(add(d,add(e,negate(add(d,negate(e)))))))) = d,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_12]),c_0_7]) ).
cnf(c_0_19,negated_conjecture,
negate(add(e,add(d,negate(add(d,negate(e)))))) != negate(e),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
add(X1,add(X2,X3)) = add(X2,add(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_7]),c_0_15]) ).
cnf(c_0_21,plain,
negate(add(negate(add(X1,negate(add(X2,negate(X3))))),negate(add(X1,add(X2,negate(add(X3,add(X2,negate(add(X2,negate(X3))))))))))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_7]),c_0_15]),c_0_7]) ).
cnf(c_0_22,hypothesis,
negate(add(d,negate(add(d,add(negate(e),negate(add(d,add(e,negate(add(d,negate(e))))))))))) = negate(add(d,add(e,negate(add(d,negate(e)))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_18]),c_0_7]),c_0_15]),c_0_7]) ).
cnf(c_0_23,negated_conjecture,
negate(add(d,add(e,negate(add(d,negate(e)))))) != negate(e),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_9]),c_0_20]),c_0_20]),c_0_22]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ROB014-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.39 % Computer : n006.cluster.edu
% 0.13/0.39 % Model : x86_64 x86_64
% 0.13/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39 % Memory : 8046.5625MB
% 0.13/0.39 % OS : Linux 6.8.0-71-generic
% 0.13/0.39 % CPULimit : 300
% 0.13/0.39 % WCLimit : 300
% 0.13/0.39 % DateTime : Mon Sep 21 04:23:29 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.43 Running first-order theorem proving
% 0.13/0.43 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
% 62.91/10.58 % Version: 3.5.1
% 62.91/10.58 % Preprocessing class: FSSSSMSSSSSNFFN.
% 62.91/10.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 62.91/10.58 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 62.91/10.58 % Starting new_bool_3 with 300s (1) cores
% 62.91/10.58 % Starting new_bool_1 with 300s (1) cores
% 62.91/10.58 % Starting sh5l with 300s (1) cores
% 62.91/10.58 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1999652 completed with status 0
% 62.91/10.58 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 62.91/10.58 % Preprocessing class: FSSSSMSSSSSNFFN.
% 62.91/10.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 62.91/10.58 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 62.91/10.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 62.91/10.58 % No SInE strategy applied
% 62.91/10.58 % Search class: FHUSM-FFSF21-DFFFFFNN
% 62.91/10.58 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 62.91/10.58 % Starting SubtermCWHack with 136s (1) cores
% 62.91/10.58 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 62.91/10.58 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 271s (1) cores
% 62.91/10.58 % Starting new_bool_3 with 271s (1) cores
% 62.91/10.58 % Starting U----_206d_02_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 62.91/10.58 % U----_206d_02_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 1999663 completed with status 0
% 62.91/10.58 % Result found by U----_206d_02_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 62.91/10.58 % Preprocessing class: FSSSSMSSSSSNFFN.
% 62.91/10.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 62.91/10.58 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 62.91/10.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 62.91/10.58 % No SInE strategy applied
% 62.91/10.58 % Search class: FHUSM-FFSF21-DFFFFFNN
% 62.91/10.58 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 62.91/10.58 % Starting SubtermCWHack with 136s (1) cores
% 62.91/10.58 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 62.91/10.58 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 271s (1) cores
% 62.91/10.58 % Starting new_bool_3 with 271s (1) cores
% 62.91/10.58 % Starting U----_206d_02_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 62.91/10.58 % Preprocessing time : 0.001 s
% 62.91/10.58 % Presaturation interreduction done
% 62.91/10.58
% 62.91/10.58 % Proof found!
% 62.91/10.58 % SZS status Unsatisfiable
% 62.91/10.58 % SZS output start CNFRefutation
% See solution above
% 62.91/10.58 % Parsed axioms : 9
% 62.91/10.58 % Removed by relevancy pruning/SinE : 0
% 62.91/10.58 % Initial clauses : 9
% 62.91/10.58 % Removed in clause preprocessing : 0
% 62.91/10.58 % Initial clauses in saturation : 9
% 62.91/10.58 % Processed clauses : 2349
% 62.91/10.58 % ...of these trivial : 1754
% 62.91/10.58 % ...subsumed : 227
% 62.91/10.58 % ...remaining for further processing : 367
% 62.91/10.58 % Other redundant clauses eliminated : 0
% 62.91/10.58 % Clauses deleted for lack of memory : 0
% 62.91/10.58 % Backward-subsumed : 0
% 62.91/10.58 % Backward-rewritten : 1
% 62.91/10.58 % Generated clauses : 200218
% 62.91/10.58 % ...of the previous two non-redundant : 198249
% 62.91/10.58 % ...aggressively subsumed : 0
% 62.91/10.58 % Contextual simplify-reflections : 0
% 62.91/10.58 % Paramodulations : 200218
% 62.91/10.58 % Factorizations : 0
% 62.91/10.58 % NegExts : 0
% 62.91/10.58 % Equation resolutions : 0
% 62.91/10.58 % Disequality decompositions : 0
% 62.91/10.58 % Total rewrite steps : 123181
% 62.91/10.58 % ...of those cached : 93088
% 62.91/10.58 % Propositional unsat checks : 0
% 62.91/10.58 % Propositional check models : 0
% 62.91/10.58 % Propositional check unsatisfiable : 0
% 62.91/10.58 % Propositional clauses : 0
% 62.91/10.58 % Propositional clauses after purity: 0
% 62.91/10.58 % Propositional unsat core size : 0
% 62.91/10.58 % Propositional preprocessing time : 0.000
% 62.91/10.58 % Propositional encoding time : 0.000
% 62.91/10.58 % Propositional solver time : 0.000
% 62.91/10.58 % Success case prop preproc time : 0.000
% 62.91/10.58 % Success case prop encoding time : 0.000
% 62.91/10.58 % Success case prop solver time : 0.000
% 62.91/10.58 % Current number of processed clauses : 357
% 62.91/10.58 % Positive orientable unit clauses : 350
% 62.91/10.58 % Positive unorientable unit clauses: 4
% 62.91/10.58 % Negative unit clauses : 1
% 62.91/10.58 % Non-unit-clauses : 2
% 62.91/10.58 % Current number of unprocessed clauses: 195918
% 62.91/10.58 % ...number of literals in the above : 195918
% 62.91/10.58 % Current number of archived formulas : 0
% 62.91/10.58 % Current number of archived clauses : 10
% 62.91/10.58 % Clause-clause subsumption calls (NU) : 0
% 62.91/10.58 % Rec. Clause-clause subsumption calls : 0
% 62.91/10.58 % Non-unit clause-clause subsumptions : 0
% 62.91/10.58 % Unit Clause-clause subsumption calls : 6
% 62.91/10.58 % Rewrite failures with RHS unbound : 0
% 62.91/10.58 % BW rewrite match attempts : 40271
% 62.91/10.58 % BW rewrite match successes : 16
% 62.91/10.58 % Condensation attempts : 0
% 62.91/10.58 % Condensation successes : 0
% 62.91/10.58 % Termbank termtop insertions : 7118231
% 62.91/10.58 % Search garbage collected termcells : 6
% 62.91/10.58
% 62.91/10.58 % -------------------------------------------------
% 62.91/10.58 % User time : 8.470 s
% 62.91/10.58 % System time : 0.376 s
% 62.91/10.58 % Total time : 8.847 s
% 62.91/10.58 % Maximum resident set size: 3384 pages
% 62.91/10.58
% 62.91/10.58 % -------------------------------------------------
% 62.91/10.58 % User time : 42.898 s
% 62.91/10.58 % System time : 1.946 s
% 62.91/10.58 % Total time : 44.844 s
% 62.91/10.58 % Maximum resident set size: 4608 pages
% 62.91/10.58 % E exiting
%------------------------------------------------------------------------------