%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP756-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 : n016.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.13s 0.54s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of clauses : 31 ( 31 unt; 0 nHn; 4 RR)
% Number of literals : 31 ( 30 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 69 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(f05,axiom,
mult(X1,mult(mult(X2,X2),X3)) = mult(mult(X1,X2),mult(X2,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).
cnf(f03,axiom,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f03) ).
cnf(f02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).
cnf(f04,axiom,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f04) ).
cnf(f01,axiom,
mult(X1,ld(X1,X2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f01) ).
cnf(goals,negated_conjecture,
mult(mult(a,b),c) != mult(a,mult(b,c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(c_0_6,axiom,
mult(X1,mult(mult(X2,X2),X3)) = mult(mult(X1,X2),mult(X2,X3)),
f05 ).
cnf(c_0_7,axiom,
mult(rd(X1,X2),X2) = X1,
f03 ).
cnf(c_0_8,axiom,
ld(X1,mult(X1,X2)) = X2,
f02 ).
cnf(c_0_9,plain,
mult(rd(X1,X2),mult(mult(X2,X2),X3)) = mult(X1,mult(X2,X3)),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,axiom,
rd(mult(X1,X2),X2) = X1,
f04 ).
cnf(c_0_11,axiom,
mult(X1,ld(X1,X2)) = X2,
f01 ).
cnf(c_0_12,plain,
ld(rd(X1,X2),mult(X1,mult(X2,X3))) = mult(mult(X2,X2),X3),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
rd(X1,ld(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
mult(X1,mult(mult(X2,X2),ld(X2,X3))) = mult(mult(X1,X2),X3),
inference(spm,[status(thm)],[c_0_6,c_0_11]) ).
cnf(c_0_15,plain,
mult(mult(ld(X1,X2),ld(X1,X2)),X3) = ld(X1,mult(X2,mult(ld(X1,X2),X3))),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
mult(mult(X1,ld(X2,X3)),X4) = mult(X1,ld(X2,mult(X3,X4))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_11]) ).
cnf(c_0_17,plain,
rd(mult(X1,ld(X2,mult(X3,X4))),X4) = mult(X1,ld(X2,X3)),
inference(spm,[status(thm)],[c_0_10,c_0_16]) ).
cnf(c_0_18,plain,
ld(mult(X1,X2),mult(X1,mult(mult(X2,X2),X3))) = mult(X2,X3),
inference(spm,[status(thm)],[c_0_8,c_0_6]) ).
cnf(c_0_19,plain,
rd(mult(X1,mult(X2,X3)),mult(mult(X2,X2),X3)) = rd(X1,X2),
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_20,plain,
mult(X1,mult(X2,ld(mult(X2,X2),X3))) = mult(rd(X1,X2),X3),
inference(spm,[status(thm)],[c_0_9,c_0_11]) ).
cnf(c_0_21,plain,
mult(X1,ld(mult(X2,X3),X2)) = rd(X1,X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_22,plain,
mult(X1,rd(X2,X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_7]) ).
cnf(c_0_23,plain,
ld(X1,X1) = rd(X2,X2),
inference(spm,[status(thm)],[c_0_8,c_0_22]) ).
cnf(c_0_24,plain,
ld(rd(X1,X2),X1) = X2,
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_25,plain,
rd(X1,X1) = rd(X2,X2),
inference(spm,[status(thm)],[c_0_23,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
mult(mult(a,b),c) != mult(a,mult(b,c)),
inference(fof_simplification,[status(thm)],[goals]) ).
cnf(c_0_27,plain,
ld(rd(X1,X1),X2) = X2,
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
mult(mult(a,b),c) != mult(a,mult(b,c)),
c_0_26 ).
cnf(c_0_29,plain,
mult(mult(X1,X2),X3) = mult(X1,mult(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_27]),c_0_27]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP756-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.36 % Computer : n016.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Sun Sep 20 20:42:39 UTC 2026
% 0.08/0.37 % CPUTime :
% 0.08/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
% 0.13/0.54 % Version: 3.5.1
% 0.13/0.54 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.54 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.54 % Starting sh5l with 300s (1) cores
% 0.13/0.54 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 770857 completed with status 0
% 0.13/0.54 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.13/0.54 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.54 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/0.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.54 % No SInE strategy applied
% 0.13/0.54 % Search class: FUUPM-FFSF22-MFFFFFNN
% 0.13/0.54 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.54 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.54 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.13/0.54 % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.13/0.54 % Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.13/0.54 % Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.13/0.54 % U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 770868 completed with status 0
% 0.13/0.54 % Result found by U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.54 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.54 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/0.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.54 % No SInE strategy applied
% 0.13/0.54 % Search class: FUUPM-FFSF22-MFFFFFNN
% 0.13/0.54 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.54 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.54 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.13/0.54 % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.13/0.54 % Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.13/0.54 % Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.13/0.54 % Preprocessing time : 0.002 s
% 0.13/0.54 % Presaturation interreduction done
% 0.13/0.54
% 0.13/0.54 % Proof found!
% 0.13/0.54 % SZS status Unsatisfiable
% 0.13/0.54 % SZS output start CNFRefutation
% See solution above
% 0.13/0.54 % Parsed axioms : 6
% 0.13/0.54 % Removed by relevancy pruning/SinE : 0
% 0.13/0.54 % Initial clauses : 6
% 0.13/0.54 % Removed in clause preprocessing : 0
% 0.13/0.54 % Initial clauses in saturation : 6
% 0.13/0.54 % Processed clauses : 85
% 0.13/0.54 % ...of these trivial : 21
% 0.13/0.54 % ...subsumed : 17
% 0.13/0.54 % ...remaining for further processing : 47
% 0.13/0.54 % Other redundant clauses eliminated : 0
% 0.13/0.54 % Clauses deleted for lack of memory : 0
% 0.13/0.54 % Backward-subsumed : 1
% 0.13/0.54 % Backward-rewritten : 18
% 0.13/0.54 % Generated clauses : 878
% 0.13/0.54 % ...of the previous two non-redundant : 645
% 0.13/0.54 % ...aggressively subsumed : 0
% 0.13/0.54 % Contextual simplify-reflections : 0
% 0.13/0.54 % Paramodulations : 878
% 0.13/0.54 % Factorizations : 0
% 0.13/0.54 % NegExts : 0
% 0.13/0.54 % Equation resolutions : 0
% 0.13/0.54 % Disequality decompositions : 0
% 0.13/0.54 % Total rewrite steps : 846
% 0.13/0.54 % ...of those cached : 558
% 0.13/0.54 % Propositional unsat checks : 0
% 0.13/0.54 % Propositional check models : 0
% 0.13/0.54 % Propositional check unsatisfiable : 0
% 0.13/0.54 % Propositional clauses : 0
% 0.13/0.54 % Propositional clauses after purity: 0
% 0.13/0.54 % Propositional unsat core size : 0
% 0.13/0.54 % Propositional preprocessing time : 0.000
% 0.13/0.54 % Propositional encoding time : 0.000
% 0.13/0.54 % Propositional solver time : 0.000
% 0.13/0.54 % Success case prop preproc time : 0.000
% 0.13/0.54 % Success case prop encoding time : 0.000
% 0.13/0.54 % Success case prop solver time : 0.000
% 0.13/0.54 % Current number of processed clauses : 22
% 0.13/0.54 % Positive orientable unit clauses : 20
% 0.13/0.54 % Positive unorientable unit clauses: 2
% 0.13/0.54 % Negative unit clauses : 0
% 0.13/0.54 % Non-unit-clauses : 0
% 0.13/0.54 % Current number of unprocessed clauses: 561
% 0.13/0.54 % ...number of literals in the above : 561
% 0.13/0.54 % Current number of archived formulas : 0
% 0.13/0.54 % Current number of archived clauses : 25
% 0.13/0.54 % Clause-clause subsumption calls (NU) : 0
% 0.13/0.54 % Rec. Clause-clause subsumption calls : 0
% 0.13/0.54 % Non-unit clause-clause subsumptions : 0
% 0.13/0.54 % Unit Clause-clause subsumption calls : 18
% 0.13/0.54 % Rewrite failures with RHS unbound : 0
% 0.13/0.54 % BW rewrite match attempts : 149
% 0.13/0.54 % BW rewrite match successes : 24
% 0.13/0.54 % Condensation attempts : 0
% 0.13/0.54 % Condensation successes : 0
% 0.13/0.54 % Termbank termtop insertions : 8972
% 0.13/0.54 % Search garbage collected termcells : 2
% 0.13/0.54
% 0.13/0.54 % -------------------------------------------------
% 0.13/0.54 % User time : 0.019 s
% 0.13/0.54 % System time : 0.007 s
% 0.13/0.54 % Total time : 0.027 s
% 0.13/0.54 % Maximum resident set size: 3376 pages
% 0.13/0.54
% 0.13/0.54 % -------------------------------------------------
% 0.13/0.54 % User time : 0.146 s
% 0.13/0.54 % System time : 0.026 s
% 0.13/0.54 % Total time : 0.173 s
% 0.13/0.54 % Maximum resident set size: 4864 pages
% 0.13/0.54 % E exiting
%------------------------------------------------------------------------------