%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : RNG038-2 : 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 : n020.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.44s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of clauses : 17 ( 10 unt; 0 nHn; 9 RR)
% Number of literals : 27 ( 0 equ; 13 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 25 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(multiplication_is_well_defined,axiom,
( ~ product(X1,X2,X4)
| ~ product(X1,X2,X3)
| equalish(X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplication_is_well_defined) ).
cnf(multiplicative_identity1,axiom,
product(additive_identity,X1,additive_identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplicative_identity1) ).
cnf(some_property,hypothesis,
( ~ equalish(X1,additive_identity)
| product(X1,h(X1,X2),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',some_property) ).
cnf(multiplicative_identity2,axiom,
product(X1,additive_identity,additive_identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplicative_identity2) ).
cnf(a_not_additive_identity,negated_conjecture,
~ equalish(a,additive_identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_not_additive_identity) ).
cnf(c_0_5,plain,
( ~ product(X1,X2,X4)
| ~ product(X1,X2,X3)
| equalish(X3,X4) ),
inference(fof_simplification,[status(thm)],[multiplication_is_well_defined]) ).
cnf(c_0_6,plain,
( ~ product(X1,X2,X4)
| ~ product(X1,X2,X3)
| equalish(X3,X4) ),
c_0_5 ).
cnf(c_0_7,axiom,
product(additive_identity,X1,additive_identity),
multiplicative_identity1 ).
cnf(c_0_8,hypothesis,
( ~ equalish(X1,additive_identity)
| product(X1,h(X1,X2),X2) ),
inference(fof_simplification,[status(thm)],[some_property]) ).
cnf(c_0_9,plain,
( ~ product(additive_identity,X2,X1)
| equalish(X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,axiom,
product(X1,additive_identity,additive_identity),
multiplicative_identity2 ).
cnf(c_0_11,negated_conjecture,
~ equalish(a,additive_identity),
inference(fof_simplification,[status(thm)],[a_not_additive_identity]) ).
cnf(c_0_12,hypothesis,
( ~ equalish(X1,additive_identity)
| product(X1,h(X1,X2),X2) ),
c_0_8 ).
cnf(c_0_13,plain,
equalish(additive_identity,additive_identity),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
~ equalish(a,additive_identity),
c_0_11 ).
cnf(c_0_15,hypothesis,
equalish(X1,additive_identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_12]),c_0_13])]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG038-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n020.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 04:15:48 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.42 Running first-order theorem proving
% 0.14/0.42 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.44 % Version: 3.5.1
% 0.14/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.44 % Starting sh5l with 300s (1) cores
% 0.14/0.44 % new_bool_3 with pid 1978906 completed with status 0
% 0.14/0.44 % Result found by new_bool_3
% 0.14/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.44 % Search class: FHUNS-FFMF22-SFFFFFNN
% 0.14/0.44 % partial match(2): FHUNS-FFSF22-MFFFFFNN
% 0.14/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.44 % SubtermCWHack with pid 1978912 completed with status 0
% 0.14/0.44 % Result found by SubtermCWHack
% 0.14/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.44 % Search class: FHUNS-FFMF22-SFFFFFNN
% 0.14/0.44 % partial match(2): FHUNS-FFSF22-MFFFFFNN
% 0.14/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.44 % Preprocessing time : 0.001 s
% 0.14/0.44
% 0.14/0.44 % Proof found!
% 0.14/0.44 % SZS status Unsatisfiable
% 0.14/0.44 % SZS output start CNFRefutation
% See solution above
% 0.14/0.44 % Parsed axioms : 30
% 0.14/0.44 % Removed by relevancy pruning/SinE : 6
% 0.14/0.44 % Initial clauses : 24
% 0.14/0.44 % Removed in clause preprocessing : 0
% 0.14/0.44 % Initial clauses in saturation : 24
% 0.14/0.44 % Processed clauses : 43
% 0.14/0.44 % ...of these trivial : 1
% 0.14/0.44 % ...subsumed : 2
% 0.14/0.44 % ...remaining for further processing : 40
% 0.14/0.44 % Other redundant clauses eliminated : 0
% 0.14/0.44 % Clauses deleted for lack of memory : 0
% 0.14/0.44 % Backward-subsumed : 1
% 0.14/0.44 % Backward-rewritten : 5
% 0.14/0.44 % Generated clauses : 98
% 0.14/0.44 % ...of the previous two non-redundant : 61
% 0.14/0.44 % ...aggressively subsumed : 0
% 0.14/0.44 % Contextual simplify-reflections : 0
% 0.14/0.44 % Paramodulations : 98
% 0.14/0.44 % Factorizations : 0
% 0.14/0.44 % NegExts : 0
% 0.14/0.44 % Equation resolutions : 0
% 0.14/0.44 % Disequality decompositions : 0
% 0.14/0.44 % Total rewrite steps : 36
% 0.14/0.44 % ...of those cached : 23
% 0.14/0.44 % Propositional unsat checks : 0
% 0.14/0.44 % Propositional check models : 0
% 0.14/0.44 % Propositional check unsatisfiable : 0
% 0.14/0.44 % Propositional clauses : 0
% 0.14/0.44 % Propositional clauses after purity: 0
% 0.14/0.44 % Propositional unsat core size : 0
% 0.14/0.44 % Propositional preprocessing time : 0.000
% 0.14/0.44 % Propositional encoding time : 0.000
% 0.14/0.44 % Propositional solver time : 0.000
% 0.14/0.44 % Success case prop preproc time : 0.000
% 0.14/0.44 % Success case prop encoding time : 0.000
% 0.14/0.44 % Success case prop solver time : 0.000
% 0.14/0.44 % Current number of processed clauses : 34
% 0.14/0.44 % Positive orientable unit clauses : 6
% 0.14/0.44 % Positive unorientable unit clauses: 0
% 0.14/0.44 % Negative unit clauses : 4
% 0.14/0.44 % Non-unit-clauses : 24
% 0.14/0.44 % Current number of unprocessed clauses: 41
% 0.14/0.44 % ...number of literals in the above : 106
% 0.14/0.44 % Current number of archived formulas : 0
% 0.14/0.44 % Current number of archived clauses : 6
% 0.14/0.44 % Clause-clause subsumption calls (NU) : 48
% 0.14/0.44 % Rec. Clause-clause subsumption calls : 48
% 0.14/0.44 % Non-unit clause-clause subsumptions : 0
% 0.14/0.44 % Unit Clause-clause subsumption calls : 1
% 0.14/0.44 % Rewrite failures with RHS unbound : 0
% 0.14/0.44 % BW rewrite match attempts : 4
% 0.14/0.44 % BW rewrite match successes : 4
% 0.14/0.44 % Condensation attempts : 0
% 0.14/0.44 % Condensation successes : 0
% 0.14/0.44 % Termbank termtop insertions : 1658
% 0.14/0.44 % Search garbage collected termcells : 115
% 0.14/0.44
% 0.14/0.44 % -------------------------------------------------
% 0.14/0.44 % User time : 0.005 s
% 0.14/0.44 % System time : 0.002 s
% 0.14/0.44 % Total time : 0.007 s
% 0.14/0.44 % Maximum resident set size: 3656 pages
% 0.14/0.44
% 0.14/0.44 % -------------------------------------------------
% 0.14/0.44 % User time : 0.005 s
% 0.14/0.44 % System time : 0.006 s
% 0.14/0.44 % Total time : 0.011 s
% 0.14/0.44 % Maximum resident set size: 4608 pages
% 0.14/0.44 % E exiting
%------------------------------------------------------------------------------