%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : RNG025-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 : n020.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:32 PM UTC 2026
% Result : Unsatisfiable 282.99s 36.60s
% Output : CNFRefutation 282.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 14
% Syntax : Number of clauses : 45 ( 41 unt; 0 nHn; 8 RR)
% Number of literals : 49 ( 48 equ; 7 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 89 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(multiply_over_add2,axiom,
multiply(add(X1,X2),X3) = add(multiply(X1,X3),multiply(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG004-0.ax',multiply_over_add2) ).
cnf(right_alternative,axiom,
multiply(multiply(X1,X2),X2) = multiply(X1,multiply(X2,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG004-0.ax',right_alternative) ).
cnf(add_inverse,axiom,
add(additive_inverse(X1),X1) = additive_identity,
file('/export/starexec/sandbox2/benchmark/Axioms/RNG004-0.ax',add_inverse) ).
cnf(commutativity_for_addition,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG004-0.ax',commutativity_for_addition) ).
cnf(left_alternative,axiom,
multiply(multiply(X1,X1),X2) = multiply(X1,multiply(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG004-0.ax',left_alternative) ).
cnf(associativity_for_addition,axiom,
add(X1,add(X2,X3)) = add(add(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG004-0.ax',associativity_for_addition) ).
cnf(left_additive_identity,axiom,
add(additive_identity,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/RNG004-0.ax',left_additive_identity) ).
cnf(inverse_product1,axiom,
multiply(additive_inverse(X1),X2) = additive_inverse(multiply(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG004-0.ax',inverse_product1) ).
cnf(inverse_product2,axiom,
multiply(X1,additive_inverse(X2)) = additive_inverse(multiply(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG004-0.ax',inverse_product2) ).
cnf(right_cancellation_for_addition,axiom,
( add(X1,X2) != add(X1,X3)
| X2 = X3 ),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG004-0.ax',right_cancellation_for_addition) ).
cnf(multiply_over_add1,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG004-0.ax',multiply_over_add1) ).
cnf(sum_of_inverses,axiom,
additive_inverse(add(X1,X2)) = add(additive_inverse(X1),additive_inverse(X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG004-0.ax',sum_of_inverses) ).
cnf(additive_inverse_additive_inverse,axiom,
additive_inverse(additive_inverse(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/RNG004-0.ax',additive_inverse_additive_inverse) ).
cnf(prove_middle_law,negated_conjecture,
multiply(multiply(cy,cx),cy) != multiply(cy,multiply(cx,cy)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_middle_law) ).
cnf(c_0_14,axiom,
multiply(add(X1,X2),X3) = add(multiply(X1,X3),multiply(X2,X3)),
multiply_over_add2 ).
cnf(c_0_15,axiom,
multiply(multiply(X1,X2),X2) = multiply(X1,multiply(X2,X2)),
right_alternative ).
cnf(c_0_16,axiom,
add(additive_inverse(X1),X1) = additive_identity,
add_inverse ).
cnf(c_0_17,axiom,
add(X1,X2) = add(X2,X1),
commutativity_for_addition ).
cnf(c_0_18,plain,
add(multiply(X1,X2),multiply(X3,multiply(X2,X2))) = multiply(add(X1,multiply(X3,X2)),X2),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,axiom,
multiply(multiply(X1,X1),X2) = multiply(X1,multiply(X1,X2)),
left_alternative ).
cnf(c_0_20,axiom,
add(X1,add(X2,X3)) = add(add(X1,X2),X3),
associativity_for_addition ).
cnf(c_0_21,plain,
add(X1,additive_inverse(X1)) = additive_identity,
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,axiom,
add(additive_identity,X1) = X1,
left_additive_identity ).
cnf(c_0_23,axiom,
multiply(additive_inverse(X1),X2) = additive_inverse(multiply(X1,X2)),
inverse_product1 ).
cnf(c_0_24,axiom,
multiply(X1,additive_inverse(X2)) = additive_inverse(multiply(X1,X2)),
inverse_product2 ).
cnf(c_0_25,plain,
( add(X1,X2) != add(X1,X3)
| X2 = X3 ),
inference(fof_simplification,[status(thm)],[right_cancellation_for_addition]) ).
cnf(c_0_26,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
multiply_over_add1 ).
cnf(c_0_27,plain,
add(multiply(X1,multiply(X1,X2)),multiply(X3,multiply(X2,X2))) = multiply(add(multiply(X1,X1),multiply(X3,X2)),X2),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_28,plain,
add(X1,add(additive_inverse(X1),X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_29,axiom,
additive_inverse(add(X1,X2)) = add(additive_inverse(X1),additive_inverse(X2)),
sum_of_inverses ).
cnf(c_0_30,plain,
multiply(additive_inverse(X1),X2) = multiply(X1,additive_inverse(X2)),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,plain,
( add(X1,X2) != add(X1,X3)
| X2 = X3 ),
c_0_25 ).
cnf(c_0_32,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_24,c_0_15]),c_0_24]),c_0_24]) ).
cnf(c_0_33,plain,
multiply(multiply(X1,add(X1,X2)),X2) = multiply(X1,multiply(add(X1,X2),X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_26]),c_0_14]) ).
cnf(c_0_34,plain,
add(X1,additive_inverse(add(X1,X2))) = additive_inverse(X2),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,plain,
multiply(multiply(X1,additive_inverse(X2)),X3) = multiply(multiply(X1,X2),additive_inverse(X3)),
inference(spm,[status(thm)],[c_0_30,c_0_24]) ).
cnf(c_0_36,axiom,
additive_inverse(additive_inverse(X1)) = X1,
additive_inverse_additive_inverse ).
cnf(c_0_37,plain,
( add(X3,X1) != add(X2,X3)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_31,c_0_17]) ).
cnf(c_0_38,negated_conjecture,
multiply(multiply(cy,cx),cy) != multiply(cy,multiply(cx,cy)),
inference(fof_simplification,[status(thm)],[prove_middle_law]) ).
cnf(c_0_39,plain,
add(multiply(X1,multiply(X2,additive_inverse(X2))),multiply(multiply(X1,X2),X3)) = multiply(multiply(X1,X2),add(additive_inverse(X2),X3)),
inference(spm,[status(thm)],[c_0_26,c_0_32]) ).
cnf(c_0_40,plain,
multiply(multiply(X1,X2),add(X1,X2)) = multiply(X1,multiply(X2,add(X1,X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_36]),c_0_30]),c_0_36]) ).
cnf(c_0_41,plain,
add(additive_inverse(X1),add(X2,X1)) = X2,
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_28])]) ).
cnf(c_0_42,negated_conjecture,
multiply(multiply(cy,cx),cy) != multiply(cy,multiply(cx,cy)),
c_0_38 ).
cnf(c_0_43,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(spm,[status(thm)],[c_0_39,c_0_40]),c_0_26]),c_0_26]),c_0_41]),c_0_41]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : RNG025-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.16/0.57 % Computer : n020.cluster.edu
% 0.16/0.57 % Model : x86_64 x86_64
% 0.16/0.57 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.57 % Memory : 8046.5625MB
% 0.16/0.57 % OS : Linux 6.8.0-71-generic
% 0.16/0.57 % CPULimit : 300
% 0.16/0.57 % WCLimit : 300
% 0.16/0.57 % DateTime : Mon Sep 21 04:12:32 UTC 2026
% 0.16/0.58 % CPUTime :
% 0.16/0.58 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.64 Running first-order theorem proving
% 0.20/0.64 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
% 282.99/36.60 % Version: 3.5.1
% 282.99/36.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 282.99/36.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 282.99/36.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 282.99/36.60 % Starting new_bool_3 with 300s (1) cores
% 282.99/36.60 % Starting new_bool_1 with 300s (1) cores
% 282.99/36.60 % Starting sh5l with 300s (1) cores
% 282.99/36.60 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1974392 completed with status 0
% 282.99/36.60 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 282.99/36.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 282.99/36.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 282.99/36.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 282.99/36.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 282.99/36.60 % No SInE strategy applied
% 282.99/36.60 % Search class: FHUPM-FFSF21-SFFFFFNN
% 282.99/36.60 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 282.99/36.60 % Starting SubtermCWHack with 136s (1) cores
% 282.99/36.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 282.99/36.60 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 282.99/36.60 % Starting new_bool_3 with 136s (1) cores
% 282.99/36.60 % Starting new_bool_1 with 136s (1) cores
% 282.99/36.60 % new_bool_1 with pid 1974402 completed with status 0
% 282.99/36.60 % Result found by new_bool_1
% 282.99/36.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 282.99/36.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 282.99/36.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 282.99/36.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 282.99/36.60 % No SInE strategy applied
% 282.99/36.60 % Search class: FHUPM-FFSF21-SFFFFFNN
% 282.99/36.60 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 282.99/36.60 % Starting SubtermCWHack with 136s (1) cores
% 282.99/36.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 282.99/36.60 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 282.99/36.60 % Starting new_bool_3 with 136s (1) cores
% 282.99/36.60 % Starting new_bool_1 with 136s (1) cores
% 282.99/36.60 % Preprocessing time : 0.002 s
% 282.99/36.60 % Presaturation interreduction done
% 282.99/36.60
% 282.99/36.60 % Proof found!
% 282.99/36.60 % SZS status Unsatisfiable
% 282.99/36.60 % SZS output start CNFRefutation
% See solution above
% 282.99/36.60 % Parsed axioms : 18
% 282.99/36.60 % Removed by relevancy pruning/SinE : 0
% 282.99/36.60 % Initial clauses : 18
% 282.99/36.60 % Removed in clause preprocessing : 0
% 282.99/36.60 % Initial clauses in saturation : 18
% 282.99/36.60 % Processed clauses : 28205
% 282.99/36.60 % ...of these trivial : 463
% 282.99/36.60 % ...subsumed : 24959
% 282.99/36.60 % ...remaining for further processing : 2783
% 282.99/36.60 % Other redundant clauses eliminated : 4264
% 282.99/36.60 % Clauses deleted for lack of memory : 0
% 282.99/36.60 % Backward-subsumed : 39
% 282.99/36.60 % Backward-rewritten : 89
% 282.99/36.60 % Generated clauses : 961389
% 282.99/36.60 % ...of the previous two non-redundant : 934418
% 282.99/36.60 % ...aggressively subsumed : 0
% 282.99/36.60 % Contextual simplify-reflections : 0
% 282.99/36.60 % Paramodulations : 956996
% 282.99/36.60 % Factorizations : 0
% 282.99/36.60 % NegExts : 0
% 282.99/36.60 % Equation resolutions : 4393
% 282.99/36.60 % Disequality decompositions : 0
% 282.99/36.60 % Total rewrite steps : 1790692
% 282.99/36.60 % ...of those cached : 1685603
% 282.99/36.60 % Propositional unsat checks : 0
% 282.99/36.60 % Propositional check models : 0
% 282.99/36.60 % Propositional check unsatisfiable : 0
% 282.99/36.60 % Propositional clauses : 0
% 282.99/36.60 % Propositional clauses after purity: 0
% 282.99/36.60 % Propositional unsat core size : 0
% 282.99/36.60 % Propositional preprocessing time : 0.000
% 282.99/36.60 % Propositional encoding time : 0.000
% 282.99/36.60 % Propositional solver time : 0.000
% 282.99/36.60 % Success case prop preproc time : 0.000
% 282.99/36.60 % Success case prop encoding time : 0.000
% 282.99/36.60 % Success case prop solver time : 0.000
% 282.99/36.60 % Current number of processed clauses : 2637
% 282.99/36.60 % Positive orientable unit clauses : 269
% 282.99/36.60 % Positive unorientable unit clauses: 66
% 282.99/36.60 % Negative unit clauses : 0
% 282.99/36.60 % Non-unit-clauses : 2302
% 282.99/36.60 % Current number of unprocessed clauses: 905439
% 282.99/36.60 % ...number of literals in the above : 1704535
% 282.99/36.60 % Current number of archived formulas : 0
% 282.99/36.60 % Current number of archived clauses : 146
% 282.99/36.60 % Clause-clause subsumption calls (NU) : 1722513
% 282.99/36.60 % Rec. Clause-clause subsumption calls : 1616015
% 282.99/36.60 % Non-unit clause-clause subsumptions : 24213
% 282.99/36.60 % Unit Clause-clause subsumption calls : 2393
% 282.99/36.60 % Rewrite failures with RHS unbound : 0
% 282.99/36.60 % BW rewrite match attempts : 5729
% 282.99/36.60 % BW rewrite match successes : 464
% 282.99/36.60 % Condensation attempts : 0
% 282.99/36.60 % Condensation successes : 0
% 282.99/36.60 % Termbank termtop insertions : 18522036
% 282.99/36.60 % Search garbage collected termcells : 8
% 282.99/36.60
% 282.99/36.60 % -------------------------------------------------
% 282.99/36.60 % User time : 34.187 s
% 282.99/36.60 % System time : 1.165 s
% 282.99/36.60 % Total time : 35.353 s
% 282.99/36.60 % Maximum resident set size: 3644 pages
% 282.99/36.60
% 282.99/36.60 % -------------------------------------------------
% 282.99/36.60 % User time : 171.822 s
% 282.99/36.60 % System time : 6.008 s
% 282.99/36.60 % Total time : 177.831 s
% 282.99/36.60 % Maximum resident set size: 4608 pages
% 282.99/36.60 % E exiting
%------------------------------------------------------------------------------