%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP710+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 : n011.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:01 PM UTC 2026
% Result : Theorem 0.15s 0.44s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 35 ( 29 unt; 0 def)
% Number of atoms : 41 ( 40 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 16 ( 10 ~; 4 |; 2 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 64 ( 7 sgn 24 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f01,axiom,
! [X1] : mult(X1,unit) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f01) ).
fof(f03,axiom,
! [X2,X3,X1] : mult(X1,mult(X3,mult(X3,X2))) = mult(mult(mult(X1,X3),X3),X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f03) ).
fof(f05,axiom,
! [X1] : mult(i(X1),X1) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).
fof(f02,axiom,
! [X1] : mult(unit,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).
fof(f04,axiom,
! [X1] : mult(X1,i(X1)) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f04) ).
fof(goals,conjecture,
( ! [X7,X8] :
? [X9] : mult(X9,X8) = X7
& ! [X4,X5] :
? [X6] : mult(X4,X6) = X5 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(c_0_6,plain,
! [X10] : mult(X10,unit) = X10,
inference(variable_rename,[status(thm)],[f01]) ).
fof(c_0_7,plain,
! [X12,X13,X14] : mult(X14,mult(X13,mult(X13,X12))) = mult(mult(mult(X14,X13),X13),X12),
inference(variable_rename,[status(thm)],[f03]) ).
cnf(c_0_8,plain,
mult(X1,unit) = X1,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
mult(X1,mult(X2,mult(X2,X3))) = mult(mult(mult(X1,X2),X2),X3),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
mult(mult(X1,X2),X2) = mult(X1,mult(X2,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_8]) ).
fof(c_0_11,plain,
! [X16] : mult(i(X16),X16) = unit,
inference(variable_rename,[status(thm)],[f05]) ).
fof(c_0_12,plain,
! [X11] : mult(unit,X11) = X11,
inference(variable_rename,[status(thm)],[f02]) ).
cnf(c_0_13,plain,
mult(mult(X1,mult(X2,X2)),X3) = mult(X1,mult(X2,mult(X2,X3))),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
mult(i(X1),X1) = unit,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
mult(unit,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X15] : mult(X15,i(X15)) = unit,
inference(variable_rename,[status(thm)],[f04]) ).
fof(c_0_17,negated_conjecture,
~ ( ! [X7,X8] :
? [X9] : mult(X9,X8) = X7
& ! [X4,X5] :
? [X6] : mult(X4,X6) = X5 ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_18,plain,
mult(i(mult(X1,X1)),mult(X1,mult(X1,X2))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_19,plain,
mult(X1,i(X1)) = unit,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,plain,
mult(i(X1),mult(X1,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_14]),c_0_15]) ).
fof(c_0_21,negated_conjecture,
! [X19,X22] :
( mult(X22,esk4_0) != esk3_0
| mult(esk1_0,X19) != esk2_0 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])])]) ).
cnf(c_0_22,plain,
mult(i(mult(X1,X1)),X1) = i(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_8]) ).
cnf(c_0_23,plain,
i(mult(i(X1),i(X1))) = mult(X1,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_20]),c_0_14]),c_0_8]) ).
cnf(c_0_24,plain,
mult(mult(X1,X1),X2) = mult(X1,mult(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_15]),c_0_15]) ).
cnf(c_0_25,negated_conjecture,
( mult(X2,esk4_0) != esk3_0
| mult(esk1_0,X1) != esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,plain,
mult(i(X1),mult(X1,mult(X1,X2))) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_13,c_0_20]) ).
cnf(c_0_27,plain,
i(i(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_19]),c_0_8]) ).
cnf(c_0_28,negated_conjecture,
( mult(esk1_0,X2) != esk2_0
| mult(X1,mult(esk4_0,esk4_0)) != esk3_0 ),
inference(spm,[status(thm)],[c_0_25,c_0_10]) ).
cnf(c_0_29,plain,
mult(X1,mult(i(X1),mult(X1,X2))) = mult(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_26]),c_0_27]) ).
cnf(c_0_30,negated_conjecture,
( mult(esk1_0,X3) != esk2_0
| mult(X1,mult(X2,mult(X2,mult(esk4_0,esk4_0)))) != esk3_0 ),
inference(spm,[status(thm)],[c_0_28,c_0_13]) ).
cnf(c_0_31,plain,
mult(i(X1),mult(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_29]),c_0_18]) ).
cnf(c_0_32,negated_conjecture,
mult(esk1_0,X1) != esk2_0,
inference(er,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_14]),c_0_8])]) ).
cnf(c_0_33,plain,
mult(X1,mult(i(X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_31,c_0_27]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP710+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n011.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 20 20:34:40 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 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.15/0.44 % Version: 3.5.1
% 0.15/0.44 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 % Starting sh5l with 300s (1) cores
% 0.15/0.44 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 133326 completed with status 0
% 0.15/0.44 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.15/0.44 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.44 % No SInE strategy applied
% 0.15/0.44 % Search class: FUHPM-FFSF21-MFFFFFNN
% 0.15/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.15/0.44 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.15/0.44 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 136s (1) cores
% 0.15/0.44 % Starting new_bool_3 with 136s (1) cores
% 0.15/0.44 % SubtermCWHack with pid 133331 completed with status 0
% 0.15/0.44 % Result found by SubtermCWHack
% 0.15/0.44 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.44 % No SInE strategy applied
% 0.15/0.44 % Search class: FUHPM-FFSF21-MFFFFFNN
% 0.15/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.44 % Preprocessing time : 0.001 s
% 0.15/0.44
% 0.15/0.44 % Proof found!
% 0.15/0.44 % SZS status Theorem
% 0.15/0.44 % SZS output start CNFRefutation
% See solution above
% 0.15/0.44 % Parsed axioms : 6
% 0.15/0.44 % Removed by relevancy pruning/SinE : 0
% 0.15/0.44 % Initial clauses : 6
% 0.15/0.44 % Removed in clause preprocessing : 0
% 0.15/0.44 % Initial clauses in saturation : 6
% 0.15/0.44 % Processed clauses : 89
% 0.15/0.44 % ...of these trivial : 6
% 0.15/0.44 % ...subsumed : 34
% 0.15/0.44 % ...remaining for further processing : 49
% 0.15/0.44 % Other redundant clauses eliminated : 4
% 0.15/0.44 % Clauses deleted for lack of memory : 0
% 0.15/0.44 % Backward-subsumed : 18
% 0.15/0.44 % Backward-rewritten : 9
% 0.15/0.44 % Generated clauses : 529
% 0.15/0.44 % ...of the previous two non-redundant : 335
% 0.15/0.44 % ...aggressively subsumed : 0
% 0.15/0.44 % Contextual simplify-reflections : 0
% 0.15/0.44 % Paramodulations : 525
% 0.15/0.44 % Factorizations : 0
% 0.15/0.44 % NegExts : 0
% 0.15/0.44 % Equation resolutions : 4
% 0.15/0.44 % Disequality decompositions : 0
% 0.15/0.44 % Total rewrite steps : 819
% 0.15/0.44 % ...of those cached : 675
% 0.15/0.44 % Propositional unsat checks : 0
% 0.15/0.44 % Propositional check models : 0
% 0.15/0.44 % Propositional check unsatisfiable : 0
% 0.15/0.44 % Propositional clauses : 0
% 0.15/0.44 % Propositional clauses after purity: 0
% 0.15/0.44 % Propositional unsat core size : 0
% 0.15/0.44 % Propositional preprocessing time : 0.000
% 0.15/0.44 % Propositional encoding time : 0.000
% 0.15/0.44 % Propositional solver time : 0.000
% 0.15/0.44 % Success case prop preproc time : 0.000
% 0.15/0.44 % Success case prop encoding time : 0.000
% 0.15/0.44 % Success case prop solver time : 0.000
% 0.15/0.44 % Current number of processed clauses : 22
% 0.15/0.44 % Positive orientable unit clauses : 19
% 0.15/0.44 % Positive unorientable unit clauses: 0
% 0.15/0.44 % Negative unit clauses : 3
% 0.15/0.44 % Non-unit-clauses : 0
% 0.15/0.44 % Current number of unprocessed clauses: 234
% 0.15/0.44 % ...number of literals in the above : 288
% 0.15/0.44 % Current number of archived formulas : 0
% 0.15/0.44 % Current number of archived clauses : 27
% 0.15/0.44 % Clause-clause subsumption calls (NU) : 219
% 0.15/0.44 % Rec. Clause-clause subsumption calls : 208
% 0.15/0.44 % Non-unit clause-clause subsumptions : 26
% 0.15/0.44 % Unit Clause-clause subsumption calls : 29
% 0.15/0.44 % Rewrite failures with RHS unbound : 0
% 0.15/0.44 % BW rewrite match attempts : 31
% 0.15/0.44 % BW rewrite match successes : 8
% 0.15/0.44 % Condensation attempts : 0
% 0.15/0.44 % Condensation successes : 0
% 0.15/0.44 % Termbank termtop insertions : 5954
% 0.15/0.44 % Search garbage collected termcells : 45
% 0.15/0.44
% 0.15/0.44 % -------------------------------------------------
% 0.15/0.44 % User time : 0.008 s
% 0.15/0.44 % System time : 0.003 s
% 0.15/0.44 % Total time : 0.011 s
% 0.15/0.44 % Maximum resident set size: 3632 pages
% 0.15/0.44
% 0.15/0.44 % -------------------------------------------------
% 0.15/0.44 % User time : 0.040 s
% 0.15/0.44 % System time : 0.015 s
% 0.15/0.44 % Total time : 0.055 s
% 0.15/0.44 % Maximum resident set size: 4864 pages
% 0.15/0.44 % E exiting
%------------------------------------------------------------------------------