%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP752-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 : n011.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 5.07s 1.19s
% Output : CNFRefutation 5.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of clauses : 35 ( 35 unt; 0 nHn; 4 RR)
% Number of literals : 35 ( 34 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 90 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(f02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f02) ).
cnf(f06,axiom,
mult(mult(X1,X1),mult(X2,X3)) = mult(mult(X1,X2),mult(X1,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f06) ).
cnf(f01,axiom,
mult(X1,ld(X1,X2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f01) ).
cnf(f05,axiom,
mult(mult(X1,mult(X1,X1)),mult(X2,X3)) = mult(mult(X1,X2),mult(mult(X1,X1),X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f05) ).
cnf(f07,axiom,
mult(mult(X1,X2),mult(X3,X3)) = mult(mult(X1,X3),mult(X2,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f07) ).
cnf(goals,negated_conjecture,
mult(mult(a,b),c) != mult(mult(a,c),mult(b,ld(c,c))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(c_0_6,axiom,
ld(X1,mult(X1,X2)) = X2,
f02 ).
cnf(c_0_7,axiom,
mult(mult(X1,X1),mult(X2,X3)) = mult(mult(X1,X2),mult(X1,X3)),
f06 ).
cnf(c_0_8,plain,
ld(mult(X1,X2),mult(mult(X1,X1),mult(X2,X3))) = mult(X1,X3),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,axiom,
mult(X1,ld(X1,X2)) = X2,
f01 ).
cnf(c_0_10,plain,
ld(mult(X1,X2),mult(mult(X1,X1),X3)) = mult(X1,ld(X2,X3)),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,plain,
mult(X1,ld(X2,ld(mult(X1,X1),X3))) = ld(mult(X1,X2),X3),
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_12,plain,
ld(mult(X1,X1),mult(mult(X1,X2),mult(X1,X3))) = mult(X2,X3),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_13,axiom,
mult(mult(X1,mult(X1,X1)),mult(X2,X3)) = mult(mult(X1,X2),mult(mult(X1,X1),X3)),
f05 ).
cnf(c_0_14,plain,
ld(X1,ld(mult(X1,X2),X3)) = ld(X2,ld(mult(X1,X1),X3)),
inference(spm,[status(thm)],[c_0_6,c_0_11]) ).
cnf(c_0_15,plain,
ld(mult(X1,X1),mult(mult(X1,X2),X3)) = mult(X2,ld(X1,X3)),
inference(spm,[status(thm)],[c_0_12,c_0_9]) ).
cnf(c_0_16,plain,
ld(mult(X1,X2),mult(mult(X1,mult(X1,X1)),mult(X2,X3))) = mult(mult(X1,X1),X3),
inference(spm,[status(thm)],[c_0_6,c_0_13]) ).
cnf(c_0_17,plain,
mult(X1,ld(ld(X1,X2),X3)) = ld(X2,mult(mult(X1,X1),X3)),
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_18,axiom,
mult(mult(X1,X2),mult(X3,X3)) = mult(mult(X1,X3),mult(X2,X3)),
f07 ).
cnf(c_0_19,plain,
ld(X1,ld(mult(X1,X2),mult(mult(X1,X3),X4))) = ld(X2,mult(X3,ld(X1,X4))),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
ld(X1,mult(mult(X2,X2),ld(X2,mult(X1,X3)))) = ld(X2,mult(mult(X2,X2),X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_16]),c_0_15]) ).
cnf(c_0_21,plain,
ld(X1,ld(X2,mult(mult(X1,X1),X3))) = ld(ld(X1,X2),X3),
inference(spm,[status(thm)],[c_0_6,c_0_17]) ).
cnf(c_0_22,plain,
mult(X1,ld(X2,mult(X3,X1))) = mult(X3,ld(X2,mult(X1,X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_18]),c_0_15]) ).
cnf(c_0_23,plain,
ld(X1,ld(X2,mult(mult(X2,X1),X3))) = ld(ld(X2,X2),X3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_9]) ).
cnf(c_0_24,plain,
ld(X1,mult(X2,ld(X3,mult(X1,X1)))) = ld(X3,mult(X2,X1)),
inference(spm,[status(thm)],[c_0_6,c_0_22]) ).
cnf(c_0_25,plain,
mult(X1,ld(ld(X2,X2),X3)) = ld(X2,mult(mult(X2,X1),X3)),
inference(spm,[status(thm)],[c_0_9,c_0_23]) ).
cnf(c_0_26,plain,
ld(ld(X1,X2),ld(X3,mult(X2,X2))) = ld(ld(X1,X3),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_24]),c_0_21]) ).
cnf(c_0_27,plain,
mult(mult(X1,X1),mult(X2,ld(X1,X3))) = mult(mult(X1,X2),X3),
inference(spm,[status(thm)],[c_0_7,c_0_9]) ).
cnf(c_0_28,plain,
mult(X1,ld(ld(X2,X3),X2)) = ld(X3,mult(mult(X2,X1),X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_24]) ).
cnf(c_0_29,negated_conjecture,
mult(mult(a,b),c) != mult(mult(a,c),mult(b,ld(c,c))),
inference(fof_simplification,[status(thm)],[goals]) ).
cnf(c_0_30,plain,
mult(mult(X1,X1),ld(mult(X2,X1),X3)) = mult(mult(X1,X2),ld(mult(X2,X2),X3)),
inference(spm,[status(thm)],[c_0_27,c_0_11]) ).
cnf(c_0_31,plain,
ld(mult(X1,X2),mult(mult(X1,X3),X1)) = mult(X3,ld(X2,X1)),
inference(spm,[status(thm)],[c_0_28,c_0_6]) ).
cnf(c_0_32,negated_conjecture,
mult(mult(a,b),c) != mult(mult(a,c),mult(b,ld(c,c))),
c_0_29 ).
cnf(c_0_33,plain,
mult(mult(X1,X2),mult(X3,ld(X2,X2))) = mult(mult(X1,X3),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_31]),c_0_27]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP752-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n011.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 20 20:38:10 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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
% 5.07/1.19 % Version: 3.5.1
% 5.07/1.19 % Preprocessing class: FSSSSMSSSSSNFFN.
% 5.07/1.19 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.07/1.19 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 5.07/1.19 % Starting new_bool_3 with 300s (1) cores
% 5.07/1.19 % Starting new_bool_1 with 300s (1) cores
% 5.07/1.19 % Starting sh5l with 300s (1) cores
% 5.07/1.19 % new_bool_1 with pid 139398 completed with status 0
% 5.07/1.19 % Result found by new_bool_1
% 5.07/1.19 % Preprocessing class: FSSSSMSSSSSNFFN.
% 5.07/1.19 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.07/1.19 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 5.07/1.19 % Starting new_bool_3 with 300s (1) cores
% 5.07/1.19 % Starting new_bool_1 with 300s (1) cores
% 5.07/1.19 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 5.07/1.19 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.07/1.19 % Search class: FUUPM-FFSF22-MFFFFFNN
% 5.07/1.19 % Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 5.07/1.19 % Starting SubtermCWHack with 28s (1) cores
% 5.07/1.19 % SubtermCWHack with pid 139405 completed with status 0
% 5.07/1.19 % Result found by SubtermCWHack
% 5.07/1.19 % Preprocessing class: FSSSSMSSSSSNFFN.
% 5.07/1.19 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.07/1.19 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 5.07/1.19 % Starting new_bool_3 with 300s (1) cores
% 5.07/1.19 % Starting new_bool_1 with 300s (1) cores
% 5.07/1.19 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 5.07/1.19 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.07/1.19 % Search class: FUUPM-FFSF22-MFFFFFNN
% 5.07/1.19 % Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 5.07/1.19 % Starting SubtermCWHack with 28s (1) cores
% 5.07/1.19 % Preprocessing time : 0.001 s
% 5.07/1.19
% 5.07/1.19 % Proof found!
% 5.07/1.19 % SZS status Unsatisfiable
% 5.07/1.19 % SZS output start CNFRefutation
% See solution above
% 5.07/1.19 % Parsed axioms : 8
% 5.07/1.19 % Removed by relevancy pruning/SinE : 2
% 5.07/1.19 % Initial clauses : 6
% 5.07/1.19 % Removed in clause preprocessing : 0
% 5.07/1.19 % Initial clauses in saturation : 6
% 5.07/1.19 % Processed clauses : 422
% 5.07/1.19 % ...of these trivial : 61
% 5.07/1.19 % ...subsumed : 210
% 5.07/1.19 % ...remaining for further processing : 151
% 5.07/1.19 % Other redundant clauses eliminated : 0
% 5.07/1.19 % Clauses deleted for lack of memory : 0
% 5.07/1.19 % Backward-subsumed : 0
% 5.07/1.19 % Backward-rewritten : 14
% 5.07/1.19 % Generated clauses : 55225
% 5.07/1.19 % ...of the previous two non-redundant : 51806
% 5.07/1.19 % ...aggressively subsumed : 0
% 5.07/1.19 % Contextual simplify-reflections : 0
% 5.07/1.19 % Paramodulations : 55225
% 5.07/1.19 % Factorizations : 0
% 5.07/1.19 % NegExts : 0
% 5.07/1.19 % Equation resolutions : 0
% 5.07/1.19 % Disequality decompositions : 0
% 5.07/1.19 % Total rewrite steps : 20510
% 5.07/1.19 % ...of those cached : 16190
% 5.07/1.19 % Propositional unsat checks : 0
% 5.07/1.19 % Propositional check models : 0
% 5.07/1.19 % Propositional check unsatisfiable : 0
% 5.07/1.19 % Propositional clauses : 0
% 5.07/1.19 % Propositional clauses after purity: 0
% 5.07/1.19 % Propositional unsat core size : 0
% 5.07/1.19 % Propositional preprocessing time : 0.000
% 5.07/1.19 % Propositional encoding time : 0.000
% 5.07/1.19 % Propositional solver time : 0.000
% 5.07/1.19 % Success case prop preproc time : 0.000
% 5.07/1.19 % Success case prop encoding time : 0.000
% 5.07/1.19 % Success case prop solver time : 0.000
% 5.07/1.19 % Current number of processed clauses : 137
% 5.07/1.19 % Positive orientable unit clauses : 89
% 5.07/1.19 % Positive unorientable unit clauses: 48
% 5.07/1.19 % Negative unit clauses : 0
% 5.07/1.19 % Non-unit-clauses : 0
% 5.07/1.19 % Current number of unprocessed clauses: 51354
% 5.07/1.19 % ...number of literals in the above : 51354
% 5.07/1.19 % Current number of archived formulas : 0
% 5.07/1.19 % Current number of archived clauses : 14
% 5.07/1.19 % Clause-clause subsumption calls (NU) : 0
% 5.07/1.19 % Rec. Clause-clause subsumption calls : 0
% 5.07/1.19 % Non-unit clause-clause subsumptions : 0
% 5.07/1.19 % Unit Clause-clause subsumption calls : 477
% 5.07/1.19 % Rewrite failures with RHS unbound : 0
% 5.07/1.19 % BW rewrite match attempts : 1091
% 5.07/1.19 % BW rewrite match successes : 39
% 5.07/1.19 % Condensation attempts : 0
% 5.07/1.19 % Condensation successes : 0
% 5.07/1.19 % Termbank termtop insertions : 1036740
% 5.07/1.19 % Search garbage collected termcells : 7
% 5.07/1.19
% 5.07/1.19 % -------------------------------------------------
% 5.07/1.19 % User time : 0.575 s
% 5.07/1.19 % System time : 0.046 s
% 5.07/1.19 % Total time : 0.621 s
% 5.07/1.19 % Maximum resident set size: 3632 pages
% 5.07/1.19
% 5.07/1.19 % -------------------------------------------------
% 5.07/1.19 % User time : 0.576 s
% 5.07/1.19 % System time : 0.051 s
% 5.07/1.19 % Total time : 0.627 s
% 5.07/1.19 % Maximum resident set size: 4608 pages
% 5.07/1.19 % E exiting
%------------------------------------------------------------------------------