%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ROB005-1 : 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 : 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 02:06:38 PM UTC 2026
% Result : Unsatisfiable 3.60s 16.38s
% Output : CNFRefutation 3.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 5
% Syntax : Number of clauses : 48 ( 48 unt; 0 nHn; 22 RR)
% Number of literals : 48 ( 47 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 9 ( 3 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 : 47 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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(idempotence,hypothesis,
add(c,c) = c,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',idempotence) ).
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(commutativity_of_add,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/ROB001-0.ax',commutativity_of_add) ).
cnf(prove_huntingtons_axiom,negated_conjecture,
add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) != b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_huntingtons_axiom) ).
cnf(c_0_5,axiom,
negate(add(negate(add(X1,X2)),negate(add(X1,negate(X2))))) = X1,
robbins_axiom ).
cnf(c_0_6,hypothesis,
add(c,c) = c,
idempotence ).
cnf(c_0_7,axiom,
add(add(X1,X2),X3) = add(X1,add(X2,X3)),
associativity_of_add ).
cnf(c_0_8,axiom,
add(X1,X2) = add(X2,X1),
commutativity_of_add ).
cnf(c_0_9,hypothesis,
negate(add(negate(c),negate(add(c,negate(c))))) = c,
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_10,plain,
add(X1,add(X2,X3)) = add(X2,add(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_7]) ).
cnf(c_0_11,hypothesis,
negate(add(c,negate(add(c,add(negate(c),negate(c)))))) = negate(c),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_9]),c_0_10]),c_0_8]) ).
cnf(c_0_12,hypothesis,
add(c,add(c,X1)) = add(c,X1),
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_13,hypothesis,
negate(add(negate(c),negate(add(c,add(negate(c),negate(c)))))) = c,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_11]),c_0_12]),c_0_8]) ).
cnf(c_0_14,hypothesis,
negate(add(c,negate(add(c,add(negate(c),add(negate(c),negate(c))))))) = negate(c),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_13]),c_0_10]),c_0_8]) ).
cnf(c_0_15,plain,
negate(add(negate(add(X1,X2)),negate(add(negate(X2),X1)))) = X1,
inference(spm,[status(thm)],[c_0_5,c_0_8]) ).
cnf(c_0_16,plain,
negate(add(negate(add(X1,X2)),negate(add(X2,negate(X1))))) = X2,
inference(spm,[status(thm)],[c_0_5,c_0_8]) ).
cnf(c_0_17,hypothesis,
negate(add(negate(c),negate(add(c,add(negate(c),add(negate(c),negate(c))))))) = c,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_14]),c_0_12]),c_0_8]) ).
cnf(c_0_18,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_5,c_0_7]),c_0_7]) ).
cnf(c_0_19,hypothesis,
negate(add(c,add(negate(c),negate(c)))) = negate(add(c,negate(c))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_13]),c_0_8]),c_0_11]),c_0_8]) ).
cnf(c_0_20,hypothesis,
negate(add(negate(add(c,X1)),negate(add(c,add(X1,negate(c)))))) = add(c,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_12]),c_0_7]) ).
cnf(c_0_21,hypothesis,
negate(add(c,add(negate(c),add(negate(c),negate(c))))) = negate(add(c,negate(c))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_17]),c_0_8]),c_0_14]),c_0_8]) ).
cnf(c_0_22,hypothesis,
negate(add(negate(add(c,negate(c))),negate(add(c,negate(c))))) = add(c,negate(c)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_8]),c_0_12]) ).
cnf(c_0_23,hypothesis,
negate(add(negate(add(X1,c)),negate(add(X1,add(negate(c),negate(add(c,negate(c)))))))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_9]),c_0_8]) ).
cnf(c_0_24,hypothesis,
add(c,add(negate(c),negate(c))) = add(c,negate(c)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_19]),c_0_7]),c_0_21]),c_0_22]) ).
cnf(c_0_25,hypothesis,
negate(add(negate(c),negate(add(c,add(negate(c),negate(add(c,negate(c)))))))) = c,
inference(spm,[status(thm)],[c_0_23,c_0_6]) ).
cnf(c_0_26,hypothesis,
add(c,add(negate(c),add(negate(c),X1))) = add(c,add(negate(c),X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_24]),c_0_7]),c_0_7]) ).
cnf(c_0_27,plain,
negate(add(negate(add(X1,X2)),negate(add(negate(X1),X2)))) = X2,
inference(spm,[status(thm)],[c_0_15,c_0_8]) ).
cnf(c_0_28,hypothesis,
negate(add(c,negate(add(c,add(negate(c),negate(add(c,negate(c)))))))) = negate(c),
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_16,c_0_25]),c_0_7]),c_0_7]),c_0_8]),c_0_26]),c_0_8]) ).
cnf(c_0_29,hypothesis,
negate(add(c,add(negate(c),negate(add(c,negate(c)))))) = negate(add(c,negate(c))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_25]),c_0_8]) ).
cnf(c_0_30,hypothesis,
negate(add(negate(add(c,X1)),negate(add(X1,add(negate(c),negate(add(c,negate(c)))))))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_9]),c_0_8]) ).
cnf(c_0_31,hypothesis,
negate(add(negate(add(c,X1)),negate(add(c,add(negate(c),X1))))) = add(c,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_12]),c_0_10]) ).
cnf(c_0_32,hypothesis,
negate(add(c,negate(add(c,negate(c))))) = negate(c),
inference(spm,[status(thm)],[c_0_11,c_0_19]) ).
cnf(c_0_33,plain,
negate(add(negate(add(X1,add(X2,X3))),negate(add(X1,add(negate(X3),X2))))) = add(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_10]),c_0_7]) ).
cnf(c_0_34,hypothesis,
add(negate(c),negate(add(c,negate(c)))) = negate(c),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_29]),c_0_7]),c_0_8]),c_0_30]) ).
cnf(c_0_35,hypothesis,
add(c,negate(add(c,negate(c)))) = c,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_29]),c_0_32]),c_0_9]) ).
cnf(c_0_36,hypothesis,
add(X1,negate(add(c,negate(c)))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_8]),c_0_35]),c_0_5]) ).
cnf(c_0_37,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_5,c_0_5]),c_0_8]) ).
cnf(c_0_38,hypothesis,
add(negate(add(c,negate(c))),X1) = X1,
inference(spm,[status(thm)],[c_0_8,c_0_36]) ).
cnf(c_0_39,plain,
negate(add(X1,negate(add(X1,add(X2,negate(add(negate(X2),X1))))))) = negate(add(negate(X2),X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_15]),c_0_8]),c_0_7]),c_0_8]) ).
cnf(c_0_40,negated_conjecture,
add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) != b,
inference(fof_simplification,[status(thm)],[prove_huntingtons_axiom]) ).
cnf(c_0_41,hypothesis,
negate(add(X1,negate(X1))) = negate(add(c,negate(c))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_38]),c_0_5]),c_0_8]) ).
cnf(c_0_42,hypothesis,
negate(negate(add(X1,negate(negate(X1))))) = negate(negate(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_38]),c_0_36]),c_0_38]),c_0_36]) ).
cnf(c_0_43,negated_conjecture,
add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) != b,
c_0_40 ).
cnf(c_0_44,hypothesis,
negate(negate(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_41]),c_0_38]),c_0_42]) ).
cnf(c_0_45,negated_conjecture,
add(negate(add(a,negate(b))),negate(add(negate(b),negate(a)))) != b,
inference(rw,[status(thm)],[c_0_43,c_0_8]) ).
cnf(c_0_46,hypothesis,
add(negate(add(X1,X2)),negate(add(X2,negate(X1)))) = negate(X2),
inference(spm,[status(thm)],[c_0_44,c_0_16]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46]),c_0_44])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : ROB005-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/15.68 % Computer : n013.cluster.edu
% 0.18/15.68 % Model : x86_64 x86_64
% 0.18/15.68 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/15.68 % Memory : 8046.5625MB
% 0.18/15.68 % OS : Linux 6.8.0-71-generic
% 0.18/15.68 % CPULimit : 300
% 0.18/15.68 % WCLimit : 300
% 0.18/15.68 % DateTime : Mon Sep 21 04:22:39 UTC 2026
% 0.18/15.68 % CPUTime :
% 0.18/15.68 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/15.75 Running first-order theorem proving
% 0.24/15.75 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
% 3.60/16.38 % Version: 3.5.1
% 3.60/16.38 % Preprocessing class: FSSSSMSSSSSNFFN.
% 3.60/16.38 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.60/16.38 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.60/16.38 % Starting new_bool_3 with 300s (1) cores
% 3.60/16.38 % Starting new_bool_1 with 300s (1) cores
% 3.60/16.38 % Starting sh5l with 300s (1) cores
% 3.60/16.38 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 4127184 completed with status 0
% 3.60/16.38 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 3.60/16.38 % Preprocessing class: FSSSSMSSSSSNFFN.
% 3.60/16.38 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.60/16.38 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.60/16.38 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.60/16.38 % No SInE strategy applied
% 3.60/16.38 % Search class: FUUPS-FFSF21-MFFFFFNN
% 3.60/16.38 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.60/16.38 % Starting SubtermCWHack with 136s (1) cores
% 3.60/16.38 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 3.60/16.38 % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 3.60/16.38 % Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 3.60/16.38 % Starting U----_206d_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 3.60/16.38 % G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with pid 4127190 completed with status 0
% 3.60/16.38 % Result found by G-E--_300_C18_F1_SE_CS_SP_PS_S0Y
% 3.60/16.38 % Preprocessing class: FSSSSMSSSSSNFFN.
% 3.60/16.38 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.60/16.38 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.60/16.38 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.60/16.38 % No SInE strategy applied
% 3.60/16.38 % Search class: FUUPS-FFSF21-MFFFFFNN
% 3.60/16.38 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.60/16.38 % Starting SubtermCWHack with 136s (1) cores
% 3.60/16.38 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 3.60/16.38 % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 3.60/16.38 % Preprocessing time : 0.002 s
% 3.60/16.38 % Presaturation interreduction done
% 3.60/16.38
% 3.60/16.38 % Proof found!
% 3.60/16.38 % SZS status Unsatisfiable
% 3.60/16.38 % SZS output start CNFRefutation
% See solution above
% 3.60/16.38 % Parsed axioms : 5
% 3.60/16.38 % Removed by relevancy pruning/SinE : 0
% 3.60/16.38 % Initial clauses : 5
% 3.60/16.38 % Removed in clause preprocessing : 0
% 3.60/16.38 % Initial clauses in saturation : 5
% 3.60/16.38 % Processed clauses : 1193
% 3.60/16.38 % ...of these trivial : 618
% 3.60/16.38 % ...subsumed : 413
% 3.60/16.38 % ...remaining for further processing : 162
% 3.60/16.38 % Other redundant clauses eliminated : 0
% 3.60/16.38 % Clauses deleted for lack of memory : 0
% 3.60/16.38 % Backward-subsumed : 2
% 3.60/16.38 % Backward-rewritten : 69
% 3.60/16.38 % Generated clauses : 20642
% 3.60/16.38 % ...of the previous two non-redundant : 15160
% 3.60/16.38 % ...aggressively subsumed : 0
% 3.60/16.38 % Contextual simplify-reflections : 0
% 3.60/16.38 % Paramodulations : 20642
% 3.60/16.38 % Factorizations : 0
% 3.60/16.38 % NegExts : 0
% 3.60/16.38 % Equation resolutions : 0
% 3.60/16.38 % Disequality decompositions : 0
% 3.60/16.38 % Total rewrite steps : 36361
% 3.60/16.38 % ...of those cached : 29853
% 3.60/16.38 % Propositional unsat checks : 0
% 3.60/16.38 % Propositional check models : 0
% 3.60/16.38 % Propositional check unsatisfiable : 0
% 3.60/16.38 % Propositional clauses : 0
% 3.60/16.38 % Propositional clauses after purity: 0
% 3.60/16.38 % Propositional unsat core size : 0
% 3.60/16.38 % Propositional preprocessing time : 0.000
% 3.60/16.38 % Propositional encoding time : 0.000
% 3.60/16.38 % Propositional solver time : 0.000
% 3.60/16.38 % Success case prop preproc time : 0.000
% 3.60/16.38 % Success case prop encoding time : 0.000
% 3.60/16.38 % Success case prop solver time : 0.000
% 3.60/16.38 % Current number of processed clauses : 86
% 3.60/16.38 % Positive orientable unit clauses : 81
% 3.60/16.38 % Positive unorientable unit clauses: 5
% 3.60/16.38 % Negative unit clauses : 0
% 3.60/16.38 % Non-unit-clauses : 0
% 3.60/16.38 % Current number of unprocessed clauses: 13418
% 3.60/16.38 % ...number of literals in the above : 13418
% 3.60/16.38 % Current number of archived formulas : 0
% 3.60/16.38 % Current number of archived clauses : 76
% 3.60/16.38 % Clause-clause subsumption calls (NU) : 0
% 3.60/16.38 % Rec. Clause-clause subsumption calls : 0
% 3.60/16.38 % Non-unit clause-clause subsumptions : 0
% 3.60/16.38 % Unit Clause-clause subsumption calls : 134
% 3.60/16.38 % Rewrite failures with RHS unbound : 24
% 3.60/16.38 % BW rewrite match attempts : 3130
% 3.60/16.38 % BW rewrite match successes : 130
% 3.60/16.38 % Condensation attempts : 0
% 3.60/16.38 % Condensation successes : 0
% 3.60/16.38 % Termbank termtop insertions : 401236
% 3.60/16.38 % Search garbage collected termcells : 2
% 3.60/16.38
% 3.60/16.38 % -------------------------------------------------
% 3.60/16.38 % User time : 0.502 s
% 3.60/16.38 % System time : 0.031 s
% 3.60/16.38 % Total time : 0.533 s
% 3.60/16.38 % Maximum resident set size: 3384 pages
% 3.60/16.38
% 3.60/16.38 % -------------------------------------------------
% 3.60/16.38 % User time : 2.482 s
% 3.60/16.38 % System time : 0.162 s
% 3.60/16.38 % Total time : 2.644 s
% 3.60/16.38 % Maximum resident set size: 4864 pages
% 3.60/16.38 % E exiting
%------------------------------------------------------------------------------