%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP697-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 : n016.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:44:57 PM UTC 2026
% Result : Unsatisfiable 17.38s 4.11s
% Output : CNFRefutation 17.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 12
% Syntax : Number of clauses : 62 ( 62 unt; 0 nHn; 4 RR)
% Number of literals : 62 ( 61 equ; 3 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 : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 117 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c02) ).
cnf(c10,axiom,
mult(i(X1),X1) = unit,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c10) ).
cnf(c11,axiom,
mult(X1,i(X1)) = unit,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c11) ).
cnf(c08,axiom,
mult(X1,mult(X2,X3)) = mult(rd(mult(X1,X2),X1),mult(X1,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c08) ).
cnf(c05,axiom,
mult(X1,unit) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c05) ).
cnf(c07,axiom,
mult(X1,i(mult(X2,X1))) = i(X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c07) ).
cnf(c03,axiom,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c03) ).
cnf(c04,axiom,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c04) ).
cnf(c01,axiom,
mult(X1,ld(X1,X2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c01) ).
cnf(c09,axiom,
mult(mult(X1,X2),X3) = mult(mult(X1,X3),ld(X3,mult(X2,X3))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c09) ).
cnf(c06,axiom,
mult(unit,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c06) ).
cnf(goals,negated_conjecture,
mult(mult(a,b),mult(b,mult(c,b))) != mult(mult(a,mult(b,mult(b,c))),b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(c_0_12,axiom,
ld(X1,mult(X1,X2)) = X2,
c02 ).
cnf(c_0_13,axiom,
mult(i(X1),X1) = unit,
c10 ).
cnf(c_0_14,axiom,
mult(X1,i(X1)) = unit,
c11 ).
cnf(c_0_15,axiom,
mult(X1,mult(X2,X3)) = mult(rd(mult(X1,X2),X1),mult(X1,X3)),
c08 ).
cnf(c_0_16,axiom,
mult(X1,unit) = X1,
c05 ).
cnf(c_0_17,axiom,
mult(X1,i(mult(X2,X1))) = i(X2),
c07 ).
cnf(c_0_18,plain,
ld(i(X1),unit) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
ld(X1,unit) = i(X1),
inference(spm,[status(thm)],[c_0_12,c_0_14]) ).
cnf(c_0_20,axiom,
mult(rd(X1,X2),X2) = X1,
c03 ).
cnf(c_0_21,axiom,
rd(mult(X1,X2),X2) = X1,
c04 ).
cnf(c_0_22,plain,
rd(mult(X1,X2),X1) = mult(X1,mult(X2,i(X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_14]),c_0_16]) ).
cnf(c_0_23,axiom,
mult(X1,ld(X1,X2)) = X2,
c01 ).
cnf(c_0_24,plain,
ld(X1,i(X2)) = i(mult(X2,X1)),
inference(spm,[status(thm)],[c_0_12,c_0_17]) ).
cnf(c_0_25,plain,
i(i(X1)) = X1,
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,plain,
ld(rd(X1,X2),X1) = X2,
inference(spm,[status(thm)],[c_0_12,c_0_20]) ).
cnf(c_0_27,axiom,
mult(mult(X1,X2),X3) = mult(mult(X1,X3),ld(X3,mult(X2,X3))),
c09 ).
cnf(c_0_28,axiom,
mult(unit,X1) = X1,
c06 ).
cnf(c_0_29,plain,
rd(i(X1),i(mult(X1,X2))) = X2,
inference(spm,[status(thm)],[c_0_21,c_0_17]) ).
cnf(c_0_30,plain,
i(rd(X1,X2)) = mult(X2,i(X1)),
inference(spm,[status(thm)],[c_0_17,c_0_20]) ).
cnf(c_0_31,plain,
mult(X1,mult(ld(X1,X2),i(X1))) = rd(X2,X1),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_32,plain,
i(mult(i(X1),X2)) = ld(X2,X1),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_33,plain,
ld(mult(X1,mult(X2,i(X1))),mult(X1,X2)) = X1,
inference(spm,[status(thm)],[c_0_26,c_0_22]) ).
cnf(c_0_34,plain,
mult(i(mult(X1,X2)),X1) = i(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_17]),c_0_25]) ).
cnf(c_0_35,plain,
ld(X1,mult(X2,X1)) = mult(mult(i(X1),X2),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_13]),c_0_28]) ).
cnf(c_0_36,plain,
rd(i(X1),X2) = i(mult(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_17]),c_0_25]) ).
cnf(c_0_37,plain,
i(mult(X1,i(X2))) = rd(X2,X1),
inference(spm,[status(thm)],[c_0_25,c_0_30]) ).
cnf(c_0_38,plain,
ld(X1,rd(X2,X1)) = mult(ld(X1,X2),i(X1)),
inference(spm,[status(thm)],[c_0_12,c_0_31]) ).
cnf(c_0_39,plain,
ld(X1,rd(X2,X3)) = i(mult(mult(X3,i(X2)),X1)),
inference(spm,[status(thm)],[c_0_32,c_0_30]) ).
cnf(c_0_40,plain,
ld(mult(X1,i(X2)),mult(X1,ld(X2,X1))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_32]) ).
cnf(c_0_41,plain,
mult(X1,mult(mult(i(X1),X2),X1)) = mult(X2,X1),
inference(spm,[status(thm)],[c_0_23,c_0_35]) ).
cnf(c_0_42,plain,
mult(X1,mult(i(mult(X2,X1)),i(X1))) = i(mult(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_17]),c_0_36]) ).
cnf(c_0_43,plain,
rd(X1,i(X2)) = ld(i(X1),X2),
inference(spm,[status(thm)],[c_0_32,c_0_37]) ).
cnf(c_0_44,plain,
i(mult(mult(X1,i(X2)),X1)) = mult(ld(X1,X2),i(X1)),
inference(rw,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_45,plain,
mult(mult(X1,i(X2)),X1) = mult(X1,ld(X2,X1)),
inference(spm,[status(thm)],[c_0_23,c_0_40]) ).
cnf(c_0_46,plain,
mult(mult(X1,ld(X2,mult(X3,X2))),ld(ld(X2,mult(X3,X2)),mult(mult(X4,X3),X2))) = mult(mult(X1,mult(X4,X2)),ld(X2,mult(X3,X2))),
inference(spm,[status(thm)],[c_0_27,c_0_27]) ).
cnf(c_0_47,plain,
mult(ld(i(X1),X2),X1) = mult(X1,mult(X2,X1)),
inference(spm,[status(thm)],[c_0_41,c_0_23]) ).
cnf(c_0_48,plain,
ld(i(X1),mult(X2,X1)) = mult(mult(X1,X2),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_42]),c_0_25]),c_0_37]),c_0_43]) ).
cnf(c_0_49,plain,
ld(mult(X1,X2),mult(X1,ld(i(X2),X1))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_20]),c_0_43]) ).
cnf(c_0_50,plain,
i(mult(X1,ld(X2,X1))) = mult(ld(X1,X2),i(X1)),
inference(rw,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_51,plain,
mult(mult(X1,mult(mult(i(X2),X3),X2)),ld(mult(mult(i(X2),X3),X2),mult(mult(X4,X3),X2))) = mult(mult(X1,mult(X4,X2)),mult(mult(i(X2),X3),X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_35]),c_0_35]),c_0_35]) ).
cnf(c_0_52,plain,
mult(mult(mult(X1,X2),X1),X1) = mult(X1,mult(mult(X2,X1),X1)),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_53,plain,
mult(X1,ld(i(X2),X1)) = mult(mult(X1,X2),X1),
inference(spm,[status(thm)],[c_0_23,c_0_49]) ).
cnf(c_0_54,plain,
ld(i(mult(X1,X2)),X1) = mult(X1,mult(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_50]),c_0_25]),c_0_47]),c_0_24]) ).
cnf(c_0_55,plain,
mult(mult(X1,mult(mult(X2,X3),X2)),X2) = mult(mult(X1,X2),mult(mult(X3,X2),X2)),
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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_13]),c_0_28]),c_0_13]),c_0_28]),c_0_12]),c_0_13]),c_0_28]) ).
cnf(c_0_56,plain,
mult(mult(X1,mult(X1,X2)),X1) = mult(X1,mult(X1,mult(X2,X1))),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_57,negated_conjecture,
mult(mult(a,b),mult(b,mult(c,b))) != mult(mult(a,mult(b,mult(b,c))),b),
inference(fof_simplification,[status(thm)],[goals]) ).
cnf(c_0_58,plain,
mult(mult(X1,mult(X2,mult(X2,mult(X3,X2)))),X2) = mult(mult(X1,X2),mult(X2,mult(mult(X3,X2),X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_52]) ).
cnf(c_0_59,negated_conjecture,
mult(mult(a,b),mult(b,mult(c,b))) != mult(mult(a,mult(b,mult(b,c))),b),
c_0_57 ).
cnf(c_0_60,plain,
mult(mult(X1,mult(X2,mult(X2,X3))),X2) = mult(mult(X1,X2),mult(X2,mult(X3,X2))),
inference(spm,[status(thm)],[c_0_58,c_0_20]) ).
cnf(c_0_61,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_60])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : GRP697-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.42 % Computer : n016.cluster.edu
% 0.16/0.42 % Model : x86_64 x86_64
% 0.16/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.42 % Memory : 8046.5625MB
% 0.16/0.42 % OS : Linux 6.8.0-71-generic
% 0.16/0.42 % CPULimit : 300
% 0.16/0.42 % WCLimit : 300
% 0.16/0.42 % DateTime : Sun Sep 20 20:38:21 UTC 2026
% 0.16/0.43 % CPUTime :
% 0.16/0.43 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.52 Running first-order theorem proving
% 0.16/0.52 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
% 17.38/4.11 % Version: 3.5.1
% 17.38/4.11 % Preprocessing class: FSSSSMSSSSSNFFN.
% 17.38/4.11 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 17.38/4.11 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 17.38/4.11 % Starting new_bool_3 with 300s (1) cores
% 17.38/4.11 % Starting new_bool_1 with 300s (1) cores
% 17.38/4.11 % Starting sh5l with 300s (1) cores
% 17.38/4.11 % new_bool_3 with pid 765075 completed with status 9
% 17.38/4.11 % new_bool_1 with pid 765076 completed with status 9
% 17.38/4.11 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 765070 completed with status 0
% 17.38/4.11 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 17.38/4.11 % Preprocessing class: FSSSSMSSSSSNFFN.
% 17.38/4.11 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 17.38/4.11 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 17.38/4.11 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 17.38/4.11 % No SInE strategy applied
% 17.38/4.11 % Search class: FUUPM-FFSF21-MFFFFFNN
% 17.38/4.11 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 17.38/4.11 % Starting SubtermCWHack with 136s (1) cores
% 17.38/4.11 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 17.38/4.11 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 17.38/4.11 % Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 17.38/4.11 % Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 17.38/4.11 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 765072 completed with status 0
% 17.38/4.11 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 17.38/4.11 % Preprocessing class: FSSSSMSSSSSNFFN.
% 17.38/4.11 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 17.38/4.11 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 17.38/4.11 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 17.38/4.11 % No SInE strategy applied
% 17.38/4.11 % Search class: FUUPM-FFSF21-MFFFFFNN
% 17.38/4.11 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 17.38/4.11 % Starting SubtermCWHack with 136s (1) cores
% 17.38/4.11 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 17.38/4.11 % Preprocessing time : 0.006 s
% 17.38/4.11
% 17.38/4.11 % Proof found!
% 17.38/4.11 % SZS status Unsatisfiable
% 17.38/4.11 % SZS output start CNFRefutation
% See solution above
% 17.38/4.11 % Parsed axioms : 12
% 17.38/4.11 % Removed by relevancy pruning/SinE : 0
% 17.38/4.11 % Initial clauses : 12
% 17.38/4.11 % Removed in clause preprocessing : 0
% 17.38/4.11 % Initial clauses in saturation : 12
% 17.38/4.11 % Processed clauses : 705
% 17.38/4.11 % ...of these trivial : 236
% 17.38/4.11 % ...subsumed : 47
% 17.38/4.11 % ...remaining for further processing : 422
% 17.38/4.11 % Other redundant clauses eliminated : 0
% 17.38/4.11 % Clauses deleted for lack of memory : 0
% 17.38/4.11 % Backward-subsumed : 1
% 17.38/4.11 % Backward-rewritten : 166
% 17.38/4.11 % Generated clauses : 69524
% 17.38/4.11 % ...of the previous two non-redundant : 59102
% 17.38/4.11 % ...aggressively subsumed : 0
% 17.38/4.11 % Contextual simplify-reflections : 0
% 17.38/4.11 % Paramodulations : 69524
% 17.38/4.11 % Factorizations : 0
% 17.38/4.11 % NegExts : 0
% 17.38/4.11 % Equation resolutions : 0
% 17.38/4.11 % Disequality decompositions : 0
% 17.38/4.11 % Total rewrite steps : 268277
% 17.38/4.11 % ...of those cached : 252564
% 17.38/4.11 % Propositional unsat checks : 0
% 17.38/4.11 % Propositional check models : 0
% 17.38/4.11 % Propositional check unsatisfiable : 0
% 17.38/4.11 % Propositional clauses : 0
% 17.38/4.11 % Propositional clauses after purity: 0
% 17.38/4.11 % Propositional unsat core size : 0
% 17.38/4.11 % Propositional preprocessing time : 0.000
% 17.38/4.11 % Propositional encoding time : 0.000
% 17.38/4.11 % Propositional solver time : 0.000
% 17.38/4.11 % Success case prop preproc time : 0.000
% 17.38/4.11 % Success case prop encoding time : 0.000
% 17.38/4.11 % Success case prop solver time : 0.000
% 17.38/4.11 % Current number of processed clauses : 255
% 17.38/4.11 % Positive orientable unit clauses : 254
% 17.38/4.11 % Positive unorientable unit clauses: 1
% 17.38/4.11 % Negative unit clauses : 0
% 17.38/4.11 % Non-unit-clauses : 0
% 17.38/4.11 % Current number of unprocessed clauses: 57480
% 17.38/4.11 % ...number of literals in the above : 57480
% 17.38/4.11 % Current number of archived formulas : 0
% 17.38/4.11 % Current number of archived clauses : 167
% 17.38/4.11 % Clause-clause subsumption calls (NU) : 0
% 17.38/4.11 % Rec. Clause-clause subsumption calls : 0
% 17.38/4.11 % Non-unit clause-clause subsumptions : 0
% 17.38/4.11 % Unit Clause-clause subsumption calls : 167
% 17.38/4.11 % Rewrite failures with RHS unbound : 0
% 17.38/4.11 % BW rewrite match attempts : 3228
% 17.38/4.11 % BW rewrite match successes : 192
% 17.38/4.11 % Condensation attempts : 0
% 17.38/4.11 % Condensation successes : 0
% 17.38/4.11 % Termbank termtop insertions : 1548884
% 17.38/4.11 % Search garbage collected termcells : 2
% 17.38/4.11
% 17.38/4.11 % -------------------------------------------------
% 17.38/4.11 % User time : 3.265 s
% 17.38/4.11 % System time : 0.149 s
% 17.38/4.11 % Total time : 3.414 s
% 17.38/4.11 % Maximum resident set size: 3636 pages
% 17.38/4.11
% 17.38/4.11 % -------------------------------------------------
% 17.38/4.11 % User time : 16.676 s
% 17.38/4.11 % System time : 0.700 s
% 17.38/4.11 % Total time : 17.376 s
% 17.38/4.11 % Maximum resident set size: 4864 pages
% 17.38/4.11 % E exiting
%------------------------------------------------------------------------------