%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP656+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n004.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:37 PM UTC 2026
% Result : Theorem 0.20s 5.67s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 20 unt; 0 def)
% Number of atoms : 28 ( 27 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 : 49 ( 0 sgn 21 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f04,axiom,
! [X1,X2] : rd(mult(X2,X1),X1) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f04) ).
fof(f05,axiom,
! [X3,X1,X2] : mult(mult(X2,X1),mult(X3,X2)) = mult(mult(X2,mult(X1,X3)),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f05) ).
fof(f03,axiom,
! [X1,X2] : mult(rd(X2,X1),X1) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f03) ).
fof(f02,axiom,
! [X1,X2] : ld(X2,mult(X2,X1)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f02) ).
fof(goals,conjecture,
? [X4] :
! [X5] :
( mult(X4,X5) = X5
& mult(X5,X4) = X5 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(c_0_5,plain,
! [X12,X13] : rd(mult(X13,X12),X12) = X13,
inference(variable_rename,[status(thm)],[f04]) ).
fof(c_0_6,plain,
! [X14,X15,X16] : mult(mult(X16,X15),mult(X14,X16)) = mult(mult(X16,mult(X15,X14)),X16),
inference(variable_rename,[status(thm)],[f05]) ).
cnf(c_0_7,plain,
rd(mult(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
mult(mult(X1,X2),mult(X3,X1)) = mult(mult(X1,mult(X2,X3)),X1),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_9,plain,
! [X10,X11] : mult(rd(X11,X10),X10) = X11,
inference(variable_rename,[status(thm)],[f03]) ).
fof(c_0_10,plain,
! [X8,X9] : ld(X9,mult(X9,X8)) = X8,
inference(variable_rename,[status(thm)],[f02]) ).
cnf(c_0_11,plain,
rd(mult(mult(X1,X2),mult(X3,X1)),X1) = mult(X1,mult(X2,X3)),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
mult(rd(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
ld(X1,mult(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
mult(X1,mult(X2,rd(X3,X1))) = rd(mult(mult(X1,X2),X3),X1),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
ld(X1,rd(mult(mult(X1,X2),X3),X1)) = mult(X2,rd(X3,X1)),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
fof(c_0_16,negated_conjecture,
~ ? [X4] :
! [X5] :
( mult(X4,X5) = X5
& mult(X5,X4) = X5 ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_17,plain,
mult(X1,rd(X2,X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_7]),c_0_13]) ).
fof(c_0_18,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_16])])])])]) ).
cnf(c_0_19,plain,
ld(X1,X1) = rd(X2,X2),
inference(spm,[status(thm)],[c_0_13,c_0_17]) ).
cnf(c_0_20,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_18]) ).
cnf(c_0_21,plain,
mult(ld(X1,X1),X2) = X2,
inference(spm,[status(thm)],[c_0_12,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
mult(esk1_1(ld(X1,X1)),ld(X1,X1)) != esk1_1(ld(X1,X1)),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_19]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP656+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/5.55 % Computer : n004.cluster.edu
% 0.14/5.55 % Model : x86_64 x86_64
% 0.14/5.55 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/5.55 % Memory : 8046.5625MB
% 0.14/5.55 % OS : Linux 6.8.0-71-generic
% 0.14/5.55 % CPULimit : 300
% 0.14/5.55 % WCLimit : 300
% 0.14/5.55 % DateTime : Sun Sep 20 20:29:42 UTC 2026
% 0.14/5.55 % CPUTime :
% 0.14/5.55 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/5.63 Running first-order theorem proving
% 0.20/5.63 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.20/5.67 % Version: 3.5.1
% 0.20/5.67 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/5.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/5.67 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/5.67 % Starting new_bool_3 with 300s (1) cores
% 0.20/5.67 % Starting new_bool_1 with 300s (1) cores
% 0.20/5.67 % Starting sh5l with 300s (1) cores
% 0.20/5.67 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1436517 completed with status 0
% 0.20/5.67 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.20/5.67 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/5.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/5.67 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/5.67 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.20/5.67 % No SInE strategy applied
% 0.20/5.67 % Search class: FUHPM-FFSF21-MFFFFFNN
% 0.20/5.67 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/5.67 % Starting SubtermCWHack with 136s (1) cores
% 0.20/5.67 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.20/5.67 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.20/5.67 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 136s (1) cores
% 0.20/5.67 % Starting new_bool_3 with 136s (1) cores
% 0.20/5.67 % H----_047_C09_12_F1_AE_ND_CS_SP_S2S with pid 1436526 completed with status 0
% 0.20/5.67 % Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S2S
% 0.20/5.67 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/5.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/5.67 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/5.67 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.20/5.67 % No SInE strategy applied
% 0.20/5.67 % Search class: FUHPM-FFSF21-MFFFFFNN
% 0.20/5.67 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/5.67 % Starting SubtermCWHack with 136s (1) cores
% 0.20/5.67 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.20/5.67 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.20/5.67 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 136s (1) cores
% 0.20/5.67 % Preprocessing time : 0.002 s
% 0.20/5.67 % Presaturation interreduction done
% 0.20/5.67
% 0.20/5.67 % Proof found!
% 0.20/5.67 % SZS status Theorem
% 0.20/5.67 % SZS output start CNFRefutation
% See solution above
% 0.20/5.67 % Parsed axioms : 6
% 0.20/5.67 % Removed by relevancy pruning/SinE : 0
% 0.20/5.67 % Initial clauses : 6
% 0.20/5.67 % Removed in clause preprocessing : 0
% 0.20/5.67 % Initial clauses in saturation : 6
% 0.20/5.67 % Processed clauses : 28
% 0.20/5.67 % ...of these trivial : 1
% 0.20/5.67 % ...subsumed : 0
% 0.20/5.67 % ...remaining for further processing : 27
% 0.20/5.67 % Other redundant clauses eliminated : 0
% 0.20/5.67 % Clauses deleted for lack of memory : 0
% 0.20/5.67 % Backward-subsumed : 0
% 0.20/5.67 % Backward-rewritten : 3
% 0.20/5.67 % Generated clauses : 197
% 0.20/5.67 % ...of the previous two non-redundant : 165
% 0.20/5.67 % ...aggressively subsumed : 0
% 0.20/5.67 % Contextual simplify-reflections : 0
% 0.20/5.67 % Paramodulations : 197
% 0.20/5.67 % Factorizations : 0
% 0.20/5.67 % NegExts : 0
% 0.20/5.67 % Equation resolutions : 0
% 0.20/5.67 % Disequality decompositions : 0
% 0.20/5.67 % Total rewrite steps : 83
% 0.20/5.67 % ...of those cached : 40
% 0.20/5.67 % Propositional unsat checks : 0
% 0.20/5.67 % Propositional check models : 0
% 0.20/5.67 % Propositional check unsatisfiable : 0
% 0.20/5.67 % Propositional clauses : 0
% 0.20/5.67 % Propositional clauses after purity: 0
% 0.20/5.67 % Propositional unsat core size : 0
% 0.20/5.67 % Propositional preprocessing time : 0.000
% 0.20/5.67 % Propositional encoding time : 0.000
% 0.20/5.67 % Propositional solver time : 0.000
% 0.20/5.67 % Success case prop preproc time : 0.000
% 0.20/5.67 % Success case prop encoding time : 0.000
% 0.20/5.67 % Success case prop solver time : 0.000
% 0.20/5.67 % Current number of processed clauses : 18
% 0.20/5.67 % Positive orientable unit clauses : 15
% 0.20/5.67 % Positive unorientable unit clauses: 1
% 0.20/5.67 % Negative unit clauses : 1
% 0.20/5.67 % Non-unit-clauses : 1
% 0.20/5.67 % Current number of unprocessed clauses: 145
% 0.20/5.67 % ...number of literals in the above : 145
% 0.20/5.67 % Current number of archived formulas : 0
% 0.20/5.67 % Current number of archived clauses : 9
% 0.20/5.67 % Clause-clause subsumption calls (NU) : 0
% 0.20/5.67 % Rec. Clause-clause subsumption calls : 0
% 0.20/5.67 % Non-unit clause-clause subsumptions : 0
% 0.20/5.67 % Unit Clause-clause subsumption calls : 5
% 0.20/5.67 % Rewrite failures with RHS unbound : 5
% 0.20/5.67 % BW rewrite match attempts : 24
% 0.20/5.67 % BW rewrite match successes : 4
% 0.20/5.67 % Condensation attempts : 0
% 0.20/5.67 % Condensation successes : 0
% 0.20/5.67 % Termbank termtop insertions : 2053
% 0.20/5.67 % Search garbage collected termcells : 30
% 0.20/5.67
% 0.20/5.67 % -------------------------------------------------
% 0.20/5.67 % User time : 0.006 s
% 0.20/5.67 % System time : 0.007 s
% 0.20/5.67 % Total time : 0.014 s
% 0.20/5.67 % Maximum resident set size: 3632 pages
% 0.20/5.67
% 0.20/5.67 % -------------------------------------------------
% 0.20/5.67 % User time : 0.036 s
% 0.20/5.67 % System time : 0.018 s
% 0.20/5.67 % Total time : 0.055 s
% 0.20/5.67 % Maximum resident set size: 4608 pages
% 0.20/5.67 % E exiting
%------------------------------------------------------------------------------