%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP755-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 : n001.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 0.15s 5.88s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 10
% Syntax : Number of clauses : 45 ( 31 unt; 14 nHn; 4 RR)
% Number of literals : 59 ( 58 equ; 3 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 75 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(f01,axiom,
mult(X1,ld(X1,X2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f01) ).
cnf(f09,axiom,
i(X1) = ld(X1,unit),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f09) ).
cnf(f08,axiom,
( mult(X1,mult(X3,X2)) = mult(mult(X1,X2),X3)
| mult(X1,mult(X2,X3)) = mult(mult(X1,X2),X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f08) ).
cnf(f06,axiom,
mult(unit,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f06) ).
cnf(f02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f02) ).
cnf(f07,axiom,
( mult(X1,mult(X2,X3)) = mult(mult(X1,X3),X2)
| mult(X1,mult(X2,X3)) = mult(mult(X1,X2),X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f07) ).
cnf(f04,axiom,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f04) ).
cnf(f05,axiom,
mult(X1,unit) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f05) ).
cnf(f03,axiom,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f03) ).
cnf(goals,negated_conjecture,
i(mult(a,b)) != mult(i(b),i(a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(c_0_10,axiom,
mult(X1,ld(X1,X2)) = X2,
f01 ).
cnf(c_0_11,axiom,
i(X1) = ld(X1,unit),
f09 ).
cnf(c_0_12,axiom,
( mult(X1,mult(X3,X2)) = mult(mult(X1,X2),X3)
| mult(X1,mult(X2,X3)) = mult(mult(X1,X2),X3) ),
f08 ).
cnf(c_0_13,plain,
mult(X1,i(X1)) = unit,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,axiom,
mult(unit,X1) = X1,
f06 ).
cnf(c_0_15,axiom,
ld(X1,mult(X1,X2)) = X2,
f02 ).
cnf(c_0_16,plain,
( mult(X1,mult(i(X1),X2)) = X2
| mult(X1,mult(X2,i(X1))) = X2 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_14]) ).
cnf(c_0_17,plain,
( ld(X1,X2) = mult(i(X1),X2)
| mult(X1,mult(X2,i(X1))) = X2 ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,axiom,
( mult(X1,mult(X2,X3)) = mult(mult(X1,X3),X2)
| mult(X1,mult(X2,X3)) = mult(mult(X1,X2),X3) ),
f07 ).
cnf(c_0_19,plain,
( ld(X1,X2) = mult(X2,i(X1))
| ld(X1,X2) = mult(i(X1),X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_17]) ).
cnf(c_0_20,axiom,
rd(mult(X1,X2),X2) = X1,
f04 ).
cnf(c_0_21,plain,
mult(mult(X1,X2),X2) = mult(X1,mult(X2,X2)),
inference(ef,[status(thm)],[c_0_18]) ).
cnf(c_0_22,plain,
( mult(mult(X1,X2),i(X1)) = X2
| mult(i(X1),mult(X1,X2)) = X2 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_19]),c_0_15]) ).
cnf(c_0_23,plain,
rd(mult(X1,mult(X2,X2)),X2) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
( mult(X1,mult(i(X1),X2)) = X2
| mult(i(X1),mult(X1,X2)) = X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_22]),c_0_13]),c_0_14])]) ).
cnf(c_0_25,plain,
rd(X1,X1) = unit,
inference(spm,[status(thm)],[c_0_20,c_0_14]) ).
cnf(c_0_26,axiom,
mult(X1,unit) = X1,
f05 ).
cnf(c_0_27,axiom,
mult(rd(X1,X2),X2) = X1,
f03 ).
cnf(c_0_28,plain,
( mult(i(X1),X1) = unit
| mult(X1,mult(i(X1),X1)) = X1 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_29,plain,
ld(X1,X1) = unit,
inference(spm,[status(thm)],[c_0_15,c_0_26]) ).
cnf(c_0_30,plain,
( mult(rd(X1,X2),mult(X2,X3)) = mult(X1,X3)
| mult(rd(X1,X2),mult(X3,X2)) = mult(X1,X3) ),
inference(spm,[status(thm)],[c_0_12,c_0_27]) ).
cnf(c_0_31,plain,
mult(i(X1),X1) = unit,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_28]),c_0_29])]) ).
cnf(c_0_32,plain,
( rd(X2,i(X1)) = mult(X1,X2)
| mult(i(X1),mult(X1,X2)) = X2 ),
inference(spm,[status(thm)],[c_0_20,c_0_22]) ).
cnf(c_0_33,plain,
rd(X1,X2) = mult(X1,i(X2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_26]),c_0_13]),c_0_26])]) ).
cnf(c_0_34,plain,
i(i(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_31]),c_0_26]),c_0_13]),c_0_26])]) ).
cnf(c_0_35,plain,
( mult(X2,X1) = mult(X1,X2)
| mult(i(X1),mult(X1,X2)) = X2 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_36,plain,
( mult(ld(X1,X2),X1) = X2
| ld(X1,X2) = mult(i(X1),X2) ),
inference(spm,[status(thm)],[c_0_35,c_0_10]) ).
cnf(c_0_37,plain,
ld(i(X1),X2) = mult(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_36]),c_0_10]),c_0_34])]) ).
cnf(c_0_38,plain,
mult(mult(X1,X2),i(X2)) = X1,
inference(rw,[status(thm)],[c_0_20,c_0_33]) ).
cnf(c_0_39,plain,
mult(i(X1),mult(X1,X2)) = X2,
inference(spm,[status(thm)],[c_0_10,c_0_37]) ).
cnf(c_0_40,negated_conjecture,
i(mult(a,b)) != mult(i(b),i(a)),
inference(fof_simplification,[status(thm)],[goals]) ).
cnf(c_0_41,plain,
mult(X1,i(mult(X2,X1))) = i(X2),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,negated_conjecture,
i(mult(a,b)) != mult(i(b),i(a)),
c_0_40 ).
cnf(c_0_43,plain,
mult(i(X1),i(X2)) = i(mult(X2,X1)),
inference(spm,[status(thm)],[c_0_39,c_0_41]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP755-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.12/5.60 % Computer : n001.cluster.edu
% 0.12/5.60 % Model : x86_64 x86_64
% 0.12/5.60 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.60 % Memory : 8046.5625MB
% 0.12/5.60 % OS : Linux 6.8.0-71-generic
% 0.12/5.60 % CPULimit : 300
% 0.12/5.60 % WCLimit : 300
% 0.12/5.60 % DateTime : Sun Sep 20 20:43:19 UTC 2026
% 0.12/5.61 % CPUTime :
% 0.12/5.61 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/5.64 Running first-order theorem proving
% 0.12/5.64 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
% 0.15/5.88 % Version: 3.5.1
% 0.15/5.88 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/5.88 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.88 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/5.88 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.88 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.88 % Starting sh5l with 300s (1) cores
% 0.15/5.88 % sh5l with pid 1376135 completed with status 0
% 0.15/5.88 % Result found by sh5l
% 0.15/5.88 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/5.88 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.88 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/5.88 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.88 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.88 % Starting sh5l with 300s (1) cores
% 0.15/5.88 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/5.88 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/5.88 % Search class: FGUPM-FFSF21-SFFFFFNN
% 0.15/5.88 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.88 % Starting SubtermCWHack with 31s (1) cores
% 0.15/5.88 % SubtermCWHack with pid 1376142 completed with status 0
% 0.15/5.88 % Result found by SubtermCWHack
% 0.15/5.88 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/5.88 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.88 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/5.88 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.88 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.88 % Starting sh5l with 300s (1) cores
% 0.15/5.88 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/5.88 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/5.88 % Search class: FGUPM-FFSF21-SFFFFFNN
% 0.15/5.88 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.88 % Starting SubtermCWHack with 31s (1) cores
% 0.15/5.88 % Preprocessing time : 0.001 s
% 0.15/5.88
% 0.15/5.88 % Proof found!
% 0.15/5.88 % SZS status Unsatisfiable
% 0.15/5.88 % SZS output start CNFRefutation
% See solution above
% 0.15/5.88 % Parsed axioms : 10
% 0.15/5.88 % Removed by relevancy pruning/SinE : 0
% 0.15/5.88 % Initial clauses : 10
% 0.15/5.88 % Removed in clause preprocessing : 0
% 0.15/5.88 % Initial clauses in saturation : 10
% 0.15/5.88 % Processed clauses : 455
% 0.15/5.88 % ...of these trivial : 209
% 0.15/5.88 % ...subsumed : 43
% 0.15/5.88 % ...remaining for further processing : 203
% 0.15/5.88 % Other redundant clauses eliminated : 0
% 0.15/5.88 % Clauses deleted for lack of memory : 0
% 0.15/5.88 % Backward-subsumed : 9
% 0.15/5.88 % Backward-rewritten : 143
% 0.15/5.88 % Generated clauses : 16148
% 0.15/5.88 % ...of the previous two non-redundant : 13054
% 0.15/5.88 % ...aggressively subsumed : 0
% 0.15/5.88 % Contextual simplify-reflections : 0
% 0.15/5.88 % Paramodulations : 16114
% 0.15/5.88 % Factorizations : 34
% 0.15/5.88 % NegExts : 0
% 0.15/5.88 % Equation resolutions : 0
% 0.15/5.88 % Disequality decompositions : 0
% 0.15/5.88 % Total rewrite steps : 16120
% 0.15/5.88 % ...of those cached : 15315
% 0.15/5.88 % Propositional unsat checks : 0
% 0.15/5.88 % Propositional check models : 0
% 0.15/5.88 % Propositional check unsatisfiable : 0
% 0.15/5.88 % Propositional clauses : 0
% 0.15/5.88 % Propositional clauses after purity: 0
% 0.15/5.88 % Propositional unsat core size : 0
% 0.15/5.88 % Propositional preprocessing time : 0.000
% 0.15/5.88 % Propositional encoding time : 0.000
% 0.15/5.88 % Propositional solver time : 0.000
% 0.15/5.88 % Success case prop preproc time : 0.000
% 0.15/5.88 % Success case prop encoding time : 0.000
% 0.15/5.88 % Success case prop solver time : 0.000
% 0.15/5.88 % Current number of processed clauses : 51
% 0.15/5.88 % Positive orientable unit clauses : 29
% 0.15/5.88 % Positive unorientable unit clauses: 0
% 0.15/5.88 % Negative unit clauses : 0
% 0.15/5.88 % Non-unit-clauses : 22
% 0.15/5.88 % Current number of unprocessed clauses: 12471
% 0.15/5.88 % ...number of literals in the above : 39329
% 0.15/5.88 % Current number of archived formulas : 0
% 0.15/5.88 % Current number of archived clauses : 152
% 0.15/5.88 % Clause-clause subsumption calls (NU) : 753
% 0.15/5.88 % Rec. Clause-clause subsumption calls : 495
% 0.15/5.88 % Non-unit clause-clause subsumptions : 43
% 0.15/5.88 % Unit Clause-clause subsumption calls : 462
% 0.15/5.88 % Rewrite failures with RHS unbound : 0
% 0.15/5.88 % BW rewrite match attempts : 220
% 0.15/5.88 % BW rewrite match successes : 112
% 0.15/5.88 % Condensation attempts : 0
% 0.15/5.88 % Condensation successes : 0
% 0.15/5.88 % Termbank termtop insertions : 337936
% 0.15/5.88 % Search garbage collected termcells : 2
% 0.15/5.88
% 0.15/5.88 % -------------------------------------------------
% 0.15/5.88 % User time : 0.206 s
% 0.15/5.88 % System time : 0.012 s
% 0.15/5.88 % Total time : 0.218 s
% 0.15/5.88 % Maximum resident set size: 3632 pages
% 0.15/5.88
% 0.15/5.88 % -------------------------------------------------
% 0.15/5.88 % User time : 0.209 s
% 0.15/5.88 % System time : 0.016 s
% 0.15/5.88 % Total time : 0.224 s
% 0.15/5.88 % Maximum resident set size: 4608 pages
% 0.15/5.88 % E exiting
%------------------------------------------------------------------------------