%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : RNG004-3 : 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 : n008.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:59 PM UTC 2026
% Result : Unsatisfiable 70.56s 10.68s
% Output : CNFRefutation 70.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of clauses : 44 ( 23 unt; 0 nHn; 32 RR)
% Number of literals : 99 ( 0 equ; 58 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 113 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(distributivity3,axiom,
( ~ product(X6,X2,X7)
| ~ sum(X1,X4,X6)
| ~ product(X4,X2,X5)
| ~ product(X1,X2,X3)
| sum(X3,X5,X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',distributivity3) ).
cnf(left_inverse,axiom,
sum(additive_inverse(X1),X1,additive_identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_inverse) ).
cnf(distributivity1,axiom,
( ~ product(X1,X6,X7)
| ~ sum(X2,X4,X6)
| ~ product(X1,X4,X5)
| ~ product(X1,X2,X3)
| sum(X3,X5,X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',distributivity1) ).
cnf(a_times_b,hypothesis,
product(a,b,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_times_b) ).
cnf(associativity_of_addition1,axiom,
( ~ sum(X3,X4,X6)
| ~ sum(X2,X4,X5)
| ~ sum(X1,X2,X3)
| sum(X1,X5,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity_of_addition1) ).
cnf(multiplicative_identity1,axiom,
product(additive_identity,X1,additive_identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplicative_identity1) ).
cnf(closure_of_multiplication,axiom,
product(X1,X2,multiply(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',closure_of_multiplication) ).
cnf(additive_identity1,axiom,
sum(additive_identity,X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_identity1) ).
cnf(multiplicative_identity2,axiom,
product(X1,additive_identity,additive_identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplicative_identity2) ).
cnf(addition_is_well_defined,axiom,
( ~ sum(X1,X2,X4)
| ~ sum(X1,X2,X3)
| equalish(X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',addition_is_well_defined) ).
cnf(a_inverse_times_b_inverse,hypothesis,
product(additive_inverse(a),additive_inverse(b),d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_inverse_times_b_inverse) ).
cnf(additive_identity2,axiom,
sum(X1,additive_identity,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_identity2) ).
cnf(prove_c_equals_d,negated_conjecture,
~ equalish(c,d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_c_equals_d) ).
cnf(c_0_13,plain,
( ~ product(X6,X2,X7)
| ~ sum(X1,X4,X6)
| ~ product(X4,X2,X5)
| ~ product(X1,X2,X3)
| sum(X3,X5,X7) ),
inference(fof_simplification,[status(thm)],[distributivity3]) ).
cnf(c_0_14,plain,
( ~ product(X6,X2,X7)
| ~ sum(X1,X4,X6)
| ~ product(X4,X2,X5)
| ~ product(X1,X2,X3)
| sum(X3,X5,X7) ),
c_0_13 ).
cnf(c_0_15,axiom,
sum(additive_inverse(X1),X1,additive_identity),
left_inverse ).
cnf(c_0_16,plain,
( ~ product(X1,X6,X7)
| ~ sum(X2,X4,X6)
| ~ product(X1,X4,X5)
| ~ product(X1,X2,X3)
| sum(X3,X5,X7) ),
inference(fof_simplification,[status(thm)],[distributivity1]) ).
cnf(c_0_17,plain,
( ~ product(X4,X5,X2)
| ~ product(additive_identity,X5,X3)
| ~ product(additive_inverse(X4),X5,X1)
| sum(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,hypothesis,
product(a,b,c),
a_times_b ).
cnf(c_0_19,plain,
( ~ product(X1,X6,X7)
| ~ sum(X2,X4,X6)
| ~ product(X1,X4,X5)
| ~ product(X1,X2,X3)
| sum(X3,X5,X7) ),
c_0_16 ).
cnf(c_0_20,plain,
( ~ sum(X3,X4,X6)
| ~ sum(X2,X4,X5)
| ~ sum(X1,X2,X3)
| sum(X1,X5,X6) ),
inference(fof_simplification,[status(thm)],[associativity_of_addition1]) ).
cnf(c_0_21,hypothesis,
( ~ product(additive_identity,b,X2)
| ~ product(additive_inverse(a),b,X1)
| sum(X1,c,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,axiom,
product(additive_identity,X1,additive_identity),
multiplicative_identity1 ).
cnf(c_0_23,plain,
( ~ product(X4,X5,X2)
| ~ product(X4,additive_identity,X3)
| ~ product(X4,additive_inverse(X5),X1)
| sum(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_19,c_0_15]) ).
cnf(c_0_24,axiom,
product(X1,X2,multiply(X1,X2)),
closure_of_multiplication ).
cnf(c_0_25,plain,
( ~ sum(X3,X4,X6)
| ~ sum(X2,X4,X5)
| ~ sum(X1,X2,X3)
| sum(X1,X5,X6) ),
c_0_20 ).
cnf(c_0_26,axiom,
sum(additive_identity,X1,X1),
additive_identity1 ).
cnf(c_0_27,hypothesis,
( ~ product(additive_inverse(a),b,X1)
| sum(X1,c,additive_identity) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,plain,
( ~ product(X2,additive_identity,X4)
| ~ product(X2,additive_inverse(X3),X1)
| sum(X1,multiply(X2,X3),X4) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,axiom,
product(X1,additive_identity,additive_identity),
multiplicative_identity2 ).
cnf(c_0_30,plain,
( ~ sum(X1,X2,X4)
| ~ sum(X1,X2,X3)
| equalish(X3,X4) ),
inference(fof_simplification,[status(thm)],[addition_is_well_defined]) ).
cnf(c_0_31,plain,
( ~ sum(X4,X3,X2)
| ~ sum(X1,X4,additive_identity)
| sum(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,hypothesis,
sum(multiply(additive_inverse(a),b),c,additive_identity),
inference(spm,[status(thm)],[c_0_27,c_0_24]) ).
cnf(c_0_33,plain,
( ~ product(X2,additive_inverse(X3),X1)
| sum(X1,multiply(X2,X3),additive_identity) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,hypothesis,
product(additive_inverse(a),additive_inverse(b),d),
a_inverse_times_b_inverse ).
cnf(c_0_35,plain,
( ~ sum(X1,X2,X4)
| ~ sum(X1,X2,X3)
| equalish(X3,X4) ),
c_0_30 ).
cnf(c_0_36,axiom,
sum(X1,additive_identity,X1),
additive_identity2 ).
cnf(c_0_37,hypothesis,
( ~ sum(X1,multiply(additive_inverse(a),b),additive_identity)
| sum(X1,additive_identity,c) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,hypothesis,
sum(d,multiply(additive_inverse(a),b),additive_identity),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
~ equalish(c,d),
inference(fof_simplification,[status(thm)],[prove_c_equals_d]) ).
cnf(c_0_40,plain,
( ~ sum(X2,additive_identity,X1)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,hypothesis,
sum(d,additive_identity,c),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,negated_conjecture,
~ equalish(c,d),
c_0_39 ).
cnf(c_0_43,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : RNG004-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.40 % Computer : n008.cluster.edu
% 0.14/0.40 % Model : x86_64 x86_64
% 0.14/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.40 % Memory : 8046.5625MB
% 0.14/0.40 % OS : Linux 6.8.0-71-generic
% 0.14/0.40 % CPULimit : 300
% 0.14/0.40 % WCLimit : 300
% 0.14/0.40 % DateTime : Mon Sep 21 04:10:41 UTC 2026
% 0.14/0.41 % CPUTime :
% 0.14/0.41 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.45 Running first-order theorem proving
% 0.14/0.45 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
% 70.56/10.68 % Version: 3.5.1
% 70.56/10.68 % Preprocessing class: FSMSSMSSSSSNFFN.
% 70.56/10.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 70.56/10.68 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 70.56/10.68 % Starting new_bool_3 with 300s (1) cores
% 70.56/10.68 % Starting new_bool_1 with 300s (1) cores
% 70.56/10.68 % Starting sh5l with 300s (1) cores
% 70.56/10.68 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 111263 completed with status 0
% 70.56/10.68 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 70.56/10.68 % Preprocessing class: FSMSSMSSSSSNFFN.
% 70.56/10.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 70.56/10.68 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 70.56/10.68 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 70.56/10.68 % No SInE strategy applied
% 70.56/10.68 % Search class: FHUNM-FFMF21-SFFFFFNN
% 70.56/10.68 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 70.56/10.68 % Starting SubtermCWHack with 136s (1) cores
% 70.56/10.68 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 70.56/10.68 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 70.56/10.68 % Starting G-E--_107_C09_12_F1_PI_AE_Q4_CS_SP_PS_S064A with 136s (1) cores
% 70.56/10.68 % Starting new_bool_3 with 136s (1) cores
% 70.56/10.68 % new_bool_3 with pid 111276 completed with status 0
% 70.56/10.68 % Result found by new_bool_3
% 70.56/10.68 % Preprocessing class: FSMSSMSSSSSNFFN.
% 70.56/10.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 70.56/10.68 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 70.56/10.68 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 70.56/10.68 % No SInE strategy applied
% 70.56/10.68 % Search class: FHUNM-FFMF21-SFFFFFNN
% 70.56/10.68 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 70.56/10.68 % Starting SubtermCWHack with 136s (1) cores
% 70.56/10.68 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 70.56/10.68 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 70.56/10.68 % Starting G-E--_107_C09_12_F1_PI_AE_Q4_CS_SP_PS_S064A with 136s (1) cores
% 70.56/10.68 % Starting new_bool_3 with 136s (1) cores
% 70.56/10.68 % Preprocessing time : 0.002 s
% 70.56/10.68 % Presaturation interreduction done
% 70.56/10.68
% 70.56/10.68 % Proof found!
% 70.56/10.68 % SZS status Unsatisfiable
% 70.56/10.68 % SZS output start CNFRefutation
% See solution above
% 70.56/10.68 % Parsed axioms : 34
% 70.56/10.68 % Removed by relevancy pruning/SinE : 0
% 70.56/10.68 % Initial clauses : 34
% 70.56/10.68 % Removed in clause preprocessing : 0
% 70.56/10.68 % Initial clauses in saturation : 34
% 70.56/10.68 % Processed clauses : 18427
% 70.56/10.68 % ...of these trivial : 4535
% 70.56/10.68 % ...subsumed : 4953
% 70.56/10.68 % ...remaining for further processing : 8939
% 70.56/10.68 % Other redundant clauses eliminated : 0
% 70.56/10.68 % Clauses deleted for lack of memory : 0
% 70.56/10.68 % Backward-subsumed : 857
% 70.56/10.68 % Backward-rewritten : 583
% 70.56/10.68 % Generated clauses : 765273
% 70.56/10.68 % ...of the previous two non-redundant : 661657
% 70.56/10.68 % ...aggressively subsumed : 0
% 70.56/10.68 % Contextual simplify-reflections : 0
% 70.56/10.68 % Paramodulations : 765273
% 70.56/10.68 % Factorizations : 0
% 70.56/10.68 % NegExts : 0
% 70.56/10.68 % Equation resolutions : 0
% 70.56/10.68 % Disequality decompositions : 0
% 70.56/10.68 % Total rewrite steps : 119274
% 70.56/10.68 % ...of those cached : 103022
% 70.56/10.68 % Propositional unsat checks : 1
% 70.56/10.68 % Propositional check models : 0
% 70.56/10.68 % Propositional check unsatisfiable : 0
% 70.56/10.68 % Propositional clauses : 0
% 70.56/10.68 % Propositional clauses after purity: 0
% 70.56/10.68 % Propositional unsat core size : 0
% 70.56/10.68 % Propositional preprocessing time : 0.000
% 70.56/10.68 % Propositional encoding time : 0.260
% 70.56/10.68 % Propositional solver time : 0.468
% 70.56/10.68 % Success case prop preproc time : 0.000
% 70.56/10.68 % Success case prop encoding time : 0.000
% 70.56/10.68 % Success case prop solver time : 0.000
% 70.56/10.68 % Current number of processed clauses : 7465
% 70.56/10.68 % Positive orientable unit clauses : 2239
% 70.56/10.68 % Positive unorientable unit clauses: 0
% 70.56/10.68 % Negative unit clauses : 1
% 70.56/10.68 % Non-unit-clauses : 5225
% 70.56/10.68 % Current number of unprocessed clauses: 639533
% 70.56/10.68 % ...number of literals in the above : 827161
% 70.56/10.68 % Current number of archived formulas : 0
% 70.56/10.68 % Current number of archived clauses : 1474
% 70.56/10.68 % Clause-clause subsumption calls (NU) : 3417359
% 70.56/10.68 % Rec. Clause-clause subsumption calls : 2594553
% 70.56/10.68 % Non-unit clause-clause subsumptions : 5810
% 70.56/10.68 % Unit Clause-clause subsumption calls : 8137
% 70.56/10.68 % Rewrite failures with RHS unbound : 0
% 70.56/10.68 % BW rewrite match attempts : 51880
% 70.56/10.68 % BW rewrite match successes : 583
% 70.56/10.68 % Condensation attempts : 0
% 70.56/10.68 % Condensation successes : 0
% 70.56/10.68 % Termbank termtop insertions : 11072437
% 70.56/10.68 % Search garbage collected termcells : 95
% 70.56/10.68
% 70.56/10.68 % -------------------------------------------------
% 70.56/10.68 % User time : 9.497 s
% 70.56/10.68 % System time : 0.446 s
% 70.56/10.68 % Total time : 9.944 s
% 70.56/10.68 % Maximum resident set size: 3604 pages
% 70.56/10.68
% 70.56/10.68 % -------------------------------------------------
% 70.56/10.68 % User time : 47.891 s
% 70.56/10.68 % System time : 2.232 s
% 70.56/10.68 % Total time : 50.123 s
% 70.56/10.68 % Maximum resident set size: 4608 pages
% 70.56/10.68 % E exiting
%------------------------------------------------------------------------------