%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP748-2 : 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 : n002.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:04 PM UTC 2026
% Result : Unsatisfiable 5.01s 6.55s
% Output : CNFRefutation 5.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 9
% Syntax : Number of clauses : 52 ( 45 unt; 6 nHn; 6 RR)
% Number of literals : 59 ( 58 equ; 5 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 97 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(f07,axiom,
mult(mult(mult(X1,X2),X3),X2) = mult(X1,mult(mult(X2,X3),X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f07) ).
cnf(f10,axiom,
mult(i(X1),X1) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f10) ).
cnf(f06,axiom,
mult(unit,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f06) ).
cnf(f01,axiom,
mult(X1,ld(X1,X2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f01) ).
cnf(f11,axiom,
( mult(i(X1),mult(X1,X2)) = X2
| mult(X1,X2) = mult(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f11) ).
cnf(f08,axiom,
mult(mult(X1,X2),i(X2)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f08) ).
cnf(f09,axiom,
mult(X1,i(X1)) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f09) ).
cnf(f02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).
cnf(goals,negated_conjecture,
mult(a,mult(b,mult(a,c))) != mult(mult(mult(a,b),a),c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(c_0_9,axiom,
mult(mult(mult(X1,X2),X3),X2) = mult(X1,mult(mult(X2,X3),X2)),
f07 ).
cnf(c_0_10,axiom,
mult(i(X1),X1) = unit,
f10 ).
cnf(c_0_11,axiom,
mult(unit,X1) = X1,
f06 ).
cnf(c_0_12,plain,
mult(i(X1),mult(mult(X1,X2),X1)) = mult(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_13,axiom,
mult(X1,ld(X1,X2)) = X2,
f01 ).
cnf(c_0_14,axiom,
( mult(i(X1),mult(X1,X2)) = X2
| mult(X1,X2) = mult(X2,X1) ),
f11 ).
cnf(c_0_15,plain,
mult(ld(X1,X2),X1) = mult(i(X1),mult(X2,X1)),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,axiom,
mult(mult(X1,X2),i(X2)) = X1,
f08 ).
cnf(c_0_17,axiom,
mult(X1,i(X1)) = unit,
f09 ).
cnf(c_0_18,plain,
( ld(X1,X2) = mult(i(X1),X2)
| mult(i(X1),mult(X2,X1)) = X2 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_13]),c_0_15]) ).
cnf(c_0_19,plain,
i(i(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_11]) ).
cnf(c_0_20,axiom,
ld(X1,mult(X1,X2)) = X2,
f02 ).
cnf(c_0_21,plain,
( mult(X1,mult(X2,i(X1))) = X2
| ld(X1,X2) = mult(i(X1),X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_18]),c_0_19]),c_0_16]) ).
cnf(c_0_22,plain,
( ld(X1,X2) = mult(X2,i(X1))
| ld(X1,X2) = mult(i(X1),X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,plain,
( mult(X2,i(X1)) != mult(i(X1),X2)
| ld(X1,X2) = mult(i(X1),X2) ),
inference(ef,[status(thm)],[c_0_22]) ).
cnf(c_0_24,plain,
( mult(X1,X2) = mult(X2,X1)
| ld(i(X1),X2) = mult(X1,X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_14]) ).
cnf(c_0_25,plain,
mult(X1,mult(mult(X2,i(mult(X1,X2))),X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_17]),c_0_11]) ).
cnf(c_0_26,plain,
ld(i(X1),X2) = mult(X1,X2),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_19]),c_0_24]) ).
cnf(c_0_27,plain,
mult(mult(X1,i(mult(X2,X1))),X1) = ld(X2,X1),
inference(spm,[status(thm)],[c_0_20,c_0_25]) ).
cnf(c_0_28,plain,
mult(mult(X1,i(X2)),X2) = X1,
inference(spm,[status(thm)],[c_0_16,c_0_19]) ).
cnf(c_0_29,plain,
ld(i(X1),mult(X2,X1)) = mult(mult(X1,X2),X1),
inference(spm,[status(thm)],[c_0_20,c_0_12]) ).
cnf(c_0_30,plain,
ld(X1,X2) = mult(i(X1),X2),
inference(spm,[status(thm)],[c_0_26,c_0_19]) ).
cnf(c_0_31,plain,
mult(ld(X1,X2),i(X2)) = mult(X2,i(mult(X1,X2))),
inference(spm,[status(thm)],[c_0_16,c_0_27]) ).
cnf(c_0_32,plain,
mult(mult(X1,i(X2)),mult(mult(X2,X3),X2)) = mult(mult(X1,X3),X2),
inference(spm,[status(thm)],[c_0_9,c_0_28]) ).
cnf(c_0_33,plain,
mult(mult(X1,X2),X1) = mult(X1,mult(X2,X1)),
inference(rw,[status(thm)],[c_0_29,c_0_26]) ).
cnf(c_0_34,plain,
mult(X1,mult(i(X1),X2)) = X2,
inference(rw,[status(thm)],[c_0_13,c_0_30]) ).
cnf(c_0_35,plain,
mult(X1,i(mult(X2,X1))) = i(X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_30]),c_0_16]) ).
cnf(c_0_36,plain,
mult(i(X1),mult(X1,X2)) = X2,
inference(rw,[status(thm)],[c_0_20,c_0_30]) ).
cnf(c_0_37,plain,
mult(mult(X1,i(X2)),mult(X2,mult(X3,X2))) = mult(mult(X1,X3),X2),
inference(rw,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,plain,
i(mult(X1,i(X2))) = mult(X2,i(X1)),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,plain,
mult(mult(X1,mult(X2,i(X1))),X1) = ld(i(X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_15]),c_0_19]) ).
cnf(c_0_40,plain,
mult(mult(X1,mult(mult(X2,X3),X2)),i(X2)) = mult(mult(X1,X2),X3),
inference(spm,[status(thm)],[c_0_16,c_0_9]) ).
cnf(c_0_41,plain,
mult(mult(X1,i(X2)),mult(mult(X2,X3),X1)) = mult(X1,mult(X3,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_42,plain,
mult(mult(X1,mult(X2,i(X1))),X1) = mult(X1,X2),
inference(rw,[status(thm)],[c_0_39,c_0_26]) ).
cnf(c_0_43,negated_conjecture,
mult(a,mult(b,mult(a,c))) != mult(mult(mult(a,b),a),c),
inference(fof_simplification,[status(thm)],[goals]) ).
cnf(c_0_44,plain,
mult(mult(X1,mult(X2,X3)),i(X3)) = mult(mult(X1,X3),mult(i(X3),X2)),
inference(spm,[status(thm)],[c_0_40,c_0_34]) ).
cnf(c_0_45,plain,
mult(mult(X1,X2),mult(X3,X1)) = mult(X1,mult(mult(X2,X3),X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_36]),c_0_19]) ).
cnf(c_0_46,plain,
mult(mult(X1,X2),i(X1)) = mult(X1,mult(X2,i(X1))),
inference(spm,[status(thm)],[c_0_16,c_0_42]) ).
cnf(c_0_47,negated_conjecture,
mult(a,mult(b,mult(a,c))) != mult(mult(mult(a,b),a),c),
c_0_43 ).
cnf(c_0_48,plain,
mult(mult(X1,mult(X2,X1)),mult(i(X1),X3)) = mult(X1,mult(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]),c_0_16]),c_0_33]) ).
cnf(c_0_49,negated_conjecture,
mult(mult(a,mult(b,a)),c) != mult(a,mult(b,mult(a,c))),
inference(rw,[status(thm)],[c_0_47,c_0_33]) ).
cnf(c_0_50,plain,
mult(mult(X1,mult(X2,X1)),X3) = mult(X1,mult(X2,mult(X1,X3))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_34]),c_0_19]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GRP748-2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/5.71 % Computer : n002.cluster.edu
% 0.19/5.71 % Model : x86_64 x86_64
% 0.19/5.71 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/5.71 % Memory : 8046.5625MB
% 0.19/5.71 % OS : Linux 6.8.0-71-generic
% 0.19/5.71 % CPULimit : 300
% 0.19/5.71 % WCLimit : 300
% 0.19/5.71 % DateTime : Sun Sep 20 20:39:55 UTC 2026
% 0.19/5.72 % CPUTime :
% 0.19/5.72 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/5.78 Running first-order theorem proving
% 0.19/5.79 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
% 5.01/6.55 % Version: 3.5.1
% 5.01/6.55 % Preprocessing class: FSSSSMSSSSSNFFN.
% 5.01/6.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.01/6.55 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 5.01/6.55 % Starting new_bool_3 with 300s (1) cores
% 5.01/6.55 % Starting new_bool_1 with 300s (1) cores
% 5.01/6.55 % Starting sh5l with 300s (1) cores
% 5.01/6.55 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1675531 completed with status 0
% 5.01/6.55 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 5.01/6.55 % Preprocessing class: FSSSSMSSSSSNFFN.
% 5.01/6.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.01/6.55 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 5.01/6.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.01/6.55 % No SInE strategy applied
% 5.01/6.55 % Search class: FGUPM-FFSF21-MFFFFFNN
% 5.01/6.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 5.01/6.55 % Starting SubtermCWHack with 136s (1) cores
% 5.01/6.55 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 5.01/6.55 % Starting C12_02_nc_SAT001_MinMin_p005000_rr with 136s (1) cores
% 5.01/6.55 % Starting new_bool_3 with 136s (1) cores
% 5.01/6.55 % Starting new_bool_1 with 136s (1) cores
% 5.01/6.55 % new_bool_1 with pid 1675539 completed with status 0
% 5.01/6.55 % Result found by new_bool_1
% 5.01/6.55 % Preprocessing class: FSSSSMSSSSSNFFN.
% 5.01/6.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.01/6.55 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 5.01/6.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.01/6.55 % No SInE strategy applied
% 5.01/6.55 % Search class: FGUPM-FFSF21-MFFFFFNN
% 5.01/6.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 5.01/6.55 % Starting SubtermCWHack with 136s (1) cores
% 5.01/6.55 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 5.01/6.55 % Starting C12_02_nc_SAT001_MinMin_p005000_rr with 136s (1) cores
% 5.01/6.55 % Starting new_bool_3 with 136s (1) cores
% 5.01/6.55 % Starting new_bool_1 with 136s (1) cores
% 5.01/6.55 % Preprocessing time : 0.002 s
% 5.01/6.55 % Presaturation interreduction done
% 5.01/6.55
% 5.01/6.55 % Proof found!
% 5.01/6.55 % SZS status Unsatisfiable
% 5.01/6.55 % SZS output start CNFRefutation
% See solution above
% 5.01/6.55 % Parsed axioms : 12
% 5.01/6.55 % Removed by relevancy pruning/SinE : 0
% 5.01/6.55 % Initial clauses : 12
% 5.01/6.55 % Removed in clause preprocessing : 0
% 5.01/6.55 % Initial clauses in saturation : 12
% 5.01/6.55 % Processed clauses : 676
% 5.01/6.55 % ...of these trivial : 378
% 5.01/6.55 % ...subsumed : 48
% 5.01/6.55 % ...remaining for further processing : 250
% 5.01/6.55 % Other redundant clauses eliminated : 0
% 5.01/6.55 % Clauses deleted for lack of memory : 0
% 5.01/6.55 % Backward-subsumed : 10
% 5.01/6.55 % Backward-rewritten : 121
% 5.01/6.55 % Generated clauses : 24805
% 5.01/6.55 % ...of the previous two non-redundant : 17998
% 5.01/6.55 % ...aggressively subsumed : 0
% 5.01/6.55 % Contextual simplify-reflections : 1
% 5.01/6.55 % Paramodulations : 24799
% 5.01/6.55 % Factorizations : 2
% 5.01/6.55 % NegExts : 0
% 5.01/6.55 % Equation resolutions : 4
% 5.01/6.55 % Disequality decompositions : 0
% 5.01/6.55 % Total rewrite steps : 59085
% 5.01/6.55 % ...of those cached : 54100
% 5.01/6.55 % Propositional unsat checks : 0
% 5.01/6.55 % Propositional check models : 0
% 5.01/6.55 % Propositional check unsatisfiable : 0
% 5.01/6.55 % Propositional clauses : 0
% 5.01/6.55 % Propositional clauses after purity: 0
% 5.01/6.55 % Propositional unsat core size : 0
% 5.01/6.55 % Propositional preprocessing time : 0.000
% 5.01/6.55 % Propositional encoding time : 0.000
% 5.01/6.55 % Propositional solver time : 0.000
% 5.01/6.55 % Success case prop preproc time : 0.000
% 5.01/6.55 % Success case prop encoding time : 0.000
% 5.01/6.55 % Success case prop solver time : 0.000
% 5.01/6.55 % Current number of processed clauses : 107
% 5.01/6.55 % Positive orientable unit clauses : 105
% 5.01/6.55 % Positive unorientable unit clauses: 0
% 5.01/6.55 % Negative unit clauses : 0
% 5.01/6.55 % Non-unit-clauses : 2
% 5.01/6.55 % Current number of unprocessed clauses: 16449
% 5.01/6.55 % ...number of literals in the above : 18968
% 5.01/6.55 % Current number of archived formulas : 0
% 5.01/6.55 % Current number of archived clauses : 143
% 5.01/6.55 % Clause-clause subsumption calls (NU) : 222
% 5.01/6.55 % Rec. Clause-clause subsumption calls : 218
% 5.01/6.55 % Non-unit clause-clause subsumptions : 49
% 5.01/6.55 % Unit Clause-clause subsumption calls : 118
% 5.01/6.55 % Rewrite failures with RHS unbound : 0
% 5.01/6.55 % BW rewrite match attempts : 891
% 5.01/6.55 % BW rewrite match successes : 105
% 5.01/6.55 % Condensation attempts : 0
% 5.01/6.55 % Condensation successes : 0
% 5.01/6.55 % Termbank termtop insertions : 423160
% 5.01/6.55 % Search garbage collected termcells : 2
% 5.01/6.55
% 5.01/6.55 % -------------------------------------------------
% 5.01/6.55 % User time : 0.668 s
% 5.01/6.55 % System time : 0.033 s
% 5.01/6.55 % Total time : 0.702 s
% 5.01/6.55 % Maximum resident set size: 3592 pages
% 5.01/6.55
% 5.01/6.55 % -------------------------------------------------
% 5.01/6.55 % User time : 2.723 s
% 5.01/6.55 % System time : 0.127 s
% 5.01/6.55 % Total time : 2.850 s
% 5.01/6.55 % Maximum resident set size: 4864 pages
% 5.01/6.55 % E exiting
%------------------------------------------------------------------------------