%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP658+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 : n012.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 : Theorem 0.12s 0.43s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 6
% Syntax : Number of formulae : 43 ( 39 unt; 0 def)
% Number of atoms : 47 ( 46 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 10 ( 6 ~; 2 |; 2 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 0 con; 1-2 aty)
% Number of variables : 100 ( 0 sgn 25 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f04,axiom,
! [X1,X2] : rd(mult(X2,X1),X1) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f04) ).
fof(f05,axiom,
! [X3,X1,X2] : mult(mult(X2,mult(X1,X1)),X3) = mult(mult(X2,X1),mult(X1,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).
fof(f01,axiom,
! [X1,X2] : mult(X2,ld(X2,X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f01) ).
fof(f02,axiom,
! [X1,X2] : ld(X2,mult(X2,X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).
fof(f03,axiom,
! [X1,X2] : mult(rd(X2,X1),X1) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f03) ).
fof(goals,conjecture,
? [X4] :
! [X5] :
( mult(X4,X5) = X5
& mult(X5,X4) = X5 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(c_0_6,plain,
! [X12,X13] : rd(mult(X13,X12),X12) = X13,
inference(variable_rename,[status(thm)],[f04]) ).
fof(c_0_7,plain,
! [X14,X15,X16] : mult(mult(X16,mult(X15,X15)),X14) = mult(mult(X16,X15),mult(X15,X14)),
inference(variable_rename,[status(thm)],[f05]) ).
cnf(c_0_8,plain,
rd(mult(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
mult(mult(X1,mult(X2,X2)),X3) = mult(mult(X1,X2),mult(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,plain,
! [X6,X7] : mult(X7,ld(X7,X6)) = X6,
inference(variable_rename,[status(thm)],[f01]) ).
fof(c_0_11,plain,
! [X8,X9] : ld(X9,mult(X9,X8)) = X8,
inference(variable_rename,[status(thm)],[f02]) ).
fof(c_0_12,plain,
! [X10,X11] : mult(rd(X11,X10),X10) = X11,
inference(variable_rename,[status(thm)],[f03]) ).
cnf(c_0_13,plain,
rd(mult(mult(X1,X2),mult(X2,X3)),X3) = mult(X1,mult(X2,X2)),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,plain,
mult(X1,ld(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
ld(X1,mult(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
mult(rd(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
rd(mult(mult(X1,X2),X3),ld(X2,X3)) = mult(X1,mult(X2,X2)),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
ld(rd(X1,X2),X1) = X2,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
rd(X1,ld(X2,ld(mult(X3,X2),X1))) = mult(X3,mult(X2,X2)),
inference(spm,[status(thm)],[c_0_17,c_0_14]) ).
cnf(c_0_20,plain,
ld(X1,ld(mult(X2,X1),X3)) = ld(mult(X2,mult(X1,X1)),X3),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,plain,
ld(mult(rd(X1,X2),mult(X2,X2)),X3) = ld(X2,ld(X1,X3)),
inference(spm,[status(thm)],[c_0_20,c_0_16]) ).
cnf(c_0_22,plain,
mult(X1,mult(rd(X2,X3),rd(X2,X3))) = rd(mult(mult(X1,rd(X2,X3)),X2),X3),
inference(spm,[status(thm)],[c_0_13,c_0_16]) ).
cnf(c_0_23,plain,
ld(rd(X1,X2),ld(X3,X4)) = ld(rd(mult(X3,X1),X2),X4),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_16]) ).
cnf(c_0_24,plain,
ld(rd(mult(rd(X1,X2),X3),X4),X1) = ld(rd(X3,X4),X2),
inference(spm,[status(thm)],[c_0_23,c_0_18]) ).
cnf(c_0_25,plain,
ld(rd(X1,X1),X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_8]),c_0_18]) ).
cnf(c_0_26,plain,
rd(X1,ld(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_8,c_0_14]) ).
cnf(c_0_27,plain,
ld(rd(X1,mult(rd(X2,X3),X1)),X3) = X2,
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,plain,
rd(X1,mult(rd(X2,X3),X1)) = rd(X3,X2),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,plain,
mult(X1,ld(mult(X2,mult(X1,X1)),X3)) = ld(mult(X2,X1),X3),
inference(spm,[status(thm)],[c_0_14,c_0_20]) ).
cnf(c_0_30,plain,
ld(rd(X1,X2),X3) = mult(rd(X2,X1),X3),
inference(spm,[status(thm)],[c_0_18,c_0_28]) ).
fof(c_0_31,negated_conjecture,
~ ? [X4] :
! [X5] :
( mult(X4,X5) = X5
& mult(X5,X4) = X5 ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_32,plain,
ld(mult(rd(X1,mult(X2,X2)),X2),X3) = mult(X2,ld(X1,X3)),
inference(spm,[status(thm)],[c_0_29,c_0_16]) ).
cnf(c_0_33,plain,
mult(rd(X1,mult(X2,X1)),X3) = ld(X2,X3),
inference(spm,[status(thm)],[c_0_30,c_0_8]) ).
fof(c_0_34,negated_conjecture,
! [X17] :
( mult(X17,esk2_1(X17)) != esk2_1(X17)
| mult(esk1_1(X17),X17) != esk1_1(X17) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_31])])])])]) ).
cnf(c_0_35,plain,
mult(rd(X1,X1),X2) = X2,
inference(spm,[status(thm)],[c_0_15,c_0_25]) ).
cnf(c_0_36,plain,
ld(ld(X1,X1),X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_14]) ).
cnf(c_0_37,negated_conjecture,
( mult(X1,esk2_1(X1)) != esk2_1(X1)
| mult(esk1_1(X1),X1) != esk1_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_38,plain,
mult(X1,ld(mult(X1,X1),X2)) = ld(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_35]),c_0_35]) ).
cnf(c_0_39,plain,
rd(X1,X1) = ld(X2,X2),
inference(spm,[status(thm)],[c_0_26,c_0_36]) ).
cnf(c_0_40,negated_conjecture,
mult(esk1_1(rd(X1,X1)),rd(X1,X1)) != esk1_1(rd(X1,X1)),
inference(spm,[status(thm)],[c_0_37,c_0_35]) ).
cnf(c_0_41,plain,
mult(X1,rd(X2,X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_15]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP658+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.35 % Computer : n012.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Sun Sep 20 20:29:38 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.40 Running first-order theorem proving
% 0.12/0.40 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.12/0.43 % Version: 3.5.1
% 0.12/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.43 % Starting sh5l with 300s (1) cores
% 0.12/0.43 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 812640 completed with status 0
% 0.12/0.43 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.12/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.43 % No SInE strategy applied
% 0.12/0.43 % Search class: FUHPM-FFSF21-MFFFFFNN
% 0.12/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.12/0.43 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.12/0.43 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 136s (1) cores
% 0.12/0.43 % Starting new_bool_3 with 136s (1) cores
% 0.12/0.43 % H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with pid 812649 completed with status 0
% 0.12/0.43 % Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S
% 0.12/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.43 % No SInE strategy applied
% 0.12/0.43 % Search class: FUHPM-FFSF21-MFFFFFNN
% 0.12/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.12/0.43 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.12/0.43 % Preprocessing time : 0.001 s
% 0.12/0.43 % Presaturation interreduction done
% 0.12/0.43
% 0.12/0.43 % Proof found!
% 0.12/0.43 % SZS status Theorem
% 0.12/0.43 % SZS output start CNFRefutation
% See solution above
% 0.12/0.43 % Parsed axioms : 6
% 0.12/0.43 % Removed by relevancy pruning/SinE : 0
% 0.12/0.43 % Initial clauses : 6
% 0.12/0.43 % Removed in clause preprocessing : 0
% 0.12/0.43 % Initial clauses in saturation : 6
% 0.12/0.43 % Processed clauses : 121
% 0.12/0.43 % ...of these trivial : 18
% 0.12/0.43 % ...subsumed : 43
% 0.12/0.43 % ...remaining for further processing : 60
% 0.12/0.43 % Other redundant clauses eliminated : 0
% 0.12/0.43 % Clauses deleted for lack of memory : 0
% 0.12/0.43 % Backward-subsumed : 0
% 0.12/0.43 % Backward-rewritten : 10
% 0.12/0.43 % Generated clauses : 905
% 0.12/0.43 % ...of the previous two non-redundant : 697
% 0.12/0.43 % ...aggressively subsumed : 0
% 0.12/0.43 % Contextual simplify-reflections : 0
% 0.12/0.43 % Paramodulations : 905
% 0.12/0.43 % Factorizations : 0
% 0.12/0.43 % NegExts : 0
% 0.12/0.43 % Equation resolutions : 0
% 0.12/0.43 % Disequality decompositions : 0
% 0.12/0.43 % Total rewrite steps : 1111
% 0.12/0.43 % ...of those cached : 745
% 0.12/0.43 % Propositional unsat checks : 0
% 0.12/0.43 % Propositional check models : 0
% 0.12/0.43 % Propositional check unsatisfiable : 0
% 0.12/0.43 % Propositional clauses : 0
% 0.12/0.43 % Propositional clauses after purity: 0
% 0.12/0.43 % Propositional unsat core size : 0
% 0.12/0.43 % Propositional preprocessing time : 0.000
% 0.12/0.43 % Propositional encoding time : 0.000
% 0.12/0.43 % Propositional solver time : 0.000
% 0.12/0.43 % Success case prop preproc time : 0.000
% 0.12/0.43 % Success case prop encoding time : 0.000
% 0.12/0.43 % Success case prop solver time : 0.000
% 0.12/0.43 % Current number of processed clauses : 44
% 0.12/0.43 % Positive orientable unit clauses : 29
% 0.12/0.43 % Positive unorientable unit clauses: 2
% 0.12/0.43 % Negative unit clauses : 0
% 0.12/0.43 % Non-unit-clauses : 13
% 0.12/0.43 % Current number of unprocessed clauses: 585
% 0.12/0.43 % ...number of literals in the above : 711
% 0.12/0.43 % Current number of archived formulas : 0
% 0.12/0.43 % Current number of archived clauses : 16
% 0.12/0.43 % Clause-clause subsumption calls (NU) : 182
% 0.12/0.43 % Rec. Clause-clause subsumption calls : 154
% 0.12/0.43 % Non-unit clause-clause subsumptions : 20
% 0.12/0.43 % Unit Clause-clause subsumption calls : 18
% 0.12/0.43 % Rewrite failures with RHS unbound : 21
% 0.12/0.43 % BW rewrite match attempts : 107
% 0.12/0.43 % BW rewrite match successes : 17
% 0.12/0.43 % Condensation attempts : 0
% 0.12/0.43 % Condensation successes : 0
% 0.12/0.43 % Termbank termtop insertions : 12532
% 0.12/0.43 % Search garbage collected termcells : 30
% 0.12/0.43
% 0.12/0.43 % -------------------------------------------------
% 0.12/0.43 % User time : 0.014 s
% 0.12/0.43 % System time : 0.002 s
% 0.12/0.43 % Total time : 0.016 s
% 0.12/0.43 % Maximum resident set size: 3376 pages
% 0.12/0.43
% 0.12/0.43 % -------------------------------------------------
% 0.12/0.43 % User time : 0.055 s
% 0.12/0.43 % System time : 0.013 s
% 0.12/0.43 % Total time : 0.069 s
% 0.12/0.43 % Maximum resident set size: 4608 pages
% 0.12/0.43 % E exiting
%------------------------------------------------------------------------------