%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : RNG025-7 : 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 : 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:33 PM UTC 2026
% Result : Unsatisfiable 17.02s 3.01s
% Output : CNFRefutation 17.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 15
% Syntax : Number of clauses : 50 ( 50 unt; 0 nHn; 6 RR)
% Number of literals : 50 ( 49 equ; 5 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 90 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(distribute2,axiom,
multiply(add(X1,X2),X3) = add(multiply(X1,X3),multiply(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',distribute2) ).
cnf(right_alternative,axiom,
multiply(multiply(X1,X2),X2) = multiply(X1,multiply(X2,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',right_alternative) ).
cnf(associativity_for_addition,axiom,
add(X1,add(X2,X3)) = add(add(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',associativity_for_addition) ).
cnf(right_additive_inverse,axiom,
add(X1,additive_inverse(X1)) = additive_identity,
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',right_additive_inverse) ).
cnf(left_additive_identity,axiom,
add(additive_identity,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',left_additive_identity) ).
cnf(left_alternative,axiom,
multiply(multiply(X1,X1),X2) = multiply(X1,multiply(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',left_alternative) ).
cnf(right_additive_identity,axiom,
add(X1,additive_identity) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',right_additive_identity) ).
cnf(distribute1,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',distribute1) ).
cnf(additive_inverse_additive_inverse,axiom,
additive_inverse(additive_inverse(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',additive_inverse_additive_inverse) ).
cnf(inverse_product1,axiom,
multiply(additive_inverse(X1),X2) = additive_inverse(multiply(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse_product1) ).
cnf(inverse_product2,axiom,
multiply(X1,additive_inverse(X2)) = additive_inverse(multiply(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse_product2) ).
cnf(prove_flexible_law,negated_conjecture,
associator(x,y,x) != additive_identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_flexible_law) ).
cnf(commutativity_for_addition,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',commutativity_for_addition) ).
cnf(associator,axiom,
associator(X1,X2,X3) = add(multiply(multiply(X1,X2),X3),additive_inverse(multiply(X1,multiply(X2,X3)))),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',associator) ).
cnf(right_multiplicative_zero,axiom,
multiply(X1,additive_identity) = additive_identity,
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',right_multiplicative_zero) ).
cnf(c_0_15,axiom,
multiply(add(X1,X2),X3) = add(multiply(X1,X3),multiply(X2,X3)),
distribute2 ).
cnf(c_0_16,axiom,
multiply(multiply(X1,X2),X2) = multiply(X1,multiply(X2,X2)),
right_alternative ).
cnf(c_0_17,axiom,
add(X1,add(X2,X3)) = add(add(X1,X2),X3),
associativity_for_addition ).
cnf(c_0_18,axiom,
add(X1,additive_inverse(X1)) = additive_identity,
right_additive_inverse ).
cnf(c_0_19,axiom,
add(additive_identity,X1) = X1,
left_additive_identity ).
cnf(c_0_20,plain,
add(multiply(X1,multiply(X2,X2)),multiply(X3,X2)) = multiply(add(multiply(X1,X2),X3),X2),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,axiom,
multiply(multiply(X1,X1),X2) = multiply(X1,multiply(X1,X2)),
left_alternative ).
cnf(c_0_22,plain,
add(X1,add(additive_inverse(X1),X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_23,plain,
add(X1,add(X2,additive_inverse(add(X1,X2)))) = additive_identity,
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_24,axiom,
add(X1,additive_identity) = X1,
right_additive_identity ).
cnf(c_0_25,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
distribute1 ).
cnf(c_0_26,plain,
add(multiply(X1,multiply(X2,X2)),multiply(X3,multiply(X3,X2))) = multiply(add(multiply(X1,X2),multiply(X3,X3)),X2),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
add(X1,additive_inverse(add(additive_inverse(X2),X1))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_28,axiom,
additive_inverse(additive_inverse(X1)) = X1,
additive_inverse_additive_inverse ).
cnf(c_0_29,axiom,
multiply(additive_inverse(X1),X2) = additive_inverse(multiply(X1,X2)),
inverse_product1 ).
cnf(c_0_30,axiom,
multiply(X1,additive_inverse(X2)) = additive_inverse(multiply(X1,X2)),
inverse_product2 ).
cnf(c_0_31,negated_conjecture,
associator(x,y,x) != additive_identity,
inference(fof_simplification,[status(thm)],[prove_flexible_law]) ).
cnf(c_0_32,plain,
multiply(multiply(X1,add(X2,X1)),X2) = multiply(X1,multiply(add(X2,X1),X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_25]),c_0_15]) ).
cnf(c_0_33,plain,
add(X1,additive_inverse(add(X2,X1))) = additive_inverse(X2),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,plain,
multiply(additive_inverse(X1),X2) = multiply(X1,additive_inverse(X2)),
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,axiom,
add(X1,X2) = add(X2,X1),
commutativity_for_addition ).
cnf(c_0_36,negated_conjecture,
associator(x,y,x) != additive_identity,
c_0_31 ).
cnf(c_0_37,axiom,
associator(X1,X2,X3) = add(multiply(multiply(X1,X2),X3),additive_inverse(multiply(X1,multiply(X2,X3)))),
associator ).
cnf(c_0_38,plain,
multiply(multiply(X1,X2),additive_inverse(X2)) = multiply(X1,multiply(X2,additive_inverse(X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_16]),c_0_30]),c_0_30]) ).
cnf(c_0_39,plain,
multiply(multiply(add(X1,X2),X1),X2) = multiply(add(X1,X2),multiply(X1,X2)),
inference(rw,[status(thm)],[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_32,c_0_33]),c_0_34]),c_0_28]),c_0_34]),c_0_34]),c_0_30]),c_0_28]) ).
cnf(c_0_40,plain,
add(X1,additive_inverse(add(X1,X2))) = additive_inverse(X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_33]),c_0_28]),c_0_35]) ).
cnf(c_0_41,plain,
multiply(multiply(X1,additive_inverse(X2)),X3) = multiply(multiply(X1,X2),additive_inverse(X3)),
inference(spm,[status(thm)],[c_0_34,c_0_30]) ).
cnf(c_0_42,negated_conjecture,
add(multiply(multiply(x,y),x),additive_inverse(multiply(x,multiply(y,x)))) != additive_identity,
inference(rw,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_43,plain,
add(multiply(multiply(X1,X2),X3),multiply(X1,multiply(X2,additive_inverse(X2)))) = multiply(multiply(X1,X2),add(X3,additive_inverse(X2))),
inference(spm,[status(thm)],[c_0_25,c_0_38]) ).
cnf(c_0_44,plain,
multiply(multiply(X1,X2),add(X2,X1)) = multiply(X1,multiply(X2,add(X2,X1))),
inference(rw,[status(thm)],[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_39,c_0_40]),c_0_34]),c_0_41]),c_0_28]),c_0_34]),c_0_30]),c_0_28]) ).
cnf(c_0_45,plain,
add(X1,add(X2,additive_inverse(X1))) = X2,
inference(spm,[status(thm)],[c_0_22,c_0_35]) ).
cnf(c_0_46,negated_conjecture,
add(multiply(multiply(x,y),x),multiply(x,multiply(y,additive_inverse(x)))) != additive_identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_30]),c_0_30]) ).
cnf(c_0_47,plain,
multiply(multiply(X1,X2),X1) = multiply(X1,multiply(X2,X1)),
inference(rw,[status(thm)],[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_43,c_0_44]),c_0_25]),c_0_25]),c_0_17]),c_0_45]),c_0_17]),c_0_45]) ).
cnf(c_0_48,axiom,
multiply(X1,additive_identity) = additive_identity,
right_multiplicative_zero ).
cnf(c_0_49,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47]),c_0_25]),c_0_25]),c_0_18]),c_0_48]),c_0_48])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : RNG025-7 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.45 % Computer : n007.cluster.edu
% 0.18/0.45 % Model : x86_64 x86_64
% 0.18/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.45 % Memory : 8046.5625MB
% 0.18/0.45 % OS : Linux 6.8.0-71-generic
% 0.18/0.45 % CPULimit : 300
% 0.18/0.45 % WCLimit : 300
% 0.18/0.45 % DateTime : Mon Sep 21 04:09:50 UTC 2026
% 0.18/0.45 % CPUTime :
% 0.18/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.51 Running first-order theorem proving
% 0.23/0.51 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
% 17.02/3.01 % Version: 3.5.1
% 17.02/3.01 % Preprocessing class: FSMSSMSSSSSNFFN.
% 17.02/3.01 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 17.02/3.01 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 17.02/3.01 % Starting new_bool_3 with 300s (1) cores
% 17.02/3.01 % Starting new_bool_1 with 300s (1) cores
% 17.02/3.01 % Starting sh5l with 300s (1) cores
% 17.02/3.01 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 144833 completed with status 0
% 17.02/3.01 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 17.02/3.01 % Preprocessing class: FSMSSMSSSSSNFFN.
% 17.02/3.01 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 17.02/3.01 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 17.02/3.01 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 17.02/3.01 % No SInE strategy applied
% 17.02/3.01 % Search class: FUUPM-FFMF21-MFFFFFNN
% 17.02/3.01 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 17.02/3.01 % Starting SubtermCWHack with 136s (1) cores
% 17.02/3.01 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 17.02/3.01 % Starting U----_210g_10_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 17.02/3.01 % Starting new_bool_3 with 136s (1) cores
% 17.02/3.01 % Starting new_bool_1 with 136s (1) cores
% 17.02/3.01 % U----_210g_10_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 144840 completed with status 0
% 17.02/3.01 % Result found by U----_210g_10_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 17.02/3.01 % Preprocessing class: FSMSSMSSSSSNFFN.
% 17.02/3.01 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 17.02/3.01 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 17.02/3.01 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 17.02/3.01 % No SInE strategy applied
% 17.02/3.01 % Search class: FUUPM-FFMF21-MFFFFFNN
% 17.02/3.01 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 17.02/3.01 % Starting SubtermCWHack with 136s (1) cores
% 17.02/3.01 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 17.02/3.01 % Starting U----_210g_10_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 17.02/3.01 % Preprocessing time : 0.002 s
% 17.02/3.01 % Presaturation interreduction done
% 17.02/3.01
% 17.02/3.01 % Proof found!
% 17.02/3.01 % SZS status Unsatisfiable
% 17.02/3.01 % SZS output start CNFRefutation
% See solution above
% 17.02/3.01 % Parsed axioms : 23
% 17.02/3.01 % Removed by relevancy pruning/SinE : 0
% 17.02/3.01 % Initial clauses : 23
% 17.02/3.01 % Removed in clause preprocessing : 2
% 17.02/3.01 % Initial clauses in saturation : 21
% 17.02/3.01 % Processed clauses : 3463
% 17.02/3.01 % ...of these trivial : 1993
% 17.02/3.01 % ...subsumed : 1186
% 17.02/3.01 % ...remaining for further processing : 284
% 17.02/3.01 % Other redundant clauses eliminated : 0
% 17.02/3.01 % Clauses deleted for lack of memory : 0
% 17.02/3.01 % Backward-subsumed : 3
% 17.02/3.01 % Backward-rewritten : 20
% 17.02/3.01 % Generated clauses : 64836
% 17.02/3.01 % ...of the previous two non-redundant : 58121
% 17.02/3.01 % ...aggressively subsumed : 0
% 17.02/3.01 % Contextual simplify-reflections : 0
% 17.02/3.01 % Paramodulations : 64836
% 17.02/3.01 % Factorizations : 0
% 17.02/3.01 % NegExts : 0
% 17.02/3.01 % Equation resolutions : 0
% 17.02/3.01 % Disequality decompositions : 0
% 17.02/3.01 % Total rewrite steps : 164245
% 17.02/3.01 % ...of those cached : 127109
% 17.02/3.01 % Propositional unsat checks : 0
% 17.02/3.01 % Propositional check models : 0
% 17.02/3.01 % Propositional check unsatisfiable : 0
% 17.02/3.01 % Propositional clauses : 0
% 17.02/3.01 % Propositional clauses after purity: 0
% 17.02/3.01 % Propositional unsat core size : 0
% 17.02/3.01 % Propositional preprocessing time : 0.000
% 17.02/3.01 % Propositional encoding time : 0.000
% 17.02/3.01 % Propositional solver time : 0.000
% 17.02/3.01 % Success case prop preproc time : 0.000
% 17.02/3.01 % Success case prop encoding time : 0.000
% 17.02/3.01 % Success case prop solver time : 0.000
% 17.02/3.01 % Current number of processed clauses : 244
% 17.02/3.01 % Positive orientable unit clauses : 198
% 17.02/3.01 % Positive unorientable unit clauses: 46
% 17.02/3.01 % Negative unit clauses : 0
% 17.02/3.01 % Non-unit-clauses : 0
% 17.02/3.01 % Current number of unprocessed clauses: 54580
% 17.02/3.01 % ...number of literals in the above : 54580
% 17.02/3.01 % Current number of archived formulas : 0
% 17.02/3.01 % Current number of archived clauses : 42
% 17.02/3.01 % Clause-clause subsumption calls (NU) : 0
% 17.02/3.01 % Rec. Clause-clause subsumption calls : 0
% 17.02/3.01 % Non-unit clause-clause subsumptions : 0
% 17.02/3.01 % Unit Clause-clause subsumption calls : 1131
% 17.02/3.01 % Rewrite failures with RHS unbound : 0
% 17.02/3.01 % BW rewrite match attempts : 1416
% 17.02/3.01 % BW rewrite match successes : 143
% 17.02/3.01 % Condensation attempts : 0
% 17.02/3.01 % Condensation successes : 0
% 17.02/3.01 % Termbank termtop insertions : 1265415
% 17.02/3.01 % Search garbage collected termcells : 2
% 17.02/3.01
% 17.02/3.01 % -------------------------------------------------
% 17.02/3.01 % User time : 2.281 s
% 17.02/3.01 % System time : 0.102 s
% 17.02/3.01 % Total time : 2.383 s
% 17.02/3.01 % Maximum resident set size: 3644 pages
% 17.02/3.01
% 17.02/3.01 % -------------------------------------------------
% 17.02/3.01 % User time : 11.306 s
% 17.02/3.01 % System time : 0.534 s
% 17.02/3.01 % Total time : 11.841 s
% 17.02/3.01 % Maximum resident set size: 4864 pages
% 17.02/3.01 % E exiting
%------------------------------------------------------------------------------