%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM541+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n006.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.24s 0.47s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 10
% Syntax : Number of formulae : 70 ( 7 unt; 0 def)
% Number of atoms : 255 ( 44 equ)
% Maximal formula atoms : 32 ( 3 avg)
% Number of connectives : 325 ( 140 ~; 146 |; 22 &)
% ( 5 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 75 ( 0 sgn 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mSuccNum,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( szszuzczcdt0(X1) != sz00
& aElementOf0(szszuzczcdt0(X1),szNzAzT0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSuccNum) ).
fof(mDefSeg,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ! [X2] :
( X2 = slbdtrb0(X1)
<=> ( ! [X3] :
( aElementOf0(X3,X2)
<=> ( sdtlseqdt0(szszuzczcdt0(X3),X1)
& aElementOf0(X3,szNzAzT0) ) )
& aSet0(X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefSeg) ).
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/sandbox/benchmark/theBenchmark.p',mLessTrans) ).
fof(mLessSucc,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> sdtlseqdt0(X1,szszuzczcdt0(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mLessSucc) ).
fof(m__,conjecture,
( aElementOf0(xm,slbdtrb0(szszuzczcdt0(xn)))
<=> ( xm = xn
| aElementOf0(xm,slbdtrb0(xn)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mLessTotal,axiom,
! [X1,X2] :
( ( aElementOf0(X2,szNzAzT0)
& aElementOf0(X1,szNzAzT0) )
=> ( sdtlseqdt0(szszuzczcdt0(X2),X1)
| sdtlseqdt0(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mLessTotal) ).
fof(mSuccLess,axiom,
! [X1,X2] :
( ( aElementOf0(X2,szNzAzT0)
& aElementOf0(X1,szNzAzT0) )
=> ( sdtlseqdt0(X1,X2)
<=> sdtlseqdt0(szszuzczcdt0(X1),szszuzczcdt0(X2)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSuccLess) ).
fof(m__1936,hypothesis,
( aElementOf0(xn,szNzAzT0)
& aElementOf0(xm,szNzAzT0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1936) ).
fof(mLessASymm,axiom,
! [X1,X2] :
( ( aElementOf0(X2,szNzAzT0)
& aElementOf0(X1,szNzAzT0) )
=> ( ( sdtlseqdt0(X2,X1)
& sdtlseqdt0(X1,X2) )
=> X1 = X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mLessASymm) ).
fof(mNatNSucc,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> X1 != szszuzczcdt0(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mNatNSucc) ).
fof(c_0_10,plain,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( szszuzczcdt0(X1) != sz00
& aElementOf0(szszuzczcdt0(X1),szNzAzT0) ) ),
inference(fof_simplification,[status(thm)],[mSuccNum]) ).
fof(c_0_11,plain,
! [X5,X6,X7,X8,X9] :
( ( ~ aElementOf0(X5,szNzAzT0)
| X9 = slbdtrb0(X5)
| ~ aSet0(X9)
| aElementOf0(esk1_2(X5,X9),X9)
| sdtlseqdt0(szszuzczcdt0(esk1_2(X5,X9)),X5) )
& ( ~ aElementOf0(X5,szNzAzT0)
| X9 = slbdtrb0(X5)
| ~ aSet0(X9)
| aElementOf0(esk1_2(X5,X9),X9)
| aElementOf0(esk1_2(X5,X9),szNzAzT0) )
& ( ~ aElementOf0(X5,szNzAzT0)
| X9 = slbdtrb0(X5)
| ~ aSet0(X9)
| ~ sdtlseqdt0(szszuzczcdt0(esk1_2(X5,X9)),X5)
| ~ aElementOf0(esk1_2(X5,X9),szNzAzT0)
| ~ aElementOf0(esk1_2(X5,X9),X9) )
& ( ~ aElementOf0(X5,szNzAzT0)
| X6 != slbdtrb0(X5)
| aElementOf0(X8,X6)
| ~ sdtlseqdt0(szszuzczcdt0(X8),X5)
| ~ aElementOf0(X8,szNzAzT0) )
& ( ~ aElementOf0(X5,szNzAzT0)
| X6 != slbdtrb0(X5)
| ~ aElementOf0(X7,X6)
| sdtlseqdt0(szszuzczcdt0(X7),X5) )
& ( ~ aElementOf0(X5,szNzAzT0)
| X6 != slbdtrb0(X5)
| ~ aElementOf0(X7,X6)
| aElementOf0(X7,szNzAzT0) )
& ( ~ aElementOf0(X5,szNzAzT0)
| X6 != slbdtrb0(X5)
| aSet0(X6) ) ),
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)],[mDefSeg])])])])])])]) ).
fof(c_0_12,plain,
! [X25,X26,X27] :
( sdtlseqdt0(X25,X27)
| ~ sdtlseqdt0(X26,X27)
| ~ sdtlseqdt0(X25,X26)
| ~ aElementOf0(X27,szNzAzT0)
| ~ aElementOf0(X26,szNzAzT0)
| ~ aElementOf0(X25,szNzAzT0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLessTrans])])]) ).
fof(c_0_13,plain,
! [X17] :
( sdtlseqdt0(X17,szszuzczcdt0(X17))
| ~ aElementOf0(X17,szNzAzT0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLessSucc])])]) ).
fof(c_0_14,plain,
! [X38] :
( ( ~ aElementOf0(X38,szNzAzT0)
| szszuzczcdt0(X38) != sz00 )
& ( ~ aElementOf0(X38,szNzAzT0)
| aElementOf0(szszuzczcdt0(X38),szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
fof(c_0_15,negated_conjecture,
~ ( aElementOf0(xm,slbdtrb0(szszuzczcdt0(xn)))
<=> ( xm = xn
| aElementOf0(xm,slbdtrb0(xn)) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_16,plain,
( ~ aElementOf0(X2,szNzAzT0)
| X3 != slbdtrb0(X2)
| ~ sdtlseqdt0(szszuzczcdt0(X1),X2)
| ~ aElementOf0(X1,szNzAzT0)
| aElementOf0(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_17,plain,
! [X18,X19] :
( sdtlseqdt0(szszuzczcdt0(X19),X18)
| sdtlseqdt0(X18,X19)
| ~ aElementOf0(X19,szNzAzT0)
| ~ aElementOf0(X18,szNzAzT0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLessTotal])])]) ).
fof(c_0_18,plain,
! [X15,X16] :
( ( ~ aElementOf0(X16,szNzAzT0)
| ~ aElementOf0(X15,szNzAzT0)
| sdtlseqdt0(X15,X16)
| ~ sdtlseqdt0(szszuzczcdt0(X15),szszuzczcdt0(X16)) )
& ( ~ aElementOf0(X16,szNzAzT0)
| ~ aElementOf0(X15,szNzAzT0)
| sdtlseqdt0(szszuzczcdt0(X15),szszuzczcdt0(X16))
| ~ sdtlseqdt0(X15,X16) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSuccLess])])])]) ).
cnf(c_0_19,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_12]) ).
cnf(c_0_20,plain,
( ~ aElementOf0(X1,szNzAzT0)
| sdtlseqdt0(X1,szszuzczcdt0(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
( ~ aElementOf0(X1,szNzAzT0)
| aElementOf0(szszuzczcdt0(X1),szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_22,negated_conjecture,
( ( xm = xn
| aElementOf0(xm,slbdtrb0(xn))
| aElementOf0(xm,slbdtrb0(szszuzczcdt0(xn))) )
& ( ~ aElementOf0(xm,slbdtrb0(szszuzczcdt0(xn)))
| xm != xn )
& ( ~ aElementOf0(xm,slbdtrb0(szszuzczcdt0(xn)))
| ~ aElementOf0(xm,slbdtrb0(xn)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])]) ).
cnf(c_0_23,plain,
( ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X1),X2)
| aElementOf0(X1,slbdtrb0(X2)) ),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_24,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_25,plain,
( ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X1),szszuzczcdt0(X2))
| sdtlseqdt0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,plain,
( ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0)
| ~ sdtlseqdt0(X1,X2)
| sdtlseqdt0(X1,szszuzczcdt0(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_27,negated_conjecture,
( ~ aElementOf0(xm,slbdtrb0(szszuzczcdt0(xn)))
| ~ aElementOf0(xm,slbdtrb0(xn)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,plain,
( ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0)
| aElementOf0(X2,slbdtrb0(X1))
| sdtlseqdt0(X1,X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,hypothesis,
aElementOf0(xm,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__1936]) ).
cnf(c_0_30,plain,
( ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X1),X2)
| sdtlseqdt0(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_21]) ).
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_28]),c_0_29])]) ).
cnf(c_0_32,hypothesis,
aElementOf0(xn,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__1936]) ).
cnf(c_0_33,negated_conjecture,
( ~ aElementOf0(szszuzczcdt0(xn),szNzAzT0)
| ~ aElementOf0(xm,slbdtrb0(xn))
| sdtlseqdt0(xn,xm) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_29]),c_0_32])]) ).
fof(c_0_34,plain,
! [X23,X24] :
( X23 = X24
| ~ sdtlseqdt0(X24,X23)
| ~ sdtlseqdt0(X23,X24)
| ~ aElementOf0(X24,szNzAzT0)
| ~ aElementOf0(X23,szNzAzT0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLessASymm])])]) ).
fof(c_0_35,plain,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> X1 != szszuzczcdt0(X1) ),
inference(fof_simplification,[status(thm)],[mNatNSucc]) ).
cnf(c_0_36,negated_conjecture,
( ~ aElementOf0(szszuzczcdt0(xn),szNzAzT0)
| sdtlseqdt0(xn,xm) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_28]),c_0_32]),c_0_29])]) ).
cnf(c_0_37,plain,
( ~ sdtlseqdt0(X2,X1)
| ~ sdtlseqdt0(X1,X2)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_38,negated_conjecture,
( ~ aElementOf0(xm,slbdtrb0(szszuzczcdt0(xn)))
| xm != xn ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_39,plain,
! [X14] :
( X14 != szszuzczcdt0(X14)
| ~ aElementOf0(X14,szNzAzT0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_35])])]) ).
cnf(c_0_40,negated_conjecture,
sdtlseqdt0(xn,xm),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_21]),c_0_32])]) ).
cnf(c_0_41,plain,
( ~ aElementOf0(X2,szNzAzT0)
| X3 != slbdtrb0(X2)
| ~ aElementOf0(X1,X3)
| sdtlseqdt0(szszuzczcdt0(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_42,plain,
( ~ aElementOf0(X3,szNzAzT0)
| X2 != slbdtrb0(X3)
| ~ aElementOf0(X1,X2)
| aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_43,negated_conjecture,
( ~ aElementOf0(xm,slbdtrb0(xn))
| ~ aElementOf0(szszuzczcdt0(xn),szNzAzT0)
| ~ sdtlseqdt0(xm,szszuzczcdt0(xn))
| szszuzczcdt0(xn) = xm ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_31]),c_0_29])]) ).
cnf(c_0_44,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_38,c_0_28]),c_0_29])]) ).
cnf(c_0_45,plain,
( X1 != szszuzczcdt0(X1)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_46,negated_conjecture,
( ~ aElementOf0(X1,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_19,c_0_40]),c_0_29]),c_0_32])]) ).
cnf(c_0_47,plain,
( ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,slbdtrb0(X2))
| sdtlseqdt0(szszuzczcdt0(X1),X2) ),
inference(er,[status(thm)],[c_0_41]) ).
cnf(c_0_48,plain,
( ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,slbdtrb0(X2))
| aElementOf0(X1,szNzAzT0) ),
inference(er,[status(thm)],[c_0_42]) ).
cnf(c_0_49,negated_conjecture,
( ~ aElementOf0(xm,slbdtrb0(xn))
| ~ aElementOf0(szszuzczcdt0(xn),szNzAzT0)
| ~ sdtlseqdt0(xm,xn)
| szszuzczcdt0(xn) = xm ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_26]),c_0_32]),c_0_29])]) ).
cnf(c_0_50,negated_conjecture,
( ~ aElementOf0(szszuzczcdt0(xn),szNzAzT0)
| ~ sdtlseqdt0(xm,szszuzczcdt0(xn))
| xn != xm
| szszuzczcdt0(xn) = xm ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_44]),c_0_29])]) ).
cnf(c_0_51,plain,
( ~ aElementOf0(X1,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X1),X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_20]),c_0_21]),c_0_45]) ).
cnf(c_0_52,negated_conjecture,
( ~ aElementOf0(X1,slbdtrb0(xn))
| ~ aElementOf0(szszuzczcdt0(X1),szNzAzT0)
| sdtlseqdt0(szszuzczcdt0(X1),xm) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_32])]) ).
cnf(c_0_53,plain,
( ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,slbdtrb0(szszuzczcdt0(X2)))
| sdtlseqdt0(X1,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_47]),c_0_48]),c_0_21]) ).
cnf(c_0_54,negated_conjecture,
( xm = xn
| aElementOf0(xm,slbdtrb0(xn))
| aElementOf0(xm,slbdtrb0(szszuzczcdt0(xn))) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_55,negated_conjecture,
( ~ aElementOf0(szszuzczcdt0(xn),szNzAzT0)
| ~ sdtlseqdt0(xm,xn)
| sdtlseqdt0(xn,xm)
| szszuzczcdt0(xn) = xm ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_28]),c_0_32]),c_0_29])]) ).
cnf(c_0_56,negated_conjecture,
( ~ aElementOf0(szszuzczcdt0(xn),szNzAzT0)
| ~ sdtlseqdt0(xm,xn)
| xn != xm
| szszuzczcdt0(xn) = xm ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_26]),c_0_32]),c_0_29])]) ).
cnf(c_0_57,negated_conjecture,
( ~ aElementOf0(xm,slbdtrb0(xn))
| ~ aElementOf0(szszuzczcdt0(xm),szNzAzT0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_29])]) ).
cnf(c_0_58,negated_conjecture,
( aElementOf0(xm,slbdtrb0(xn))
| sdtlseqdt0(xm,xn)
| xn = xm ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_32])]) ).
cnf(c_0_59,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_37,c_0_40]),c_0_32]),c_0_29])]) ).
cnf(c_0_60,plain,
( ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0)
| sdtlseqdt0(X2,X1)
| sdtlseqdt0(X1,X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_24]) ).
cnf(c_0_61,negated_conjecture,
( ~ sdtlseqdt0(xm,xn)
| sdtlseqdt0(xn,xm)
| szszuzczcdt0(xn) = xm ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_21]),c_0_32])]) ).
cnf(c_0_62,negated_conjecture,
( ~ sdtlseqdt0(xm,xn)
| xn != xm
| szszuzczcdt0(xn) = xm ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_21]),c_0_32])]) ).
cnf(c_0_63,negated_conjecture,
( ~ aElementOf0(szszuzczcdt0(xm),szNzAzT0)
| xn = xm ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]) ).
cnf(c_0_64,hypothesis,
( ~ aElementOf0(X1,szNzAzT0)
| sdtlseqdt0(xm,X1)
| sdtlseqdt0(X1,xm) ),
inference(spm,[status(thm)],[c_0_60,c_0_29]) ).
cnf(c_0_65,negated_conjecture,
( ~ sdtlseqdt0(xm,xn)
| szszuzczcdt0(xn) = xm ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_61]),c_0_32]),c_0_29])]),c_0_62]) ).
cnf(c_0_66,negated_conjecture,
xn = xm,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_21]),c_0_29])]) ).
cnf(c_0_67,hypothesis,
sdtlseqdt0(xm,xm),
inference(spm,[status(thm)],[c_0_64,c_0_29]) ).
cnf(c_0_68,negated_conjecture,
szszuzczcdt0(xm) = xm,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_66]),c_0_66]),c_0_67])]) ).
cnf(c_0_69,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_68]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM541+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.37 % Computer : n006.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 21 02:38:45 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 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
% 0.24/0.47 % Version: 3.5.1
% 0.24/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.24/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.24/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.47 % Starting sh5l with 300s (1) cores
% 0.24/0.47 % new_bool_3 with pid 1825221 completed with status 0
% 0.24/0.47 % Result found by new_bool_3
% 0.24/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.24/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.24/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.47 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.24/0.47 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.47 % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.47 % SubtermCWHack with pid 1825224 completed with status 0
% 0.24/0.47 % Result found by SubtermCWHack
% 0.24/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.24/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.24/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.47 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.24/0.47 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.47 % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.47 % Preprocessing time : 0.002 s
% 0.24/0.47
% 0.24/0.47 % Proof found!
% 0.24/0.47 % SZS status Theorem
% 0.24/0.47 % SZS output start CNFRefutation
% See solution above
% 0.24/0.47 % Parsed axioms : 54
% 0.24/0.47 % Removed by relevancy pruning/SinE : 13
% 0.24/0.47 % Initial clauses : 62
% 0.24/0.47 % Removed in clause preprocessing : 4
% 0.24/0.47 % Initial clauses in saturation : 58
% 0.24/0.47 % Processed clauses : 388
% 0.24/0.47 % ...of these trivial : 2
% 0.24/0.47 % ...subsumed : 141
% 0.24/0.47 % ...remaining for further processing : 245
% 0.24/0.47 % Other redundant clauses eliminated : 11
% 0.24/0.47 % Clauses deleted for lack of memory : 0
% 0.24/0.47 % Backward-subsumed : 22
% 0.24/0.47 % Backward-rewritten : 44
% 0.24/0.47 % Generated clauses : 942
% 0.24/0.47 % ...of the previous two non-redundant : 811
% 0.24/0.47 % ...aggressively subsumed : 0
% 0.24/0.47 % Contextual simplify-reflections : 48
% 0.24/0.47 % Paramodulations : 930
% 0.24/0.47 % Factorizations : 0
% 0.24/0.47 % NegExts : 0
% 0.24/0.47 % Equation resolutions : 12
% 0.24/0.47 % Disequality decompositions : 0
% 0.24/0.47 % Total rewrite steps : 751
% 0.24/0.47 % ...of those cached : 732
% 0.24/0.47 % Propositional unsat checks : 0
% 0.24/0.47 % Propositional check models : 0
% 0.24/0.47 % Propositional check unsatisfiable : 0
% 0.24/0.47 % Propositional clauses : 0
% 0.24/0.47 % Propositional clauses after purity: 0
% 0.24/0.47 % Propositional unsat core size : 0
% 0.24/0.47 % Propositional preprocessing time : 0.000
% 0.24/0.47 % Propositional encoding time : 0.000
% 0.24/0.47 % Propositional solver time : 0.000
% 0.24/0.47 % Success case prop preproc time : 0.000
% 0.24/0.47 % Success case prop encoding time : 0.000
% 0.24/0.47 % Success case prop solver time : 0.000
% 0.24/0.47 % Current number of processed clauses : 171
% 0.24/0.47 % Positive orientable unit clauses : 17
% 0.24/0.47 % Positive unorientable unit clauses: 0
% 0.24/0.47 % Negative unit clauses : 4
% 0.24/0.47 % Non-unit-clauses : 150
% 0.24/0.47 % Current number of unprocessed clauses: 463
% 0.24/0.47 % ...number of literals in the above : 2446
% 0.24/0.47 % Current number of archived formulas : 0
% 0.24/0.47 % Current number of archived clauses : 66
% 0.24/0.47 % Clause-clause subsumption calls (NU) : 6906
% 0.24/0.47 % Rec. Clause-clause subsumption calls : 2640
% 0.24/0.47 % Non-unit clause-clause subsumptions : 184
% 0.24/0.47 % Unit Clause-clause subsumption calls : 287
% 0.24/0.47 % Rewrite failures with RHS unbound : 0
% 0.24/0.47 % BW rewrite match attempts : 6
% 0.24/0.47 % BW rewrite match successes : 6
% 0.24/0.47 % Condensation attempts : 0
% 0.24/0.47 % Condensation successes : 0
% 0.24/0.47 % Termbank termtop insertions : 22678
% 0.24/0.47 % Search garbage collected termcells : 1140
% 0.24/0.47
% 0.24/0.47 % -------------------------------------------------
% 0.24/0.47 % User time : 0.038 s
% 0.24/0.47 % System time : 0.003 s
% 0.24/0.47 % Total time : 0.041 s
% 0.24/0.47 % Maximum resident set size: 3692 pages
% 0.24/0.47
% 0.24/0.47 % -------------------------------------------------
% 0.24/0.47 % User time : 0.041 s
% 0.24/0.47 % System time : 0.007 s
% 0.24/0.47 % Total time : 0.048 s
% 0.24/0.47 % Maximum resident set size: 4864 pages
% 0.24/0.47 % E exiting
%------------------------------------------------------------------------------