TSTP Solution File: NUM566+3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM566+3 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 01:14:44 EDT 2024
% Result : Theorem 22.64s 3.45s
% Output : CNFRefutation 22.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of formulae : 54 ( 12 unt; 0 def)
% Number of atoms : 358 ( 57 equ)
% Maximal formula atoms : 87 ( 6 avg)
% Number of connectives : 483 ( 179 ~; 182 |; 98 &)
% ( 3 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 7 con; 0-2 aty)
% Number of variables : 85 ( 1 sgn 47 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mSubTrans,axiom,
! [X1,X2,X3] :
( ( aSet0(X1)
& aSet0(X2)
& aSet0(X3) )
=> ( ( aSubsetOf0(X1,X2)
& aSubsetOf0(X2,X3) )
=> aSubsetOf0(X1,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSubTrans) ).
fof(mDefSub,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefSub) ).
fof(m__3453,hypothesis,
( aFunction0(xc)
& ! [X1] :
( ( aElementOf0(X1,szDzozmdt0(xc))
=> ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xS) )
& aSubsetOf0(X1,xS)
& sbrdtbr0(X1) = xK ) )
& ( ( ( ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xS) ) )
| aSubsetOf0(X1,xS) )
& sbrdtbr0(X1) = xK )
=> aElementOf0(X1,szDzozmdt0(xc)) ) )
& szDzozmdt0(xc) = slbdtsldtrb0(xS,xK)
& aSet0(sdtlcdtrc0(xc,szDzozmdt0(xc)))
& ! [X1] :
( aElementOf0(X1,sdtlcdtrc0(xc,szDzozmdt0(xc)))
<=> ? [X2] :
( aElementOf0(X2,szDzozmdt0(xc))
& sdtlpdtrp0(xc,X2) = X1 ) )
& ! [X1] :
( aElementOf0(X1,sdtlcdtrc0(xc,szDzozmdt0(xc)))
=> aElementOf0(X1,xT) )
& aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3453) ).
fof(m__3435,hypothesis,
( aSet0(xS)
& ! [X1] :
( aElementOf0(X1,xS)
=> aElementOf0(X1,szNzAzT0) )
& aSubsetOf0(xS,szNzAzT0)
& isCountable0(xS) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3435) ).
fof(m__,conjecture,
? [X1] :
( aElementOf0(X1,xT)
& ? [X2] :
( ( ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,xS) ) )
| aSubsetOf0(X2,xS) )
& isCountable0(X2)
& ! [X3] :
( ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
=> aElementOf0(X4,X2) )
& aSubsetOf0(X3,X2)
& sbrdtbr0(X3) = xK
& aElementOf0(X3,slbdtsldtrb0(X2,xK)) )
=> sdtlpdtrp0(xc,X3) = X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mSubRefl,axiom,
! [X1] :
( aSet0(X1)
=> aSubsetOf0(X1,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSubRefl) ).
fof(m__3507,hypothesis,
! [X1] :
( ( ( ( ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xS) ) )
| aSubsetOf0(X1,xS) )
& sbrdtbr0(X1) = sz00 )
| aElementOf0(X1,slbdtsldtrb0(xS,sz00)) )
=> ( aSet0(slcrc0)
& ~ ? [X2] : aElementOf0(X2,slcrc0)
& sdtlpdtrp0(xc,X1) = sdtlpdtrp0(xc,slcrc0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3507) ).
fof(mNATSet,axiom,
( aSet0(szNzAzT0)
& isCountable0(szNzAzT0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mNATSet) ).
fof(m__3462,hypothesis,
xK = sz00,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3462) ).
fof(m__3476,hypothesis,
( aSet0(slcrc0)
& ~ ? [X1] : aElementOf0(X1,slcrc0)
& ! [X1] :
( aElementOf0(X1,slcrc0)
=> aElementOf0(X1,xS) )
& aSubsetOf0(slcrc0,xS)
& aElementOf0(slcrc0,slbdtsldtrb0(xS,sz00)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3476) ).
fof(mCardEmpty,axiom,
! [X1] :
( aSet0(X1)
=> ( sbrdtbr0(X1) = sz00
<=> X1 = slcrc0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mCardEmpty) ).
fof(c_0_11,plain,
! [X69,X70,X71] :
( ~ aSet0(X69)
| ~ aSet0(X70)
| ~ aSet0(X71)
| ~ aSubsetOf0(X69,X70)
| ~ aSubsetOf0(X70,X71)
| aSubsetOf0(X69,X71) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSubTrans])])]) ).
fof(c_0_12,plain,
! [X61,X62,X63,X64] :
( ( aSet0(X62)
| ~ aSubsetOf0(X62,X61)
| ~ aSet0(X61) )
& ( ~ aElementOf0(X63,X62)
| aElementOf0(X63,X61)
| ~ aSubsetOf0(X62,X61)
| ~ aSet0(X61) )
& ( aElementOf0(esk16_2(X61,X64),X64)
| ~ aSet0(X64)
| aSubsetOf0(X64,X61)
| ~ aSet0(X61) )
& ( ~ aElementOf0(esk16_2(X61,X64),X61)
| ~ aSet0(X64)
| aSubsetOf0(X64,X61)
| ~ aSet0(X61) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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])])])])])])]) ).
fof(c_0_13,hypothesis,
! [X9,X10,X11,X13,X15,X16,X17] :
( aFunction0(xc)
& ( aSet0(X9)
| ~ aElementOf0(X9,szDzozmdt0(xc)) )
& ( ~ aElementOf0(X10,X9)
| aElementOf0(X10,xS)
| ~ aElementOf0(X9,szDzozmdt0(xc)) )
& ( aSubsetOf0(X9,xS)
| ~ aElementOf0(X9,szDzozmdt0(xc)) )
& ( sbrdtbr0(X9) = xK
| ~ aElementOf0(X9,szDzozmdt0(xc)) )
& ( aElementOf0(esk1_1(X11),X11)
| ~ aSet0(X11)
| sbrdtbr0(X11) != xK
| aElementOf0(X11,szDzozmdt0(xc)) )
& ( ~ aElementOf0(esk1_1(X11),xS)
| ~ aSet0(X11)
| sbrdtbr0(X11) != xK
| aElementOf0(X11,szDzozmdt0(xc)) )
& ( ~ aSubsetOf0(X11,xS)
| sbrdtbr0(X11) != xK
| aElementOf0(X11,szDzozmdt0(xc)) )
& szDzozmdt0(xc) = slbdtsldtrb0(xS,xK)
& aSet0(sdtlcdtrc0(xc,szDzozmdt0(xc)))
& ( aElementOf0(esk2_1(X13),szDzozmdt0(xc))
| ~ aElementOf0(X13,sdtlcdtrc0(xc,szDzozmdt0(xc))) )
& ( sdtlpdtrp0(xc,esk2_1(X13)) = X13
| ~ aElementOf0(X13,sdtlcdtrc0(xc,szDzozmdt0(xc))) )
& ( ~ aElementOf0(X16,szDzozmdt0(xc))
| sdtlpdtrp0(xc,X16) != X15
| aElementOf0(X15,sdtlcdtrc0(xc,szDzozmdt0(xc))) )
& ( ~ aElementOf0(X17,sdtlcdtrc0(xc,szDzozmdt0(xc)))
| aElementOf0(X17,xT) )
& aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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)],[m__3453])])])])])])]) ).
cnf(c_0_14,plain,
( aSubsetOf0(X1,X3)
| ~ aSet0(X1)
| ~ aSet0(X2)
| ~ aSet0(X3)
| ~ aSubsetOf0(X1,X2)
| ~ aSubsetOf0(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
( aSet0(X1)
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,hypothesis,
! [X8] :
( aSet0(xS)
& ( ~ aElementOf0(X8,xS)
| aElementOf0(X8,szNzAzT0) )
& aSubsetOf0(xS,szNzAzT0)
& isCountable0(xS) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3435])])])]) ).
fof(c_0_17,negated_conjecture,
~ ? [X1] :
( aElementOf0(X1,xT)
& ? [X2] :
( ( ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,xS) ) )
| aSubsetOf0(X2,xS) )
& isCountable0(X2)
& ! [X3] :
( ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
=> aElementOf0(X4,X2) )
& aSubsetOf0(X3,X2)
& sbrdtbr0(X3) = xK
& aElementOf0(X3,slbdtsldtrb0(X2,xK)) )
=> sdtlpdtrp0(xc,X3) = X1 ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_18,plain,
! [X66] :
( ~ aSet0(X66)
| aSubsetOf0(X66,X66) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSubRefl])])]) ).
cnf(c_0_19,hypothesis,
( aElementOf0(X2,sdtlcdtrc0(xc,szDzozmdt0(xc)))
| ~ aElementOf0(X1,szDzozmdt0(xc))
| sdtlpdtrp0(xc,X1) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_20,hypothesis,
! [X38,X40] :
( ( aSet0(slcrc0)
| aElementOf0(esk12_1(X38),X38)
| ~ aSet0(X38)
| sbrdtbr0(X38) != sz00 )
& ( ~ aElementOf0(X40,slcrc0)
| aElementOf0(esk12_1(X38),X38)
| ~ aSet0(X38)
| sbrdtbr0(X38) != sz00 )
& ( sdtlpdtrp0(xc,X38) = sdtlpdtrp0(xc,slcrc0)
| aElementOf0(esk12_1(X38),X38)
| ~ aSet0(X38)
| sbrdtbr0(X38) != sz00 )
& ( aSet0(slcrc0)
| ~ aElementOf0(esk12_1(X38),xS)
| ~ aSet0(X38)
| sbrdtbr0(X38) != sz00 )
& ( ~ aElementOf0(X40,slcrc0)
| ~ aElementOf0(esk12_1(X38),xS)
| ~ aSet0(X38)
| sbrdtbr0(X38) != sz00 )
& ( sdtlpdtrp0(xc,X38) = sdtlpdtrp0(xc,slcrc0)
| ~ aElementOf0(esk12_1(X38),xS)
| ~ aSet0(X38)
| sbrdtbr0(X38) != sz00 )
& ( aSet0(slcrc0)
| ~ aSubsetOf0(X38,xS)
| sbrdtbr0(X38) != sz00 )
& ( ~ aElementOf0(X40,slcrc0)
| ~ aSubsetOf0(X38,xS)
| sbrdtbr0(X38) != sz00 )
& ( sdtlpdtrp0(xc,X38) = sdtlpdtrp0(xc,slcrc0)
| ~ aSubsetOf0(X38,xS)
| sbrdtbr0(X38) != sz00 )
& ( aSet0(slcrc0)
| ~ aElementOf0(X38,slbdtsldtrb0(xS,sz00)) )
& ( ~ aElementOf0(X40,slcrc0)
| ~ aElementOf0(X38,slbdtsldtrb0(xS,sz00)) )
& ( sdtlpdtrp0(xc,X38) = sdtlpdtrp0(xc,slcrc0)
| ~ aElementOf0(X38,slbdtsldtrb0(xS,sz00)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3507])])])])])]) ).
cnf(c_0_21,plain,
( aSubsetOf0(X1,X2)
| ~ aSubsetOf0(X3,X2)
| ~ aSubsetOf0(X1,X3)
| ~ aSet0(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_14,c_0_15]),c_0_15]) ).
cnf(c_0_22,hypothesis,
aSubsetOf0(xS,szNzAzT0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
aSet0(szNzAzT0),
inference(split_conjunct,[status(thm)],[mNATSet]) ).
fof(c_0_24,negated_conjecture,
! [X41,X42,X45] :
( ( aSet0(esk14_2(X41,X42))
| aElementOf0(esk13_2(X41,X42),X42)
| ~ aSet0(X42)
| ~ isCountable0(X42)
| ~ aElementOf0(X41,xT) )
& ( ~ aElementOf0(X45,esk14_2(X41,X42))
| aElementOf0(X45,X42)
| aElementOf0(esk13_2(X41,X42),X42)
| ~ aSet0(X42)
| ~ isCountable0(X42)
| ~ aElementOf0(X41,xT) )
& ( aSubsetOf0(esk14_2(X41,X42),X42)
| aElementOf0(esk13_2(X41,X42),X42)
| ~ aSet0(X42)
| ~ isCountable0(X42)
| ~ aElementOf0(X41,xT) )
& ( sbrdtbr0(esk14_2(X41,X42)) = xK
| aElementOf0(esk13_2(X41,X42),X42)
| ~ aSet0(X42)
| ~ isCountable0(X42)
| ~ aElementOf0(X41,xT) )
& ( aElementOf0(esk14_2(X41,X42),slbdtsldtrb0(X42,xK))
| aElementOf0(esk13_2(X41,X42),X42)
| ~ aSet0(X42)
| ~ isCountable0(X42)
| ~ aElementOf0(X41,xT) )
& ( sdtlpdtrp0(xc,esk14_2(X41,X42)) != X41
| aElementOf0(esk13_2(X41,X42),X42)
| ~ aSet0(X42)
| ~ isCountable0(X42)
| ~ aElementOf0(X41,xT) )
& ( aSet0(esk14_2(X41,X42))
| ~ aElementOf0(esk13_2(X41,X42),xS)
| ~ aSet0(X42)
| ~ isCountable0(X42)
| ~ aElementOf0(X41,xT) )
& ( ~ aElementOf0(X45,esk14_2(X41,X42))
| aElementOf0(X45,X42)
| ~ aElementOf0(esk13_2(X41,X42),xS)
| ~ aSet0(X42)
| ~ isCountable0(X42)
| ~ aElementOf0(X41,xT) )
& ( aSubsetOf0(esk14_2(X41,X42),X42)
| ~ aElementOf0(esk13_2(X41,X42),xS)
| ~ aSet0(X42)
| ~ isCountable0(X42)
| ~ aElementOf0(X41,xT) )
& ( sbrdtbr0(esk14_2(X41,X42)) = xK
| ~ aElementOf0(esk13_2(X41,X42),xS)
| ~ aSet0(X42)
| ~ isCountable0(X42)
| ~ aElementOf0(X41,xT) )
& ( aElementOf0(esk14_2(X41,X42),slbdtsldtrb0(X42,xK))
| ~ aElementOf0(esk13_2(X41,X42),xS)
| ~ aSet0(X42)
| ~ isCountable0(X42)
| ~ aElementOf0(X41,xT) )
& ( sdtlpdtrp0(xc,esk14_2(X41,X42)) != X41
| ~ aElementOf0(esk13_2(X41,X42),xS)
| ~ aSet0(X42)
| ~ isCountable0(X42)
| ~ aElementOf0(X41,xT) )
& ( aSet0(esk14_2(X41,X42))
| ~ aSubsetOf0(X42,xS)
| ~ isCountable0(X42)
| ~ aElementOf0(X41,xT) )
& ( ~ aElementOf0(X45,esk14_2(X41,X42))
| aElementOf0(X45,X42)
| ~ aSubsetOf0(X42,xS)
| ~ isCountable0(X42)
| ~ aElementOf0(X41,xT) )
& ( aSubsetOf0(esk14_2(X41,X42),X42)
| ~ aSubsetOf0(X42,xS)
| ~ isCountable0(X42)
| ~ aElementOf0(X41,xT) )
& ( sbrdtbr0(esk14_2(X41,X42)) = xK
| ~ aSubsetOf0(X42,xS)
| ~ isCountable0(X42)
| ~ aElementOf0(X41,xT) )
& ( aElementOf0(esk14_2(X41,X42),slbdtsldtrb0(X42,xK))
| ~ aSubsetOf0(X42,xS)
| ~ isCountable0(X42)
| ~ aElementOf0(X41,xT) )
& ( sdtlpdtrp0(xc,esk14_2(X41,X42)) != X41
| ~ aSubsetOf0(X42,xS)
| ~ isCountable0(X42)
| ~ aElementOf0(X41,xT) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])])])]) ).
cnf(c_0_25,plain,
( aSubsetOf0(X1,X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,hypothesis,
aSet0(xS),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_27,hypothesis,
( aElementOf0(X1,xT)
| ~ aElementOf0(X1,sdtlcdtrc0(xc,szDzozmdt0(xc))) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_28,hypothesis,
( aElementOf0(sdtlpdtrp0(xc,X1),sdtlcdtrc0(xc,szDzozmdt0(xc)))
| ~ aElementOf0(X1,szDzozmdt0(xc)) ),
inference(er,[status(thm)],[c_0_19]) ).
cnf(c_0_29,hypothesis,
( sdtlpdtrp0(xc,X1) = sdtlpdtrp0(xc,slcrc0)
| ~ aElementOf0(X1,slbdtsldtrb0(xS,sz00)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_30,hypothesis,
xK = sz00,
inference(split_conjunct,[status(thm)],[m__3462]) ).
cnf(c_0_31,hypothesis,
szDzozmdt0(xc) = slbdtsldtrb0(xS,xK),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_32,hypothesis,
! [X36,X37] :
( aSet0(slcrc0)
& ~ aElementOf0(X36,slcrc0)
& ( ~ aElementOf0(X37,slcrc0)
| aElementOf0(X37,xS) )
& aSubsetOf0(slcrc0,xS)
& aElementOf0(slcrc0,slbdtsldtrb0(xS,sz00)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3476])])])]) ).
fof(c_0_33,plain,
! [X111] :
( ( sbrdtbr0(X111) != sz00
| X111 = slcrc0
| ~ aSet0(X111) )
& ( X111 != slcrc0
| sbrdtbr0(X111) = sz00
| ~ aSet0(X111) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mCardEmpty])])])]) ).
cnf(c_0_34,hypothesis,
( aSubsetOf0(X1,szNzAzT0)
| ~ aSubsetOf0(X1,xS) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).
cnf(c_0_35,negated_conjecture,
( aSubsetOf0(esk14_2(X1,X2),X2)
| ~ aSubsetOf0(X2,xS)
| ~ isCountable0(X2)
| ~ aElementOf0(X1,xT) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_36,hypothesis,
aSubsetOf0(xS,xS),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_37,hypothesis,
isCountable0(xS),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_38,hypothesis,
( aElementOf0(sdtlpdtrp0(xc,X1),xT)
| ~ aElementOf0(X1,szDzozmdt0(xc)) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_39,hypothesis,
( sdtlpdtrp0(xc,X1) = sdtlpdtrp0(xc,slcrc0)
| ~ aElementOf0(X1,szDzozmdt0(xc)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).
cnf(c_0_40,hypothesis,
aElementOf0(slcrc0,slbdtsldtrb0(xS,sz00)),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_41,plain,
( X1 = slcrc0
| sbrdtbr0(X1) != sz00
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_42,negated_conjecture,
( aSubsetOf0(esk14_2(X1,xS),szNzAzT0)
| ~ aElementOf0(X1,xT) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),c_0_37])]) ).
cnf(c_0_43,hypothesis,
( aElementOf0(sdtlpdtrp0(xc,slcrc0),xT)
| ~ aElementOf0(X1,szDzozmdt0(xc)) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,hypothesis,
aElementOf0(slcrc0,szDzozmdt0(xc)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_30]),c_0_31]) ).
cnf(c_0_45,plain,
( X1 = slcrc0
| sbrdtbr0(X1) != xK
| ~ aSet0(X1) ),
inference(rw,[status(thm)],[c_0_41,c_0_30]) ).
cnf(c_0_46,negated_conjecture,
( aSet0(esk14_2(X1,xS))
| ~ aElementOf0(X1,xT) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_42]),c_0_23])]) ).
cnf(c_0_47,negated_conjecture,
( sdtlpdtrp0(xc,esk14_2(X1,X2)) != X1
| ~ aSubsetOf0(X2,xS)
| ~ isCountable0(X2)
| ~ aElementOf0(X1,xT) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_48,hypothesis,
aElementOf0(sdtlpdtrp0(xc,slcrc0),xT),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_49,negated_conjecture,
( esk14_2(X1,xS) = slcrc0
| sbrdtbr0(esk14_2(X1,xS)) != xK
| ~ aElementOf0(X1,xT) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,negated_conjecture,
( sbrdtbr0(esk14_2(X1,X2)) = xK
| ~ aSubsetOf0(X2,xS)
| ~ isCountable0(X2)
| ~ aElementOf0(X1,xT) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_51,hypothesis,
( ~ aSubsetOf0(X1,xS)
| ~ isCountable0(X1)
| ~ aElementOf0(esk14_2(sdtlpdtrp0(xc,slcrc0),X1),szDzozmdt0(xc)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_39])]),c_0_48])]) ).
cnf(c_0_52,negated_conjecture,
( esk14_2(X1,xS) = slcrc0
| ~ aElementOf0(X1,xT) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_36]),c_0_37])]) ).
cnf(c_0_53,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_36]),c_0_37]),c_0_44]),c_0_48])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM566+3 : TPTP v8.2.0. Released v4.0.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n021.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon May 20 07:04:23 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 22.64/3.45 # Version: 3.1.0
% 22.64/3.45 # Preprocessing class: FSLSSMSSSSSNFFN.
% 22.64/3.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 22.64/3.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 22.64/3.45 # Starting new_bool_3 with 300s (1) cores
% 22.64/3.45 # Starting new_bool_1 with 300s (1) cores
% 22.64/3.45 # Starting sh5l with 300s (1) cores
% 22.64/3.45 # new_bool_1 with pid 16911 completed with status 0
% 22.64/3.45 # Result found by new_bool_1
% 22.64/3.45 # Preprocessing class: FSLSSMSSSSSNFFN.
% 22.64/3.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 22.64/3.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 22.64/3.45 # Starting new_bool_3 with 300s (1) cores
% 22.64/3.45 # Starting new_bool_1 with 300s (1) cores
% 22.64/3.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 22.64/3.45 # Search class: FGHSF-SMLM32-SFFFFFNN
% 22.64/3.45 # partial match(1): FGHSF-SMLM33-SFFFFFNN
% 22.64/3.45 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 22.64/3.45 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 114s (1) cores
% 22.64/3.45 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 16919 completed with status 0
% 22.64/3.45 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 22.64/3.45 # Preprocessing class: FSLSSMSSSSSNFFN.
% 22.64/3.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 22.64/3.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 22.64/3.45 # Starting new_bool_3 with 300s (1) cores
% 22.64/3.45 # Starting new_bool_1 with 300s (1) cores
% 22.64/3.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 22.64/3.45 # Search class: FGHSF-SMLM32-SFFFFFNN
% 22.64/3.45 # partial match(1): FGHSF-SMLM33-SFFFFFNN
% 22.64/3.45 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 22.64/3.45 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 114s (1) cores
% 22.64/3.45 # Preprocessing time : 0.087 s
% 22.64/3.45 # Presaturation interreduction done
% 22.64/3.45
% 22.64/3.45 # Proof found!
% 22.64/3.45 # SZS status Theorem
% 22.64/3.45 # SZS output start CNFRefutation
% See solution above
% 22.64/3.45 # Parsed axioms : 81
% 22.64/3.45 # Removed by relevancy pruning/SinE : 24
% 22.64/3.45 # Initial clauses : 4104
% 22.64/3.45 # Removed in clause preprocessing : 7
% 22.64/3.45 # Initial clauses in saturation : 4097
% 22.64/3.45 # Processed clauses : 6351
% 22.64/3.45 # ...of these trivial : 9
% 22.64/3.45 # ...subsumed : 667
% 22.64/3.45 # ...remaining for further processing : 5675
% 22.64/3.45 # Other redundant clauses eliminated : 1911
% 22.64/3.45 # Clauses deleted for lack of memory : 0
% 22.64/3.45 # Backward-subsumed : 42
% 22.64/3.45 # Backward-rewritten : 16
% 22.64/3.45 # Generated clauses : 3242
% 22.64/3.45 # ...of the previous two non-redundant : 2997
% 22.64/3.45 # ...aggressively subsumed : 0
% 22.64/3.45 # Contextual simplify-reflections : 10
% 22.64/3.45 # Paramodulations : 1521
% 22.64/3.45 # Factorizations : 0
% 22.64/3.45 # NegExts : 0
% 22.64/3.45 # Equation resolutions : 1912
% 22.64/3.45 # Disequality decompositions : 0
% 22.64/3.45 # Total rewrite steps : 975
% 22.64/3.45 # ...of those cached : 915
% 22.64/3.45 # Propositional unsat checks : 2
% 22.64/3.45 # Propositional check models : 2
% 22.64/3.45 # Propositional check unsatisfiable : 0
% 22.64/3.45 # Propositional clauses : 0
% 22.64/3.45 # Propositional clauses after purity: 0
% 22.64/3.45 # Propositional unsat core size : 0
% 22.64/3.45 # Propositional preprocessing time : 0.000
% 22.64/3.45 # Propositional encoding time : 0.025
% 22.64/3.45 # Propositional solver time : 0.001
% 22.64/3.45 # Success case prop preproc time : 0.000
% 22.64/3.45 # Success case prop encoding time : 0.000
% 22.64/3.45 # Success case prop solver time : 0.000
% 22.64/3.45 # Current number of processed clauses : 385
% 22.64/3.45 # Positive orientable unit clauses : 92
% 22.64/3.45 # Positive unorientable unit clauses: 0
% 22.64/3.45 # Negative unit clauses : 19
% 22.64/3.45 # Non-unit-clauses : 274
% 22.64/3.45 # Current number of unprocessed clauses: 4223
% 22.64/3.45 # ...number of literals in the above : 44221
% 22.64/3.45 # Current number of archived formulas : 0
% 22.64/3.45 # Current number of archived clauses : 3576
% 22.64/3.45 # Clause-clause subsumption calls (NU) : 4101159
% 22.64/3.45 # Rec. Clause-clause subsumption calls : 72979
% 22.64/3.45 # Non-unit clause-clause subsumptions : 646
% 22.64/3.45 # Unit Clause-clause subsumption calls : 1700
% 22.64/3.45 # Rewrite failures with RHS unbound : 0
% 22.64/3.45 # BW rewrite match attempts : 12
% 22.64/3.45 # BW rewrite match successes : 9
% 22.64/3.45 # Condensation attempts : 0
% 22.64/3.45 # Condensation successes : 0
% 22.64/3.45 # Termbank termtop insertions : 795454
% 22.64/3.45 # Search garbage collected termcells : 25301
% 22.64/3.45
% 22.64/3.45 # -------------------------------------------------
% 22.64/3.45 # User time : 2.928 s
% 22.64/3.45 # System time : 0.028 s
% 22.64/3.45 # Total time : 2.956 s
% 22.64/3.45 # Maximum resident set size: 13116 pages
% 22.64/3.45
% 22.64/3.45 # -------------------------------------------------
% 22.64/3.45 # User time : 2.932 s
% 22.64/3.45 # System time : 0.031 s
% 22.64/3.45 # Total time : 2.963 s
% 22.64/3.45 # Maximum resident set size: 1812 pages
% 22.64/3.45 % E---3.1 exiting
% 22.64/3.45 % E exiting
%------------------------------------------------------------------------------