%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP669-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 : 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:40:43 PM UTC 2026
% Result : Unsatisfiable 3.79s 0.98s
% Output : CNFRefutation 3.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 26 ( 26 unt; 0 nHn; 6 RR)
% Number of literals : 26 ( 25 equ; 5 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; 4 con; 0-2 aty)
% Number of variables : 50 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c10,axiom,
mult(mult(X1,X2),mult(X3,X1)) = mult(X1,mult(mult(X2,X3),X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c10) ).
cnf(c06,axiom,
mult(unit,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c06) ).
cnf(c05,axiom,
mult(X1,unit) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c05) ).
cnf(goals,negated_conjecture,
mult(mult(a,b),mult(c,mult(a,b))) != mult(mult(mult(a,mult(b,c)),a),b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(c09,axiom,
mult(mult(X1,X2),mult(X3,X1)) = mult(mult(X1,mult(X2,X3)),X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c09) ).
cnf(c07,axiom,
mult(X1,mult(X2,mult(X1,X3))) = mult(mult(mult(X1,X2),X1),X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c07) ).
cnf(c08,axiom,
mult(X1,mult(X2,mult(X3,X2))) = mult(mult(mult(X1,X2),X3),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c08) ).
cnf(c02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c02) ).
cnf(c_0_8,axiom,
mult(mult(X1,X2),mult(X3,X1)) = mult(X1,mult(mult(X2,X3),X1)),
c10 ).
cnf(c_0_9,axiom,
mult(unit,X1) = X1,
c06 ).
cnf(c_0_10,axiom,
mult(X1,unit) = X1,
c05 ).
cnf(c_0_11,negated_conjecture,
mult(mult(a,b),mult(c,mult(a,b))) != mult(mult(mult(a,mult(b,c)),a),b),
inference(fof_simplification,[status(thm)],[goals]) ).
cnf(c_0_12,axiom,
mult(mult(X1,X2),mult(X3,X1)) = mult(mult(X1,mult(X2,X3)),X1),
c09 ).
cnf(c_0_13,axiom,
mult(X1,mult(X2,mult(X1,X3))) = mult(mult(mult(X1,X2),X1),X3),
c07 ).
cnf(c_0_14,plain,
mult(mult(X1,X2),X1) = mult(X1,mult(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
cnf(c_0_15,negated_conjecture,
mult(mult(a,b),mult(c,mult(a,b))) != mult(mult(mult(a,mult(b,c)),a),b),
c_0_11 ).
cnf(c_0_16,plain,
mult(mult(X1,mult(X2,X3)),X1) = mult(X1,mult(mult(X2,X3),X1)),
inference(rw,[status(thm)],[c_0_12,c_0_8]) ).
cnf(c_0_17,axiom,
mult(X1,mult(X2,mult(X3,X2))) = mult(mult(mult(X1,X2),X3),X2),
c08 ).
cnf(c_0_18,plain,
mult(mult(X1,mult(X2,X1)),X3) = mult(X1,mult(X2,mult(X1,X3))),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,axiom,
ld(X1,mult(X1,X2)) = X2,
c02 ).
cnf(c_0_20,negated_conjecture,
mult(mult(a,mult(mult(b,c),a)),b) != mult(mult(a,b),mult(c,mult(a,b))),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
mult(mult(X1,X2),mult(mult(X3,X1),mult(X4,mult(X3,X1)))) = mult(X1,mult(mult(X2,mult(X3,mult(mult(X1,X4),X3))),X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_8]),c_0_18]),c_0_8]),c_0_17]) ).
cnf(c_0_22,plain,
ld(mult(X1,X2),mult(X1,mult(mult(X2,X3),X1))) = mult(X3,X1),
inference(spm,[status(thm)],[c_0_19,c_0_8]) ).
cnf(c_0_23,negated_conjecture,
mult(mult(a,b),mult(c,mult(a,b))) != mult(a,mult(b,mult(mult(c,a),b))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_18]),c_0_8]) ).
cnf(c_0_24,plain,
mult(mult(X1,X2),mult(X3,mult(X1,X2))) = mult(X1,mult(X2,mult(mult(X3,X1),X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_21]),c_0_22]),c_0_18]),c_0_8]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP669-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.13/0.38 % Computer : n004.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Sun Sep 20 20:31:49 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/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
% 3.79/0.98 % Version: 3.5.1
% 3.79/0.98 % Preprocessing class: FSSSSMSSSSSNFFN.
% 3.79/0.98 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.79/0.98 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.79/0.98 % Starting new_bool_3 with 300s (1) cores
% 3.79/0.98 % Starting new_bool_1 with 300s (1) cores
% 3.79/0.98 % Starting sh5l with 300s (1) cores
% 3.79/0.98 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1439350 completed with status 0
% 3.79/0.98 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 3.79/0.98 % Preprocessing class: FSSSSMSSSSSNFFN.
% 3.79/0.98 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.79/0.98 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.79/0.98 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.79/0.98 % No SInE strategy applied
% 3.79/0.98 % Search class: FUUPM-FFSF22-MFFFFFNN
% 3.79/0.98 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 3.79/0.98 % Starting SubtermCWHack with 136s (1) cores
% 3.79/0.98 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 3.79/0.98 % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 3.79/0.98 % Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 3.79/0.98 % Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 3.79/0.98 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1439355 completed with status 0
% 3.79/0.98 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 3.79/0.98 % Preprocessing class: FSSSSMSSSSSNFFN.
% 3.79/0.98 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.79/0.98 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.79/0.98 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.79/0.98 % No SInE strategy applied
% 3.79/0.98 % Search class: FUUPM-FFSF22-MFFFFFNN
% 3.79/0.98 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 3.79/0.98 % Starting SubtermCWHack with 136s (1) cores
% 3.79/0.98 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 3.79/0.98 % Preprocessing time : 0.002 s
% 3.79/0.98
% 3.79/0.98 % Proof found!
% 3.79/0.98 % SZS status Unsatisfiable
% 3.79/0.98 % SZS output start CNFRefutation
% See solution above
% 3.79/0.98 % Parsed axioms : 11
% 3.79/0.98 % Removed by relevancy pruning/SinE : 0
% 3.79/0.98 % Initial clauses : 11
% 3.79/0.98 % Removed in clause preprocessing : 0
% 3.79/0.98 % Initial clauses in saturation : 11
% 3.79/0.98 % Processed clauses : 297
% 3.79/0.98 % ...of these trivial : 104
% 3.79/0.98 % ...subsumed : 6
% 3.79/0.98 % ...remaining for further processing : 187
% 3.79/0.98 % Other redundant clauses eliminated : 0
% 3.79/0.98 % Clauses deleted for lack of memory : 0
% 3.79/0.98 % Backward-subsumed : 0
% 3.79/0.98 % Backward-rewritten : 65
% 3.79/0.98 % Generated clauses : 26374
% 3.79/0.98 % ...of the previous two non-redundant : 22804
% 3.79/0.98 % ...aggressively subsumed : 0
% 3.79/0.98 % Contextual simplify-reflections : 0
% 3.79/0.98 % Paramodulations : 26374
% 3.79/0.98 % Factorizations : 0
% 3.79/0.98 % NegExts : 0
% 3.79/0.98 % Equation resolutions : 0
% 3.79/0.98 % Disequality decompositions : 0
% 3.79/0.98 % Total rewrite steps : 48215
% 3.79/0.98 % ...of those cached : 35670
% 3.79/0.98 % Propositional unsat checks : 0
% 3.79/0.98 % Propositional check models : 0
% 3.79/0.98 % Propositional check unsatisfiable : 0
% 3.79/0.98 % Propositional clauses : 0
% 3.79/0.98 % Propositional clauses after purity: 0
% 3.79/0.98 % Propositional unsat core size : 0
% 3.79/0.98 % Propositional preprocessing time : 0.000
% 3.79/0.98 % Propositional encoding time : 0.000
% 3.79/0.98 % Propositional solver time : 0.000
% 3.79/0.98 % Success case prop preproc time : 0.000
% 3.79/0.98 % Success case prop encoding time : 0.000
% 3.79/0.98 % Success case prop solver time : 0.000
% 3.79/0.98 % Current number of processed clauses : 122
% 3.79/0.98 % Positive orientable unit clauses : 119
% 3.79/0.98 % Positive unorientable unit clauses: 3
% 3.79/0.98 % Negative unit clauses : 0
% 3.79/0.98 % Non-unit-clauses : 0
% 3.79/0.98 % Current number of unprocessed clauses: 22310
% 3.79/0.98 % ...number of literals in the above : 22310
% 3.79/0.98 % Current number of archived formulas : 0
% 3.79/0.98 % Current number of archived clauses : 65
% 3.79/0.98 % Clause-clause subsumption calls (NU) : 0
% 3.79/0.98 % Rec. Clause-clause subsumption calls : 0
% 3.79/0.98 % Non-unit clause-clause subsumptions : 0
% 3.79/0.98 % Unit Clause-clause subsumption calls : 5
% 3.79/0.98 % Rewrite failures with RHS unbound : 0
% 3.79/0.98 % BW rewrite match attempts : 1178
% 3.79/0.98 % BW rewrite match successes : 72
% 3.79/0.98 % Condensation attempts : 0
% 3.79/0.98 % Condensation successes : 0
% 3.79/0.98 % Termbank termtop insertions : 540919
% 3.79/0.98 % Search garbage collected termcells : 2
% 3.79/0.98
% 3.79/0.98 % -------------------------------------------------
% 3.79/0.98 % User time : 0.486 s
% 3.79/0.98 % System time : 0.028 s
% 3.79/0.98 % Total time : 0.514 s
% 3.79/0.98 % Maximum resident set size: 3636 pages
% 3.79/0.98
% 3.79/0.98 % -------------------------------------------------
% 3.79/0.98 % User time : 2.365 s
% 3.79/0.98 % System time : 0.151 s
% 3.79/0.98 % Total time : 2.515 s
% 3.79/0.98 % Maximum resident set size: 4608 pages
% 3.79/0.98 % E exiting
%------------------------------------------------------------------------------