TSTP Solution File: NUM563+3 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : NUM563+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n032.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 : Thu Aug 31 10:38:46 EDT 2023
% Result : Theorem 3.44s 3.54s
% Output : CNFRefutation 3.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 68
% Syntax : Number of formulae : 104 ( 14 unt; 62 typ; 0 def)
% Number of atoms : 261 ( 51 equ)
% Maximal formula atoms : 88 ( 6 avg)
% Number of connectives : 346 ( 127 ~; 129 |; 71 &)
% ( 3 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 113 ( 55 >; 58 *; 0 +; 0 <<)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 53 ( 53 usr; 7 con; 0-4 aty)
% Number of variables : 58 ( 2 sgn; 31 !; 6 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
aSet0: $i > $o ).
tff(decl_23,type,
aElement0: $i > $o ).
tff(decl_24,type,
aElementOf0: ( $i * $i ) > $o ).
tff(decl_25,type,
isFinite0: $i > $o ).
tff(decl_26,type,
slcrc0: $i ).
tff(decl_27,type,
isCountable0: $i > $o ).
tff(decl_28,type,
aSubsetOf0: ( $i * $i ) > $o ).
tff(decl_29,type,
sdtpldt0: ( $i * $i ) > $i ).
tff(decl_30,type,
sdtmndt0: ( $i * $i ) > $i ).
tff(decl_31,type,
szNzAzT0: $i ).
tff(decl_32,type,
sz00: $i ).
tff(decl_33,type,
szszuzczcdt0: $i > $i ).
tff(decl_34,type,
sdtlseqdt0: ( $i * $i ) > $o ).
tff(decl_35,type,
iLess0: ( $i * $i ) > $o ).
tff(decl_36,type,
sbrdtbr0: $i > $i ).
tff(decl_37,type,
szmzizndt0: $i > $i ).
tff(decl_38,type,
szmzazxdt0: $i > $i ).
tff(decl_39,type,
slbdtrb0: $i > $i ).
tff(decl_40,type,
slbdtsldtrb0: ( $i * $i ) > $i ).
tff(decl_41,type,
aFunction0: $i > $o ).
tff(decl_42,type,
szDzozmdt0: $i > $i ).
tff(decl_43,type,
sdtlpdtrp0: ( $i * $i ) > $i ).
tff(decl_44,type,
sdtlbdtrb0: ( $i * $i ) > $i ).
tff(decl_45,type,
sdtlcdtrc0: ( $i * $i ) > $i ).
tff(decl_46,type,
sdtexdt0: ( $i * $i ) > $i ).
tff(decl_47,type,
szDzizrdt0: $i > $i ).
tff(decl_48,type,
xT: $i ).
tff(decl_49,type,
xK: $i ).
tff(decl_50,type,
xS: $i ).
tff(decl_51,type,
xc: $i ).
tff(decl_52,type,
esk1_1: $i > $i ).
tff(decl_53,type,
esk2_2: ( $i * $i ) > $i ).
tff(decl_54,type,
esk3_3: ( $i * $i * $i ) > $i ).
tff(decl_55,type,
esk4_3: ( $i * $i * $i ) > $i ).
tff(decl_56,type,
esk5_1: $i > $i ).
tff(decl_57,type,
esk6_2: ( $i * $i ) > $i ).
tff(decl_58,type,
esk7_2: ( $i * $i ) > $i ).
tff(decl_59,type,
esk8_2: ( $i * $i ) > $i ).
tff(decl_60,type,
esk9_2: ( $i * $i ) > $i ).
tff(decl_61,type,
esk10_1: $i > $i ).
tff(decl_62,type,
esk11_3: ( $i * $i * $i ) > $i ).
tff(decl_63,type,
esk12_3: ( $i * $i * $i ) > $i ).
tff(decl_64,type,
esk13_3: ( $i * $i * $i ) > $i ).
tff(decl_65,type,
esk14_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_66,type,
esk15_3: ( $i * $i * $i ) > $i ).
tff(decl_67,type,
esk16_3: ( $i * $i * $i ) > $i ).
tff(decl_68,type,
esk17_3: ( $i * $i * $i ) > $i ).
tff(decl_69,type,
esk18_2: ( $i * $i ) > $i ).
tff(decl_70,type,
esk19_2: ( $i * $i ) > $i ).
tff(decl_71,type,
esk20_1: $i > $i ).
tff(decl_72,type,
esk21_1: $i > $i ).
tff(decl_73,type,
esk22_2: ( $i * $i ) > $i ).
tff(decl_74,type,
esk23_3: ( $i * $i * $i ) > $i ).
tff(decl_75,type,
esk24_3: ( $i * $i * $i ) > $i ).
tff(decl_76,type,
esk25_3: ( $i * $i * $i ) > $i ).
tff(decl_77,type,
esk26_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_78,type,
esk27_3: ( $i * $i * $i ) > $i ).
tff(decl_79,type,
esk28_3: ( $i * $i * $i ) > $i ).
tff(decl_80,type,
esk29_3: ( $i * $i * $i ) > $i ).
tff(decl_81,type,
esk30_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_82,type,
esk31_2: ( $i * $i ) > $i ).
tff(decl_83,type,
esk32_2: ( $i * $i ) > $i ).
fof(m__,conjecture,
( xK = sz00
=> ? [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/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(mDefEmp,axiom,
! [X1] :
( X1 = slcrc0
<=> ( aSet0(X1)
& ~ ? [X2] : aElementOf0(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefEmp) ).
fof(mCardEmpty,axiom,
! [X1] :
( aSet0(X1)
=> ( sbrdtbr0(X1) = sz00
<=> X1 = slcrc0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mCardEmpty) ).
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/sandbox2/benchmark/theBenchmark.p',m__3453) ).
fof(mSubRefl,axiom,
! [X1] :
( aSet0(X1)
=> aSubsetOf0(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSubRefl) ).
fof(m__3435,hypothesis,
( aSet0(xS)
& ! [X1] :
( aElementOf0(X1,xS)
=> aElementOf0(X1,szNzAzT0) )
& aSubsetOf0(xS,szNzAzT0)
& isCountable0(xS) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3435) ).
fof(c_0_6,negated_conjecture,
~ ( xK = sz00
=> ? [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_7,plain,
! [X10,X11,X12] :
( ( aSet0(X10)
| X10 != slcrc0 )
& ( ~ aElementOf0(X11,X10)
| X10 != slcrc0 )
& ( ~ aSet0(X12)
| aElementOf0(esk1_1(X12),X12)
| X12 = 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])])])])])]) ).
fof(c_0_8,plain,
! [X77] :
( ( sbrdtbr0(X77) != sz00
| X77 = slcrc0
| ~ aSet0(X77) )
& ( X77 != slcrc0
| sbrdtbr0(X77) = sz00
| ~ aSet0(X77) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mCardEmpty])])]) ).
fof(c_0_9,negated_conjecture,
! [X197,X198,X201] :
( xK = sz00
& ( aSet0(esk32_2(X197,X198))
| aElementOf0(esk31_2(X197,X198),X198)
| ~ aSet0(X198)
| ~ isCountable0(X198)
| ~ aElementOf0(X197,xT) )
& ( ~ aElementOf0(X201,esk32_2(X197,X198))
| aElementOf0(X201,X198)
| aElementOf0(esk31_2(X197,X198),X198)
| ~ aSet0(X198)
| ~ isCountable0(X198)
| ~ aElementOf0(X197,xT) )
& ( aSubsetOf0(esk32_2(X197,X198),X198)
| aElementOf0(esk31_2(X197,X198),X198)
| ~ aSet0(X198)
| ~ isCountable0(X198)
| ~ aElementOf0(X197,xT) )
& ( sbrdtbr0(esk32_2(X197,X198)) = xK
| aElementOf0(esk31_2(X197,X198),X198)
| ~ aSet0(X198)
| ~ isCountable0(X198)
| ~ aElementOf0(X197,xT) )
& ( aElementOf0(esk32_2(X197,X198),slbdtsldtrb0(X198,xK))
| aElementOf0(esk31_2(X197,X198),X198)
| ~ aSet0(X198)
| ~ isCountable0(X198)
| ~ aElementOf0(X197,xT) )
& ( sdtlpdtrp0(xc,esk32_2(X197,X198)) != X197
| aElementOf0(esk31_2(X197,X198),X198)
| ~ aSet0(X198)
| ~ isCountable0(X198)
| ~ aElementOf0(X197,xT) )
& ( aSet0(esk32_2(X197,X198))
| ~ aElementOf0(esk31_2(X197,X198),xS)
| ~ aSet0(X198)
| ~ isCountable0(X198)
| ~ aElementOf0(X197,xT) )
& ( ~ aElementOf0(X201,esk32_2(X197,X198))
| aElementOf0(X201,X198)
| ~ aElementOf0(esk31_2(X197,X198),xS)
| ~ aSet0(X198)
| ~ isCountable0(X198)
| ~ aElementOf0(X197,xT) )
& ( aSubsetOf0(esk32_2(X197,X198),X198)
| ~ aElementOf0(esk31_2(X197,X198),xS)
| ~ aSet0(X198)
| ~ isCountable0(X198)
| ~ aElementOf0(X197,xT) )
& ( sbrdtbr0(esk32_2(X197,X198)) = xK
| ~ aElementOf0(esk31_2(X197,X198),xS)
| ~ aSet0(X198)
| ~ isCountable0(X198)
| ~ aElementOf0(X197,xT) )
& ( aElementOf0(esk32_2(X197,X198),slbdtsldtrb0(X198,xK))
| ~ aElementOf0(esk31_2(X197,X198),xS)
| ~ aSet0(X198)
| ~ isCountable0(X198)
| ~ aElementOf0(X197,xT) )
& ( sdtlpdtrp0(xc,esk32_2(X197,X198)) != X197
| ~ aElementOf0(esk31_2(X197,X198),xS)
| ~ aSet0(X198)
| ~ isCountable0(X198)
| ~ aElementOf0(X197,xT) )
& ( aSet0(esk32_2(X197,X198))
| ~ aSubsetOf0(X198,xS)
| ~ isCountable0(X198)
| ~ aElementOf0(X197,xT) )
& ( ~ aElementOf0(X201,esk32_2(X197,X198))
| aElementOf0(X201,X198)
| ~ aSubsetOf0(X198,xS)
| ~ isCountable0(X198)
| ~ aElementOf0(X197,xT) )
& ( aSubsetOf0(esk32_2(X197,X198),X198)
| ~ aSubsetOf0(X198,xS)
| ~ isCountable0(X198)
| ~ aElementOf0(X197,xT) )
& ( sbrdtbr0(esk32_2(X197,X198)) = xK
| ~ aSubsetOf0(X198,xS)
| ~ isCountable0(X198)
| ~ aElementOf0(X197,xT) )
& ( aElementOf0(esk32_2(X197,X198),slbdtsldtrb0(X198,xK))
| ~ aSubsetOf0(X198,xS)
| ~ isCountable0(X198)
| ~ aElementOf0(X197,xT) )
& ( sdtlpdtrp0(xc,esk32_2(X197,X198)) != X197
| ~ aSubsetOf0(X198,xS)
| ~ isCountable0(X198)
| ~ aElementOf0(X197,xT) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])]) ).
cnf(c_0_10,plain,
( aSet0(X1)
| X1 != slcrc0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,hypothesis,
! [X170,X171,X172,X174,X176,X177,X178] :
( aFunction0(xc)
& ( aSet0(X170)
| ~ aElementOf0(X170,szDzozmdt0(xc)) )
& ( ~ aElementOf0(X171,X170)
| aElementOf0(X171,xS)
| ~ aElementOf0(X170,szDzozmdt0(xc)) )
& ( aSubsetOf0(X170,xS)
| ~ aElementOf0(X170,szDzozmdt0(xc)) )
& ( sbrdtbr0(X170) = xK
| ~ aElementOf0(X170,szDzozmdt0(xc)) )
& ( aElementOf0(esk20_1(X172),X172)
| ~ aSet0(X172)
| sbrdtbr0(X172) != xK
| aElementOf0(X172,szDzozmdt0(xc)) )
& ( ~ aElementOf0(esk20_1(X172),xS)
| ~ aSet0(X172)
| sbrdtbr0(X172) != xK
| aElementOf0(X172,szDzozmdt0(xc)) )
& ( ~ aSubsetOf0(X172,xS)
| sbrdtbr0(X172) != xK
| aElementOf0(X172,szDzozmdt0(xc)) )
& szDzozmdt0(xc) = slbdtsldtrb0(xS,xK)
& aSet0(sdtlcdtrc0(xc,szDzozmdt0(xc)))
& ( aElementOf0(esk21_1(X174),szDzozmdt0(xc))
| ~ aElementOf0(X174,sdtlcdtrc0(xc,szDzozmdt0(xc))) )
& ( sdtlpdtrp0(xc,esk21_1(X174)) = X174
| ~ aElementOf0(X174,sdtlcdtrc0(xc,szDzozmdt0(xc))) )
& ( ~ aElementOf0(X177,szDzozmdt0(xc))
| sdtlpdtrp0(xc,X177) != X176
| aElementOf0(X176,sdtlcdtrc0(xc,szDzozmdt0(xc))) )
& ( ~ aElementOf0(X178,sdtlcdtrc0(xc,szDzozmdt0(xc)))
| aElementOf0(X178,xT) )
& aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT) ),
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)],[m__3453])])])])])]) ).
cnf(c_0_12,plain,
( sbrdtbr0(X1) = sz00
| X1 != slcrc0
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
xK = sz00,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
aSet0(slcrc0),
inference(er,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( ~ aElementOf0(X1,X2)
| X2 != slcrc0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_16,hypothesis,
( aElementOf0(X2,sdtlcdtrc0(xc,szDzozmdt0(xc)))
| ~ aElementOf0(X1,szDzozmdt0(xc))
| sdtlpdtrp0(xc,X1) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,hypothesis,
( aElementOf0(esk20_1(X1),X1)
| aElementOf0(X1,szDzozmdt0(xc))
| ~ aSet0(X1)
| sbrdtbr0(X1) != xK ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
sbrdtbr0(slcrc0) = xK,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]),c_0_14])]) ).
cnf(c_0_19,plain,
~ aElementOf0(X1,slcrc0),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_20,hypothesis,
( aElementOf0(sdtlpdtrp0(xc,X1),sdtlcdtrc0(xc,szDzozmdt0(xc)))
| ~ aElementOf0(X1,szDzozmdt0(xc)) ),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_21,hypothesis,
aElementOf0(slcrc0,szDzozmdt0(xc)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_14])]),c_0_19]) ).
cnf(c_0_22,hypothesis,
( aElementOf0(X1,xT)
| ~ aElementOf0(X1,sdtlcdtrc0(xc,szDzozmdt0(xc))) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_23,hypothesis,
aElementOf0(sdtlpdtrp0(xc,slcrc0),sdtlcdtrc0(xc,szDzozmdt0(xc))),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,negated_conjecture,
( sbrdtbr0(esk32_2(X1,X2)) = xK
| ~ aSubsetOf0(X2,xS)
| ~ isCountable0(X2)
| ~ aElementOf0(X1,xT) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_25,hypothesis,
aElementOf0(sdtlpdtrp0(xc,slcrc0),xT),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_26,plain,
! [X23] :
( ~ aSet0(X23)
| aSubsetOf0(X23,X23) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSubRefl])]) ).
fof(c_0_27,hypothesis,
! [X169] :
( aSet0(xS)
& ( ~ aElementOf0(X169,xS)
| aElementOf0(X169,szNzAzT0) )
& aSubsetOf0(xS,szNzAzT0)
& isCountable0(xS) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3435])])]) ).
cnf(c_0_28,negated_conjecture,
( aSet0(esk32_2(X1,X2))
| ~ aSubsetOf0(X2,xS)
| ~ isCountable0(X2)
| ~ aElementOf0(X1,xT) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_29,plain,
( X1 = slcrc0
| sbrdtbr0(X1) != sz00
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_30,negated_conjecture,
( sbrdtbr0(esk32_2(sdtlpdtrp0(xc,slcrc0),X1)) = xK
| ~ aSubsetOf0(X1,xS)
| ~ isCountable0(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
( aSubsetOf0(X1,X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_32,hypothesis,
isCountable0(xS),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_33,hypothesis,
aSet0(xS),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_34,negated_conjecture,
( aSet0(esk32_2(sdtlpdtrp0(xc,slcrc0),X1))
| ~ aSubsetOf0(X1,xS)
| ~ isCountable0(X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_25]) ).
cnf(c_0_35,plain,
( X1 = slcrc0
| sbrdtbr0(X1) != xK
| ~ aSet0(X1) ),
inference(rw,[status(thm)],[c_0_29,c_0_13]) ).
cnf(c_0_36,negated_conjecture,
sbrdtbr0(esk32_2(sdtlpdtrp0(xc,slcrc0),xS)) = xK,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_33])]) ).
cnf(c_0_37,negated_conjecture,
aSet0(esk32_2(sdtlpdtrp0(xc,slcrc0),xS)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_31]),c_0_32]),c_0_33])]) ).
cnf(c_0_38,negated_conjecture,
( sdtlpdtrp0(xc,esk32_2(X1,X2)) != X1
| ~ aSubsetOf0(X2,xS)
| ~ isCountable0(X2)
| ~ aElementOf0(X1,xT) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_39,negated_conjecture,
esk32_2(sdtlpdtrp0(xc,slcrc0),xS) = slcrc0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]) ).
cnf(c_0_40,negated_conjecture,
~ aSubsetOf0(xS,xS),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_32]),c_0_25])]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_31]),c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : NUM563+3 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.10 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.11/0.28 % Computer : n032.cluster.edu
% 0.11/0.28 % Model : x86_64 x86_64
% 0.11/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.28 % Memory : 8042.1875MB
% 0.11/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.28 % CPULimit : 300
% 0.11/0.28 % WCLimit : 300
% 0.11/0.28 % DateTime : Fri Aug 25 13:31:13 EDT 2023
% 0.11/0.29 % CPUTime :
% 0.14/0.47 start to proof: theBenchmark
% 3.44/3.54 % Version : CSE_E---1.5
% 3.44/3.54 % Problem : theBenchmark.p
% 3.44/3.54 % Proof found
% 3.44/3.54 % SZS status Theorem for theBenchmark.p
% 3.44/3.54 % SZS output start Proof
% See solution above
% 3.44/3.55 % Total time : 3.063000 s
% 3.44/3.55 % SZS output end Proof
% 3.44/3.55 % Total time : 3.069000 s
%------------------------------------------------------------------------------