%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM541+2 : 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 : n017.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:29 PM UTC 2026
% Result : Theorem 0.21s 15.65s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 10
% Syntax : Number of formulae : 59 ( 6 unt; 0 def)
% Number of atoms : 232 ( 41 equ)
% Maximal formula atoms : 50 ( 3 avg)
% Number of connectives : 278 ( 105 ~; 119 |; 37 &)
% ( 1 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 46 ( 0 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ( ( xm = xn
| ( aElementOf0(xm,slbdtrb0(xn))
& sdtlseqdt0(szszuzczcdt0(xm),xn) ) )
=> ( aElementOf0(xm,slbdtrb0(szszuzczcdt0(xn)))
| sdtlseqdt0(szszuzczcdt0(xm),szszuzczcdt0(xn)) ) )
& ( ( aElementOf0(xm,slbdtrb0(szszuzczcdt0(xn)))
& sdtlseqdt0(szszuzczcdt0(xm),szszuzczcdt0(xn)) )
=> ( xm = xn
| aElementOf0(xm,slbdtrb0(xn))
| sdtlseqdt0(szszuzczcdt0(xm),xn) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(mSuccLess,axiom,
! [X1,X2] :
( ( aElementOf0(X2,szNzAzT0)
& aElementOf0(X1,szNzAzT0) )
=> ( sdtlseqdt0(X1,X2)
<=> sdtlseqdt0(szszuzczcdt0(X1),szszuzczcdt0(X2)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSuccLess) ).
fof(m__1936,hypothesis,
( aElementOf0(xn,szNzAzT0)
& aElementOf0(xm,szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1936) ).
fof(mLessTotal,axiom,
! [X1,X2] :
( ( aElementOf0(X2,szNzAzT0)
& aElementOf0(X1,szNzAzT0) )
=> ( sdtlseqdt0(szszuzczcdt0(X2),X1)
| sdtlseqdt0(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mLessTotal) ).
fof(mLessASymm,axiom,
! [X1,X2] :
( ( aElementOf0(X2,szNzAzT0)
& aElementOf0(X1,szNzAzT0) )
=> ( ( sdtlseqdt0(X2,X1)
& sdtlseqdt0(X1,X2) )
=> X1 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mLessASymm) ).
fof(mLessTrans,axiom,
! [X1,X2,X3] :
( ( aElementOf0(X3,szNzAzT0)
& aElementOf0(X2,szNzAzT0)
& aElementOf0(X1,szNzAzT0) )
=> ( ( sdtlseqdt0(X2,X3)
& sdtlseqdt0(X1,X2) )
=> sdtlseqdt0(X1,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mLessTrans) ).
fof(mLessSucc,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> sdtlseqdt0(X1,szszuzczcdt0(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mLessSucc) ).
fof(mSuccNum,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( szszuzczcdt0(X1) != sz00
& aElementOf0(szszuzczcdt0(X1),szNzAzT0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSuccNum) ).
fof(mNatNSucc,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> X1 != szszuzczcdt0(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mNatNSucc) ).
fof(mLessRefl,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> sdtlseqdt0(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mLessRefl) ).
fof(c_0_10,negated_conjecture,
~ ( ( ( xm = xn
| ( aElementOf0(xm,slbdtrb0(xn))
& sdtlseqdt0(szszuzczcdt0(xm),xn) ) )
=> ( aElementOf0(xm,slbdtrb0(szszuzczcdt0(xn)))
| sdtlseqdt0(szszuzczcdt0(xm),szszuzczcdt0(xn)) ) )
& ( ( aElementOf0(xm,slbdtrb0(szszuzczcdt0(xn)))
& sdtlseqdt0(szszuzczcdt0(xm),szszuzczcdt0(xn)) )
=> ( xm = xn
| aElementOf0(xm,slbdtrb0(xn))
| sdtlseqdt0(szszuzczcdt0(xm),xn) ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_11,negated_conjecture,
( ( xm != xn
| ~ aElementOf0(xm,slbdtrb0(szszuzczcdt0(xn))) )
& ( xm != xn
| ~ sdtlseqdt0(szszuzczcdt0(xm),szszuzczcdt0(xn)) )
& ( xm != xn
| xm = xn
| aElementOf0(xm,slbdtrb0(xn)) )
& ( xm != xn
| xm = xn
| sdtlseqdt0(szszuzczcdt0(xm),xn) )
& ( ~ aElementOf0(xm,slbdtrb0(xn))
| ~ aElementOf0(xm,slbdtrb0(szszuzczcdt0(xn))) )
& ( ~ aElementOf0(xm,slbdtrb0(xn))
| ~ sdtlseqdt0(szszuzczcdt0(xm),szszuzczcdt0(xn)) )
& ( ~ aElementOf0(xm,slbdtrb0(xn))
| xm = xn
| aElementOf0(xm,slbdtrb0(xn)) )
& ( ~ aElementOf0(xm,slbdtrb0(xn))
| xm = xn
| sdtlseqdt0(szszuzczcdt0(xm),xn) )
& ( ~ sdtlseqdt0(szszuzczcdt0(xm),xn)
| ~ aElementOf0(xm,slbdtrb0(szszuzczcdt0(xn))) )
& ( ~ sdtlseqdt0(szszuzczcdt0(xm),xn)
| ~ sdtlseqdt0(szszuzczcdt0(xm),szszuzczcdt0(xn)) )
& ( ~ sdtlseqdt0(szszuzczcdt0(xm),xn)
| xm = xn
| aElementOf0(xm,slbdtrb0(xn)) )
& ( ~ sdtlseqdt0(szszuzczcdt0(xm),xn)
| xm = xn
| sdtlseqdt0(szszuzczcdt0(xm),xn) )
& ( aElementOf0(xm,slbdtrb0(szszuzczcdt0(xn)))
| ~ aElementOf0(xm,slbdtrb0(szszuzczcdt0(xn))) )
& ( aElementOf0(xm,slbdtrb0(szszuzczcdt0(xn)))
| ~ sdtlseqdt0(szszuzczcdt0(xm),szszuzczcdt0(xn)) )
& ( aElementOf0(xm,slbdtrb0(szszuzczcdt0(xn)))
| xm = xn
| aElementOf0(xm,slbdtrb0(xn)) )
& ( aElementOf0(xm,slbdtrb0(szszuzczcdt0(xn)))
| xm = xn
| sdtlseqdt0(szszuzczcdt0(xm),xn) )
& ( sdtlseqdt0(szszuzczcdt0(xm),szszuzczcdt0(xn))
| ~ aElementOf0(xm,slbdtrb0(szszuzczcdt0(xn))) )
& ( sdtlseqdt0(szszuzczcdt0(xm),szszuzczcdt0(xn))
| ~ sdtlseqdt0(szszuzczcdt0(xm),szszuzczcdt0(xn)) )
& ( sdtlseqdt0(szszuzczcdt0(xm),szszuzczcdt0(xn))
| xm = xn
| aElementOf0(xm,slbdtrb0(xn)) )
& ( sdtlseqdt0(szszuzczcdt0(xm),szszuzczcdt0(xn))
| xm = xn
| sdtlseqdt0(szszuzczcdt0(xm),xn) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
fof(c_0_12,plain,
! [X66,X67] :
( ( ~ aElementOf0(X67,szNzAzT0)
| ~ aElementOf0(X66,szNzAzT0)
| sdtlseqdt0(X66,X67)
| ~ sdtlseqdt0(szszuzczcdt0(X66),szszuzczcdt0(X67)) )
& ( ~ aElementOf0(X67,szNzAzT0)
| ~ aElementOf0(X66,szNzAzT0)
| sdtlseqdt0(szszuzczcdt0(X66),szszuzczcdt0(X67))
| ~ sdtlseqdt0(X66,X67) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSuccLess])])])]) ).
cnf(c_0_13,negated_conjecture,
( ~ sdtlseqdt0(szszuzczcdt0(xm),xn)
| ~ sdtlseqdt0(szszuzczcdt0(xm),szszuzczcdt0(xn)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,plain,
( ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0)
| ~ sdtlseqdt0(X1,X2)
| sdtlseqdt0(szszuzczcdt0(X1),szszuzczcdt0(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,hypothesis,
aElementOf0(xn,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__1936]) ).
cnf(c_0_16,hypothesis,
aElementOf0(xm,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__1936]) ).
fof(c_0_17,plain,
! [X75,X76] :
( sdtlseqdt0(szszuzczcdt0(X76),X75)
| sdtlseqdt0(X75,X76)
| ~ aElementOf0(X76,szNzAzT0)
| ~ aElementOf0(X75,szNzAzT0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLessTotal])])]) ).
fof(c_0_18,plain,
! [X70,X71] :
( X70 = X71
| ~ sdtlseqdt0(X71,X70)
| ~ sdtlseqdt0(X70,X71)
| ~ aElementOf0(X71,szNzAzT0)
| ~ aElementOf0(X70,szNzAzT0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLessASymm])])]) ).
cnf(c_0_19,negated_conjecture,
( ~ sdtlseqdt0(xm,xn)
| ~ sdtlseqdt0(szszuzczcdt0(xm),xn) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16])]) ).
cnf(c_0_20,plain,
( ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0)
| sdtlseqdt0(szszuzczcdt0(X2),X1)
| sdtlseqdt0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_21,negated_conjecture,
( xm != xn
| ~ sdtlseqdt0(szszuzczcdt0(xm),szszuzczcdt0(xn)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_22,plain,
( ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X1),szszuzczcdt0(X2))
| sdtlseqdt0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_23,negated_conjecture,
( sdtlseqdt0(szszuzczcdt0(xm),szszuzczcdt0(xn))
| xm = xn
| aElementOf0(xm,slbdtrb0(xn)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_24,plain,
( ~ sdtlseqdt0(X2,X1)
| ~ sdtlseqdt0(X1,X2)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,negated_conjecture,
( ~ sdtlseqdt0(xm,xn)
| sdtlseqdt0(xn,xm) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_16]),c_0_15])]) ).
cnf(c_0_26,negated_conjecture,
( ~ sdtlseqdt0(xm,xn)
| xn != xm ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_14]),c_0_15]),c_0_16])]) ).
cnf(c_0_27,negated_conjecture,
( ~ aElementOf0(xm,slbdtrb0(xn))
| ~ sdtlseqdt0(szszuzczcdt0(xm),szszuzczcdt0(xn)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_28,negated_conjecture,
( aElementOf0(xm,slbdtrb0(xn))
| sdtlseqdt0(xm,xn)
| xn = xm ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_15]),c_0_16])]) ).
cnf(c_0_29,negated_conjecture,
~ sdtlseqdt0(xm,xn),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_15]),c_0_16])]),c_0_26]) ).
fof(c_0_30,plain,
! [X72,X73,X74] :
( sdtlseqdt0(X72,X74)
| ~ sdtlseqdt0(X73,X74)
| ~ sdtlseqdt0(X72,X73)
| ~ aElementOf0(X74,szNzAzT0)
| ~ aElementOf0(X73,szNzAzT0)
| ~ aElementOf0(X72,szNzAzT0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLessTrans])])]) ).
cnf(c_0_31,negated_conjecture,
( ~ aElementOf0(szszuzczcdt0(xn),szNzAzT0)
| ~ aElementOf0(xm,slbdtrb0(xn))
| sdtlseqdt0(szszuzczcdt0(xn),xm) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_20]),c_0_16])]) ).
cnf(c_0_32,negated_conjecture,
( aElementOf0(xm,slbdtrb0(xn))
| xn = xm ),
inference(sr,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
( ~ aElementOf0(szszuzczcdt0(xn),szNzAzT0)
| xn != xm
| sdtlseqdt0(szszuzczcdt0(xn),xm) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_20]),c_0_16])]) ).
cnf(c_0_34,plain,
( ~ sdtlseqdt0(X2,X3)
| ~ sdtlseqdt0(X1,X2)
| ~ aElementOf0(X3,szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0)
| sdtlseqdt0(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_35,negated_conjecture,
( ~ aElementOf0(szszuzczcdt0(xn),szNzAzT0)
| sdtlseqdt0(szszuzczcdt0(xn),xm) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
fof(c_0_36,plain,
! [X68] :
( sdtlseqdt0(X68,szszuzczcdt0(X68))
| ~ aElementOf0(X68,szNzAzT0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLessSucc])])]) ).
fof(c_0_37,plain,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( szszuzczcdt0(X1) != sz00
& aElementOf0(szszuzczcdt0(X1),szNzAzT0) ) ),
inference(fof_simplification,[status(thm)],[mSuccNum]) ).
fof(c_0_38,plain,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> X1 != szszuzczcdt0(X1) ),
inference(fof_simplification,[status(thm)],[mNatNSucc]) ).
cnf(c_0_39,negated_conjecture,
( ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(szszuzczcdt0(xn),szNzAzT0)
| ~ sdtlseqdt0(X1,szszuzczcdt0(xn))
| sdtlseqdt0(X1,xm) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_16])]) ).
cnf(c_0_40,plain,
( ~ aElementOf0(X1,szNzAzT0)
| sdtlseqdt0(X1,szszuzczcdt0(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_41,negated_conjecture,
( sdtlseqdt0(szszuzczcdt0(xm),szszuzczcdt0(xn))
| xm = xn
| sdtlseqdt0(szszuzczcdt0(xm),xn) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_42,plain,
! [X56] :
( ( ~ aElementOf0(X56,szNzAzT0)
| szszuzczcdt0(X56) != sz00 )
& ( ~ aElementOf0(X56,szNzAzT0)
| aElementOf0(szszuzczcdt0(X56),szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_37])])])]) ).
fof(c_0_43,plain,
! [X61] :
( X61 != szszuzczcdt0(X61)
| ~ aElementOf0(X61,szNzAzT0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_38])])]) ).
cnf(c_0_44,negated_conjecture,
( ~ aElementOf0(szszuzczcdt0(xn),szNzAzT0)
| sdtlseqdt0(xn,xm) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_15])]) ).
cnf(c_0_45,negated_conjecture,
( sdtlseqdt0(xm,xn)
| sdtlseqdt0(szszuzczcdt0(xm),xn)
| xn = xm ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_41]),c_0_15]),c_0_16])]) ).
cnf(c_0_46,plain,
( ~ aElementOf0(X1,szNzAzT0)
| aElementOf0(szszuzczcdt0(X1),szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_47,plain,
( X1 != szszuzczcdt0(X1)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_48,negated_conjecture,
( ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(szszuzczcdt0(xn),szNzAzT0)
| ~ sdtlseqdt0(X1,xn)
| sdtlseqdt0(X1,xm) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_44]),c_0_16]),c_0_15])]) ).
cnf(c_0_49,negated_conjecture,
( sdtlseqdt0(szszuzczcdt0(xm),xn)
| xn = xm ),
inference(sr,[status(thm)],[c_0_45,c_0_29]) ).
cnf(c_0_50,plain,
( ~ aElementOf0(X1,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X1),X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_40]),c_0_46]),c_0_47]) ).
cnf(c_0_51,negated_conjecture,
( ~ aElementOf0(szszuzczcdt0(xm),szNzAzT0)
| ~ aElementOf0(szszuzczcdt0(xn),szNzAzT0)
| sdtlseqdt0(szszuzczcdt0(xm),xm)
| xn = xm ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_52,negated_conjecture,
( ~ aElementOf0(szszuzczcdt0(xm),szNzAzT0)
| ~ aElementOf0(szszuzczcdt0(xn),szNzAzT0)
| xn = xm ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_16])]) ).
cnf(c_0_53,negated_conjecture,
( ~ aElementOf0(szszuzczcdt0(xm),szNzAzT0)
| xn = xm ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_46]),c_0_15])]) ).
cnf(c_0_54,negated_conjecture,
xn = xm,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_46]),c_0_16])]) ).
fof(c_0_55,plain,
! [X69] :
( sdtlseqdt0(X69,X69)
| ~ aElementOf0(X69,szNzAzT0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLessRefl])])]) ).
cnf(c_0_56,negated_conjecture,
~ sdtlseqdt0(xm,xm),
inference(rw,[status(thm)],[c_0_29,c_0_54]) ).
cnf(c_0_57,plain,
( ~ aElementOf0(X1,szNzAzT0)
| sdtlseqdt0(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM541+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/15.50 % Computer : n017.cluster.edu
% 0.19/15.50 % Model : x86_64 x86_64
% 0.19/15.50 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/15.50 % Memory : 8046.5625MB
% 0.19/15.50 % OS : Linux 6.8.0-71-generic
% 0.19/15.50 % CPULimit : 300
% 0.19/15.50 % WCLimit : 300
% 0.19/15.50 % DateTime : Mon Sep 21 02:34:14 UTC 2026
% 0.19/15.50 % CPUTime :
% 0.19/15.50 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/15.56 Running first-order theorem proving
% 0.19/15.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
% 0.21/15.65 % Version: 3.5.1
% 0.21/15.65 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/15.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/15.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/15.65 % Starting new_bool_3 with 300s (1) cores
% 0.21/15.65 % Starting new_bool_1 with 300s (1) cores
% 0.21/15.65 % Starting sh5l with 300s (1) cores
% 0.21/15.65 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1236718 completed with status 0
% 0.21/15.65 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.21/15.65 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/15.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/15.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/15.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/15.65 % No SInE strategy applied
% 0.21/15.65 % Search class: FGHSF-FFMM31-MFFFFFNN
% 0.21/15.65 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/15.65 % Starting SubtermCWHack with 136s (1) cores
% 0.21/15.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.21/15.65 % Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.21/15.65 % Starting new_bool_3 with 136s (1) cores
% 0.21/15.65 % Starting new_bool_1 with 136s (1) cores
% 0.21/15.65 % SubtermCWHack with pid 1236722 completed with status 0
% 0.21/15.65 % Result found by SubtermCWHack
% 0.21/15.65 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/15.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/15.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/15.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/15.65 % No SInE strategy applied
% 0.21/15.65 % Search class: FGHSF-FFMM31-MFFFFFNN
% 0.21/15.65 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/15.65 % Starting SubtermCWHack with 136s (1) cores
% 0.21/15.65 % Preprocessing time : 0.002 s
% 0.21/15.65
% 0.21/15.65 % Proof found!
% 0.21/15.65 % SZS status Theorem
% 0.21/15.65 % SZS output start CNFRefutation
% See solution above
% 0.21/15.65 % Parsed axioms : 54
% 0.21/15.65 % Removed by relevancy pruning/SinE : 0
% 0.21/15.65 % Initial clauses : 114
% 0.21/15.65 % Removed in clause preprocessing : 12
% 0.21/15.65 % Initial clauses in saturation : 102
% 0.21/15.65 % Processed clauses : 309
% 0.21/15.65 % ...of these trivial : 1
% 0.21/15.65 % ...subsumed : 77
% 0.21/15.65 % ...remaining for further processing : 231
% 0.21/15.65 % Other redundant clauses eliminated : 27
% 0.21/15.65 % Clauses deleted for lack of memory : 0
% 0.21/15.65 % Backward-subsumed : 21
% 0.21/15.65 % Backward-rewritten : 22
% 0.21/15.65 % Generated clauses : 669
% 0.21/15.65 % ...of the previous two non-redundant : 576
% 0.21/15.65 % ...aggressively subsumed : 0
% 0.21/15.65 % Contextual simplify-reflections : 34
% 0.21/15.65 % Paramodulations : 641
% 0.21/15.65 % Factorizations : 0
% 0.21/15.65 % NegExts : 0
% 0.21/15.65 % Equation resolutions : 28
% 0.21/15.65 % Disequality decompositions : 0
% 0.21/15.65 % Total rewrite steps : 331
% 0.21/15.65 % ...of those cached : 316
% 0.21/15.65 % Propositional unsat checks : 0
% 0.21/15.65 % Propositional check models : 0
% 0.21/15.65 % Propositional check unsatisfiable : 0
% 0.21/15.65 % Propositional clauses : 0
% 0.21/15.65 % Propositional clauses after purity: 0
% 0.21/15.65 % Propositional unsat core size : 0
% 0.21/15.65 % Propositional preprocessing time : 0.000
% 0.21/15.65 % Propositional encoding time : 0.000
% 0.21/15.65 % Propositional solver time : 0.000
% 0.21/15.65 % Success case prop preproc time : 0.000
% 0.21/15.65 % Success case prop encoding time : 0.000
% 0.21/15.65 % Success case prop solver time : 0.000
% 0.21/15.65 % Current number of processed clauses : 164
% 0.21/15.65 % Positive orientable unit clauses : 14
% 0.21/15.65 % Positive unorientable unit clauses: 0
% 0.21/15.65 % Negative unit clauses : 4
% 0.21/15.65 % Non-unit-clauses : 146
% 0.21/15.65 % Current number of unprocessed clauses: 348
% 0.21/15.65 % ...number of literals in the above : 2150
% 0.21/15.65 % Current number of archived formulas : 0
% 0.21/15.65 % Current number of archived clauses : 45
% 0.21/15.65 % Clause-clause subsumption calls (NU) : 4601
% 0.21/15.65 % Rec. Clause-clause subsumption calls : 1618
% 0.21/15.65 % Non-unit clause-clause subsumptions : 123
% 0.21/15.65 % Unit Clause-clause subsumption calls : 64
% 0.21/15.65 % Rewrite failures with RHS unbound : 0
% 0.21/15.65 % BW rewrite match attempts : 3
% 0.21/15.65 % BW rewrite match successes : 3
% 0.21/15.65 % Condensation attempts : 0
% 0.21/15.65 % Condensation successes : 0
% 0.21/15.65 % Termbank termtop insertions : 20540
% 0.21/15.65 % Search garbage collected termcells : 1974
% 0.21/15.65
% 0.21/15.65 % -------------------------------------------------
% 0.21/15.65 % User time : 0.045 s
% 0.21/15.65 % System time : 0.006 s
% 0.21/15.65 % Total time : 0.050 s
% 0.21/15.65 % Maximum resident set size: 3952 pages
% 0.21/15.65
% 0.21/15.65 % -------------------------------------------------
% 0.21/15.65 % User time : 0.175 s
% 0.21/15.65 % System time : 0.025 s
% 0.21/15.65 % Total time : 0.200 s
% 0.21/15.65 % Maximum resident set size: 4608 pages
% 0.21/15.65 % E exiting
%------------------------------------------------------------------------------