%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM500+1 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n132.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:33 EST 2018
% Result : Theorem 0.06s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 9
% Syntax : Number of formulae : 63 ( 14 unt; 0 def)
% Number of atoms : 312 ( 27 equ)
% Maximal formula atoms : 32 ( 4 avg)
% Number of connectives : 397 ( 148 ~; 176 |; 65 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 61 ( 0 sgn 40 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
~ ( equal(xk,sz00)
| equal(xk,sz10) ),
file('/export/starexec/sandbox2/tmp/tmpzn75yk/sel_theBenchmark.p_1',m__2315) ).
fof(3,axiom,
( isPrime0(xp)
& doDivides0(xp,sdtasdt0(xn,xm)) ),
file('/export/starexec/sandbox2/tmp/tmpzn75yk/sel_theBenchmark.p_1',m__1860) ).
fof(19,axiom,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xp) ),
file('/export/starexec/sandbox2/tmp/tmpzn75yk/sel_theBenchmark.p_1',m__1837) ).
fof(27,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/sandbox2/tmp/tmpzn75yk/sel_theBenchmark.p_1',mDefQuot) ).
fof(31,conjecture,
? [X1] :
( aNaturalNumber0(X1)
& doDivides0(X1,xk)
& isPrime0(X1) ),
file('/export/starexec/sandbox2/tmp/tmpzn75yk/sel_theBenchmark.p_1',m__) ).
fof(36,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmpzn75yk/sel_theBenchmark.p_1',mSortsB_02) ).
fof(37,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/sandbox2/tmp/tmpzn75yk/sel_theBenchmark.p_1',mDefPrime) ).
fof(40,axiom,
! [X1] :
( ( aNaturalNumber0(X1)
& ~ equal(X1,sz00)
& ~ equal(X1,sz10) )
=> ? [X2] :
( aNaturalNumber0(X2)
& doDivides0(X2,X1)
& isPrime0(X2) ) ),
file('/export/starexec/sandbox2/tmp/tmpzn75yk/sel_theBenchmark.p_1',mPrimDiv) ).
fof(43,axiom,
equal(xk,sdtsldt0(sdtasdt0(xn,xm),xp)),
file('/export/starexec/sandbox2/tmp/tmpzn75yk/sel_theBenchmark.p_1',m__2306) ).
fof(49,negated_conjecture,
~ ? [X1] :
( aNaturalNumber0(X1)
& doDivides0(X1,xk)
& isPrime0(X1) ),
inference(assume_negation,[status(cth)],[31]) ).
fof(52,plain,
( ~ equal(xk,sz00)
& ~ equal(xk,sz10) ),
inference(fof_nnf,[status(thm)],[1]) ).
cnf(53,plain,
xk != sz10,
inference(split_conjunct,[status(thm)],[52]) ).
cnf(54,plain,
xk != sz00,
inference(split_conjunct,[status(thm)],[52]) ).
cnf(60,plain,
doDivides0(xp,sdtasdt0(xn,xm)),
inference(split_conjunct,[status(thm)],[3]) ).
cnf(61,plain,
isPrime0(xp),
inference(split_conjunct,[status(thm)],[3]) ).
cnf(117,plain,
aNaturalNumber0(xp),
inference(split_conjunct,[status(thm)],[19]) ).
cnf(118,plain,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[19]) ).
cnf(119,plain,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[19]) ).
fof(155,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)],[27]) ).
fof(156,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)],[155]) ).
fof(157,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)],[156]) ).
fof(158,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)],[157]) ).
cnf(161,plain,
( X2 = sz00
| aNaturalNumber0(X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ doDivides0(X2,X1)
| X3 != sdtsldt0(X1,X2) ),
inference(split_conjunct,[status(thm)],[158]) ).
fof(172,negated_conjecture,
! [X1] :
( ~ aNaturalNumber0(X1)
| ~ doDivides0(X1,xk)
| ~ isPrime0(X1) ),
inference(fof_nnf,[status(thm)],[49]) ).
fof(173,negated_conjecture,
! [X2] :
( ~ aNaturalNumber0(X2)
| ~ doDivides0(X2,xk)
| ~ isPrime0(X2) ),
inference(variable_rename,[status(thm)],[172]) ).
cnf(174,negated_conjecture,
( ~ isPrime0(X1)
| ~ doDivides0(X1,xk)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[173]) ).
fof(193,plain,
! [X1,X2] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| aNaturalNumber0(sdtasdt0(X1,X2)) ),
inference(fof_nnf,[status(thm)],[36]) ).
fof(194,plain,
! [X3,X4] :
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4)
| aNaturalNumber0(sdtasdt0(X3,X4)) ),
inference(variable_rename,[status(thm)],[193]) ).
cnf(195,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[194]) ).
fof(196,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)],[37]) ).
fof(197,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)],[196]) ).
fof(198,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)],[197]) ).
fof(199,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)],[198]) ).
fof(200,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)],[199]) ).
cnf(206,plain,
( ~ aNaturalNumber0(X1)
| ~ isPrime0(X1)
| X1 != sz00 ),
inference(split_conjunct,[status(thm)],[200]) ).
fof(212,plain,
! [X1] :
( ~ aNaturalNumber0(X1)
| equal(X1,sz00)
| equal(X1,sz10)
| ? [X2] :
( aNaturalNumber0(X2)
& doDivides0(X2,X1)
& isPrime0(X2) ) ),
inference(fof_nnf,[status(thm)],[40]) ).
fof(213,plain,
! [X3] :
( ~ aNaturalNumber0(X3)
| equal(X3,sz00)
| equal(X3,sz10)
| ? [X4] :
( aNaturalNumber0(X4)
& doDivides0(X4,X3)
& isPrime0(X4) ) ),
inference(variable_rename,[status(thm)],[212]) ).
fof(214,plain,
! [X3] :
( ~ aNaturalNumber0(X3)
| equal(X3,sz00)
| equal(X3,sz10)
| ( aNaturalNumber0(esk4_1(X3))
& doDivides0(esk4_1(X3),X3)
& isPrime0(esk4_1(X3)) ) ),
inference(skolemize,[status(esa)],[213]) ).
fof(215,plain,
! [X3] :
( ( aNaturalNumber0(esk4_1(X3))
| ~ aNaturalNumber0(X3)
| equal(X3,sz00)
| equal(X3,sz10) )
& ( doDivides0(esk4_1(X3),X3)
| ~ aNaturalNumber0(X3)
| equal(X3,sz00)
| equal(X3,sz10) )
& ( isPrime0(esk4_1(X3))
| ~ aNaturalNumber0(X3)
| equal(X3,sz00)
| equal(X3,sz10) ) ),
inference(distribute,[status(thm)],[214]) ).
cnf(216,plain,
( X1 = sz10
| X1 = sz00
| isPrime0(esk4_1(X1))
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[215]) ).
cnf(217,plain,
( X1 = sz10
| X1 = sz00
| doDivides0(esk4_1(X1),X1)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[215]) ).
cnf(218,plain,
( X1 = sz10
| X1 = sz00
| aNaturalNumber0(esk4_1(X1))
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[215]) ).
cnf(227,plain,
xk = sdtsldt0(sdtasdt0(xn,xm),xp),
inference(split_conjunct,[status(thm)],[43]) ).
cnf(246,plain,
( sz00 != xp
| ~ aNaturalNumber0(xp) ),
inference(spm,[status(thm)],[206,61,theory(equality)]) ).
cnf(247,plain,
( sz00 != xp
| $false ),
inference(rw,[status(thm)],[246,117,theory(equality)]) ).
cnf(248,plain,
sz00 != xp,
inference(cn,[status(thm)],[247,theory(equality)]) ).
cnf(277,negated_conjecture,
( sz10 = X1
| sz00 = X1
| ~ doDivides0(esk4_1(X1),xk)
| ~ aNaturalNumber0(esk4_1(X1))
| ~ aNaturalNumber0(X1) ),
inference(spm,[status(thm)],[174,216,theory(equality)]) ).
cnf(429,plain,
( sz00 = X1
| aNaturalNumber0(sdtsldt0(X2,X1))
| ~ doDivides0(X1,X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(er,[status(thm)],[161,theory(equality)]) ).
cnf(1017,negated_conjecture,
( sz10 = X1
| sz00 = X1
| ~ doDivides0(esk4_1(X1),xk)
| ~ aNaturalNumber0(X1) ),
inference(csr,[status(thm)],[277,218]) ).
cnf(1018,negated_conjecture,
( sz00 = xk
| sz10 = xk
| ~ aNaturalNumber0(xk) ),
inference(spm,[status(thm)],[1017,217,theory(equality)]) ).
cnf(1020,negated_conjecture,
( xk = sz10
| ~ aNaturalNumber0(xk) ),
inference(sr,[status(thm)],[1018,54,theory(equality)]) ).
cnf(1021,negated_conjecture,
~ aNaturalNumber0(xk),
inference(sr,[status(thm)],[1020,53,theory(equality)]) ).
cnf(4024,plain,
( sz00 = xp
| aNaturalNumber0(xk)
| ~ doDivides0(xp,sdtasdt0(xn,xm))
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(sdtasdt0(xn,xm)) ),
inference(spm,[status(thm)],[429,227,theory(equality)]) ).
cnf(4042,plain,
( sz00 = xp
| aNaturalNumber0(xk)
| $false
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(sdtasdt0(xn,xm)) ),
inference(rw,[status(thm)],[4024,60,theory(equality)]) ).
cnf(4043,plain,
( sz00 = xp
| aNaturalNumber0(xk)
| $false
| $false
| ~ aNaturalNumber0(sdtasdt0(xn,xm)) ),
inference(rw,[status(thm)],[4042,117,theory(equality)]) ).
cnf(4044,plain,
( sz00 = xp
| aNaturalNumber0(xk)
| ~ aNaturalNumber0(sdtasdt0(xn,xm)) ),
inference(cn,[status(thm)],[4043,theory(equality)]) ).
cnf(4045,plain,
( aNaturalNumber0(xk)
| ~ aNaturalNumber0(sdtasdt0(xn,xm)) ),
inference(sr,[status(thm)],[4044,248,theory(equality)]) ).
cnf(4046,plain,
~ aNaturalNumber0(sdtasdt0(xn,xm)),
inference(sr,[status(thm)],[4045,1021,theory(equality)]) ).
cnf(4069,plain,
( ~ aNaturalNumber0(xm)
| ~ aNaturalNumber0(xn) ),
inference(spm,[status(thm)],[4046,195,theory(equality)]) ).
cnf(4071,plain,
( $false
| ~ aNaturalNumber0(xn) ),
inference(rw,[status(thm)],[4069,118,theory(equality)]) ).
cnf(4072,plain,
( $false
| $false ),
inference(rw,[status(thm)],[4071,119,theory(equality)]) ).
cnf(4073,plain,
$false,
inference(cn,[status(thm)],[4072,theory(equality)]) ).
cnf(4074,plain,
$false,
4073,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM500+1 : TPTP v7.0.0. Released v4.0.0.
% 0.02/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.02/0.23 % Computer : n132.star.cs.uiowa.edu
% 0.02/0.23 % Model : x86_64 x86_64
% 0.02/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.23 % Memory : 32218.625MB
% 0.02/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.02/0.23 % CPULimit : 300
% 0.02/0.23 % DateTime : Fri Jan 5 05:57:15 CST 2018
% 0.02/0.23 % CPUTime :
% 0.06/0.28 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.28 --creating new selector for []
% 0.06/0.41 -running prover on /export/starexec/sandbox2/tmp/tmpzn75yk/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.41 -running prover with command ['/export/starexec/sandbox2/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/export/starexec/sandbox2/tmp/tmpzn75yk/sel_theBenchmark.p_1']
% 0.06/0.41 -prover status Theorem
% 0.06/0.41 Problem theBenchmark.p solved in phase 0.
% 0.06/0.41 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.41 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.41 Solved 1 out of 1.
% 0.06/0.41 # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.41 # SZS status Theorem
% 0.06/0.41 # SZS output start CNFRefutation.
% See solution above
% 0.06/0.41 # SZS output end CNFRefutation
%------------------------------------------------------------------------------