%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ROB008-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 : n018.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:39 PM UTC 2026
% Result : Unsatisfiable 0.24s 0.61s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 12 ( 12 unt; 0 nHn; 7 RR)
% Number of literals : 12 ( 11 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 13 ( 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(condition,hypothesis,
negate(add(a,negate(add(b,c)))) = negate(add(a,add(b,negate(c)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condition) ).
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(prove_result,negated_conjecture,
add(a,b) != a,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_result) ).
cnf(c_0_4,axiom,
negate(add(negate(add(X1,X2)),negate(add(X1,negate(X2))))) = X1,
robbins_axiom ).
cnf(c_0_5,hypothesis,
negate(add(a,negate(add(b,c)))) = negate(add(a,add(b,negate(c)))),
condition ).
cnf(c_0_6,axiom,
add(add(X1,X2),X3) = add(X1,add(X2,X3)),
associativity_of_add ).
cnf(c_0_7,negated_conjecture,
add(a,b) != a,
inference(fof_simplification,[status(thm)],[prove_result]) ).
cnf(c_0_8,hypothesis,
negate(add(negate(add(a,add(b,c))),negate(add(a,add(b,negate(c)))))) = a,
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_9,plain,
negate(add(negate(add(X1,add(X2,X3))),negate(add(X1,add(X2,negate(X3)))))) = add(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_6]),c_0_6]) ).
cnf(c_0_10,negated_conjecture,
add(a,b) != a,
c_0_7 ).
cnf(c_0_11,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : ROB008-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.46 % Computer : n018.cluster.edu
% 0.20/0.46 % Model : x86_64 x86_64
% 0.20/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.46 % Memory : 8046.5625MB
% 0.20/0.46 % OS : Linux 6.8.0-71-generic
% 0.20/0.46 % CPULimit : 300
% 0.20/0.46 % WCLimit : 300
% 0.20/0.46 % DateTime : Mon Sep 21 04:25:13 UTC 2026
% 0.20/0.47 % CPUTime :
% 0.20/0.47 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.55 Running first-order theorem proving
% 0.24/0.55 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.61 % Version: 3.5.1
% 0.24/0.61 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.24/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.61 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.24/0.61 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.61 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.61 % Starting sh5l with 300s (1) cores
% 0.24/0.61 % new_bool_3 with pid 960145 completed with status 0
% 0.24/0.61 % Result found by new_bool_3
% 0.24/0.61 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.24/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.61 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.24/0.61 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.61 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.61 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.61 % Search class: FUUPS-FFSF21-MFFFFFNN
% 0.24/0.61 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.61 % Starting SubtermCWHack with 28s (1) cores
% 0.24/0.61 % SubtermCWHack with pid 960152 completed with status 0
% 0.24/0.61 % Result found by SubtermCWHack
% 0.24/0.61 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.24/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.61 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.24/0.61 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.61 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.61 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.61 % Search class: FUUPS-FFSF21-MFFFFFNN
% 0.24/0.61 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.61 % Starting SubtermCWHack with 28s (1) cores
% 0.24/0.61 % Preprocessing time : 0.001 s
% 0.24/0.61
% 0.24/0.61 % Proof found!
% 0.24/0.61 % SZS status Unsatisfiable
% 0.24/0.61 % SZS output start CNFRefutation
% See solution above
% 0.24/0.61 % Parsed axioms : 5
% 0.24/0.61 % Removed by relevancy pruning/SinE : 0
% 0.24/0.61 % Initial clauses : 5
% 0.24/0.61 % Removed in clause preprocessing : 0
% 0.24/0.61 % Initial clauses in saturation : 5
% 0.24/0.61 % Processed clauses : 154
% 0.24/0.61 % ...of these trivial : 91
% 0.24/0.61 % ...subsumed : 37
% 0.24/0.61 % ...remaining for further processing : 26
% 0.24/0.61 % Other redundant clauses eliminated : 0
% 0.24/0.61 % Clauses deleted for lack of memory : 0
% 0.24/0.61 % Backward-subsumed : 0
% 0.24/0.61 % Backward-rewritten : 1
% 0.24/0.61 % Generated clauses : 1339
% 0.24/0.61 % ...of the previous two non-redundant : 1164
% 0.24/0.61 % ...aggressively subsumed : 0
% 0.24/0.61 % Contextual simplify-reflections : 0
% 0.24/0.61 % Paramodulations : 1339
% 0.24/0.61 % Factorizations : 0
% 0.24/0.61 % NegExts : 0
% 0.24/0.61 % Equation resolutions : 0
% 0.24/0.61 % Disequality decompositions : 0
% 0.24/0.61 % Total rewrite steps : 509
% 0.24/0.61 % ...of those cached : 314
% 0.24/0.61 % Propositional unsat checks : 0
% 0.24/0.61 % Propositional check models : 0
% 0.24/0.61 % Propositional check unsatisfiable : 0
% 0.24/0.61 % Propositional clauses : 0
% 0.24/0.61 % Propositional clauses after purity: 0
% 0.24/0.61 % Propositional unsat core size : 0
% 0.24/0.61 % Propositional preprocessing time : 0.000
% 0.24/0.61 % Propositional encoding time : 0.000
% 0.24/0.61 % Propositional solver time : 0.000
% 0.24/0.61 % Success case prop preproc time : 0.000
% 0.24/0.61 % Success case prop encoding time : 0.000
% 0.24/0.61 % Success case prop solver time : 0.000
% 0.24/0.61 % Current number of processed clauses : 25
% 0.24/0.61 % Positive orientable unit clauses : 20
% 0.24/0.61 % Positive unorientable unit clauses: 4
% 0.24/0.61 % Negative unit clauses : 1
% 0.24/0.61 % Non-unit-clauses : 0
% 0.24/0.61 % Current number of unprocessed clauses: 1015
% 0.24/0.61 % ...number of literals in the above : 1015
% 0.24/0.61 % Current number of archived formulas : 0
% 0.24/0.61 % Current number of archived clauses : 1
% 0.24/0.61 % Clause-clause subsumption calls (NU) : 0
% 0.24/0.61 % Rec. Clause-clause subsumption calls : 0
% 0.24/0.61 % Non-unit clause-clause subsumptions : 0
% 0.24/0.61 % Unit Clause-clause subsumption calls : 7
% 0.24/0.61 % Rewrite failures with RHS unbound : 0
% 0.24/0.61 % BW rewrite match attempts : 183
% 0.24/0.61 % BW rewrite match successes : 17
% 0.24/0.61 % Condensation attempts : 0
% 0.24/0.61 % Condensation successes : 0
% 0.24/0.61 % Termbank termtop insertions : 20694
% 0.24/0.61 % Search garbage collected termcells : 2
% 0.24/0.61
% 0.24/0.61 % -------------------------------------------------
% 0.24/0.61 % User time : 0.017 s
% 0.24/0.61 % System time : 0.002 s
% 0.24/0.61 % Total time : 0.019 s
% 0.24/0.61 % Maximum resident set size: 3584 pages
% 0.24/0.61
% 0.24/0.61 % -------------------------------------------------
% 0.24/0.61 % User time : 0.020 s
% 0.24/0.61 % System time : 0.007 s
% 0.24/0.61 % Total time : 0.027 s
% 0.24/0.61 % Maximum resident set size: 4864 pages
% 0.24/0.61 % E exiting
%------------------------------------------------------------------------------