%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : RNG019-6 : 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 : n009.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:31 PM UTC 2026
% Result : Unsatisfiable 0.23s 5.58s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 27 ( 27 unt; 0 nHn; 6 RR)
% Number of literals : 27 ( 26 equ; 5 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 43 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity_for_addition,axiom,
add(X1,add(X2,X3)) = add(add(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/Axioms/RNG003-0.ax',associativity_for_addition) ).
cnf(right_additive_inverse,axiom,
add(X1,additive_inverse(X1)) = additive_identity,
file('/export/starexec/sandbox/benchmark/Axioms/RNG003-0.ax',right_additive_inverse) ).
cnf(left_additive_identity,axiom,
add(additive_identity,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/RNG003-0.ax',left_additive_identity) ).
cnf(additive_inverse_additive_inverse,axiom,
additive_inverse(additive_inverse(X1)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/RNG003-0.ax',additive_inverse_additive_inverse) ).
cnf(prove_linearised_form1,negated_conjecture,
associator(x,y,add(u,v)) != add(associator(x,y,u),associator(x,y,v)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_linearised_form1) ).
cnf(commutativity_for_addition,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/RNG003-0.ax',associator) ).
cnf(distribute1,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/RNG003-0.ax',distribute1) ).
cnf(c_0_8,axiom,
add(X1,add(X2,X3)) = add(add(X1,X2),X3),
associativity_for_addition ).
cnf(c_0_9,axiom,
add(X1,additive_inverse(X1)) = additive_identity,
right_additive_inverse ).
cnf(c_0_10,axiom,
add(additive_identity,X1) = X1,
left_additive_identity ).
cnf(c_0_11,plain,
add(X1,add(additive_inverse(X1),X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
cnf(c_0_12,axiom,
additive_inverse(additive_inverse(X1)) = X1,
additive_inverse_additive_inverse ).
cnf(c_0_13,negated_conjecture,
associator(x,y,add(u,v)) != add(associator(x,y,u),associator(x,y,v)),
inference(fof_simplification,[status(thm)],[prove_linearised_form1]) ).
cnf(c_0_14,plain,
add(additive_inverse(X1),add(X1,X2)) = X2,
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,axiom,
add(X1,X2) = add(X2,X1),
commutativity_for_addition ).
cnf(c_0_16,negated_conjecture,
associator(x,y,add(u,v)) != add(associator(x,y,u),associator(x,y,v)),
c_0_13 ).
cnf(c_0_17,axiom,
associator(X1,X2,X3) = add(multiply(multiply(X1,X2),X3),additive_inverse(multiply(X1,multiply(X2,X3)))),
associator ).
cnf(c_0_18,plain,
add(additive_inverse(X1),add(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
add(multiply(multiply(x,y),add(u,v)),additive_inverse(multiply(x,multiply(y,add(u,v))))) != add(add(multiply(multiply(x,y),u),additive_inverse(multiply(x,multiply(y,u)))),add(multiply(multiply(x,y),v),additive_inverse(multiply(x,multiply(y,v))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_17]),c_0_17]) ).
cnf(c_0_20,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
distribute1 ).
cnf(c_0_21,plain,
add(X1,additive_inverse(add(X1,X2))) = additive_inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_18]),c_0_15]) ).
cnf(c_0_22,negated_conjecture,
add(multiply(multiply(x,y),u),add(multiply(multiply(x,y),v),additive_inverse(add(multiply(x,multiply(y,u)),multiply(x,multiply(y,v)))))) != add(multiply(multiply(x,y),u),add(additive_inverse(multiply(x,multiply(y,u))),add(multiply(multiply(x,y),v),additive_inverse(multiply(x,multiply(y,v)))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_8]),c_0_20]),c_0_20]),c_0_20]),c_0_8]) ).
cnf(c_0_23,plain,
additive_inverse(add(X1,X2)) = add(additive_inverse(X1),additive_inverse(X2)),
inference(spm,[status(thm)],[c_0_14,c_0_21]) ).
cnf(c_0_24,plain,
add(X1,X2) = add(X2,X1),
c_0_15 ).
cnf(c_0_25,plain,
add(add(X1,X2),X3) = add(X1,add(X2,X3)),
c_0_8 ).
cnf(c_0_26,negated_conjecture,
$false,
inference(ar,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24,c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : RNG019-6 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/5.46 % Computer : n009.cluster.edu
% 0.19/5.46 % Model : x86_64 x86_64
% 0.19/5.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/5.46 % Memory : 8046.5625MB
% 0.19/5.46 % OS : Linux 6.8.0-71-generic
% 0.19/5.46 % CPULimit : 300
% 0.19/5.46 % WCLimit : 300
% 0.19/5.46 % DateTime : Mon Sep 21 04:11:18 UTC 2026
% 0.19/5.46 % CPUTime :
% 0.19/5.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/5.51 Running first-order theorem proving
% 0.23/5.51 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.23/5.58 % Version: 3.5.1
% 0.23/5.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/5.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/5.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/5.58 % Starting new_bool_3 with 300s (1) cores
% 0.23/5.58 % Starting new_bool_1 with 300s (1) cores
% 0.23/5.58 % Starting sh5l with 300s (1) cores
% 0.23/5.58 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 816546 completed with status 0
% 0.23/5.58 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.23/5.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/5.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/5.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/5.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/5.58 % No SInE strategy applied
% 0.23/5.58 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.23/5.58 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/5.58 % Starting SubtermCWHack with 136s (1) cores
% 0.23/5.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.23/5.58 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 0.23/5.58 % Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.23/5.58 % Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.23/5.58 % U----_043_B31_F1_PI_AE_CS_SP_S2S with pid 816557 completed with status 0
% 0.23/5.58 % Result found by U----_043_B31_F1_PI_AE_CS_SP_S2S
% 0.23/5.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/5.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/5.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/5.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/5.58 % No SInE strategy applied
% 0.23/5.58 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.23/5.58 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/5.58 % Starting SubtermCWHack with 136s (1) cores
% 0.23/5.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.23/5.58 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 0.23/5.58 % Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.23/5.58 % Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.23/5.58 % Preprocessing time : 0.002 s
% 0.23/5.58
% 0.23/5.58 % Proof found!
% 0.23/5.58 % SZS status Unsatisfiable
% 0.23/5.58 % SZS output start CNFRefutation
% See solution above
% 0.23/5.58 % Parsed axioms : 16
% 0.23/5.58 % Removed by relevancy pruning/SinE : 0
% 0.23/5.58 % Initial clauses : 16
% 0.23/5.58 % Removed in clause preprocessing : 2
% 0.23/5.58 % Initial clauses in saturation : 14
% 0.23/5.58 % Processed clauses : 32
% 0.23/5.58 % ...of these trivial : 6
% 0.23/5.58 % ...subsumed : 3
% 0.23/5.58 % ...remaining for further processing : 23
% 0.23/5.58 % Other redundant clauses eliminated : 0
% 0.23/5.58 % Clauses deleted for lack of memory : 0
% 0.23/5.58 % Backward-subsumed : 0
% 0.23/5.58 % Backward-rewritten : 3
% 0.23/5.58 % Generated clauses : 176
% 0.23/5.58 % ...of the previous two non-redundant : 85
% 0.23/5.58 % ...aggressively subsumed : 0
% 0.23/5.58 % Contextual simplify-reflections : 0
% 0.23/5.58 % Paramodulations : 176
% 0.23/5.58 % Factorizations : 0
% 0.23/5.58 % NegExts : 0
% 0.23/5.58 % Equation resolutions : 0
% 0.23/5.58 % Disequality decompositions : 0
% 0.23/5.58 % Total rewrite steps : 255
% 0.23/5.58 % ...of those cached : 144
% 0.23/5.58 % Propositional unsat checks : 0
% 0.23/5.58 % Propositional check models : 0
% 0.23/5.58 % Propositional check unsatisfiable : 0
% 0.23/5.58 % Propositional clauses : 0
% 0.23/5.58 % Propositional clauses after purity: 0
% 0.23/5.58 % Propositional unsat core size : 0
% 0.23/5.58 % Propositional preprocessing time : 0.000
% 0.23/5.58 % Propositional encoding time : 0.000
% 0.23/5.58 % Propositional solver time : 0.000
% 0.23/5.58 % Success case prop preproc time : 0.000
% 0.23/5.58 % Success case prop encoding time : 0.000
% 0.23/5.58 % Success case prop solver time : 0.000
% 0.23/5.58 % Current number of processed clauses : 20
% 0.23/5.58 % Positive orientable unit clauses : 18
% 0.23/5.58 % Positive unorientable unit clauses: 1
% 0.23/5.58 % Negative unit clauses : 1
% 0.23/5.58 % Non-unit-clauses : 0
% 0.23/5.58 % Current number of unprocessed clauses: 62
% 0.23/5.58 % ...number of literals in the above : 62
% 0.23/5.58 % Current number of archived formulas : 0
% 0.23/5.58 % Current number of archived clauses : 5
% 0.23/5.58 % Clause-clause subsumption calls (NU) : 0
% 0.23/5.58 % Rec. Clause-clause subsumption calls : 0
% 0.23/5.58 % Non-unit clause-clause subsumptions : 0
% 0.23/5.58 % Unit Clause-clause subsumption calls : 0
% 0.23/5.58 % Rewrite failures with RHS unbound : 0
% 0.23/5.58 % BW rewrite match attempts : 32
% 0.23/5.58 % BW rewrite match successes : 18
% 0.23/5.58 % Condensation attempts : 0
% 0.23/5.58 % Condensation successes : 0
% 0.23/5.58 % Termbank termtop insertions : 1611
% 0.23/5.58 % Search garbage collected termcells : 2
% 0.23/5.58
% 0.23/5.58 % -------------------------------------------------
% 0.23/5.58 % User time : 0.008 s
% 0.23/5.58 % System time : 0.004 s
% 0.23/5.58 % Total time : 0.012 s
% 0.23/5.58 % Maximum resident set size: 3600 pages
% 0.23/5.58
% 0.23/5.58 % -------------------------------------------------
% 0.23/5.58 % User time : 0.067 s
% 0.23/5.58 % System time : 0.018 s
% 0.23/5.58 % Total time : 0.086 s
% 0.23/5.58 % Maximum resident set size: 4608 pages
% 0.23/5.58 % E exiting
%------------------------------------------------------------------------------