TSTP Solution File: NUM604+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM604+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:57 EST 2018
% Result : Theorem 0.06s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 15
% Syntax : Number of formulae : 93 ( 24 unt; 0 def)
% Number of atoms : 408 ( 15 equ)
% Maximal formula atoms : 32 ( 4 avg)
% Number of connectives : 507 ( 192 ~; 215 |; 85 &)
% ( 4 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 8 con; 0-2 aty)
% Number of variables : 110 ( 0 sgn 75 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(4,axiom,
! [X1] :
( ( aSubsetOf0(X1,szNzAzT0)
& ~ equal(X1,slcrc0) )
=> ! [X2] :
( equal(X2,szmzizndt0(X1))
<=> ( aElementOf0(X2,X1)
& ! [X3] :
( aElementOf0(X3,X1)
=> sdtlseqdt0(X2,X3) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmpmivHax/sel_theBenchmark.p_1',mDefMin) ).
fof(5,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmpmivHax/sel_theBenchmark.p_1',m__3671) ).
fof(7,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmpmivHax/sel_theBenchmark.p_1',mDefSub) ).
fof(9,axiom,
isFinite0(slcrc0),
file('/export/starexec/sandbox2/tmp/tmpmivHax/sel_theBenchmark.p_1',mEmpFin) ).
fof(13,axiom,
( aFunction0(xe)
& equal(szDzozmdt0(xe),szNzAzT0)
& ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> equal(sdtlpdtrp0(xe,X1),szmzizndt0(sdtlpdtrp0(xN,X1))) ) ),
file('/export/starexec/sandbox2/tmp/tmpmivHax/sel_theBenchmark.p_1',m__4660) ).
fof(15,axiom,
aElementOf0(sz00,szNzAzT0),
file('/export/starexec/sandbox2/tmp/tmpmivHax/sel_theBenchmark.p_1',mZeroNum) ).
fof(16,axiom,
( aElementOf0(xi,szNzAzT0)
& equal(sdtlpdtrp0(xe,xi),xx) ),
file('/export/starexec/sandbox2/tmp/tmpmivHax/sel_theBenchmark.p_1',m__5034) ).
fof(19,conjecture,
aElementOf0(xx,xS),
file('/export/starexec/sandbox2/tmp/tmpmivHax/sel_theBenchmark.p_1',m__) ).
fof(22,axiom,
( aSubsetOf0(xS,szNzAzT0)
& isCountable0(xS) ),
file('/export/starexec/sandbox2/tmp/tmpmivHax/sel_theBenchmark.p_1',m__3435) ).
fof(31,axiom,
aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
file('/export/starexec/sandbox2/tmp/tmpmivHax/sel_theBenchmark.p_1',m__5045) ).
fof(35,axiom,
! [X1] :
( ( aSet0(X1)
& isCountable0(X1) )
=> ~ isFinite0(X1) ),
file('/export/starexec/sandbox2/tmp/tmpmivHax/sel_theBenchmark.p_1',mCountNFin) ).
fof(49,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ! [X2] :
( equal(X2,slbdtrb0(X1))
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
<=> ( aElementOf0(X3,szNzAzT0)
& sdtlseqdt0(szszuzczcdt0(X3),X1) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmpmivHax/sel_theBenchmark.p_1',mDefSeg) ).
fof(63,axiom,
equal(slbdtrb0(sz00),slcrc0),
file('/export/starexec/sandbox2/tmp/tmpmivHax/sel_theBenchmark.p_1',mSegZero) ).
fof(82,axiom,
( aSet0(szNzAzT0)
& isCountable0(szNzAzT0) ),
file('/export/starexec/sandbox2/tmp/tmpmivHax/sel_theBenchmark.p_1',mNATSet) ).
fof(96,axiom,
! [X1,X2,X3] :
( ( aSet0(X1)
& aSet0(X2)
& aSet0(X3) )
=> ( ( aSubsetOf0(X1,X2)
& aSubsetOf0(X2,X3) )
=> aSubsetOf0(X1,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmpmivHax/sel_theBenchmark.p_1',mSubTrans) ).
fof(102,negated_conjecture,
~ aElementOf0(xx,xS),
inference(assume_negation,[status(cth)],[19]) ).
fof(104,negated_conjecture,
~ aElementOf0(xx,xS),
inference(fof_simplification,[status(thm)],[102,theory(equality)]) ).
fof(106,plain,
! [X1] :
( ( aSet0(X1)
& isCountable0(X1) )
=> ~ isFinite0(X1) ),
inference(fof_simplification,[status(thm)],[35,theory(equality)]) ).
fof(124,plain,
! [X1] :
( ~ aSubsetOf0(X1,szNzAzT0)
| equal(X1,slcrc0)
| ! [X2] :
( ( ~ equal(X2,szmzizndt0(X1))
| ( aElementOf0(X2,X1)
& ! [X3] :
( ~ aElementOf0(X3,X1)
| sdtlseqdt0(X2,X3) ) ) )
& ( ~ aElementOf0(X2,X1)
| ? [X3] :
( aElementOf0(X3,X1)
& ~ sdtlseqdt0(X2,X3) )
| equal(X2,szmzizndt0(X1)) ) ) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(125,plain,
! [X4] :
( ~ aSubsetOf0(X4,szNzAzT0)
| equal(X4,slcrc0)
| ! [X5] :
( ( ~ equal(X5,szmzizndt0(X4))
| ( aElementOf0(X5,X4)
& ! [X6] :
( ~ aElementOf0(X6,X4)
| sdtlseqdt0(X5,X6) ) ) )
& ( ~ aElementOf0(X5,X4)
| ? [X7] :
( aElementOf0(X7,X4)
& ~ sdtlseqdt0(X5,X7) )
| equal(X5,szmzizndt0(X4)) ) ) ),
inference(variable_rename,[status(thm)],[124]) ).
fof(126,plain,
! [X4] :
( ~ aSubsetOf0(X4,szNzAzT0)
| equal(X4,slcrc0)
| ! [X5] :
( ( ~ equal(X5,szmzizndt0(X4))
| ( aElementOf0(X5,X4)
& ! [X6] :
( ~ aElementOf0(X6,X4)
| sdtlseqdt0(X5,X6) ) ) )
& ( ~ aElementOf0(X5,X4)
| ( aElementOf0(esk1_2(X4,X5),X4)
& ~ sdtlseqdt0(X5,esk1_2(X4,X5)) )
| equal(X5,szmzizndt0(X4)) ) ) ),
inference(skolemize,[status(esa)],[125]) ).
fof(127,plain,
! [X4,X5,X6] :
( ( ( ( ( ~ aElementOf0(X6,X4)
| sdtlseqdt0(X5,X6) )
& aElementOf0(X5,X4) )
| ~ equal(X5,szmzizndt0(X4)) )
& ( ~ aElementOf0(X5,X4)
| ( aElementOf0(esk1_2(X4,X5),X4)
& ~ sdtlseqdt0(X5,esk1_2(X4,X5)) )
| equal(X5,szmzizndt0(X4)) ) )
| ~ aSubsetOf0(X4,szNzAzT0)
| equal(X4,slcrc0) ),
inference(shift_quantors,[status(thm)],[126]) ).
fof(128,plain,
! [X4,X5,X6] :
( ( ~ aElementOf0(X6,X4)
| sdtlseqdt0(X5,X6)
| ~ equal(X5,szmzizndt0(X4))
| ~ aSubsetOf0(X4,szNzAzT0)
| equal(X4,slcrc0) )
& ( aElementOf0(X5,X4)
| ~ equal(X5,szmzizndt0(X4))
| ~ aSubsetOf0(X4,szNzAzT0)
| equal(X4,slcrc0) )
& ( aElementOf0(esk1_2(X4,X5),X4)
| ~ aElementOf0(X5,X4)
| equal(X5,szmzizndt0(X4))
| ~ aSubsetOf0(X4,szNzAzT0)
| equal(X4,slcrc0) )
& ( ~ sdtlseqdt0(X5,esk1_2(X4,X5))
| ~ aElementOf0(X5,X4)
| equal(X5,szmzizndt0(X4))
| ~ aSubsetOf0(X4,szNzAzT0)
| equal(X4,slcrc0) ) ),
inference(distribute,[status(thm)],[127]) ).
cnf(131,plain,
( X1 = slcrc0
| aElementOf0(X2,X1)
| ~ aSubsetOf0(X1,szNzAzT0)
| X2 != szmzizndt0(X1) ),
inference(split_conjunct,[status(thm)],[128]) ).
fof(133,plain,
! [X1] :
( ~ aElementOf0(X1,szNzAzT0)
| ( aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,X1)) ) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(134,plain,
! [X2] :
( ~ aElementOf0(X2,szNzAzT0)
| ( aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,X2)) ) ),
inference(variable_rename,[status(thm)],[133]) ).
fof(135,plain,
! [X2] :
( ( aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0) )
& ( isCountable0(sdtlpdtrp0(xN,X2))
| ~ aElementOf0(X2,szNzAzT0) ) ),
inference(distribute,[status(thm)],[134]) ).
cnf(136,plain,
( isCountable0(sdtlpdtrp0(xN,X1))
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[135]) ).
fof(142,plain,
! [X1] :
( ~ aSet0(X1)
| ! [X2] :
( ( ~ aSubsetOf0(X2,X1)
| ( aSet0(X2)
& ! [X3] :
( ~ aElementOf0(X3,X2)
| aElementOf0(X3,X1) ) ) )
& ( ~ aSet0(X2)
| ? [X3] :
( aElementOf0(X3,X2)
& ~ aElementOf0(X3,X1) )
| aSubsetOf0(X2,X1) ) ) ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(143,plain,
! [X4] :
( ~ aSet0(X4)
| ! [X5] :
( ( ~ aSubsetOf0(X5,X4)
| ( aSet0(X5)
& ! [X6] :
( ~ aElementOf0(X6,X5)
| aElementOf0(X6,X4) ) ) )
& ( ~ aSet0(X5)
| ? [X7] :
( aElementOf0(X7,X5)
& ~ aElementOf0(X7,X4) )
| aSubsetOf0(X5,X4) ) ) ),
inference(variable_rename,[status(thm)],[142]) ).
fof(144,plain,
! [X4] :
( ~ aSet0(X4)
| ! [X5] :
( ( ~ aSubsetOf0(X5,X4)
| ( aSet0(X5)
& ! [X6] :
( ~ aElementOf0(X6,X5)
| aElementOf0(X6,X4) ) ) )
& ( ~ aSet0(X5)
| ( aElementOf0(esk2_2(X4,X5),X5)
& ~ aElementOf0(esk2_2(X4,X5),X4) )
| aSubsetOf0(X5,X4) ) ) ),
inference(skolemize,[status(esa)],[143]) ).
fof(145,plain,
! [X4,X5,X6] :
( ( ( ( ( ~ aElementOf0(X6,X5)
| aElementOf0(X6,X4) )
& aSet0(X5) )
| ~ aSubsetOf0(X5,X4) )
& ( ~ aSet0(X5)
| ( aElementOf0(esk2_2(X4,X5),X5)
& ~ aElementOf0(esk2_2(X4,X5),X4) )
| aSubsetOf0(X5,X4) ) )
| ~ aSet0(X4) ),
inference(shift_quantors,[status(thm)],[144]) ).
fof(146,plain,
! [X4,X5,X6] :
( ( ~ aElementOf0(X6,X5)
| aElementOf0(X6,X4)
| ~ aSubsetOf0(X5,X4)
| ~ aSet0(X4) )
& ( aSet0(X5)
| ~ aSubsetOf0(X5,X4)
| ~ aSet0(X4) )
& ( aElementOf0(esk2_2(X4,X5),X5)
| ~ aSet0(X5)
| aSubsetOf0(X5,X4)
| ~ aSet0(X4) )
& ( ~ aElementOf0(esk2_2(X4,X5),X4)
| ~ aSet0(X5)
| aSubsetOf0(X5,X4)
| ~ aSet0(X4) ) ),
inference(distribute,[status(thm)],[145]) ).
cnf(149,plain,
( aSet0(X2)
| ~ aSet0(X1)
| ~ aSubsetOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[146]) ).
cnf(150,plain,
( aElementOf0(X3,X1)
| ~ aSet0(X1)
| ~ aSubsetOf0(X2,X1)
| ~ aElementOf0(X3,X2) ),
inference(split_conjunct,[status(thm)],[146]) ).
cnf(160,plain,
isFinite0(slcrc0),
inference(split_conjunct,[status(thm)],[9]) ).
fof(178,plain,
( aFunction0(xe)
& equal(szDzozmdt0(xe),szNzAzT0)
& ! [X1] :
( ~ aElementOf0(X1,szNzAzT0)
| equal(sdtlpdtrp0(xe,X1),szmzizndt0(sdtlpdtrp0(xN,X1))) ) ),
inference(fof_nnf,[status(thm)],[13]) ).
fof(179,plain,
( aFunction0(xe)
& equal(szDzozmdt0(xe),szNzAzT0)
& ! [X2] :
( ~ aElementOf0(X2,szNzAzT0)
| equal(sdtlpdtrp0(xe,X2),szmzizndt0(sdtlpdtrp0(xN,X2))) ) ),
inference(variable_rename,[status(thm)],[178]) ).
fof(180,plain,
! [X2] :
( ( ~ aElementOf0(X2,szNzAzT0)
| equal(sdtlpdtrp0(xe,X2),szmzizndt0(sdtlpdtrp0(xN,X2))) )
& aFunction0(xe)
& equal(szDzozmdt0(xe),szNzAzT0) ),
inference(shift_quantors,[status(thm)],[179]) ).
cnf(183,plain,
( sdtlpdtrp0(xe,X1) = szmzizndt0(sdtlpdtrp0(xN,X1))
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[180]) ).
cnf(187,plain,
aElementOf0(sz00,szNzAzT0),
inference(split_conjunct,[status(thm)],[15]) ).
cnf(188,plain,
sdtlpdtrp0(xe,xi) = xx,
inference(split_conjunct,[status(thm)],[16]) ).
cnf(189,plain,
aElementOf0(xi,szNzAzT0),
inference(split_conjunct,[status(thm)],[16]) ).
cnf(200,negated_conjecture,
~ aElementOf0(xx,xS),
inference(split_conjunct,[status(thm)],[104]) ).
cnf(211,plain,
aSubsetOf0(xS,szNzAzT0),
inference(split_conjunct,[status(thm)],[22]) ).
cnf(251,plain,
aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
inference(split_conjunct,[status(thm)],[31]) ).
fof(273,plain,
! [X1] :
( ~ aSet0(X1)
| ~ isCountable0(X1)
| ~ isFinite0(X1) ),
inference(fof_nnf,[status(thm)],[106]) ).
fof(274,plain,
! [X2] :
( ~ aSet0(X2)
| ~ isCountable0(X2)
| ~ isFinite0(X2) ),
inference(variable_rename,[status(thm)],[273]) ).
cnf(275,plain,
( ~ isFinite0(X1)
| ~ isCountable0(X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[274]) ).
fof(333,plain,
! [X1] :
( ~ aElementOf0(X1,szNzAzT0)
| ! [X2] :
( ( ~ equal(X2,slbdtrb0(X1))
| ( aSet0(X2)
& ! [X3] :
( ( ~ aElementOf0(X3,X2)
| ( aElementOf0(X3,szNzAzT0)
& sdtlseqdt0(szszuzczcdt0(X3),X1) ) )
& ( ~ aElementOf0(X3,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X3),X1)
| aElementOf0(X3,X2) ) ) ) )
& ( ~ aSet0(X2)
| ? [X3] :
( ( ~ aElementOf0(X3,X2)
| ~ aElementOf0(X3,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X3),X1) )
& ( aElementOf0(X3,X2)
| ( aElementOf0(X3,szNzAzT0)
& sdtlseqdt0(szszuzczcdt0(X3),X1) ) ) )
| equal(X2,slbdtrb0(X1)) ) ) ),
inference(fof_nnf,[status(thm)],[49]) ).
fof(334,plain,
! [X4] :
( ~ aElementOf0(X4,szNzAzT0)
| ! [X5] :
( ( ~ equal(X5,slbdtrb0(X4))
| ( aSet0(X5)
& ! [X6] :
( ( ~ aElementOf0(X6,X5)
| ( aElementOf0(X6,szNzAzT0)
& sdtlseqdt0(szszuzczcdt0(X6),X4) ) )
& ( ~ aElementOf0(X6,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X6),X4)
| aElementOf0(X6,X5) ) ) ) )
& ( ~ aSet0(X5)
| ? [X7] :
( ( ~ aElementOf0(X7,X5)
| ~ aElementOf0(X7,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X7),X4) )
& ( aElementOf0(X7,X5)
| ( aElementOf0(X7,szNzAzT0)
& sdtlseqdt0(szszuzczcdt0(X7),X4) ) ) )
| equal(X5,slbdtrb0(X4)) ) ) ),
inference(variable_rename,[status(thm)],[333]) ).
fof(335,plain,
! [X4] :
( ~ aElementOf0(X4,szNzAzT0)
| ! [X5] :
( ( ~ equal(X5,slbdtrb0(X4))
| ( aSet0(X5)
& ! [X6] :
( ( ~ aElementOf0(X6,X5)
| ( aElementOf0(X6,szNzAzT0)
& sdtlseqdt0(szszuzczcdt0(X6),X4) ) )
& ( ~ aElementOf0(X6,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X6),X4)
| aElementOf0(X6,X5) ) ) ) )
& ( ~ aSet0(X5)
| ( ( ~ aElementOf0(esk14_2(X4,X5),X5)
| ~ aElementOf0(esk14_2(X4,X5),szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(esk14_2(X4,X5)),X4) )
& ( aElementOf0(esk14_2(X4,X5),X5)
| ( aElementOf0(esk14_2(X4,X5),szNzAzT0)
& sdtlseqdt0(szszuzczcdt0(esk14_2(X4,X5)),X4) ) ) )
| equal(X5,slbdtrb0(X4)) ) ) ),
inference(skolemize,[status(esa)],[334]) ).
fof(336,plain,
! [X4,X5,X6] :
( ( ( ( ( ~ aElementOf0(X6,X5)
| ( aElementOf0(X6,szNzAzT0)
& sdtlseqdt0(szszuzczcdt0(X6),X4) ) )
& ( ~ aElementOf0(X6,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X6),X4)
| aElementOf0(X6,X5) )
& aSet0(X5) )
| ~ equal(X5,slbdtrb0(X4)) )
& ( ~ aSet0(X5)
| ( ( ~ aElementOf0(esk14_2(X4,X5),X5)
| ~ aElementOf0(esk14_2(X4,X5),szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(esk14_2(X4,X5)),X4) )
& ( aElementOf0(esk14_2(X4,X5),X5)
| ( aElementOf0(esk14_2(X4,X5),szNzAzT0)
& sdtlseqdt0(szszuzczcdt0(esk14_2(X4,X5)),X4) ) ) )
| equal(X5,slbdtrb0(X4)) ) )
| ~ aElementOf0(X4,szNzAzT0) ),
inference(shift_quantors,[status(thm)],[335]) ).
fof(337,plain,
! [X4,X5,X6] :
( ( aElementOf0(X6,szNzAzT0)
| ~ aElementOf0(X6,X5)
| ~ equal(X5,slbdtrb0(X4))
| ~ aElementOf0(X4,szNzAzT0) )
& ( sdtlseqdt0(szszuzczcdt0(X6),X4)
| ~ aElementOf0(X6,X5)
| ~ equal(X5,slbdtrb0(X4))
| ~ aElementOf0(X4,szNzAzT0) )
& ( ~ aElementOf0(X6,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X6),X4)
| aElementOf0(X6,X5)
| ~ equal(X5,slbdtrb0(X4))
| ~ aElementOf0(X4,szNzAzT0) )
& ( aSet0(X5)
| ~ equal(X5,slbdtrb0(X4))
| ~ aElementOf0(X4,szNzAzT0) )
& ( ~ aElementOf0(esk14_2(X4,X5),X5)
| ~ aElementOf0(esk14_2(X4,X5),szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(esk14_2(X4,X5)),X4)
| ~ aSet0(X5)
| equal(X5,slbdtrb0(X4))
| ~ aElementOf0(X4,szNzAzT0) )
& ( aElementOf0(esk14_2(X4,X5),szNzAzT0)
| aElementOf0(esk14_2(X4,X5),X5)
| ~ aSet0(X5)
| equal(X5,slbdtrb0(X4))
| ~ aElementOf0(X4,szNzAzT0) )
& ( sdtlseqdt0(szszuzczcdt0(esk14_2(X4,X5)),X4)
| aElementOf0(esk14_2(X4,X5),X5)
| ~ aSet0(X5)
| equal(X5,slbdtrb0(X4))
| ~ aElementOf0(X4,szNzAzT0) ) ),
inference(distribute,[status(thm)],[336]) ).
cnf(341,plain,
( aSet0(X2)
| ~ aElementOf0(X1,szNzAzT0)
| X2 != slbdtrb0(X1) ),
inference(split_conjunct,[status(thm)],[337]) ).
cnf(412,plain,
slbdtrb0(sz00) = slcrc0,
inference(split_conjunct,[status(thm)],[63]) ).
cnf(488,plain,
aSet0(szNzAzT0),
inference(split_conjunct,[status(thm)],[82]) ).
fof(537,plain,
! [X1,X2,X3] :
( ~ aSet0(X1)
| ~ aSet0(X2)
| ~ aSet0(X3)
| ~ aSubsetOf0(X1,X2)
| ~ aSubsetOf0(X2,X3)
| aSubsetOf0(X1,X3) ),
inference(fof_nnf,[status(thm)],[96]) ).
fof(538,plain,
! [X4,X5,X6] :
( ~ aSet0(X4)
| ~ aSet0(X5)
| ~ aSet0(X6)
| ~ aSubsetOf0(X4,X5)
| ~ aSubsetOf0(X5,X6)
| aSubsetOf0(X4,X6) ),
inference(variable_rename,[status(thm)],[537]) ).
cnf(539,plain,
( aSubsetOf0(X1,X2)
| ~ aSubsetOf0(X3,X2)
| ~ aSubsetOf0(X1,X3)
| ~ aSet0(X2)
| ~ aSet0(X3)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[538]) ).
cnf(638,plain,
( ~ isCountable0(slcrc0)
| ~ aSet0(slcrc0) ),
inference(spm,[status(thm)],[275,160,theory(equality)]) ).
cnf(673,plain,
( aSet0(slbdtrb0(X1))
| ~ aElementOf0(X1,szNzAzT0) ),
inference(er,[status(thm)],[341,theory(equality)]) ).
cnf(677,plain,
( aSet0(xS)
| ~ aSet0(szNzAzT0) ),
inference(spm,[status(thm)],[149,211,theory(equality)]) ).
cnf(681,plain,
( aSet0(xS)
| $false ),
inference(rw,[status(thm)],[677,488,theory(equality)]) ).
cnf(682,plain,
aSet0(xS),
inference(cn,[status(thm)],[681,theory(equality)]) ).
cnf(718,plain,
( aElementOf0(X1,xS)
| ~ aSet0(xS)
| ~ aElementOf0(X1,sdtlpdtrp0(xN,xi)) ),
inference(spm,[status(thm)],[150,251,theory(equality)]) ).
cnf(792,plain,
( slcrc0 = X1
| aElementOf0(szmzizndt0(X1),X1)
| ~ aSubsetOf0(X1,szNzAzT0) ),
inference(er,[status(thm)],[131,theory(equality)]) ).
cnf(1146,plain,
( aSubsetOf0(X1,X2)
| ~ aSubsetOf0(X3,X2)
| ~ aSubsetOf0(X1,X3)
| ~ aSet0(X3)
| ~ aSet0(X2) ),
inference(csr,[status(thm)],[539,149]) ).
cnf(1147,plain,
( aSubsetOf0(X1,X2)
| ~ aSubsetOf0(X3,X2)
| ~ aSubsetOf0(X1,X3)
| ~ aSet0(X2) ),
inference(csr,[status(thm)],[1146,149]) ).
cnf(1148,plain,
( aSubsetOf0(X1,szNzAzT0)
| ~ aSubsetOf0(X1,xS)
| ~ aSet0(szNzAzT0) ),
inference(spm,[status(thm)],[1147,211,theory(equality)]) ).
cnf(1159,plain,
( aSubsetOf0(X1,szNzAzT0)
| ~ aSubsetOf0(X1,xS)
| $false ),
inference(rw,[status(thm)],[1148,488,theory(equality)]) ).
cnf(1160,plain,
( aSubsetOf0(X1,szNzAzT0)
| ~ aSubsetOf0(X1,xS) ),
inference(cn,[status(thm)],[1159,theory(equality)]) ).
cnf(2036,plain,
( aSet0(slcrc0)
| ~ aElementOf0(sz00,szNzAzT0) ),
inference(spm,[status(thm)],[673,412,theory(equality)]) ).
cnf(2037,plain,
( aSet0(slcrc0)
| $false ),
inference(rw,[status(thm)],[2036,187,theory(equality)]) ).
cnf(2038,plain,
aSet0(slcrc0),
inference(cn,[status(thm)],[2037,theory(equality)]) ).
cnf(2068,plain,
( ~ isCountable0(slcrc0)
| $false ),
inference(rw,[status(thm)],[638,2038,theory(equality)]) ).
cnf(2069,plain,
~ isCountable0(slcrc0),
inference(cn,[status(thm)],[2068,theory(equality)]) ).
cnf(2079,plain,
aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0),
inference(spm,[status(thm)],[1160,251,theory(equality)]) ).
cnf(2318,plain,
( aElementOf0(X1,xS)
| $false
| ~ aElementOf0(X1,sdtlpdtrp0(xN,xi)) ),
inference(rw,[status(thm)],[718,682,theory(equality)]) ).
cnf(2319,plain,
( aElementOf0(X1,xS)
| ~ aElementOf0(X1,sdtlpdtrp0(xN,xi)) ),
inference(cn,[status(thm)],[2318,theory(equality)]) ).
cnf(2546,plain,
( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),xS)
| slcrc0 = sdtlpdtrp0(xN,xi)
| ~ aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ),
inference(spm,[status(thm)],[2319,792,theory(equality)]) ).
cnf(2561,plain,
( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),xS)
| slcrc0 = sdtlpdtrp0(xN,xi)
| $false ),
inference(rw,[status(thm)],[2546,2079,theory(equality)]) ).
cnf(2562,plain,
( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),xS)
| slcrc0 = sdtlpdtrp0(xN,xi) ),
inference(cn,[status(thm)],[2561,theory(equality)]) ).
cnf(2598,plain,
( sdtlpdtrp0(xN,xi) = slcrc0
| aElementOf0(sdtlpdtrp0(xe,xi),xS)
| ~ aElementOf0(xi,szNzAzT0) ),
inference(spm,[status(thm)],[2562,183,theory(equality)]) ).
cnf(2606,plain,
( sdtlpdtrp0(xN,xi) = slcrc0
| aElementOf0(xx,xS)
| ~ aElementOf0(xi,szNzAzT0) ),
inference(rw,[status(thm)],[2598,188,theory(equality)]) ).
cnf(2607,plain,
( sdtlpdtrp0(xN,xi) = slcrc0
| aElementOf0(xx,xS)
| $false ),
inference(rw,[status(thm)],[2606,189,theory(equality)]) ).
cnf(2608,plain,
( sdtlpdtrp0(xN,xi) = slcrc0
| aElementOf0(xx,xS) ),
inference(cn,[status(thm)],[2607,theory(equality)]) ).
cnf(2609,plain,
sdtlpdtrp0(xN,xi) = slcrc0,
inference(sr,[status(thm)],[2608,200,theory(equality)]) ).
cnf(2620,plain,
( isCountable0(slcrc0)
| ~ aElementOf0(xi,szNzAzT0) ),
inference(spm,[status(thm)],[136,2609,theory(equality)]) ).
cnf(2651,plain,
( isCountable0(slcrc0)
| $false ),
inference(rw,[status(thm)],[2620,189,theory(equality)]) ).
cnf(2652,plain,
isCountable0(slcrc0),
inference(cn,[status(thm)],[2651,theory(equality)]) ).
cnf(2653,plain,
$false,
inference(sr,[status(thm)],[2652,2069,theory(equality)]) ).
cnf(2654,plain,
$false,
2653,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM604+1 : 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 : n044.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 10:25:00 CST 2018
% 0.02/0.22 % CPUTime :
% 0.06/0.27 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.27 --creating new selector for []
% 0.06/0.41 -running prover on /export/starexec/sandbox2/tmp/tmpmivHax/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/tmpmivHax/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.42 # SZS output end CNFRefutation
%------------------------------------------------------------------------------