%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ALG245-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 : 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 11:55:44 AM UTC 2026
% Result : Unsatisfiable 2.07s 0.87s
% Output : CNFRefutation 2.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 18 ( 18 unt; 0 nHn; 4 RR)
% Number of literals : 18 ( 17 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 : 45 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c02,axiom,
mult(mult(X1,X2),X3) = mult(mult(X1,X3),mult(X2,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c02) ).
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(c05,axiom,
mult(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c05) ).
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_6,axiom,
mult(mult(X1,X2),X3) = mult(mult(X1,X3),mult(X2,X3)),
c02 ).
cnf(c_0_7,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_8,axiom,
mult(X1,mult(X2,X3)) = mult(mult(X1,X2),mult(X1,X3)),
c01 ).
cnf(c_0_9,axiom,
mult(X1,X1) = X1,
c05 ).
cnf(c_0_10,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_6,c_0_7]),c_0_8]) ).
cnf(c_0_11,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_12,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_13,plain,
mult(mult(X1,X2),X1) = mult(X1,mult(X2,X1)),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,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(spm,[status(thm)],[c_0_10,c_0_9]),c_0_11]),c_0_9]) ).
cnf(c_0_15,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_12 ).
cnf(c_0_16,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_13,c_0_14]),c_0_11]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ALG245-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.11/0.37 % Computer : n001.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 13:15:30 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.45 Running first-order theorem proving
% 0.15/0.45 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
% 2.07/0.87 % Version: 3.5.1
% 2.07/0.87 % Preprocessing class: FSSSSMSSSSSNFFN.
% 2.07/0.87 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.07/0.87 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.07/0.87 % Starting new_bool_3 with 300s (1) cores
% 2.07/0.87 % Starting new_bool_1 with 300s (1) cores
% 2.07/0.87 % Starting sh5l with 300s (1) cores
% 2.07/0.87 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3205158 completed with status 0
% 2.07/0.87 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 2.07/0.87 % Preprocessing class: FSSSSMSSSSSNFFN.
% 2.07/0.87 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.07/0.87 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.07/0.87 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.07/0.87 % No SInE strategy applied
% 2.07/0.87 % Search class: FUUPM-FFSF22-MFFFFFNN
% 2.07/0.87 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 2.07/0.87 % Starting SubtermCWHack with 136s (1) cores
% 2.07/0.87 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 2.07/0.87 % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 2.07/0.87 % Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 2.07/0.87 % Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 2.07/0.87 % U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 3205165 completed with status 0
% 2.07/0.87 % Result found by U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 2.07/0.87 % Preprocessing class: FSSSSMSSSSSNFFN.
% 2.07/0.87 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.07/0.87 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.07/0.87 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.07/0.87 % No SInE strategy applied
% 2.07/0.87 % Search class: FUUPM-FFSF22-MFFFFFNN
% 2.07/0.87 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 2.07/0.87 % Starting SubtermCWHack with 136s (1) cores
% 2.07/0.87 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 2.07/0.87 % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 2.07/0.87 % Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 2.07/0.87 % Preprocessing time : 0.002 s
% 2.07/0.87 % Presaturation interreduction done
% 2.07/0.87
% 2.07/0.87 % Proof found!
% 2.07/0.87 % SZS status Unsatisfiable
% 2.07/0.87 % SZS output start CNFRefutation
% See solution above
% 2.07/0.87 % Parsed axioms : 6
% 2.07/0.87 % Removed by relevancy pruning/SinE : 0
% 2.07/0.87 % Initial clauses : 6
% 2.07/0.87 % Removed in clause preprocessing : 0
% 2.07/0.87 % Initial clauses in saturation : 6
% 2.07/0.87 % Processed clauses : 67
% 2.07/0.87 % ...of these trivial : 4
% 2.07/0.87 % ...subsumed : 8
% 2.07/0.87 % ...remaining for further processing : 55
% 2.07/0.87 % Other redundant clauses eliminated : 0
% 2.07/0.87 % Clauses deleted for lack of memory : 0
% 2.07/0.87 % Backward-subsumed : 0
% 2.07/0.87 % Backward-rewritten : 5
% 2.07/0.87 % Generated clauses : 9499
% 2.07/0.87 % ...of the previous two non-redundant : 7329
% 2.07/0.87 % ...aggressively subsumed : 0
% 2.07/0.87 % Contextual simplify-reflections : 0
% 2.07/0.87 % Paramodulations : 9499
% 2.07/0.87 % Factorizations : 0
% 2.07/0.87 % NegExts : 0
% 2.07/0.87 % Equation resolutions : 0
% 2.07/0.87 % Disequality decompositions : 0
% 2.07/0.87 % Total rewrite steps : 14502
% 2.07/0.87 % ...of those cached : 12107
% 2.07/0.87 % Propositional unsat checks : 0
% 2.07/0.87 % Propositional check models : 0
% 2.07/0.87 % Propositional check unsatisfiable : 0
% 2.07/0.87 % Propositional clauses : 0
% 2.07/0.87 % Propositional clauses after purity: 0
% 2.07/0.87 % Propositional unsat core size : 0
% 2.07/0.87 % Propositional preprocessing time : 0.000
% 2.07/0.87 % Propositional encoding time : 0.000
% 2.07/0.87 % Propositional solver time : 0.000
% 2.07/0.87 % Success case prop preproc time : 0.000
% 2.07/0.87 % Success case prop encoding time : 0.000
% 2.07/0.87 % Success case prop solver time : 0.000
% 2.07/0.87 % Current number of processed clauses : 44
% 2.07/0.87 % Positive orientable unit clauses : 39
% 2.07/0.87 % Positive unorientable unit clauses: 5
% 2.07/0.87 % Negative unit clauses : 0
% 2.07/0.87 % Non-unit-clauses : 0
% 2.07/0.87 % Current number of unprocessed clauses: 7273
% 2.07/0.87 % ...number of literals in the above : 7273
% 2.07/0.87 % Current number of archived formulas : 0
% 2.07/0.87 % Current number of archived clauses : 11
% 2.07/0.87 % Clause-clause subsumption calls (NU) : 0
% 2.07/0.87 % Rec. Clause-clause subsumption calls : 0
% 2.07/0.87 % Non-unit clause-clause subsumptions : 0
% 2.07/0.87 % Unit Clause-clause subsumption calls : 80
% 2.07/0.87 % Rewrite failures with RHS unbound : 0
% 2.07/0.87 % BW rewrite match attempts : 472
% 2.07/0.87 % BW rewrite match successes : 13
% 2.07/0.87 % Condensation attempts : 0
% 2.07/0.87 % Condensation successes : 0
% 2.07/0.87 % Termbank termtop insertions : 247750
% 2.07/0.87 % Search garbage collected termcells : 2
% 2.07/0.87
% 2.07/0.87 % -------------------------------------------------
% 2.07/0.87 % User time : 0.345 s
% 2.07/0.87 % System time : 0.012 s
% 2.07/0.87 % Total time : 0.358 s
% 2.07/0.87 % Maximum resident set size: 3376 pages
% 2.07/0.87
% 2.07/0.87 % -------------------------------------------------
% 2.07/0.87 % User time : 1.439 s
% 2.07/0.87 % System time : 0.078 s
% 2.07/0.87 % Total time : 1.517 s
% 2.07/0.87 % Maximum resident set size: 4608 pages
% 2.07/0.87 % E exiting
%------------------------------------------------------------------------------