TSTP Solution File: NUM592+3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM592+3 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 01:14:53 EDT 2024
% Result : Theorem 96.03s 12.67s
% Output : CNFRefutation 96.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 30 ( 7 unt; 0 def)
% Number of atoms : 485 ( 67 equ)
% Maximal formula atoms : 304 ( 16 avg)
% Number of connectives : 647 ( 192 ~; 294 |; 131 &)
% ( 6 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 70 ( 8 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 9 con; 0-2 aty)
% Number of variables : 58 ( 0 sgn 35 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__4448_02,hypothesis,
( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X1) )
& aSet0(xY)
& ! [X1] :
( aElementOf0(X1,xY)
<=> ( aElement0(X1)
& aElementOf0(X1,sdtlpdtrp0(xN,xi))
& X1 != szmzizndt0(sdtlpdtrp0(xN,xi)) ) )
& xY = sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))
& xd = sdtlpdtrp0(xC,xi) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4448_02) ).
fof(m__4545,hypothesis,
( aElementOf0(xu,xT)
& aSet0(xX)
& ! [X1] :
( aElementOf0(X1,xX)
=> aElementOf0(X1,xY) )
& aSubsetOf0(xX,xY)
& isCountable0(xX)
& ! [X1] :
( ( aSet0(X1)
& ( ( ( ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xX) )
| aSubsetOf0(X1,xX) )
& sbrdtbr0(X1) = xk )
| aElementOf0(X1,slbdtsldtrb0(xX,xk)) ) )
=> sdtlpdtrp0(xd,X1) = xu ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4545) ).
fof(m__,conjecture,
? [X1] :
( aElementOf0(X1,xT)
& ? [X2] :
( ( ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,xi))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X3) ) )
=> ( ( aSet0(sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
& ! [X3] :
( aElementOf0(X3,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
<=> ( aElement0(X3)
& aElementOf0(X3,sdtlpdtrp0(xN,xi))
& X3 != szmzizndt0(sdtlpdtrp0(xN,xi)) ) ) )
=> ( ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) ) )
| aSubsetOf0(X2,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) ) ) )
& isCountable0(X2)
& ! [X3] :
( ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
=> aElementOf0(X4,X2) )
& aSubsetOf0(X3,X2)
& sbrdtbr0(X3) = xk
& aElementOf0(X3,slbdtsldtrb0(X2,xk)) )
=> sdtlpdtrp0(sdtlpdtrp0(xC,xi),X3) = X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(c_0_3,plain,
! [X1] :
( epred4_1(X1)
<=> ? [X2] :
( ( ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,xi))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X3) ) )
=> ( ( aSet0(sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
& ! [X3] :
( aElementOf0(X3,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
<=> ( aElement0(X3)
& aElementOf0(X3,sdtlpdtrp0(xN,xi))
& X3 != szmzizndt0(sdtlpdtrp0(xN,xi)) ) ) )
=> ( ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) ) )
| aSubsetOf0(X2,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) ) ) )
& isCountable0(X2)
& ! [X3] :
( ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
=> aElementOf0(X4,X2) )
& aSubsetOf0(X3,X2)
& sbrdtbr0(X3) = xk
& aElementOf0(X3,slbdtsldtrb0(X2,xk)) )
=> sdtlpdtrp0(sdtlpdtrp0(xC,xi),X3) = X1 ) ) ),
introduced(definition) ).
fof(c_0_4,plain,
! [X1] :
( ? [X2] :
( ( ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,xi))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X3) ) )
=> ( ( aSet0(sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
& ! [X3] :
( aElementOf0(X3,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
<=> ( aElement0(X3)
& aElementOf0(X3,sdtlpdtrp0(xN,xi))
& X3 != szmzizndt0(sdtlpdtrp0(xN,xi)) ) ) )
=> ( ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) ) )
| aSubsetOf0(X2,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) ) ) )
& isCountable0(X2)
& ! [X3] :
( ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
=> aElementOf0(X4,X2) )
& aSubsetOf0(X3,X2)
& sbrdtbr0(X3) = xk
& aElementOf0(X3,slbdtsldtrb0(X2,xk)) )
=> sdtlpdtrp0(sdtlpdtrp0(xC,xi),X3) = X1 ) )
=> epred4_1(X1) ),
inference(split_equiv,[status(thm)],[c_0_3]) ).
fof(c_0_5,hypothesis,
( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X1) )
& aSet0(xY)
& ! [X1] :
( aElementOf0(X1,xY)
<=> ( aElement0(X1)
& aElementOf0(X1,sdtlpdtrp0(xN,xi))
& X1 != szmzizndt0(sdtlpdtrp0(xN,xi)) ) )
& xY = sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))
& xd = sdtlpdtrp0(xC,xi) ),
inference(fof_simplification,[status(thm)],[m__4448_02]) ).
fof(c_0_6,plain,
! [X284,X285,X286,X287,X288,X291] :
( ( aSet0(esk43_2(X284,X285))
| aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( ~ aElementOf0(X291,esk43_2(X284,X285))
| aElementOf0(X291,X285)
| aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( aSubsetOf0(esk43_2(X284,X285),X285)
| aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( sbrdtbr0(esk43_2(X284,X285)) = xk
| aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( aElementOf0(esk43_2(X284,X285),slbdtsldtrb0(X285,xk))
| aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( sdtlpdtrp0(sdtlpdtrp0(xC,xi),esk43_2(X284,X285)) != X284
| aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( aSet0(esk43_2(X284,X285))
| ~ aElementOf0(X286,sdtlpdtrp0(xN,xi))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X286)
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( ~ aElementOf0(X291,esk43_2(X284,X285))
| aElementOf0(X291,X285)
| ~ aElementOf0(X286,sdtlpdtrp0(xN,xi))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X286)
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( aSubsetOf0(esk43_2(X284,X285),X285)
| ~ aElementOf0(X286,sdtlpdtrp0(xN,xi))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X286)
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( sbrdtbr0(esk43_2(X284,X285)) = xk
| ~ aElementOf0(X286,sdtlpdtrp0(xN,xi))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X286)
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( aElementOf0(esk43_2(X284,X285),slbdtsldtrb0(X285,xk))
| ~ aElementOf0(X286,sdtlpdtrp0(xN,xi))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X286)
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( sdtlpdtrp0(sdtlpdtrp0(xC,xi),esk43_2(X284,X285)) != X284
| ~ aElementOf0(X286,sdtlpdtrp0(xN,xi))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X286)
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( aSet0(esk43_2(X284,X285))
| aSet0(sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( ~ aElementOf0(X291,esk43_2(X284,X285))
| aElementOf0(X291,X285)
| aSet0(sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( aSubsetOf0(esk43_2(X284,X285),X285)
| aSet0(sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( sbrdtbr0(esk43_2(X284,X285)) = xk
| aSet0(sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( aElementOf0(esk43_2(X284,X285),slbdtsldtrb0(X285,xk))
| aSet0(sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( sdtlpdtrp0(sdtlpdtrp0(xC,xi),esk43_2(X284,X285)) != X284
| aSet0(sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( aSet0(esk43_2(X284,X285))
| aElement0(X287)
| ~ aElementOf0(X287,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( ~ aElementOf0(X291,esk43_2(X284,X285))
| aElementOf0(X291,X285)
| aElement0(X287)
| ~ aElementOf0(X287,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( aSubsetOf0(esk43_2(X284,X285),X285)
| aElement0(X287)
| ~ aElementOf0(X287,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( sbrdtbr0(esk43_2(X284,X285)) = xk
| aElement0(X287)
| ~ aElementOf0(X287,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( aElementOf0(esk43_2(X284,X285),slbdtsldtrb0(X285,xk))
| aElement0(X287)
| ~ aElementOf0(X287,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( sdtlpdtrp0(sdtlpdtrp0(xC,xi),esk43_2(X284,X285)) != X284
| aElement0(X287)
| ~ aElementOf0(X287,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( aSet0(esk43_2(X284,X285))
| aElementOf0(X287,sdtlpdtrp0(xN,xi))
| ~ aElementOf0(X287,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( ~ aElementOf0(X291,esk43_2(X284,X285))
| aElementOf0(X291,X285)
| aElementOf0(X287,sdtlpdtrp0(xN,xi))
| ~ aElementOf0(X287,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( aSubsetOf0(esk43_2(X284,X285),X285)
| aElementOf0(X287,sdtlpdtrp0(xN,xi))
| ~ aElementOf0(X287,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( sbrdtbr0(esk43_2(X284,X285)) = xk
| aElementOf0(X287,sdtlpdtrp0(xN,xi))
| ~ aElementOf0(X287,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( aElementOf0(esk43_2(X284,X285),slbdtsldtrb0(X285,xk))
| aElementOf0(X287,sdtlpdtrp0(xN,xi))
| ~ aElementOf0(X287,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( sdtlpdtrp0(sdtlpdtrp0(xC,xi),esk43_2(X284,X285)) != X284
| aElementOf0(X287,sdtlpdtrp0(xN,xi))
| ~ aElementOf0(X287,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( aSet0(esk43_2(X284,X285))
| X287 != szmzizndt0(sdtlpdtrp0(xN,xi))
| ~ aElementOf0(X287,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( ~ aElementOf0(X291,esk43_2(X284,X285))
| aElementOf0(X291,X285)
| X287 != szmzizndt0(sdtlpdtrp0(xN,xi))
| ~ aElementOf0(X287,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( aSubsetOf0(esk43_2(X284,X285),X285)
| X287 != szmzizndt0(sdtlpdtrp0(xN,xi))
| ~ aElementOf0(X287,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( sbrdtbr0(esk43_2(X284,X285)) = xk
| X287 != szmzizndt0(sdtlpdtrp0(xN,xi))
| ~ aElementOf0(X287,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( aElementOf0(esk43_2(X284,X285),slbdtsldtrb0(X285,xk))
| X287 != szmzizndt0(sdtlpdtrp0(xN,xi))
| ~ aElementOf0(X287,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( sdtlpdtrp0(sdtlpdtrp0(xC,xi),esk43_2(X284,X285)) != X284
| X287 != szmzizndt0(sdtlpdtrp0(xN,xi))
| ~ aElementOf0(X287,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( aSet0(esk43_2(X284,X285))
| ~ aElement0(X288)
| ~ aElementOf0(X288,sdtlpdtrp0(xN,xi))
| X288 = szmzizndt0(sdtlpdtrp0(xN,xi))
| aElementOf0(X288,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( ~ aElementOf0(X291,esk43_2(X284,X285))
| aElementOf0(X291,X285)
| ~ aElement0(X288)
| ~ aElementOf0(X288,sdtlpdtrp0(xN,xi))
| X288 = szmzizndt0(sdtlpdtrp0(xN,xi))
| aElementOf0(X288,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( aSubsetOf0(esk43_2(X284,X285),X285)
| ~ aElement0(X288)
| ~ aElementOf0(X288,sdtlpdtrp0(xN,xi))
| X288 = szmzizndt0(sdtlpdtrp0(xN,xi))
| aElementOf0(X288,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( sbrdtbr0(esk43_2(X284,X285)) = xk
| ~ aElement0(X288)
| ~ aElementOf0(X288,sdtlpdtrp0(xN,xi))
| X288 = szmzizndt0(sdtlpdtrp0(xN,xi))
| aElementOf0(X288,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( aElementOf0(esk43_2(X284,X285),slbdtsldtrb0(X285,xk))
| ~ aElement0(X288)
| ~ aElementOf0(X288,sdtlpdtrp0(xN,xi))
| X288 = szmzizndt0(sdtlpdtrp0(xN,xi))
| aElementOf0(X288,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( sdtlpdtrp0(sdtlpdtrp0(xC,xi),esk43_2(X284,X285)) != X284
| ~ aElement0(X288)
| ~ aElementOf0(X288,sdtlpdtrp0(xN,xi))
| X288 = szmzizndt0(sdtlpdtrp0(xN,xi))
| aElementOf0(X288,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( aSet0(esk43_2(X284,X285))
| aElementOf0(esk42_2(X284,X285),X285)
| ~ aSet0(X285)
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( ~ aElementOf0(X291,esk43_2(X284,X285))
| aElementOf0(X291,X285)
| aElementOf0(esk42_2(X284,X285),X285)
| ~ aSet0(X285)
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( aSubsetOf0(esk43_2(X284,X285),X285)
| aElementOf0(esk42_2(X284,X285),X285)
| ~ aSet0(X285)
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( sbrdtbr0(esk43_2(X284,X285)) = xk
| aElementOf0(esk42_2(X284,X285),X285)
| ~ aSet0(X285)
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( aElementOf0(esk43_2(X284,X285),slbdtsldtrb0(X285,xk))
| aElementOf0(esk42_2(X284,X285),X285)
| ~ aSet0(X285)
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( sdtlpdtrp0(sdtlpdtrp0(xC,xi),esk43_2(X284,X285)) != X284
| aElementOf0(esk42_2(X284,X285),X285)
| ~ aSet0(X285)
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( aSet0(esk43_2(X284,X285))
| ~ aElementOf0(esk42_2(X284,X285),sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ aSet0(X285)
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( ~ aElementOf0(X291,esk43_2(X284,X285))
| aElementOf0(X291,X285)
| ~ aElementOf0(esk42_2(X284,X285),sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ aSet0(X285)
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( aSubsetOf0(esk43_2(X284,X285),X285)
| ~ aElementOf0(esk42_2(X284,X285),sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ aSet0(X285)
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( sbrdtbr0(esk43_2(X284,X285)) = xk
| ~ aElementOf0(esk42_2(X284,X285),sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ aSet0(X285)
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( aElementOf0(esk43_2(X284,X285),slbdtsldtrb0(X285,xk))
| ~ aElementOf0(esk42_2(X284,X285),sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ aSet0(X285)
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( sdtlpdtrp0(sdtlpdtrp0(xC,xi),esk43_2(X284,X285)) != X284
| ~ aElementOf0(esk42_2(X284,X285),sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ aSet0(X285)
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( aSet0(esk43_2(X284,X285))
| ~ aSubsetOf0(X285,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( ~ aElementOf0(X291,esk43_2(X284,X285))
| aElementOf0(X291,X285)
| ~ aSubsetOf0(X285,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( aSubsetOf0(esk43_2(X284,X285),X285)
| ~ aSubsetOf0(X285,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( sbrdtbr0(esk43_2(X284,X285)) = xk
| ~ aSubsetOf0(X285,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( aElementOf0(esk43_2(X284,X285),slbdtsldtrb0(X285,xk))
| ~ aSubsetOf0(X285,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X285)
| epred4_1(X284) )
& ( sdtlpdtrp0(sdtlpdtrp0(xC,xi),esk43_2(X284,X285)) != X284
| ~ aSubsetOf0(X285,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X285)
| epred4_1(X284) ) ),
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_4])])])])])])]) ).
fof(c_0_7,hypothesis,
! [X230,X231] :
( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& ( ~ aElementOf0(X230,sdtlpdtrp0(xN,xi))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X230) )
& aSet0(xY)
& ( aElement0(X231)
| ~ aElementOf0(X231,xY) )
& ( aElementOf0(X231,sdtlpdtrp0(xN,xi))
| ~ aElementOf0(X231,xY) )
& ( X231 != szmzizndt0(sdtlpdtrp0(xN,xi))
| ~ aElementOf0(X231,xY) )
& ( ~ aElement0(X231)
| ~ aElementOf0(X231,sdtlpdtrp0(xN,xi))
| X231 = szmzizndt0(sdtlpdtrp0(xN,xi))
| aElementOf0(X231,xY) )
& xY = sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))
& xd = sdtlpdtrp0(xC,xi) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])]) ).
cnf(c_0_8,plain,
( aElementOf0(esk43_2(X1,X2),slbdtsldtrb0(X2,xk))
| epred4_1(X1)
| ~ aSubsetOf0(X2,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,hypothesis,
xY = sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,hypothesis,
! [X242,X243] :
( aElementOf0(xu,xT)
& aSet0(xX)
& ( ~ aElementOf0(X242,xX)
| aElementOf0(X242,xY) )
& aSubsetOf0(xX,xY)
& isCountable0(xX)
& ( aElementOf0(esk36_1(X243),X243)
| sbrdtbr0(X243) != xk
| ~ aSet0(X243)
| sdtlpdtrp0(xd,X243) = xu )
& ( ~ aElementOf0(esk36_1(X243),xX)
| sbrdtbr0(X243) != xk
| ~ aSet0(X243)
| sdtlpdtrp0(xd,X243) = xu )
& ( ~ aSubsetOf0(X243,xX)
| sbrdtbr0(X243) != xk
| ~ aSet0(X243)
| sdtlpdtrp0(xd,X243) = xu )
& ( ~ aElementOf0(X243,slbdtsldtrb0(xX,xk))
| ~ aSet0(X243)
| sdtlpdtrp0(xd,X243) = xu ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4545])])])])])]) ).
cnf(c_0_11,plain,
( aSet0(esk43_2(X1,X2))
| epred4_1(X1)
| ~ aSubsetOf0(X2,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_12,negated_conjecture,
~ ? [X1] :
( aElementOf0(X1,xT)
& epred4_1(X1) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]),c_0_3]) ).
cnf(c_0_13,plain,
( epred4_1(X1)
| sdtlpdtrp0(sdtlpdtrp0(xC,xi),esk43_2(X1,X2)) != X1
| ~ aSubsetOf0(X2,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,hypothesis,
xd = sdtlpdtrp0(xC,xi),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,plain,
( epred4_1(X1)
| aElementOf0(esk43_2(X1,X2),slbdtsldtrb0(X2,xk))
| ~ aSubsetOf0(X2,xY)
| ~ isCountable0(X2) ),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_16,hypothesis,
aSubsetOf0(xX,xY),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,hypothesis,
isCountable0(xX),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
( epred4_1(X1)
| aSet0(esk43_2(X1,X2))
| ~ aSubsetOf0(X2,xY)
| ~ isCountable0(X2) ),
inference(rw,[status(thm)],[c_0_11,c_0_9]) ).
fof(c_0_19,negated_conjecture,
! [X245] :
( ~ aElementOf0(X245,xT)
| ~ epred4_1(X245) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
cnf(c_0_20,plain,
( epred4_1(X1)
| sdtlpdtrp0(xd,esk43_2(X1,X2)) != X1
| ~ aSubsetOf0(X2,xY)
| ~ isCountable0(X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_9]) ).
cnf(c_0_21,hypothesis,
( sdtlpdtrp0(xd,X1) = xu
| ~ aElementOf0(X1,slbdtsldtrb0(xX,xk))
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_22,hypothesis,
( epred4_1(X1)
| aElementOf0(esk43_2(X1,xX),slbdtsldtrb0(xX,xk)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_23,hypothesis,
( epred4_1(X1)
| aSet0(esk43_2(X1,xX)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_16]),c_0_17])]) ).
cnf(c_0_24,negated_conjecture,
( ~ aElementOf0(X1,xT)
| ~ epred4_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,hypothesis,
aElementOf0(xu,xT),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_26,hypothesis,
( epred4_1(X1)
| sdtlpdtrp0(xd,esk43_2(X1,xX)) != X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_16]),c_0_17])]) ).
cnf(c_0_27,hypothesis,
( sdtlpdtrp0(xd,esk43_2(X1,xX)) = xu
| epred4_1(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_28,hypothesis,
~ epred4_1(xu),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,hypothesis,
$false,
inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27])]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : NUM592+3 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n010.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon May 20 04:19:23 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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
% 96.03/12.67 # Version: 3.1.0
% 96.03/12.67 # Preprocessing class: FSLSSMSMSSSNFFN.
% 96.03/12.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 96.03/12.67 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 96.03/12.67 # Starting new_bool_3 with 300s (1) cores
% 96.03/12.67 # Starting new_bool_1 with 300s (1) cores
% 96.03/12.67 # Starting sh5l with 300s (1) cores
% 96.03/12.67 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 19647 completed with status 0
% 96.03/12.67 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 96.03/12.67 # Preprocessing class: FSLSSMSMSSSNFFN.
% 96.03/12.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 96.03/12.67 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 96.03/12.67 # No SInE strategy applied
% 96.03/12.67 # Search class: FGHSF-SMLM32-MFFFFFNN
% 96.03/12.67 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 96.03/12.67 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 811s (1) cores
% 96.03/12.67 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 96.03/12.67 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 96.03/12.67 # Starting new_bool_3 with 136s (1) cores
% 96.03/12.67 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 96.03/12.67 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 19655 completed with status 0
% 96.03/12.67 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 96.03/12.67 # Preprocessing class: FSLSSMSMSSSNFFN.
% 96.03/12.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 96.03/12.67 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 96.03/12.67 # No SInE strategy applied
% 96.03/12.67 # Search class: FGHSF-SMLM32-MFFFFFNN
% 96.03/12.67 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 96.03/12.67 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 811s (1) cores
% 96.03/12.67 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 96.03/12.67 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 96.03/12.67 # Preprocessing time : 0.155 s
% 96.03/12.67 # Presaturation interreduction done
% 96.03/12.67
% 96.03/12.67 # Proof found!
% 96.03/12.67 # SZS status Theorem
% 96.03/12.67 # SZS output start CNFRefutation
% See solution above
% 96.03/12.67 # Parsed axioms : 94
% 96.03/12.67 # Removed by relevancy pruning/SinE : 0
% 96.03/12.67 # Initial clauses : 4907
% 96.03/12.67 # Removed in clause preprocessing : 7
% 96.03/12.67 # Initial clauses in saturation : 4900
% 96.03/12.67 # Processed clauses : 20880
% 96.03/12.67 # ...of these trivial : 410
% 96.03/12.67 # ...subsumed : 5847
% 96.03/12.67 # ...remaining for further processing : 14623
% 96.03/12.67 # Other redundant clauses eliminated : 2046
% 96.03/12.67 # Clauses deleted for lack of memory : 0
% 96.03/12.67 # Backward-subsumed : 206
% 96.03/12.67 # Backward-rewritten : 265
% 96.03/12.67 # Generated clauses : 106243
% 96.03/12.67 # ...of the previous two non-redundant : 100953
% 96.03/12.67 # ...aggressively subsumed : 0
% 96.03/12.67 # Contextual simplify-reflections : 461
% 96.03/12.67 # Paramodulations : 104388
% 96.03/12.67 # Factorizations : 6
% 96.03/12.67 # NegExts : 0
% 96.03/12.67 # Equation resolutions : 2049
% 96.03/12.67 # Disequality decompositions : 0
% 96.03/12.67 # Total rewrite steps : 68645
% 96.03/12.67 # ...of those cached : 67394
% 96.03/12.67 # Propositional unsat checks : 3
% 96.03/12.67 # Propositional check models : 2
% 96.03/12.67 # Propositional check unsatisfiable : 0
% 96.03/12.67 # Propositional clauses : 0
% 96.03/12.67 # Propositional clauses after purity: 0
% 96.03/12.67 # Propositional unsat core size : 0
% 96.03/12.67 # Propositional preprocessing time : 0.000
% 96.03/12.67 # Propositional encoding time : 0.093
% 96.03/12.67 # Propositional solver time : 0.052
% 96.03/12.67 # Success case prop preproc time : 0.000
% 96.03/12.67 # Success case prop encoding time : 0.000
% 96.03/12.67 # Success case prop solver time : 0.000
% 96.03/12.67 # Current number of processed clauses : 8348
% 96.03/12.67 # Positive orientable unit clauses : 1924
% 96.03/12.67 # Positive unorientable unit clauses: 0
% 96.03/12.67 # Negative unit clauses : 103
% 96.03/12.67 # Non-unit-clauses : 6321
% 96.03/12.67 # Current number of unprocessed clauses: 88007
% 96.03/12.67 # ...number of literals in the above : 449737
% 96.03/12.67 # Current number of archived formulas : 0
% 96.03/12.67 # Current number of archived clauses : 4432
% 96.03/12.67 # Clause-clause subsumption calls (NU) : 20997252
% 96.03/12.67 # Rec. Clause-clause subsumption calls : 2055502
% 96.03/12.67 # Non-unit clause-clause subsumptions : 5656
% 96.03/12.67 # Unit Clause-clause subsumption calls : 490835
% 96.03/12.67 # Rewrite failures with RHS unbound : 0
% 96.03/12.67 # BW rewrite match attempts : 15144
% 96.03/12.67 # BW rewrite match successes : 106
% 96.03/12.67 # Condensation attempts : 0
% 96.03/12.67 # Condensation successes : 0
% 96.03/12.67 # Termbank termtop insertions : 3841473
% 96.03/12.67 # Search garbage collected termcells : 32050
% 96.03/12.67
% 96.03/12.67 # -------------------------------------------------
% 96.03/12.67 # User time : 12.084 s
% 96.03/12.67 # System time : 0.095 s
% 96.03/12.67 # Total time : 12.179 s
% 96.03/12.67 # Maximum resident set size: 14368 pages
% 96.03/12.67
% 96.03/12.67 # -------------------------------------------------
% 96.03/12.67 # User time : 59.471 s
% 96.03/12.67 # System time : 0.354 s
% 96.03/12.67 # Total time : 59.826 s
% 96.03/12.67 # Maximum resident set size: 1884 pages
% 96.03/12.67 % E---3.1 exiting
% 96.03/12.67 % E exiting
%------------------------------------------------------------------------------