%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP686-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 : n009.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:46 PM UTC 2026
% Result : Unsatisfiable 0.09s 0.48s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 8
% Syntax : Number of clauses : 44 ( 44 unt; 0 nHn; 5 RR)
% Number of literals : 44 ( 43 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 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 : 78 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c07,axiom,
mult(X1,mult(X2,mult(X2,X3))) = mult(mult(X1,mult(X2,X2)),X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c07) ).
cnf(c06,axiom,
mult(unit,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c06) ).
cnf(c02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c02) ).
cnf(c01,axiom,
mult(X1,ld(X1,X2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c01) ).
cnf(c05,axiom,
mult(X1,unit) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c05) ).
cnf(c04,axiom,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c04) ).
cnf(goals,negated_conjecture,
mult(mult(a,a),mult(b,c)) != mult(mult(a,mult(a,b)),c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(c03,axiom,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c03) ).
cnf(c_0_8,axiom,
mult(X1,mult(X2,mult(X2,X3))) = mult(mult(X1,mult(X2,X2)),X3),
c07 ).
cnf(c_0_9,axiom,
mult(unit,X1) = X1,
c06 ).
cnf(c_0_10,axiom,
ld(X1,mult(X1,X2)) = X2,
c02 ).
cnf(c_0_11,plain,
mult(mult(X1,X1),X2) = mult(X1,mult(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_9]) ).
cnf(c_0_12,axiom,
mult(X1,ld(X1,X2)) = X2,
c01 ).
cnf(c_0_13,plain,
ld(mult(X1,X1),mult(X1,mult(X1,X2))) = X2,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
mult(X1,mult(X2,mult(X2,ld(mult(X1,mult(X2,X2)),X3)))) = X3,
inference(spm,[status(thm)],[c_0_12,c_0_8]) ).
cnf(c_0_15,plain,
ld(mult(X1,X1),mult(X1,X2)) = mult(X3,mult(X3,ld(mult(X1,mult(X3,X3)),X2))),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,plain,
mult(X1,ld(mult(X1,X1),mult(X1,X2))) = X2,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,axiom,
mult(X1,unit) = X1,
c05 ).
cnf(c_0_18,plain,
mult(X1,ld(mult(X1,X1),X1)) = unit,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,plain,
ld(mult(X1,X1),X1) = ld(X1,unit),
inference(spm,[status(thm)],[c_0_10,c_0_18]) ).
cnf(c_0_20,plain,
mult(X1,mult(X1,ld(mult(X2,mult(X1,X1)),unit))) = ld(X2,unit),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_17]),c_0_19]) ).
cnf(c_0_21,axiom,
rd(mult(X1,X2),X2) = X1,
c04 ).
cnf(c_0_22,plain,
ld(mult(X1,X1),ld(X2,unit)) = ld(mult(X2,mult(X1,X1)),unit),
inference(spm,[status(thm)],[c_0_13,c_0_20]) ).
cnf(c_0_23,plain,
rd(X1,ld(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_21,c_0_12]) ).
cnf(c_0_24,plain,
ld(mult(X1,mult(ld(X1,unit),ld(X1,unit))),unit) = ld(ld(X1,unit),unit),
inference(spm,[status(thm)],[c_0_19,c_0_22]) ).
cnf(c_0_25,plain,
ld(mult(X1,mult(X2,X2)),mult(X1,mult(X2,mult(X2,X3)))) = X3,
inference(spm,[status(thm)],[c_0_10,c_0_8]) ).
cnf(c_0_26,plain,
mult(X1,mult(ld(X1,unit),ld(X1,unit))) = ld(X1,unit),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_23]) ).
cnf(c_0_27,plain,
ld(mult(X1,mult(X2,X2)),X1) = mult(ld(X2,unit),ld(X2,unit)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_12]),c_0_17]) ).
cnf(c_0_28,plain,
ld(mult(X1,mult(X2,X2)),X1) = ld(mult(X3,mult(X2,X2)),X3),
inference(spm,[status(thm)],[c_0_27,c_0_27]) ).
cnf(c_0_29,plain,
mult(X1,ld(mult(X1,X1),unit)) = ld(X1,unit),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27]),c_0_9]) ).
cnf(c_0_30,plain,
ld(mult(X1,mult(X2,X2)),X1) = ld(mult(X2,X2),unit),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_27]),c_0_9]) ).
cnf(c_0_31,plain,
rd(ld(X1,unit),ld(mult(X1,X1),unit)) = X1,
inference(spm,[status(thm)],[c_0_21,c_0_29]) ).
cnf(c_0_32,plain,
rd(X1,ld(mult(X2,X2),unit)) = mult(X1,mult(X2,X2)),
inference(spm,[status(thm)],[c_0_23,c_0_30]) ).
cnf(c_0_33,plain,
mult(ld(X1,unit),mult(X1,X1)) = X1,
inference(rw,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_34,negated_conjecture,
mult(mult(a,a),mult(b,c)) != mult(mult(a,mult(a,b)),c),
inference(fof_simplification,[status(thm)],[goals]) ).
cnf(c_0_35,plain,
mult(mult(X1,mult(X2,mult(X3,mult(X3,mult(X2,mult(X3,X3)))))),X4) = mult(X1,mult(X2,mult(X3,mult(X3,mult(X2,mult(X3,mult(X3,X4))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_8]),c_0_8]),c_0_8]) ).
cnf(c_0_36,plain,
mult(ld(X1,unit),mult(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_33]),c_0_12]) ).
cnf(c_0_37,axiom,
mult(rd(X1,X2),X2) = X1,
c03 ).
cnf(c_0_38,negated_conjecture,
mult(mult(a,a),mult(b,c)) != mult(mult(a,mult(a,b)),c),
c_0_34 ).
cnf(c_0_39,plain,
mult(mult(X1,mult(X1,mult(X2,mult(X1,X1)))),X3) = mult(X1,mult(X1,mult(X2,mult(X1,mult(X1,X3))))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_36]) ).
cnf(c_0_40,plain,
mult(rd(X1,mult(X2,X2)),mult(X2,mult(X2,X3))) = mult(X1,X3),
inference(spm,[status(thm)],[c_0_8,c_0_37]) ).
cnf(c_0_41,negated_conjecture,
mult(mult(a,mult(a,b)),c) != mult(a,mult(a,mult(b,c))),
inference(rw,[status(thm)],[c_0_38,c_0_11]) ).
cnf(c_0_42,plain,
mult(mult(X1,mult(X1,X2)),X3) = mult(X1,mult(X1,mult(X2,X3))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_37]),c_0_40]) ).
cnf(c_0_43,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP686-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n009.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Sun Sep 20 20:33:12 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 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.09/0.48 % Version: 3.5.1
% 0.09/0.48 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.09/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.48 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.09/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.48 % Starting sh5l with 300s (1) cores
% 0.09/0.48 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 11581 completed with status 0
% 0.09/0.48 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.09/0.48 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.09/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.48 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.09/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.48 % No SInE strategy applied
% 0.09/0.48 % Search class: FUUPM-FFSF22-MFFFFFNN
% 0.09/0.48 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.48 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.09/0.48 % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.09/0.48 % Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.09/0.48 % Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.09/0.48 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 11586 completed with status 0
% 0.09/0.48 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.09/0.48 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.09/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.48 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.09/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.48 % No SInE strategy applied
% 0.09/0.48 % Search class: FUUPM-FFSF22-MFFFFFNN
% 0.09/0.48 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.48 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.09/0.48 % Preprocessing time : 0.002 s
% 0.09/0.48
% 0.09/0.48 % Proof found!
% 0.09/0.48 % SZS status Unsatisfiable
% 0.09/0.48 % SZS output start CNFRefutation
% See solution above
% 0.09/0.48 % Parsed axioms : 8
% 0.09/0.48 % Removed by relevancy pruning/SinE : 0
% 0.09/0.48 % Initial clauses : 8
% 0.09/0.48 % Removed in clause preprocessing : 0
% 0.09/0.48 % Initial clauses in saturation : 8
% 0.09/0.48 % Processed clauses : 94
% 0.09/0.48 % ...of these trivial : 19
% 0.09/0.48 % ...subsumed : 0
% 0.09/0.48 % ...remaining for further processing : 75
% 0.09/0.48 % Other redundant clauses eliminated : 0
% 0.09/0.48 % Clauses deleted for lack of memory : 0
% 0.09/0.48 % Backward-subsumed : 0
% 0.09/0.48 % Backward-rewritten : 30
% 0.09/0.48 % Generated clauses : 2792
% 0.09/0.48 % ...of the previous two non-redundant : 2062
% 0.09/0.48 % ...aggressively subsumed : 0
% 0.09/0.48 % Contextual simplify-reflections : 0
% 0.09/0.48 % Paramodulations : 2792
% 0.09/0.48 % Factorizations : 0
% 0.09/0.48 % NegExts : 0
% 0.09/0.48 % Equation resolutions : 0
% 0.09/0.48 % Disequality decompositions : 0
% 0.09/0.48 % Total rewrite steps : 6328
% 0.09/0.48 % ...of those cached : 5296
% 0.09/0.48 % Propositional unsat checks : 0
% 0.09/0.48 % Propositional check models : 0
% 0.09/0.48 % Propositional check unsatisfiable : 0
% 0.09/0.48 % Propositional clauses : 0
% 0.09/0.48 % Propositional clauses after purity: 0
% 0.09/0.48 % Propositional unsat core size : 0
% 0.09/0.48 % Propositional preprocessing time : 0.000
% 0.09/0.48 % Propositional encoding time : 0.000
% 0.09/0.48 % Propositional solver time : 0.000
% 0.09/0.48 % Success case prop preproc time : 0.000
% 0.09/0.48 % Success case prop encoding time : 0.000
% 0.09/0.48 % Success case prop solver time : 0.000
% 0.09/0.48 % Current number of processed clauses : 45
% 0.09/0.48 % Positive orientable unit clauses : 45
% 0.09/0.48 % Positive unorientable unit clauses: 0
% 0.09/0.48 % Negative unit clauses : 0
% 0.09/0.48 % Non-unit-clauses : 0
% 0.09/0.48 % Current number of unprocessed clauses: 1934
% 0.09/0.48 % ...number of literals in the above : 1934
% 0.09/0.48 % Current number of archived formulas : 0
% 0.09/0.48 % Current number of archived clauses : 30
% 0.09/0.48 % Clause-clause subsumption calls (NU) : 0
% 0.09/0.48 % Rec. Clause-clause subsumption calls : 0
% 0.09/0.48 % Non-unit clause-clause subsumptions : 0
% 0.09/0.48 % Unit Clause-clause subsumption calls : 3
% 0.09/0.48 % Rewrite failures with RHS unbound : 0
% 0.09/0.48 % BW rewrite match attempts : 185
% 0.09/0.48 % BW rewrite match successes : 30
% 0.09/0.48 % Condensation attempts : 0
% 0.09/0.48 % Condensation successes : 0
% 0.09/0.48 % Termbank termtop insertions : 67840
% 0.09/0.48 % Search garbage collected termcells : 2
% 0.09/0.48
% 0.09/0.48 % -------------------------------------------------
% 0.09/0.48 % User time : 0.054 s
% 0.09/0.48 % System time : 0.007 s
% 0.09/0.48 % Total time : 0.061 s
% 0.09/0.48 % Maximum resident set size: 3580 pages
% 0.09/0.48
% 0.09/0.48 % -------------------------------------------------
% 0.09/0.48 % User time : 0.235 s
% 0.09/0.48 % System time : 0.030 s
% 0.09/0.48 % Total time : 0.265 s
% 0.09/0.48 % Maximum resident set size: 4864 pages
% 0.09/0.48 % E exiting
%------------------------------------------------------------------------------