TSTP Solution File: NUM521+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM521+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n027.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:33:21 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 38 ( 17 unt; 0 def)
% Number of atoms : 98 ( 22 equ)
% Maximal formula atoms : 13 ( 2 avg)
% Number of connectives : 108 ( 48 ~; 40 |; 16 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn 11 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mLETotal,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( sdtlseqdt0(X1,X2)
| ( X2 != X1
& sdtlseqdt0(X2,X1) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mLETotal) ).
fof(m__1837,hypothesis,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xp) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1837) ).
fof(m__2075,hypothesis,
~ sdtlseqdt0(xp,xm),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2075) ).
fof(m__1870,hypothesis,
~ sdtlseqdt0(xp,xn),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1870) ).
fof(m__,conjecture,
( doDivides0(xp,xn)
| doDivides0(xp,xm) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(m__2287,hypothesis,
~ ( xn != xp
& sdtlseqdt0(xn,xp)
& xm != xp
& sdtlseqdt0(xm,xp) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2287) ).
fof(mDefDiv,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( doDivides0(X1,X2)
<=> ? [X3] :
( aNaturalNumber0(X3)
& X2 = sdtasdt0(X1,X3) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDefDiv) ).
fof(m_MulUnit,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( sdtasdt0(X1,sz10) = X1
& X1 = sdtasdt0(sz10,X1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m_MulUnit) ).
fof(mSortsC_01,axiom,
( aNaturalNumber0(sz10)
& sz10 != sz00 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mSortsC_01) ).
fof(c_0_9,plain,
! [X3,X4] :
( ( X4 != X3
| sdtlseqdt0(X3,X4)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4) )
& ( sdtlseqdt0(X4,X3)
| sdtlseqdt0(X3,X4)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLETotal])])]) ).
cnf(c_0_10,plain,
( sdtlseqdt0(X2,X1)
| sdtlseqdt0(X1,X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_11,hypothesis,
aNaturalNumber0(xp),
inference(split_conjunct,[status(thm)],[m__1837]) ).
fof(c_0_12,hypothesis,
~ sdtlseqdt0(xp,xm),
inference(fof_simplification,[status(thm)],[m__2075]) ).
fof(c_0_13,hypothesis,
~ sdtlseqdt0(xp,xn),
inference(fof_simplification,[status(thm)],[m__1870]) ).
fof(c_0_14,negated_conjecture,
~ ( doDivides0(xp,xn)
| doDivides0(xp,xm) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_15,hypothesis,
( xn = xp
| ~ sdtlseqdt0(xn,xp)
| xm = xp
| ~ sdtlseqdt0(xm,xp) ),
inference(fof_nnf,[status(thm)],[m__2287]) ).
cnf(c_0_16,hypothesis,
( sdtlseqdt0(xp,X1)
| sdtlseqdt0(X1,xp)
| ~ aNaturalNumber0(X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_18,hypothesis,
~ sdtlseqdt0(xp,xm),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_20,hypothesis,
~ sdtlseqdt0(xp,xn),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_21,negated_conjecture,
( ~ doDivides0(xp,xn)
& ~ doDivides0(xp,xm) ),
inference(fof_nnf,[status(thm)],[c_0_14]) ).
cnf(c_0_22,hypothesis,
( xm = xp
| xn = xp
| ~ sdtlseqdt0(xm,xp)
| ~ sdtlseqdt0(xn,xp) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,hypothesis,
sdtlseqdt0(xm,xp),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_24,hypothesis,
sdtlseqdt0(xn,xp),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_19]),c_0_20]) ).
fof(c_0_25,plain,
! [X4,X5,X7] :
( ( aNaturalNumber0(esk1_2(X4,X5))
| ~ doDivides0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( X5 = sdtasdt0(X4,esk1_2(X4,X5))
| ~ doDivides0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( ~ aNaturalNumber0(X7)
| X5 != sdtasdt0(X4,X7)
| doDivides0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefDiv])])])])])])]) ).
fof(c_0_26,plain,
! [X2] :
( ( sdtasdt0(X2,sz10) = X2
| ~ aNaturalNumber0(X2) )
& ( X2 = sdtasdt0(sz10,X2)
| ~ aNaturalNumber0(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_MulUnit])])]) ).
cnf(c_0_27,negated_conjecture,
~ doDivides0(xp,xm),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,hypothesis,
( xp = xn
| xp = xm ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]),c_0_24])]) ).
cnf(c_0_29,plain,
( doDivides0(X2,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| X1 != sdtasdt0(X2,X3)
| ~ aNaturalNumber0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,plain,
( sdtasdt0(X1,sz10) = X1
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,plain,
aNaturalNumber0(sz10),
inference(split_conjunct,[status(thm)],[mSortsC_01]) ).
cnf(c_0_32,negated_conjecture,
( xp = xn
| ~ doDivides0(xm,xm) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,plain,
( doDivides0(X1,X1)
| ~ aNaturalNumber0(X1) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])])]) ).
cnf(c_0_34,negated_conjecture,
~ doDivides0(xp,xn),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_35,negated_conjecture,
xp = xn,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_17])]) ).
cnf(c_0_36,negated_conjecture,
~ doDivides0(xn,xn),
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_33]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM521+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n027.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jul 7 15:49:14 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41 # Preprocessing time : 0.019 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.41 # Proof object total steps : 38
% 0.23/1.41 # Proof object clause steps : 21
% 0.23/1.41 # Proof object formula steps : 17
% 0.23/1.41 # Proof object conjectures : 9
% 0.23/1.41 # Proof object clause conjectures : 6
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 12
% 0.23/1.41 # Proof object initial formulas used : 9
% 0.23/1.41 # Proof object generating inferences : 7
% 0.23/1.41 # Proof object simplifying inferences : 14
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 45
% 0.23/1.41 # Removed by relevancy pruning/SinE : 3
% 0.23/1.41 # Initial clauses : 74
% 0.23/1.41 # Removed in clause preprocessing : 3
% 0.23/1.41 # Initial clauses in saturation : 71
% 0.23/1.41 # Processed clauses : 154
% 0.23/1.41 # ...of these trivial : 0
% 0.23/1.41 # ...subsumed : 39
% 0.23/1.41 # ...remaining for further processing : 115
% 0.23/1.41 # Other redundant clauses eliminated : 7
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 5
% 0.23/1.41 # Backward-rewritten : 26
% 0.23/1.41 # Generated clauses : 483
% 0.23/1.41 # ...of the previous two non-trivial : 462
% 0.23/1.41 # Contextual simplify-reflections : 13
% 0.23/1.41 # Paramodulations : 469
% 0.23/1.41 # Factorizations : 1
% 0.23/1.41 # Equation resolutions : 13
% 0.23/1.41 # Current number of processed clauses : 83
% 0.23/1.41 # Positive orientable unit clauses : 10
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 7
% 0.23/1.41 # Non-unit-clauses : 66
% 0.23/1.41 # Current number of unprocessed clauses: 292
% 0.23/1.41 # ...number of literals in the above : 1673
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 31
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 1230
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 333
% 0.23/1.41 # Non-unit clause-clause subsumptions : 48
% 0.23/1.41 # Unit Clause-clause subsumption calls : 431
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 6
% 0.23/1.41 # BW rewrite match successes : 6
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 12356
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.032 s
% 0.23/1.41 # System time : 0.003 s
% 0.23/1.41 # Total time : 0.035 s
% 0.23/1.41 # Maximum resident set size: 3388 pages
%------------------------------------------------------------------------------