%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : RNG003-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 : n008.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:27 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.46s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 34 ( 21 unt; 0 nHn; 26 RR)
% Number of literals : 57 ( 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/sandbox2/benchmark/Axioms/RNG001-0.ax',associativity_of_addition1) ).
cnf(commutativity_of_addition,axiom,
( ~ sum(X1,X2,X3)
| sum(X2,X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',commutativity_of_addition) ).
cnf(additive_identity1,axiom,
sum(additive_identity,X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',additive_identity1) ).
cnf(b_plus_c_is_d,hypothesis,
sum(b,c,d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_plus_c_is_d) ).
cnf(addition_is_well_defined,axiom,
( ~ sum(X1,X2,X4)
| ~ sum(X1,X2,X3)
| X3 = X4 ),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',addition_is_well_defined) ).
cnf(a_plus_c_is_d,hypothesis,
sum(a,c,d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_plus_c_is_d) ).
cnf(closure_of_addition,axiom,
sum(X1,X2,add(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',closure_of_addition) ).
cnf(left_inverse,axiom,
sum(additive_inverse(X1),X1,additive_identity),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',left_inverse) ).
cnf(prove_a_equals_b,negated_conjecture,
a != b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_a_equals_b) ).
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(X1,X2,X3)
| sum(X2,X1,X3) ),
inference(fof_simplification,[status(thm)],[commutativity_of_addition]) ).
cnf(c_0_11,plain,
( ~ sum(X3,X4,X6)
| ~ sum(X2,X4,X5)
| ~ sum(X1,X2,X3)
| sum(X1,X5,X6) ),
c_0_9 ).
cnf(c_0_12,axiom,
sum(additive_identity,X1,X1),
additive_identity1 ).
cnf(c_0_13,plain,
( ~ sum(X1,X2,X3)
| sum(X2,X1,X3) ),
c_0_10 ).
cnf(c_0_14,hypothesis,
sum(b,c,d),
b_plus_c_is_d ).
cnf(c_0_15,plain,
( ~ sum(X1,X2,X4)
| ~ sum(X1,X2,X3)
| X3 = X4 ),
inference(fof_simplification,[status(thm)],[addition_is_well_defined]) ).
cnf(c_0_16,hypothesis,
sum(a,c,d),
a_plus_c_is_d ).
cnf(c_0_17,plain,
( ~ sum(X4,X3,X2)
| ~ sum(X1,X4,additive_identity)
| sum(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,hypothesis,
sum(c,b,d),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
( ~ sum(X1,X2,X4)
| ~ sum(X1,X2,X3)
| X3 = X4 ),
c_0_15 ).
cnf(c_0_20,axiom,
sum(X1,X2,add(X1,X2)),
closure_of_addition ).
cnf(c_0_21,hypothesis,
sum(c,a,d),
inference(spm,[status(thm)],[c_0_13,c_0_16]) ).
cnf(c_0_22,hypothesis,
( ~ sum(X1,c,additive_identity)
| sum(X1,d,b) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,axiom,
sum(additive_inverse(X1),X1,additive_identity),
left_inverse ).
cnf(c_0_24,plain,
( ~ sum(X2,X3,X1)
| X1 = add(X2,X3) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
sum(X1,X2,add(X2,X1)),
inference(spm,[status(thm)],[c_0_13,c_0_20]) ).
cnf(c_0_26,hypothesis,
( ~ sum(X1,c,additive_identity)
| sum(X1,d,a) ),
inference(spm,[status(thm)],[c_0_17,c_0_21]) ).
cnf(c_0_27,hypothesis,
sum(additive_inverse(c),d,b),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,plain,
add(X1,X2) = add(X2,X1),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
a != b,
inference(fof_simplification,[status(thm)],[prove_a_equals_b]) ).
cnf(c_0_30,hypothesis,
sum(additive_inverse(c),d,a),
inference(spm,[status(thm)],[c_0_26,c_0_23]) ).
cnf(c_0_31,hypothesis,
add(d,additive_inverse(c)) = b,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_27]),c_0_28]) ).
cnf(c_0_32,negated_conjecture,
a != b,
c_0_29 ).
cnf(c_0_33,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_30]),c_0_28]),c_0_31]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG003-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n008.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % 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:10:25 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.43 Running first-order theorem proving
% 0.10/0.43 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.10/0.46 % Version: 3.5.1
% 0.10/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.46 % Starting sh5l with 300s (1) cores
% 0.10/0.46 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 110385 completed with status 0
% 0.10/0.46 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.10/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.46 % No SInE strategy applied
% 0.10/0.46 % Search class: FHUSM-FFMF21-SFFFFFNN
% 0.10/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.10/0.46 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 0.10/0.46 % Starting new_bool_3 with 136s (1) cores
% 0.10/0.46 % Starting new_bool_1 with 136s (1) cores
% 0.10/0.46 % G-E--_208_C18_F1_SE_CS_SP_PS_S4d with pid 110393 completed with status 0
% 0.10/0.46 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S4d
% 0.10/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.46 % No SInE strategy applied
% 0.10/0.46 % Search class: FHUSM-FFMF21-SFFFFFNN
% 0.10/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.10/0.46 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 0.10/0.46 % Preprocessing time : 0.001 s
% 0.10/0.46 % Presaturation interreduction done
% 0.10/0.46
% 0.10/0.46 % Proof found!
% 0.10/0.46 % SZS status Unsatisfiable
% 0.10/0.46 % SZS output start CNFRefutation
% See solution above
% 0.10/0.46 % Parsed axioms : 20
% 0.10/0.46 % Removed by relevancy pruning/SinE : 0
% 0.10/0.46 % Initial clauses : 20
% 0.10/0.46 % Removed in clause preprocessing : 0
% 0.10/0.46 % Initial clauses in saturation : 20
% 0.10/0.46 % Processed clauses : 113
% 0.10/0.46 % ...of these trivial : 10
% 0.10/0.46 % ...subsumed : 7
% 0.10/0.46 % ...remaining for further processing : 96
% 0.10/0.46 % Other redundant clauses eliminated : 0
% 0.10/0.46 % Clauses deleted for lack of memory : 0
% 0.10/0.46 % Backward-subsumed : 0
% 0.10/0.46 % Backward-rewritten : 3
% 0.10/0.46 % Generated clauses : 275
% 0.10/0.46 % ...of the previous two non-redundant : 148
% 0.10/0.46 % ...aggressively subsumed : 0
% 0.10/0.46 % Contextual simplify-reflections : 0
% 0.10/0.46 % Paramodulations : 275
% 0.10/0.46 % Factorizations : 0
% 0.10/0.46 % NegExts : 0
% 0.10/0.46 % Equation resolutions : 0
% 0.10/0.46 % Disequality decompositions : 0
% 0.10/0.46 % Total rewrite steps : 172
% 0.10/0.46 % ...of those cached : 127
% 0.10/0.46 % Propositional unsat checks : 0
% 0.10/0.46 % Propositional check models : 0
% 0.10/0.46 % Propositional check unsatisfiable : 0
% 0.10/0.46 % Propositional clauses : 0
% 0.10/0.46 % Propositional clauses after purity: 0
% 0.10/0.46 % Propositional unsat core size : 0
% 0.10/0.46 % Propositional preprocessing time : 0.000
% 0.10/0.46 % Propositional encoding time : 0.000
% 0.10/0.46 % Propositional solver time : 0.000
% 0.10/0.46 % Success case prop preproc time : 0.000
% 0.10/0.46 % Success case prop encoding time : 0.000
% 0.10/0.46 % Success case prop solver time : 0.000
% 0.10/0.46 % Current number of processed clauses : 73
% 0.10/0.46 % Positive orientable unit clauses : 24
% 0.10/0.46 % Positive unorientable unit clauses: 1
% 0.10/0.46 % Negative unit clauses : 1
% 0.10/0.46 % Non-unit-clauses : 47
% 0.10/0.46 % Current number of unprocessed clauses: 71
% 0.10/0.46 % ...number of literals in the above : 171
% 0.10/0.46 % Current number of archived formulas : 0
% 0.10/0.46 % Current number of archived clauses : 23
% 0.10/0.46 % Clause-clause subsumption calls (NU) : 521
% 0.10/0.46 % Rec. Clause-clause subsumption calls : 432
% 0.10/0.46 % Non-unit clause-clause subsumptions : 6
% 0.10/0.46 % Unit Clause-clause subsumption calls : 0
% 0.10/0.46 % Rewrite failures with RHS unbound : 0
% 0.10/0.46 % BW rewrite match attempts : 65
% 0.10/0.46 % BW rewrite match successes : 22
% 0.10/0.46 % Condensation attempts : 0
% 0.10/0.46 % Condensation successes : 0
% 0.10/0.46 % Termbank termtop insertions : 3395
% 0.10/0.46 % Search garbage collected termcells : 61
% 0.10/0.46
% 0.10/0.46 % -------------------------------------------------
% 0.10/0.46 % User time : 0.006 s
% 0.10/0.46 % System time : 0.003 s
% 0.10/0.46 % Total time : 0.010 s
% 0.10/0.46 % Maximum resident set size: 3648 pages
% 0.10/0.46
% 0.10/0.46 % -------------------------------------------------
% 0.10/0.46 % User time : 0.030 s
% 0.10/0.46 % System time : 0.015 s
% 0.10/0.46 % Total time : 0.044 s
% 0.10/0.46 % Maximum resident set size: 4864 pages
% 0.10/0.46 % E exiting
%------------------------------------------------------------------------------