%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP681-1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n004.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:40:44 PM UTC 2026
% Result : Unsatisfiable 142.75s 21.46s
% Output : CNFRefutation 142.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 10
% Syntax : Number of clauses : 59 ( 59 unt; 0 nHn; 7 RR)
% Number of literals : 59 ( 58 equ; 5 neg)
% Maximal clause size : 1 ( 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 : 79 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c07,axiom,
mult(X1,mult(X2,mult(X1,X3))) = mult(mult(X1,mult(X2,X1)),X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c07) ).
cnf(c06,axiom,
mult(unit,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c06) ).
cnf(c02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c02) ).
cnf(c03,axiom,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c03) ).
cnf(c01,axiom,
mult(X1,ld(X1,X2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c01) ).
cnf(c04,axiom,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c04) ).
cnf(c05,axiom,
mult(X1,unit) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c05) ).
cnf(c09,axiom,
mult(op_d,X1) = mult(X1,op_d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c09) ).
cnf(c08,axiom,
mult(op_c,X1) = mult(X1,op_c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c08) ).
cnf(goals,negated_conjecture,
mult(mult(mult(op_c,op_c),op_d),a) != mult(a,mult(mult(op_c,op_c),op_d)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(c_0_10,axiom,
mult(X1,mult(X2,mult(X1,X3))) = mult(mult(X1,mult(X2,X1)),X3),
c07 ).
cnf(c_0_11,axiom,
mult(unit,X1) = X1,
c06 ).
cnf(c_0_12,axiom,
ld(X1,mult(X1,X2)) = X2,
c02 ).
cnf(c_0_13,plain,
mult(mult(X1,X1),X2) = mult(X1,mult(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_11]) ).
cnf(c_0_14,plain,
ld(mult(X1,X1),mult(X1,mult(X1,X2))) = X2,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,axiom,
mult(rd(X1,X2),X2) = X1,
c03 ).
cnf(c_0_16,axiom,
mult(X1,ld(X1,X2)) = X2,
c01 ).
cnf(c_0_17,axiom,
rd(mult(X1,X2),X2) = X1,
c04 ).
cnf(c_0_18,plain,
ld(mult(rd(X1,X2),rd(X1,X2)),mult(rd(X1,X2),X1)) = X2,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,axiom,
mult(X1,unit) = X1,
c05 ).
cnf(c_0_20,axiom,
mult(op_d,X1) = mult(X1,op_d),
c09 ).
cnf(c_0_21,plain,
mult(X1,mult(X1,ld(mult(X1,X1),X2))) = X2,
inference(spm,[status(thm)],[c_0_16,c_0_13]) ).
cnf(c_0_22,plain,
rd(X1,ld(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_23,plain,
ld(mult(rd(unit,X1),rd(unit,X1)),rd(unit,X1)) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
ld(op_d,mult(X1,op_d)) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_20]) ).
cnf(c_0_25,plain,
mult(X1,ld(mult(X1,X1),X2)) = ld(X1,X2),
inference(spm,[status(thm)],[c_0_12,c_0_21]) ).
cnf(c_0_26,plain,
mult(rd(unit,X1),rd(unit,X1)) = rd(rd(unit,X1),X1),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
rd(X1,op_d) = ld(op_d,X1),
inference(spm,[status(thm)],[c_0_24,c_0_15]) ).
cnf(c_0_28,plain,
ld(mult(X1,X1),X2) = ld(X1,ld(X1,X2)),
inference(spm,[status(thm)],[c_0_12,c_0_25]) ).
cnf(c_0_29,plain,
mult(ld(op_d,unit),ld(op_d,unit)) = ld(op_d,ld(op_d,unit)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_27]) ).
cnf(c_0_30,plain,
ld(ld(op_d,unit),ld(ld(op_d,unit),X1)) = ld(ld(op_d,ld(op_d,unit)),X1),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_31,plain,
mult(ld(X1,X2),mult(X1,mult(ld(X1,X2),X3))) = mult(mult(ld(X1,X2),X2),X3),
inference(spm,[status(thm)],[c_0_10,c_0_16]) ).
cnf(c_0_32,plain,
mult(ld(op_d,unit),ld(ld(op_d,ld(op_d,unit)),X1)) = ld(ld(op_d,unit),X1),
inference(spm,[status(thm)],[c_0_16,c_0_30]) ).
cnf(c_0_33,plain,
mult(op_d,mult(X1,mult(X2,X1))) = mult(X1,mult(X2,mult(X1,op_d))),
inference(spm,[status(thm)],[c_0_20,c_0_10]) ).
cnf(c_0_34,plain,
mult(ld(op_d,unit),mult(op_d,ld(ld(op_d,unit),X1))) = ld(ld(op_d,unit),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_19]),c_0_32]) ).
cnf(c_0_35,plain,
ld(X1,mult(op_d,mult(X1,mult(X2,X1)))) = mult(X2,mult(X1,op_d)),
inference(spm,[status(thm)],[c_0_12,c_0_33]) ).
cnf(c_0_36,plain,
mult(ld(op_d,unit),mult(op_d,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_20]),c_0_16]),c_0_19]),c_0_20]),c_0_16]),c_0_19]) ).
cnf(c_0_37,axiom,
mult(op_c,X1) = mult(X1,op_c),
c08 ).
cnf(c_0_38,plain,
mult(op_d,mult(X1,mult(rd(X2,mult(X1,op_d)),X1))) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_33,c_0_15]) ).
cnf(c_0_39,plain,
mult(ld(op_d,unit),X1) = ld(op_d,X1),
inference(spm,[status(thm)],[c_0_36,c_0_16]) ).
cnf(c_0_40,plain,
ld(X1,X1) = unit,
inference(spm,[status(thm)],[c_0_12,c_0_19]) ).
cnf(c_0_41,plain,
rd(X1,unit) = X1,
inference(spm,[status(thm)],[c_0_19,c_0_15]) ).
cnf(c_0_42,negated_conjecture,
mult(mult(mult(op_c,op_c),op_d),a) != mult(a,mult(mult(op_c,op_c),op_d)),
inference(fof_simplification,[status(thm)],[goals]) ).
cnf(c_0_43,plain,
mult(op_d,mult(X1,X1)) = mult(X1,mult(X1,op_d)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_11]),c_0_11]) ).
cnf(c_0_44,plain,
mult(mult(op_c,mult(op_c,X1)),X2) = mult(op_c,mult(X1,mult(op_c,X2))),
inference(spm,[status(thm)],[c_0_10,c_0_37]) ).
cnf(c_0_45,plain,
mult(X1,ld(op_d,unit)) = ld(op_d,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),c_0_41]),c_0_39]),c_0_16]),c_0_39]) ).
cnf(c_0_46,plain,
ld(op_c,mult(X1,op_c)) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_37]) ).
cnf(c_0_47,negated_conjecture,
mult(mult(mult(op_c,op_c),op_d),a) != mult(a,mult(mult(op_c,op_c),op_d)),
c_0_42 ).
cnf(c_0_48,plain,
mult(mult(X1,mult(X1,op_d)),X2) = mult(X1,mult(op_d,mult(X1,X2))),
inference(spm,[status(thm)],[c_0_10,c_0_20]) ).
cnf(c_0_49,plain,
mult(op_d,mult(X1,X1)) = mult(X1,mult(op_d,X1)),
inference(spm,[status(thm)],[c_0_43,c_0_20]) ).
cnf(c_0_50,plain,
ld(op_d,mult(op_c,mult(op_c,X1))) = mult(op_c,mult(X1,ld(op_d,op_c))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_45]) ).
cnf(c_0_51,plain,
mult(X1,mult(op_c,op_c)) = mult(op_c,mult(op_c,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_44]),c_0_12]) ).
cnf(c_0_52,negated_conjecture,
mult(mult(op_d,mult(op_c,op_c)),a) != mult(a,mult(op_d,mult(op_c,op_c))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_20]),c_0_20]) ).
cnf(c_0_53,plain,
mult(mult(op_d,mult(op_c,op_c)),X1) = mult(op_c,mult(op_d,mult(op_c,X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_37]),c_0_49]) ).
cnf(c_0_54,plain,
ld(op_d,mult(X1,mult(op_c,op_c))) = mult(op_c,mult(X1,ld(op_d,op_c))),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_55,plain,
mult(mult(op_d,mult(op_d,X1)),X2) = mult(op_d,mult(X1,mult(op_d,X2))),
inference(spm,[status(thm)],[c_0_10,c_0_20]) ).
cnf(c_0_56,negated_conjecture,
mult(op_c,mult(op_d,mult(a,op_c))) != mult(a,mult(op_d,mult(op_c,op_c))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53]),c_0_37]) ).
cnf(c_0_57,plain,
mult(X1,mult(op_d,mult(op_c,op_c))) = mult(op_c,mult(op_d,mult(X1,op_c))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_12]),c_0_55]),c_0_16]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_57])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GRP681-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.21/0.47 % Computer : n004.cluster.edu
% 0.21/0.47 % Model : x86_64 x86_64
% 0.21/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.47 % Memory : 8046.5625MB
% 0.21/0.47 % OS : Linux 6.8.0-71-generic
% 0.21/0.47 % CPULimit : 300
% 0.21/0.47 % WCLimit : 300
% 0.21/0.47 % DateTime : Sun Sep 20 20:33:04 UTC 2026
% 0.21/0.48 % CPUTime :
% 0.21/0.48 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.25/0.55 Running first-order theorem proving
% 0.25/0.55 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 142.75/21.46 % Version: 3.5.1
% 142.75/21.46 % Preprocessing class: FSSSSMSSSSSNFFN.
% 142.75/21.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 142.75/21.46 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 142.75/21.46 % Starting new_bool_3 with 300s (1) cores
% 142.75/21.46 % Starting new_bool_1 with 300s (1) cores
% 142.75/21.46 % Starting sh5l with 300s (1) cores
% 142.75/21.46 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1440987 completed with status 0
% 142.75/21.46 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 142.75/21.46 % Preprocessing class: FSSSSMSSSSSNFFN.
% 142.75/21.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 142.75/21.46 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 142.75/21.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 142.75/21.46 % No SInE strategy applied
% 142.75/21.46 % Search class: FUUPM-FFSF22-MFFFFFNN
% 142.75/21.46 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 142.75/21.46 % Starting SubtermCWHack with 136s (1) cores
% 142.75/21.46 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 142.75/21.46 % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 142.75/21.46 % Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 142.75/21.46 % Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 142.75/21.46 % U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 1440996 completed with status 0
% 142.75/21.46 % Result found by U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 142.75/21.46 % Preprocessing class: FSSSSMSSSSSNFFN.
% 142.75/21.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 142.75/21.46 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 142.75/21.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 142.75/21.46 % No SInE strategy applied
% 142.75/21.46 % Search class: FUUPM-FFSF22-MFFFFFNN
% 142.75/21.46 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 142.75/21.46 % Starting SubtermCWHack with 136s (1) cores
% 142.75/21.46 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 142.75/21.46 % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 142.75/21.46 % Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 142.75/21.46 % Preprocessing time : 0.002 s
% 142.75/21.46 % Presaturation interreduction done
% 142.75/21.46
% 142.75/21.46 % Proof found!
% 142.75/21.46 % SZS status Unsatisfiable
% 142.75/21.46 % SZS output start CNFRefutation
% See solution above
% 142.75/21.46 % Parsed axioms : 10
% 142.75/21.46 % Removed by relevancy pruning/SinE : 0
% 142.75/21.46 % Initial clauses : 10
% 142.75/21.46 % Removed in clause preprocessing : 0
% 142.75/21.46 % Initial clauses in saturation : 10
% 142.75/21.46 % Processed clauses : 4542
% 142.75/21.46 % ...of these trivial : 1948
% 142.75/21.46 % ...subsumed : 1313
% 142.75/21.46 % ...remaining for further processing : 1281
% 142.75/21.46 % Other redundant clauses eliminated : 0
% 142.75/21.46 % Clauses deleted for lack of memory : 0
% 142.75/21.46 % Backward-subsumed : 3
% 142.75/21.46 % Backward-rewritten : 453
% 142.75/21.46 % Generated clauses : 396690
% 142.75/21.46 % ...of the previous two non-redundant : 338071
% 142.75/21.46 % ...aggressively subsumed : 0
% 142.75/21.46 % Contextual simplify-reflections : 0
% 142.75/21.46 % Paramodulations : 396690
% 142.75/21.46 % Factorizations : 0
% 142.75/21.46 % NegExts : 0
% 142.75/21.46 % Equation resolutions : 0
% 142.75/21.46 % Disequality decompositions : 0
% 142.75/21.46 % Total rewrite steps : 1410879
% 142.75/21.46 % ...of those cached : 1281430
% 142.75/21.46 % Propositional unsat checks : 0
% 142.75/21.46 % Propositional check models : 0
% 142.75/21.46 % Propositional check unsatisfiable : 0
% 142.75/21.46 % Propositional clauses : 0
% 142.75/21.46 % Propositional clauses after purity: 0
% 142.75/21.46 % Propositional unsat core size : 0
% 142.75/21.46 % Propositional preprocessing time : 0.000
% 142.75/21.46 % Propositional encoding time : 0.000
% 142.75/21.46 % Propositional solver time : 0.000
% 142.75/21.46 % Success case prop preproc time : 0.000
% 142.75/21.46 % Success case prop encoding time : 0.000
% 142.75/21.46 % Success case prop solver time : 0.000
% 142.75/21.46 % Current number of processed clauses : 815
% 142.75/21.46 % Positive orientable unit clauses : 753
% 142.75/21.46 % Positive unorientable unit clauses: 62
% 142.75/21.46 % Negative unit clauses : 0
% 142.75/21.46 % Non-unit-clauses : 0
% 142.75/21.46 % Current number of unprocessed clauses: 332151
% 142.75/21.46 % ...number of literals in the above : 332151
% 142.75/21.46 % Current number of archived formulas : 0
% 142.75/21.46 % Current number of archived clauses : 466
% 142.75/21.46 % Clause-clause subsumption calls (NU) : 0
% 142.75/21.46 % Rec. Clause-clause subsumption calls : 0
% 142.75/21.46 % Non-unit clause-clause subsumptions : 0
% 142.75/21.46 % Unit Clause-clause subsumption calls : 365
% 142.75/21.46 % Rewrite failures with RHS unbound : 0
% 142.75/21.46 % BW rewrite match attempts : 14602
% 142.75/21.46 % BW rewrite match successes : 426
% 142.75/21.46 % Condensation attempts : 0
% 142.75/21.46 % Condensation successes : 0
% 142.75/21.46 % Termbank termtop insertions : 23037764
% 142.75/21.46 % Search garbage collected termcells : 2
% 142.75/21.46
% 142.75/21.46 % -------------------------------------------------
% 142.75/21.46 % User time : 19.748 s
% 142.75/21.46 % System time : 0.692 s
% 142.75/21.46 % Total time : 20.440 s
% 142.75/21.46 % Maximum resident set size: 3632 pages
% 142.75/21.46
% 142.75/21.46 % -------------------------------------------------
% 142.75/21.46 % User time : 98.585 s
% 142.75/21.46 % System time : 3.358 s
% 142.75/21.46 % Total time : 101.943 s
% 142.75/21.46 % Maximum resident set size: 4864 pages
% 142.75/21.46 % E exiting
%------------------------------------------------------------------------------