TSTP Solution File: NUM505+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM505+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:35 EST 2018
% Result : Theorem 0.07s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 8
% Syntax : Number of formulae : 59 ( 16 unt; 0 def)
% Number of atoms : 284 ( 15 equ)
% Maximal formula atoms : 32 ( 4 avg)
% Number of connectives : 365 ( 140 ~; 157 |; 57 &)
% ( 2 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 54 ( 0 sgn 41 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,axiom,
( isPrime0(xp)
& doDivides0(xp,sdtasdt0(xn,xm)) ),
file('/export/starexec/sandbox2/tmp/tmp3WqsFp/sel_theBenchmark.p_1',m__1860) ).
fof(14,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( sdtlseqdt0(X1,X2)
| ( ~ equal(X2,X1)
& sdtlseqdt0(X2,X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp3WqsFp/sel_theBenchmark.p_1',mLETotal) ).
fof(20,axiom,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xp) ),
file('/export/starexec/sandbox2/tmp/tmp3WqsFp/sel_theBenchmark.p_1',m__1837) ).
fof(28,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/tmp3WqsFp/sel_theBenchmark.p_1',mDefQuot) ).
fof(32,conjecture,
( ~ sdtlseqdt0(xp,xk)
=> ( ~ equal(xk,xp)
& sdtlseqdt0(xk,xp) ) ),
file('/export/starexec/sandbox2/tmp/tmp3WqsFp/sel_theBenchmark.p_1',m__) ).
fof(37,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmp3WqsFp/sel_theBenchmark.p_1',mSortsB_02) ).
fof(38,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/tmp3WqsFp/sel_theBenchmark.p_1',mDefPrime) ).
fof(44,axiom,
equal(xk,sdtsldt0(sdtasdt0(xn,xm),xp)),
file('/export/starexec/sandbox2/tmp/tmp3WqsFp/sel_theBenchmark.p_1',m__2306) ).
fof(51,negated_conjecture,
~ ( ~ sdtlseqdt0(xp,xk)
=> ( ~ equal(xk,xp)
& sdtlseqdt0(xk,xp) ) ),
inference(assume_negation,[status(cth)],[32]) ).
fof(53,negated_conjecture,
~ ( ~ sdtlseqdt0(xp,xk)
=> ( ~ equal(xk,xp)
& sdtlseqdt0(xk,xp) ) ),
inference(fof_simplification,[status(thm)],[51,theory(equality)]) ).
cnf(63,plain,
doDivides0(xp,sdtasdt0(xn,xm)),
inference(split_conjunct,[status(thm)],[3]) ).
cnf(64,plain,
isPrime0(xp),
inference(split_conjunct,[status(thm)],[3]) ).
fof(104,plain,
! [X1,X2] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| sdtlseqdt0(X1,X2)
| ( ~ equal(X2,X1)
& sdtlseqdt0(X2,X1) ) ),
inference(fof_nnf,[status(thm)],[14]) ).
fof(105,plain,
! [X3,X4] :
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4)
| sdtlseqdt0(X3,X4)
| ( ~ equal(X4,X3)
& sdtlseqdt0(X4,X3) ) ),
inference(variable_rename,[status(thm)],[104]) ).
fof(106,plain,
! [X3,X4] :
( ( ~ equal(X4,X3)
| sdtlseqdt0(X3,X4)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4) )
& ( sdtlseqdt0(X4,X3)
| sdtlseqdt0(X3,X4)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4) ) ),
inference(distribute,[status(thm)],[105]) ).
cnf(107,plain,
( sdtlseqdt0(X2,X1)
| sdtlseqdt0(X1,X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[106]) ).
cnf(123,plain,
aNaturalNumber0(xp),
inference(split_conjunct,[status(thm)],[20]) ).
cnf(124,plain,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[20]) ).
cnf(125,plain,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[20]) ).
fof(161,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)],[28]) ).
fof(162,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)],[161]) ).
fof(163,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)],[162]) ).
fof(164,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)],[163]) ).
cnf(167,plain,
( X2 = sz00
| aNaturalNumber0(X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ doDivides0(X2,X1)
| X3 != sdtsldt0(X1,X2) ),
inference(split_conjunct,[status(thm)],[164]) ).
fof(178,negated_conjecture,
( ~ sdtlseqdt0(xp,xk)
& ( equal(xk,xp)
| ~ sdtlseqdt0(xk,xp) ) ),
inference(fof_nnf,[status(thm)],[53]) ).
cnf(179,negated_conjecture,
( xk = xp
| ~ sdtlseqdt0(xk,xp) ),
inference(split_conjunct,[status(thm)],[178]) ).
cnf(180,negated_conjecture,
~ sdtlseqdt0(xp,xk),
inference(split_conjunct,[status(thm)],[178]) ).
fof(199,plain,
! [X1,X2] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| aNaturalNumber0(sdtasdt0(X1,X2)) ),
inference(fof_nnf,[status(thm)],[37]) ).
fof(200,plain,
! [X3,X4] :
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4)
| aNaturalNumber0(sdtasdt0(X3,X4)) ),
inference(variable_rename,[status(thm)],[199]) ).
cnf(201,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[200]) ).
fof(202,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)],[38]) ).
fof(203,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)],[202]) ).
fof(204,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)],[203]) ).
fof(205,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)],[204]) ).
fof(206,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)],[205]) ).
cnf(212,plain,
( ~ aNaturalNumber0(X1)
| ~ isPrime0(X1)
| X1 != sz00 ),
inference(split_conjunct,[status(thm)],[206]) ).
cnf(233,plain,
xk = sdtsldt0(sdtasdt0(xn,xm),xp),
inference(split_conjunct,[status(thm)],[44]) ).
cnf(254,plain,
( sz00 != xp
| ~ aNaturalNumber0(xp) ),
inference(spm,[status(thm)],[212,64,theory(equality)]) ).
cnf(256,plain,
( sz00 != xp
| $false ),
inference(rw,[status(thm)],[254,123,theory(equality)]) ).
cnf(257,plain,
sz00 != xp,
inference(cn,[status(thm)],[256,theory(equality)]) ).
cnf(268,plain,
( sdtlseqdt0(X1,xp)
| sdtlseqdt0(xp,X1)
| ~ aNaturalNumber0(X1) ),
inference(spm,[status(thm)],[107,123,theory(equality)]) ).
cnf(514,plain,
( sz00 = X1
| aNaturalNumber0(sdtsldt0(X2,X1))
| ~ doDivides0(X1,X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(er,[status(thm)],[167,theory(equality)]) ).
cnf(1024,plain,
sdtlseqdt0(xp,xp),
inference(spm,[status(thm)],[268,123,theory(equality)]) ).
cnf(5592,plain,
( sz00 = xp
| aNaturalNumber0(xk)
| ~ doDivides0(xp,sdtasdt0(xn,xm))
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(sdtasdt0(xn,xm)) ),
inference(spm,[status(thm)],[514,233,theory(equality)]) ).
cnf(5607,plain,
( sz00 = xp
| aNaturalNumber0(xk)
| $false
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(sdtasdt0(xn,xm)) ),
inference(rw,[status(thm)],[5592,63,theory(equality)]) ).
cnf(5608,plain,
( sz00 = xp
| aNaturalNumber0(xk)
| $false
| $false
| ~ aNaturalNumber0(sdtasdt0(xn,xm)) ),
inference(rw,[status(thm)],[5607,123,theory(equality)]) ).
cnf(5609,plain,
( sz00 = xp
| aNaturalNumber0(xk)
| ~ aNaturalNumber0(sdtasdt0(xn,xm)) ),
inference(cn,[status(thm)],[5608,theory(equality)]) ).
cnf(5610,plain,
( aNaturalNumber0(xk)
| ~ aNaturalNumber0(sdtasdt0(xn,xm)) ),
inference(sr,[status(thm)],[5609,257,theory(equality)]) ).
cnf(5614,plain,
( aNaturalNumber0(xk)
| ~ aNaturalNumber0(xm)
| ~ aNaturalNumber0(xn) ),
inference(spm,[status(thm)],[5610,201,theory(equality)]) ).
cnf(5616,plain,
( aNaturalNumber0(xk)
| $false
| ~ aNaturalNumber0(xn) ),
inference(rw,[status(thm)],[5614,124,theory(equality)]) ).
cnf(5617,plain,
( aNaturalNumber0(xk)
| $false
| $false ),
inference(rw,[status(thm)],[5616,125,theory(equality)]) ).
cnf(5618,plain,
aNaturalNumber0(xk),
inference(cn,[status(thm)],[5617,theory(equality)]) ).
cnf(5620,plain,
( sdtlseqdt0(xp,xk)
| sdtlseqdt0(xk,xp) ),
inference(spm,[status(thm)],[268,5618,theory(equality)]) ).
cnf(5721,plain,
sdtlseqdt0(xk,xp),
inference(sr,[status(thm)],[5620,180,theory(equality)]) ).
cnf(5727,negated_conjecture,
( xk = xp
| $false ),
inference(rw,[status(thm)],[179,5721,theory(equality)]) ).
cnf(5728,negated_conjecture,
xk = xp,
inference(cn,[status(thm)],[5727,theory(equality)]) ).
cnf(5751,negated_conjecture,
$false,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[180,5728,theory(equality)]),1024,theory(equality)]) ).
cnf(5752,negated_conjecture,
$false,
inference(cn,[status(thm)],[5751,theory(equality)]) ).
cnf(5753,negated_conjecture,
$false,
5752,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM505+1 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.02/0.24 % Computer : n044.star.cs.uiowa.edu
% 0.02/0.24 % Model : x86_64 x86_64
% 0.02/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.24 % Memory : 32218.625MB
% 0.02/0.24 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.02/0.24 % CPULimit : 300
% 0.02/0.24 % DateTime : Mon Jan 8 08:11:12 CST 2018
% 0.02/0.24 % CPUTime :
% 0.02/0.28 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.02/0.28 --creating new selector for []
% 0.07/0.46 -running prover on /export/starexec/sandbox2/tmp/tmp3WqsFp/sel_theBenchmark.p_1 with time limit 29
% 0.07/0.46 -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/tmp3WqsFp/sel_theBenchmark.p_1']
% 0.07/0.46 -prover status Theorem
% 0.07/0.46 Problem theBenchmark.p solved in phase 0.
% 0.07/0.46 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.46 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.46 Solved 1 out of 1.
% 0.07/0.46 # Problem is unsatisfiable (or provable), constructing proof object
% 0.07/0.46 # SZS status Theorem
% 0.07/0.46 # SZS output start CNFRefutation.
% See solution above
% 0.07/0.46 # SZS output end CNFRefutation
%------------------------------------------------------------------------------