TSTP Solution File: NUM514+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM514+1 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n044.star.cs.uiowa.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory : 32218.625MB
% OS : Linux 3.10.0-693.2.2.el7.x86_64
% CPULimit : 300s
% DateTime : Mon Jan 8 15:21:37 EST 2018
% Result : Theorem 0.06s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 12
% Syntax : Number of formulae : 88 ( 29 unt; 0 def)
% Number of atoms : 371 ( 28 equ)
% Maximal formula atoms : 32 ( 4 avg)
% Number of connectives : 467 ( 184 ~; 211 |; 63 &)
% ( 3 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 70 ( 0 sgn 50 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,axiom,
( isPrime0(xp)
& doDivides0(xp,sdtasdt0(xn,xm)) ),
file('/export/starexec/sandbox/tmp/tmpAv6x2_/sel_theBenchmark.p_1',m__1860) ).
fof(5,axiom,
( aNaturalNumber0(xr)
& doDivides0(xr,xk)
& isPrime0(xr) ),
file('/export/starexec/sandbox/tmp/tmpAv6x2_/sel_theBenchmark.p_1',m__2342) ).
fof(10,axiom,
doDivides0(xr,xn),
file('/export/starexec/sandbox/tmp/tmpAv6x2_/sel_theBenchmark.p_1',m__2487) ).
fof(14,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( doDivides0(X1,X2)
<=> ? [X3] :
( aNaturalNumber0(X3)
& equal(X2,sdtasdt0(X1,X3)) ) ) ),
file('/export/starexec/sandbox/tmp/tmpAv6x2_/sel_theBenchmark.p_1',mDefDiv) ).
fof(22,axiom,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xp) ),
file('/export/starexec/sandbox/tmp/tmpAv6x2_/sel_theBenchmark.p_1',m__1837) ).
fof(32,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( ( ~ equal(X1,sz00)
& doDivides0(X1,X2) )
=> ! [X3] :
( equal(X3,sdtsldt0(X2,X1))
<=> ( aNaturalNumber0(X3)
& equal(X2,sdtasdt0(X1,X3)) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmpAv6x2_/sel_theBenchmark.p_1',mDefQuot) ).
fof(36,conjecture,
doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm)),
file('/export/starexec/sandbox/tmp/tmpAv6x2_/sel_theBenchmark.p_1',m__) ).
fof(39,axiom,
( equal(sdtasdt0(sdtasdt0(sdtsldt0(xn,xr),xm),xr),sdtasdt0(xn,xm))
& equal(sdtasdt0(xn,xm),sdtasdt0(sdtsldt0(sdtasdt0(xp,xk),xr),xr)) ),
file('/export/starexec/sandbox/tmp/tmpAv6x2_/sel_theBenchmark.p_1',m__2576) ).
fof(42,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmpAv6x2_/sel_theBenchmark.p_1',mSortsB_02) ).
fof(43,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( isPrime0(X1)
<=> ( ~ equal(X1,sz00)
& ~ equal(X1,sz10)
& ! [X2] :
( ( aNaturalNumber0(X2)
& doDivides0(X2,X1) )
=> ( equal(X2,sz10)
| equal(X2,X1) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmpAv6x2_/sel_theBenchmark.p_1',mDefPrime) ).
fof(49,axiom,
equal(xk,sdtsldt0(sdtasdt0(xn,xm),xp)),
file('/export/starexec/sandbox/tmp/tmpAv6x2_/sel_theBenchmark.p_1',m__2306) ).
fof(52,axiom,
equal(sdtasdt0(xp,sdtsldt0(xk,xr)),sdtasdt0(sdtsldt0(xn,xr),xm)),
file('/export/starexec/sandbox/tmp/tmpAv6x2_/sel_theBenchmark.p_1',m__2613) ).
fof(57,negated_conjecture,
~ doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm)),
inference(assume_negation,[status(cth)],[36]) ).
fof(59,negated_conjecture,
~ doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm)),
inference(fof_simplification,[status(thm)],[57,theory(equality)]) ).
cnf(69,plain,
doDivides0(xp,sdtasdt0(xn,xm)),
inference(split_conjunct,[status(thm)],[3]) ).
cnf(70,plain,
isPrime0(xp),
inference(split_conjunct,[status(thm)],[3]) ).
cnf(72,plain,
isPrime0(xr),
inference(split_conjunct,[status(thm)],[5]) ).
cnf(73,plain,
doDivides0(xr,xk),
inference(split_conjunct,[status(thm)],[5]) ).
cnf(74,plain,
aNaturalNumber0(xr),
inference(split_conjunct,[status(thm)],[5]) ).
cnf(90,plain,
doDivides0(xr,xn),
inference(split_conjunct,[status(thm)],[10]) ).
fof(101,plain,
! [X1,X2] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ( ( ~ doDivides0(X1,X2)
| ? [X3] :
( aNaturalNumber0(X3)
& equal(X2,sdtasdt0(X1,X3)) ) )
& ( ! [X3] :
( ~ aNaturalNumber0(X3)
| ~ equal(X2,sdtasdt0(X1,X3)) )
| doDivides0(X1,X2) ) ) ),
inference(fof_nnf,[status(thm)],[14]) ).
fof(102,plain,
! [X4,X5] :
( ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ( ( ~ doDivides0(X4,X5)
| ? [X6] :
( aNaturalNumber0(X6)
& equal(X5,sdtasdt0(X4,X6)) ) )
& ( ! [X7] :
( ~ aNaturalNumber0(X7)
| ~ equal(X5,sdtasdt0(X4,X7)) )
| doDivides0(X4,X5) ) ) ),
inference(variable_rename,[status(thm)],[101]) ).
fof(103,plain,
! [X4,X5] :
( ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ( ( ~ doDivides0(X4,X5)
| ( aNaturalNumber0(esk1_2(X4,X5))
& equal(X5,sdtasdt0(X4,esk1_2(X4,X5))) ) )
& ( ! [X7] :
( ~ aNaturalNumber0(X7)
| ~ equal(X5,sdtasdt0(X4,X7)) )
| doDivides0(X4,X5) ) ) ),
inference(skolemize,[status(esa)],[102]) ).
fof(104,plain,
! [X4,X5,X7] :
( ( ( ~ aNaturalNumber0(X7)
| ~ equal(X5,sdtasdt0(X4,X7))
| doDivides0(X4,X5) )
& ( ~ doDivides0(X4,X5)
| ( aNaturalNumber0(esk1_2(X4,X5))
& equal(X5,sdtasdt0(X4,esk1_2(X4,X5))) ) ) )
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) ),
inference(shift_quantors,[status(thm)],[103]) ).
fof(105,plain,
! [X4,X5,X7] :
( ( ~ aNaturalNumber0(X7)
| ~ equal(X5,sdtasdt0(X4,X7))
| doDivides0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( aNaturalNumber0(esk1_2(X4,X5))
| ~ doDivides0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( equal(X5,sdtasdt0(X4,esk1_2(X4,X5)))
| ~ doDivides0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) ) ),
inference(distribute,[status(thm)],[104]) ).
cnf(108,plain,
( doDivides0(X2,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| X1 != sdtasdt0(X2,X3)
| ~ aNaturalNumber0(X3) ),
inference(split_conjunct,[status(thm)],[105]) ).
cnf(131,plain,
aNaturalNumber0(xp),
inference(split_conjunct,[status(thm)],[22]) ).
cnf(132,plain,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[22]) ).
cnf(133,plain,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[22]) ).
fof(173,plain,
! [X1,X2] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| equal(X1,sz00)
| ~ doDivides0(X1,X2)
| ! [X3] :
( ( ~ equal(X3,sdtsldt0(X2,X1))
| ( aNaturalNumber0(X3)
& equal(X2,sdtasdt0(X1,X3)) ) )
& ( ~ aNaturalNumber0(X3)
| ~ equal(X2,sdtasdt0(X1,X3))
| equal(X3,sdtsldt0(X2,X1)) ) ) ),
inference(fof_nnf,[status(thm)],[32]) ).
fof(174,plain,
! [X4,X5] :
( ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| equal(X4,sz00)
| ~ doDivides0(X4,X5)
| ! [X6] :
( ( ~ equal(X6,sdtsldt0(X5,X4))
| ( aNaturalNumber0(X6)
& equal(X5,sdtasdt0(X4,X6)) ) )
& ( ~ aNaturalNumber0(X6)
| ~ equal(X5,sdtasdt0(X4,X6))
| equal(X6,sdtsldt0(X5,X4)) ) ) ),
inference(variable_rename,[status(thm)],[173]) ).
fof(175,plain,
! [X4,X5,X6] :
( ( ( ~ equal(X6,sdtsldt0(X5,X4))
| ( aNaturalNumber0(X6)
& equal(X5,sdtasdt0(X4,X6)) ) )
& ( ~ aNaturalNumber0(X6)
| ~ equal(X5,sdtasdt0(X4,X6))
| equal(X6,sdtsldt0(X5,X4)) ) )
| equal(X4,sz00)
| ~ doDivides0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) ),
inference(shift_quantors,[status(thm)],[174]) ).
fof(176,plain,
! [X4,X5,X6] :
( ( aNaturalNumber0(X6)
| ~ equal(X6,sdtsldt0(X5,X4))
| equal(X4,sz00)
| ~ doDivides0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( equal(X5,sdtasdt0(X4,X6))
| ~ equal(X6,sdtsldt0(X5,X4))
| equal(X4,sz00)
| ~ doDivides0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( ~ aNaturalNumber0(X6)
| ~ equal(X5,sdtasdt0(X4,X6))
| equal(X6,sdtsldt0(X5,X4))
| equal(X4,sz00)
| ~ doDivides0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) ) ),
inference(distribute,[status(thm)],[175]) ).
cnf(179,plain,
( X2 = sz00
| aNaturalNumber0(X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ doDivides0(X2,X1)
| X3 != sdtsldt0(X1,X2) ),
inference(split_conjunct,[status(thm)],[176]) ).
cnf(190,negated_conjecture,
~ doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm)),
inference(split_conjunct,[status(thm)],[59]) ).
cnf(200,plain,
sdtasdt0(sdtasdt0(sdtsldt0(xn,xr),xm),xr) = sdtasdt0(xn,xm),
inference(split_conjunct,[status(thm)],[39]) ).
fof(211,plain,
! [X1,X2] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| aNaturalNumber0(sdtasdt0(X1,X2)) ),
inference(fof_nnf,[status(thm)],[42]) ).
fof(212,plain,
! [X3,X4] :
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4)
| aNaturalNumber0(sdtasdt0(X3,X4)) ),
inference(variable_rename,[status(thm)],[211]) ).
cnf(213,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[212]) ).
fof(214,plain,
! [X1] :
( ~ aNaturalNumber0(X1)
| ( ( ~ isPrime0(X1)
| ( ~ equal(X1,sz00)
& ~ equal(X1,sz10)
& ! [X2] :
( ~ aNaturalNumber0(X2)
| ~ doDivides0(X2,X1)
| equal(X2,sz10)
| equal(X2,X1) ) ) )
& ( equal(X1,sz00)
| equal(X1,sz10)
| ? [X2] :
( aNaturalNumber0(X2)
& doDivides0(X2,X1)
& ~ equal(X2,sz10)
& ~ equal(X2,X1) )
| isPrime0(X1) ) ) ),
inference(fof_nnf,[status(thm)],[43]) ).
fof(215,plain,
! [X3] :
( ~ aNaturalNumber0(X3)
| ( ( ~ isPrime0(X3)
| ( ~ equal(X3,sz00)
& ~ equal(X3,sz10)
& ! [X4] :
( ~ aNaturalNumber0(X4)
| ~ doDivides0(X4,X3)
| equal(X4,sz10)
| equal(X4,X3) ) ) )
& ( equal(X3,sz00)
| equal(X3,sz10)
| ? [X5] :
( aNaturalNumber0(X5)
& doDivides0(X5,X3)
& ~ equal(X5,sz10)
& ~ equal(X5,X3) )
| isPrime0(X3) ) ) ),
inference(variable_rename,[status(thm)],[214]) ).
fof(216,plain,
! [X3] :
( ~ aNaturalNumber0(X3)
| ( ( ~ isPrime0(X3)
| ( ~ equal(X3,sz00)
& ~ equal(X3,sz10)
& ! [X4] :
( ~ aNaturalNumber0(X4)
| ~ doDivides0(X4,X3)
| equal(X4,sz10)
| equal(X4,X3) ) ) )
& ( equal(X3,sz00)
| equal(X3,sz10)
| ( aNaturalNumber0(esk3_1(X3))
& doDivides0(esk3_1(X3),X3)
& ~ equal(esk3_1(X3),sz10)
& ~ equal(esk3_1(X3),X3) )
| isPrime0(X3) ) ) ),
inference(skolemize,[status(esa)],[215]) ).
fof(217,plain,
! [X3,X4] :
( ( ( ( ( ~ aNaturalNumber0(X4)
| ~ doDivides0(X4,X3)
| equal(X4,sz10)
| equal(X4,X3) )
& ~ equal(X3,sz00)
& ~ equal(X3,sz10) )
| ~ isPrime0(X3) )
& ( equal(X3,sz00)
| equal(X3,sz10)
| ( aNaturalNumber0(esk3_1(X3))
& doDivides0(esk3_1(X3),X3)
& ~ equal(esk3_1(X3),sz10)
& ~ equal(esk3_1(X3),X3) )
| isPrime0(X3) ) )
| ~ aNaturalNumber0(X3) ),
inference(shift_quantors,[status(thm)],[216]) ).
fof(218,plain,
! [X3,X4] :
( ( ~ aNaturalNumber0(X4)
| ~ doDivides0(X4,X3)
| equal(X4,sz10)
| equal(X4,X3)
| ~ isPrime0(X3)
| ~ aNaturalNumber0(X3) )
& ( ~ equal(X3,sz00)
| ~ isPrime0(X3)
| ~ aNaturalNumber0(X3) )
& ( ~ equal(X3,sz10)
| ~ isPrime0(X3)
| ~ aNaturalNumber0(X3) )
& ( aNaturalNumber0(esk3_1(X3))
| equal(X3,sz00)
| equal(X3,sz10)
| isPrime0(X3)
| ~ aNaturalNumber0(X3) )
& ( doDivides0(esk3_1(X3),X3)
| equal(X3,sz00)
| equal(X3,sz10)
| isPrime0(X3)
| ~ aNaturalNumber0(X3) )
& ( ~ equal(esk3_1(X3),sz10)
| equal(X3,sz00)
| equal(X3,sz10)
| isPrime0(X3)
| ~ aNaturalNumber0(X3) )
& ( ~ equal(esk3_1(X3),X3)
| equal(X3,sz00)
| equal(X3,sz10)
| isPrime0(X3)
| ~ aNaturalNumber0(X3) ) ),
inference(distribute,[status(thm)],[217]) ).
cnf(224,plain,
( ~ aNaturalNumber0(X1)
| ~ isPrime0(X1)
| X1 != sz00 ),
inference(split_conjunct,[status(thm)],[218]) ).
cnf(245,plain,
xk = sdtsldt0(sdtasdt0(xn,xm),xp),
inference(split_conjunct,[status(thm)],[49]) ).
cnf(250,plain,
sdtasdt0(xp,sdtsldt0(xk,xr)) = sdtasdt0(sdtsldt0(xn,xr),xm),
inference(split_conjunct,[status(thm)],[52]) ).
cnf(268,plain,
sdtasdt0(sdtasdt0(xp,sdtsldt0(xk,xr)),xr) = sdtasdt0(xn,xm),
inference(rw,[status(thm)],[200,250,theory(equality)]) ).
cnf(269,negated_conjecture,
~ doDivides0(xp,sdtasdt0(xp,sdtsldt0(xk,xr))),
inference(rw,[status(thm)],[190,250,theory(equality)]) ).
cnf(270,plain,
( sz00 != xp
| ~ aNaturalNumber0(xp) ),
inference(spm,[status(thm)],[224,70,theory(equality)]) ).
cnf(271,plain,
( sz00 != xr
| ~ aNaturalNumber0(xr) ),
inference(spm,[status(thm)],[224,72,theory(equality)]) ).
cnf(272,plain,
( sz00 != xp
| $false ),
inference(rw,[status(thm)],[270,131,theory(equality)]) ).
cnf(273,plain,
sz00 != xp,
inference(cn,[status(thm)],[272,theory(equality)]) ).
cnf(274,plain,
( sz00 != xr
| $false ),
inference(rw,[status(thm)],[271,74,theory(equality)]) ).
cnf(275,plain,
sz00 != xr,
inference(cn,[status(thm)],[274,theory(equality)]) ).
cnf(276,plain,
( aNaturalNumber0(sdtasdt0(xp,sdtsldt0(xk,xr)))
| ~ aNaturalNumber0(xm)
| ~ aNaturalNumber0(sdtsldt0(xn,xr)) ),
inference(spm,[status(thm)],[213,250,theory(equality)]) ).
cnf(282,plain,
( aNaturalNumber0(sdtasdt0(xp,sdtsldt0(xk,xr)))
| $false
| ~ aNaturalNumber0(sdtsldt0(xn,xr)) ),
inference(rw,[status(thm)],[276,132,theory(equality)]) ).
cnf(283,plain,
( aNaturalNumber0(sdtasdt0(xp,sdtsldt0(xk,xr)))
| ~ aNaturalNumber0(sdtsldt0(xn,xr)) ),
inference(cn,[status(thm)],[282,theory(equality)]) ).
cnf(442,plain,
( doDivides0(X1,sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(sdtasdt0(X1,X2)) ),
inference(er,[status(thm)],[108,theory(equality)]) ).
cnf(542,plain,
( sz00 = X1
| aNaturalNumber0(sdtsldt0(X2,X1))
| ~ doDivides0(X1,X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(er,[status(thm)],[179,theory(equality)]) ).
cnf(1156,plain,
( aNaturalNumber0(sdtasdt0(xn,xm))
| ~ aNaturalNumber0(xr)
| ~ aNaturalNumber0(sdtasdt0(xp,sdtsldt0(xk,xr))) ),
inference(spm,[status(thm)],[213,268,theory(equality)]) ).
cnf(1178,plain,
( aNaturalNumber0(sdtasdt0(xn,xm))
| $false
| ~ aNaturalNumber0(sdtasdt0(xp,sdtsldt0(xk,xr))) ),
inference(rw,[status(thm)],[1156,74,theory(equality)]) ).
cnf(1179,plain,
( aNaturalNumber0(sdtasdt0(xn,xm))
| ~ aNaturalNumber0(sdtasdt0(xp,sdtsldt0(xk,xr))) ),
inference(cn,[status(thm)],[1178,theory(equality)]) ).
cnf(2150,plain,
( aNaturalNumber0(sdtasdt0(xn,xm))
| ~ aNaturalNumber0(sdtsldt0(xn,xr)) ),
inference(spm,[status(thm)],[1179,283,theory(equality)]) ).
cnf(3465,plain,
( doDivides0(X1,sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(csr,[status(thm)],[442,213]) ).
cnf(3469,negated_conjecture,
( ~ aNaturalNumber0(sdtsldt0(xk,xr))
| ~ aNaturalNumber0(xp) ),
inference(spm,[status(thm)],[269,3465,theory(equality)]) ).
cnf(3494,negated_conjecture,
( ~ aNaturalNumber0(sdtsldt0(xk,xr))
| $false ),
inference(rw,[status(thm)],[3469,131,theory(equality)]) ).
cnf(3495,negated_conjecture,
~ aNaturalNumber0(sdtsldt0(xk,xr)),
inference(cn,[status(thm)],[3494,theory(equality)]) ).
cnf(4680,plain,
( sz00 = xp
| aNaturalNumber0(xk)
| ~ doDivides0(xp,sdtasdt0(xn,xm))
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(sdtasdt0(xn,xm)) ),
inference(spm,[status(thm)],[542,245,theory(equality)]) ).
cnf(4681,negated_conjecture,
( sz00 = xr
| ~ doDivides0(xr,xk)
| ~ aNaturalNumber0(xr)
| ~ aNaturalNumber0(xk) ),
inference(spm,[status(thm)],[3495,542,theory(equality)]) ).
cnf(4698,plain,
( aNaturalNumber0(sdtasdt0(xn,xm))
| sz00 = xr
| ~ doDivides0(xr,xn)
| ~ aNaturalNumber0(xr)
| ~ aNaturalNumber0(xn) ),
inference(spm,[status(thm)],[2150,542,theory(equality)]) ).
cnf(4705,plain,
( sz00 = xp
| aNaturalNumber0(xk)
| $false
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(sdtasdt0(xn,xm)) ),
inference(rw,[status(thm)],[4680,69,theory(equality)]) ).
cnf(4706,plain,
( sz00 = xp
| aNaturalNumber0(xk)
| $false
| $false
| ~ aNaturalNumber0(sdtasdt0(xn,xm)) ),
inference(rw,[status(thm)],[4705,131,theory(equality)]) ).
cnf(4707,plain,
( sz00 = xp
| aNaturalNumber0(xk)
| ~ aNaturalNumber0(sdtasdt0(xn,xm)) ),
inference(cn,[status(thm)],[4706,theory(equality)]) ).
cnf(4708,plain,
( aNaturalNumber0(xk)
| ~ aNaturalNumber0(sdtasdt0(xn,xm)) ),
inference(sr,[status(thm)],[4707,273,theory(equality)]) ).
cnf(4709,negated_conjecture,
( sz00 = xr
| $false
| ~ aNaturalNumber0(xr)
| ~ aNaturalNumber0(xk) ),
inference(rw,[status(thm)],[4681,73,theory(equality)]) ).
cnf(4710,negated_conjecture,
( sz00 = xr
| $false
| $false
| ~ aNaturalNumber0(xk) ),
inference(rw,[status(thm)],[4709,74,theory(equality)]) ).
cnf(4711,negated_conjecture,
( sz00 = xr
| ~ aNaturalNumber0(xk) ),
inference(cn,[status(thm)],[4710,theory(equality)]) ).
cnf(4712,negated_conjecture,
~ aNaturalNumber0(xk),
inference(sr,[status(thm)],[4711,275,theory(equality)]) ).
cnf(4731,plain,
( aNaturalNumber0(sdtasdt0(xn,xm))
| sz00 = xr
| $false
| ~ aNaturalNumber0(xr)
| ~ aNaturalNumber0(xn) ),
inference(rw,[status(thm)],[4698,90,theory(equality)]) ).
cnf(4732,plain,
( aNaturalNumber0(sdtasdt0(xn,xm))
| sz00 = xr
| $false
| $false
| ~ aNaturalNumber0(xn) ),
inference(rw,[status(thm)],[4731,74,theory(equality)]) ).
cnf(4733,plain,
( aNaturalNumber0(sdtasdt0(xn,xm))
| sz00 = xr
| $false
| $false
| $false ),
inference(rw,[status(thm)],[4732,133,theory(equality)]) ).
cnf(4734,plain,
( aNaturalNumber0(sdtasdt0(xn,xm))
| sz00 = xr ),
inference(cn,[status(thm)],[4733,theory(equality)]) ).
cnf(4735,plain,
aNaturalNumber0(sdtasdt0(xn,xm)),
inference(sr,[status(thm)],[4734,275,theory(equality)]) ).
cnf(5010,plain,
( aNaturalNumber0(xk)
| $false ),
inference(rw,[status(thm)],[4708,4735,theory(equality)]) ).
cnf(5011,plain,
aNaturalNumber0(xk),
inference(cn,[status(thm)],[5010,theory(equality)]) ).
cnf(5012,plain,
$false,
inference(sr,[status(thm)],[5011,4712,theory(equality)]) ).
cnf(5013,plain,
$false,
5012,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : NUM514+1 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.08 % Command : Source/sine.py -e eprover -t %d %s
% 0.02/0.27 % Computer : n044.star.cs.uiowa.edu
% 0.02/0.27 % Model : x86_64 x86_64
% 0.02/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.27 % Memory : 32218.625MB
% 0.02/0.27 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.02/0.27 % CPULimit : 300
% 0.02/0.27 % DateTime : Fri Jan 5 06:38:00 CST 2018
% 0.02/0.27 % CPUTime :
% 0.06/0.31 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.31 --creating new selector for []
% 0.06/0.48 -running prover on /export/starexec/sandbox/tmp/tmpAv6x2_/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.48 -running prover with command ['/export/starexec/sandbox/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/export/starexec/sandbox/tmp/tmpAv6x2_/sel_theBenchmark.p_1']
% 0.06/0.48 -prover status Theorem
% 0.06/0.48 Problem theBenchmark.p solved in phase 0.
% 0.06/0.48 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.48 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.48 Solved 1 out of 1.
% 0.06/0.48 # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.48 # SZS status Theorem
% 0.06/0.48 # SZS output start CNFRefutation.
% See solution above
% 0.06/0.48 # SZS output end CNFRefutation
%------------------------------------------------------------------------------