%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : RNG012-6 : 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 : n026.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:30 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.50s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 11
% Syntax : Number of clauses : 34 ( 34 unt; 0 nHn; 5 RR)
% Number of literals : 34 ( 33 equ; 3 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 54 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
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(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(commutativity_for_addition,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',commutativity_for_addition) ).
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(right_multiplicative_zero,axiom,
multiply(X1,additive_identity) = additive_identity,
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',right_multiplicative_zero) ).
cnf(right_additive_identity,axiom,
add(X1,additive_identity) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',right_additive_identity) ).
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(prove_equation,negated_conjecture,
multiply(additive_inverse(a),additive_inverse(b)) != multiply(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_equation) ).
cnf(left_multiplicative_zero,axiom,
multiply(additive_identity,X1) = additive_identity,
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',left_multiplicative_zero) ).
cnf(c_0_11,axiom,
add(X1,add(X2,X3)) = add(add(X1,X2),X3),
associativity_for_addition ).
cnf(c_0_12,axiom,
add(X1,additive_inverse(X1)) = additive_identity,
right_additive_inverse ).
cnf(c_0_13,axiom,
add(additive_identity,X1) = X1,
left_additive_identity ).
cnf(c_0_14,plain,
add(X1,add(additive_inverse(X1),X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_15,axiom,
additive_inverse(additive_inverse(X1)) = X1,
additive_inverse_additive_inverse ).
cnf(c_0_16,plain,
add(additive_inverse(X1),add(X1,X2)) = X2,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,axiom,
add(X1,X2) = add(X2,X1),
commutativity_for_addition ).
cnf(c_0_18,plain,
add(additive_inverse(X1),add(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,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_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(multiply(X1,X2),additive_inverse(multiply(X1,add(X2,X3)))) = additive_inverse(multiply(X1,X3)),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,axiom,
multiply(X1,additive_identity) = additive_identity,
right_multiplicative_zero ).
cnf(c_0_23,plain,
additive_inverse(additive_identity) = additive_identity,
inference(spm,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_24,axiom,
add(X1,additive_identity) = X1,
right_additive_identity ).
cnf(c_0_25,plain,
additive_inverse(multiply(X1,additive_inverse(X2))) = multiply(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_12]),c_0_22]),c_0_23]),c_0_24]) ).
cnf(c_0_26,axiom,
multiply(add(X1,X2),X3) = add(multiply(X1,X3),multiply(X2,X3)),
distribute2 ).
cnf(c_0_27,plain,
additive_inverse(multiply(X1,X2)) = multiply(X1,additive_inverse(X2)),
inference(spm,[status(thm)],[c_0_15,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
multiply(additive_inverse(a),additive_inverse(b)) != multiply(a,b),
inference(fof_simplification,[status(thm)],[prove_equation]) ).
cnf(c_0_29,plain,
add(multiply(X1,X2),multiply(add(X1,X3),additive_inverse(X2))) = multiply(X3,additive_inverse(X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_26]),c_0_27]),c_0_27]) ).
cnf(c_0_30,axiom,
multiply(additive_identity,X1) = additive_identity,
left_multiplicative_zero ).
cnf(c_0_31,negated_conjecture,
multiply(additive_inverse(a),additive_inverse(b)) != multiply(a,b),
c_0_28 ).
cnf(c_0_32,plain,
multiply(additive_inverse(X1),additive_inverse(X2)) = multiply(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_12]),c_0_30]),c_0_24]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG012-6 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.36 % Computer : n026.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Mon Sep 21 04:13:22 UTC 2026
% 0.08/0.37 % CPUTime :
% 0.08/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.44 Running first-order theorem proving
% 0.14/0.44 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.14/0.50 % Version: 3.5.1
% 0.14/0.50 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.50 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.50 % Starting sh5l with 300s (1) cores
% 0.14/0.50 % sh5l with pid 1338232 completed with status 0
% 0.14/0.50 % Result found by sh5l
% 0.14/0.50 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.50 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.50 % Starting sh5l with 300s (1) cores
% 0.14/0.50 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.14/0.50 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.50 % Search class: FUUPM-FFSF21-SFFFFFNN
% 0.14/0.50 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.50 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.50 % SubtermCWHack with pid 1338236 completed with status 0
% 0.14/0.50 % Result found by SubtermCWHack
% 0.14/0.50 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.50 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.50 % Starting sh5l with 300s (1) cores
% 0.14/0.50 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.14/0.50 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.50 % Search class: FUUPM-FFSF21-SFFFFFNN
% 0.14/0.50 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.50 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.50 % Preprocessing time : 0.001 s
% 0.14/0.50
% 0.14/0.50 % Proof found!
% 0.14/0.50 % SZS status Unsatisfiable
% 0.14/0.50 % SZS output start CNFRefutation
% See solution above
% 0.14/0.50 % Parsed axioms : 16
% 0.14/0.50 % Removed by relevancy pruning/SinE : 2
% 0.14/0.50 % Initial clauses : 14
% 0.14/0.50 % Removed in clause preprocessing : 0
% 0.14/0.50 % Initial clauses in saturation : 14
% 0.14/0.50 % Processed clauses : 419
% 0.14/0.50 % ...of these trivial : 87
% 0.14/0.50 % ...subsumed : 270
% 0.14/0.50 % ...remaining for further processing : 62
% 0.14/0.50 % Other redundant clauses eliminated : 0
% 0.14/0.50 % Clauses deleted for lack of memory : 0
% 0.14/0.50 % Backward-subsumed : 0
% 0.14/0.50 % Backward-rewritten : 12
% 0.14/0.50 % Generated clauses : 2622
% 0.14/0.50 % ...of the previous two non-redundant : 1895
% 0.14/0.50 % ...aggressively subsumed : 0
% 0.14/0.50 % Contextual simplify-reflections : 0
% 0.14/0.50 % Paramodulations : 2622
% 0.14/0.50 % Factorizations : 0
% 0.14/0.50 % NegExts : 0
% 0.14/0.50 % Equation resolutions : 0
% 0.14/0.50 % Disequality decompositions : 0
% 0.14/0.50 % Total rewrite steps : 4146
% 0.14/0.50 % ...of those cached : 2865
% 0.14/0.50 % Propositional unsat checks : 0
% 0.14/0.50 % Propositional check models : 0
% 0.14/0.50 % Propositional check unsatisfiable : 0
% 0.14/0.50 % Propositional clauses : 0
% 0.14/0.50 % Propositional clauses after purity: 0
% 0.14/0.50 % Propositional unsat core size : 0
% 0.14/0.50 % Propositional preprocessing time : 0.000
% 0.14/0.50 % Propositional encoding time : 0.000
% 0.14/0.50 % Propositional solver time : 0.000
% 0.14/0.50 % Success case prop preproc time : 0.000
% 0.14/0.50 % Success case prop encoding time : 0.000
% 0.14/0.50 % Success case prop solver time : 0.000
% 0.14/0.50 % Current number of processed clauses : 50
% 0.14/0.50 % Positive orientable unit clauses : 43
% 0.14/0.50 % Positive unorientable unit clauses: 7
% 0.14/0.50 % Negative unit clauses : 0
% 0.14/0.50 % Non-unit-clauses : 0
% 0.14/0.50 % Current number of unprocessed clauses: 1462
% 0.14/0.50 % ...number of literals in the above : 1462
% 0.14/0.50 % Current number of archived formulas : 0
% 0.14/0.50 % Current number of archived clauses : 12
% 0.14/0.50 % Clause-clause subsumption calls (NU) : 0
% 0.14/0.50 % Rec. Clause-clause subsumption calls : 0
% 0.14/0.50 % Non-unit clause-clause subsumptions : 0
% 0.14/0.50 % Unit Clause-clause subsumption calls : 10
% 0.14/0.50 % Rewrite failures with RHS unbound : 0
% 0.14/0.50 % BW rewrite match attempts : 105
% 0.14/0.50 % BW rewrite match successes : 50
% 0.14/0.50 % Condensation attempts : 0
% 0.14/0.50 % Condensation successes : 0
% 0.14/0.50 % Termbank termtop insertions : 26147
% 0.14/0.50 % Search garbage collected termcells : 13
% 0.14/0.50
% 0.14/0.50 % -------------------------------------------------
% 0.14/0.50 % User time : 0.026 s
% 0.14/0.50 % System time : 0.004 s
% 0.14/0.50 % Total time : 0.030 s
% 0.14/0.50 % Maximum resident set size: 3644 pages
% 0.14/0.50
% 0.14/0.50 % -------------------------------------------------
% 0.14/0.50 % User time : 0.028 s
% 0.14/0.50 % System time : 0.010 s
% 0.14/0.50 % Total time : 0.038 s
% 0.14/0.50 % Maximum resident set size: 4608 pages
% 0.14/0.50 % E exiting
%------------------------------------------------------------------------------