%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP700+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 : 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:58 PM UTC 2026
% Result : Theorem 0.15s 0.62s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 31 ( 26 unt; 0 def)
% Number of atoms : 36 ( 35 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 13 ( 8 ~; 3 |; 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; 2 con; 0-2 aty)
% Number of variables : 49 ( 0 sgn 25 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f08,axiom,
! [X3,X1,X2] : mult(mult(X2,X1),mult(X1,mult(X3,X1))) = mult(mult(X2,mult(X1,mult(X1,X3))),X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f08) ).
fof(f06,axiom,
! [X2] : mult(unit,X2) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f06) ).
fof(f04,axiom,
! [X1,X2] : rd(mult(X2,X1),X1) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f04) ).
fof(goals,conjecture,
! [X4] :
? [X5] :
( mult(X4,X5) = unit
& mult(X5,X4) = unit ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f03,axiom,
! [X1,X2] : mult(rd(X2,X1),X1) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f03) ).
fof(f05,axiom,
! [X2] : mult(X2,unit) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f05) ).
fof(f02,axiom,
! [X1,X2] : ld(X2,mult(X2,X1)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f02) ).
fof(c_0_7,plain,
! [X19,X20,X21] : mult(mult(X21,X20),mult(X20,mult(X19,X20))) = mult(mult(X21,mult(X20,mult(X20,X19))),X20),
inference(variable_rename,[status(thm)],[f08]) ).
fof(c_0_8,plain,
! [X15] : mult(unit,X15) = X15,
inference(variable_rename,[status(thm)],[f06]) ).
fof(c_0_9,plain,
! [X12,X13] : rd(mult(X13,X12),X12) = X13,
inference(variable_rename,[status(thm)],[f04]) ).
cnf(c_0_10,plain,
mult(mult(X1,X2),mult(X2,mult(X3,X2))) = mult(mult(X1,mult(X2,mult(X2,X3))),X2),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
mult(unit,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,negated_conjecture,
~ ! [X4] :
? [X5] :
( mult(X4,X5) = unit
& mult(X5,X4) = unit ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_13,plain,
rd(mult(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
mult(mult(X1,mult(X1,X2)),X1) = mult(X1,mult(X1,mult(X2,X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_11]) ).
fof(c_0_15,plain,
! [X10,X11] : mult(rd(X11,X10),X10) = X11,
inference(variable_rename,[status(thm)],[f03]) ).
fof(c_0_16,negated_conjecture,
! [X23] :
( mult(esk1_0,X23) != unit
| mult(X23,esk1_0) != unit ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])]) ).
cnf(c_0_17,plain,
rd(mult(X1,mult(X1,mult(X2,X1))),X1) = mult(X1,mult(X1,X2)),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
mult(rd(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_19,plain,
! [X14] : mult(X14,unit) = X14,
inference(variable_rename,[status(thm)],[f05]) ).
fof(c_0_20,plain,
! [X8,X9] : ld(X9,mult(X9,X8)) = X8,
inference(variable_rename,[status(thm)],[f02]) ).
cnf(c_0_21,negated_conjecture,
( mult(esk1_0,X1) != unit
| mult(X1,esk1_0) != unit ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
rd(mult(X1,mult(X1,X2)),X1) = mult(X1,mult(X1,rd(X2,X1))),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
mult(X1,unit) = X1,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,plain,
ld(X1,mult(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,negated_conjecture,
( X1 != unit
| mult(esk1_0,rd(X1,esk1_0)) != unit ),
inference(spm,[status(thm)],[c_0_21,c_0_18]) ).
cnf(c_0_26,plain,
mult(X1,mult(X1,rd(unit,X1))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_13]) ).
cnf(c_0_27,plain,
ld(X1,X1) = unit,
inference(spm,[status(thm)],[c_0_24,c_0_23]) ).
cnf(c_0_28,negated_conjecture,
mult(esk1_0,rd(unit,esk1_0)) != unit,
inference(er,[status(thm)],[c_0_25]) ).
cnf(c_0_29,plain,
mult(X1,rd(unit,X1)) = unit,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_26]),c_0_27]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP700+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.55 % Computer : n020.cluster.edu
% 0.11/0.55 % Model : x86_64 x86_64
% 0.11/0.55 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.55 % Memory : 8046.5625MB
% 0.11/0.55 % OS : Linux 6.8.0-71-generic
% 0.11/0.55 % CPULimit : 300
% 0.11/0.55 % WCLimit : 300
% 0.11/0.55 % DateTime : Sun Sep 20 20:35:03 UTC 2026
% 0.11/0.55 % CPUTime :
% 0.11/0.55 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.59 Running first-order theorem proving
% 0.15/0.59 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.15/0.62 % Version: 3.5.1
% 0.15/0.62 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.62 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.62 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.62 % Starting sh5l with 300s (1) cores
% 0.15/0.62 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1184471 completed with status 0
% 0.15/0.62 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.15/0.62 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.62 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.62 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.62 % No SInE strategy applied
% 0.15/0.62 % Search class: FUHPM-FFSF22-MFFFFFNN
% 0.15/0.62 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.62 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.62 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.15/0.62 % Starting H----_102_C18_F1_PI_AE_Q4_CS_SP_PS_S5PRR_S2S with 136s (1) cores
% 0.15/0.62 % Starting new_bool_3 with 136s (1) cores
% 0.15/0.62 % Starting new_bool_1 with 136s (1) cores
% 0.15/0.62 % H----_102_C18_F1_PI_AE_Q4_CS_SP_PS_S5PRR_S2S with pid 1184478 completed with status 0
% 0.15/0.62 % Result found by H----_102_C18_F1_PI_AE_Q4_CS_SP_PS_S5PRR_S2S
% 0.15/0.62 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.62 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.62 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.62 % No SInE strategy applied
% 0.15/0.62 % Search class: FUHPM-FFSF22-MFFFFFNN
% 0.15/0.62 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.62 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.62 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.15/0.62 % Starting H----_102_C18_F1_PI_AE_Q4_CS_SP_PS_S5PRR_S2S with 136s (1) cores
% 0.15/0.62 % Preprocessing time : 0.001 s
% 0.15/0.62 % Presaturation interreduction done
% 0.15/0.62
% 0.15/0.62 % Proof found!
% 0.15/0.62 % SZS status Theorem
% 0.15/0.62 % SZS output start CNFRefutation
% See solution above
% 0.15/0.62 % Parsed axioms : 9
% 0.15/0.62 % Removed by relevancy pruning/SinE : 0
% 0.15/0.62 % Initial clauses : 9
% 0.15/0.62 % Removed in clause preprocessing : 0
% 0.15/0.62 % Initial clauses in saturation : 9
% 0.15/0.62 % Processed clauses : 89
% 0.15/0.62 % ...of these trivial : 6
% 0.15/0.62 % ...subsumed : 15
% 0.15/0.62 % ...remaining for further processing : 68
% 0.15/0.62 % Other redundant clauses eliminated : 0
% 0.15/0.62 % Clauses deleted for lack of memory : 0
% 0.15/0.62 % Backward-subsumed : 1
% 0.15/0.62 % Backward-rewritten : 7
% 0.15/0.62 % Generated clauses : 565
% 0.15/0.62 % ...of the previous two non-redundant : 407
% 0.15/0.62 % ...aggressively subsumed : 0
% 0.15/0.62 % Contextual simplify-reflections : 0
% 0.15/0.62 % Paramodulations : 562
% 0.15/0.62 % Factorizations : 0
% 0.15/0.62 % NegExts : 0
% 0.15/0.62 % Equation resolutions : 3
% 0.15/0.62 % Disequality decompositions : 0
% 0.15/0.62 % Total rewrite steps : 691
% 0.15/0.62 % ...of those cached : 567
% 0.15/0.62 % Propositional unsat checks : 0
% 0.15/0.62 % Propositional check models : 0
% 0.15/0.62 % Propositional check unsatisfiable : 0
% 0.15/0.62 % Propositional clauses : 0
% 0.15/0.62 % Propositional clauses after purity: 0
% 0.15/0.62 % Propositional unsat core size : 0
% 0.15/0.62 % Propositional preprocessing time : 0.000
% 0.15/0.62 % Propositional encoding time : 0.000
% 0.15/0.62 % Propositional solver time : 0.000
% 0.15/0.62 % Success case prop preproc time : 0.000
% 0.15/0.62 % Success case prop encoding time : 0.000
% 0.15/0.62 % Success case prop solver time : 0.000
% 0.15/0.62 % Current number of processed clauses : 51
% 0.15/0.62 % Positive orientable unit clauses : 32
% 0.15/0.62 % Positive unorientable unit clauses: 0
% 0.15/0.62 % Negative unit clauses : 5
% 0.15/0.62 % Non-unit-clauses : 14
% 0.15/0.62 % Current number of unprocessed clauses: 335
% 0.15/0.62 % ...number of literals in the above : 384
% 0.15/0.62 % Current number of archived formulas : 0
% 0.15/0.62 % Current number of archived clauses : 17
% 0.15/0.62 % Clause-clause subsumption calls (NU) : 118
% 0.15/0.62 % Rec. Clause-clause subsumption calls : 112
% 0.15/0.62 % Non-unit clause-clause subsumptions : 2
% 0.15/0.62 % Unit Clause-clause subsumption calls : 33
% 0.15/0.62 % Rewrite failures with RHS unbound : 0
% 0.15/0.62 % BW rewrite match attempts : 40
% 0.15/0.62 % BW rewrite match successes : 7
% 0.15/0.62 % Condensation attempts : 0
% 0.15/0.62 % Condensation successes : 0
% 0.15/0.62 % Termbank termtop insertions : 8877
% 0.15/0.62 % Search garbage collected termcells : 25
% 0.15/0.62
% 0.15/0.62 % -------------------------------------------------
% 0.15/0.62 % User time : 0.006 s
% 0.15/0.62 % System time : 0.004 s
% 0.15/0.62 % Total time : 0.010 s
% 0.15/0.62 % Maximum resident set size: 3636 pages
% 0.15/0.62
% 0.15/0.62 % -------------------------------------------------
% 0.15/0.62 % User time : 0.024 s
% 0.15/0.62 % System time : 0.015 s
% 0.15/0.62 % Total time : 0.040 s
% 0.15/0.62 % Maximum resident set size: 4608 pages
% 0.15/0.62 % E exiting
%------------------------------------------------------------------------------