%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP682-10 : TPTP v9.3.1. Released v8.1.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:44:43 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.49s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of clauses : 17 ( 17 unt; 0 nHn; 6 RR)
% Number of literals : 17 ( 16 equ; 5 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 29 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(goal,negated_conjecture,
ld(ld(x0,x1),mult(ld(x0,x1),x2)) != ld(x0,mult(x0,x2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
cnf(f05,axiom,
ld(ld(X1,X2),mult(ld(X1,X2),mult(X3,X4))) = mult(ld(X1,mult(X1,X3)),X4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).
cnf(f03,axiom,
mult(X1,ld(X1,X2)) = ld(X1,mult(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f03) ).
cnf(f01,axiom,
ld(X1,mult(X1,X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f01) ).
cnf(c_0_4,negated_conjecture,
ld(ld(x0,x1),mult(ld(x0,x1),x2)) != ld(x0,mult(x0,x2)),
inference(fof_simplification,[status(thm)],[goal]) ).
cnf(c_0_5,axiom,
ld(ld(X1,X2),mult(ld(X1,X2),mult(X3,X4))) = mult(ld(X1,mult(X1,X3)),X4),
f05 ).
cnf(c_0_6,axiom,
mult(X1,ld(X1,X2)) = ld(X1,mult(X1,X2)),
f03 ).
cnf(c_0_7,axiom,
ld(X1,mult(X1,X1)) = X1,
f01 ).
cnf(c_0_8,negated_conjecture,
ld(ld(x0,x1),mult(ld(x0,x1),x2)) != ld(x0,mult(x0,x2)),
c_0_4 ).
cnf(c_0_9,plain,
mult(ld(X1,X2),ld(ld(X1,X2),mult(X3,X4))) = mult(mult(X1,ld(X1,X3)),X4),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6]),c_0_6]) ).
cnf(c_0_10,plain,
mult(X1,ld(X1,X1)) = X1,
inference(rw,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_11,negated_conjecture,
mult(ld(x0,x1),ld(ld(x0,x1),x2)) != mult(x0,ld(x0,x2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_6]),c_0_6]) ).
cnf(c_0_12,plain,
mult(ld(X1,X2),ld(ld(X1,X2),X3)) = mult(mult(X1,ld(X1,X3)),ld(X3,X3)),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
mult(mult(X1,ld(X1,X2)),ld(mult(X1,ld(X1,X2)),mult(X3,X4))) = mult(mult(X1,ld(X1,X3)),X4),
inference(spm,[status(thm)],[c_0_9,c_0_6]) ).
cnf(c_0_14,negated_conjecture,
mult(mult(x0,ld(x0,x2)),ld(x2,x2)) != mult(x0,ld(x0,x2)),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
mult(mult(X1,ld(X1,X2)),X3) = mult(X1,ld(X1,mult(X2,X3))),
inference(spm,[status(thm)],[c_0_13,c_0_10]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP682-10 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.37 % Computer : n014.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Sun Sep 20 20:32:49 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.43 Running first-order theorem proving
% 0.14/0.43 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.14/0.49 % Version: 3.5.1
% 0.14/0.49 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.49 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.49 % Starting sh5l with 300s (1) cores
% 0.14/0.49 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 2309245 completed with status 0
% 0.14/0.49 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.14/0.49 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.49 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.49 % No SInE strategy applied
% 0.14/0.49 % Search class: FUUPM-FFSF22-MFFFFFNN
% 0.14/0.49 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.49 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.14/0.49 % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.14/0.49 % Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.14/0.49 % Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.14/0.49 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 2309250 completed with status 0
% 0.14/0.49 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.14/0.49 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.49 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.49 % No SInE strategy applied
% 0.14/0.49 % Search class: FUUPM-FFSF22-MFFFFFNN
% 0.14/0.49 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.49 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.14/0.49 % Preprocessing time : 0.004 s
% 0.14/0.49
% 0.14/0.49 % Proof found!
% 0.14/0.49 % SZS status Unsatisfiable
% 0.14/0.49 % SZS output start CNFRefutation
% See solution above
% 0.14/0.49 % Parsed axioms : 8
% 0.14/0.49 % Removed by relevancy pruning/SinE : 0
% 0.14/0.49 % Initial clauses : 8
% 0.14/0.49 % Removed in clause preprocessing : 0
% 0.14/0.49 % Initial clauses in saturation : 8
% 0.14/0.49 % Processed clauses : 69
% 0.14/0.49 % ...of these trivial : 11
% 0.14/0.49 % ...subsumed : 5
% 0.14/0.49 % ...remaining for further processing : 53
% 0.14/0.49 % Other redundant clauses eliminated : 0
% 0.14/0.49 % Clauses deleted for lack of memory : 0
% 0.14/0.49 % Backward-subsumed : 0
% 0.14/0.49 % Backward-rewritten : 28
% 0.14/0.49 % Generated clauses : 992
% 0.14/0.49 % ...of the previous two non-redundant : 819
% 0.14/0.49 % ...aggressively subsumed : 0
% 0.14/0.49 % Contextual simplify-reflections : 0
% 0.14/0.49 % Paramodulations : 992
% 0.14/0.49 % Factorizations : 0
% 0.14/0.49 % NegExts : 0
% 0.14/0.49 % Equation resolutions : 0
% 0.14/0.49 % Disequality decompositions : 0
% 0.14/0.49 % Total rewrite steps : 924
% 0.14/0.49 % ...of those cached : 629
% 0.14/0.49 % Propositional unsat checks : 0
% 0.14/0.49 % Propositional check models : 0
% 0.14/0.49 % Propositional check unsatisfiable : 0
% 0.14/0.49 % Propositional clauses : 0
% 0.14/0.49 % Propositional clauses after purity: 0
% 0.14/0.49 % Propositional unsat core size : 0
% 0.14/0.49 % Propositional preprocessing time : 0.000
% 0.14/0.49 % Propositional encoding time : 0.000
% 0.14/0.49 % Propositional solver time : 0.000
% 0.14/0.49 % Success case prop preproc time : 0.000
% 0.14/0.49 % Success case prop encoding time : 0.000
% 0.14/0.49 % Success case prop solver time : 0.000
% 0.14/0.49 % Current number of processed clauses : 25
% 0.14/0.49 % Positive orientable unit clauses : 24
% 0.14/0.49 % Positive unorientable unit clauses: 1
% 0.14/0.49 % Negative unit clauses : 0
% 0.14/0.49 % Non-unit-clauses : 0
% 0.14/0.49 % Current number of unprocessed clauses: 733
% 0.14/0.49 % ...number of literals in the above : 733
% 0.14/0.49 % Current number of archived formulas : 0
% 0.14/0.49 % Current number of archived clauses : 28
% 0.14/0.49 % Clause-clause subsumption calls (NU) : 0
% 0.14/0.49 % Rec. Clause-clause subsumption calls : 0
% 0.14/0.49 % Non-unit clause-clause subsumptions : 0
% 0.14/0.49 % Unit Clause-clause subsumption calls : 8
% 0.14/0.49 % Rewrite failures with RHS unbound : 0
% 0.14/0.49 % BW rewrite match attempts : 130
% 0.14/0.49 % BW rewrite match successes : 48
% 0.14/0.49 % Condensation attempts : 0
% 0.14/0.49 % Condensation successes : 0
% 0.14/0.49 % Termbank termtop insertions : 14584
% 0.14/0.49 % Search garbage collected termcells : 2
% 0.14/0.49
% 0.14/0.49 % -------------------------------------------------
% 0.14/0.49 % User time : 0.035 s
% 0.14/0.49 % System time : 0.005 s
% 0.14/0.49 % Total time : 0.040 s
% 0.14/0.49 % Maximum resident set size: 3632 pages
% 0.14/0.49
% 0.14/0.49 % -------------------------------------------------
% 0.14/0.49 % User time : 0.154 s
% 0.14/0.49 % System time : 0.026 s
% 0.14/0.49 % Total time : 0.180 s
% 0.14/0.49 % Maximum resident set size: 4864 pages
% 0.14/0.49 % E exiting
%------------------------------------------------------------------------------