%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM575+3 : 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:37 PM UTC 2026
% Result : Theorem 10.86s 1.95s
% Output : CNFRefutation 10.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 46 ( 9 unt; 0 def)
% Number of atoms : 387 ( 31 equ)
% Maximal formula atoms : 181 ( 8 avg)
% Number of connectives : 556 ( 215 ~; 207 |; 103 &)
% ( 2 <=>; 29 =>; 0 <=; 0 <~>)
% Maximal formula depth : 45 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 70 ( 0 sgn 50 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__3623,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)) ) ) )
=> ( isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X1)))
& aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& ! [X2] :
( aElementOf0(X2,sdtlpdtrp0(xN,szszuzczcdt0(X1)))
=> aElementOf0(X2,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1)))) )
& aSet0(sdtlpdtrp0(xN,szszuzczcdt0(X1)))
& ! [X2] :
( aElementOf0(X2,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
<=> ( X2 != szmzizndt0(sdtlpdtrp0(xN,X1))
& aElementOf0(X2,sdtlpdtrp0(xN,X1))
& aElement0(X2) ) )
& aSet0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& ! [X2] :
( aElementOf0(X2,sdtlpdtrp0(xN,X1))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X1)),X2) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X1)),sdtlpdtrp0(xN,X1)) ) ) )
& sdtlpdtrp0(xN,sz00) = xS
& szDzozmdt0(xN) = szNzAzT0
& aFunction0(xN) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3623) ).
fof(m__,conjecture,
! [X1,X2] :
( ( X1 != X2
& aElementOf0(X2,szNzAzT0)
& aElementOf0(X1,szNzAzT0) )
=> ~ ( szmzizndt0(sdtlpdtrp0(xN,X1)) = szmzizndt0(sdtlpdtrp0(xN,X2))
& ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,X2))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X1)),X3) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X1)),sdtlpdtrp0(xN,X2))
& ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,X1))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X1)),X3) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X1)),sdtlpdtrp0(xN,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
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/sandbox/benchmark/theBenchmark.p',m__3671) ).
fof(m__3754,hypothesis,
! [X1,X2] :
( ( aElementOf0(X2,szNzAzT0)
& aElementOf0(X1,szNzAzT0) )
=> ( sdtlseqdt0(X2,X1)
=> ( aSubsetOf0(sdtlpdtrp0(xN,X1),sdtlpdtrp0(xN,X2))
& ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,X1))
=> aElementOf0(X3,sdtlpdtrp0(xN,X2)) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3754) ).
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(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(mSuccNum,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( szszuzczcdt0(X1) != sz00
& aElementOf0(szszuzczcdt0(X1),szNzAzT0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSuccNum) ).
fof(c_0_7,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)) ) ) )
=> ( isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X1)))
& aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& ! [X2] :
( aElementOf0(X2,sdtlpdtrp0(xN,szszuzczcdt0(X1)))
=> aElementOf0(X2,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1)))) )
& aSet0(sdtlpdtrp0(xN,szszuzczcdt0(X1)))
& ! [X2] :
( aElementOf0(X2,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
<=> ( X2 != szmzizndt0(sdtlpdtrp0(xN,X1))
& aElementOf0(X2,sdtlpdtrp0(xN,X1))
& aElement0(X2) ) )
& aSet0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& ! [X2] :
( aElementOf0(X2,sdtlpdtrp0(xN,X1))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X1)),X2) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X1)),sdtlpdtrp0(xN,X1)) ) ) )
& sdtlpdtrp0(xN,sz00) = xS
& szDzozmdt0(xN) = szNzAzT0
& aFunction0(xN) ),
inference(fof_simplification,[status(thm)],[m__3623]) ).
fof(c_0_8,negated_conjecture,
~ ! [X1,X2] :
( ( X1 != X2
& aElementOf0(X2,szNzAzT0)
& aElementOf0(X1,szNzAzT0) )
=> ~ ( szmzizndt0(sdtlpdtrp0(xN,X1)) = szmzizndt0(sdtlpdtrp0(xN,X2))
& ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,X2))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X1)),X3) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X1)),sdtlpdtrp0(xN,X2))
& ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,X1))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X1)),X3) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X1)),sdtlpdtrp0(xN,X1)) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_9,hypothesis,
! [X19,X21,X22,X23,X24] :
( ( ~ aElementOf0(X19,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X19))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X19),szNzAzT0)
| isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X19))) )
& ( ~ aElementOf0(X19,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X19))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X19),szNzAzT0)
| aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X19)),sdtmndt0(sdtlpdtrp0(xN,X19),szmzizndt0(sdtlpdtrp0(xN,X19)))) )
& ( ~ aElementOf0(X19,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X19))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X19),szNzAzT0)
| aElementOf0(X24,sdtmndt0(sdtlpdtrp0(xN,X19),szmzizndt0(sdtlpdtrp0(xN,X19))))
| ~ aElementOf0(X24,sdtlpdtrp0(xN,szszuzczcdt0(X19))) )
& ( ~ aElementOf0(X19,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X19))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X19),szNzAzT0)
| aSet0(sdtlpdtrp0(xN,szszuzczcdt0(X19))) )
& ( ~ aElementOf0(X19,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X19))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X19),szNzAzT0)
| aElementOf0(X23,sdtmndt0(sdtlpdtrp0(xN,X19),szmzizndt0(sdtlpdtrp0(xN,X19))))
| X23 = szmzizndt0(sdtlpdtrp0(xN,X19))
| ~ aElementOf0(X23,sdtlpdtrp0(xN,X19))
| ~ aElement0(X23) )
& ( ~ aElementOf0(X19,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X19))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X19),szNzAzT0)
| ~ aElementOf0(X22,sdtmndt0(sdtlpdtrp0(xN,X19),szmzizndt0(sdtlpdtrp0(xN,X19))))
| X22 != szmzizndt0(sdtlpdtrp0(xN,X19)) )
& ( ~ aElementOf0(X19,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X19))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X19),szNzAzT0)
| ~ aElementOf0(X22,sdtmndt0(sdtlpdtrp0(xN,X19),szmzizndt0(sdtlpdtrp0(xN,X19))))
| aElementOf0(X22,sdtlpdtrp0(xN,X19)) )
& ( ~ aElementOf0(X19,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X19))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X19),szNzAzT0)
| ~ aElementOf0(X22,sdtmndt0(sdtlpdtrp0(xN,X19),szmzizndt0(sdtlpdtrp0(xN,X19))))
| aElement0(X22) )
& ( ~ aElementOf0(X19,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X19))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X19),szNzAzT0)
| aSet0(sdtmndt0(sdtlpdtrp0(xN,X19),szmzizndt0(sdtlpdtrp0(xN,X19)))) )
& ( ~ aElementOf0(X19,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X19))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X19),szNzAzT0)
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X19)),X21)
| ~ aElementOf0(X21,sdtlpdtrp0(xN,X19)) )
& ( ~ aElementOf0(X19,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X19))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X19),szNzAzT0)
| aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X19)),sdtlpdtrp0(xN,X19)) )
& ( ~ aElementOf0(X19,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X19))
| ~ aSet0(sdtlpdtrp0(xN,X19))
| ~ aElementOf0(esk4_1(X19),szNzAzT0)
| isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X19))) )
& ( ~ aElementOf0(X19,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X19))
| ~ aSet0(sdtlpdtrp0(xN,X19))
| ~ aElementOf0(esk4_1(X19),szNzAzT0)
| aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X19)),sdtmndt0(sdtlpdtrp0(xN,X19),szmzizndt0(sdtlpdtrp0(xN,X19)))) )
& ( ~ aElementOf0(X19,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X19))
| ~ aSet0(sdtlpdtrp0(xN,X19))
| ~ aElementOf0(esk4_1(X19),szNzAzT0)
| aElementOf0(X24,sdtmndt0(sdtlpdtrp0(xN,X19),szmzizndt0(sdtlpdtrp0(xN,X19))))
| ~ aElementOf0(X24,sdtlpdtrp0(xN,szszuzczcdt0(X19))) )
& ( ~ aElementOf0(X19,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X19))
| ~ aSet0(sdtlpdtrp0(xN,X19))
| ~ aElementOf0(esk4_1(X19),szNzAzT0)
| aSet0(sdtlpdtrp0(xN,szszuzczcdt0(X19))) )
& ( ~ aElementOf0(X19,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X19))
| ~ aSet0(sdtlpdtrp0(xN,X19))
| ~ aElementOf0(esk4_1(X19),szNzAzT0)
| aElementOf0(X23,sdtmndt0(sdtlpdtrp0(xN,X19),szmzizndt0(sdtlpdtrp0(xN,X19))))
| X23 = szmzizndt0(sdtlpdtrp0(xN,X19))
| ~ aElementOf0(X23,sdtlpdtrp0(xN,X19))
| ~ aElement0(X23) )
& ( ~ aElementOf0(X19,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X19))
| ~ aSet0(sdtlpdtrp0(xN,X19))
| ~ aElementOf0(esk4_1(X19),szNzAzT0)
| ~ aElementOf0(X22,sdtmndt0(sdtlpdtrp0(xN,X19),szmzizndt0(sdtlpdtrp0(xN,X19))))
| X22 != szmzizndt0(sdtlpdtrp0(xN,X19)) )
& ( ~ aElementOf0(X19,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X19))
| ~ aSet0(sdtlpdtrp0(xN,X19))
| ~ aElementOf0(esk4_1(X19),szNzAzT0)
| ~ aElementOf0(X22,sdtmndt0(sdtlpdtrp0(xN,X19),szmzizndt0(sdtlpdtrp0(xN,X19))))
| aElementOf0(X22,sdtlpdtrp0(xN,X19)) )
& ( ~ aElementOf0(X19,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X19))
| ~ aSet0(sdtlpdtrp0(xN,X19))
| ~ aElementOf0(esk4_1(X19),szNzAzT0)
| ~ aElementOf0(X22,sdtmndt0(sdtlpdtrp0(xN,X19),szmzizndt0(sdtlpdtrp0(xN,X19))))
| aElement0(X22) )
& ( ~ aElementOf0(X19,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X19))
| ~ aSet0(sdtlpdtrp0(xN,X19))
| ~ aElementOf0(esk4_1(X19),szNzAzT0)
| aSet0(sdtmndt0(sdtlpdtrp0(xN,X19),szmzizndt0(sdtlpdtrp0(xN,X19)))) )
& ( ~ aElementOf0(X19,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X19))
| ~ aSet0(sdtlpdtrp0(xN,X19))
| ~ aElementOf0(esk4_1(X19),szNzAzT0)
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X19)),X21)
| ~ aElementOf0(X21,sdtlpdtrp0(xN,X19)) )
& ( ~ aElementOf0(X19,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X19))
| ~ aSet0(sdtlpdtrp0(xN,X19))
| ~ aElementOf0(esk4_1(X19),szNzAzT0)
| aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X19)),sdtlpdtrp0(xN,X19)) )
& ( ~ aElementOf0(X19,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X19))
| ~ aSet0(sdtlpdtrp0(xN,X19))
| aElementOf0(esk4_1(X19),sdtlpdtrp0(xN,X19))
| isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X19))) )
& ( ~ aElementOf0(X19,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X19))
| ~ aSet0(sdtlpdtrp0(xN,X19))
| aElementOf0(esk4_1(X19),sdtlpdtrp0(xN,X19))
| aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X19)),sdtmndt0(sdtlpdtrp0(xN,X19),szmzizndt0(sdtlpdtrp0(xN,X19)))) )
& ( ~ aElementOf0(X19,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X19))
| ~ aSet0(sdtlpdtrp0(xN,X19))
| aElementOf0(esk4_1(X19),sdtlpdtrp0(xN,X19))
| aElementOf0(X24,sdtmndt0(sdtlpdtrp0(xN,X19),szmzizndt0(sdtlpdtrp0(xN,X19))))
| ~ aElementOf0(X24,sdtlpdtrp0(xN,szszuzczcdt0(X19))) )
& ( ~ aElementOf0(X19,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X19))
| ~ aSet0(sdtlpdtrp0(xN,X19))
| aElementOf0(esk4_1(X19),sdtlpdtrp0(xN,X19))
| aSet0(sdtlpdtrp0(xN,szszuzczcdt0(X19))) )
& ( ~ aElementOf0(X19,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X19))
| ~ aSet0(sdtlpdtrp0(xN,X19))
| aElementOf0(esk4_1(X19),sdtlpdtrp0(xN,X19))
| aElementOf0(X23,sdtmndt0(sdtlpdtrp0(xN,X19),szmzizndt0(sdtlpdtrp0(xN,X19))))
| X23 = szmzizndt0(sdtlpdtrp0(xN,X19))
| ~ aElementOf0(X23,sdtlpdtrp0(xN,X19))
| ~ aElement0(X23) )
& ( ~ aElementOf0(X19,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X19))
| ~ aSet0(sdtlpdtrp0(xN,X19))
| aElementOf0(esk4_1(X19),sdtlpdtrp0(xN,X19))
| ~ aElementOf0(X22,sdtmndt0(sdtlpdtrp0(xN,X19),szmzizndt0(sdtlpdtrp0(xN,X19))))
| X22 != szmzizndt0(sdtlpdtrp0(xN,X19)) )
& ( ~ aElementOf0(X19,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X19))
| ~ aSet0(sdtlpdtrp0(xN,X19))
| aElementOf0(esk4_1(X19),sdtlpdtrp0(xN,X19))
| ~ aElementOf0(X22,sdtmndt0(sdtlpdtrp0(xN,X19),szmzizndt0(sdtlpdtrp0(xN,X19))))
| aElementOf0(X22,sdtlpdtrp0(xN,X19)) )
& ( ~ aElementOf0(X19,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X19))
| ~ aSet0(sdtlpdtrp0(xN,X19))
| aElementOf0(esk4_1(X19),sdtlpdtrp0(xN,X19))
| ~ aElementOf0(X22,sdtmndt0(sdtlpdtrp0(xN,X19),szmzizndt0(sdtlpdtrp0(xN,X19))))
| aElement0(X22) )
& ( ~ aElementOf0(X19,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X19))
| ~ aSet0(sdtlpdtrp0(xN,X19))
| aElementOf0(esk4_1(X19),sdtlpdtrp0(xN,X19))
| aSet0(sdtmndt0(sdtlpdtrp0(xN,X19),szmzizndt0(sdtlpdtrp0(xN,X19)))) )
& ( ~ aElementOf0(X19,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X19))
| ~ aSet0(sdtlpdtrp0(xN,X19))
| aElementOf0(esk4_1(X19),sdtlpdtrp0(xN,X19))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X19)),X21)
| ~ aElementOf0(X21,sdtlpdtrp0(xN,X19)) )
& ( ~ aElementOf0(X19,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X19))
| ~ aSet0(sdtlpdtrp0(xN,X19))
| aElementOf0(esk4_1(X19),sdtlpdtrp0(xN,X19))
| aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X19)),sdtlpdtrp0(xN,X19)) )
& sdtlpdtrp0(xN,sz00) = xS
& szDzozmdt0(xN) = szNzAzT0
& aFunction0(xN) ),
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_7])])])])])])]) ).
fof(c_0_10,hypothesis,
! [X69,X70] :
( ( ~ aElementOf0(X69,szNzAzT0)
| isCountable0(sdtlpdtrp0(xN,X69)) )
& ( ~ aElementOf0(X69,szNzAzT0)
| aSubsetOf0(sdtlpdtrp0(xN,X69),szNzAzT0) )
& ( ~ aElementOf0(X69,szNzAzT0)
| aElementOf0(X70,szNzAzT0)
| ~ aElementOf0(X70,sdtlpdtrp0(xN,X69)) )
& ( ~ aElementOf0(X69,szNzAzT0)
| aSet0(sdtlpdtrp0(xN,X69)) ) ),
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_11,negated_conjecture,
~ ! [X1,X2] :
( ( X1 != X2
& aElementOf0(X2,szNzAzT0)
& aElementOf0(X1,szNzAzT0) )
=> ~ ( szmzizndt0(sdtlpdtrp0(xN,X1)) = szmzizndt0(sdtlpdtrp0(xN,X2))
& ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,X2))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X1)),X3) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X1)),sdtlpdtrp0(xN,X2))
& ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,X1))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X1)),X3) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X1)),sdtlpdtrp0(xN,X1)) ) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
cnf(c_0_12,hypothesis,
( ~ aElementOf0(X2,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X2))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0)
| ~ aElementOf0(X1,sdtmndt0(sdtlpdtrp0(xN,X2),szmzizndt0(sdtlpdtrp0(xN,X2))))
| X1 != szmzizndt0(sdtlpdtrp0(xN,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,hypothesis,
( ~ aElementOf0(X1,szNzAzT0)
| isCountable0(sdtlpdtrp0(xN,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,hypothesis,
( ~ aElementOf0(X1,szNzAzT0)
| aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,hypothesis,
( ~ aElementOf0(X2,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X2))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0)
| ~ aElementOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(X2)))
| aElementOf0(X1,sdtmndt0(sdtlpdtrp0(xN,X2),szmzizndt0(sdtlpdtrp0(xN,X2)))) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_16,hypothesis,
! [X71,X72,X73] :
( ( ~ aElementOf0(X72,szNzAzT0)
| ~ aElementOf0(X71,szNzAzT0)
| ~ sdtlseqdt0(X72,X71)
| aSubsetOf0(sdtlpdtrp0(xN,X71),sdtlpdtrp0(xN,X72)) )
& ( ~ aElementOf0(X72,szNzAzT0)
| ~ aElementOf0(X71,szNzAzT0)
| ~ sdtlseqdt0(X72,X71)
| aElementOf0(X73,sdtlpdtrp0(xN,X72))
| ~ aElementOf0(X73,sdtlpdtrp0(xN,X71)) ) ),
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__3754])])])])]) ).
fof(c_0_17,negated_conjecture,
! [X10,X11] :
( szmzizndt0(sdtlpdtrp0(xN,esk1_0)) = szmzizndt0(sdtlpdtrp0(xN,esk2_0))
& ( sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,esk1_0)),X11)
| ~ aElementOf0(X11,sdtlpdtrp0(xN,esk2_0)) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,esk1_0)),sdtlpdtrp0(xN,esk2_0))
& ( sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,esk1_0)),X10)
| ~ aElementOf0(X10,sdtlpdtrp0(xN,esk1_0)) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,esk1_0)),sdtlpdtrp0(xN,esk1_0))
& esk1_0 != esk2_0
& aElementOf0(esk2_0,szNzAzT0)
& aElementOf0(esk1_0,szNzAzT0) ),
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_11])])])])]) ).
cnf(c_0_18,hypothesis,
( ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X1)),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1)))) ),
inference(er,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
cnf(c_0_19,hypothesis,
( ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(X2)))
| aElementOf0(X1,sdtmndt0(sdtlpdtrp0(xN,X2),szmzizndt0(sdtlpdtrp0(xN,X2)))) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_15,c_0_13]),c_0_14]) ).
cnf(c_0_20,hypothesis,
( ~ aElementOf0(X3,szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0)
| ~ sdtlseqdt0(X3,X2)
| ~ aElementOf0(X1,sdtlpdtrp0(xN,X2))
| aElementOf0(X1,sdtlpdtrp0(xN,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,negated_conjecture,
aElementOf0(szmzizndt0(sdtlpdtrp0(xN,esk1_0)),sdtlpdtrp0(xN,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,negated_conjecture,
aElementOf0(esk2_0,szNzAzT0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,hypothesis,
( ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X1)),sdtlpdtrp0(xN,szszuzczcdt0(X1))) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( ~ aElementOf0(X1,szNzAzT0)
| ~ sdtlseqdt0(X1,esk2_0)
| aElementOf0(szmzizndt0(sdtlpdtrp0(xN,esk1_0)),sdtlpdtrp0(xN,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_25,negated_conjecture,
aElementOf0(esk1_0,szNzAzT0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_26,plain,
! [X87,X88] :
( sdtlseqdt0(szszuzczcdt0(X88),X87)
| sdtlseqdt0(X87,X88)
| ~ aElementOf0(X88,szNzAzT0)
| ~ aElementOf0(X87,szNzAzT0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLessTotal])])]) ).
cnf(c_0_27,negated_conjecture,
szmzizndt0(sdtlpdtrp0(xN,esk1_0)) = szmzizndt0(sdtlpdtrp0(xN,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_28,negated_conjecture,
aElementOf0(szmzizndt0(sdtlpdtrp0(xN,esk1_0)),sdtlpdtrp0(xN,esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_29,plain,
! [X82,X83] :
( X82 = X83
| ~ sdtlseqdt0(X83,X82)
| ~ sdtlseqdt0(X82,X83)
| ~ aElementOf0(X83,szNzAzT0)
| ~ aElementOf0(X82,szNzAzT0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLessASymm])])]) ).
cnf(c_0_30,negated_conjecture,
( ~ aElementOf0(szszuzczcdt0(esk1_0),szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(esk1_0),esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_31,plain,
( ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0)
| sdtlseqdt0(szszuzczcdt0(X2),X1)
| sdtlseqdt0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_32,negated_conjecture,
~ aElementOf0(szmzizndt0(sdtlpdtrp0(xN,esk1_0)),sdtlpdtrp0(xN,szszuzczcdt0(esk2_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_27]),c_0_22])]) ).
cnf(c_0_33,negated_conjecture,
( ~ aElementOf0(X1,szNzAzT0)
| ~ sdtlseqdt0(X1,esk1_0)
| aElementOf0(szmzizndt0(sdtlpdtrp0(xN,esk1_0)),sdtlpdtrp0(xN,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_28]),c_0_25])]) ).
cnf(c_0_34,plain,
( ~ sdtlseqdt0(X2,X1)
| ~ sdtlseqdt0(X1,X2)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_35,negated_conjecture,
( ~ aElementOf0(szszuzczcdt0(esk1_0),szNzAzT0)
| sdtlseqdt0(esk2_0,esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_25]),c_0_22])]) ).
cnf(c_0_36,negated_conjecture,
esk1_0 != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_37,negated_conjecture,
( ~ aElementOf0(szszuzczcdt0(esk2_0),szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(esk2_0),esk1_0) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
fof(c_0_38,plain,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( szszuzczcdt0(X1) != sz00
& aElementOf0(szszuzczcdt0(X1),szNzAzT0) ) ),
inference(fof_simplification,[status(thm)],[mSuccNum]) ).
cnf(c_0_39,negated_conjecture,
( ~ aElementOf0(szszuzczcdt0(esk1_0),szNzAzT0)
| ~ sdtlseqdt0(esk1_0,esk2_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_22]),c_0_25])]),c_0_36]) ).
cnf(c_0_40,negated_conjecture,
( ~ aElementOf0(szszuzczcdt0(esk2_0),szNzAzT0)
| sdtlseqdt0(esk1_0,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_31]),c_0_22]),c_0_25])]) ).
fof(c_0_41,plain,
! [X109] :
( ( ~ aElementOf0(X109,szNzAzT0)
| szszuzczcdt0(X109) != sz00 )
& ( ~ aElementOf0(X109,szNzAzT0)
| aElementOf0(szszuzczcdt0(X109),szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_38])])])]) ).
cnf(c_0_42,negated_conjecture,
( ~ aElementOf0(szszuzczcdt0(esk2_0),szNzAzT0)
| ~ aElementOf0(szszuzczcdt0(esk1_0),szNzAzT0) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,plain,
( ~ aElementOf0(X1,szNzAzT0)
| aElementOf0(szszuzczcdt0(X1),szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_44,negated_conjecture,
~ aElementOf0(szszuzczcdt0(esk1_0),szNzAzT0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_22])]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_43]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM575+3 : 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:41:43 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
% 10.86/1.95 % Version: 3.5.1
% 10.86/1.95 % Preprocessing class: FSLSSMSMSSSNFFN.
% 10.86/1.95 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.86/1.95 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 10.86/1.95 % Starting new_bool_3 with 300s (1) cores
% 10.86/1.95 % Starting new_bool_1 with 300s (1) cores
% 10.86/1.95 % Starting sh5l with 300s (1) cores
% 10.86/1.95 % sh5l with pid 1831608 completed with status 0
% 10.86/1.95 % Result found by sh5l
% 10.86/1.95 % Preprocessing class: FSLSSMSMSSSNFFN.
% 10.86/1.95 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.86/1.95 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 10.86/1.95 % Starting new_bool_3 with 300s (1) cores
% 10.86/1.95 % Starting new_bool_1 with 300s (1) cores
% 10.86/1.95 % Starting sh5l with 300s (1) cores
% 10.86/1.95 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 10.86/1.95 % SinE strategy is gf500_gu_R04_F100_L20000
% 10.86/1.95 % Search class: FGHSF-SMLM32-MFFFFFNN
% 10.86/1.95 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 10.86/1.95 % Starting SubtermCWHack with 28s (1) cores
% 10.86/1.95 % SubtermCWHack with pid 1831687 completed with status 0
% 10.86/1.95 % Result found by SubtermCWHack
% 10.86/1.95 % Preprocessing class: FSLSSMSMSSSNFFN.
% 10.86/1.95 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.86/1.95 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 10.86/1.95 % Starting new_bool_3 with 300s (1) cores
% 10.86/1.95 % Starting new_bool_1 with 300s (1) cores
% 10.86/1.95 % Starting sh5l with 300s (1) cores
% 10.86/1.95 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 10.86/1.95 % SinE strategy is gf500_gu_R04_F100_L20000
% 10.86/1.95 % Search class: FGHSF-SMLM32-MFFFFFNN
% 10.86/1.95 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 10.86/1.95 % Starting SubtermCWHack with 28s (1) cores
% 10.86/1.95 % Preprocessing time : 0.048 s
% 10.86/1.95
% 10.86/1.95 % Proof found!
% 10.86/1.95 % SZS status Theorem
% 10.86/1.95 % SZS output start CNFRefutation
% See solution above
% 10.86/1.95 % Parsed axioms : 84
% 10.86/1.95 % Removed by relevancy pruning/SinE : 3
% 10.86/1.95 % Initial clauses : 4178
% 10.86/1.95 % Removed in clause preprocessing : 7
% 10.86/1.95 % Initial clauses in saturation : 4171
% 10.86/1.95 % Processed clauses : 8713
% 10.86/1.95 % ...of these trivial : 17
% 10.86/1.95 % ...subsumed : 4285
% 10.86/1.95 % ...remaining for further processing : 4411
% 10.86/1.95 % Other redundant clauses eliminated : 269
% 10.86/1.95 % Clauses deleted for lack of memory : 0
% 10.86/1.95 % Backward-subsumed : 550
% 10.86/1.95 % Backward-rewritten : 1582
% 10.86/1.95 % Generated clauses : 50650
% 10.86/1.95 % ...of the previous two non-redundant : 47378
% 10.86/1.95 % ...aggressively subsumed : 0
% 10.86/1.95 % Contextual simplify-reflections : 144
% 10.86/1.95 % Paramodulations : 50401
% 10.86/1.95 % Factorizations : 0
% 10.86/1.95 % NegExts : 0
% 10.86/1.95 % Equation resolutions : 270
% 10.86/1.95 % Disequality decompositions : 0
% 10.86/1.95 % Total rewrite steps : 19738
% 10.86/1.95 % ...of those cached : 19651
% 10.86/1.95 % Propositional unsat checks : 0
% 10.86/1.95 % Propositional check models : 0
% 10.86/1.95 % Propositional check unsatisfiable : 0
% 10.86/1.95 % Propositional clauses : 0
% 10.86/1.95 % Propositional clauses after purity: 0
% 10.86/1.95 % Propositional unsat core size : 0
% 10.86/1.95 % Propositional preprocessing time : 0.000
% 10.86/1.95 % Propositional encoding time : 0.000
% 10.86/1.95 % Propositional solver time : 0.000
% 10.86/1.95 % Success case prop preproc time : 0.000
% 10.86/1.95 % Success case prop encoding time : 0.000
% 10.86/1.95 % Success case prop solver time : 0.000
% 10.86/1.95 % Current number of processed clauses : 2035
% 10.86/1.95 % Positive orientable unit clauses : 89
% 10.86/1.95 % Positive unorientable unit clauses: 0
% 10.86/1.95 % Negative unit clauses : 24
% 10.86/1.95 % Non-unit-clauses : 1922
% 10.86/1.95 % Current number of unprocessed clauses: 40837
% 10.86/1.95 % ...number of literals in the above : 232317
% 10.86/1.95 % Current number of archived formulas : 0
% 10.86/1.95 % Current number of archived clauses : 2134
% 10.86/1.95 % Clause-clause subsumption calls (NU) : 1907603
% 10.86/1.95 % Rec. Clause-clause subsumption calls : 603913
% 10.86/1.95 % Non-unit clause-clause subsumptions : 4167
% 10.86/1.95 % Unit Clause-clause subsumption calls : 18681
% 10.86/1.95 % Rewrite failures with RHS unbound : 0
% 10.86/1.95 % BW rewrite match attempts : 57
% 10.86/1.95 % BW rewrite match successes : 27
% 10.86/1.95 % Condensation attempts : 0
% 10.86/1.95 % Condensation successes : 0
% 10.86/1.95 % Termbank termtop insertions : 1399824
% 10.86/1.95 % Search garbage collected termcells : 26649
% 10.86/1.95
% 10.86/1.95 % -------------------------------------------------
% 10.86/1.95 % User time : 1.460 s
% 10.86/1.95 % System time : 0.043 s
% 10.86/1.95 % Total time : 1.503 s
% 10.86/1.95 % Maximum resident set size: 15028 pages
% 10.86/1.95
% 10.86/1.95 % -------------------------------------------------
% 10.86/1.95 % User time : 1.463 s
% 10.86/1.95 % System time : 0.049 s
% 10.86/1.95 % Total time : 1.512 s
% 10.86/1.95 % Maximum resident set size: 4608 pages
% 10.86/1.95 % E exiting
%------------------------------------------------------------------------------