%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM523+3 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n033.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:39 EST 2018
% Result : Theorem 0.06s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 7
% Syntax : Number of formulae : 61 ( 12 unt; 0 def)
% Number of atoms : 271 ( 5 equ)
% Maximal formula atoms : 13 ( 4 avg)
% Number of connectives : 367 ( 157 ~; 152 |; 52 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 72 ( 0 sgn 49 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(7,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2)
& aNaturalNumber0(X3) )
=> ( ( isPrime0(X3)
& doDivides0(X3,sdtasdt0(X1,X2)) )
=> ( doDivides0(X3,X1)
| doDivides0(X3,X2) ) ) ),
file('/export/starexec/sandbox2/tmp/tmpdwk7yQ/sel_theBenchmark.p_1',mPDP) ).
fof(9,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( doDivides0(X1,X2)
<=> ? [X3] :
( aNaturalNumber0(X3)
& equal(X2,sdtasdt0(X1,X3)) ) ) ),
file('/export/starexec/sandbox2/tmp/tmpdwk7yQ/sel_theBenchmark.p_1',mDefDiv) ).
fof(14,axiom,
equal(sdtasdt0(xp,sdtasdt0(xm,xm)),sdtasdt0(xn,xn)),
file('/export/starexec/sandbox2/tmp/tmpdwk7yQ/sel_theBenchmark.p_1',m__3014) ).
fof(27,conjecture,
( ( ? [X1] :
( aNaturalNumber0(X1)
& equal(sdtasdt0(xn,xn),sdtasdt0(xp,X1)) )
| doDivides0(xp,sdtasdt0(xn,xn)) )
& ( ? [X1] :
( aNaturalNumber0(X1)
& equal(xn,sdtasdt0(xp,X1)) )
| doDivides0(xp,xn) ) ),
file('/export/starexec/sandbox2/tmp/tmpdwk7yQ/sel_theBenchmark.p_1',m__) ).
fof(32,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmpdwk7yQ/sel_theBenchmark.p_1',mSortsB_02) ).
fof(41,axiom,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xp)
& ~ equal(xn,sz00)
& ~ equal(xm,sz00)
& ~ equal(xp,sz00) ),
file('/export/starexec/sandbox2/tmp/tmpdwk7yQ/sel_theBenchmark.p_1',m__2987) ).
fof(44,axiom,
( ~ equal(xp,sz10)
& ! [X1] :
( ( aNaturalNumber0(X1)
& ( ? [X2] :
( aNaturalNumber0(X2)
& equal(xp,sdtasdt0(X1,X2)) )
| doDivides0(X1,xp) ) )
=> ( equal(X1,sz10)
| equal(X1,xp) ) )
& isPrime0(xp) ),
file('/export/starexec/sandbox2/tmp/tmpdwk7yQ/sel_theBenchmark.p_1',m__3025) ).
fof(45,negated_conjecture,
~ ( ( ? [X1] :
( aNaturalNumber0(X1)
& equal(sdtasdt0(xn,xn),sdtasdt0(xp,X1)) )
| doDivides0(xp,sdtasdt0(xn,xn)) )
& ( ? [X1] :
( aNaturalNumber0(X1)
& equal(xn,sdtasdt0(xp,X1)) )
| doDivides0(xp,xn) ) ),
inference(assume_negation,[status(cth)],[27]) ).
fof(77,plain,
! [X1,X2,X3] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ isPrime0(X3)
| ~ doDivides0(X3,sdtasdt0(X1,X2))
| doDivides0(X3,X1)
| doDivides0(X3,X2) ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(78,plain,
! [X4,X5,X6] :
( ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ~ aNaturalNumber0(X6)
| ~ isPrime0(X6)
| ~ doDivides0(X6,sdtasdt0(X4,X5))
| doDivides0(X6,X4)
| doDivides0(X6,X5) ),
inference(variable_rename,[status(thm)],[77]) ).
cnf(79,plain,
( doDivides0(X1,X2)
| doDivides0(X1,X3)
| ~ doDivides0(X1,sdtasdt0(X3,X2))
| ~ isPrime0(X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3) ),
inference(split_conjunct,[status(thm)],[78]) ).
fof(85,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)],[9]) ).
fof(86,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)],[85]) ).
fof(87,plain,
! [X4,X5] :
( ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ( ( ~ doDivides0(X4,X5)
| ( aNaturalNumber0(esk3_2(X4,X5))
& equal(X5,sdtasdt0(X4,esk3_2(X4,X5))) ) )
& ( ! [X7] :
( ~ aNaturalNumber0(X7)
| ~ equal(X5,sdtasdt0(X4,X7)) )
| doDivides0(X4,X5) ) ) ),
inference(skolemize,[status(esa)],[86]) ).
fof(88,plain,
! [X4,X5,X7] :
( ( ( ~ aNaturalNumber0(X7)
| ~ equal(X5,sdtasdt0(X4,X7))
| doDivides0(X4,X5) )
& ( ~ doDivides0(X4,X5)
| ( aNaturalNumber0(esk3_2(X4,X5))
& equal(X5,sdtasdt0(X4,esk3_2(X4,X5))) ) ) )
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) ),
inference(shift_quantors,[status(thm)],[87]) ).
fof(89,plain,
! [X4,X5,X7] :
( ( ~ aNaturalNumber0(X7)
| ~ equal(X5,sdtasdt0(X4,X7))
| doDivides0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( aNaturalNumber0(esk3_2(X4,X5))
| ~ doDivides0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( equal(X5,sdtasdt0(X4,esk3_2(X4,X5)))
| ~ doDivides0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) ) ),
inference(distribute,[status(thm)],[88]) ).
cnf(92,plain,
( doDivides0(X2,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| X1 != sdtasdt0(X2,X3)
| ~ aNaturalNumber0(X3) ),
inference(split_conjunct,[status(thm)],[89]) ).
cnf(107,plain,
sdtasdt0(xp,sdtasdt0(xm,xm)) = sdtasdt0(xn,xn),
inference(split_conjunct,[status(thm)],[14]) ).
fof(163,negated_conjecture,
( ( ! [X1] :
( ~ aNaturalNumber0(X1)
| ~ equal(sdtasdt0(xn,xn),sdtasdt0(xp,X1)) )
& ~ doDivides0(xp,sdtasdt0(xn,xn)) )
| ( ! [X1] :
( ~ aNaturalNumber0(X1)
| ~ equal(xn,sdtasdt0(xp,X1)) )
& ~ doDivides0(xp,xn) ) ),
inference(fof_nnf,[status(thm)],[45]) ).
fof(164,negated_conjecture,
( ( ! [X2] :
( ~ aNaturalNumber0(X2)
| ~ equal(sdtasdt0(xn,xn),sdtasdt0(xp,X2)) )
& ~ doDivides0(xp,sdtasdt0(xn,xn)) )
| ( ! [X3] :
( ~ aNaturalNumber0(X3)
| ~ equal(xn,sdtasdt0(xp,X3)) )
& ~ doDivides0(xp,xn) ) ),
inference(variable_rename,[status(thm)],[163]) ).
fof(165,negated_conjecture,
! [X2,X3] :
( ( ( ~ aNaturalNumber0(X3)
| ~ equal(xn,sdtasdt0(xp,X3)) )
& ~ doDivides0(xp,xn) )
| ( ( ~ aNaturalNumber0(X2)
| ~ equal(sdtasdt0(xn,xn),sdtasdt0(xp,X2)) )
& ~ doDivides0(xp,sdtasdt0(xn,xn)) ) ),
inference(shift_quantors,[status(thm)],[164]) ).
fof(166,negated_conjecture,
! [X2,X3] :
( ( ~ aNaturalNumber0(X2)
| ~ equal(sdtasdt0(xn,xn),sdtasdt0(xp,X2))
| ~ aNaturalNumber0(X3)
| ~ equal(xn,sdtasdt0(xp,X3)) )
& ( ~ doDivides0(xp,sdtasdt0(xn,xn))
| ~ aNaturalNumber0(X3)
| ~ equal(xn,sdtasdt0(xp,X3)) )
& ( ~ aNaturalNumber0(X2)
| ~ equal(sdtasdt0(xn,xn),sdtasdt0(xp,X2))
| ~ doDivides0(xp,xn) )
& ( ~ doDivides0(xp,sdtasdt0(xn,xn))
| ~ doDivides0(xp,xn) ) ),
inference(distribute,[status(thm)],[165]) ).
cnf(167,negated_conjecture,
( ~ doDivides0(xp,xn)
| ~ doDivides0(xp,sdtasdt0(xn,xn)) ),
inference(split_conjunct,[status(thm)],[166]) ).
fof(189,plain,
! [X1,X2] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| aNaturalNumber0(sdtasdt0(X1,X2)) ),
inference(fof_nnf,[status(thm)],[32]) ).
fof(190,plain,
! [X3,X4] :
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4)
| aNaturalNumber0(sdtasdt0(X3,X4)) ),
inference(variable_rename,[status(thm)],[189]) ).
cnf(191,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[190]) ).
cnf(233,plain,
aNaturalNumber0(xp),
inference(split_conjunct,[status(thm)],[41]) ).
cnf(234,plain,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[41]) ).
cnf(235,plain,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[41]) ).
fof(246,plain,
( ~ equal(xp,sz10)
& ! [X1] :
( ~ aNaturalNumber0(X1)
| ( ! [X2] :
( ~ aNaturalNumber0(X2)
| ~ equal(xp,sdtasdt0(X1,X2)) )
& ~ doDivides0(X1,xp) )
| equal(X1,sz10)
| equal(X1,xp) )
& isPrime0(xp) ),
inference(fof_nnf,[status(thm)],[44]) ).
fof(247,plain,
( ~ equal(xp,sz10)
& ! [X3] :
( ~ aNaturalNumber0(X3)
| ( ! [X4] :
( ~ aNaturalNumber0(X4)
| ~ equal(xp,sdtasdt0(X3,X4)) )
& ~ doDivides0(X3,xp) )
| equal(X3,sz10)
| equal(X3,xp) )
& isPrime0(xp) ),
inference(variable_rename,[status(thm)],[246]) ).
fof(248,plain,
! [X3,X4] :
( ( ( ( ~ aNaturalNumber0(X4)
| ~ equal(xp,sdtasdt0(X3,X4)) )
& ~ doDivides0(X3,xp) )
| ~ aNaturalNumber0(X3)
| equal(X3,sz10)
| equal(X3,xp) )
& ~ equal(xp,sz10)
& isPrime0(xp) ),
inference(shift_quantors,[status(thm)],[247]) ).
fof(249,plain,
! [X3,X4] :
( ( ~ aNaturalNumber0(X4)
| ~ equal(xp,sdtasdt0(X3,X4))
| ~ aNaturalNumber0(X3)
| equal(X3,sz10)
| equal(X3,xp) )
& ( ~ doDivides0(X3,xp)
| ~ aNaturalNumber0(X3)
| equal(X3,sz10)
| equal(X3,xp) )
& ~ equal(xp,sz10)
& isPrime0(xp) ),
inference(distribute,[status(thm)],[248]) ).
cnf(250,plain,
isPrime0(xp),
inference(split_conjunct,[status(thm)],[249]) ).
cnf(268,plain,
( aNaturalNumber0(sdtasdt0(xn,xn))
| ~ aNaturalNumber0(sdtasdt0(xm,xm))
| ~ aNaturalNumber0(xp) ),
inference(spm,[status(thm)],[191,107,theory(equality)]) ).
cnf(269,plain,
( aNaturalNumber0(sdtasdt0(xn,xn))
| ~ aNaturalNumber0(sdtasdt0(xm,xm))
| $false ),
inference(rw,[status(thm)],[268,233,theory(equality)]) ).
cnf(270,plain,
( aNaturalNumber0(sdtasdt0(xn,xn))
| ~ aNaturalNumber0(sdtasdt0(xm,xm)) ),
inference(cn,[status(thm)],[269,theory(equality)]) ).
cnf(391,plain,
( doDivides0(X1,sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(sdtasdt0(X1,X2)) ),
inference(er,[status(thm)],[92,theory(equality)]) ).
cnf(392,plain,
( doDivides0(xp,X1)
| sdtasdt0(xn,xn) != X1
| ~ aNaturalNumber0(sdtasdt0(xm,xm))
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(X1) ),
inference(spm,[status(thm)],[92,107,theory(equality)]) ).
cnf(399,plain,
( doDivides0(xp,X1)
| sdtasdt0(xn,xn) != X1
| ~ aNaturalNumber0(sdtasdt0(xm,xm))
| $false
| ~ aNaturalNumber0(X1) ),
inference(rw,[status(thm)],[392,233,theory(equality)]) ).
cnf(400,plain,
( doDivides0(xp,X1)
| sdtasdt0(xn,xn) != X1
| ~ aNaturalNumber0(sdtasdt0(xm,xm))
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[399,theory(equality)]) ).
cnf(1169,plain,
( aNaturalNumber0(sdtasdt0(xn,xn))
| ~ aNaturalNumber0(xm) ),
inference(spm,[status(thm)],[270,191,theory(equality)]) ).
cnf(1172,plain,
( aNaturalNumber0(sdtasdt0(xn,xn))
| $false ),
inference(rw,[status(thm)],[1169,234,theory(equality)]) ).
cnf(1173,plain,
aNaturalNumber0(sdtasdt0(xn,xn)),
inference(cn,[status(thm)],[1172,theory(equality)]) ).
cnf(2141,plain,
( ~ doDivides0(xp,xn)
| ~ aNaturalNumber0(sdtasdt0(xm,xm))
| ~ aNaturalNumber0(sdtasdt0(xn,xn)) ),
inference(spm,[status(thm)],[167,400,theory(equality)]) ).
cnf(2152,plain,
( ~ doDivides0(xp,xn)
| ~ aNaturalNumber0(sdtasdt0(xm,xm))
| $false ),
inference(rw,[status(thm)],[2141,1173,theory(equality)]) ).
cnf(2153,plain,
( ~ doDivides0(xp,xn)
| ~ aNaturalNumber0(sdtasdt0(xm,xm)) ),
inference(cn,[status(thm)],[2152,theory(equality)]) ).
cnf(2594,plain,
( doDivides0(X1,sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(csr,[status(thm)],[391,191]) ).
cnf(2595,plain,
( doDivides0(xp,sdtasdt0(xn,xn))
| ~ aNaturalNumber0(sdtasdt0(xm,xm))
| ~ aNaturalNumber0(xp) ),
inference(spm,[status(thm)],[2594,107,theory(equality)]) ).
cnf(2613,plain,
( doDivides0(xp,sdtasdt0(xn,xn))
| ~ aNaturalNumber0(sdtasdt0(xm,xm))
| $false ),
inference(rw,[status(thm)],[2595,233,theory(equality)]) ).
cnf(2614,plain,
( doDivides0(xp,sdtasdt0(xn,xn))
| ~ aNaturalNumber0(sdtasdt0(xm,xm)) ),
inference(cn,[status(thm)],[2613,theory(equality)]) ).
cnf(2717,plain,
( doDivides0(xp,xn)
| ~ isPrime0(xp)
| ~ aNaturalNumber0(xn)
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(sdtasdt0(xm,xm)) ),
inference(spm,[status(thm)],[79,2614,theory(equality)]) ).
cnf(2735,plain,
( doDivides0(xp,xn)
| $false
| ~ aNaturalNumber0(xn)
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(sdtasdt0(xm,xm)) ),
inference(rw,[status(thm)],[2717,250,theory(equality)]) ).
cnf(2736,plain,
( doDivides0(xp,xn)
| $false
| $false
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(sdtasdt0(xm,xm)) ),
inference(rw,[status(thm)],[2735,235,theory(equality)]) ).
cnf(2737,plain,
( doDivides0(xp,xn)
| $false
| $false
| $false
| ~ aNaturalNumber0(sdtasdt0(xm,xm)) ),
inference(rw,[status(thm)],[2736,233,theory(equality)]) ).
cnf(2738,plain,
( doDivides0(xp,xn)
| ~ aNaturalNumber0(sdtasdt0(xm,xm)) ),
inference(cn,[status(thm)],[2737,theory(equality)]) ).
cnf(2744,plain,
~ aNaturalNumber0(sdtasdt0(xm,xm)),
inference(csr,[status(thm)],[2738,2153]) ).
cnf(2745,plain,
~ aNaturalNumber0(xm),
inference(spm,[status(thm)],[2744,191,theory(equality)]) ).
cnf(2750,plain,
$false,
inference(rw,[status(thm)],[2745,234,theory(equality)]) ).
cnf(2751,plain,
$false,
inference(cn,[status(thm)],[2750,theory(equality)]) ).
cnf(2752,plain,
$false,
2751,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM523+3 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.03 % Command : Source/sine.py -e eprover -t %d %s
% 0.02/0.22 % Computer : n033.star.cs.uiowa.edu
% 0.02/0.22 % Model : x86_64 x86_64
% 0.02/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.22 % Memory : 32218.625MB
% 0.02/0.22 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.02/0.22 % CPULimit : 300
% 0.02/0.22 % DateTime : Fri Jan 5 07:04:45 CST 2018
% 0.02/0.22 % CPUTime :
% 0.02/0.27 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.02/0.27 --creating new selector for []
% 0.06/0.38 -running prover on /export/starexec/sandbox2/tmp/tmpdwk7yQ/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.38 -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/tmpdwk7yQ/sel_theBenchmark.p_1']
% 0.06/0.38 -prover status Theorem
% 0.06/0.38 Problem theBenchmark.p solved in phase 0.
% 0.06/0.38 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.38 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.38 Solved 1 out of 1.
% 0.06/0.38 # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.38 # SZS status Theorem
% 0.06/0.38 # SZS output start CNFRefutation.
% See solution above
% 0.06/0.39 # SZS output end CNFRefutation
%------------------------------------------------------------------------------