%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP755-1 : TPTP v9.3.1. Released v4.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 12:45:05 PM UTC 2026
% Result : Unsatisfiable 2.71s 1.02s
% Output : CNFRefutation 2.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 8
% Syntax : Number of clauses : 50 ( 26 unt; 22 nHn; 6 RR)
% Number of literals : 75 ( 74 equ; 5 neg)
% Maximal clause size : 3 ( 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 : 84 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(f01,axiom,
mult(X1,ld(X1,X2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f01) ).
cnf(f09,axiom,
i(X1) = ld(X1,unit),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f09) ).
cnf(f08,axiom,
( mult(X1,mult(X3,X2)) = mult(mult(X1,X2),X3)
| mult(X1,mult(X2,X3)) = mult(mult(X1,X2),X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f08) ).
cnf(f06,axiom,
mult(unit,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f06) ).
cnf(f02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).
cnf(f07,axiom,
( mult(X1,mult(X2,X3)) = mult(mult(X1,X3),X2)
| mult(X1,mult(X2,X3)) = mult(mult(X1,X2),X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f07) ).
cnf(f05,axiom,
mult(X1,unit) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).
cnf(goals,negated_conjecture,
i(mult(a,b)) != mult(i(b),i(a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(c_0_8,axiom,
mult(X1,ld(X1,X2)) = X2,
f01 ).
cnf(c_0_9,axiom,
i(X1) = ld(X1,unit),
f09 ).
cnf(c_0_10,axiom,
( mult(X1,mult(X3,X2)) = mult(mult(X1,X2),X3)
| mult(X1,mult(X2,X3)) = mult(mult(X1,X2),X3) ),
f08 ).
cnf(c_0_11,plain,
mult(X1,i(X1)) = unit,
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,axiom,
mult(unit,X1) = X1,
f06 ).
cnf(c_0_13,axiom,
ld(X1,mult(X1,X2)) = X2,
f02 ).
cnf(c_0_14,plain,
( mult(X1,mult(i(X1),X2)) = X2
| mult(X1,mult(X2,i(X1))) = X2 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_12]) ).
cnf(c_0_15,plain,
( ld(X1,X2) = mult(i(X1),X2)
| mult(X1,mult(X2,i(X1))) = X2 ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,axiom,
( mult(X1,mult(X2,X3)) = mult(mult(X1,X3),X2)
| mult(X1,mult(X2,X3)) = mult(mult(X1,X2),X3) ),
f07 ).
cnf(c_0_17,plain,
( ld(X1,X2) = mult(X2,i(X1))
| ld(X1,X2) = mult(i(X1),X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_15]) ).
cnf(c_0_18,plain,
( ld(mult(X1,X3),mult(X1,mult(X2,X3))) = X2
| mult(mult(X1,X2),X3) = mult(X1,mult(X2,X3)) ),
inference(spm,[status(thm)],[c_0_13,c_0_16]) ).
cnf(c_0_19,axiom,
mult(X1,unit) = X1,
f05 ).
cnf(c_0_20,plain,
( mult(mult(X1,X2),i(X1)) = X2
| mult(i(X1),mult(X1,X2)) = X2 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_17]),c_0_13]) ).
cnf(c_0_21,plain,
mult(X1,mult(i(X1),i(X1))) = i(X1),
inference(ef,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
( mult(mult(X1,X2),i(X2)) = X1
| ld(mult(X1,i(X2)),X1) = X2 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_11]),c_0_19]),c_0_19]) ).
cnf(c_0_23,plain,
( ld(i(X1),X2) = mult(X1,X2)
| mult(mult(X1,X2),i(X1)) = X2 ),
inference(spm,[status(thm)],[c_0_13,c_0_20]) ).
cnf(c_0_24,plain,
( mult(X1,mult(mult(i(X1),i(X1)),X2)) = mult(i(X1),X2)
| mult(X1,mult(X2,mult(i(X1),i(X1)))) = mult(i(X1),X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_21]) ).
cnf(c_0_25,plain,
( mult(mult(X1,i(X2)),X2) = X1
| mult(mult(X1,X2),i(X2)) = X1 ),
inference(spm,[status(thm)],[c_0_8,c_0_22]) ).
cnf(c_0_26,plain,
( mult(X1,mult(X2,i(X1))) = X2
| ld(i(X1),X2) = mult(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_23]),c_0_11]),c_0_12])]) ).
cnf(c_0_27,plain,
( mult(i(X1),X1) = unit
| mult(mult(i(X1),X1),i(X1)) = i(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_21]),c_0_11]),c_0_11])]) ).
cnf(c_0_28,plain,
( mult(i(X1),X1) = unit
| mult(X1,mult(i(X1),X1)) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_13]),c_0_11])]) ).
cnf(c_0_29,plain,
ld(X1,X1) = unit,
inference(spm,[status(thm)],[c_0_13,c_0_19]) ).
cnf(c_0_30,plain,
( mult(X1,mult(ld(X1,X3),X2)) = mult(X3,X2)
| mult(X1,mult(X2,ld(X1,X3))) = mult(X3,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_8]) ).
cnf(c_0_31,plain,
mult(i(X1),X1) = unit,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_28]),c_0_29])]) ).
cnf(c_0_32,plain,
( mult(i(X1),mult(X1,X2)) = X2
| mult(X1,mult(i(X1),X2)) = X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_16]),c_0_11]),c_0_12])]) ).
cnf(c_0_33,plain,
mult(X1,i(ld(X2,X1))) = X2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_19]),c_0_11]),c_0_19])]) ).
cnf(c_0_34,plain,
( i(i(X1)) = X1
| ld(i(i(X1)),X1) = mult(i(X1),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_26]),c_0_11]),c_0_19])]) ).
cnf(c_0_35,plain,
i(ld(X1,X2)) = ld(X2,X1),
inference(spm,[status(thm)],[c_0_13,c_0_33]) ).
cnf(c_0_36,plain,
( mult(X2,i(X1)) != mult(i(X1),X2)
| ld(X1,X2) = mult(i(X1),X2) ),
inference(ef,[status(thm)],[c_0_17]) ).
cnf(c_0_37,plain,
( i(i(X1)) = X1
| mult(i(i(X1)),mult(i(X1),X1)) = X1 ),
inference(spm,[status(thm)],[c_0_8,c_0_34]) ).
cnf(c_0_38,plain,
( mult(i(X1),mult(X1,X2)) = X2
| mult(mult(X1,X2),mult(i(X1),X3)) = mult(X2,X3)
| mult(mult(X1,X2),mult(X3,i(X1))) = mult(X2,X3) ),
inference(spm,[status(thm)],[c_0_10,c_0_20]) ).
cnf(c_0_39,plain,
ld(mult(X1,X2),X1) = i(X2),
inference(spm,[status(thm)],[c_0_35,c_0_13]) ).
cnf(c_0_40,plain,
( mult(X2,i(X1)) != mult(i(X1),X2)
| mult(X1,mult(i(X1),X2)) = X2 ),
inference(spm,[status(thm)],[c_0_8,c_0_36]) ).
cnf(c_0_41,plain,
i(i(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_31]),c_0_19])]) ).
cnf(c_0_42,plain,
( mult(X1,X2) = mult(X2,X1)
| mult(i(X1),mult(X1,X2)) = X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_31]),c_0_11]),c_0_19]),c_0_19])]) ).
cnf(c_0_43,plain,
mult(mult(X1,X2),i(X2)) = X1,
inference(spm,[status(thm)],[c_0_8,c_0_39]) ).
cnf(c_0_44,plain,
mult(i(X1),mult(X1,X2)) = X2,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]) ).
cnf(c_0_45,negated_conjecture,
i(mult(a,b)) != mult(i(b),i(a)),
inference(fof_simplification,[status(thm)],[goals]) ).
cnf(c_0_46,plain,
mult(X1,i(mult(X2,X1))) = i(X2),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_47,negated_conjecture,
i(mult(a,b)) != mult(i(b),i(a)),
c_0_45 ).
cnf(c_0_48,plain,
mult(i(X1),i(X2)) = i(mult(X2,X1)),
inference(spm,[status(thm)],[c_0_44,c_0_46]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_48])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GRP755-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.47 % Computer : n007.cluster.edu
% 0.20/0.47 % Model : x86_64 x86_64
% 0.20/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.47 % Memory : 8046.5625MB
% 0.20/0.47 % OS : Linux 6.8.0-71-generic
% 0.20/0.47 % CPULimit : 300
% 0.20/0.47 % WCLimit : 300
% 0.20/0.47 % DateTime : Sun Sep 20 20:35:36 UTC 2026
% 0.20/0.47 % CPUTime :
% 0.20/0.47 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.55 Running first-order theorem proving
% 0.25/0.55 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
% 2.71/1.02 % Version: 3.5.1
% 2.71/1.02 % Preprocessing class: FSSSSMSSSSSNFFN.
% 2.71/1.02 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.71/1.02 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.71/1.02 % Starting new_bool_3 with 300s (1) cores
% 2.71/1.02 % Starting new_bool_1 with 300s (1) cores
% 2.71/1.02 % Starting sh5l with 300s (1) cores
% 2.71/1.02 % new_bool_1 with pid 3545999 completed with status 0
% 2.71/1.02 % Result found by new_bool_1
% 2.71/1.02 % Preprocessing class: FSSSSMSSSSSNFFN.
% 2.71/1.02 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.71/1.02 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.71/1.02 % Starting new_bool_3 with 300s (1) cores
% 2.71/1.02 % Starting new_bool_1 with 300s (1) cores
% 2.71/1.02 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 2.71/1.02 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.71/1.02 % Search class: FGUPM-FFSF21-SFFFFFNN
% 2.71/1.02 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 2.71/1.02 % Starting SubtermCWHack with 31s (1) cores
% 2.71/1.02 % SubtermCWHack with pid 3546006 completed with status 0
% 2.71/1.02 % Result found by SubtermCWHack
% 2.71/1.02 % Preprocessing class: FSSSSMSSSSSNFFN.
% 2.71/1.02 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.71/1.02 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.71/1.02 % Starting new_bool_3 with 300s (1) cores
% 2.71/1.02 % Starting new_bool_1 with 300s (1) cores
% 2.71/1.02 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 2.71/1.02 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.71/1.02 % Search class: FGUPM-FFSF21-SFFFFFNN
% 2.71/1.02 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 2.71/1.02 % Starting SubtermCWHack with 31s (1) cores
% 2.71/1.02 % Preprocessing time : 0.001 s
% 2.71/1.02
% 2.71/1.02 % Proof found!
% 2.71/1.02 % SZS status Unsatisfiable
% 2.71/1.02 % SZS output start CNFRefutation
% See solution above
% 2.71/1.02 % Parsed axioms : 10
% 2.71/1.02 % Removed by relevancy pruning/SinE : 2
% 2.71/1.02 % Initial clauses : 8
% 2.71/1.02 % Removed in clause preprocessing : 0
% 2.71/1.02 % Initial clauses in saturation : 8
% 2.71/1.02 % Processed clauses : 681
% 2.71/1.02 % ...of these trivial : 127
% 2.71/1.02 % ...subsumed : 291
% 2.71/1.02 % ...remaining for further processing : 263
% 2.71/1.02 % Other redundant clauses eliminated : 0
% 2.71/1.02 % Clauses deleted for lack of memory : 0
% 2.71/1.02 % Backward-subsumed : 20
% 2.71/1.02 % Backward-rewritten : 185
% 2.71/1.02 % Generated clauses : 32677
% 2.71/1.02 % ...of the previous two non-redundant : 27819
% 2.71/1.02 % ...aggressively subsumed : 0
% 2.71/1.02 % Contextual simplify-reflections : 1
% 2.71/1.03 % Paramodulations : 32635
% 2.71/1.03 % Factorizations : 42
% 2.71/1.03 % NegExts : 0
% 2.71/1.03 % Equation resolutions : 0
% 2.71/1.03 % Disequality decompositions : 0
% 2.71/1.03 % Total rewrite steps : 28613
% 2.71/1.03 % ...of those cached : 27609
% 2.71/1.03 % Propositional unsat checks : 0
% 2.71/1.03 % Propositional check models : 0
% 2.71/1.03 % Propositional check unsatisfiable : 0
% 2.71/1.03 % Propositional clauses : 0
% 2.71/1.03 % Propositional clauses after purity: 0
% 2.71/1.03 % Propositional unsat core size : 0
% 2.71/1.03 % Propositional preprocessing time : 0.000
% 2.71/1.03 % Propositional encoding time : 0.000
% 2.71/1.03 % Propositional solver time : 0.000
% 2.71/1.03 % Success case prop preproc time : 0.000
% 2.71/1.03 % Success case prop encoding time : 0.000
% 2.71/1.03 % Success case prop solver time : 0.000
% 2.71/1.03 % Current number of processed clauses : 58
% 2.71/1.03 % Positive orientable unit clauses : 28
% 2.71/1.03 % Positive unorientable unit clauses: 0
% 2.71/1.03 % Negative unit clauses : 0
% 2.71/1.03 % Non-unit-clauses : 30
% 2.71/1.03 % Current number of unprocessed clauses: 27096
% 2.71/1.03 % ...number of literals in the above : 93400
% 2.71/1.03 % Current number of archived formulas : 0
% 2.71/1.03 % Current number of archived clauses : 205
% 2.71/1.03 % Clause-clause subsumption calls (NU) : 5714
% 2.71/1.03 % Rec. Clause-clause subsumption calls : 4746
% 2.71/1.03 % Non-unit clause-clause subsumptions : 292
% 2.71/1.03 % Unit Clause-clause subsumption calls : 1802
% 2.71/1.03 % Rewrite failures with RHS unbound : 0
% 2.71/1.03 % BW rewrite match attempts : 299
% 2.71/1.03 % BW rewrite match successes : 94
% 2.71/1.03 % Condensation attempts : 0
% 2.71/1.03 % Condensation successes : 0
% 2.71/1.03 % Termbank termtop insertions : 757961
% 2.71/1.03 % Search garbage collected termcells : 7
% 2.71/1.03
% 2.71/1.03 % -------------------------------------------------
% 2.71/1.03 % User time : 0.401 s
% 2.71/1.03 % System time : 0.019 s
% 2.71/1.03 % Total time : 0.420 s
% 2.71/1.03 % Maximum resident set size: 3632 pages
% 2.71/1.03
% 2.71/1.03 % -------------------------------------------------
% 2.71/1.03 % User time : 0.403 s
% 2.71/1.03 % System time : 0.022 s
% 2.71/1.03 % Total time : 0.425 s
% 2.71/1.03 % Maximum resident set size: 4608 pages
% 2.71/1.03 % E exiting
%------------------------------------------------------------------------------