%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP748-3 : 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 : 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:41:10 PM UTC 2026
% Result : Unsatisfiable 0.23s 0.87s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of clauses : 32 ( 28 unt; 4 nHn; 11 RR)
% Number of literals : 36 ( 35 equ; 5 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; 4 con; 0-2 aty)
% Number of variables : 35 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(goals,negated_conjecture,
mult(a,mult(b,mult(c,b))) != mult(mult(mult(a,b),c),b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(f07,axiom,
mult(mult(mult(X1,X2),X3),X2) = mult(X1,mult(mult(X2,X3),X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f07) ).
cnf(f10,axiom,
mult(i(X1),X1) = unit,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f10) ).
cnf(f06,axiom,
mult(unit,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f06) ).
cnf(f08,axiom,
mult(mult(X1,X2),i(X2)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f08) ).
cnf(f09,axiom,
mult(X1,i(X1)) = unit,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f09) ).
cnf(f11,axiom,
( mult(i(X1),mult(X1,X2)) = X2
| mult(X1,X2) = mult(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f11) ).
cnf(f05,axiom,
mult(X1,unit) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f05) ).
cnf(f02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f02) ).
cnf(c_0_9,negated_conjecture,
mult(a,mult(b,mult(c,b))) != mult(mult(mult(a,b),c),b),
inference(fof_simplification,[status(thm)],[goals]) ).
cnf(c_0_10,axiom,
mult(mult(mult(X1,X2),X3),X2) = mult(X1,mult(mult(X2,X3),X2)),
f07 ).
cnf(c_0_11,axiom,
mult(i(X1),X1) = unit,
f10 ).
cnf(c_0_12,axiom,
mult(unit,X1) = X1,
f06 ).
cnf(c_0_13,axiom,
mult(mult(X1,X2),i(X2)) = X1,
f08 ).
cnf(c_0_14,axiom,
mult(X1,i(X1)) = unit,
f09 ).
cnf(c_0_15,negated_conjecture,
mult(a,mult(b,mult(c,b))) != mult(mult(mult(a,b),c),b),
c_0_9 ).
cnf(c_0_16,axiom,
( mult(i(X1),mult(X1,X2)) = X2
| mult(X1,X2) = mult(X2,X1) ),
f11 ).
cnf(c_0_17,plain,
mult(i(X1),mult(mult(X1,X2),X1)) = mult(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_18,plain,
i(i(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_12]) ).
cnf(c_0_19,axiom,
mult(X1,unit) = X1,
f05 ).
cnf(c_0_20,negated_conjecture,
mult(a,mult(mult(b,c),b)) != mult(a,mult(b,mult(c,b))),
inference(rw,[status(thm)],[c_0_15,c_0_10]) ).
cnf(c_0_21,plain,
( mult(X2,X1) = mult(X1,X2)
| mult(mult(X1,X2),X1) = mult(X1,mult(X2,X1)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_13]) ).
cnf(c_0_22,plain,
mult(mult(X1,X2),X2) = mult(X1,mult(X2,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_19]),c_0_19]) ).
cnf(c_0_23,negated_conjecture,
mult(c,b) = mult(b,c),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,negated_conjecture,
mult(mult(b,c),b) = mult(c,mult(b,b)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,axiom,
ld(X1,mult(X1,X2)) = X2,
f02 ).
cnf(c_0_26,negated_conjecture,
mult(i(b),mult(c,mult(b,b))) = mult(b,c),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_24]),c_0_23]) ).
cnf(c_0_27,plain,
( mult(X1,X2) = mult(X2,X1)
| ld(i(X1),X2) = mult(X1,X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_16]) ).
cnf(c_0_28,negated_conjecture,
ld(i(b),mult(b,c)) = mult(c,mult(b,b)),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
mult(a,mult(c,mult(b,b))) != mult(a,mult(b,mult(b,c))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_24]),c_0_23]) ).
cnf(c_0_30,negated_conjecture,
mult(c,mult(b,b)) = mult(b,mult(b,c)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_24])]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GRP748-3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.66 % Computer : n009.cluster.edu
% 0.20/0.66 % Model : x86_64 x86_64
% 0.20/0.66 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.66 % Memory : 8046.5625MB
% 0.20/0.66 % OS : Linux 6.8.0-71-generic
% 0.20/0.66 % CPULimit : 300
% 0.20/0.66 % WCLimit : 300
% 0.20/0.66 % DateTime : Sun Sep 20 20:37:13 UTC 2026
% 0.20/0.66 % CPUTime :
% 0.20/0.66 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.73 Running first-order theorem proving
% 0.23/0.73 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.23/0.87 % Version: 3.5.1
% 0.23/0.87 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.87 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.87 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.87 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.87 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.87 % Starting sh5l with 300s (1) cores
% 0.23/0.87 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 17657 completed with status 0
% 0.23/0.87 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.23/0.87 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.87 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.87 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.87 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.87 % No SInE strategy applied
% 0.23/0.87 % Search class: FGUPM-FFSF21-MFFFFFNN
% 0.23/0.87 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.87 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.87 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.23/0.87 % Starting C12_02_nc_SAT001_MinMin_p005000_rr with 136s (1) cores
% 0.23/0.87 % Starting new_bool_3 with 136s (1) cores
% 0.23/0.87 % Starting new_bool_1 with 136s (1) cores
% 0.23/0.87 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 17659 completed with status 0
% 0.23/0.87 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.23/0.87 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.87 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.87 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.87 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.87 % No SInE strategy applied
% 0.23/0.87 % Search class: FGUPM-FFSF21-MFFFFFNN
% 0.23/0.87 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.87 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.87 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.23/0.87 % Preprocessing time : 0.003 s
% 0.23/0.87
% 0.23/0.87 % Proof found!
% 0.23/0.87 % SZS status Unsatisfiable
% 0.23/0.87 % SZS output start CNFRefutation
% See solution above
% 0.23/0.87 % Parsed axioms : 12
% 0.23/0.87 % Removed by relevancy pruning/SinE : 0
% 0.23/0.87 % Initial clauses : 12
% 0.23/0.87 % Removed in clause preprocessing : 0
% 0.23/0.87 % Initial clauses in saturation : 12
% 0.23/0.87 % Processed clauses : 124
% 0.23/0.87 % ...of these trivial : 27
% 0.23/0.87 % ...subsumed : 2
% 0.23/0.87 % ...remaining for further processing : 95
% 0.23/0.87 % Other redundant clauses eliminated : 0
% 0.23/0.87 % Clauses deleted for lack of memory : 0
% 0.23/0.87 % Backward-subsumed : 0
% 0.23/0.87 % Backward-rewritten : 23
% 0.23/0.87 % Generated clauses : 2529
% 0.23/0.87 % ...of the previous two non-redundant : 2021
% 0.23/0.87 % ...aggressively subsumed : 0
% 0.23/0.87 % Contextual simplify-reflections : 0
% 0.23/0.87 % Paramodulations : 2529
% 0.23/0.87 % Factorizations : 0
% 0.23/0.87 % NegExts : 0
% 0.23/0.87 % Equation resolutions : 0
% 0.23/0.87 % Disequality decompositions : 0
% 0.23/0.87 % Total rewrite steps : 2064
% 0.23/0.87 % ...of those cached : 1747
% 0.23/0.87 % Propositional unsat checks : 0
% 0.23/0.87 % Propositional check models : 0
% 0.23/0.87 % Propositional check unsatisfiable : 0
% 0.23/0.87 % Propositional clauses : 0
% 0.23/0.87 % Propositional clauses after purity: 0
% 0.23/0.87 % Propositional unsat core size : 0
% 0.23/0.87 % Propositional preprocessing time : 0.000
% 0.23/0.87 % Propositional encoding time : 0.000
% 0.23/0.87 % Propositional solver time : 0.000
% 0.23/0.87 % Success case prop preproc time : 0.000
% 0.23/0.87 % Success case prop encoding time : 0.000
% 0.23/0.87 % Success case prop solver time : 0.000
% 0.23/0.87 % Current number of processed clauses : 72
% 0.23/0.87 % Positive orientable unit clauses : 62
% 0.23/0.87 % Positive unorientable unit clauses: 0
% 0.23/0.87 % Negative unit clauses : 0
% 0.23/0.87 % Non-unit-clauses : 10
% 0.23/0.87 % Current number of unprocessed clauses: 1892
% 0.23/0.87 % ...number of literals in the above : 2789
% 0.23/0.87 % Current number of archived formulas : 0
% 0.23/0.87 % Current number of archived clauses : 23
% 0.23/0.87 % Clause-clause subsumption calls (NU) : 31
% 0.23/0.87 % Rec. Clause-clause subsumption calls : 26
% 0.23/0.87 % Non-unit clause-clause subsumptions : 2
% 0.23/0.87 % Unit Clause-clause subsumption calls : 94
% 0.23/0.87 % Rewrite failures with RHS unbound : 0
% 0.23/0.87 % BW rewrite match attempts : 65
% 0.23/0.87 % BW rewrite match successes : 11
% 0.23/0.87 % Condensation attempts : 0
% 0.23/0.87 % Condensation successes : 0
% 0.23/0.87 % Termbank termtop insertions : 43723
% 0.23/0.87 % Search garbage collected termcells : 2
% 0.23/0.87
% 0.23/0.87 % -------------------------------------------------
% 0.23/0.87 % User time : 0.081 s
% 0.23/0.87 % System time : 0.007 s
% 0.23/0.87 % Total time : 0.088 s
% 0.23/0.87 % Maximum resident set size: 3380 pages
% 0.23/0.87
% 0.23/0.87 % -------------------------------------------------
% 0.23/0.87 % User time : 0.385 s
% 0.23/0.87 % System time : 0.032 s
% 0.23/0.87 % Total time : 0.417 s
% 0.23/0.87 % Maximum resident set size: 4608 pages
% 0.23/0.87 % E exiting
%------------------------------------------------------------------------------