TSTP Solution File: NUM588+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM588+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:07:51 EDT 2023
% Result : Theorem 0.15s 0.50s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of formulae : 70 ( 11 unt; 0 def)
% Number of atoms : 340 ( 63 equ)
% Maximal formula atoms : 52 ( 4 avg)
% Number of connectives : 458 ( 188 ~; 194 |; 50 &)
% ( 7 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 8 con; 0-3 aty)
% Number of variables : 111 ( 0 sgn; 60 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefSel,axiom,
! [X1,X2] :
( ( aSet0(X1)
& aElementOf0(X2,szNzAzT0) )
=> ! [X3] :
( X3 = slbdtsldtrb0(X1,X2)
<=> ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
<=> ( aSubsetOf0(X4,X1)
& sbrdtbr0(X4) = X2 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.XkTPRr07Jv/E---3.1_18817.p',mDefSel) ).
fof(m__,conjecture,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ! [X2] :
( ( aSubsetOf0(X2,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& isCountable0(X2) )
=> ! [X3] :
( ( aSet0(X3)
& aElementOf0(X3,slbdtsldtrb0(X2,xk)) )
=> aElementOf0(X3,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))),xk)) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.XkTPRr07Jv/E---3.1_18817.p',m__) ).
fof(mSubTrans,axiom,
! [X1,X2,X3] :
( ( aSet0(X1)
& aSet0(X2)
& aSet0(X3) )
=> ( ( aSubsetOf0(X1,X2)
& aSubsetOf0(X2,X3) )
=> aSubsetOf0(X1,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.XkTPRr07Jv/E---3.1_18817.p',mSubTrans) ).
fof(mDefSub,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.XkTPRr07Jv/E---3.1_18817.p',mDefSub) ).
fof(m__3533,hypothesis,
( aElementOf0(xk,szNzAzT0)
& szszuzczcdt0(xk) = xK ),
file('/export/starexec/sandbox2/tmp/tmp.XkTPRr07Jv/E---3.1_18817.p',m__3533) ).
fof(mDefDiff,axiom,
! [X1,X2] :
( ( aSet0(X1)
& aElement0(X2) )
=> ! [X3] :
( X3 = sdtmndt0(X1,X2)
<=> ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
<=> ( aElement0(X4)
& aElementOf0(X4,X1)
& X4 != X2 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.XkTPRr07Jv/E---3.1_18817.p',mDefDiff) ).
fof(mDefMin,axiom,
! [X1] :
( ( aSubsetOf0(X1,szNzAzT0)
& X1 != slcrc0 )
=> ! [X2] :
( X2 = szmzizndt0(X1)
<=> ( aElementOf0(X2,X1)
& ! [X3] :
( aElementOf0(X3,X1)
=> sdtlseqdt0(X2,X3) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.XkTPRr07Jv/E---3.1_18817.p',mDefMin) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.XkTPRr07Jv/E---3.1_18817.p',mEOfElem) ).
fof(mSubRefl,axiom,
! [X1] :
( aSet0(X1)
=> aSubsetOf0(X1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.XkTPRr07Jv/E---3.1_18817.p',mSubRefl) ).
fof(m__3671,hypothesis,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.XkTPRr07Jv/E---3.1_18817.p',m__3671) ).
fof(mDefEmp,axiom,
! [X1] :
( X1 = slcrc0
<=> ( aSet0(X1)
& ~ ? [X2] : aElementOf0(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.XkTPRr07Jv/E---3.1_18817.p',mDefEmp) ).
fof(mNATSet,axiom,
( aSet0(szNzAzT0)
& isCountable0(szNzAzT0) ),
file('/export/starexec/sandbox2/tmp/tmp.XkTPRr07Jv/E---3.1_18817.p',mNATSet) ).
fof(mCountNFin_01,axiom,
! [X1] :
( ( aSet0(X1)
& isCountable0(X1) )
=> X1 != slcrc0 ),
file('/export/starexec/sandbox2/tmp/tmp.XkTPRr07Jv/E---3.1_18817.p',mCountNFin_01) ).
fof(c_0_13,plain,
! [X66,X67,X68,X69,X70,X71] :
( ( aSet0(X68)
| X68 != slbdtsldtrb0(X66,X67)
| ~ aSet0(X66)
| ~ aElementOf0(X67,szNzAzT0) )
& ( aSubsetOf0(X69,X66)
| ~ aElementOf0(X69,X68)
| X68 != slbdtsldtrb0(X66,X67)
| ~ aSet0(X66)
| ~ aElementOf0(X67,szNzAzT0) )
& ( sbrdtbr0(X69) = X67
| ~ aElementOf0(X69,X68)
| X68 != slbdtsldtrb0(X66,X67)
| ~ aSet0(X66)
| ~ aElementOf0(X67,szNzAzT0) )
& ( ~ aSubsetOf0(X70,X66)
| sbrdtbr0(X70) != X67
| aElementOf0(X70,X68)
| X68 != slbdtsldtrb0(X66,X67)
| ~ aSet0(X66)
| ~ aElementOf0(X67,szNzAzT0) )
& ( ~ aElementOf0(esk12_3(X66,X67,X71),X71)
| ~ aSubsetOf0(esk12_3(X66,X67,X71),X66)
| sbrdtbr0(esk12_3(X66,X67,X71)) != X67
| ~ aSet0(X71)
| X71 = slbdtsldtrb0(X66,X67)
| ~ aSet0(X66)
| ~ aElementOf0(X67,szNzAzT0) )
& ( aSubsetOf0(esk12_3(X66,X67,X71),X66)
| aElementOf0(esk12_3(X66,X67,X71),X71)
| ~ aSet0(X71)
| X71 = slbdtsldtrb0(X66,X67)
| ~ aSet0(X66)
| ~ aElementOf0(X67,szNzAzT0) )
& ( sbrdtbr0(esk12_3(X66,X67,X71)) = X67
| aElementOf0(esk12_3(X66,X67,X71),X71)
| ~ aSet0(X71)
| X71 = slbdtsldtrb0(X66,X67)
| ~ aSet0(X66)
| ~ aElementOf0(X67,szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefSel])])])])])]) ).
fof(c_0_14,negated_conjecture,
~ ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ! [X2] :
( ( aSubsetOf0(X2,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& isCountable0(X2) )
=> ! [X3] :
( ( aSet0(X3)
& aElementOf0(X3,slbdtsldtrb0(X2,xk)) )
=> aElementOf0(X3,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))),xk)) ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_15,plain,
! [X43,X44,X45] :
( ~ aSet0(X43)
| ~ aSet0(X44)
| ~ aSet0(X45)
| ~ aSubsetOf0(X43,X44)
| ~ aSubsetOf0(X44,X45)
| aSubsetOf0(X43,X45) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSubTrans])]) ).
fof(c_0_16,plain,
! [X35,X36,X37,X38] :
( ( aSet0(X36)
| ~ aSubsetOf0(X36,X35)
| ~ aSet0(X35) )
& ( ~ aElementOf0(X37,X36)
| aElementOf0(X37,X35)
| ~ aSubsetOf0(X36,X35)
| ~ aSet0(X35) )
& ( aElementOf0(esk6_2(X35,X38),X38)
| ~ aSet0(X38)
| aSubsetOf0(X38,X35)
| ~ aSet0(X35) )
& ( ~ aElementOf0(esk6_2(X35,X38),X35)
| ~ aSet0(X38)
| aSubsetOf0(X38,X35)
| ~ aSet0(X35) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefSub])])])])])]) ).
cnf(c_0_17,plain,
( sbrdtbr0(X1) = X2
| ~ aElementOf0(X1,X3)
| X3 != slbdtsldtrb0(X4,X2)
| ~ aSet0(X4)
| ~ aElementOf0(X2,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_18,negated_conjecture,
( aElementOf0(esk3_0,szNzAzT0)
& aSubsetOf0(esk4_0,sdtmndt0(sdtlpdtrp0(xN,esk3_0),szmzizndt0(sdtlpdtrp0(xN,esk3_0))))
& isCountable0(esk4_0)
& aSet0(esk5_0)
& aElementOf0(esk5_0,slbdtsldtrb0(esk4_0,xk))
& ~ aElementOf0(esk5_0,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,esk3_0),szmzizndt0(sdtlpdtrp0(xN,esk3_0))),xk)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])]) ).
cnf(c_0_19,plain,
( aSubsetOf0(X1,X3)
| ~ aSet0(X1)
| ~ aSet0(X2)
| ~ aSet0(X3)
| ~ aSubsetOf0(X1,X2)
| ~ aSubsetOf0(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
( aSet0(X1)
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
( aElementOf0(X1,X4)
| ~ aSubsetOf0(X1,X2)
| sbrdtbr0(X1) != X3
| X4 != slbdtsldtrb0(X2,X3)
| ~ aSet0(X2)
| ~ aElementOf0(X3,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,plain,
( sbrdtbr0(X1) = X2
| ~ aElementOf0(X1,slbdtsldtrb0(X3,X2))
| ~ aElementOf0(X2,szNzAzT0)
| ~ aSet0(X3) ),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_23,negated_conjecture,
aElementOf0(esk5_0,slbdtsldtrb0(esk4_0,xk)),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,hypothesis,
aElementOf0(xk,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3533]) ).
cnf(c_0_25,plain,
( aSubsetOf0(X1,X2)
| ~ aSubsetOf0(X3,X2)
| ~ aSubsetOf0(X1,X3)
| ~ aSet0(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_19,c_0_20]),c_0_20]) ).
cnf(c_0_26,negated_conjecture,
aSubsetOf0(esk4_0,sdtmndt0(sdtlpdtrp0(xN,esk3_0),szmzizndt0(sdtlpdtrp0(xN,esk3_0)))),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,plain,
( aSubsetOf0(X1,X2)
| ~ aElementOf0(X1,X3)
| X3 != slbdtsldtrb0(X2,X4)
| ~ aSet0(X2)
| ~ aElementOf0(X4,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_28,plain,
( aElementOf0(X1,slbdtsldtrb0(X2,sbrdtbr0(X1)))
| ~ aSubsetOf0(X1,X2)
| ~ aElementOf0(sbrdtbr0(X1),szNzAzT0)
| ~ aSet0(X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_21])]) ).
cnf(c_0_29,negated_conjecture,
( sbrdtbr0(esk5_0) = xk
| ~ aSet0(esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_30,negated_conjecture,
( aSubsetOf0(X1,sdtmndt0(sdtlpdtrp0(xN,esk3_0),szmzizndt0(sdtlpdtrp0(xN,esk3_0))))
| ~ aSubsetOf0(X1,esk4_0)
| ~ aSet0(sdtmndt0(sdtlpdtrp0(xN,esk3_0),szmzizndt0(sdtlpdtrp0(xN,esk3_0)))) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,plain,
( aSubsetOf0(X1,X2)
| ~ aElementOf0(X1,slbdtsldtrb0(X2,X3))
| ~ aElementOf0(X3,szNzAzT0)
| ~ aSet0(X2) ),
inference(er,[status(thm)],[c_0_27]) ).
cnf(c_0_32,negated_conjecture,
~ aElementOf0(esk5_0,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,esk3_0),szmzizndt0(sdtlpdtrp0(xN,esk3_0))),xk)),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_33,negated_conjecture,
( aElementOf0(esk5_0,slbdtsldtrb0(X1,xk))
| ~ aSubsetOf0(esk5_0,X1)
| ~ aSet0(esk4_0)
| ~ aSet0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_24])]) ).
cnf(c_0_34,negated_conjecture,
( aSet0(esk4_0)
| ~ aSet0(sdtmndt0(sdtlpdtrp0(xN,esk3_0),szmzizndt0(sdtlpdtrp0(xN,esk3_0)))) ),
inference(spm,[status(thm)],[c_0_20,c_0_26]) ).
cnf(c_0_35,negated_conjecture,
( aSubsetOf0(X1,sdtmndt0(sdtlpdtrp0(xN,esk3_0),szmzizndt0(sdtlpdtrp0(xN,esk3_0))))
| ~ aSubsetOf0(X2,esk4_0)
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(sdtmndt0(sdtlpdtrp0(xN,esk3_0),szmzizndt0(sdtlpdtrp0(xN,esk3_0)))) ),
inference(spm,[status(thm)],[c_0_25,c_0_30]) ).
cnf(c_0_36,negated_conjecture,
( aSubsetOf0(esk5_0,esk4_0)
| ~ aSet0(esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_23]),c_0_24])]) ).
fof(c_0_37,plain,
! [X99,X100,X101,X102,X103,X104] :
( ( aSet0(X101)
| X101 != sdtmndt0(X99,X100)
| ~ aSet0(X99)
| ~ aElement0(X100) )
& ( aElement0(X102)
| ~ aElementOf0(X102,X101)
| X101 != sdtmndt0(X99,X100)
| ~ aSet0(X99)
| ~ aElement0(X100) )
& ( aElementOf0(X102,X99)
| ~ aElementOf0(X102,X101)
| X101 != sdtmndt0(X99,X100)
| ~ aSet0(X99)
| ~ aElement0(X100) )
& ( X102 != X100
| ~ aElementOf0(X102,X101)
| X101 != sdtmndt0(X99,X100)
| ~ aSet0(X99)
| ~ aElement0(X100) )
& ( ~ aElement0(X103)
| ~ aElementOf0(X103,X99)
| X103 = X100
| aElementOf0(X103,X101)
| X101 != sdtmndt0(X99,X100)
| ~ aSet0(X99)
| ~ aElement0(X100) )
& ( ~ aElementOf0(esk15_3(X99,X100,X104),X104)
| ~ aElement0(esk15_3(X99,X100,X104))
| ~ aElementOf0(esk15_3(X99,X100,X104),X99)
| esk15_3(X99,X100,X104) = X100
| ~ aSet0(X104)
| X104 = sdtmndt0(X99,X100)
| ~ aSet0(X99)
| ~ aElement0(X100) )
& ( aElement0(esk15_3(X99,X100,X104))
| aElementOf0(esk15_3(X99,X100,X104),X104)
| ~ aSet0(X104)
| X104 = sdtmndt0(X99,X100)
| ~ aSet0(X99)
| ~ aElement0(X100) )
& ( aElementOf0(esk15_3(X99,X100,X104),X99)
| aElementOf0(esk15_3(X99,X100,X104),X104)
| ~ aSet0(X104)
| X104 = sdtmndt0(X99,X100)
| ~ aSet0(X99)
| ~ aElement0(X100) )
& ( esk15_3(X99,X100,X104) != X100
| aElementOf0(esk15_3(X99,X100,X104),X104)
| ~ aSet0(X104)
| X104 = sdtmndt0(X99,X100)
| ~ aSet0(X99)
| ~ aElement0(X100) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefDiff])])])])])]) ).
fof(c_0_38,plain,
! [X114,X115,X116,X117] :
( ( aElementOf0(X115,X114)
| X115 != szmzizndt0(X114)
| ~ aSubsetOf0(X114,szNzAzT0)
| X114 = slcrc0 )
& ( ~ aElementOf0(X116,X114)
| sdtlseqdt0(X115,X116)
| X115 != szmzizndt0(X114)
| ~ aSubsetOf0(X114,szNzAzT0)
| X114 = slcrc0 )
& ( aElementOf0(esk16_2(X114,X117),X114)
| ~ aElementOf0(X117,X114)
| X117 = szmzizndt0(X114)
| ~ aSubsetOf0(X114,szNzAzT0)
| X114 = slcrc0 )
& ( ~ sdtlseqdt0(X117,esk16_2(X114,X117))
| ~ aElementOf0(X117,X114)
| X117 = szmzizndt0(X114)
| ~ aSubsetOf0(X114,szNzAzT0)
| X114 = slcrc0 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefMin])])])])])]) ).
cnf(c_0_39,negated_conjecture,
( ~ aSubsetOf0(esk5_0,sdtmndt0(sdtlpdtrp0(xN,esk3_0),szmzizndt0(sdtlpdtrp0(xN,esk3_0))))
| ~ aSet0(sdtmndt0(sdtlpdtrp0(xN,esk3_0),szmzizndt0(sdtlpdtrp0(xN,esk3_0)))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_40,negated_conjecture,
( aSubsetOf0(X1,sdtmndt0(sdtlpdtrp0(xN,esk3_0),szmzizndt0(sdtlpdtrp0(xN,esk3_0))))
| ~ aSubsetOf0(X1,esk5_0)
| ~ aSet0(sdtmndt0(sdtlpdtrp0(xN,esk3_0),szmzizndt0(sdtlpdtrp0(xN,esk3_0)))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_34]) ).
cnf(c_0_41,plain,
( aSet0(X1)
| X1 != sdtmndt0(X2,X3)
| ~ aSet0(X2)
| ~ aElement0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
fof(c_0_42,plain,
! [X144,X145] :
( ~ aSet0(X144)
| ~ aElementOf0(X145,X144)
| aElement0(X145) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])]) ).
cnf(c_0_43,plain,
( aElementOf0(X1,X2)
| X2 = slcrc0
| X1 != szmzizndt0(X2)
| ~ aSubsetOf0(X2,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_44,negated_conjecture,
( ~ aSubsetOf0(esk5_0,esk5_0)
| ~ aSet0(sdtmndt0(sdtlpdtrp0(xN,esk3_0),szmzizndt0(sdtlpdtrp0(xN,esk3_0)))) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_45,plain,
( aSet0(sdtmndt0(X1,X2))
| ~ aElement0(X2)
| ~ aSet0(X1) ),
inference(er,[status(thm)],[c_0_41]) ).
cnf(c_0_46,plain,
( aElement0(X2)
| ~ aSet0(X1)
| ~ aElementOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_47,plain,
( X1 = slcrc0
| aElementOf0(szmzizndt0(X1),X1)
| ~ aSubsetOf0(X1,szNzAzT0) ),
inference(er,[status(thm)],[c_0_43]) ).
cnf(c_0_48,negated_conjecture,
( ~ aSubsetOf0(esk5_0,esk5_0)
| ~ aElement0(szmzizndt0(sdtlpdtrp0(xN,esk3_0)))
| ~ aSet0(sdtlpdtrp0(xN,esk3_0)) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_49,plain,
( X1 = slcrc0
| aElement0(szmzizndt0(X1))
| ~ aSubsetOf0(X1,szNzAzT0)
| ~ aSet0(X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
fof(c_0_50,plain,
! [X40] :
( ~ aSet0(X40)
| aSubsetOf0(X40,X40) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSubRefl])]) ).
cnf(c_0_51,negated_conjecture,
( sdtlpdtrp0(xN,esk3_0) = slcrc0
| ~ aSubsetOf0(sdtlpdtrp0(xN,esk3_0),szNzAzT0)
| ~ aSubsetOf0(esk5_0,esk5_0)
| ~ aSet0(sdtlpdtrp0(xN,esk3_0)) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_52,plain,
( aSubsetOf0(X1,X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_53,negated_conjecture,
aSet0(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_54,hypothesis,
! [X14] :
( ( aSubsetOf0(sdtlpdtrp0(xN,X14),szNzAzT0)
| ~ aElementOf0(X14,szNzAzT0) )
& ( isCountable0(sdtlpdtrp0(xN,X14))
| ~ aElementOf0(X14,szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3671])])]) ).
fof(c_0_55,plain,
! [X140,X141,X142] :
( ( aSet0(X140)
| X140 != slcrc0 )
& ( ~ aElementOf0(X141,X140)
| X140 != slcrc0 )
& ( ~ aSet0(X142)
| aElementOf0(esk18_1(X142),X142)
| X142 = slcrc0 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefEmp])])])])])]) ).
cnf(c_0_56,negated_conjecture,
( sdtlpdtrp0(xN,esk3_0) = slcrc0
| ~ aSubsetOf0(sdtlpdtrp0(xN,esk3_0),szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53])]) ).
cnf(c_0_57,hypothesis,
( aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_58,negated_conjecture,
aElementOf0(esk3_0,szNzAzT0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_59,plain,
aSet0(szNzAzT0),
inference(split_conjunct,[status(thm)],[mNATSet]) ).
fof(c_0_60,plain,
! [X30] :
( ~ aSet0(X30)
| ~ isCountable0(X30)
| X30 != slcrc0 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mCountNFin_01])]) ).
cnf(c_0_61,plain,
( aSet0(X1)
| X1 != slcrc0 ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_62,hypothesis,
( sdtlpdtrp0(xN,esk3_0) = slcrc0
| ~ aSet0(sdtlpdtrp0(xN,esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58])]) ).
cnf(c_0_63,hypothesis,
( aSet0(sdtlpdtrp0(xN,X1))
| ~ aElementOf0(X1,szNzAzT0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_57]),c_0_59])]) ).
cnf(c_0_64,plain,
( ~ aSet0(X1)
| ~ isCountable0(X1)
| X1 != slcrc0 ),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_65,plain,
aSet0(slcrc0),
inference(er,[status(thm)],[c_0_61]) ).
cnf(c_0_66,hypothesis,
( isCountable0(sdtlpdtrp0(xN,X1))
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_67,hypothesis,
sdtlpdtrp0(xN,esk3_0) = slcrc0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_58])]) ).
cnf(c_0_68,plain,
~ isCountable0(slcrc0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_64]),c_0_65])]) ).
cnf(c_0_69,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_58])]),c_0_68]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : NUM588+1 : TPTP v8.1.2. Released v4.0.0.
% 0.02/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n011.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 15:01:53 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.42 Running first-order model finding
% 0.15/0.42 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.XkTPRr07Jv/E---3.1_18817.p
% 0.15/0.50 # Version: 3.1pre001
% 0.15/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.50 # Starting sh5l with 300s (1) cores
% 0.15/0.50 # new_bool_3 with pid 18895 completed with status 0
% 0.15/0.50 # Result found by new_bool_3
% 0.15/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.50 # Search class: FGHSF-FSLM32-MFFFFFNN
% 0.15/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 163s (1) cores
% 0.15/0.50 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 18898 completed with status 0
% 0.15/0.50 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.15/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.50 # Search class: FGHSF-FSLM32-MFFFFFNN
% 0.15/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 163s (1) cores
% 0.15/0.50 # Preprocessing time : 0.003 s
% 0.15/0.50 # Presaturation interreduction done
% 0.15/0.50
% 0.15/0.50 # Proof found!
% 0.15/0.50 # SZS status Theorem
% 0.15/0.50 # SZS output start CNFRefutation
% See solution above
% 0.15/0.50 # Parsed axioms : 88
% 0.15/0.50 # Removed by relevancy pruning/SinE : 5
% 0.15/0.50 # Initial clauses : 163
% 0.15/0.50 # Removed in clause preprocessing : 7
% 0.15/0.50 # Initial clauses in saturation : 156
% 0.15/0.50 # Processed clauses : 623
% 0.15/0.50 # ...of these trivial : 4
% 0.15/0.50 # ...subsumed : 74
% 0.15/0.50 # ...remaining for further processing : 545
% 0.15/0.50 # Other redundant clauses eliminated : 38
% 0.15/0.50 # Clauses deleted for lack of memory : 0
% 0.15/0.50 # Backward-subsumed : 10
% 0.15/0.50 # Backward-rewritten : 24
% 0.15/0.50 # Generated clauses : 1218
% 0.15/0.50 # ...of the previous two non-redundant : 1094
% 0.15/0.50 # ...aggressively subsumed : 0
% 0.15/0.50 # Contextual simplify-reflections : 34
% 0.15/0.50 # Paramodulations : 1182
% 0.15/0.50 # Factorizations : 0
% 0.15/0.50 # NegExts : 0
% 0.15/0.50 # Equation resolutions : 40
% 0.15/0.50 # Total rewrite steps : 757
% 0.15/0.50 # Propositional unsat checks : 0
% 0.15/0.50 # Propositional check models : 0
% 0.15/0.50 # Propositional check unsatisfiable : 0
% 0.15/0.50 # Propositional clauses : 0
% 0.15/0.50 # Propositional clauses after purity: 0
% 0.15/0.50 # Propositional unsat core size : 0
% 0.15/0.50 # Propositional preprocessing time : 0.000
% 0.15/0.50 # Propositional encoding time : 0.000
% 0.15/0.50 # Propositional solver time : 0.000
% 0.15/0.50 # Success case prop preproc time : 0.000
% 0.15/0.50 # Success case prop encoding time : 0.000
% 0.15/0.50 # Success case prop solver time : 0.000
% 0.15/0.50 # Current number of processed clauses : 327
% 0.15/0.50 # Positive orientable unit clauses : 57
% 0.15/0.50 # Positive unorientable unit clauses: 0
% 0.15/0.50 # Negative unit clauses : 15
% 0.15/0.50 # Non-unit-clauses : 255
% 0.15/0.50 # Current number of unprocessed clauses: 755
% 0.15/0.50 # ...number of literals in the above : 4195
% 0.15/0.50 # Current number of archived formulas : 0
% 0.15/0.50 # Current number of archived clauses : 189
% 0.15/0.50 # Clause-clause subsumption calls (NU) : 16842
% 0.15/0.50 # Rec. Clause-clause subsumption calls : 5962
% 0.15/0.50 # Non-unit clause-clause subsumptions : 89
% 0.15/0.50 # Unit Clause-clause subsumption calls : 1247
% 0.15/0.50 # Rewrite failures with RHS unbound : 0
% 0.15/0.50 # BW rewrite match attempts : 2
% 0.15/0.50 # BW rewrite match successes : 2
% 0.15/0.50 # Condensation attempts : 0
% 0.15/0.50 # Condensation successes : 0
% 0.15/0.50 # Termbank termtop insertions : 36071
% 0.15/0.50
% 0.15/0.50 # -------------------------------------------------
% 0.15/0.50 # User time : 0.059 s
% 0.15/0.50 # System time : 0.009 s
% 0.15/0.50 # Total time : 0.069 s
% 0.15/0.50 # Maximum resident set size: 2356 pages
% 0.15/0.50
% 0.15/0.50 # -------------------------------------------------
% 0.15/0.50 # User time : 0.062 s
% 0.15/0.50 # System time : 0.011 s
% 0.15/0.50 # Total time : 0.073 s
% 0.15/0.50 # Maximum resident set size: 1792 pages
% 0.15/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------