%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : RNG041-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 : n007.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:36 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.46s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 25 ( 14 unt; 2 nHn; 19 RR)
% Number of literals : 46 ( 12 equ; 25 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 43 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity_of_multiplication2,axiom,
( ~ product(X1,X5,X6)
| ~ product(X2,X4,X5)
| ~ product(X1,X2,X3)
| product(X3,X4,X6) ),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',associativity_of_multiplication2) ).
cnf(a_times_b,negated_conjecture,
product(a,b,additive_identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_times_b) ).
cnf(multiplication_is_well_defined,axiom,
( ~ product(X1,X2,X4)
| ~ product(X1,X2,X3)
| X3 = X4 ),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',multiplication_is_well_defined) ).
cnf(multiplicative_identity2,hypothesis,
product(X1,additive_identity,additive_identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplicative_identity2) ).
cnf(a_not_additive_identity,negated_conjecture,
a != additive_identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_not_additive_identity) ).
cnf(left_multiplicative_identity,hypothesis,
product(multiplicative_identity,X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_multiplicative_identity) ).
cnf(clause42,hypothesis,
( X1 = additive_identity
| product(h(X1),X1,multiplicative_identity) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause42) ).
cnf(prove_b_is_additive_identity,negated_conjecture,
b != additive_identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_b_is_additive_identity) ).
cnf(c_0_8,plain,
( ~ product(X1,X5,X6)
| ~ product(X2,X4,X5)
| ~ product(X1,X2,X3)
| product(X3,X4,X6) ),
inference(fof_simplification,[status(thm)],[associativity_of_multiplication2]) ).
cnf(c_0_9,plain,
( ~ product(X1,X5,X6)
| ~ product(X2,X4,X5)
| ~ product(X1,X2,X3)
| product(X3,X4,X6) ),
c_0_8 ).
cnf(c_0_10,negated_conjecture,
product(a,b,additive_identity),
a_times_b ).
cnf(c_0_11,plain,
( ~ product(X1,X2,X4)
| ~ product(X1,X2,X3)
| X3 = X4 ),
inference(fof_simplification,[status(thm)],[multiplication_is_well_defined]) ).
cnf(c_0_12,negated_conjecture,
( ~ product(X3,a,X1)
| ~ product(X3,additive_identity,X2)
| product(X1,b,X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,hypothesis,
product(X1,additive_identity,additive_identity),
multiplicative_identity2 ).
cnf(c_0_14,negated_conjecture,
a != additive_identity,
inference(fof_simplification,[status(thm)],[a_not_additive_identity]) ).
cnf(c_0_15,plain,
( ~ product(X1,X2,X4)
| ~ product(X1,X2,X3)
| X3 = X4 ),
c_0_11 ).
cnf(c_0_16,hypothesis,
product(multiplicative_identity,X1,X1),
left_multiplicative_identity ).
cnf(c_0_17,hypothesis,
( ~ product(X2,a,X1)
| product(X1,b,additive_identity) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,hypothesis,
( X1 = additive_identity
| product(h(X1),X1,multiplicative_identity) ),
clause42 ).
cnf(c_0_19,negated_conjecture,
a != additive_identity,
c_0_14 ).
cnf(c_0_20,negated_conjecture,
b != additive_identity,
inference(fof_simplification,[status(thm)],[prove_b_is_additive_identity]) ).
cnf(c_0_21,hypothesis,
( ~ product(multiplicative_identity,X2,X1)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,hypothesis,
product(multiplicative_identity,b,additive_identity),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_23,negated_conjecture,
b != additive_identity,
c_0_20 ).
cnf(c_0_24,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : RNG041-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n007.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 04:13:07 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.43 Running first-order theorem proving
% 0.14/0.43 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.46 % Version: 3.5.1
% 0.14/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.46 % Starting sh5l with 300s (1) cores
% 0.14/0.46 % new_bool_1 with pid 148538 completed with status 0
% 0.14/0.46 % Result found by new_bool_1
% 0.14/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.46 % Search class: FGUSM-FFMF11-SFFFFFNN
% 0.14/0.46 % partial match(1): FGUSM-FFMF21-SFFFFFNN
% 0.14/0.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.46 % SubtermCWHack with pid 148541 completed with status 0
% 0.14/0.46 % Result found by SubtermCWHack
% 0.14/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.46 % Search class: FGUSM-FFMF11-SFFFFFNN
% 0.14/0.46 % partial match(1): FGUSM-FFMF21-SFFFFFNN
% 0.14/0.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.46 % Preprocessing time : 0.001 s
% 0.14/0.46
% 0.14/0.46 % Proof found!
% 0.14/0.46 % SZS status Unsatisfiable
% 0.14/0.46 % SZS output start CNFRefutation
% See solution above
% 0.14/0.46 % Parsed axioms : 26
% 0.14/0.46 % Removed by relevancy pruning/SinE : 4
% 0.14/0.46 % Initial clauses : 22
% 0.14/0.46 % Removed in clause preprocessing : 0
% 0.14/0.46 % Initial clauses in saturation : 22
% 0.14/0.46 % Processed clauses : 46
% 0.14/0.46 % ...of these trivial : 0
% 0.14/0.46 % ...subsumed : 6
% 0.14/0.46 % ...remaining for further processing : 40
% 0.14/0.46 % Other redundant clauses eliminated : 0
% 0.14/0.46 % Clauses deleted for lack of memory : 0
% 0.14/0.46 % Backward-subsumed : 2
% 0.14/0.46 % Backward-rewritten : 0
% 0.14/0.46 % Generated clauses : 63
% 0.14/0.46 % ...of the previous two non-redundant : 44
% 0.14/0.46 % ...aggressively subsumed : 0
% 0.14/0.46 % Contextual simplify-reflections : 0
% 0.14/0.46 % Paramodulations : 63
% 0.14/0.46 % Factorizations : 0
% 0.14/0.46 % NegExts : 0
% 0.14/0.46 % Equation resolutions : 0
% 0.14/0.46 % Disequality decompositions : 0
% 0.14/0.46 % Total rewrite steps : 14
% 0.14/0.46 % ...of those cached : 8
% 0.14/0.46 % Propositional unsat checks : 0
% 0.14/0.46 % Propositional check models : 0
% 0.14/0.46 % Propositional check unsatisfiable : 0
% 0.14/0.46 % Propositional clauses : 0
% 0.14/0.46 % Propositional clauses after purity: 0
% 0.14/0.46 % Propositional unsat core size : 0
% 0.14/0.46 % Propositional preprocessing time : 0.000
% 0.14/0.46 % Propositional encoding time : 0.000
% 0.14/0.46 % Propositional solver time : 0.000
% 0.14/0.46 % Success case prop preproc time : 0.000
% 0.14/0.46 % Success case prop encoding time : 0.000
% 0.14/0.46 % Success case prop solver time : 0.000
% 0.14/0.46 % Current number of processed clauses : 38
% 0.14/0.46 % Positive orientable unit clauses : 8
% 0.14/0.46 % Positive unorientable unit clauses: 0
% 0.14/0.46 % Negative unit clauses : 2
% 0.14/0.46 % Non-unit-clauses : 28
% 0.14/0.46 % Current number of unprocessed clauses: 17
% 0.14/0.46 % ...number of literals in the above : 63
% 0.14/0.46 % Current number of archived formulas : 0
% 0.14/0.46 % Current number of archived clauses : 2
% 0.14/0.46 % Clause-clause subsumption calls (NU) : 157
% 0.14/0.46 % Rec. Clause-clause subsumption calls : 144
% 0.14/0.46 % Non-unit clause-clause subsumptions : 8
% 0.14/0.46 % Unit Clause-clause subsumption calls : 0
% 0.14/0.46 % Rewrite failures with RHS unbound : 0
% 0.14/0.46 % BW rewrite match attempts : 0
% 0.14/0.46 % BW rewrite match successes : 0
% 0.14/0.46 % Condensation attempts : 0
% 0.14/0.46 % Condensation successes : 0
% 0.14/0.46 % Termbank termtop insertions : 1443
% 0.14/0.46 % Search garbage collected termcells : 74
% 0.14/0.46
% 0.14/0.46 % -------------------------------------------------
% 0.14/0.46 % User time : 0.006 s
% 0.14/0.46 % System time : 0.002 s
% 0.14/0.46 % Total time : 0.007 s
% 0.14/0.46 % Maximum resident set size: 3648 pages
% 0.14/0.46
% 0.14/0.46 % -------------------------------------------------
% 0.14/0.46 % User time : 0.009 s
% 0.14/0.46 % System time : 0.007 s
% 0.14/0.46 % Total time : 0.016 s
% 0.14/0.46 % Maximum resident set size: 4608 pages
% 0.14/0.46 % E exiting
%------------------------------------------------------------------------------