TSTP Solution File: NUM571+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM571+1 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n109.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:50 EST 2018
% Result : Theorem 0.06s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 26 ( 6 unt; 0 def)
% Number of atoms : 97 ( 5 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 94 ( 23 ~; 29 |; 39 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 8 ( 0 sgn 5 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(20,axiom,
( ~ equal(xi,sz00)
=> ( ? [X1] :
( aElementOf0(X1,szNzAzT0)
& equal(szszuzczcdt0(X1),xi) )
& aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,xi)) ) ),
file('/export/starexec/sandbox2/tmp/tmpWeMmZu/sel_theBenchmark.p_1',m__3702_02) ).
fof(63,axiom,
( aFunction0(xN)
& equal(szDzozmdt0(xN),szNzAzT0)
& equal(sdtlpdtrp0(xN,sz00),xS)
& ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( ( aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,X1)) )
=> ( aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X1))) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmpWeMmZu/sel_theBenchmark.p_1',m__3623) ).
fof(70,axiom,
( aSubsetOf0(xS,szNzAzT0)
& isCountable0(xS) ),
file('/export/starexec/sandbox2/tmp/tmpWeMmZu/sel_theBenchmark.p_1',m__3435) ).
fof(81,conjecture,
( aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,xi)) ),
file('/export/starexec/sandbox2/tmp/tmpWeMmZu/sel_theBenchmark.p_1',m__) ).
fof(86,negated_conjecture,
~ ( aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,xi)) ),
inference(assume_negation,[status(cth)],[81]) ).
fof(181,plain,
( equal(xi,sz00)
| ( ? [X1] :
( aElementOf0(X1,szNzAzT0)
& equal(szszuzczcdt0(X1),xi) )
& aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,xi)) ) ),
inference(fof_nnf,[status(thm)],[20]) ).
fof(182,plain,
( equal(xi,sz00)
| ( ? [X2] :
( aElementOf0(X2,szNzAzT0)
& equal(szszuzczcdt0(X2),xi) )
& aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,xi)) ) ),
inference(variable_rename,[status(thm)],[181]) ).
fof(183,plain,
( equal(xi,sz00)
| ( aElementOf0(esk5_0,szNzAzT0)
& equal(szszuzczcdt0(esk5_0),xi)
& aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,xi)) ) ),
inference(skolemize,[status(esa)],[182]) ).
fof(184,plain,
( ( aElementOf0(esk5_0,szNzAzT0)
| equal(xi,sz00) )
& ( equal(szszuzczcdt0(esk5_0),xi)
| equal(xi,sz00) )
& ( aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
| equal(xi,sz00) )
& ( isCountable0(sdtlpdtrp0(xN,xi))
| equal(xi,sz00) ) ),
inference(distribute,[status(thm)],[183]) ).
cnf(185,plain,
( xi = sz00
| isCountable0(sdtlpdtrp0(xN,xi)) ),
inference(split_conjunct,[status(thm)],[184]) ).
cnf(186,plain,
( xi = sz00
| aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ),
inference(split_conjunct,[status(thm)],[184]) ).
fof(383,plain,
( aFunction0(xN)
& equal(szDzozmdt0(xN),szNzAzT0)
& equal(sdtlpdtrp0(xN,sz00),xS)
& ! [X1] :
( ~ aElementOf0(X1,szNzAzT0)
| ~ aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X1))
| ( aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X1))) ) ) ),
inference(fof_nnf,[status(thm)],[63]) ).
fof(384,plain,
( aFunction0(xN)
& equal(szDzozmdt0(xN),szNzAzT0)
& equal(sdtlpdtrp0(xN,sz00),xS)
& ! [X2] :
( ~ aElementOf0(X2,szNzAzT0)
| ~ aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X2))
| ( aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X2)),sdtmndt0(sdtlpdtrp0(xN,X2),szmzizndt0(sdtlpdtrp0(xN,X2))))
& isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X2))) ) ) ),
inference(variable_rename,[status(thm)],[383]) ).
fof(385,plain,
! [X2] :
( ( ~ aElementOf0(X2,szNzAzT0)
| ~ aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X2))
| ( aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X2)),sdtmndt0(sdtlpdtrp0(xN,X2),szmzizndt0(sdtlpdtrp0(xN,X2))))
& isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X2))) ) )
& aFunction0(xN)
& equal(szDzozmdt0(xN),szNzAzT0)
& equal(sdtlpdtrp0(xN,sz00),xS) ),
inference(shift_quantors,[status(thm)],[384]) ).
fof(386,plain,
! [X2] :
( ( aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X2)),sdtmndt0(sdtlpdtrp0(xN,X2),szmzizndt0(sdtlpdtrp0(xN,X2))))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X2))
| ~ aElementOf0(X2,szNzAzT0) )
& ( isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X2)))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X2))
| ~ aElementOf0(X2,szNzAzT0) )
& aFunction0(xN)
& equal(szDzozmdt0(xN),szNzAzT0)
& equal(sdtlpdtrp0(xN,sz00),xS) ),
inference(distribute,[status(thm)],[385]) ).
cnf(387,plain,
sdtlpdtrp0(xN,sz00) = xS,
inference(split_conjunct,[status(thm)],[386]) ).
cnf(418,plain,
isCountable0(xS),
inference(split_conjunct,[status(thm)],[70]) ).
cnf(419,plain,
aSubsetOf0(xS,szNzAzT0),
inference(split_conjunct,[status(thm)],[70]) ).
fof(462,negated_conjecture,
( ~ aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,xi)) ),
inference(fof_nnf,[status(thm)],[86]) ).
cnf(463,negated_conjecture,
( ~ isCountable0(sdtlpdtrp0(xN,xi))
| ~ aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ),
inference(split_conjunct,[status(thm)],[462]) ).
cnf(504,plain,
( xi = sz00
| ~ aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ),
inference(spm,[status(thm)],[463,185,theory(equality)]) ).
cnf(1257,plain,
xi = sz00,
inference(csr,[status(thm)],[504,186]) ).
cnf(1266,negated_conjecture,
( $false
| ~ aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[463,1257,theory(equality)]),387,theory(equality)]),418,theory(equality)]) ).
cnf(1267,negated_conjecture,
( $false
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[1266,1257,theory(equality)]),387,theory(equality)]),419,theory(equality)]) ).
cnf(1268,negated_conjecture,
$false,
inference(cn,[status(thm)],[1267,theory(equality)]) ).
cnf(1269,negated_conjecture,
$false,
1268,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM571+1 : 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 : n109.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 09:18:44 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.38 -running prover on /export/starexec/sandbox2/tmp/tmpWeMmZu/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/tmpWeMmZu/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.38 # SZS output end CNFRefutation
%------------------------------------------------------------------------------