%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : ALG240-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 : n014.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:01:46 PM UTC 2026
% Result : Unsatisfiable 15.90s 2.85s
% Output : CNFRefutation 15.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of clauses : 28 ( 28 unt; 0 nHn; 4 RR)
% Number of literals : 28 ( 27 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 74 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c03,axiom,
mult(mult(mult(X1,X2),mult(X3,X4)),mult(mult(mult(X1,X2),mult(X3,X4)),mult(mult(X1,X3),mult(X2,X4)))) = mult(mult(X1,X3),mult(X2,X4)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c03) ).
cnf(c01,axiom,
mult(X1,mult(X2,X3)) = mult(mult(X1,X2),mult(X1,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c01) ).
cnf(c02,axiom,
mult(mult(X1,X2),X3) = mult(mult(X1,X3),mult(X2,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c02) ).
cnf(c04,axiom,
mult(mult(mult(mult(X1,X2),mult(X3,X4)),mult(mult(X1,X3),mult(X2,X4))),mult(mult(X1,X3),mult(X2,X4))) = mult(mult(X1,X2),mult(X3,X4)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c04) ).
cnf(goals,negated_conjecture,
mult(mult(mult(a,b),mult(c,d)),mult(mult(a,c),mult(b,d))) != mult(mult(mult(a,c),mult(b,d)),mult(mult(a,b),mult(c,d))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(c_0_5,axiom,
mult(mult(mult(X1,X2),mult(X3,X4)),mult(mult(mult(X1,X2),mult(X3,X4)),mult(mult(X1,X3),mult(X2,X4)))) = mult(mult(X1,X3),mult(X2,X4)),
c03 ).
cnf(c_0_6,axiom,
mult(X1,mult(X2,X3)) = mult(mult(X1,X2),mult(X1,X3)),
c01 ).
cnf(c_0_7,axiom,
mult(mult(X1,X2),X3) = mult(mult(X1,X3),mult(X2,X3)),
c02 ).
cnf(c_0_8,plain,
mult(mult(mult(X1,mult(X1,X1)),X1),mult(X2,X3)) = mult(X1,mult(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7]),c_0_7]),c_0_7]) ).
cnf(c_0_9,plain,
mult(mult(X1,X2),mult(X3,mult(X3,mult(X3,X3)))) = mult(mult(X1,X2),mult(X3,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_7]),c_0_6]),c_0_6]) ).
cnf(c_0_10,plain,
mult(mult(X1,X1),X2) = mult(X1,mult(X2,X2)),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,plain,
mult(X1,mult(X2,mult(X2,mult(X2,X2)))) = mult(X1,mult(X2,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_8]) ).
cnf(c_0_12,plain,
mult(mult(X1,X1),mult(X2,X3)) = mult(X1,mult(mult(X2,X2),X3)),
inference(spm,[status(thm)],[c_0_10,c_0_7]) ).
cnf(c_0_13,plain,
mult(mult(X1,mult(X2,X2)),X3) = mult(mult(X1,X2),mult(X3,X3)),
inference(spm,[status(thm)],[c_0_10,c_0_6]) ).
cnf(c_0_14,plain,
mult(mult(X1,X1),mult(X2,X2)) = mult(X1,mult(X2,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_6]),c_0_11]) ).
cnf(c_0_15,plain,
mult(mult(X1,X1),mult(X2,X3)) = mult(X1,mult(X2,mult(X3,X3))),
inference(spm,[status(thm)],[c_0_10,c_0_6]) ).
cnf(c_0_16,plain,
mult(mult(X1,mult(X1,X1)),mult(X2,X3)) = mult(X1,mult(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_13]),c_0_6]) ).
cnf(c_0_17,plain,
mult(X1,mult(X2,mult(X2,X2))) = mult(X1,mult(X2,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_14]),c_0_14]) ).
cnf(c_0_18,plain,
mult(X1,mult(X2,mult(X1,X1))) = mult(mult(X1,X2),X1),
inference(spm,[status(thm)],[c_0_7,c_0_15]) ).
cnf(c_0_19,plain,
mult(mult(mult(X1,X2),mult(X3,X4)),mult(X5,mult(mult(mult(X1,X3),mult(X2,X4)),mult(mult(X1,X2),mult(X3,X4))))) = mult(mult(mult(X1,X3),mult(X2,X4)),mult(X5,mult(mult(X1,X2),mult(X3,X4)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_5]),c_0_6]) ).
cnf(c_0_20,plain,
mult(X1,mult(X2,mult(X3,X3))) = mult(X1,mult(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_16]),c_0_16]) ).
cnf(c_0_21,axiom,
mult(mult(mult(mult(X1,X2),mult(X3,X4)),mult(mult(X1,X3),mult(X2,X4))),mult(mult(X1,X3),mult(X2,X4))) = mult(mult(X1,X2),mult(X3,X4)),
c04 ).
cnf(c_0_22,negated_conjecture,
mult(mult(mult(a,b),mult(c,d)),mult(mult(a,c),mult(b,d))) != mult(mult(mult(a,c),mult(b,d)),mult(mult(a,b),mult(c,d))),
inference(fof_simplification,[status(thm)],[goals]) ).
cnf(c_0_23,plain,
mult(mult(X1,X2),X1) = mult(X1,mult(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_16]),c_0_18]),c_0_6]) ).
cnf(c_0_24,plain,
mult(mult(mult(X1,X2),mult(X3,X4)),mult(mult(mult(X1,X3),mult(X2,X4)),mult(mult(X1,X2),mult(X3,X4)))) = mult(mult(X1,X3),mult(X2,X4)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[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_10,c_0_19]),c_0_6]),c_0_6]),c_0_20]),c_0_21]),c_0_6]),c_0_6]),c_0_20]) ).
cnf(c_0_25,negated_conjecture,
mult(mult(mult(a,b),mult(c,d)),mult(mult(a,c),mult(b,d))) != mult(mult(mult(a,c),mult(b,d)),mult(mult(a,b),mult(c,d))),
c_0_22 ).
cnf(c_0_26,plain,
mult(mult(mult(X1,X2),mult(X3,X4)),mult(mult(X1,X3),mult(X2,X4))) = mult(mult(mult(X1,X3),mult(X2,X4)),mult(mult(X1,X2),mult(X3,X4))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_21]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ALG240-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n014.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 13:09:35 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.44 Running first-order theorem proving
% 0.13/0.44 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
% 15.90/2.85 % Version: 3.5.1
% 15.90/2.85 % Preprocessing class: FSSSSMSSSSSNFFN.
% 15.90/2.85 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.90/2.85 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 15.90/2.85 % Starting new_bool_3 with 300s (1) cores
% 15.90/2.85 % Starting new_bool_1 with 300s (1) cores
% 15.90/2.85 % Starting sh5l with 300s (1) cores
% 15.90/2.85 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 4136805 completed with status 0
% 15.90/2.85 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 15.90/2.85 % Preprocessing class: FSSSSMSSSSSNFFN.
% 15.90/2.85 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.90/2.85 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 15.90/2.85 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 15.90/2.85 % No SInE strategy applied
% 15.90/2.85 % Search class: FUUPM-FFSF22-MFFFFFNN
% 15.90/2.85 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 15.90/2.85 % Starting SubtermCWHack with 136s (1) cores
% 15.90/2.85 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 15.90/2.85 % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 15.90/2.85 % Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 15.90/2.85 % Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 15.90/2.85 % U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 4136815 completed with status 0
% 15.90/2.85 % Result found by U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 15.90/2.85 % Preprocessing class: FSSSSMSSSSSNFFN.
% 15.90/2.85 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.90/2.85 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 15.90/2.85 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 15.90/2.85 % No SInE strategy applied
% 15.90/2.85 % Search class: FUUPM-FFSF22-MFFFFFNN
% 15.90/2.85 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 15.90/2.85 % Starting SubtermCWHack with 136s (1) cores
% 15.90/2.85 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 15.90/2.85 % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 15.90/2.85 % Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 15.90/2.85 % Preprocessing time : 0.002 s
% 15.90/2.85 % Presaturation interreduction done
% 15.90/2.85
% 15.90/2.85 % Proof found!
% 15.90/2.85 % SZS status Unsatisfiable
% 15.90/2.85 % SZS output start CNFRefutation
% See solution above
% 15.90/2.85 % Parsed axioms : 5
% 15.90/2.85 % Removed by relevancy pruning/SinE : 0
% 15.90/2.85 % Initial clauses : 5
% 15.90/2.85 % Removed in clause preprocessing : 0
% 15.90/2.85 % Initial clauses in saturation : 5
% 15.90/2.85 % Processed clauses : 432
% 15.90/2.85 % ...of these trivial : 139
% 15.90/2.85 % ...subsumed : 189
% 15.90/2.85 % ...remaining for further processing : 104
% 15.90/2.85 % Other redundant clauses eliminated : 0
% 15.90/2.85 % Clauses deleted for lack of memory : 0
% 15.90/2.85 % Backward-subsumed : 0
% 15.90/2.85 % Backward-rewritten : 25
% 15.90/2.85 % Generated clauses : 42645
% 15.90/2.85 % ...of the previous two non-redundant : 32562
% 15.90/2.85 % ...aggressively subsumed : 0
% 15.90/2.85 % Contextual simplify-reflections : 0
% 15.90/2.85 % Paramodulations : 42645
% 15.90/2.85 % Factorizations : 0
% 15.90/2.85 % NegExts : 0
% 15.90/2.85 % Equation resolutions : 0
% 15.90/2.85 % Disequality decompositions : 0
% 15.90/2.85 % Total rewrite steps : 97690
% 15.90/2.85 % ...of those cached : 88508
% 15.90/2.85 % Propositional unsat checks : 0
% 15.90/2.85 % Propositional check models : 0
% 15.90/2.85 % Propositional check unsatisfiable : 0
% 15.90/2.85 % Propositional clauses : 0
% 15.90/2.85 % Propositional clauses after purity: 0
% 15.90/2.85 % Propositional unsat core size : 0
% 15.90/2.85 % Propositional preprocessing time : 0.000
% 15.90/2.85 % Propositional encoding time : 0.000
% 15.90/2.85 % Propositional solver time : 0.000
% 15.90/2.85 % Success case prop preproc time : 0.000
% 15.90/2.85 % Success case prop encoding time : 0.000
% 15.90/2.85 % Success case prop solver time : 0.000
% 15.90/2.85 % Current number of processed clauses : 74
% 15.90/2.85 % Positive orientable unit clauses : 65
% 15.90/2.85 % Positive unorientable unit clauses: 9
% 15.90/2.85 % Negative unit clauses : 0
% 15.90/2.85 % Non-unit-clauses : 0
% 15.90/2.85 % Current number of unprocessed clauses: 31229
% 15.90/2.85 % ...number of literals in the above : 31229
% 15.90/2.85 % Current number of archived formulas : 0
% 15.90/2.85 % Current number of archived clauses : 30
% 15.90/2.85 % Clause-clause subsumption calls (NU) : 0
% 15.90/2.85 % Rec. Clause-clause subsumption calls : 0
% 15.90/2.85 % Non-unit clause-clause subsumptions : 0
% 15.90/2.85 % Unit Clause-clause subsumption calls : 264
% 15.90/2.85 % Rewrite failures with RHS unbound : 0
% 15.90/2.85 % BW rewrite match attempts : 2341
% 15.90/2.85 % BW rewrite match successes : 65
% 15.90/2.85 % Condensation attempts : 0
% 15.90/2.85 % Condensation successes : 0
% 15.90/2.85 % Termbank termtop insertions : 1600246
% 15.90/2.85 % Search garbage collected termcells : 2
% 15.90/2.85
% 15.90/2.85 % -------------------------------------------------
% 15.90/2.85 % User time : 2.237 s
% 15.90/2.85 % System time : 0.068 s
% 15.90/2.85 % Total time : 2.306 s
% 15.90/2.85 % Maximum resident set size: 3632 pages
% 15.90/2.85
% 15.90/2.85 % -------------------------------------------------
% 15.90/2.85 % User time : 11.139 s
% 15.90/2.85 % System time : 0.349 s
% 15.90/2.85 % Total time : 11.488 s
% 15.90/2.85 % Maximum resident set size: 4608 pages
% 15.90/2.85 % E exiting
%------------------------------------------------------------------------------