%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM580+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n001.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:49:38 PM UTC 2026
% Result : Theorem 1.12s 0.76s
% Output : CNFRefutation 1.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 44 ( 13 unt; 0 def)
% Number of atoms : 244 ( 41 equ)
% Maximal formula atoms : 52 ( 5 avg)
% Number of connectives : 300 ( 100 ~; 97 |; 71 &)
% ( 9 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-3 aty)
% Number of variables : 60 ( 0 sgn 45 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ( ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X1) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi)) )
=> ( ( ! [X1] :
( aElementOf0(X1,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
<=> ( ( X1 = szmzizndt0(sdtlpdtrp0(xN,xi))
| aElementOf0(X1,xQ) )
& aElement0(X1) ) )
& aSet0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) )
=> sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) = xK ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(mDefDiff,axiom,
! [X1,X2] :
( ( aElement0(X2)
& aSet0(X1) )
=> ! [X3] :
( X3 = sdtmndt0(X1,X2)
<=> ( ! [X4] :
( aElementOf0(X4,X3)
<=> ( X4 != X2
& aElementOf0(X4,X1)
& aElement0(X4) ) )
& aSet0(X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefDiff) ).
fof(m__3671,hypothesis,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( isCountable0(sdtlpdtrp0(xN,X1))
& aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
& ! [X2] :
( aElementOf0(X2,sdtlpdtrp0(xN,X1))
=> aElementOf0(X2,szNzAzT0) )
& aSet0(sdtlpdtrp0(xN,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3671) ).
fof(m__3989_02,hypothesis,
( aElementOf0(xQ,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))),xk))
& sbrdtbr0(xQ) = xk
& aSubsetOf0(xQ,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
& ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& aSet0(xQ)
& ! [X1] :
( aElementOf0(X1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
<=> ( X1 != szmzizndt0(sdtlpdtrp0(xN,xi))
& aElementOf0(X1,sdtlpdtrp0(xN,xi))
& aElement0(X1) ) )
& aSet0(sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X1) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3989_02) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mEOfElem) ).
fof(m__3989,hypothesis,
aElementOf0(xi,szNzAzT0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3989) ).
fof(mCardCons,axiom,
! [X1] :
( ( isFinite0(X1)
& aSet0(X1) )
=> ! [X2] :
( aElement0(X2)
=> ( ~ aElementOf0(X2,X1)
=> sbrdtbr0(sdtpldt0(X1,X2)) = szszuzczcdt0(sbrdtbr0(X1)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mCardCons) ).
fof(mNATSet,axiom,
( isCountable0(szNzAzT0)
& aSet0(szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mNATSet) ).
fof(m__3533,hypothesis,
( szszuzczcdt0(xk) = xK
& aElementOf0(xk,szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3533) ).
fof(mCardNum,axiom,
! [X1] :
( aSet0(X1)
=> ( aElementOf0(sbrdtbr0(X1),szNzAzT0)
<=> isFinite0(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mCardNum) ).
fof(c_0_10,negated_conjecture,
~ ( ( ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X1) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi)) )
=> ( ( ! [X1] :
( aElementOf0(X1,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
<=> ( ( X1 = szmzizndt0(sdtlpdtrp0(xN,xi))
| aElementOf0(X1,xQ) )
& aElement0(X1) ) )
& aSet0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) )
=> sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) = xK ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_11,plain,
! [X1,X2] :
( ( aElement0(X2)
& aSet0(X1) )
=> ! [X3] :
( X3 = sdtmndt0(X1,X2)
<=> ( ! [X4] :
( aElementOf0(X4,X3)
<=> ( X4 != X2
& aElementOf0(X4,X1)
& aElement0(X4) ) )
& aSet0(X3) ) ) ),
inference(fof_simplification,[status(thm)],[mDefDiff]) ).
fof(c_0_12,hypothesis,
! [X109,X110] :
( ( ~ aElementOf0(X109,szNzAzT0)
| isCountable0(sdtlpdtrp0(xN,X109)) )
& ( ~ aElementOf0(X109,szNzAzT0)
| aSubsetOf0(sdtlpdtrp0(xN,X109),szNzAzT0) )
& ( ~ aElementOf0(X109,szNzAzT0)
| aElementOf0(X110,szNzAzT0)
| ~ aElementOf0(X110,sdtlpdtrp0(xN,X109)) )
& ( ~ aElementOf0(X109,szNzAzT0)
| aSet0(sdtlpdtrp0(xN,X109)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3671])])])])]) ).
fof(c_0_13,negated_conjecture,
! [X8,X9] :
( sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) != xK
& ( aElementOf0(X9,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ aElement0(X9)
| X9 != szmzizndt0(sdtlpdtrp0(xN,xi)) )
& ( aElementOf0(X9,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ aElement0(X9)
| ~ aElementOf0(X9,xQ) )
& ( ~ aElementOf0(X9,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
| X9 = szmzizndt0(sdtlpdtrp0(xN,xi))
| aElementOf0(X9,xQ) )
& ( ~ aElementOf0(X9,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
| aElement0(X9) )
& aSet0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
& ( sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X8)
| ~ aElementOf0(X8,sdtlpdtrp0(xN,xi)) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi)) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])]) ).
fof(c_0_14,plain,
! [X143,X144,X145,X146,X147,X148] :
( ( ~ aElement0(X144)
| ~ aSet0(X143)
| X148 = sdtmndt0(X143,X144)
| ~ aSet0(X148)
| aElementOf0(esk24_3(X143,X144,X148),X148)
| esk24_3(X143,X144,X148) != X144 )
& ( ~ aElement0(X144)
| ~ aSet0(X143)
| X148 = sdtmndt0(X143,X144)
| ~ aSet0(X148)
| aElementOf0(esk24_3(X143,X144,X148),X148)
| aElementOf0(esk24_3(X143,X144,X148),X143) )
& ( ~ aElement0(X144)
| ~ aSet0(X143)
| X148 = sdtmndt0(X143,X144)
| ~ aSet0(X148)
| aElementOf0(esk24_3(X143,X144,X148),X148)
| aElement0(esk24_3(X143,X144,X148)) )
& ( ~ aElement0(X144)
| ~ aSet0(X143)
| X148 = sdtmndt0(X143,X144)
| ~ aSet0(X148)
| esk24_3(X143,X144,X148) = X144
| ~ aElementOf0(esk24_3(X143,X144,X148),X143)
| ~ aElement0(esk24_3(X143,X144,X148))
| ~ aElementOf0(esk24_3(X143,X144,X148),X148) )
& ( ~ aElement0(X144)
| ~ aSet0(X143)
| X145 != sdtmndt0(X143,X144)
| aElementOf0(X147,X145)
| X147 = X144
| ~ aElementOf0(X147,X143)
| ~ aElement0(X147) )
& ( ~ aElement0(X144)
| ~ aSet0(X143)
| X145 != sdtmndt0(X143,X144)
| ~ aElementOf0(X146,X145)
| X146 != X144 )
& ( ~ aElement0(X144)
| ~ aSet0(X143)
| X145 != sdtmndt0(X143,X144)
| ~ aElementOf0(X146,X145)
| aElementOf0(X146,X143) )
& ( ~ aElement0(X144)
| ~ aSet0(X143)
| X145 != sdtmndt0(X143,X144)
| ~ aElementOf0(X146,X145)
| aElement0(X146) )
& ( ~ aElement0(X144)
| ~ aSet0(X143)
| X145 != sdtmndt0(X143,X144)
| aSet0(X145) ) ),
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)],[c_0_11])])])])])])]) ).
fof(c_0_15,hypothesis,
( aElementOf0(xQ,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))),xk))
& sbrdtbr0(xQ) = xk
& aSubsetOf0(xQ,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
& ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& aSet0(xQ)
& ! [X1] :
( aElementOf0(X1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
<=> ( X1 != szmzizndt0(sdtlpdtrp0(xN,xi))
& aElementOf0(X1,sdtlpdtrp0(xN,xi))
& aElement0(X1) ) )
& aSet0(sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X1) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi)) ),
inference(fof_simplification,[status(thm)],[m__3989_02]) ).
fof(c_0_16,plain,
! [X114,X115] :
( aElement0(X115)
| ~ aElementOf0(X115,X114)
| ~ aSet0(X114) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])])]) ).
cnf(c_0_17,hypothesis,
( ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,sdtlpdtrp0(xN,X2))
| aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,hypothesis,
aElementOf0(xi,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3989]) ).
fof(c_0_20,plain,
! [X1] :
( ( isFinite0(X1)
& aSet0(X1) )
=> ! [X2] :
( aElement0(X2)
=> ( ~ aElementOf0(X2,X1)
=> sbrdtbr0(sdtpldt0(X1,X2)) = szszuzczcdt0(sbrdtbr0(X1)) ) ) ),
inference(fof_simplification,[status(thm)],[mCardCons]) ).
cnf(c_0_21,plain,
( ~ aElement0(X2)
| ~ aSet0(X4)
| X3 != sdtmndt0(X4,X2)
| ~ aElementOf0(X1,X3)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_22,hypothesis,
! [X80,X81,X82] :
( aElementOf0(xQ,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))),xk))
& sbrdtbr0(xQ) = xk
& aSubsetOf0(xQ,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
& ( aElementOf0(X82,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ aElementOf0(X82,xQ) )
& aSet0(xQ)
& ( aElementOf0(X81,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| X81 = szmzizndt0(sdtlpdtrp0(xN,xi))
| ~ aElementOf0(X81,sdtlpdtrp0(xN,xi))
| ~ aElement0(X81) )
& ( ~ aElementOf0(X81,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| X81 != szmzizndt0(sdtlpdtrp0(xN,xi)) )
& ( ~ aElementOf0(X81,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| aElementOf0(X81,sdtlpdtrp0(xN,xi)) )
& ( ~ aElementOf0(X81,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| aElement0(X81) )
& aSet0(sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
& ( sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X80)
| ~ aElementOf0(X80,sdtlpdtrp0(xN,xi)) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi)) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])])]) ).
cnf(c_0_23,plain,
( ~ aElementOf0(X2,X1)
| ~ aSet0(X1)
| aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,negated_conjecture,
aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),szNzAzT0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_25,plain,
aSet0(szNzAzT0),
inference(split_conjunct,[status(thm)],[mNATSet]) ).
fof(c_0_26,plain,
! [X31,X32] :
( sbrdtbr0(sdtpldt0(X31,X32)) = szszuzczcdt0(sbrdtbr0(X31))
| aElementOf0(X32,X31)
| ~ aElement0(X32)
| ~ isFinite0(X31)
| ~ aSet0(X31) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])]) ).
cnf(c_0_27,plain,
( ~ aSet0(X2)
| ~ aElement0(X1)
| ~ aElementOf0(X1,sdtmndt0(X2,X1)) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_21])]) ).
cnf(c_0_28,hypothesis,
( ~ aElementOf0(X1,xQ)
| aElementOf0(X1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,negated_conjecture,
aElement0(szmzizndt0(sdtlpdtrp0(xN,xi))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_30,negated_conjecture,
sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) != xK,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_31,plain,
( ~ aElement0(X2)
| ~ isFinite0(X1)
| ~ aSet0(X1)
| sbrdtbr0(sdtpldt0(X1,X2)) = szszuzczcdt0(sbrdtbr0(X1))
| aElementOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_32,hypothesis,
sbrdtbr0(xQ) = xk,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_33,hypothesis,
szszuzczcdt0(xk) = xK,
inference(split_conjunct,[status(thm)],[m__3533]) ).
cnf(c_0_34,hypothesis,
aSet0(xQ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_35,hypothesis,
( ~ aSet0(sdtlpdtrp0(xN,xi))
| ~ aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),xQ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_36,negated_conjecture,
( ~ isFinite0(xQ)
| aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),xQ) ),
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_30,c_0_31]),c_0_32]),c_0_33]),c_0_29]),c_0_34])]) ).
fof(c_0_37,plain,
! [X29] :
( ( ~ aSet0(X29)
| aElementOf0(sbrdtbr0(X29),szNzAzT0)
| ~ isFinite0(X29) )
& ( ~ aSet0(X29)
| isFinite0(X29)
| ~ aElementOf0(sbrdtbr0(X29),szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mCardNum])])])]) ).
cnf(c_0_38,hypothesis,
( ~ aSet0(sdtlpdtrp0(xN,xi))
| ~ isFinite0(xQ) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,plain,
( ~ aSet0(X1)
| ~ aElementOf0(sbrdtbr0(X1),szNzAzT0)
| isFinite0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_40,hypothesis,
aElementOf0(xk,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3533]) ).
cnf(c_0_41,hypothesis,
~ aSet0(sdtlpdtrp0(xN,xi)),
inference(cn,[status(thm)],[inference(rw,[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_40]),c_0_34])]) ).
cnf(c_0_42,hypothesis,
( ~ aElementOf0(X1,szNzAzT0)
| aSet0(sdtlpdtrp0(xN,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_43,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM580+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n001.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 02:46:59 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 1.12/0.76 % Version: 3.5.1
% 1.12/0.76 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.12/0.76 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.12/0.76 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.12/0.76 % Starting new_bool_3 with 300s (1) cores
% 1.12/0.76 % Starting new_bool_1 with 300s (1) cores
% 1.12/0.76 % Starting sh5l with 300s (1) cores
% 1.12/0.76 % sh5l with pid 2022577 completed with status 0
% 1.12/0.76 % Result found by sh5l
% 1.12/0.76 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.12/0.76 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.12/0.76 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.12/0.76 % Starting new_bool_3 with 300s (1) cores
% 1.12/0.76 % Starting new_bool_1 with 300s (1) cores
% 1.12/0.76 % Starting sh5l with 300s (1) cores
% 1.12/0.76 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 1.12/0.76 % SinE strategy is gf500_gu_R04_F100_L20000
% 1.12/0.76 % Search class: FGHSF-SMLM32-MFFFFFNN
% 1.12/0.76 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.12/0.76 % Starting SubtermCWHack with 28s (1) cores
% 1.12/0.76 % SubtermCWHack with pid 2022592 completed with status 0
% 1.12/0.76 % Result found by SubtermCWHack
% 1.12/0.76 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.12/0.76 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.12/0.76 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.12/0.76 % Starting new_bool_3 with 300s (1) cores
% 1.12/0.76 % Starting new_bool_1 with 300s (1) cores
% 1.12/0.76 % Starting sh5l with 300s (1) cores
% 1.12/0.76 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 1.12/0.76 % SinE strategy is gf500_gu_R04_F100_L20000
% 1.12/0.76 % Search class: FGHSF-SMLM32-MFFFFFNN
% 1.12/0.76 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.12/0.76 % Starting SubtermCWHack with 28s (1) cores
% 1.12/0.76 % Preprocessing time : 0.050 s
% 1.12/0.76
% 1.12/0.76 % Proof found!
% 1.12/0.76 % SZS status Theorem
% 1.12/0.76 % SZS output start CNFRefutation
% See solution above
% 1.12/0.76 % Parsed axioms : 87
% 1.12/0.76 % Removed by relevancy pruning/SinE : 2
% 1.12/0.76 % Initial clauses : 4198
% 1.12/0.76 % Removed in clause preprocessing : 7
% 1.12/0.76 % Initial clauses in saturation : 4191
% 1.12/0.76 % Processed clauses : 347
% 1.12/0.76 % ...of these trivial : 1
% 1.12/0.76 % ...subsumed : 55
% 1.12/0.76 % ...remaining for further processing : 291
% 1.12/0.76 % Other redundant clauses eliminated : 26
% 1.12/0.76 % Clauses deleted for lack of memory : 0
% 1.12/0.76 % Backward-subsumed : 27
% 1.12/0.76 % Backward-rewritten : 4
% 1.12/0.76 % Generated clauses : 457
% 1.12/0.76 % ...of the previous two non-redundant : 376
% 1.12/0.76 % ...aggressively subsumed : 0
% 1.12/0.76 % Contextual simplify-reflections : 7
% 1.12/0.76 % Paramodulations : 430
% 1.12/0.76 % Factorizations : 0
% 1.12/0.76 % NegExts : 0
% 1.12/0.76 % Equation resolutions : 27
% 1.12/0.76 % Disequality decompositions : 0
% 1.12/0.76 % Total rewrite steps : 324
% 1.12/0.76 % ...of those cached : 283
% 1.12/0.76 % Propositional unsat checks : 0
% 1.12/0.76 % Propositional check models : 0
% 1.12/0.76 % Propositional check unsatisfiable : 0
% 1.12/0.76 % Propositional clauses : 0
% 1.12/0.76 % Propositional clauses after purity: 0
% 1.12/0.76 % Propositional unsat core size : 0
% 1.12/0.76 % Propositional preprocessing time : 0.000
% 1.12/0.76 % Propositional encoding time : 0.000
% 1.12/0.76 % Propositional solver time : 0.000
% 1.12/0.76 % Success case prop preproc time : 0.000
% 1.12/0.76 % Success case prop encoding time : 0.000
% 1.12/0.76 % Success case prop solver time : 0.000
% 1.12/0.76 % Current number of processed clauses : 238
% 1.12/0.76 % Positive orientable unit clauses : 55
% 1.12/0.76 % Positive unorientable unit clauses: 0
% 1.12/0.76 % Negative unit clauses : 18
% 1.12/0.76 % Non-unit-clauses : 165
% 1.12/0.76 % Current number of unprocessed clauses: 4213
% 1.12/0.76 % ...number of literals in the above : 51503
% 1.12/0.76 % Current number of archived formulas : 0
% 1.12/0.76 % Current number of archived clauses : 33
% 1.12/0.76 % Clause-clause subsumption calls (NU) : 3427
% 1.12/0.76 % Rec. Clause-clause subsumption calls : 2241
% 1.12/0.76 % Non-unit clause-clause subsumptions : 46
% 1.12/0.76 % Unit Clause-clause subsumption calls : 836
% 1.12/0.76 % Rewrite failures with RHS unbound : 0
% 1.12/0.76 % BW rewrite match attempts : 6
% 1.12/0.76 % BW rewrite match successes : 6
% 1.12/0.76 % Condensation attempts : 0
% 1.12/0.76 % Condensation successes : 0
% 1.12/0.76 % Termbank termtop insertions : 340674
% 1.12/0.76 % Search garbage collected termcells : 26813
% 1.12/0.76
% 1.12/0.76 % -------------------------------------------------
% 1.12/0.76 % User time : 0.295 s
% 1.12/0.76 % System time : 0.017 s
% 1.12/0.76 % Total time : 0.312 s
% 1.12/0.76 % Maximum resident set size: 15036 pages
% 1.12/0.76
% 1.12/0.76 % -------------------------------------------------
% 1.12/0.76 % User time : 0.299 s
% 1.12/0.76 % System time : 0.023 s
% 1.12/0.76 % Total time : 0.322 s
% 1.12/0.76 % Maximum resident set size: 4864 pages
% 1.12/0.76 % E exiting
%------------------------------------------------------------------------------