%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : RNG002-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 : n007.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:05:26 PM UTC 2026
% Result : Unsatisfiable 0.11s 0.44s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 32 ( 19 unt; 0 nHn; 24 RR)
% Number of literals : 55 ( 9 equ; 26 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 60 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity_of_addition1,axiom,
( ~ sum(X3,X4,X6)
| ~ sum(X2,X4,X5)
| ~ sum(X1,X2,X3)
| sum(X1,X5,X6) ),
file('/export/starexec/sandbox/benchmark/Axioms/RNG001-0.ax',associativity_of_addition1) ).
cnf(additive_identity1,axiom,
sum(additive_identity,X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/RNG001-0.ax',additive_identity1) ).
cnf(addition_is_well_defined,axiom,
( ~ sum(X1,X2,X4)
| ~ sum(X1,X2,X3)
| X3 = X4 ),
file('/export/starexec/sandbox/benchmark/Axioms/RNG001-0.ax',addition_is_well_defined) ).
cnf(commutativity_of_addition,axiom,
( ~ sum(X1,X2,X3)
| sum(X2,X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/RNG001-0.ax',commutativity_of_addition) ).
cnf(a_plus_c_is_d,hypothesis,
sum(a,c,d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_plus_c_is_d) ).
cnf(closure_of_addition,axiom,
sum(X1,X2,add(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/RNG001-0.ax',closure_of_addition) ).
cnf(a_plus_b_is_d,hypothesis,
sum(a,b,d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_plus_b_is_d) ).
cnf(left_inverse,axiom,
sum(additive_inverse(X1),X1,additive_identity),
file('/export/starexec/sandbox/benchmark/Axioms/RNG001-0.ax',left_inverse) ).
cnf(prove_b_equals_c,negated_conjecture,
b != c,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_b_equals_c) ).
cnf(c_0_9,plain,
( ~ sum(X3,X4,X6)
| ~ sum(X2,X4,X5)
| ~ sum(X1,X2,X3)
| sum(X1,X5,X6) ),
inference(fof_simplification,[status(thm)],[associativity_of_addition1]) ).
cnf(c_0_10,plain,
( ~ sum(X3,X4,X6)
| ~ sum(X2,X4,X5)
| ~ sum(X1,X2,X3)
| sum(X1,X5,X6) ),
c_0_9 ).
cnf(c_0_11,axiom,
sum(additive_identity,X1,X1),
additive_identity1 ).
cnf(c_0_12,plain,
( ~ sum(X1,X2,X4)
| ~ sum(X1,X2,X3)
| X3 = X4 ),
inference(fof_simplification,[status(thm)],[addition_is_well_defined]) ).
cnf(c_0_13,plain,
( ~ sum(X1,X2,X3)
| sum(X2,X1,X3) ),
inference(fof_simplification,[status(thm)],[commutativity_of_addition]) ).
cnf(c_0_14,plain,
( ~ sum(X4,X3,X2)
| ~ sum(X1,X4,additive_identity)
| sum(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,hypothesis,
sum(a,c,d),
a_plus_c_is_d ).
cnf(c_0_16,plain,
( ~ sum(X1,X2,X4)
| ~ sum(X1,X2,X3)
| X3 = X4 ),
c_0_12 ).
cnf(c_0_17,axiom,
sum(X1,X2,add(X1,X2)),
closure_of_addition ).
cnf(c_0_18,plain,
( ~ sum(X1,X2,X3)
| sum(X2,X1,X3) ),
c_0_13 ).
cnf(c_0_19,hypothesis,
sum(a,b,d),
a_plus_b_is_d ).
cnf(c_0_20,hypothesis,
( ~ sum(X1,a,additive_identity)
| sum(X1,d,c) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,axiom,
sum(additive_inverse(X1),X1,additive_identity),
left_inverse ).
cnf(c_0_22,plain,
( ~ sum(X2,X3,X1)
| X1 = add(X2,X3) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,plain,
sum(X1,X2,add(X2,X1)),
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_24,hypothesis,
( ~ sum(X1,a,additive_identity)
| sum(X1,d,b) ),
inference(spm,[status(thm)],[c_0_14,c_0_19]) ).
cnf(c_0_25,hypothesis,
sum(additive_inverse(a),d,c),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
add(X1,X2) = add(X2,X1),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
b != c,
inference(fof_simplification,[status(thm)],[prove_b_equals_c]) ).
cnf(c_0_28,hypothesis,
sum(additive_inverse(a),d,b),
inference(spm,[status(thm)],[c_0_24,c_0_21]) ).
cnf(c_0_29,hypothesis,
add(d,additive_inverse(a)) = c,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_25]),c_0_26]) ).
cnf(c_0_30,negated_conjecture,
b != c,
c_0_27 ).
cnf(c_0_31,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_28]),c_0_26]),c_0_29]),c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : RNG002-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n007.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 04:07:51 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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.11/0.44 % Version: 3.5.1
% 0.11/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.44 % Starting sh5l with 300s (1) cores
% 0.11/0.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 141150 completed with status 0
% 0.11/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.44 % No SInE strategy applied
% 0.11/0.44 % Search class: FHUSM-FFMF21-SFFFFFNN
% 0.11/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 0.11/0.44 % Starting new_bool_3 with 136s (1) cores
% 0.11/0.44 % Starting new_bool_1 with 136s (1) cores
% 0.11/0.44 % G-E--_208_C18_F1_SE_CS_SP_PS_S4d with pid 141157 completed with status 0
% 0.11/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S4d
% 0.11/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.44 % No SInE strategy applied
% 0.11/0.44 % Search class: FHUSM-FFMF21-SFFFFFNN
% 0.11/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 0.11/0.44 % Preprocessing time : 0.001 s
% 0.11/0.44 % Presaturation interreduction done
% 0.11/0.44
% 0.11/0.44 % Proof found!
% 0.11/0.44 % SZS status Unsatisfiable
% 0.11/0.44 % SZS output start CNFRefutation
% See solution above
% 0.11/0.44 % Parsed axioms : 20
% 0.11/0.44 % Removed by relevancy pruning/SinE : 0
% 0.11/0.44 % Initial clauses : 20
% 0.11/0.44 % Removed in clause preprocessing : 0
% 0.11/0.44 % Initial clauses in saturation : 20
% 0.11/0.44 % Processed clauses : 124
% 0.11/0.44 % ...of these trivial : 12
% 0.11/0.44 % ...subsumed : 8
% 0.11/0.44 % ...remaining for further processing : 104
% 0.11/0.44 % Other redundant clauses eliminated : 0
% 0.11/0.44 % Clauses deleted for lack of memory : 0
% 0.11/0.44 % Backward-subsumed : 0
% 0.11/0.44 % Backward-rewritten : 3
% 0.11/0.44 % Generated clauses : 325
% 0.11/0.44 % ...of the previous two non-redundant : 184
% 0.11/0.44 % ...aggressively subsumed : 0
% 0.11/0.44 % Contextual simplify-reflections : 0
% 0.11/0.44 % Paramodulations : 325
% 0.11/0.44 % Factorizations : 0
% 0.11/0.44 % NegExts : 0
% 0.11/0.44 % Equation resolutions : 0
% 0.11/0.44 % Disequality decompositions : 0
% 0.11/0.44 % Total rewrite steps : 195
% 0.11/0.44 % ...of those cached : 146
% 0.11/0.44 % Propositional unsat checks : 0
% 0.11/0.44 % Propositional check models : 0
% 0.11/0.44 % Propositional check unsatisfiable : 0
% 0.11/0.44 % Propositional clauses : 0
% 0.11/0.44 % Propositional clauses after purity: 0
% 0.11/0.44 % Propositional unsat core size : 0
% 0.11/0.44 % Propositional preprocessing time : 0.000
% 0.11/0.44 % Propositional encoding time : 0.000
% 0.11/0.44 % Propositional solver time : 0.000
% 0.11/0.44 % Success case prop preproc time : 0.000
% 0.11/0.44 % Success case prop encoding time : 0.000
% 0.11/0.44 % Success case prop solver time : 0.000
% 0.11/0.44 % Current number of processed clauses : 81
% 0.11/0.44 % Positive orientable unit clauses : 27
% 0.11/0.44 % Positive unorientable unit clauses: 1
% 0.11/0.44 % Negative unit clauses : 1
% 0.11/0.44 % Non-unit-clauses : 52
% 0.11/0.44 % Current number of unprocessed clauses: 95
% 0.11/0.44 % ...number of literals in the above : 222
% 0.11/0.44 % Current number of archived formulas : 0
% 0.11/0.44 % Current number of archived clauses : 23
% 0.11/0.44 % Clause-clause subsumption calls (NU) : 597
% 0.11/0.44 % Rec. Clause-clause subsumption calls : 505
% 0.11/0.44 % Non-unit clause-clause subsumptions : 7
% 0.11/0.44 % Unit Clause-clause subsumption calls : 0
% 0.11/0.44 % Rewrite failures with RHS unbound : 0
% 0.11/0.44 % BW rewrite match attempts : 65
% 0.11/0.44 % BW rewrite match successes : 22
% 0.11/0.44 % Condensation attempts : 0
% 0.11/0.44 % Condensation successes : 0
% 0.11/0.44 % Termbank termtop insertions : 3905
% 0.11/0.44 % Search garbage collected termcells : 61
% 0.11/0.44
% 0.11/0.44 % -------------------------------------------------
% 0.11/0.44 % User time : 0.009 s
% 0.11/0.44 % System time : 0.004 s
% 0.11/0.44 % Total time : 0.013 s
% 0.11/0.44 % Maximum resident set size: 3648 pages
% 0.11/0.44
% 0.11/0.44 % -------------------------------------------------
% 0.11/0.44 % User time : 0.045 s
% 0.11/0.44 % System time : 0.012 s
% 0.11/0.44 % Total time : 0.057 s
% 0.11/0.44 % Maximum resident set size: 4864 pages
% 0.11/0.44 % E exiting
%------------------------------------------------------------------------------