TSTP Solution File: NUM538+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM538+2 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n067.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:42 EST 2018
% Result : Theorem 0.06s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 9
% Syntax : Number of formulae : 73 ( 11 unt; 0 def)
% Number of atoms : 431 ( 12 equ)
% Maximal formula atoms : 52 ( 5 avg)
% Number of connectives : 580 ( 222 ~; 246 |; 90 &)
% ( 5 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-3 aty)
% Number of variables : 114 ( 0 sgn 82 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(4,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox2/tmp/tmpMuCKhp/sel_theBenchmark.p_1',mEOfElem) ).
fof(6,axiom,
! [X1,X2] :
( ( aSet0(X1)
& aElement0(X2) )
=> ! [X3] :
( equal(X3,sdtmndt0(X1,X2))
<=> ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
<=> ( aElement0(X4)
& aElementOf0(X4,X1)
& ~ equal(X4,X2) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmpMuCKhp/sel_theBenchmark.p_1',mDefDiff) ).
fof(12,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmpMuCKhp/sel_theBenchmark.p_1',mDefSub) ).
fof(19,axiom,
aSet0(xS),
file('/export/starexec/sandbox2/tmp/tmpMuCKhp/sel_theBenchmark.p_1',m__1522) ).
fof(22,axiom,
! [X1] :
( ( aSet0(X1)
& isFinite0(X1) )
=> ! [X2] :
( aSubsetOf0(X2,X1)
=> isFinite0(X2) ) ),
file('/export/starexec/sandbox2/tmp/tmpMuCKhp/sel_theBenchmark.p_1',mSubFSet) ).
fof(23,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> equal(sdtpldt0(sdtmndt0(X1,X2),X2),X1) ) ),
file('/export/starexec/sandbox2/tmp/tmpMuCKhp/sel_theBenchmark.p_1',mConsDiff) ).
fof(29,conjecture,
( ( aSet0(sdtmndt0(xS,xx))
& ! [X1] :
( aElementOf0(X1,sdtmndt0(xS,xx))
<=> ( aElement0(X1)
& aElementOf0(X1,xS)
& ~ equal(X1,xx) ) ) )
=> equal(szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx))),sbrdtbr0(xS)) ),
file('/export/starexec/sandbox2/tmp/tmpMuCKhp/sel_theBenchmark.p_1',m__) ).
fof(39,axiom,
( isFinite0(xS)
& aElementOf0(xx,xS) ),
file('/export/starexec/sandbox2/tmp/tmpMuCKhp/sel_theBenchmark.p_1',m__1522_02) ).
fof(42,axiom,
! [X1] :
( ( aSet0(X1)
& isFinite0(X1) )
=> ! [X2] :
( aElement0(X2)
=> ( ~ aElementOf0(X2,X1)
=> equal(sbrdtbr0(sdtpldt0(X1,X2)),szszuzczcdt0(sbrdtbr0(X1))) ) ) ),
file('/export/starexec/sandbox2/tmp/tmpMuCKhp/sel_theBenchmark.p_1',mCardCons) ).
fof(47,negated_conjecture,
~ ( ( aSet0(sdtmndt0(xS,xx))
& ! [X1] :
( aElementOf0(X1,sdtmndt0(xS,xx))
<=> ( aElement0(X1)
& aElementOf0(X1,xS)
& ~ equal(X1,xx) ) ) )
=> equal(szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx))),sbrdtbr0(xS)) ),
inference(assume_negation,[status(cth)],[29]) ).
fof(51,plain,
! [X1] :
( ( aSet0(X1)
& isFinite0(X1) )
=> ! [X2] :
( aElement0(X2)
=> ( ~ aElementOf0(X2,X1)
=> equal(sbrdtbr0(sdtpldt0(X1,X2)),szszuzczcdt0(sbrdtbr0(X1))) ) ) ),
inference(fof_simplification,[status(thm)],[42,theory(equality)]) ).
fof(59,plain,
! [X1] :
( ~ aSet0(X1)
| ! [X2] :
( ~ aElementOf0(X2,X1)
| aElement0(X2) ) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(60,plain,
! [X3] :
( ~ aSet0(X3)
| ! [X4] :
( ~ aElementOf0(X4,X3)
| aElement0(X4) ) ),
inference(variable_rename,[status(thm)],[59]) ).
fof(61,plain,
! [X3,X4] :
( ~ aElementOf0(X4,X3)
| aElement0(X4)
| ~ aSet0(X3) ),
inference(shift_quantors,[status(thm)],[60]) ).
cnf(62,plain,
( aElement0(X2)
| ~ aSet0(X1)
| ~ aElementOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[61]) ).
fof(68,plain,
! [X1,X2] :
( ~ aSet0(X1)
| ~ aElement0(X2)
| ! [X3] :
( ( ~ equal(X3,sdtmndt0(X1,X2))
| ( aSet0(X3)
& ! [X4] :
( ( ~ aElementOf0(X4,X3)
| ( aElement0(X4)
& aElementOf0(X4,X1)
& ~ equal(X4,X2) ) )
& ( ~ aElement0(X4)
| ~ aElementOf0(X4,X1)
| equal(X4,X2)
| aElementOf0(X4,X3) ) ) ) )
& ( ~ aSet0(X3)
| ? [X4] :
( ( ~ aElementOf0(X4,X3)
| ~ aElement0(X4)
| ~ aElementOf0(X4,X1)
| equal(X4,X2) )
& ( aElementOf0(X4,X3)
| ( aElement0(X4)
& aElementOf0(X4,X1)
& ~ equal(X4,X2) ) ) )
| equal(X3,sdtmndt0(X1,X2)) ) ) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(69,plain,
! [X5,X6] :
( ~ aSet0(X5)
| ~ aElement0(X6)
| ! [X7] :
( ( ~ equal(X7,sdtmndt0(X5,X6))
| ( aSet0(X7)
& ! [X8] :
( ( ~ aElementOf0(X8,X7)
| ( aElement0(X8)
& aElementOf0(X8,X5)
& ~ equal(X8,X6) ) )
& ( ~ aElement0(X8)
| ~ aElementOf0(X8,X5)
| equal(X8,X6)
| aElementOf0(X8,X7) ) ) ) )
& ( ~ aSet0(X7)
| ? [X9] :
( ( ~ aElementOf0(X9,X7)
| ~ aElement0(X9)
| ~ aElementOf0(X9,X5)
| equal(X9,X6) )
& ( aElementOf0(X9,X7)
| ( aElement0(X9)
& aElementOf0(X9,X5)
& ~ equal(X9,X6) ) ) )
| equal(X7,sdtmndt0(X5,X6)) ) ) ),
inference(variable_rename,[status(thm)],[68]) ).
fof(70,plain,
! [X5,X6] :
( ~ aSet0(X5)
| ~ aElement0(X6)
| ! [X7] :
( ( ~ equal(X7,sdtmndt0(X5,X6))
| ( aSet0(X7)
& ! [X8] :
( ( ~ aElementOf0(X8,X7)
| ( aElement0(X8)
& aElementOf0(X8,X5)
& ~ equal(X8,X6) ) )
& ( ~ aElement0(X8)
| ~ aElementOf0(X8,X5)
| equal(X8,X6)
| aElementOf0(X8,X7) ) ) ) )
& ( ~ aSet0(X7)
| ( ( ~ aElementOf0(esk1_3(X5,X6,X7),X7)
| ~ aElement0(esk1_3(X5,X6,X7))
| ~ aElementOf0(esk1_3(X5,X6,X7),X5)
| equal(esk1_3(X5,X6,X7),X6) )
& ( aElementOf0(esk1_3(X5,X6,X7),X7)
| ( aElement0(esk1_3(X5,X6,X7))
& aElementOf0(esk1_3(X5,X6,X7),X5)
& ~ equal(esk1_3(X5,X6,X7),X6) ) ) )
| equal(X7,sdtmndt0(X5,X6)) ) ) ),
inference(skolemize,[status(esa)],[69]) ).
fof(71,plain,
! [X5,X6,X7,X8] :
( ( ( ( ( ~ aElementOf0(X8,X7)
| ( aElement0(X8)
& aElementOf0(X8,X5)
& ~ equal(X8,X6) ) )
& ( ~ aElement0(X8)
| ~ aElementOf0(X8,X5)
| equal(X8,X6)
| aElementOf0(X8,X7) )
& aSet0(X7) )
| ~ equal(X7,sdtmndt0(X5,X6)) )
& ( ~ aSet0(X7)
| ( ( ~ aElementOf0(esk1_3(X5,X6,X7),X7)
| ~ aElement0(esk1_3(X5,X6,X7))
| ~ aElementOf0(esk1_3(X5,X6,X7),X5)
| equal(esk1_3(X5,X6,X7),X6) )
& ( aElementOf0(esk1_3(X5,X6,X7),X7)
| ( aElement0(esk1_3(X5,X6,X7))
& aElementOf0(esk1_3(X5,X6,X7),X5)
& ~ equal(esk1_3(X5,X6,X7),X6) ) ) )
| equal(X7,sdtmndt0(X5,X6)) ) )
| ~ aSet0(X5)
| ~ aElement0(X6) ),
inference(shift_quantors,[status(thm)],[70]) ).
fof(72,plain,
! [X5,X6,X7,X8] :
( ( aElement0(X8)
| ~ aElementOf0(X8,X7)
| ~ equal(X7,sdtmndt0(X5,X6))
| ~ aSet0(X5)
| ~ aElement0(X6) )
& ( aElementOf0(X8,X5)
| ~ aElementOf0(X8,X7)
| ~ equal(X7,sdtmndt0(X5,X6))
| ~ aSet0(X5)
| ~ aElement0(X6) )
& ( ~ equal(X8,X6)
| ~ aElementOf0(X8,X7)
| ~ equal(X7,sdtmndt0(X5,X6))
| ~ aSet0(X5)
| ~ aElement0(X6) )
& ( ~ aElement0(X8)
| ~ aElementOf0(X8,X5)
| equal(X8,X6)
| aElementOf0(X8,X7)
| ~ equal(X7,sdtmndt0(X5,X6))
| ~ aSet0(X5)
| ~ aElement0(X6) )
& ( aSet0(X7)
| ~ equal(X7,sdtmndt0(X5,X6))
| ~ aSet0(X5)
| ~ aElement0(X6) )
& ( ~ aElementOf0(esk1_3(X5,X6,X7),X7)
| ~ aElement0(esk1_3(X5,X6,X7))
| ~ aElementOf0(esk1_3(X5,X6,X7),X5)
| equal(esk1_3(X5,X6,X7),X6)
| ~ aSet0(X7)
| equal(X7,sdtmndt0(X5,X6))
| ~ aSet0(X5)
| ~ aElement0(X6) )
& ( aElement0(esk1_3(X5,X6,X7))
| aElementOf0(esk1_3(X5,X6,X7),X7)
| ~ aSet0(X7)
| equal(X7,sdtmndt0(X5,X6))
| ~ aSet0(X5)
| ~ aElement0(X6) )
& ( aElementOf0(esk1_3(X5,X6,X7),X5)
| aElementOf0(esk1_3(X5,X6,X7),X7)
| ~ aSet0(X7)
| equal(X7,sdtmndt0(X5,X6))
| ~ aSet0(X5)
| ~ aElement0(X6) )
& ( ~ equal(esk1_3(X5,X6,X7),X6)
| aElementOf0(esk1_3(X5,X6,X7),X7)
| ~ aSet0(X7)
| equal(X7,sdtmndt0(X5,X6))
| ~ aSet0(X5)
| ~ aElement0(X6) ) ),
inference(distribute,[status(thm)],[71]) ).
cnf(77,plain,
( aSet0(X3)
| ~ aElement0(X1)
| ~ aSet0(X2)
| X3 != sdtmndt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[72]) ).
fof(99,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)],[12]) ).
fof(100,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)],[99]) ).
fof(101,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)],[100]) ).
fof(102,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)],[101]) ).
fof(103,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)],[102]) ).
cnf(104,plain,
( aSubsetOf0(X2,X1)
| ~ aSet0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(esk2_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[103]) ).
cnf(105,plain,
( aSubsetOf0(X2,X1)
| aElementOf0(esk2_2(X1,X2),X2)
| ~ aSet0(X1)
| ~ aSet0(X2) ),
inference(split_conjunct,[status(thm)],[103]) ).
cnf(130,plain,
aSet0(xS),
inference(split_conjunct,[status(thm)],[19]) ).
fof(139,plain,
! [X1] :
( ~ aSet0(X1)
| ~ isFinite0(X1)
| ! [X2] :
( ~ aSubsetOf0(X2,X1)
| isFinite0(X2) ) ),
inference(fof_nnf,[status(thm)],[22]) ).
fof(140,plain,
! [X3] :
( ~ aSet0(X3)
| ~ isFinite0(X3)
| ! [X4] :
( ~ aSubsetOf0(X4,X3)
| isFinite0(X4) ) ),
inference(variable_rename,[status(thm)],[139]) ).
fof(141,plain,
! [X3,X4] :
( ~ aSubsetOf0(X4,X3)
| isFinite0(X4)
| ~ aSet0(X3)
| ~ isFinite0(X3) ),
inference(shift_quantors,[status(thm)],[140]) ).
cnf(142,plain,
( isFinite0(X2)
| ~ isFinite0(X1)
| ~ aSet0(X1)
| ~ aSubsetOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[141]) ).
fof(143,plain,
! [X1] :
( ~ aSet0(X1)
| ! [X2] :
( ~ aElementOf0(X2,X1)
| equal(sdtpldt0(sdtmndt0(X1,X2),X2),X1) ) ),
inference(fof_nnf,[status(thm)],[23]) ).
fof(144,plain,
! [X3] :
( ~ aSet0(X3)
| ! [X4] :
( ~ aElementOf0(X4,X3)
| equal(sdtpldt0(sdtmndt0(X3,X4),X4),X3) ) ),
inference(variable_rename,[status(thm)],[143]) ).
fof(145,plain,
! [X3,X4] :
( ~ aElementOf0(X4,X3)
| equal(sdtpldt0(sdtmndt0(X3,X4),X4),X3)
| ~ aSet0(X3) ),
inference(shift_quantors,[status(thm)],[144]) ).
cnf(146,plain,
( sdtpldt0(sdtmndt0(X1,X2),X2) = X1
| ~ aSet0(X1)
| ~ aElementOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[145]) ).
fof(165,negated_conjecture,
( aSet0(sdtmndt0(xS,xx))
& ! [X1] :
( ( ~ aElementOf0(X1,sdtmndt0(xS,xx))
| ( aElement0(X1)
& aElementOf0(X1,xS)
& ~ equal(X1,xx) ) )
& ( ~ aElement0(X1)
| ~ aElementOf0(X1,xS)
| equal(X1,xx)
| aElementOf0(X1,sdtmndt0(xS,xx)) ) )
& ~ equal(szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx))),sbrdtbr0(xS)) ),
inference(fof_nnf,[status(thm)],[47]) ).
fof(166,negated_conjecture,
( aSet0(sdtmndt0(xS,xx))
& ! [X2] :
( ( ~ aElementOf0(X2,sdtmndt0(xS,xx))
| ( aElement0(X2)
& aElementOf0(X2,xS)
& ~ equal(X2,xx) ) )
& ( ~ aElement0(X2)
| ~ aElementOf0(X2,xS)
| equal(X2,xx)
| aElementOf0(X2,sdtmndt0(xS,xx)) ) )
& ~ equal(szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx))),sbrdtbr0(xS)) ),
inference(variable_rename,[status(thm)],[165]) ).
fof(167,negated_conjecture,
! [X2] :
( ( ~ aElementOf0(X2,sdtmndt0(xS,xx))
| ( aElement0(X2)
& aElementOf0(X2,xS)
& ~ equal(X2,xx) ) )
& ( ~ aElement0(X2)
| ~ aElementOf0(X2,xS)
| equal(X2,xx)
| aElementOf0(X2,sdtmndt0(xS,xx)) )
& aSet0(sdtmndt0(xS,xx))
& ~ equal(szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx))),sbrdtbr0(xS)) ),
inference(shift_quantors,[status(thm)],[166]) ).
fof(168,negated_conjecture,
! [X2] :
( ( aElement0(X2)
| ~ aElementOf0(X2,sdtmndt0(xS,xx)) )
& ( aElementOf0(X2,xS)
| ~ aElementOf0(X2,sdtmndt0(xS,xx)) )
& ( ~ equal(X2,xx)
| ~ aElementOf0(X2,sdtmndt0(xS,xx)) )
& ( ~ aElement0(X2)
| ~ aElementOf0(X2,xS)
| equal(X2,xx)
| aElementOf0(X2,sdtmndt0(xS,xx)) )
& aSet0(sdtmndt0(xS,xx))
& ~ equal(szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx))),sbrdtbr0(xS)) ),
inference(distribute,[status(thm)],[167]) ).
cnf(169,negated_conjecture,
szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx))) != sbrdtbr0(xS),
inference(split_conjunct,[status(thm)],[168]) ).
cnf(170,negated_conjecture,
aSet0(sdtmndt0(xS,xx)),
inference(split_conjunct,[status(thm)],[168]) ).
cnf(172,negated_conjecture,
( ~ aElementOf0(X1,sdtmndt0(xS,xx))
| X1 != xx ),
inference(split_conjunct,[status(thm)],[168]) ).
cnf(173,negated_conjecture,
( aElementOf0(X1,xS)
| ~ aElementOf0(X1,sdtmndt0(xS,xx)) ),
inference(split_conjunct,[status(thm)],[168]) ).
cnf(204,plain,
aElementOf0(xx,xS),
inference(split_conjunct,[status(thm)],[39]) ).
cnf(205,plain,
isFinite0(xS),
inference(split_conjunct,[status(thm)],[39]) ).
fof(223,plain,
! [X1] :
( ~ aSet0(X1)
| ~ isFinite0(X1)
| ! [X2] :
( ~ aElement0(X2)
| aElementOf0(X2,X1)
| equal(sbrdtbr0(sdtpldt0(X1,X2)),szszuzczcdt0(sbrdtbr0(X1))) ) ),
inference(fof_nnf,[status(thm)],[51]) ).
fof(224,plain,
! [X3] :
( ~ aSet0(X3)
| ~ isFinite0(X3)
| ! [X4] :
( ~ aElement0(X4)
| aElementOf0(X4,X3)
| equal(sbrdtbr0(sdtpldt0(X3,X4)),szszuzczcdt0(sbrdtbr0(X3))) ) ),
inference(variable_rename,[status(thm)],[223]) ).
fof(225,plain,
! [X3,X4] :
( ~ aElement0(X4)
| aElementOf0(X4,X3)
| equal(sbrdtbr0(sdtpldt0(X3,X4)),szszuzczcdt0(sbrdtbr0(X3)))
| ~ aSet0(X3)
| ~ isFinite0(X3) ),
inference(shift_quantors,[status(thm)],[224]) ).
cnf(226,plain,
( sbrdtbr0(sdtpldt0(X1,X2)) = szszuzczcdt0(sbrdtbr0(X1))
| aElementOf0(X2,X1)
| ~ isFinite0(X1)
| ~ aSet0(X1)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[225]) ).
cnf(291,plain,
( aSet0(sdtmndt0(X1,X2))
| ~ aElement0(X2)
| ~ aSet0(X1) ),
inference(er,[status(thm)],[77,theory(equality)]) ).
cnf(328,negated_conjecture,
( aElementOf0(esk2_2(X1,sdtmndt0(xS,xx)),xS)
| aSubsetOf0(sdtmndt0(xS,xx),X1)
| ~ aSet0(sdtmndt0(xS,xx))
| ~ aSet0(X1) ),
inference(spm,[status(thm)],[173,105,theory(equality)]) ).
cnf(336,negated_conjecture,
( aElementOf0(esk2_2(X1,sdtmndt0(xS,xx)),xS)
| aSubsetOf0(sdtmndt0(xS,xx),X1)
| $false
| ~ aSet0(X1) ),
inference(rw,[status(thm)],[328,170,theory(equality)]) ).
cnf(337,negated_conjecture,
( aElementOf0(esk2_2(X1,sdtmndt0(xS,xx)),xS)
| aSubsetOf0(sdtmndt0(xS,xx),X1)
| ~ aSet0(X1) ),
inference(cn,[status(thm)],[336,theory(equality)]) ).
cnf(374,plain,
( sbrdtbr0(X1) = szszuzczcdt0(sbrdtbr0(sdtmndt0(X1,X2)))
| aElementOf0(X2,sdtmndt0(X1,X2))
| ~ aElement0(X2)
| ~ isFinite0(sdtmndt0(X1,X2))
| ~ aSet0(sdtmndt0(X1,X2))
| ~ aElementOf0(X2,X1)
| ~ aSet0(X1) ),
inference(spm,[status(thm)],[226,146,theory(equality)]) ).
cnf(518,negated_conjecture,
( aSubsetOf0(sdtmndt0(xS,xx),xS)
| ~ aSet0(sdtmndt0(xS,xx))
| ~ aSet0(xS) ),
inference(spm,[status(thm)],[104,337,theory(equality)]) ).
cnf(521,negated_conjecture,
( aSubsetOf0(sdtmndt0(xS,xx),xS)
| $false
| ~ aSet0(xS) ),
inference(rw,[status(thm)],[518,170,theory(equality)]) ).
cnf(522,negated_conjecture,
( aSubsetOf0(sdtmndt0(xS,xx),xS)
| $false
| $false ),
inference(rw,[status(thm)],[521,130,theory(equality)]) ).
cnf(523,negated_conjecture,
aSubsetOf0(sdtmndt0(xS,xx),xS),
inference(cn,[status(thm)],[522,theory(equality)]) ).
cnf(525,negated_conjecture,
( isFinite0(sdtmndt0(xS,xx))
| ~ isFinite0(xS)
| ~ aSet0(xS) ),
inference(spm,[status(thm)],[142,523,theory(equality)]) ).
cnf(532,negated_conjecture,
( isFinite0(sdtmndt0(xS,xx))
| $false
| ~ aSet0(xS) ),
inference(rw,[status(thm)],[525,205,theory(equality)]) ).
cnf(533,negated_conjecture,
( isFinite0(sdtmndt0(xS,xx))
| $false
| $false ),
inference(rw,[status(thm)],[532,130,theory(equality)]) ).
cnf(534,negated_conjecture,
isFinite0(sdtmndt0(xS,xx)),
inference(cn,[status(thm)],[533,theory(equality)]) ).
cnf(2330,plain,
( szszuzczcdt0(sbrdtbr0(sdtmndt0(X1,X2))) = sbrdtbr0(X1)
| aElementOf0(X2,sdtmndt0(X1,X2))
| ~ aElement0(X2)
| ~ isFinite0(sdtmndt0(X1,X2))
| ~ aElementOf0(X2,X1)
| ~ aSet0(X1) ),
inference(csr,[status(thm)],[374,291]) ).
cnf(2331,plain,
( szszuzczcdt0(sbrdtbr0(sdtmndt0(X1,X2))) = sbrdtbr0(X1)
| aElementOf0(X2,sdtmndt0(X1,X2))
| ~ isFinite0(sdtmndt0(X1,X2))
| ~ aElementOf0(X2,X1)
| ~ aSet0(X1) ),
inference(csr,[status(thm)],[2330,62]) ).
cnf(2332,negated_conjecture,
( szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx))) = sbrdtbr0(xS)
| aElementOf0(xx,sdtmndt0(xS,xx))
| ~ aElementOf0(xx,xS)
| ~ aSet0(xS) ),
inference(spm,[status(thm)],[2331,534,theory(equality)]) ).
cnf(2336,negated_conjecture,
( szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx))) = sbrdtbr0(xS)
| aElementOf0(xx,sdtmndt0(xS,xx))
| $false
| ~ aSet0(xS) ),
inference(rw,[status(thm)],[2332,204,theory(equality)]) ).
cnf(2337,negated_conjecture,
( szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx))) = sbrdtbr0(xS)
| aElementOf0(xx,sdtmndt0(xS,xx))
| $false
| $false ),
inference(rw,[status(thm)],[2336,130,theory(equality)]) ).
cnf(2338,negated_conjecture,
( szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx))) = sbrdtbr0(xS)
| aElementOf0(xx,sdtmndt0(xS,xx)) ),
inference(cn,[status(thm)],[2337,theory(equality)]) ).
cnf(2339,negated_conjecture,
aElementOf0(xx,sdtmndt0(xS,xx)),
inference(sr,[status(thm)],[2338,169,theory(equality)]) ).
cnf(2340,negated_conjecture,
$false,
inference(spm,[status(thm)],[172,2339,theory(equality)]) ).
cnf(2373,negated_conjecture,
$false,
2340,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM538+2 : 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 : n067.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 07:58:29 CST 2018
% 0.03/0.23 % 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.40 -running prover on /export/starexec/sandbox2/tmp/tmpMuCKhp/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.40 -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/tmpMuCKhp/sel_theBenchmark.p_1']
% 0.06/0.40 -prover status Theorem
% 0.06/0.40 Problem theBenchmark.p solved in phase 0.
% 0.06/0.40 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.40 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.40 Solved 1 out of 1.
% 0.06/0.40 # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.40 # SZS status Theorem
% 0.06/0.40 # SZS output start CNFRefutation.
% See solution above
% 0.06/0.40 # SZS output end CNFRefutation
%------------------------------------------------------------------------------