%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP659-10 : TPTP v9.3.1. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n020.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:38 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.44s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 6
% Syntax : Number of clauses : 45 ( 45 unt; 0 nHn; 5 RR)
% Number of literals : 45 ( 44 equ; 4 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; 0 con; 1-2 aty)
% Number of variables : 86 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(f04,axiom,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f04) ).
cnf(f05,axiom,
mult(mult(X1,mult(X2,X3)),X2) = mult(mult(X1,X2),mult(X3,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f05) ).
cnf(f03,axiom,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f03) ).
cnf(f02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f02) ).
cnf(f01,axiom,
mult(X1,ld(X1,X2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f01) ).
cnf(goal,negated_conjecture,
tuple(mult(X1,x1(X1)),mult(x1_2(X1),X1)) != tuple(x1(X1),x1_2(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).
cnf(c_0_6,axiom,
rd(mult(X1,X2),X2) = X1,
f04 ).
cnf(c_0_7,axiom,
mult(mult(X1,mult(X2,X3)),X2) = mult(mult(X1,X2),mult(X3,X2)),
f05 ).
cnf(c_0_8,plain,
rd(mult(mult(X1,X2),mult(X3,X2)),X2) = mult(X1,mult(X2,X3)),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,axiom,
mult(rd(X1,X2),X2) = X1,
f03 ).
cnf(c_0_10,plain,
rd(mult(mult(X1,X2),X3),X2) = mult(X1,mult(X2,rd(X3,X2))),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,plain,
rd(mult(X1,X2),X3) = mult(rd(X1,X3),mult(X3,rd(X2,X3))),
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_12,axiom,
ld(X1,mult(X1,X2)) = X2,
f02 ).
cnf(c_0_13,plain,
mult(rd(rd(X1,X2),X3),mult(X3,rd(X2,X3))) = rd(X1,X3),
inference(spm,[status(thm)],[c_0_11,c_0_9]) ).
cnf(c_0_14,axiom,
mult(X1,ld(X1,X2)) = X2,
f01 ).
cnf(c_0_15,plain,
mult(X1,mult(X2,rd(X2,X2))) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_6,c_0_10]) ).
cnf(c_0_16,plain,
ld(rd(rd(X1,X2),X3),rd(X1,X3)) = mult(X3,rd(X2,X3)),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
rd(X1,ld(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_6,c_0_14]) ).
cnf(c_0_18,plain,
mult(X1,rd(X1,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_15]),c_0_12]) ).
cnf(c_0_19,plain,
mult(X1,rd(ld(X2,X3),X1)) = ld(rd(X2,X1),rd(X3,X1)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
rd(X1,X1) = ld(X1,X1),
inference(spm,[status(thm)],[c_0_12,c_0_18]) ).
cnf(c_0_21,plain,
rd(ld(X1,X2),X3) = ld(X3,ld(rd(X1,X3),rd(X2,X3))),
inference(spm,[status(thm)],[c_0_12,c_0_19]) ).
cnf(c_0_22,plain,
ld(ld(X1,ld(rd(X2,X1),rd(X2,X1))),rd(X2,X1)) = mult(X1,rd(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_20]),c_0_21]) ).
cnf(c_0_23,plain,
ld(ld(ld(X1,X2),ld(X1,X1)),X1) = mult(ld(X1,X2),X1),
inference(spm,[status(thm)],[c_0_22,c_0_17]) ).
cnf(c_0_24,plain,
ld(ld(X1,ld(X2,X2)),X2) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_23,c_0_12]) ).
cnf(c_0_25,plain,
mult(ld(X1,X1),X1) = X1,
inference(spm,[status(thm)],[c_0_9,c_0_20]) ).
cnf(c_0_26,plain,
mult(ld(X1,ld(X2,X2)),mult(X1,X2)) = X2,
inference(spm,[status(thm)],[c_0_14,c_0_24]) ).
cnf(c_0_27,plain,
ld(rd(rd(X1,X2),X1),ld(X1,X1)) = mult(X1,rd(X2,X1)),
inference(spm,[status(thm)],[c_0_16,c_0_20]) ).
cnf(c_0_28,plain,
mult(mult(X1,ld(X2,X2)),X2) = mult(mult(X1,X2),ld(X2,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_25]),c_0_14]) ).
cnf(c_0_29,plain,
mult(mult(X1,rd(X2,X1)),rd(X1,X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_9]) ).
cnf(c_0_30,plain,
rd(X1,mult(X2,X1)) = ld(X2,ld(X1,X1)),
inference(spm,[status(thm)],[c_0_17,c_0_24]) ).
cnf(c_0_31,plain,
mult(mult(X1,X1),ld(X1,X1)) = mult(X1,X1),
inference(spm,[status(thm)],[c_0_28,c_0_14]) ).
cnf(c_0_32,plain,
mult(mult(X1,X2),ld(X2,ld(X1,X1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_11]),c_0_20]),c_0_14]),c_0_9]) ).
cnf(c_0_33,plain,
ld(mult(X1,X1),mult(X1,X1)) = ld(X1,X1),
inference(spm,[status(thm)],[c_0_12,c_0_31]) ).
cnf(c_0_34,plain,
ld(mult(X1,X2),X1) = ld(X2,ld(X1,X1)),
inference(spm,[status(thm)],[c_0_12,c_0_32]) ).
cnf(c_0_35,plain,
mult(ld(X1,X1),mult(X1,X1)) = mult(X1,X1),
inference(spm,[status(thm)],[c_0_25,c_0_33]) ).
cnf(c_0_36,plain,
rd(X1,ld(X2,ld(X1,X1))) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_17,c_0_34]) ).
cnf(c_0_37,plain,
ld(ld(X1,X1),ld(X1,X1)) = ld(X1,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_35]),c_0_20]),c_0_33]),c_0_33]) ).
cnf(c_0_38,negated_conjecture,
tuple(mult(X1,x1(X1)),mult(x1_2(X1),X1)) != tuple(x1(X1),x1_2(X1)),
inference(fof_simplification,[status(thm)],[goal]) ).
cnf(c_0_39,plain,
mult(ld(X1,X1),X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_17]) ).
cnf(c_0_40,negated_conjecture,
tuple(mult(X1,x1(X1)),mult(x1_2(X1),X1)) != tuple(x1(X1),x1_2(X1)),
c_0_38 ).
cnf(c_0_41,plain,
ld(ld(X1,X1),X2) = X2,
inference(spm,[status(thm)],[c_0_14,c_0_39]) ).
cnf(c_0_42,negated_conjecture,
tuple(x1(ld(X1,X1)),mult(x1_2(ld(X1,X1)),ld(X1,X1))) != tuple(x1(ld(X1,X1)),x1_2(ld(X1,X1))),
inference(spm,[status(thm)],[c_0_40,c_0_39]) ).
cnf(c_0_43,plain,
mult(X1,ld(X2,X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_41]),c_0_17]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP659-10 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n020.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 : Sun Sep 20 20:30:33 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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
% 0.10/0.44 % Version: 3.5.1
% 0.10/0.44 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.44 % Starting sh5l with 300s (1) cores
% 0.10/0.44 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1177360 completed with status 0
% 0.10/0.44 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.10/0.44 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.44 % No SInE strategy applied
% 0.10/0.44 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.10/0.44 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.10/0.44 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 0.10/0.44 % Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.10/0.44 % Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.10/0.44 % H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with pid 1177368 completed with status 0
% 0.10/0.44 % Result found by H----_047_B31_F1_PI_AE_R4_CS_SP_S2S
% 0.10/0.44 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.44 % No SInE strategy applied
% 0.10/0.44 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.10/0.44 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.10/0.44 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 0.10/0.44 % Preprocessing time : 0.001 s
% 0.10/0.44
% 0.10/0.44 % Proof found!
% 0.10/0.44 % SZS status Unsatisfiable
% 0.10/0.44 % SZS output start CNFRefutation
% See solution above
% 0.10/0.44 % Parsed axioms : 6
% 0.10/0.44 % Removed by relevancy pruning/SinE : 0
% 0.10/0.44 % Initial clauses : 6
% 0.10/0.44 % Removed in clause preprocessing : 0
% 0.10/0.44 % Initial clauses in saturation : 6
% 0.10/0.44 % Processed clauses : 65
% 0.10/0.44 % ...of these trivial : 10
% 0.10/0.44 % ...subsumed : 1
% 0.10/0.44 % ...remaining for further processing : 54
% 0.10/0.44 % Other redundant clauses eliminated : 0
% 0.10/0.44 % Clauses deleted for lack of memory : 0
% 0.10/0.44 % Backward-subsumed : 0
% 0.10/0.44 % Backward-rewritten : 21
% 0.10/0.44 % Generated clauses : 814
% 0.10/0.44 % ...of the previous two non-redundant : 607
% 0.10/0.44 % ...aggressively subsumed : 0
% 0.10/0.44 % Contextual simplify-reflections : 0
% 0.10/0.44 % Paramodulations : 814
% 0.10/0.44 % Factorizations : 0
% 0.10/0.44 % NegExts : 0
% 0.10/0.44 % Equation resolutions : 0
% 0.10/0.44 % Disequality decompositions : 0
% 0.10/0.44 % Total rewrite steps : 927
% 0.10/0.44 % ...of those cached : 632
% 0.10/0.44 % Propositional unsat checks : 0
% 0.10/0.44 % Propositional check models : 0
% 0.10/0.44 % Propositional check unsatisfiable : 0
% 0.10/0.44 % Propositional clauses : 0
% 0.10/0.44 % Propositional clauses after purity: 0
% 0.10/0.44 % Propositional unsat core size : 0
% 0.10/0.44 % Propositional preprocessing time : 0.000
% 0.10/0.44 % Propositional encoding time : 0.000
% 0.10/0.44 % Propositional solver time : 0.000
% 0.10/0.44 % Success case prop preproc time : 0.000
% 0.10/0.44 % Success case prop encoding time : 0.000
% 0.10/0.44 % Success case prop solver time : 0.000
% 0.10/0.44 % Current number of processed clauses : 33
% 0.10/0.44 % Positive orientable unit clauses : 32
% 0.10/0.44 % Positive unorientable unit clauses: 0
% 0.10/0.44 % Negative unit clauses : 1
% 0.10/0.44 % Non-unit-clauses : 0
% 0.10/0.44 % Current number of unprocessed clauses: 533
% 0.10/0.44 % ...number of literals in the above : 533
% 0.10/0.44 % Current number of archived formulas : 0
% 0.10/0.44 % Current number of archived clauses : 21
% 0.10/0.44 % Clause-clause subsumption calls (NU) : 0
% 0.10/0.44 % Rec. Clause-clause subsumption calls : 0
% 0.10/0.44 % Non-unit clause-clause subsumptions : 0
% 0.10/0.44 % Unit Clause-clause subsumption calls : 1
% 0.10/0.44 % Rewrite failures with RHS unbound : 0
% 0.10/0.44 % BW rewrite match attempts : 61
% 0.10/0.44 % BW rewrite match successes : 22
% 0.10/0.44 % Condensation attempts : 0
% 0.10/0.44 % Condensation successes : 0
% 0.10/0.44 % Termbank termtop insertions : 9748
% 0.10/0.44 % Search garbage collected termcells : 2
% 0.10/0.44
% 0.10/0.44 % -------------------------------------------------
% 0.10/0.44 % User time : 0.016 s
% 0.10/0.44 % System time : 0.001 s
% 0.10/0.44 % Total time : 0.018 s
% 0.10/0.44 % Maximum resident set size: 3580 pages
% 0.10/0.44
% 0.10/0.44 % -------------------------------------------------
% 0.10/0.44 % User time : 0.070 s
% 0.10/0.44 % System time : 0.014 s
% 0.10/0.44 % Total time : 0.084 s
% 0.10/0.44 % Maximum resident set size: 4864 pages
% 0.10/0.44 % E exiting
%------------------------------------------------------------------------------