TSTP Solution File: NUM574+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM574+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:56:26 EDT 2023
% Result : Theorem 40.30s 5.74s
% Output : CNFRefutation 40.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 36 ( 12 unt; 0 def)
% Number of atoms : 292 ( 35 equ)
% Maximal formula atoms : 181 ( 8 avg)
% Number of connectives : 426 ( 170 ~; 181 |; 59 &)
% ( 1 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 45 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 7 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn; 20 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__3786_02,hypothesis,
( ( sdtlseqdt0(xj,xi)
& ? [X1] :
( aElementOf0(X1,szNzAzT0)
& szszuzczcdt0(X1) = xi ) )
=> ( sdtlseqdt0(xj,xi)
=> ( ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> aElementOf0(X1,sdtlpdtrp0(xN,xj)) )
& aSubsetOf0(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,xj)) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Sat4CaJlBv/E---3.1_31334.p',m__3786_02) ).
fof(m__,conjecture,
( sdtlseqdt0(xj,xi)
=> ( ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> aElementOf0(X1,sdtlpdtrp0(xN,xj)) )
| aSubsetOf0(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,xj)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Sat4CaJlBv/E---3.1_31334.p',m__) ).
fof(mNatExtra,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( X1 = sz00
| ? [X2] :
( aElementOf0(X2,szNzAzT0)
& X1 = szszuzczcdt0(X2) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Sat4CaJlBv/E---3.1_31334.p',mNatExtra) ).
fof(m__3786,hypothesis,
( aElementOf0(xj,szNzAzT0)
& aElementOf0(xi,szNzAzT0) ),
file('/export/starexec/sandbox2/tmp/tmp.Sat4CaJlBv/E---3.1_31334.p',m__3786) ).
fof(mNoScLessZr,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ~ sdtlseqdt0(szszuzczcdt0(X1),sz00) ),
file('/export/starexec/sandbox2/tmp/tmp.Sat4CaJlBv/E---3.1_31334.p',mNoScLessZr) ).
fof(m__3623,hypothesis,
( aFunction0(xN)
& szDzozmdt0(xN) = szNzAzT0
& sdtlpdtrp0(xN,sz00) = xS
& ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( ( ( ( aSet0(sdtlpdtrp0(xN,X1))
& ! [X2] :
( aElementOf0(X2,sdtlpdtrp0(xN,X1))
=> aElementOf0(X2,szNzAzT0) ) )
| aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0) )
& isCountable0(sdtlpdtrp0(xN,X1)) )
=> ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X1)),sdtlpdtrp0(xN,X1))
& ! [X2] :
( aElementOf0(X2,sdtlpdtrp0(xN,X1))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X1)),X2) )
& aSet0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& ! [X2] :
( aElementOf0(X2,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
<=> ( aElement0(X2)
& aElementOf0(X2,sdtlpdtrp0(xN,X1))
& X2 != szmzizndt0(sdtlpdtrp0(xN,X1)) ) )
& aSet0(sdtlpdtrp0(xN,szszuzczcdt0(X1)))
& ! [X2] :
( aElementOf0(X2,sdtlpdtrp0(xN,szszuzczcdt0(X1)))
=> aElementOf0(X2,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1)))) )
& aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X1))) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Sat4CaJlBv/E---3.1_31334.p',m__3623) ).
fof(c_0_6,hypothesis,
! [X100,X101] :
( ( ~ aElementOf0(X101,sdtlpdtrp0(xN,xi))
| aElementOf0(X101,sdtlpdtrp0(xN,xj))
| ~ sdtlseqdt0(xj,xi)
| ~ sdtlseqdt0(xj,xi)
| ~ aElementOf0(X100,szNzAzT0)
| szszuzczcdt0(X100) != xi )
& ( aSubsetOf0(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,xj))
| ~ sdtlseqdt0(xj,xi)
| ~ sdtlseqdt0(xj,xi)
| ~ aElementOf0(X100,szNzAzT0)
| szszuzczcdt0(X100) != xi ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3786_02])])])]) ).
fof(c_0_7,negated_conjecture,
~ ( sdtlseqdt0(xj,xi)
=> ( ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> aElementOf0(X1,sdtlpdtrp0(xN,xj)) )
| aSubsetOf0(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,xj)) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_8,hypothesis,
( aSubsetOf0(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,xj))
| ~ sdtlseqdt0(xj,xi)
| ~ sdtlseqdt0(xj,xi)
| ~ aElementOf0(X1,szNzAzT0)
| szszuzczcdt0(X1) != xi ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_9,negated_conjecture,
( sdtlseqdt0(xj,xi)
& aElementOf0(esk1_0,sdtlpdtrp0(xN,xi))
& ~ aElementOf0(esk1_0,sdtlpdtrp0(xN,xj))
& ~ aSubsetOf0(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,xj)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
fof(c_0_10,plain,
! [X107] :
( ( aElementOf0(esk23_1(X107),szNzAzT0)
| X107 = sz00
| ~ aElementOf0(X107,szNzAzT0) )
& ( X107 = szszuzczcdt0(esk23_1(X107))
| X107 = sz00
| ~ aElementOf0(X107,szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mNatExtra])])])]) ).
cnf(c_0_11,hypothesis,
( aSubsetOf0(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,xj))
| szszuzczcdt0(X1) != xi
| ~ aElementOf0(X1,szNzAzT0)
| ~ sdtlseqdt0(xj,xi) ),
inference(cn,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
sdtlseqdt0(xj,xi),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
~ aSubsetOf0(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,xj)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( X1 = szszuzczcdt0(esk23_1(X1))
| X1 = sz00
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,hypothesis,
aElementOf0(xi,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3786]) ).
fof(c_0_16,plain,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ~ sdtlseqdt0(szszuzczcdt0(X1),sz00) ),
inference(fof_simplification,[status(thm)],[mNoScLessZr]) ).
cnf(c_0_17,hypothesis,
( szszuzczcdt0(X1) != xi
| ~ aElementOf0(X1,szNzAzT0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]),c_0_13]) ).
cnf(c_0_18,hypothesis,
( szszuzczcdt0(esk23_1(xi)) = xi
| xi = sz00 ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
fof(c_0_19,plain,
! [X111] :
( ~ aElementOf0(X111,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X111),sz00) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])]) ).
cnf(c_0_20,plain,
( aElementOf0(esk23_1(X1),szNzAzT0)
| X1 = sz00
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_21,hypothesis,
aElementOf0(xj,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3786]) ).
cnf(c_0_22,hypothesis,
( xi = sz00
| ~ aElementOf0(esk23_1(xi),szNzAzT0) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
( ~ aElementOf0(X1,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X1),sz00) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,hypothesis,
( xj = sz00
| aElementOf0(esk23_1(xj),szNzAzT0) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,hypothesis,
xi = sz00,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_15]),c_0_22]) ).
fof(c_0_26,hypothesis,
! [X89,X91,X92,X93,X94] :
( aFunction0(xN)
& szDzozmdt0(xN) = szNzAzT0
& sdtlpdtrp0(xN,sz00) = xS
& ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X89)),sdtlpdtrp0(xN,X89))
| aElementOf0(esk22_1(X89),sdtlpdtrp0(xN,X89))
| ~ aSet0(sdtlpdtrp0(xN,X89))
| ~ isCountable0(sdtlpdtrp0(xN,X89))
| ~ aElementOf0(X89,szNzAzT0) )
& ( ~ aElementOf0(X91,sdtlpdtrp0(xN,X89))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X89)),X91)
| aElementOf0(esk22_1(X89),sdtlpdtrp0(xN,X89))
| ~ aSet0(sdtlpdtrp0(xN,X89))
| ~ isCountable0(sdtlpdtrp0(xN,X89))
| ~ aElementOf0(X89,szNzAzT0) )
& ( aSet0(sdtmndt0(sdtlpdtrp0(xN,X89),szmzizndt0(sdtlpdtrp0(xN,X89))))
| aElementOf0(esk22_1(X89),sdtlpdtrp0(xN,X89))
| ~ aSet0(sdtlpdtrp0(xN,X89))
| ~ isCountable0(sdtlpdtrp0(xN,X89))
| ~ aElementOf0(X89,szNzAzT0) )
& ( aElement0(X92)
| ~ aElementOf0(X92,sdtmndt0(sdtlpdtrp0(xN,X89),szmzizndt0(sdtlpdtrp0(xN,X89))))
| aElementOf0(esk22_1(X89),sdtlpdtrp0(xN,X89))
| ~ aSet0(sdtlpdtrp0(xN,X89))
| ~ isCountable0(sdtlpdtrp0(xN,X89))
| ~ aElementOf0(X89,szNzAzT0) )
& ( aElementOf0(X92,sdtlpdtrp0(xN,X89))
| ~ aElementOf0(X92,sdtmndt0(sdtlpdtrp0(xN,X89),szmzizndt0(sdtlpdtrp0(xN,X89))))
| aElementOf0(esk22_1(X89),sdtlpdtrp0(xN,X89))
| ~ aSet0(sdtlpdtrp0(xN,X89))
| ~ isCountable0(sdtlpdtrp0(xN,X89))
| ~ aElementOf0(X89,szNzAzT0) )
& ( X92 != szmzizndt0(sdtlpdtrp0(xN,X89))
| ~ aElementOf0(X92,sdtmndt0(sdtlpdtrp0(xN,X89),szmzizndt0(sdtlpdtrp0(xN,X89))))
| aElementOf0(esk22_1(X89),sdtlpdtrp0(xN,X89))
| ~ aSet0(sdtlpdtrp0(xN,X89))
| ~ isCountable0(sdtlpdtrp0(xN,X89))
| ~ aElementOf0(X89,szNzAzT0) )
& ( ~ aElement0(X93)
| ~ aElementOf0(X93,sdtlpdtrp0(xN,X89))
| X93 = szmzizndt0(sdtlpdtrp0(xN,X89))
| aElementOf0(X93,sdtmndt0(sdtlpdtrp0(xN,X89),szmzizndt0(sdtlpdtrp0(xN,X89))))
| aElementOf0(esk22_1(X89),sdtlpdtrp0(xN,X89))
| ~ aSet0(sdtlpdtrp0(xN,X89))
| ~ isCountable0(sdtlpdtrp0(xN,X89))
| ~ aElementOf0(X89,szNzAzT0) )
& ( aSet0(sdtlpdtrp0(xN,szszuzczcdt0(X89)))
| aElementOf0(esk22_1(X89),sdtlpdtrp0(xN,X89))
| ~ aSet0(sdtlpdtrp0(xN,X89))
| ~ isCountable0(sdtlpdtrp0(xN,X89))
| ~ aElementOf0(X89,szNzAzT0) )
& ( ~ aElementOf0(X94,sdtlpdtrp0(xN,szszuzczcdt0(X89)))
| aElementOf0(X94,sdtmndt0(sdtlpdtrp0(xN,X89),szmzizndt0(sdtlpdtrp0(xN,X89))))
| aElementOf0(esk22_1(X89),sdtlpdtrp0(xN,X89))
| ~ aSet0(sdtlpdtrp0(xN,X89))
| ~ isCountable0(sdtlpdtrp0(xN,X89))
| ~ aElementOf0(X89,szNzAzT0) )
& ( aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X89)),sdtmndt0(sdtlpdtrp0(xN,X89),szmzizndt0(sdtlpdtrp0(xN,X89))))
| aElementOf0(esk22_1(X89),sdtlpdtrp0(xN,X89))
| ~ aSet0(sdtlpdtrp0(xN,X89))
| ~ isCountable0(sdtlpdtrp0(xN,X89))
| ~ aElementOf0(X89,szNzAzT0) )
& ( isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X89)))
| aElementOf0(esk22_1(X89),sdtlpdtrp0(xN,X89))
| ~ aSet0(sdtlpdtrp0(xN,X89))
| ~ isCountable0(sdtlpdtrp0(xN,X89))
| ~ aElementOf0(X89,szNzAzT0) )
& ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X89)),sdtlpdtrp0(xN,X89))
| ~ aElementOf0(esk22_1(X89),szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,X89))
| ~ isCountable0(sdtlpdtrp0(xN,X89))
| ~ aElementOf0(X89,szNzAzT0) )
& ( ~ aElementOf0(X91,sdtlpdtrp0(xN,X89))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X89)),X91)
| ~ aElementOf0(esk22_1(X89),szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,X89))
| ~ isCountable0(sdtlpdtrp0(xN,X89))
| ~ aElementOf0(X89,szNzAzT0) )
& ( aSet0(sdtmndt0(sdtlpdtrp0(xN,X89),szmzizndt0(sdtlpdtrp0(xN,X89))))
| ~ aElementOf0(esk22_1(X89),szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,X89))
| ~ isCountable0(sdtlpdtrp0(xN,X89))
| ~ aElementOf0(X89,szNzAzT0) )
& ( aElement0(X92)
| ~ aElementOf0(X92,sdtmndt0(sdtlpdtrp0(xN,X89),szmzizndt0(sdtlpdtrp0(xN,X89))))
| ~ aElementOf0(esk22_1(X89),szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,X89))
| ~ isCountable0(sdtlpdtrp0(xN,X89))
| ~ aElementOf0(X89,szNzAzT0) )
& ( aElementOf0(X92,sdtlpdtrp0(xN,X89))
| ~ aElementOf0(X92,sdtmndt0(sdtlpdtrp0(xN,X89),szmzizndt0(sdtlpdtrp0(xN,X89))))
| ~ aElementOf0(esk22_1(X89),szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,X89))
| ~ isCountable0(sdtlpdtrp0(xN,X89))
| ~ aElementOf0(X89,szNzAzT0) )
& ( X92 != szmzizndt0(sdtlpdtrp0(xN,X89))
| ~ aElementOf0(X92,sdtmndt0(sdtlpdtrp0(xN,X89),szmzizndt0(sdtlpdtrp0(xN,X89))))
| ~ aElementOf0(esk22_1(X89),szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,X89))
| ~ isCountable0(sdtlpdtrp0(xN,X89))
| ~ aElementOf0(X89,szNzAzT0) )
& ( ~ aElement0(X93)
| ~ aElementOf0(X93,sdtlpdtrp0(xN,X89))
| X93 = szmzizndt0(sdtlpdtrp0(xN,X89))
| aElementOf0(X93,sdtmndt0(sdtlpdtrp0(xN,X89),szmzizndt0(sdtlpdtrp0(xN,X89))))
| ~ aElementOf0(esk22_1(X89),szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,X89))
| ~ isCountable0(sdtlpdtrp0(xN,X89))
| ~ aElementOf0(X89,szNzAzT0) )
& ( aSet0(sdtlpdtrp0(xN,szszuzczcdt0(X89)))
| ~ aElementOf0(esk22_1(X89),szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,X89))
| ~ isCountable0(sdtlpdtrp0(xN,X89))
| ~ aElementOf0(X89,szNzAzT0) )
& ( ~ aElementOf0(X94,sdtlpdtrp0(xN,szszuzczcdt0(X89)))
| aElementOf0(X94,sdtmndt0(sdtlpdtrp0(xN,X89),szmzizndt0(sdtlpdtrp0(xN,X89))))
| ~ aElementOf0(esk22_1(X89),szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,X89))
| ~ isCountable0(sdtlpdtrp0(xN,X89))
| ~ aElementOf0(X89,szNzAzT0) )
& ( aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X89)),sdtmndt0(sdtlpdtrp0(xN,X89),szmzizndt0(sdtlpdtrp0(xN,X89))))
| ~ aElementOf0(esk22_1(X89),szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,X89))
| ~ isCountable0(sdtlpdtrp0(xN,X89))
| ~ aElementOf0(X89,szNzAzT0) )
& ( isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X89)))
| ~ aElementOf0(esk22_1(X89),szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,X89))
| ~ isCountable0(sdtlpdtrp0(xN,X89))
| ~ aElementOf0(X89,szNzAzT0) )
& ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X89)),sdtlpdtrp0(xN,X89))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X89),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X89))
| ~ aElementOf0(X89,szNzAzT0) )
& ( ~ aElementOf0(X91,sdtlpdtrp0(xN,X89))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X89)),X91)
| ~ aSubsetOf0(sdtlpdtrp0(xN,X89),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X89))
| ~ aElementOf0(X89,szNzAzT0) )
& ( aSet0(sdtmndt0(sdtlpdtrp0(xN,X89),szmzizndt0(sdtlpdtrp0(xN,X89))))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X89),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X89))
| ~ aElementOf0(X89,szNzAzT0) )
& ( aElement0(X92)
| ~ aElementOf0(X92,sdtmndt0(sdtlpdtrp0(xN,X89),szmzizndt0(sdtlpdtrp0(xN,X89))))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X89),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X89))
| ~ aElementOf0(X89,szNzAzT0) )
& ( aElementOf0(X92,sdtlpdtrp0(xN,X89))
| ~ aElementOf0(X92,sdtmndt0(sdtlpdtrp0(xN,X89),szmzizndt0(sdtlpdtrp0(xN,X89))))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X89),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X89))
| ~ aElementOf0(X89,szNzAzT0) )
& ( X92 != szmzizndt0(sdtlpdtrp0(xN,X89))
| ~ aElementOf0(X92,sdtmndt0(sdtlpdtrp0(xN,X89),szmzizndt0(sdtlpdtrp0(xN,X89))))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X89),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X89))
| ~ aElementOf0(X89,szNzAzT0) )
& ( ~ aElement0(X93)
| ~ aElementOf0(X93,sdtlpdtrp0(xN,X89))
| X93 = szmzizndt0(sdtlpdtrp0(xN,X89))
| aElementOf0(X93,sdtmndt0(sdtlpdtrp0(xN,X89),szmzizndt0(sdtlpdtrp0(xN,X89))))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X89),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X89))
| ~ aElementOf0(X89,szNzAzT0) )
& ( aSet0(sdtlpdtrp0(xN,szszuzczcdt0(X89)))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X89),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X89))
| ~ aElementOf0(X89,szNzAzT0) )
& ( ~ aElementOf0(X94,sdtlpdtrp0(xN,szszuzczcdt0(X89)))
| aElementOf0(X94,sdtmndt0(sdtlpdtrp0(xN,X89),szmzizndt0(sdtlpdtrp0(xN,X89))))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X89),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X89))
| ~ aElementOf0(X89,szNzAzT0) )
& ( aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X89)),sdtmndt0(sdtlpdtrp0(xN,X89),szmzizndt0(sdtlpdtrp0(xN,X89))))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X89),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X89))
| ~ aElementOf0(X89,szNzAzT0) )
& ( isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X89)))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X89),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X89))
| ~ aElementOf0(X89,szNzAzT0) ) ),
inference(distribute,[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)],[m__3623])])])])])]) ).
cnf(c_0_27,hypothesis,
( xj = sz00
| ~ sdtlseqdt0(szszuzczcdt0(esk23_1(xj)),sz00) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,hypothesis,
( szszuzczcdt0(esk23_1(xj)) = xj
| xj = sz00 ),
inference(spm,[status(thm)],[c_0_14,c_0_21]) ).
cnf(c_0_29,negated_conjecture,
sdtlseqdt0(xj,sz00),
inference(rw,[status(thm)],[c_0_12,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
aElementOf0(esk1_0,sdtlpdtrp0(xN,xi)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_31,hypothesis,
sdtlpdtrp0(xN,sz00) = xS,
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_32,negated_conjecture,
~ aElementOf0(esk1_0,sdtlpdtrp0(xN,xj)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_33,hypothesis,
xj = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_34,negated_conjecture,
aElementOf0(esk1_0,xS),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_25]),c_0_31]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_31]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13 % Problem : NUM574+3 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.11/0.34 % Computer : n006.cluster.edu
% 0.11/0.34 % Model : x86_64 x86_64
% 0.11/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.34 % Memory : 8042.1875MB
% 0.11/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.34 % CPULimit : 2400
% 0.11/0.34 % WCLimit : 300
% 0.11/0.34 % DateTime : Mon Oct 2 13:54:40 EDT 2023
% 0.11/0.34 % CPUTime :
% 0.16/0.45 Running first-order theorem proving
% 0.16/0.45 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/tmp/tmp.Sat4CaJlBv/E---3.1_31334.p
% 40.30/5.74 # Version: 3.1pre001
% 40.30/5.74 # Preprocessing class: FSLSSMSMSSSNFFN.
% 40.30/5.74 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 40.30/5.74 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 40.30/5.74 # Starting new_bool_3 with 300s (1) cores
% 40.30/5.74 # Starting new_bool_1 with 300s (1) cores
% 40.30/5.74 # Starting sh5l with 300s (1) cores
% 40.30/5.74 # sh5l with pid 31415 completed with status 0
% 40.30/5.74 # Result found by sh5l
% 40.30/5.74 # Preprocessing class: FSLSSMSMSSSNFFN.
% 40.30/5.74 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 40.30/5.74 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 40.30/5.74 # Starting new_bool_3 with 300s (1) cores
% 40.30/5.74 # Starting new_bool_1 with 300s (1) cores
% 40.30/5.74 # Starting sh5l with 300s (1) cores
% 40.30/5.74 # SinE strategy is gf500_gu_R04_F100_L20000
% 40.30/5.74 # Search class: FGHSF-SMLM32-MFFFFFNN
% 40.30/5.74 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 40.30/5.74 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 163s (1) cores
% 40.30/5.74 # G-E--_208_C18_F1_SE_CS_SP_PS_S2o with pid 31417 completed with status 0
% 40.30/5.74 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2o
% 40.30/5.74 # Preprocessing class: FSLSSMSMSSSNFFN.
% 40.30/5.74 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 40.30/5.74 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 40.30/5.74 # Starting new_bool_3 with 300s (1) cores
% 40.30/5.74 # Starting new_bool_1 with 300s (1) cores
% 40.30/5.74 # Starting sh5l with 300s (1) cores
% 40.30/5.74 # SinE strategy is gf500_gu_R04_F100_L20000
% 40.30/5.74 # Search class: FGHSF-SMLM32-MFFFFFNN
% 40.30/5.74 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 40.30/5.74 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 163s (1) cores
% 40.30/5.74 # Preprocessing time : 0.146 s
% 40.30/5.74 # Presaturation interreduction done
% 40.30/5.74
% 40.30/5.74 # Proof found!
% 40.30/5.74 # SZS status Theorem
% 40.30/5.74 # SZS output start CNFRefutation
% See solution above
% 40.30/5.74 # Parsed axioms : 86
% 40.30/5.74 # Removed by relevancy pruning/SinE : 3
% 40.30/5.74 # Initial clauses : 4178
% 40.30/5.74 # Removed in clause preprocessing : 7
% 40.30/5.74 # Initial clauses in saturation : 4171
% 40.30/5.74 # Processed clauses : 6229
% 40.30/5.74 # ...of these trivial : 1
% 40.30/5.74 # ...subsumed : 633
% 40.30/5.74 # ...remaining for further processing : 5595
% 40.30/5.74 # Other redundant clauses eliminated : 1932
% 40.30/5.74 # Clauses deleted for lack of memory : 0
% 40.30/5.74 # Backward-subsumed : 0
% 40.30/5.74 # Backward-rewritten : 39
% 40.30/5.74 # Generated clauses : 2374
% 40.30/5.74 # ...of the previous two non-redundant : 2318
% 40.30/5.74 # ...aggressively subsumed : 0
% 40.30/5.74 # Contextual simplify-reflections : 40
% 40.30/5.74 # Paramodulations : 635
% 40.30/5.74 # Factorizations : 0
% 40.30/5.74 # NegExts : 0
% 40.30/5.74 # Equation resolutions : 1933
% 40.30/5.74 # Total rewrite steps : 382
% 40.30/5.74 # Propositional unsat checks : 0
% 40.30/5.74 # Propositional check models : 0
% 40.30/5.74 # Propositional check unsatisfiable : 0
% 40.30/5.74 # Propositional clauses : 0
% 40.30/5.74 # Propositional clauses after purity: 0
% 40.30/5.74 # Propositional unsat core size : 0
% 40.30/5.74 # Propositional preprocessing time : 0.000
% 40.30/5.74 # Propositional encoding time : 0.000
% 40.30/5.74 # Propositional solver time : 0.000
% 40.30/5.74 # Success case prop preproc time : 0.000
% 40.30/5.74 # Success case prop encoding time : 0.000
% 40.30/5.74 # Success case prop solver time : 0.000
% 40.30/5.74 # Current number of processed clauses : 238
% 40.30/5.74 # Positive orientable unit clauses : 100
% 40.30/5.74 # Positive unorientable unit clauses: 0
% 40.30/5.74 # Negative unit clauses : 34
% 40.30/5.74 # Non-unit-clauses : 104
% 40.30/5.74 # Current number of unprocessed clauses: 3837
% 40.30/5.74 # ...number of literals in the above : 42441
% 40.30/5.74 # Current number of archived formulas : 0
% 40.30/5.74 # Current number of archived clauses : 3619
% 40.30/5.74 # Clause-clause subsumption calls (NU) : 6195851
% 40.30/5.74 # Rec. Clause-clause subsumption calls : 67567
% 40.30/5.74 # Non-unit clause-clause subsumptions : 650
% 40.30/5.74 # Unit Clause-clause subsumption calls : 1619
% 40.30/5.74 # Rewrite failures with RHS unbound : 0
% 40.30/5.74 # BW rewrite match attempts : 17
% 40.30/5.74 # BW rewrite match successes : 7
% 40.30/5.74 # Condensation attempts : 0
% 40.30/5.74 # Condensation successes : 0
% 40.30/5.74 # Termbank termtop insertions : 605415
% 40.30/5.74
% 40.30/5.74 # -------------------------------------------------
% 40.30/5.74 # User time : 5.234 s
% 40.30/5.74 # System time : 0.031 s
% 40.30/5.74 # Total time : 5.265 s
% 40.30/5.74 # Maximum resident set size: 13296 pages
% 40.30/5.74
% 40.30/5.74 # -------------------------------------------------
% 40.30/5.74 # User time : 5.237 s
% 40.30/5.74 # System time : 0.034 s
% 40.30/5.74 # Total time : 5.271 s
% 40.30/5.74 # Maximum resident set size: 1808 pages
% 40.30/5.74 % E---3.1 exiting
% 40.30/5.74 % E---3.1 exiting
%------------------------------------------------------------------------------