%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM583+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 : n009.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:55:35 PM UTC 2026
% Result : Theorem 3.59s 1.52s
% Output : CNFRefutation 3.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 39 ( 11 unt; 0 def)
% Number of atoms : 260 ( 36 equ)
% Maximal formula atoms : 52 ( 6 avg)
% Number of connectives : 319 ( 98 ~; 104 |; 86 &)
% ( 10 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 6 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 8 con; 0-3 aty)
% Number of variables : 66 ( 0 sgn 50 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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__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(mDefSub,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) )
& aSet0(X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefSub) ).
fof(m__4037,hypothesis,
( aSubsetOf0(sdtlpdtrp0(xN,xi),xS)
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> aElementOf0(X1,xS) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4037) ).
fof(m__3435,hypothesis,
( isCountable0(xS)
& aSubsetOf0(xS,szNzAzT0)
& ! [X1] :
( aElementOf0(X1,xS)
=> aElementOf0(X1,szNzAzT0) )
& aSet0(xS) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3435) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mEOfElem) ).
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)))) )
=> ( aSubsetOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),xS)
| ! [X1] :
( aElementOf0(X1,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
=> aElementOf0(X1,xS) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__4007,hypothesis,
( sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) = xK
& ! [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))))
& ! [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__4007) ).
fof(c_0_8,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_9,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_10,plain,
! [X75,X76,X77,X78] :
( ( ~ aSet0(X75)
| aSubsetOf0(X78,X75)
| ~ aSet0(X78)
| ~ aElementOf0(esk16_2(X75,X78),X75) )
& ( ~ aSet0(X75)
| aSubsetOf0(X78,X75)
| ~ aSet0(X78)
| aElementOf0(esk16_2(X75,X78),X78) )
& ( ~ aSet0(X75)
| ~ aSubsetOf0(X76,X75)
| aElementOf0(X77,X75)
| ~ aElementOf0(X77,X76) )
& ( ~ aSet0(X75)
| ~ aSubsetOf0(X76,X75)
| aSet0(X76) ) ),
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_11,hypothesis,
! [X56] :
( aSubsetOf0(sdtlpdtrp0(xN,xi),xS)
& ( aElementOf0(X56,xS)
| ~ aElementOf0(X56,sdtlpdtrp0(xN,xi)) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4037])])])]) ).
fof(c_0_12,hypothesis,
! [X8] :
( isCountable0(xS)
& aSubsetOf0(xS,szNzAzT0)
& ( aElementOf0(X8,szNzAzT0)
| ~ aElementOf0(X8,xS) )
& aSet0(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_13,plain,
! [X143,X144,X145,X146,X147,X148] :
( ( ~ aElement0(X144)
| ~ aSet0(X143)
| X148 = sdtmndt0(X143,X144)
| ~ aSet0(X148)
| aElementOf0(esk25_3(X143,X144,X148),X148)
| esk25_3(X143,X144,X148) != X144 )
& ( ~ aElement0(X144)
| ~ aSet0(X143)
| X148 = sdtmndt0(X143,X144)
| ~ aSet0(X148)
| aElementOf0(esk25_3(X143,X144,X148),X148)
| aElementOf0(esk25_3(X143,X144,X148),X143) )
& ( ~ aElement0(X144)
| ~ aSet0(X143)
| X148 = sdtmndt0(X143,X144)
| ~ aSet0(X148)
| aElementOf0(esk25_3(X143,X144,X148),X148)
| aElement0(esk25_3(X143,X144,X148)) )
& ( ~ aElement0(X144)
| ~ aSet0(X143)
| X148 = sdtmndt0(X143,X144)
| ~ aSet0(X148)
| esk25_3(X143,X144,X148) = X144
| ~ aElementOf0(esk25_3(X143,X144,X148),X143)
| ~ aElement0(esk25_3(X143,X144,X148))
| ~ aElementOf0(esk25_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_8])])])])])])]) ).
fof(c_0_14,plain,
! [X168,X169] :
( aElement0(X169)
| ~ aElementOf0(X169,X168)
| ~ aSet0(X168) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])])]) ).
fof(c_0_15,hypothesis,
! [X51,X52,X53] :
( 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(X53,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ aElementOf0(X53,xQ) )
& aSet0(xQ)
& ( aElementOf0(X52,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| X52 = szmzizndt0(sdtlpdtrp0(xN,xi))
| ~ aElementOf0(X52,sdtlpdtrp0(xN,xi))
| ~ aElement0(X52) )
& ( ~ aElementOf0(X52,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| X52 != szmzizndt0(sdtlpdtrp0(xN,xi)) )
& ( ~ aElementOf0(X52,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| aElementOf0(X52,sdtlpdtrp0(xN,xi)) )
& ( ~ aElementOf0(X52,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| aElement0(X52) )
& aSet0(sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
& ( sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X51)
| ~ aElementOf0(X51,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_9])])])])]) ).
cnf(c_0_16,plain,
( ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2)
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,hypothesis,
aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,hypothesis,
aSet0(xS),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( ~ aElement0(X4)
| ~ aSet0(X2)
| X3 != sdtmndt0(X2,X4)
| ~ aElementOf0(X1,X3)
| aElementOf0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
( ~ aElementOf0(X2,X1)
| ~ aSet0(X1)
| aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,hypothesis,
aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,hypothesis,
aSet0(sdtlpdtrp0(xN,xi)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
fof(c_0_23,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)))) )
=> ( aSubsetOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),xS)
| ! [X1] :
( aElementOf0(X1,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
=> aElementOf0(X1,xS) ) ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_24,plain,
( ~ aSet0(X2)
| ~ aElement0(X3)
| ~ aElementOf0(X1,sdtmndt0(X2,X3))
| aElementOf0(X1,X2) ),
inference(er,[status(thm)],[c_0_19]) ).
cnf(c_0_25,hypothesis,
( ~ aElementOf0(X1,xQ)
| aElementOf0(X1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_26,hypothesis,
aElement0(szmzizndt0(sdtlpdtrp0(xN,xi))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
fof(c_0_27,negated_conjecture,
! [X57,X58] :
( ~ aSubsetOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),xS)
& ~ aElementOf0(esk14_0,xS)
& aElementOf0(esk14_0,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
& ( aElementOf0(X58,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ aElement0(X58)
| X58 != szmzizndt0(sdtlpdtrp0(xN,xi)) )
& ( aElementOf0(X58,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ aElement0(X58)
| ~ aElementOf0(X58,xQ) )
& ( ~ aElementOf0(X58,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
| X58 = szmzizndt0(sdtlpdtrp0(xN,xi))
| aElementOf0(X58,xQ) )
& ( ~ aElementOf0(X58,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
| aElement0(X58) )
& aSet0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
& ( sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X57)
| ~ aElementOf0(X57,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(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])])])])]) ).
cnf(c_0_28,hypothesis,
( ~ aElementOf0(X1,sdtlpdtrp0(xN,xi))
| aElementOf0(X1,xS) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_29,hypothesis,
( ~ aElementOf0(X1,xQ)
| aElementOf0(X1,sdtlpdtrp0(xN,xi)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_22])]) ).
fof(c_0_30,hypothesis,
! [X54,X55] :
( sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) = xK
& ( aElementOf0(X55,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ aElement0(X55)
| X55 != szmzizndt0(sdtlpdtrp0(xN,xi)) )
& ( aElementOf0(X55,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ aElement0(X55)
| ~ aElementOf0(X55,xQ) )
& ( ~ aElementOf0(X55,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
| X55 = szmzizndt0(sdtlpdtrp0(xN,xi))
| aElementOf0(X55,xQ) )
& ( ~ aElementOf0(X55,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
| aElement0(X55) )
& aSet0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
& ( sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X54)
| ~ aElementOf0(X54,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)],[m__4007])])])])]) ).
cnf(c_0_31,negated_conjecture,
~ aElementOf0(esk14_0,xS),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_32,hypothesis,
( ~ aElementOf0(X1,xQ)
| aElementOf0(X1,xS) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,hypothesis,
( ~ aElementOf0(X1,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
| X1 = szmzizndt0(sdtlpdtrp0(xN,xi))
| aElementOf0(X1,xQ) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_34,negated_conjecture,
aElementOf0(esk14_0,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_35,negated_conjecture,
~ aElementOf0(esk14_0,xQ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,hypothesis,
aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),xS),
inference(spm,[status(thm)],[c_0_28,c_0_21]) ).
cnf(c_0_37,negated_conjecture,
szmzizndt0(sdtlpdtrp0(xN,xi)) = esk14_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
cnf(c_0_38,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM583+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.45 % Computer : n009.cluster.edu
% 0.18/0.45 % Model : x86_64 x86_64
% 0.18/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.45 % Memory : 8046.5625MB
% 0.18/0.45 % OS : Linux 6.8.0-71-generic
% 0.18/0.45 % CPULimit : 300
% 0.18/0.45 % WCLimit : 300
% 0.18/0.45 % DateTime : Mon Sep 21 02:41:57 UTC 2026
% 0.18/0.45 % CPUTime :
% 0.18/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.26/0.56 Running first-order theorem proving
% 0.26/0.56 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
% 3.59/1.52 % Version: 3.5.1
% 3.59/1.52 % Preprocessing class: FSLSSMSMSSSNFFN.
% 3.59/1.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.59/1.52 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.59/1.52 % Starting new_bool_3 with 300s (1) cores
% 3.59/1.52 % Starting new_bool_1 with 300s (1) cores
% 3.59/1.52 % Starting sh5l with 300s (1) cores
% 3.59/1.52 % new_bool_1 with pid 669996 completed with status 0
% 3.59/1.52 % Result found by new_bool_1
% 3.59/1.52 % Preprocessing class: FSLSSMSMSSSNFFN.
% 3.59/1.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.59/1.52 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.59/1.52 % Starting new_bool_3 with 300s (1) cores
% 3.59/1.52 % Starting new_bool_1 with 300s (1) cores
% 3.59/1.52 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 3.59/1.52 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.59/1.52 % Search class: FGHSF-SMLM32-MFFFFFNN
% 3.59/1.52 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 3.59/1.52 % Starting SubtermCWHack with 28s (1) cores
% 3.59/1.52 % SubtermCWHack with pid 670005 completed with status 0
% 3.59/1.52 % Result found by SubtermCWHack
% 3.59/1.52 % Preprocessing class: FSLSSMSMSSSNFFN.
% 3.59/1.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.59/1.52 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.59/1.52 % Starting new_bool_3 with 300s (1) cores
% 3.59/1.52 % Starting new_bool_1 with 300s (1) cores
% 3.59/1.52 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 3.59/1.52 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.59/1.52 % Search class: FGHSF-SMLM32-MFFFFFNN
% 3.59/1.52 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 3.59/1.52 % Starting SubtermCWHack with 28s (1) cores
% 3.59/1.52 % Preprocessing time : 0.157 s
% 3.59/1.52
% 3.59/1.52 % Proof found!
% 3.59/1.52 % SZS status Theorem
% 3.59/1.52 % SZS output start CNFRefutation
% See solution above
% 3.59/1.52 % Parsed axioms : 89
% 3.59/1.52 % Removed by relevancy pruning/SinE : 5
% 3.59/1.52 % Initial clauses : 4200
% 3.59/1.52 % Removed in clause preprocessing : 7
% 3.59/1.52 % Initial clauses in saturation : 4193
% 3.59/1.52 % Processed clauses : 903
% 3.59/1.52 % ...of these trivial : 4
% 3.59/1.52 % ...subsumed : 350
% 3.59/1.52 % ...remaining for further processing : 549
% 3.59/1.52 % Other redundant clauses eliminated : 39
% 3.59/1.52 % Clauses deleted for lack of memory : 0
% 3.59/1.52 % Backward-subsumed : 29
% 3.59/1.52 % Backward-rewritten : 21
% 3.59/1.52 % Generated clauses : 2072
% 3.59/1.52 % ...of the previous two non-redundant : 1689
% 3.59/1.52 % ...aggressively subsumed : 0
% 3.59/1.52 % Contextual simplify-reflections : 26
% 3.59/1.52 % Paramodulations : 2032
% 3.59/1.52 % Factorizations : 0
% 3.59/1.52 % NegExts : 0
% 3.59/1.52 % Equation resolutions : 41
% 3.59/1.52 % Disequality decompositions : 0
% 3.59/1.52 % Total rewrite steps : 1590
% 3.59/1.52 % ...of those cached : 1522
% 3.59/1.52 % Propositional unsat checks : 0
% 3.59/1.52 % Propositional check models : 0
% 3.59/1.52 % Propositional check unsatisfiable : 0
% 3.59/1.52 % Propositional clauses : 0
% 3.59/1.52 % Propositional clauses after purity: 0
% 3.59/1.52 % Propositional unsat core size : 0
% 3.59/1.52 % Propositional preprocessing time : 0.000
% 3.59/1.52 % Propositional encoding time : 0.000
% 3.59/1.52 % Propositional solver time : 0.000
% 3.59/1.52 % Success case prop preproc time : 0.000
% 3.59/1.52 % Success case prop encoding time : 0.000
% 3.59/1.52 % Success case prop solver time : 0.000
% 3.59/1.52 % Current number of processed clauses : 466
% 3.59/1.52 % Positive orientable unit clauses : 76
% 3.59/1.52 % Positive unorientable unit clauses: 0
% 3.59/1.52 % Negative unit clauses : 23
% 3.59/1.52 % Non-unit-clauses : 367
% 3.59/1.52 % Current number of unprocessed clauses: 4955
% 3.59/1.52 % ...number of literals in the above : 55141
% 3.59/1.52 % Current number of archived formulas : 0
% 3.59/1.52 % Current number of archived clauses : 53
% 3.59/1.52 % Clause-clause subsumption calls (NU) : 18521
% 3.59/1.52 % Rec. Clause-clause subsumption calls : 11049
% 3.59/1.52 % Non-unit clause-clause subsumptions : 307
% 3.59/1.52 % Unit Clause-clause subsumption calls : 1934
% 3.59/1.52 % Rewrite failures with RHS unbound : 0
% 3.59/1.52 % BW rewrite match attempts : 13
% 3.59/1.52 % BW rewrite match successes : 13
% 3.59/1.52 % Condensation attempts : 0
% 3.59/1.52 % Condensation successes : 0
% 3.59/1.52 % Termbank termtop insertions : 366237
% 3.59/1.52 % Search garbage collected termcells : 26684
% 3.59/1.52
% 3.59/1.52 % -------------------------------------------------
% 3.59/1.52 % User time : 0.639 s
% 3.59/1.52 % System time : 0.042 s
% 3.59/1.52 % Total time : 0.681 s
% 3.59/1.52 % Maximum resident set size: 15040 pages
% 3.59/1.52
% 3.59/1.52 % -------------------------------------------------
% 3.59/1.52 % User time : 0.647 s
% 3.59/1.52 % System time : 0.050 s
% 3.59/1.52 % Total time : 0.697 s
% 3.59/1.52 % Maximum resident set size: 4608 pages
% 3.59/1.52 % E exiting
%------------------------------------------------------------------------------