TSTP Solution File: NUM482+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM482+3 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n139.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:30 EST 2018
% Result : Theorem 0.06s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 5
% Syntax : Number of formulae : 36 ( 9 unt; 0 def)
% Number of atoms : 307 ( 5 equ)
% Maximal formula atoms : 83 ( 8 avg)
% Number of connectives : 425 ( 154 ~; 167 |; 95 &)
% ( 1 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 72 ( 0 sgn 45 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(7,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( doDivides0(X1,X2)
<=> ? [X3] :
( aNaturalNumber0(X3)
& equal(X2,sdtasdt0(X1,X3)) ) ) ),
file('/export/starexec/sandbox2/tmp/tmpSn1Lop/sel_theBenchmark.p_1',mDefDiv) ).
fof(24,axiom,
aNaturalNumber0(xk),
file('/export/starexec/sandbox2/tmp/tmpSn1Lop/sel_theBenchmark.p_1',m__1716) ).
fof(25,axiom,
( aNaturalNumber0(sz10)
& ~ equal(sz10,sz00) ),
file('/export/starexec/sandbox2/tmp/tmpSn1Lop/sel_theBenchmark.p_1',mSortsC_01) ).
fof(26,conjecture,
( ( ! [X1] :
( ( aNaturalNumber0(X1)
& ( ? [X2] :
( aNaturalNumber0(X2)
& equal(xk,sdtasdt0(X1,X2)) )
| doDivides0(X1,xk) ) )
=> ( equal(X1,sz10)
| equal(X1,xk) ) )
& isPrime0(xk) )
=> ? [X1] :
( aNaturalNumber0(X1)
& ( ? [X2] :
( aNaturalNumber0(X2)
& equal(xk,sdtasdt0(X1,X2)) )
| doDivides0(X1,xk) )
& ( ( ~ equal(X1,sz00)
& ~ equal(X1,sz10)
& ! [X2] :
( ( aNaturalNumber0(X2)
& ? [X3] :
( aNaturalNumber0(X3)
& equal(X1,sdtasdt0(X2,X3)) )
& doDivides0(X2,X1) )
=> ( equal(X2,sz10)
| equal(X2,X1) ) ) )
| isPrime0(X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmpSn1Lop/sel_theBenchmark.p_1',m__) ).
fof(41,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( equal(sdtasdt0(X1,sz10),X1)
& equal(X1,sdtasdt0(sz10,X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmpSn1Lop/sel_theBenchmark.p_1',m_MulUnit) ).
fof(42,negated_conjecture,
~ ( ( ! [X1] :
( ( aNaturalNumber0(X1)
& ( ? [X2] :
( aNaturalNumber0(X2)
& equal(xk,sdtasdt0(X1,X2)) )
| doDivides0(X1,xk) ) )
=> ( equal(X1,sz10)
| equal(X1,xk) ) )
& isPrime0(xk) )
=> ? [X1] :
( aNaturalNumber0(X1)
& ( ? [X2] :
( aNaturalNumber0(X2)
& equal(xk,sdtasdt0(X1,X2)) )
| doDivides0(X1,xk) )
& ( ( ~ equal(X1,sz00)
& ~ equal(X1,sz10)
& ! [X2] :
( ( aNaturalNumber0(X2)
& ? [X3] :
( aNaturalNumber0(X3)
& equal(X1,sdtasdt0(X2,X3)) )
& doDivides0(X2,X1) )
=> ( equal(X2,sz10)
| equal(X2,X1) ) ) )
| isPrime0(X1) ) ) ),
inference(assume_negation,[status(cth)],[26]) ).
fof(68,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)],[7]) ).
fof(69,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)],[68]) ).
fof(70,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)],[69]) ).
fof(71,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)],[70]) ).
fof(72,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)],[71]) ).
cnf(75,plain,
( doDivides0(X2,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| X1 != sdtasdt0(X2,X3)
| ~ aNaturalNumber0(X3) ),
inference(split_conjunct,[status(thm)],[72]) ).
cnf(145,plain,
aNaturalNumber0(xk),
inference(split_conjunct,[status(thm)],[24]) ).
cnf(147,plain,
aNaturalNumber0(sz10),
inference(split_conjunct,[status(thm)],[25]) ).
fof(148,negated_conjecture,
( ! [X1] :
( ~ aNaturalNumber0(X1)
| ( ! [X2] :
( ~ aNaturalNumber0(X2)
| ~ equal(xk,sdtasdt0(X1,X2)) )
& ~ doDivides0(X1,xk) )
| equal(X1,sz10)
| equal(X1,xk) )
& isPrime0(xk)
& ! [X1] :
( ~ aNaturalNumber0(X1)
| ( ! [X2] :
( ~ aNaturalNumber0(X2)
| ~ equal(xk,sdtasdt0(X1,X2)) )
& ~ doDivides0(X1,xk) )
| ( ( equal(X1,sz00)
| equal(X1,sz10)
| ? [X2] :
( aNaturalNumber0(X2)
& ? [X3] :
( aNaturalNumber0(X3)
& equal(X1,sdtasdt0(X2,X3)) )
& doDivides0(X2,X1)
& ~ equal(X2,sz10)
& ~ equal(X2,X1) ) )
& ~ isPrime0(X1) ) ) ),
inference(fof_nnf,[status(thm)],[42]) ).
fof(149,negated_conjecture,
( ! [X4] :
( ~ aNaturalNumber0(X4)
| ( ! [X5] :
( ~ aNaturalNumber0(X5)
| ~ equal(xk,sdtasdt0(X4,X5)) )
& ~ doDivides0(X4,xk) )
| equal(X4,sz10)
| equal(X4,xk) )
& isPrime0(xk)
& ! [X6] :
( ~ aNaturalNumber0(X6)
| ( ! [X7] :
( ~ aNaturalNumber0(X7)
| ~ equal(xk,sdtasdt0(X6,X7)) )
& ~ doDivides0(X6,xk) )
| ( ( equal(X6,sz00)
| equal(X6,sz10)
| ? [X8] :
( aNaturalNumber0(X8)
& ? [X9] :
( aNaturalNumber0(X9)
& equal(X6,sdtasdt0(X8,X9)) )
& doDivides0(X8,X6)
& ~ equal(X8,sz10)
& ~ equal(X8,X6) ) )
& ~ isPrime0(X6) ) ) ),
inference(variable_rename,[status(thm)],[148]) ).
fof(150,negated_conjecture,
( ! [X4] :
( ~ aNaturalNumber0(X4)
| ( ! [X5] :
( ~ aNaturalNumber0(X5)
| ~ equal(xk,sdtasdt0(X4,X5)) )
& ~ doDivides0(X4,xk) )
| equal(X4,sz10)
| equal(X4,xk) )
& isPrime0(xk)
& ! [X6] :
( ~ aNaturalNumber0(X6)
| ( ! [X7] :
( ~ aNaturalNumber0(X7)
| ~ equal(xk,sdtasdt0(X6,X7)) )
& ~ doDivides0(X6,xk) )
| ( ( equal(X6,sz00)
| equal(X6,sz10)
| ( aNaturalNumber0(esk3_1(X6))
& aNaturalNumber0(esk4_1(X6))
& equal(X6,sdtasdt0(esk3_1(X6),esk4_1(X6)))
& doDivides0(esk3_1(X6),X6)
& ~ equal(esk3_1(X6),sz10)
& ~ equal(esk3_1(X6),X6) ) )
& ~ isPrime0(X6) ) ) ),
inference(skolemize,[status(esa)],[149]) ).
fof(151,negated_conjecture,
! [X4,X5,X6,X7] :
( ( ( ( ~ aNaturalNumber0(X7)
| ~ equal(xk,sdtasdt0(X6,X7)) )
& ~ doDivides0(X6,xk) )
| ~ aNaturalNumber0(X6)
| ( ( equal(X6,sz00)
| equal(X6,sz10)
| ( aNaturalNumber0(esk3_1(X6))
& aNaturalNumber0(esk4_1(X6))
& equal(X6,sdtasdt0(esk3_1(X6),esk4_1(X6)))
& doDivides0(esk3_1(X6),X6)
& ~ equal(esk3_1(X6),sz10)
& ~ equal(esk3_1(X6),X6) ) )
& ~ isPrime0(X6) ) )
& ( ( ( ~ aNaturalNumber0(X5)
| ~ equal(xk,sdtasdt0(X4,X5)) )
& ~ doDivides0(X4,xk) )
| ~ aNaturalNumber0(X4)
| equal(X4,sz10)
| equal(X4,xk) )
& isPrime0(xk) ),
inference(shift_quantors,[status(thm)],[150]) ).
fof(152,negated_conjecture,
! [X4,X5,X6,X7] :
( ( aNaturalNumber0(esk3_1(X6))
| equal(X6,sz00)
| equal(X6,sz10)
| ~ aNaturalNumber0(X7)
| ~ equal(xk,sdtasdt0(X6,X7))
| ~ aNaturalNumber0(X6) )
& ( aNaturalNumber0(esk4_1(X6))
| equal(X6,sz00)
| equal(X6,sz10)
| ~ aNaturalNumber0(X7)
| ~ equal(xk,sdtasdt0(X6,X7))
| ~ aNaturalNumber0(X6) )
& ( equal(X6,sdtasdt0(esk3_1(X6),esk4_1(X6)))
| equal(X6,sz00)
| equal(X6,sz10)
| ~ aNaturalNumber0(X7)
| ~ equal(xk,sdtasdt0(X6,X7))
| ~ aNaturalNumber0(X6) )
& ( doDivides0(esk3_1(X6),X6)
| equal(X6,sz00)
| equal(X6,sz10)
| ~ aNaturalNumber0(X7)
| ~ equal(xk,sdtasdt0(X6,X7))
| ~ aNaturalNumber0(X6) )
& ( ~ equal(esk3_1(X6),sz10)
| equal(X6,sz00)
| equal(X6,sz10)
| ~ aNaturalNumber0(X7)
| ~ equal(xk,sdtasdt0(X6,X7))
| ~ aNaturalNumber0(X6) )
& ( ~ equal(esk3_1(X6),X6)
| equal(X6,sz00)
| equal(X6,sz10)
| ~ aNaturalNumber0(X7)
| ~ equal(xk,sdtasdt0(X6,X7))
| ~ aNaturalNumber0(X6) )
& ( ~ isPrime0(X6)
| ~ aNaturalNumber0(X7)
| ~ equal(xk,sdtasdt0(X6,X7))
| ~ aNaturalNumber0(X6) )
& ( aNaturalNumber0(esk3_1(X6))
| equal(X6,sz00)
| equal(X6,sz10)
| ~ doDivides0(X6,xk)
| ~ aNaturalNumber0(X6) )
& ( aNaturalNumber0(esk4_1(X6))
| equal(X6,sz00)
| equal(X6,sz10)
| ~ doDivides0(X6,xk)
| ~ aNaturalNumber0(X6) )
& ( equal(X6,sdtasdt0(esk3_1(X6),esk4_1(X6)))
| equal(X6,sz00)
| equal(X6,sz10)
| ~ doDivides0(X6,xk)
| ~ aNaturalNumber0(X6) )
& ( doDivides0(esk3_1(X6),X6)
| equal(X6,sz00)
| equal(X6,sz10)
| ~ doDivides0(X6,xk)
| ~ aNaturalNumber0(X6) )
& ( ~ equal(esk3_1(X6),sz10)
| equal(X6,sz00)
| equal(X6,sz10)
| ~ doDivides0(X6,xk)
| ~ aNaturalNumber0(X6) )
& ( ~ equal(esk3_1(X6),X6)
| equal(X6,sz00)
| equal(X6,sz10)
| ~ doDivides0(X6,xk)
| ~ aNaturalNumber0(X6) )
& ( ~ isPrime0(X6)
| ~ doDivides0(X6,xk)
| ~ aNaturalNumber0(X6) )
& ( ~ aNaturalNumber0(X5)
| ~ equal(xk,sdtasdt0(X4,X5))
| ~ aNaturalNumber0(X4)
| equal(X4,sz10)
| equal(X4,xk) )
& ( ~ doDivides0(X4,xk)
| ~ aNaturalNumber0(X4)
| equal(X4,sz10)
| equal(X4,xk) )
& isPrime0(xk) ),
inference(distribute,[status(thm)],[151]) ).
cnf(153,negated_conjecture,
isPrime0(xk),
inference(split_conjunct,[status(thm)],[152]) ).
cnf(156,negated_conjecture,
( ~ aNaturalNumber0(X1)
| ~ doDivides0(X1,xk)
| ~ isPrime0(X1) ),
inference(split_conjunct,[status(thm)],[152]) ).
fof(241,plain,
! [X1] :
( ~ aNaturalNumber0(X1)
| ( equal(sdtasdt0(X1,sz10),X1)
& equal(X1,sdtasdt0(sz10,X1)) ) ),
inference(fof_nnf,[status(thm)],[41]) ).
fof(242,plain,
! [X2] :
( ~ aNaturalNumber0(X2)
| ( equal(sdtasdt0(X2,sz10),X2)
& equal(X2,sdtasdt0(sz10,X2)) ) ),
inference(variable_rename,[status(thm)],[241]) ).
fof(243,plain,
! [X2] :
( ( equal(sdtasdt0(X2,sz10),X2)
| ~ aNaturalNumber0(X2) )
& ( equal(X2,sdtasdt0(sz10,X2))
| ~ aNaturalNumber0(X2) ) ),
inference(distribute,[status(thm)],[242]) ).
cnf(245,plain,
( sdtasdt0(X1,sz10) = X1
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[243]) ).
cnf(252,negated_conjecture,
( ~ doDivides0(xk,xk)
| ~ aNaturalNumber0(xk) ),
inference(spm,[status(thm)],[156,153,theory(equality)]) ).
cnf(253,negated_conjecture,
( ~ doDivides0(xk,xk)
| $false ),
inference(rw,[status(thm)],[252,145,theory(equality)]) ).
cnf(254,negated_conjecture,
~ doDivides0(xk,xk),
inference(cn,[status(thm)],[253,theory(equality)]) ).
cnf(342,plain,
( doDivides0(X1,X2)
| X1 != X2
| ~ aNaturalNumber0(sz10)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(spm,[status(thm)],[75,245,theory(equality)]) ).
cnf(350,plain,
( doDivides0(X1,X2)
| X1 != X2
| $false
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(rw,[status(thm)],[342,147,theory(equality)]) ).
cnf(351,plain,
( doDivides0(X1,X2)
| X1 != X2
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(cn,[status(thm)],[350,theory(equality)]) ).
cnf(352,plain,
( doDivides0(X1,X1)
| ~ aNaturalNumber0(X1) ),
inference(er,[status(thm)],[351,theory(equality)]) ).
cnf(1056,negated_conjecture,
~ aNaturalNumber0(xk),
inference(spm,[status(thm)],[254,352,theory(equality)]) ).
cnf(1057,negated_conjecture,
$false,
inference(rw,[status(thm)],[1056,145,theory(equality)]) ).
cnf(1058,negated_conjecture,
$false,
inference(cn,[status(thm)],[1057,theory(equality)]) ).
cnf(1059,negated_conjecture,
$false,
1058,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM482+3 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.03/0.23 % Computer : n139.star.cs.uiowa.edu
% 0.03/0.23 % Model : x86_64 x86_64
% 0.03/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.23 % Memory : 32218.625MB
% 0.03/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.03/0.23 % CPULimit : 300
% 0.03/0.23 % DateTime : Fri Jan 5 05:20:45 CST 2018
% 0.03/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.37 -running prover on /export/starexec/sandbox2/tmp/tmpSn1Lop/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.37 -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/tmpSn1Lop/sel_theBenchmark.p_1']
% 0.06/0.37 -prover status Theorem
% 0.06/0.37 Problem theBenchmark.p solved in phase 0.
% 0.06/0.37 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.37 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.37 Solved 1 out of 1.
% 0.06/0.37 # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.37 # SZS status Theorem
% 0.06/0.37 # SZS output start CNFRefutation.
% See solution above
% 0.06/0.38 # SZS output end CNFRefutation
%------------------------------------------------------------------------------