%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP754-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 : 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:41:11 PM UTC 2026
% Result : Unsatisfiable 6.70s 1.85s
% Output : CNFRefutation 6.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of clauses : 50 ( 50 unt; 0 nHn; 4 RR)
% Number of literals : 50 ( 49 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 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 : 130 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(f02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).
cnf(f05,axiom,
mult(X1,mult(X2,X3)) = mult(mult(rd(X1,X1),X2),mult(X1,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).
cnf(f04,axiom,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f04) ).
cnf(f06,axiom,
mult(mult(X1,X2),X3) = mult(mult(X1,X3),mult(X2,ld(X3,X3))),
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(f03,axiom,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f03) ).
cnf(goals,negated_conjecture,
mult(mult(a,a),mult(b,c)) != mult(mult(a,b),mult(a,c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(c_0_7,axiom,
ld(X1,mult(X1,X2)) = X2,
f02 ).
cnf(c_0_8,axiom,
mult(X1,mult(X2,X3)) = mult(mult(rd(X1,X1),X2),mult(X1,X3)),
f05 ).
cnf(c_0_9,axiom,
rd(mult(X1,X2),X2) = X1,
f04 ).
cnf(c_0_10,axiom,
mult(mult(X1,X2),X3) = mult(mult(X1,X3),mult(X2,ld(X3,X3))),
f06 ).
cnf(c_0_11,plain,
ld(mult(rd(X1,X1),X2),mult(X1,mult(X2,X3))) = mult(X1,X3),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,axiom,
mult(X1,ld(X1,X2)) = X2,
f01 ).
cnf(c_0_13,plain,
rd(mult(mult(X1,X2),X3),mult(X2,ld(X3,X3))) = mult(X1,X3),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,axiom,
mult(rd(X1,X2),X2) = X1,
f03 ).
cnf(c_0_15,plain,
ld(mult(rd(X1,X1),X2),mult(X1,X3)) = mult(X1,ld(X2,X3)),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
rd(mult(X1,mult(X2,X3)),mult(X1,X3)) = mult(rd(X1,X1),X2),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_17,plain,
mult(X1,mult(X2,ld(ld(X3,X1),ld(X3,X1)))) = mult(mult(X3,X2),ld(X3,X1)),
inference(spm,[status(thm)],[c_0_10,c_0_12]) ).
cnf(c_0_18,plain,
rd(mult(X1,X2),mult(X3,ld(X2,X2))) = mult(rd(X1,X3),X2),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
ld(mult(X1,X2),mult(mult(X1,X3),X2)) = mult(X3,ld(X2,X2)),
inference(spm,[status(thm)],[c_0_7,c_0_10]) ).
cnf(c_0_20,plain,
ld(mult(rd(X1,X1),X2),X3) = mult(X1,ld(X2,ld(X1,X3))),
inference(spm,[status(thm)],[c_0_15,c_0_12]) ).
cnf(c_0_21,plain,
mult(mult(rd(X1,X1),X2),X3) = mult(X1,mult(X2,ld(X1,X3))),
inference(spm,[status(thm)],[c_0_8,c_0_12]) ).
cnf(c_0_22,plain,
mult(rd(mult(X1,X2),X3),ld(X1,X3)) = mult(rd(X3,X3),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_23,plain,
mult(X1,ld(X2,mult(X3,ld(X1,X2)))) = mult(X3,ld(X2,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_7]) ).
cnf(c_0_24,plain,
mult(X1,mult(ld(rd(X1,X1),X2),ld(X1,X3))) = mult(X2,X3),
inference(spm,[status(thm)],[c_0_21,c_0_12]) ).
cnf(c_0_25,plain,
mult(X1,mult(X2,ld(X1,ld(mult(rd(X1,X1),X2),X3)))) = X3,
inference(spm,[status(thm)],[c_0_12,c_0_21]) ).
cnf(c_0_26,plain,
rd(mult(rd(X1,X1),X2),ld(X3,X1)) = rd(mult(X3,X2),X1),
inference(spm,[status(thm)],[c_0_9,c_0_22]) ).
cnf(c_0_27,plain,
ld(X1,mult(X2,ld(X3,X3))) = ld(X3,mult(X2,ld(X1,X3))),
inference(spm,[status(thm)],[c_0_7,c_0_23]) ).
cnf(c_0_28,plain,
mult(ld(rd(X1,X1),X2),ld(X1,X3)) = ld(X1,mult(X2,X3)),
inference(spm,[status(thm)],[c_0_7,c_0_24]) ).
cnf(c_0_29,plain,
mult(X1,ld(ld(rd(X1,X1),X2),ld(X1,X3))) = ld(X2,X3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_25]),c_0_20]),c_0_7]),c_0_12]) ).
cnf(c_0_30,plain,
rd(mult(X1,ld(rd(X2,X2),X3)),X2) = rd(X3,ld(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_25]),c_0_20]),c_0_7]),c_0_12]) ).
cnf(c_0_31,plain,
mult(X1,ld(X2,mult(X3,ld(X1,X1)))) = mult(X3,ld(X2,X1)),
inference(spm,[status(thm)],[c_0_12,c_0_27]) ).
cnf(c_0_32,plain,
mult(ld(rd(X1,X1),X2),X3) = ld(X1,mult(X2,mult(X1,X3))),
inference(spm,[status(thm)],[c_0_28,c_0_7]) ).
cnf(c_0_33,plain,
ld(ld(rd(X1,X1),X2),ld(X1,mult(X2,X3))) = ld(X1,X3),
inference(spm,[status(thm)],[c_0_7,c_0_28]) ).
cnf(c_0_34,plain,
ld(ld(rd(X1,X1),X2),ld(X1,X3)) = ld(X1,ld(X2,X3)),
inference(spm,[status(thm)],[c_0_7,c_0_29]) ).
cnf(c_0_35,plain,
ld(rd(X1,X2),X1) = X2,
inference(spm,[status(thm)],[c_0_7,c_0_14]) ).
cnf(c_0_36,plain,
mult(rd(X1,X1),rd(X2,X3)) = rd(mult(X1,X2),mult(X1,X3)),
inference(spm,[status(thm)],[c_0_16,c_0_14]) ).
cnf(c_0_37,plain,
rd(mult(X1,ld(X2,X2)),ld(X2,X3)) = rd(X2,ld(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_30]) ).
cnf(c_0_38,plain,
ld(X1,mult(X2,mult(X1,ld(ld(rd(X1,X1),X2),X3)))) = X3,
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_25,c_0_32]),c_0_20]),c_0_32]),c_0_33]),c_0_7]),c_0_12]) ).
cnf(c_0_39,plain,
ld(ld(rd(X1,X1),X2),X3) = ld(X1,ld(X2,mult(X1,X3))),
inference(spm,[status(thm)],[c_0_34,c_0_7]) ).
cnf(c_0_40,plain,
mult(X1,ld(rd(mult(X1,ld(X2,X2)),X3),X2)) = mult(X2,X3),
inference(spm,[status(thm)],[c_0_31,c_0_35]) ).
cnf(c_0_41,plain,
mult(X1,ld(rd(X2,X3),ld(X1,X4))) = ld(rd(mult(X1,X2),mult(X1,X3)),X4),
inference(spm,[status(thm)],[c_0_20,c_0_36]) ).
cnf(c_0_42,plain,
mult(X1,ld(ld(X2,X3),ld(X2,X3))) = ld(X3,mult(mult(X2,X1),ld(X2,X3))),
inference(spm,[status(thm)],[c_0_19,c_0_12]) ).
cnf(c_0_43,plain,
rd(mult(X1,ld(X2,X2)),X3) = rd(X2,ld(X1,mult(X2,X3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),c_0_12]),c_0_12]) ).
cnf(c_0_44,plain,
ld(mult(X1,X1),mult(X2,mult(X1,X3))) = mult(ld(X1,X2),X3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_23]),c_0_43]),c_0_35]) ).
cnf(c_0_45,negated_conjecture,
mult(mult(a,a),mult(b,c)) != mult(mult(a,b),mult(a,c)),
inference(fof_simplification,[status(thm)],[goals]) ).
cnf(c_0_46,plain,
mult(mult(X1,X1),mult(ld(X1,X2),X3)) = mult(X2,mult(X1,X3)),
inference(spm,[status(thm)],[c_0_12,c_0_44]) ).
cnf(c_0_47,negated_conjecture,
mult(mult(a,a),mult(b,c)) != mult(mult(a,b),mult(a,c)),
c_0_45 ).
cnf(c_0_48,plain,
mult(mult(X1,X1),mult(X2,X3)) = mult(mult(X1,X2),mult(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_38]),c_0_39]),c_0_12]),c_0_12]) ).
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.03 % Problem : GRP754-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.44 % Computer : n004.cluster.edu
% 0.18/0.44 % Model : x86_64 x86_64
% 0.18/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44 % Memory : 8046.5625MB
% 0.18/0.44 % OS : Linux 6.8.0-71-generic
% 0.18/0.44 % CPULimit : 300
% 0.18/0.44 % WCLimit : 300
% 0.18/0.44 % DateTime : Sun Sep 20 20:37:51 UTC 2026
% 0.18/0.44 % CPUTime :
% 0.18/0.44 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.50 Running first-order theorem proving
% 0.18/0.50 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
% 6.70/1.85 % Version: 3.5.1
% 6.70/1.85 % Preprocessing class: FSSSSMSSSSSNFFN.
% 6.70/1.85 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.70/1.85 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 6.70/1.85 % Starting new_bool_3 with 300s (1) cores
% 6.70/1.85 % Starting new_bool_1 with 300s (1) cores
% 6.70/1.85 % Starting sh5l with 300s (1) cores
% 6.70/1.85 % new_bool_3 with pid 1449519 completed with status 9
% 6.70/1.85 % new_bool_1 with pid 1449520 completed with status 9
% 6.70/1.85 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1449518 completed with status 0
% 6.70/1.85 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 6.70/1.85 % Preprocessing class: FSSSSMSSSSSNFFN.
% 6.70/1.85 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.70/1.85 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 6.70/1.85 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 6.70/1.85 % No SInE strategy applied
% 6.70/1.85 % Search class: FUUPM-FFSF22-MFFFFFNN
% 6.70/1.85 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 6.70/1.85 % Starting SubtermCWHack with 136s (1) cores
% 6.70/1.85 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 6.70/1.85 % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 6.70/1.85 % Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 6.70/1.85 % Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 6.70/1.85 % SubtermCWHack with pid 1449522 completed with status 0
% 6.70/1.85 % Result found by SubtermCWHack
% 6.70/1.85 % Preprocessing class: FSSSSMSSSSSNFFN.
% 6.70/1.85 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.70/1.85 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 6.70/1.85 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 6.70/1.85 % No SInE strategy applied
% 6.70/1.85 % Search class: FUUPM-FFSF22-MFFFFFNN
% 6.70/1.85 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 6.70/1.85 % Starting SubtermCWHack with 136s (1) cores
% 6.70/1.85 % Preprocessing time : 0.002 s
% 6.70/1.85
% 6.70/1.85 % Proof found!
% 6.70/1.85 % SZS status Unsatisfiable
% 6.70/1.85 % SZS output start CNFRefutation
% See solution above
% 6.70/1.85 % Parsed axioms : 7
% 6.70/1.85 % Removed by relevancy pruning/SinE : 0
% 6.70/1.85 % Initial clauses : 7
% 6.70/1.85 % Removed in clause preprocessing : 0
% 6.70/1.85 % Initial clauses in saturation : 7
% 6.70/1.85 % Processed clauses : 663
% 6.70/1.85 % ...of these trivial : 288
% 6.70/1.85 % ...subsumed : 123
% 6.70/1.85 % ...remaining for further processing : 252
% 6.70/1.85 % Other redundant clauses eliminated : 0
% 6.70/1.85 % Clauses deleted for lack of memory : 0
% 6.70/1.85 % Backward-subsumed : 0
% 6.70/1.85 % Backward-rewritten : 62
% 6.70/1.85 % Generated clauses : 42853
% 6.70/1.85 % ...of the previous two non-redundant : 38915
% 6.70/1.85 % ...aggressively subsumed : 0
% 6.70/1.85 % Contextual simplify-reflections : 0
% 6.70/1.85 % Paramodulations : 42853
% 6.70/1.85 % Factorizations : 0
% 6.70/1.85 % NegExts : 0
% 6.70/1.85 % Equation resolutions : 0
% 6.70/1.85 % Disequality decompositions : 0
% 6.70/1.85 % Total rewrite steps : 42223
% 6.70/1.85 % ...of those cached : 30665
% 6.70/1.85 % Propositional unsat checks : 0
% 6.70/1.85 % Propositional check models : 0
% 6.70/1.85 % Propositional check unsatisfiable : 0
% 6.70/1.85 % Propositional clauses : 0
% 6.70/1.85 % Propositional clauses after purity: 0
% 6.70/1.85 % Propositional unsat core size : 0
% 6.70/1.85 % Propositional preprocessing time : 0.000
% 6.70/1.85 % Propositional encoding time : 0.000
% 6.70/1.85 % Propositional solver time : 0.000
% 6.70/1.85 % Success case prop preproc time : 0.000
% 6.70/1.85 % Success case prop encoding time : 0.000
% 6.70/1.85 % Success case prop solver time : 0.000
% 6.70/1.85 % Current number of processed clauses : 190
% 6.70/1.85 % Positive orientable unit clauses : 175
% 6.70/1.85 % Positive unorientable unit clauses: 15
% 6.70/1.85 % Negative unit clauses : 0
% 6.70/1.85 % Non-unit-clauses : 0
% 6.70/1.85 % Current number of unprocessed clauses: 38032
% 6.70/1.85 % ...number of literals in the above : 38032
% 6.70/1.85 % Current number of archived formulas : 0
% 6.70/1.85 % Current number of archived clauses : 62
% 6.70/1.85 % Clause-clause subsumption calls (NU) : 0
% 6.70/1.85 % Rec. Clause-clause subsumption calls : 0
% 6.70/1.85 % Non-unit clause-clause subsumptions : 0
% 6.70/1.85 % Unit Clause-clause subsumption calls : 163
% 6.70/1.85 % Rewrite failures with RHS unbound : 1
% 6.70/1.85 % BW rewrite match attempts : 929
% 6.70/1.85 % BW rewrite match successes : 88
% 6.70/1.85 % Condensation attempts : 0
% 6.70/1.85 % Condensation successes : 0
% 6.70/1.85 % Termbank termtop insertions : 873181
% 6.70/1.85 % Search garbage collected termcells : 2
% 6.70/1.85
% 6.70/1.85 % -------------------------------------------------
% 6.70/1.85 % User time : 1.228 s
% 6.70/1.85 % System time : 0.066 s
% 6.70/1.85 % Total time : 1.294 s
% 6.70/1.85 % Maximum resident set size: 3632 pages
% 6.70/1.85
% 6.70/1.85 % -------------------------------------------------
% 6.70/1.85 % User time : 6.274 s
% 6.70/1.85 % System time : 0.345 s
% 6.70/1.85 % Total time : 6.620 s
% 6.70/1.85 % Maximum resident set size: 4864 pages
% 6.70/1.85 % E exiting
%------------------------------------------------------------------------------