%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM477+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n019.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Mon Jul 18 09:32:52 EDT 2022
% Result : Theorem 0.23s 1.40s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 21 ( 8 unt; 0 def)
% Number of atoms : 50 ( 20 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 47 ( 18 ~; 13 |; 13 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 14 ( 0 sgn 7 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ? [X1] :
( aNaturalNumber0(X1)
& sdtpldt0(xm,X1) = xn )
| sdtlseqdt0(xm,xn) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(mMonMul2,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( X1 != sz00
=> sdtlseqdt0(X2,sdtasdt0(X2,X1)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mMonMul2) ).
fof(m__1494_04,hypothesis,
( ? [X1] :
( aNaturalNumber0(X1)
& xn = sdtasdt0(xm,X1) )
& doDivides0(xm,xn)
& xn != sz00 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1494_04) ).
fof(m_MulZero,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( sdtasdt0(X1,sz00) = sz00
& sz00 = sdtasdt0(sz00,X1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m_MulZero) ).
fof(m__1494,hypothesis,
( aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1494) ).
fof(c_0_5,negated_conjecture,
~ ( ? [X1] :
( aNaturalNumber0(X1)
& sdtpldt0(xm,X1) = xn )
| sdtlseqdt0(xm,xn) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,plain,
! [X3,X4] :
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4)
| X3 = sz00
| sdtlseqdt0(X4,sdtasdt0(X4,X3)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMonMul2])]) ).
fof(c_0_7,hypothesis,
( aNaturalNumber0(esk1_0)
& xn = sdtasdt0(xm,esk1_0)
& doDivides0(xm,xn)
& xn != sz00 ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[m__1494_04])])])]) ).
fof(c_0_8,negated_conjecture,
! [X2] :
( ( ~ aNaturalNumber0(X2)
| sdtpldt0(xm,X2) != xn )
& ~ sdtlseqdt0(xm,xn) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])]) ).
fof(c_0_9,plain,
! [X2] :
( ( sdtasdt0(X2,sz00) = sz00
| ~ aNaturalNumber0(X2) )
& ( sz00 = sdtasdt0(sz00,X2)
| ~ aNaturalNumber0(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_MulZero])])]) ).
cnf(c_0_10,plain,
( sdtlseqdt0(X1,sdtasdt0(X1,X2))
| X2 = sz00
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,hypothesis,
xn = sdtasdt0(xm,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,hypothesis,
aNaturalNumber0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__1494]) ).
cnf(c_0_14,negated_conjecture,
~ sdtlseqdt0(xm,xn),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( sdtasdt0(X1,sz00) = sz00
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,hypothesis,
sz00 = esk1_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13])]),c_0_14]) ).
cnf(c_0_17,hypothesis,
xn != sz00,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_18,plain,
( sdtasdt0(X1,esk1_0) = esk1_0
| ~ aNaturalNumber0(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_16]) ).
cnf(c_0_19,hypothesis,
xn != esk1_0,
inference(rw,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_20,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_18]),c_0_13])]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM477+2 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n019.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jul 5 16:56:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.23/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.40 # Preprocessing time : 0.017 s
% 0.23/1.40
% 0.23/1.40 # Proof found!
% 0.23/1.40 # SZS status Theorem
% 0.23/1.40 # SZS output start CNFRefutation
% See solution above
% 0.23/1.40 # Proof object total steps : 21
% 0.23/1.40 # Proof object clause steps : 11
% 0.23/1.40 # Proof object formula steps : 10
% 0.23/1.40 # Proof object conjectures : 4
% 0.23/1.40 # Proof object clause conjectures : 1
% 0.23/1.40 # Proof object formula conjectures : 3
% 0.23/1.40 # Proof object initial clauses used : 7
% 0.23/1.40 # Proof object initial formulas used : 5
% 0.23/1.40 # Proof object generating inferences : 2
% 0.23/1.40 # Proof object simplifying inferences : 10
% 0.23/1.40 # Training examples: 0 positive, 0 negative
% 0.23/1.40 # Parsed axioms : 37
% 0.23/1.40 # Removed by relevancy pruning/SinE : 7
% 0.23/1.40 # Initial clauses : 52
% 0.23/1.40 # Removed in clause preprocessing : 1
% 0.23/1.40 # Initial clauses in saturation : 51
% 0.23/1.40 # Processed clauses : 82
% 0.23/1.40 # ...of these trivial : 1
% 0.23/1.40 # ...subsumed : 18
% 0.23/1.40 # ...remaining for further processing : 63
% 0.23/1.40 # Other redundant clauses eliminated : 7
% 0.23/1.40 # Clauses deleted for lack of memory : 0
% 0.23/1.40 # Backward-subsumed : 1
% 0.23/1.40 # Backward-rewritten : 14
% 0.23/1.40 # Generated clauses : 363
% 0.23/1.40 # ...of the previous two non-trivial : 331
% 0.23/1.40 # Contextual simplify-reflections : 4
% 0.23/1.40 # Paramodulations : 350
% 0.23/1.40 # Factorizations : 0
% 0.23/1.40 # Equation resolutions : 13
% 0.23/1.40 # Current number of processed clauses : 47
% 0.23/1.40 # Positive orientable unit clauses : 9
% 0.23/1.40 # Positive unorientable unit clauses: 0
% 0.23/1.40 # Negative unit clauses : 3
% 0.23/1.40 # Non-unit-clauses : 35
% 0.23/1.40 # Current number of unprocessed clauses: 177
% 0.23/1.40 # ...number of literals in the above : 998
% 0.23/1.40 # Current number of archived formulas : 0
% 0.23/1.40 # Current number of archived clauses : 15
% 0.23/1.40 # Clause-clause subsumption calls (NU) : 472
% 0.23/1.40 # Rec. Clause-clause subsumption calls : 166
% 0.23/1.40 # Non-unit clause-clause subsumptions : 20
% 0.23/1.40 # Unit Clause-clause subsumption calls : 21
% 0.23/1.40 # Rewrite failures with RHS unbound : 0
% 0.23/1.40 # BW rewrite match attempts : 1
% 0.23/1.40 # BW rewrite match successes : 1
% 0.23/1.40 # Condensation attempts : 0
% 0.23/1.40 # Condensation successes : 0
% 0.23/1.40 # Termbank termtop insertions : 9169
% 0.23/1.40
% 0.23/1.40 # -------------------------------------------------
% 0.23/1.40 # User time : 0.026 s
% 0.23/1.40 # System time : 0.002 s
% 0.23/1.40 # Total time : 0.028 s
% 0.23/1.41 # Maximum resident set size: 3080 pages
%------------------------------------------------------------------------------