%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : RNG018-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 : n013.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.14s 0.66s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 25 ( 25 unt; 0 nHn; 5 RR)
% Number of literals : 25 ( 24 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 36 ( 2 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(prove_distributivity,negated_conjecture,
multiply(add(x,y),additive_inverse(z)) != add(additive_inverse(multiply(x,z)),additive_inverse(multiply(y,z))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_distributivity) ).
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(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(right_multiplicative_zero,axiom,
multiply(X1,additive_identity) = additive_identity,
file('/export/starexec/sandbox/benchmark/Axioms/RNG003-0.ax',right_multiplicative_zero) ).
cnf(distribute2,axiom,
multiply(add(X1,X2),X3) = add(multiply(X1,X3),multiply(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/RNG003-0.ax',distribute2) ).
cnf(right_additive_identity,axiom,
add(X1,additive_identity) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/RNG003-0.ax',right_additive_identity) ).
cnf(c_0_9,axiom,
add(X1,add(X2,X3)) = add(add(X1,X2),X3),
associativity_for_addition ).
cnf(c_0_10,axiom,
add(X1,additive_inverse(X1)) = additive_identity,
right_additive_inverse ).
cnf(c_0_11,axiom,
add(additive_identity,X1) = X1,
left_additive_identity ).
cnf(c_0_12,negated_conjecture,
multiply(add(x,y),additive_inverse(z)) != add(additive_inverse(multiply(x,z)),additive_inverse(multiply(y,z))),
inference(fof_simplification,[status(thm)],[prove_distributivity]) ).
cnf(c_0_13,plain,
add(X1,add(additive_inverse(X1),X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_14,axiom,
additive_inverse(additive_inverse(X1)) = X1,
additive_inverse_additive_inverse ).
cnf(c_0_15,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
distribute1 ).
cnf(c_0_16,axiom,
multiply(X1,additive_identity) = additive_identity,
right_multiplicative_zero ).
cnf(c_0_17,negated_conjecture,
multiply(add(x,y),additive_inverse(z)) != add(additive_inverse(multiply(x,z)),additive_inverse(multiply(y,z))),
c_0_12 ).
cnf(c_0_18,axiom,
multiply(add(X1,X2),X3) = add(multiply(X1,X3),multiply(X2,X3)),
distribute2 ).
cnf(c_0_19,plain,
add(additive_inverse(X1),add(X1,X2)) = X2,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
add(multiply(X1,X2),multiply(X1,additive_inverse(X2))) = additive_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_10]),c_0_16]) ).
cnf(c_0_21,axiom,
add(X1,additive_identity) = X1,
right_additive_identity ).
cnf(c_0_22,negated_conjecture,
add(additive_inverse(multiply(x,z)),additive_inverse(multiply(y,z))) != add(multiply(x,additive_inverse(z)),multiply(y,additive_inverse(z))),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
additive_inverse(multiply(X1,X2)) = multiply(X1,additive_inverse(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG018-6 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.59 % Computer : n013.cluster.edu
% 0.11/0.59 % Model : x86_64 x86_64
% 0.11/0.59 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.59 % Memory : 8046.5625MB
% 0.11/0.59 % OS : Linux 6.8.0-71-generic
% 0.11/0.59 % CPULimit : 300
% 0.11/0.59 % WCLimit : 300
% 0.11/0.59 % DateTime : Mon Sep 21 04:10:37 UTC 2026
% 0.11/0.59 % CPUTime :
% 0.11/0.59 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.63 Running first-order theorem proving
% 0.14/0.63 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.14/0.66 % Version: 3.5.1
% 0.14/0.66 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.66 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.66 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.66 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.66 % Starting sh5l with 300s (1) cores
% 0.14/0.66 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4110685 completed with status 0
% 0.14/0.66 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.66 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.66 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.66 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.66 % No SInE strategy applied
% 0.14/0.66 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.14/0.66 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.66 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.66 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.66 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 0.14/0.66 % Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.14/0.66 % Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.14/0.66 % U----_043_B31_F1_PI_AE_CS_SP_S2S with pid 4110696 completed with status 0
% 0.14/0.66 % Result found by U----_043_B31_F1_PI_AE_CS_SP_S2S
% 0.14/0.66 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.66 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.66 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.66 % No SInE strategy applied
% 0.14/0.66 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.14/0.66 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.66 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.66 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.66 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 0.14/0.66 % Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.14/0.66 % Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.14/0.66 % Preprocessing time : 0.001 s
% 0.14/0.66
% 0.14/0.66 % Proof found!
% 0.14/0.66 % SZS status Unsatisfiable
% 0.14/0.66 % SZS output start CNFRefutation
% See solution above
% 0.14/0.66 % Parsed axioms : 16
% 0.14/0.66 % Removed by relevancy pruning/SinE : 0
% 0.14/0.66 % Initial clauses : 16
% 0.14/0.66 % Removed in clause preprocessing : 2
% 0.14/0.66 % Initial clauses in saturation : 14
% 0.14/0.66 % Processed clauses : 50
% 0.14/0.66 % ...of these trivial : 14
% 0.14/0.66 % ...subsumed : 10
% 0.14/0.66 % ...remaining for further processing : 26
% 0.14/0.66 % Other redundant clauses eliminated : 0
% 0.14/0.66 % Clauses deleted for lack of memory : 0
% 0.14/0.66 % Backward-subsumed : 0
% 0.14/0.66 % Backward-rewritten : 5
% 0.14/0.66 % Generated clauses : 261
% 0.14/0.66 % ...of the previous two non-redundant : 145
% 0.14/0.66 % ...aggressively subsumed : 0
% 0.14/0.66 % Contextual simplify-reflections : 0
% 0.14/0.66 % Paramodulations : 261
% 0.14/0.66 % Factorizations : 0
% 0.14/0.66 % NegExts : 0
% 0.14/0.66 % Equation resolutions : 0
% 0.14/0.66 % Disequality decompositions : 0
% 0.14/0.66 % Total rewrite steps : 425
% 0.14/0.66 % ...of those cached : 267
% 0.14/0.66 % Propositional unsat checks : 0
% 0.14/0.66 % Propositional check models : 0
% 0.14/0.66 % Propositional check unsatisfiable : 0
% 0.14/0.66 % Propositional clauses : 0
% 0.14/0.66 % Propositional clauses after purity: 0
% 0.14/0.66 % Propositional unsat core size : 0
% 0.14/0.66 % Propositional preprocessing time : 0.000
% 0.14/0.66 % Propositional encoding time : 0.000
% 0.14/0.66 % Propositional solver time : 0.000
% 0.14/0.66 % Success case prop preproc time : 0.000
% 0.14/0.66 % Success case prop encoding time : 0.000
% 0.14/0.66 % Success case prop solver time : 0.000
% 0.14/0.66 % Current number of processed clauses : 21
% 0.14/0.66 % Positive orientable unit clauses : 19
% 0.14/0.66 % Positive unorientable unit clauses: 2
% 0.14/0.66 % Negative unit clauses : 0
% 0.14/0.66 % Non-unit-clauses : 0
% 0.14/0.66 % Current number of unprocessed clauses: 100
% 0.14/0.66 % ...number of literals in the above : 100
% 0.14/0.66 % Current number of archived formulas : 0
% 0.14/0.66 % Current number of archived clauses : 7
% 0.14/0.66 % Clause-clause subsumption calls (NU) : 0
% 0.14/0.66 % Rec. Clause-clause subsumption calls : 0
% 0.14/0.66 % Non-unit clause-clause subsumptions : 0
% 0.14/0.66 % Unit Clause-clause subsumption calls : 1
% 0.14/0.66 % Rewrite failures with RHS unbound : 0
% 0.14/0.66 % BW rewrite match attempts : 35
% 0.14/0.66 % BW rewrite match successes : 28
% 0.14/0.66 % Condensation attempts : 0
% 0.14/0.66 % Condensation successes : 0
% 0.14/0.66 % Termbank termtop insertions : 2207
% 0.14/0.66 % Search garbage collected termcells : 2
% 0.14/0.66
% 0.14/0.66 % -------------------------------------------------
% 0.14/0.66 % User time : 0.005 s
% 0.14/0.66 % System time : 0.003 s
% 0.14/0.66 % Total time : 0.008 s
% 0.14/0.66 % Maximum resident set size: 3644 pages
% 0.14/0.66
% 0.14/0.66 % -------------------------------------------------
% 0.14/0.66 % User time : 0.026 s
% 0.14/0.66 % System time : 0.017 s
% 0.14/0.66 % Total time : 0.044 s
% 0.14/0.66 % Maximum resident set size: 4864 pages
% 0.14/0.66 % E exiting
%------------------------------------------------------------------------------