%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWV472+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n019.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 : Tue Sep 29 01:15:54 PM UTC 2026
% Result : Theorem 3.57s 1.20s
% Output : Refutation 4.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 32
% Syntax : Number of formulae : 186 ( 47 unt; 28 def)
% Number of atoms : 1011 ( 340 equ)
% Maximal formula atoms : 70 ( 5 avg)
% Number of connectives : 1394 ( 569 ~; 480 |; 260 &)
% ( 22 <=>; 63 =>; 0 <=; 0 <~>)
% Maximal formula depth : 38 ( 6 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 33 ( 31 usr; 13 prp; 0-2 aty)
% Number of functors : 32 ( 32 usr; 20 con; 0-2 aty)
% Number of variables : 405 ( 0 sgn 378 !; 27 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f18,axiom,
! [X0,X1] : m_Down(X0) != m_Halt(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_17) ).
fof(f47,axiom,
! [X0,X1,X2] :
( elem(X0,cons(X1,X2))
<=> ( X0 = X1
| elem(X0,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_46) ).
fof(f48,axiom,
! [X0,X1,X2] :
( elem(X0,snoc(X2,X1))
<=> ( X0 = X1
| elem(X0,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_47) ).
fof(f67,conjecture,
! [X0,X1,X2,X3] :
( ( ! [X4,X5] :
( elem(m_Ldr(X5),queue(host(X4)))
=> ~ leq(host(X4),host(X5)) )
& ! [X4,X5] :
( elem(m_Down(X5),queue(host(X4)))
=> host(X5) != host(X4) )
& ! [X4,X5] :
( host(X5) = nbr_proc
=> ~ elem(m_NotNorm(X4),queue(host(X5))) )
& ! [X4,X5] :
( ( X5 != X4
& host(X5) = host(X4) )
=> ( ~ setIn(X4,alive)
| ~ setIn(X5,alive) ) )
& ! [X4] :
( ( ( index(status,host(X4)) = elec_1
| index(status,host(X4)) = elec_2 )
& setIn(X4,alive) )
=> index(elid,host(X4)) = X4 )
& ! [X4,X6,X5] :
( ( host(X5) != host(X6)
& setIn(X5,alive)
& host(X5) = host(X4)
& index(status,host(X5)) = norm
& index(ldr,host(X5)) = host(X6) )
=> ~ elem(m_Down(X4),queue(host(X6))) )
& ! [X4,X6,X5] :
( ( host(X5) != host(X6)
& setIn(X5,alive)
& host(X5) = host(X4)
& index(status,host(X5)) = wait
& host(index(elid,host(X5))) = host(X6) )
=> ~ elem(m_Down(X4),queue(host(X6))) )
& ! [X4,X7,X6,X5] :
( ( host(X6) != host(X4)
& setIn(X4,alive)
& setIn(X6,alive)
& host(X7) = host(X4)
& host(X5) = host(X6) )
=> ~ ( elem(m_Down(X5),queue(host(X4)))
& elem(m_Down(X7),queue(host(X6))) ) )
& ! [X4,X7,X6,X5] :
( ( host(X6) != host(X4)
& setIn(X4,alive)
& setIn(X6,alive)
& host(X7) = host(X4)
& host(X5) = host(X6) )
=> ~ ( elem(m_Down(X5),queue(host(X4)))
& setIn(host(X7),index(down,host(X6))) ) )
& ! [X4,X7,X6,X5] :
( ( ! [X8] :
( ( ~ leq(host(X5),X8)
& leq(s(zero),X8) )
=> ( setIn(X8,index(down,host(X5)))
| X8 = host(X6) ) )
& elem(m_Down(X6),queue(host(X5)))
& host(X5) = nbr_proc
& host(X5) = host(X7)
& index(status,host(X5)) = elec_1 )
=> ~ ( setIn(X4,alive)
& elem(m_Down(X7),queue(host(X4))) ) )
& queue(host(X2)) = cons(m_Ack(X1,X3),X0) )
=> ( setIn(X2,alive)
=> ( ( index(elid,host(X2)) = X1
& index(status,host(X2)) = elec_2
& host(X3) = index(pendack,host(X2)) )
=> ( ~ leq(nbr_proc,index(pendack,host(X2)))
=> ! [X4] :
( s(index(pendack,host(X2))) = host(X4)
=> ( host(X2) = host(X4)
=> ! [X9,X10,X11] :
( s(index(pendack,host(X2))) != host(X11)
=> ( host(X2) != host(X11)
=> ( ( ! [X8] :
( ( ~ leq(host(X11),X8)
& leq(s(zero),X8) )
=> ( setIn(X8,index(down,host(X11)))
| X8 = host(X10) ) )
& elem(m_Down(X10),queue(host(X11)))
& host(X11) = host(X9)
& host(X11) = nbr_proc
& index(status,host(X11)) = elec_1 )
=> ~ ( setIn(X4,alive)
& elem(m_Down(X9),snoc(X0,m_Halt(X2))) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
fof(f68,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( ! [X4,X5] :
( elem(m_Ldr(X5),queue(host(X4)))
=> ~ leq(host(X4),host(X5)) )
& ! [X4,X5] :
( elem(m_Down(X5),queue(host(X4)))
=> host(X5) != host(X4) )
& ! [X4,X5] :
( host(X5) = nbr_proc
=> ~ elem(m_NotNorm(X4),queue(host(X5))) )
& ! [X4,X5] :
( ( X5 != X4
& host(X5) = host(X4) )
=> ( ~ setIn(X4,alive)
| ~ setIn(X5,alive) ) )
& ! [X4] :
( ( ( index(status,host(X4)) = elec_1
| index(status,host(X4)) = elec_2 )
& setIn(X4,alive) )
=> index(elid,host(X4)) = X4 )
& ! [X4,X6,X5] :
( ( host(X5) != host(X6)
& setIn(X5,alive)
& host(X5) = host(X4)
& index(status,host(X5)) = norm
& index(ldr,host(X5)) = host(X6) )
=> ~ elem(m_Down(X4),queue(host(X6))) )
& ! [X4,X6,X5] :
( ( host(X5) != host(X6)
& setIn(X5,alive)
& host(X5) = host(X4)
& index(status,host(X5)) = wait
& host(index(elid,host(X5))) = host(X6) )
=> ~ elem(m_Down(X4),queue(host(X6))) )
& ! [X4,X7,X6,X5] :
( ( host(X6) != host(X4)
& setIn(X4,alive)
& setIn(X6,alive)
& host(X7) = host(X4)
& host(X5) = host(X6) )
=> ~ ( elem(m_Down(X5),queue(host(X4)))
& elem(m_Down(X7),queue(host(X6))) ) )
& ! [X4,X7,X6,X5] :
( ( host(X6) != host(X4)
& setIn(X4,alive)
& setIn(X6,alive)
& host(X7) = host(X4)
& host(X5) = host(X6) )
=> ~ ( elem(m_Down(X5),queue(host(X4)))
& setIn(host(X7),index(down,host(X6))) ) )
& ! [X4,X7,X6,X5] :
( ( ! [X8] :
( ( ~ leq(host(X5),X8)
& leq(s(zero),X8) )
=> ( setIn(X8,index(down,host(X5)))
| X8 = host(X6) ) )
& elem(m_Down(X6),queue(host(X5)))
& host(X5) = nbr_proc
& host(X5) = host(X7)
& index(status,host(X5)) = elec_1 )
=> ~ ( setIn(X4,alive)
& elem(m_Down(X7),queue(host(X4))) ) )
& queue(host(X2)) = cons(m_Ack(X1,X3),X0) )
=> ( setIn(X2,alive)
=> ( ( index(elid,host(X2)) = X1
& index(status,host(X2)) = elec_2
& host(X3) = index(pendack,host(X2)) )
=> ( ~ leq(nbr_proc,index(pendack,host(X2)))
=> ! [X4] :
( s(index(pendack,host(X2))) = host(X4)
=> ( host(X2) = host(X4)
=> ! [X9,X10,X11] :
( s(index(pendack,host(X2))) != host(X11)
=> ( host(X2) != host(X11)
=> ( ( ! [X8] :
( ( ~ leq(host(X11),X8)
& leq(s(zero),X8) )
=> ( setIn(X8,index(down,host(X11)))
| X8 = host(X10) ) )
& elem(m_Down(X10),queue(host(X11)))
& host(X11) = host(X9)
& host(X11) = nbr_proc
& index(status,host(X11)) = elec_1 )
=> ~ ( setIn(X4,alive)
& elem(m_Down(X9),snoc(X0,m_Halt(X2))) ) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f67]) ).
fof(f69,plain,
~ ! [X0,X1,X2,X3] :
( ( ! [X4,X5] :
( elem(m_Ldr(X5),queue(host(X4)))
=> ~ leq(host(X4),host(X5)) )
& ! [X6,X7] :
( elem(m_Down(X7),queue(host(X6)))
=> host(X6) != host(X7) )
& ! [X8,X9] :
( nbr_proc = host(X9)
=> ~ elem(m_NotNorm(X8),queue(host(X9))) )
& ! [X10,X11] :
( ( X10 != X11
& host(X11) = host(X10) )
=> ( ~ setIn(X10,alive)
| ~ setIn(X11,alive) ) )
& ! [X12] :
( ( ( elec_1 = index(status,host(X12))
| elec_2 = index(status,host(X12)) )
& setIn(X12,alive) )
=> index(elid,host(X12)) = X12 )
& ! [X13,X14,X15] :
( ( host(X15) != host(X14)
& setIn(X15,alive)
& host(X15) = host(X13)
& norm = index(status,host(X15))
& host(X14) = index(ldr,host(X15)) )
=> ~ elem(m_Down(X13),queue(host(X14))) )
& ! [X16,X17,X18] :
( ( host(X18) != host(X17)
& setIn(X18,alive)
& host(X18) = host(X16)
& wait = index(status,host(X18))
& host(X17) = host(index(elid,host(X18))) )
=> ~ elem(m_Down(X16),queue(host(X17))) )
& ! [X19,X20,X21,X22] :
( ( host(X19) != host(X21)
& setIn(X19,alive)
& setIn(X21,alive)
& host(X19) = host(X20)
& host(X21) = host(X22) )
=> ~ ( elem(m_Down(X22),queue(host(X19)))
& elem(m_Down(X20),queue(host(X21))) ) )
& ! [X23,X24,X25,X26] :
( ( host(X23) != host(X25)
& setIn(X23,alive)
& setIn(X25,alive)
& host(X23) = host(X24)
& host(X25) = host(X26) )
=> ~ ( elem(m_Down(X26),queue(host(X23)))
& setIn(host(X24),index(down,host(X25))) ) )
& ! [X27,X28,X29,X30] :
( ( ! [X31] :
( ( ~ leq(host(X30),X31)
& leq(s(zero),X31) )
=> ( setIn(X31,index(down,host(X30)))
| host(X29) = X31 ) )
& elem(m_Down(X29),queue(host(X30)))
& nbr_proc = host(X30)
& host(X30) = host(X28)
& elec_1 = index(status,host(X30)) )
=> ~ ( setIn(X27,alive)
& elem(m_Down(X28),queue(host(X27))) ) )
& queue(host(X2)) = cons(m_Ack(X1,X3),X0) )
=> ( setIn(X2,alive)
=> ( ( index(elid,host(X2)) = X1
& index(status,host(X2)) = elec_2
& host(X3) = index(pendack,host(X2)) )
=> ( ~ leq(nbr_proc,index(pendack,host(X2)))
=> ! [X32] :
( s(index(pendack,host(X2))) = host(X32)
=> ( host(X2) = host(X32)
=> ! [X33,X34,X35] :
( s(index(pendack,host(X2))) != host(X35)
=> ( host(X2) != host(X35)
=> ( ( ! [X36] :
( ( ~ leq(host(X35),X36)
& leq(s(zero),X36) )
=> ( setIn(X36,index(down,host(X35)))
| host(X34) = X36 ) )
& elem(m_Down(X34),queue(host(X35)))
& host(X35) = host(X33)
& nbr_proc = host(X35)
& elec_1 = index(status,host(X35)) )
=> ~ ( setIn(X32,alive)
& elem(m_Down(X33),snoc(X0,m_Halt(X2))) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f68]) ).
fof(f70,plain,
? [X0,X1,X2,X3] :
( ? [X32] :
( ? [X33,X34,X35] :
( setIn(X32,alive)
& elem(m_Down(X33),snoc(X0,m_Halt(X2)))
& ! [X36] :
( setIn(X36,index(down,host(X35)))
| host(X34) = X36
| leq(host(X35),X36)
| ~ leq(s(zero),X36) )
& elem(m_Down(X34),queue(host(X35)))
& host(X35) = host(X33)
& nbr_proc = host(X35)
& elec_1 = index(status,host(X35))
& host(X2) != host(X35)
& s(index(pendack,host(X2))) != host(X35) )
& host(X2) = host(X32)
& s(index(pendack,host(X2))) = host(X32) )
& ~ leq(nbr_proc,index(pendack,host(X2)))
& index(elid,host(X2)) = X1
& index(status,host(X2)) = elec_2
& host(X3) = index(pendack,host(X2))
& setIn(X2,alive)
& ! [X4,X5] :
( ~ leq(host(X4),host(X5))
| ~ elem(m_Ldr(X5),queue(host(X4))) )
& ! [X6,X7] :
( host(X6) != host(X7)
| ~ elem(m_Down(X7),queue(host(X6))) )
& ! [X8,X9] :
( ~ elem(m_NotNorm(X8),queue(host(X9)))
| nbr_proc != host(X9) )
& ! [X10,X11] :
( ~ setIn(X10,alive)
| ~ setIn(X11,alive)
| X10 = X11
| host(X11) != host(X10) )
& ! [X12] :
( index(elid,host(X12)) = X12
| ( elec_1 != index(status,host(X12))
& elec_2 != index(status,host(X12)) )
| ~ setIn(X12,alive) )
& ! [X13,X14,X15] :
( ~ elem(m_Down(X13),queue(host(X14)))
| host(X15) = host(X14)
| ~ setIn(X15,alive)
| host(X15) != host(X13)
| norm != index(status,host(X15))
| host(X14) != index(ldr,host(X15)) )
& ! [X16,X17,X18] :
( ~ elem(m_Down(X16),queue(host(X17)))
| host(X18) = host(X17)
| ~ setIn(X18,alive)
| host(X18) != host(X16)
| wait != index(status,host(X18))
| host(X17) != host(index(elid,host(X18))) )
& ! [X19,X20,X21,X22] :
( ~ elem(m_Down(X22),queue(host(X19)))
| ~ elem(m_Down(X20),queue(host(X21)))
| host(X19) = host(X21)
| ~ setIn(X19,alive)
| ~ setIn(X21,alive)
| host(X19) != host(X20)
| host(X21) != host(X22) )
& ! [X23,X24,X25,X26] :
( ~ elem(m_Down(X26),queue(host(X23)))
| ~ setIn(host(X24),index(down,host(X25)))
| host(X23) = host(X25)
| ~ setIn(X23,alive)
| ~ setIn(X25,alive)
| host(X23) != host(X24)
| host(X25) != host(X26) )
& ! [X27,X28,X29,X30] :
( ~ setIn(X27,alive)
| ~ elem(m_Down(X28),queue(host(X27)))
| ? [X31] :
( ~ setIn(X31,index(down,host(X30)))
& host(X29) != X31
& ~ leq(host(X30),X31)
& leq(s(zero),X31) )
| ~ elem(m_Down(X29),queue(host(X30)))
| nbr_proc != host(X30)
| host(X30) != host(X28)
| elec_1 != index(status,host(X30)) )
& queue(host(X2)) = cons(m_Ack(X1,X3),X0) ),
inference(ennf_transformation,[],[f69]) ).
fof(f71,plain,
? [X0,X1,X2,X3] :
( ? [X32] :
( ? [X33,X34,X35] :
( setIn(X32,alive)
& elem(m_Down(X33),snoc(X0,m_Halt(X2)))
& ! [X36] :
( setIn(X36,index(down,host(X35)))
| host(X34) = X36
| leq(host(X35),X36)
| ~ leq(s(zero),X36) )
& elem(m_Down(X34),queue(host(X35)))
& host(X35) = host(X33)
& nbr_proc = host(X35)
& elec_1 = index(status,host(X35))
& host(X2) != host(X35)
& s(index(pendack,host(X2))) != host(X35) )
& host(X2) = host(X32)
& s(index(pendack,host(X2))) = host(X32) )
& ~ leq(nbr_proc,index(pendack,host(X2)))
& index(elid,host(X2)) = X1
& index(status,host(X2)) = elec_2
& host(X3) = index(pendack,host(X2))
& setIn(X2,alive)
& ! [X4,X5] :
( ~ leq(host(X4),host(X5))
| ~ elem(m_Ldr(X5),queue(host(X4))) )
& ! [X6,X7] :
( host(X6) != host(X7)
| ~ elem(m_Down(X7),queue(host(X6))) )
& ! [X8,X9] :
( ~ elem(m_NotNorm(X8),queue(host(X9)))
| nbr_proc != host(X9) )
& ! [X10,X11] :
( ~ setIn(X10,alive)
| ~ setIn(X11,alive)
| X10 = X11
| host(X11) != host(X10) )
& ! [X12] :
( index(elid,host(X12)) = X12
| ( elec_1 != index(status,host(X12))
& elec_2 != index(status,host(X12)) )
| ~ setIn(X12,alive) )
& ! [X13,X14,X15] :
( ~ elem(m_Down(X13),queue(host(X14)))
| host(X15) = host(X14)
| ~ setIn(X15,alive)
| host(X15) != host(X13)
| norm != index(status,host(X15))
| host(X14) != index(ldr,host(X15)) )
& ! [X16,X17,X18] :
( ~ elem(m_Down(X16),queue(host(X17)))
| host(X18) = host(X17)
| ~ setIn(X18,alive)
| host(X18) != host(X16)
| wait != index(status,host(X18))
| host(X17) != host(index(elid,host(X18))) )
& ! [X19,X20,X21,X22] :
( ~ elem(m_Down(X22),queue(host(X19)))
| ~ elem(m_Down(X20),queue(host(X21)))
| host(X19) = host(X21)
| ~ setIn(X19,alive)
| ~ setIn(X21,alive)
| host(X19) != host(X20)
| host(X21) != host(X22) )
& ! [X23,X24,X25,X26] :
( ~ elem(m_Down(X26),queue(host(X23)))
| ~ setIn(host(X24),index(down,host(X25)))
| host(X23) = host(X25)
| ~ setIn(X23,alive)
| ~ setIn(X25,alive)
| host(X23) != host(X24)
| host(X25) != host(X26) )
& ! [X27,X28,X29,X30] :
( ~ setIn(X27,alive)
| ~ elem(m_Down(X28),queue(host(X27)))
| ? [X31] :
( ~ setIn(X31,index(down,host(X30)))
& host(X29) != X31
& ~ leq(host(X30),X31)
& leq(s(zero),X31) )
| ~ elem(m_Down(X29),queue(host(X30)))
| nbr_proc != host(X30)
| host(X30) != host(X28)
| elec_1 != index(status,host(X30)) )
& queue(host(X2)) = cons(m_Ack(X1,X3),X0) ),
inference(flattening,[],[f70]) ).
fof(f78,plain,
? [X0,X1,X2,X3] :
( ? [X4] :
( ? [X5,X6,X7] :
( setIn(X4,alive)
& elem(m_Down(X5),snoc(X0,m_Halt(X2)))
& ! [X8] :
( setIn(X8,index(down,host(X7)))
| host(X6) = X8
| leq(host(X7),X8)
| ~ leq(s(zero),X8) )
& elem(m_Down(X6),queue(host(X7)))
& host(X5) = host(X7)
& nbr_proc = host(X7)
& elec_1 = index(status,host(X7))
& host(X2) != host(X7)
& host(X7) != s(index(pendack,host(X2))) )
& host(X2) = host(X4)
& host(X4) = s(index(pendack,host(X2))) )
& ~ leq(nbr_proc,index(pendack,host(X2)))
& index(elid,host(X2)) = X1
& index(status,host(X2)) = elec_2
& host(X3) = index(pendack,host(X2))
& setIn(X2,alive)
& ! [X9,X10] :
( ~ leq(host(X9),host(X10))
| ~ elem(m_Ldr(X10),queue(host(X9))) )
& ! [X11,X12] :
( host(X11) != host(X12)
| ~ elem(m_Down(X12),queue(host(X11))) )
& ! [X13,X14] :
( ~ elem(m_NotNorm(X13),queue(host(X14)))
| nbr_proc != host(X14) )
& ! [X15,X16] :
( ~ setIn(X15,alive)
| ~ setIn(X16,alive)
| X15 = X16
| host(X15) != host(X16) )
& ! [X17] :
( index(elid,host(X17)) = X17
| ( elec_1 != index(status,host(X17))
& elec_2 != index(status,host(X17)) )
| ~ setIn(X17,alive) )
& ! [X18,X19,X20] :
( ~ elem(m_Down(X18),queue(host(X19)))
| host(X19) = host(X20)
| ~ setIn(X20,alive)
| host(X18) != host(X20)
| norm != index(status,host(X20))
| host(X19) != index(ldr,host(X20)) )
& ! [X21,X22,X23] :
( ~ elem(m_Down(X21),queue(host(X22)))
| host(X22) = host(X23)
| ~ setIn(X23,alive)
| host(X21) != host(X23)
| wait != index(status,host(X23))
| host(X22) != host(index(elid,host(X23))) )
& ! [X24,X25,X26,X27] :
( ~ elem(m_Down(X27),queue(host(X24)))
| ~ elem(m_Down(X25),queue(host(X26)))
| host(X24) = host(X26)
| ~ setIn(X24,alive)
| ~ setIn(X26,alive)
| host(X25) != host(X24)
| host(X26) != host(X27) )
& ! [X28,X29,X30,X31] :
( ~ elem(m_Down(X31),queue(host(X28)))
| ~ setIn(host(X29),index(down,host(X30)))
| host(X30) = host(X28)
| ~ setIn(X28,alive)
| ~ setIn(X30,alive)
| host(X29) != host(X28)
| host(X30) != host(X31) )
& ! [X32,X33,X34,X35] :
( ~ setIn(X32,alive)
| ~ elem(m_Down(X33),queue(host(X32)))
| ? [X36] :
( ~ setIn(X36,index(down,host(X35)))
& host(X34) != X36
& ~ leq(host(X35),X36)
& leq(s(zero),X36) )
| ~ elem(m_Down(X34),queue(host(X35)))
| nbr_proc != host(X35)
| host(X35) != host(X33)
| elec_1 != index(status,host(X35)) )
& queue(host(X2)) = cons(m_Ack(X1,X3),X0) ),
inference(rectify,[],[f71]) ).
fof(f79,plain,
( setIn(sK4,alive)
& elem(m_Down(sK5),snoc(sK0,m_Halt(sK2)))
& ! [X8] :
( setIn(X8,index(down,host(sK7)))
| host(sK6) = X8
| leq(host(sK7),X8)
| ~ leq(s(zero),X8) )
& elem(m_Down(sK6),queue(host(sK7)))
& host(sK7) = host(sK5)
& nbr_proc = host(sK7)
& elec_1 = index(status,host(sK7))
& host(sK7) != host(sK2)
& host(sK7) != s(index(pendack,host(sK2)))
& host(sK2) = host(sK4)
& s(index(pendack,host(sK2))) = host(sK4)
& ~ leq(nbr_proc,index(pendack,host(sK2)))
& sK1 = index(elid,host(sK2))
& elec_2 = index(status,host(sK2))
& index(pendack,host(sK2)) = host(sK3)
& setIn(sK2,alive)
& ! [X9,X10] :
( ~ leq(host(X9),host(X10))
| ~ elem(m_Ldr(X10),queue(host(X9))) )
& ! [X11,X12] :
( host(X11) != host(X12)
| ~ elem(m_Down(X12),queue(host(X11))) )
& ! [X13,X14] :
( ~ elem(m_NotNorm(X13),queue(host(X14)))
| nbr_proc != host(X14) )
& ! [X15,X16] :
( ~ setIn(X15,alive)
| ~ setIn(X16,alive)
| X15 = X16
| host(X15) != host(X16) )
& ! [X17] :
( index(elid,host(X17)) = X17
| ( elec_1 != index(status,host(X17))
& elec_2 != index(status,host(X17)) )
| ~ setIn(X17,alive) )
& ! [X18,X19,X20] :
( ~ elem(m_Down(X18),queue(host(X19)))
| host(X19) = host(X20)
| ~ setIn(X20,alive)
| host(X18) != host(X20)
| norm != index(status,host(X20))
| host(X19) != index(ldr,host(X20)) )
& ! [X21,X22,X23] :
( ~ elem(m_Down(X21),queue(host(X22)))
| host(X22) = host(X23)
| ~ setIn(X23,alive)
| host(X21) != host(X23)
| wait != index(status,host(X23))
| host(X22) != host(index(elid,host(X23))) )
& ! [X24,X25,X26,X27] :
( ~ elem(m_Down(X27),queue(host(X24)))
| ~ elem(m_Down(X25),queue(host(X26)))
| host(X24) = host(X26)
| ~ setIn(X24,alive)
| ~ setIn(X26,alive)
| host(X25) != host(X24)
| host(X26) != host(X27) )
& ! [X28,X29,X30,X31] :
( ~ elem(m_Down(X31),queue(host(X28)))
| ~ setIn(host(X29),index(down,host(X30)))
| host(X30) = host(X28)
| ~ setIn(X28,alive)
| ~ setIn(X30,alive)
| host(X29) != host(X28)
| host(X30) != host(X31) )
& ! [X32,X33,X34,X35] :
( ~ setIn(X32,alive)
| ~ elem(m_Down(X33),queue(host(X32)))
| ( ~ setIn(sK8(X34,X35),index(down,host(X35)))
& host(X34) != sK8(X34,X35)
& ~ leq(host(X35),sK8(X34,X35))
& leq(s(zero),sK8(X34,X35)) )
| ~ elem(m_Down(X34),queue(host(X35)))
| nbr_proc != host(X35)
| host(X35) != host(X33)
| elec_1 != index(status,host(X35)) )
& queue(host(sK2)) = cons(m_Ack(sK1,sK3),sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6,sK7,sK8]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4),skolemize(X5,sK5),skolemize(X6,sK6),skolemize(X7,sK7),skolemize(X36,sK8(X34,X35))],[f78]) ).
fof(f80,plain,
! [X0,X1,X2] :
( ( elem(X0,snoc(X2,X1))
| ( X0 != X1
& ~ elem(X0,X2) ) )
& ( X0 = X1
| elem(X0,X2)
| ~ elem(X0,snoc(X2,X1)) ) ),
inference(nnf_transformation,[],[f48]) ).
fof(f81,plain,
! [X0,X1,X2] :
( ( elem(X0,snoc(X2,X1))
| ( X0 != X1
& ~ elem(X0,X2) ) )
& ( X0 = X1
| elem(X0,X2)
| ~ elem(X0,snoc(X2,X1)) ) ),
inference(flattening,[],[f80]) ).
fof(f82,plain,
! [X0,X1,X2] :
( ( elem(X0,cons(X1,X2))
| ( X0 != X1
& ~ elem(X0,X2) ) )
& ( X0 = X1
| elem(X0,X2)
| ~ elem(X0,cons(X1,X2)) ) ),
inference(nnf_transformation,[],[f47]) ).
fof(f83,plain,
! [X0,X1,X2] :
( ( elem(X0,cons(X1,X2))
| ( X0 != X1
& ~ elem(X0,X2) ) )
& ( X0 = X1
| elem(X0,X2)
| ~ elem(X0,cons(X1,X2)) ) ),
inference(flattening,[],[f82]) ).
fof(f93,plain,
queue(host(sK2)) = cons(m_Ack(sK1,sK3),sK0),
inference(cnf_transformation,[],[f79]) ).
fof(f94,plain,
! [X34,X35,X32,X33] :
( ~ setIn(X32,alive)
| ~ elem(m_Down(X33),queue(host(X32)))
| leq(s(zero),sK8(X34,X35))
| ~ elem(m_Down(X34),queue(host(X35)))
| nbr_proc != host(X35)
| host(X35) != host(X33)
| elec_1 != index(status,host(X35)) ),
inference(cnf_transformation,[],[f79]) ).
fof(f95,plain,
! [X34,X35,X32,X33] :
( ~ setIn(X32,alive)
| ~ elem(m_Down(X33),queue(host(X32)))
| ~ leq(host(X35),sK8(X34,X35))
| ~ elem(m_Down(X34),queue(host(X35)))
| nbr_proc != host(X35)
| host(X35) != host(X33)
| elec_1 != index(status,host(X35)) ),
inference(cnf_transformation,[],[f79]) ).
fof(f96,plain,
! [X34,X35,X32,X33] :
( ~ setIn(X32,alive)
| ~ elem(m_Down(X33),queue(host(X32)))
| host(X34) != sK8(X34,X35)
| ~ elem(m_Down(X34),queue(host(X35)))
| nbr_proc != host(X35)
| host(X35) != host(X33)
| elec_1 != index(status,host(X35)) ),
inference(cnf_transformation,[],[f79]) ).
fof(f97,plain,
! [X34,X35,X32,X33] :
( ~ setIn(X32,alive)
| ~ elem(m_Down(X33),queue(host(X32)))
| ~ setIn(sK8(X34,X35),index(down,host(X35)))
| ~ elem(m_Down(X34),queue(host(X35)))
| nbr_proc != host(X35)
| host(X35) != host(X33)
| elec_1 != index(status,host(X35)) ),
inference(cnf_transformation,[],[f79]) ).
fof(f108,plain,
setIn(sK2,alive),
inference(cnf_transformation,[],[f79]) ).
fof(f117,plain,
elec_1 = index(status,host(sK7)),
inference(cnf_transformation,[],[f79]) ).
fof(f118,plain,
nbr_proc = host(sK7),
inference(cnf_transformation,[],[f79]) ).
fof(f119,plain,
host(sK7) = host(sK5),
inference(cnf_transformation,[],[f79]) ).
fof(f120,plain,
elem(m_Down(sK6),queue(host(sK7))),
inference(cnf_transformation,[],[f79]) ).
fof(f121,plain,
! [X8] :
( setIn(X8,index(down,host(sK7)))
| host(sK6) = X8
| leq(host(sK7),X8)
| ~ leq(s(zero),X8) ),
inference(cnf_transformation,[],[f79]) ).
fof(f122,plain,
elem(m_Down(sK5),snoc(sK0,m_Halt(sK2))),
inference(cnf_transformation,[],[f79]) ).
fof(f128,plain,
! [X2,X0,X1] :
( ~ elem(X0,snoc(X2,X1))
| elem(X0,X2)
| X0 = X1 ),
inference(cnf_transformation,[],[f81]) ).
fof(f132,plain,
! [X2,X0,X1] :
( elem(X0,cons(X1,X2))
| ~ elem(X0,X2) ),
inference(cnf_transformation,[],[f83]) ).
fof(f160,plain,
! [X0,X1] : m_Halt(X1) != m_Down(X0),
inference(cnf_transformation,[],[f18]) ).
fof(f189,definition,
~ sP16(nbr_proc),
introduced(definition,[new_symbols(definition,[sP16])],[inequality_splitting_name_introduction]) ).
fof(f190,definition,
~ sP17(elec_1),
introduced(definition,[new_symbols(definition,[sP17])],[inequality_splitting_name_introduction]) ).
fof(f191,plain,
! [X34,X35,X32,X33] :
( ~ setIn(X32,alive)
| ~ elem(m_Down(X33),queue(host(X32)))
| ~ setIn(sK8(X34,X35),index(down,host(X35)))
| ~ elem(m_Down(X34),queue(host(X35)))
| sP16(host(X35))
| host(X35) != host(X33)
| sP17(index(status,host(X35))) ),
inference(inequality_splitting,[],[f97,f190,f189]) ).
fof(f192,definition,
~ sP18(nbr_proc),
introduced(definition,[new_symbols(definition,[sP18])],[inequality_splitting_name_introduction]) ).
fof(f193,definition,
~ sP19(elec_1),
introduced(definition,[new_symbols(definition,[sP19])],[inequality_splitting_name_introduction]) ).
fof(f194,plain,
! [X34,X35,X32,X33] :
( ~ setIn(X32,alive)
| ~ elem(m_Down(X33),queue(host(X32)))
| host(X34) != sK8(X34,X35)
| ~ elem(m_Down(X34),queue(host(X35)))
| sP18(host(X35))
| host(X35) != host(X33)
| sP19(index(status,host(X35))) ),
inference(inequality_splitting,[],[f96,f193,f192]) ).
fof(f195,definition,
~ sP20(nbr_proc),
introduced(definition,[new_symbols(definition,[sP20])],[inequality_splitting_name_introduction]) ).
fof(f196,definition,
~ sP21(elec_1),
introduced(definition,[new_symbols(definition,[sP21])],[inequality_splitting_name_introduction]) ).
fof(f197,plain,
! [X34,X35,X32,X33] :
( ~ setIn(X32,alive)
| ~ elem(m_Down(X33),queue(host(X32)))
| ~ leq(host(X35),sK8(X34,X35))
| ~ elem(m_Down(X34),queue(host(X35)))
| sP20(host(X35))
| host(X35) != host(X33)
| sP21(index(status,host(X35))) ),
inference(inequality_splitting,[],[f95,f196,f195]) ).
fof(f198,definition,
~ sP22(nbr_proc),
introduced(definition,[new_symbols(definition,[sP22])],[inequality_splitting_name_introduction]) ).
fof(f199,definition,
~ sP23(elec_1),
introduced(definition,[new_symbols(definition,[sP23])],[inequality_splitting_name_introduction]) ).
fof(f200,plain,
! [X34,X35,X32,X33] :
( ~ setIn(X32,alive)
| ~ elem(m_Down(X33),queue(host(X32)))
| leq(s(zero),sK8(X34,X35))
| ~ elem(m_Down(X34),queue(host(X35)))
| sP22(host(X35))
| host(X35) != host(X33)
| sP23(index(status,host(X35))) ),
inference(inequality_splitting,[],[f94,f199,f198]) ).
fof(f227,plain,
! [X34,X35] :
( ~ setIn(sK8(X34,X35),index(down,host(X35)))
| ~ elem(m_Down(X34),queue(host(X35)))
| sP32(X35) ),
inference(cnf_transformation,[],[f227_D]) ).
fof(f227_D,definition,
! [X35] :
( ! [X34] :
( ~ setIn(sK8(X34,X35),index(down,host(X35)))
| ~ elem(m_Down(X34),queue(host(X35))) )
<=> ~ sP32(X35) ),
introduced(definition,[new_symbols(definition,[sP32])],[general_splitting_component_introduction]) ).
fof(f228,plain,
! [X35,X32,X33] :
( ~ setIn(X32,alive)
| ~ elem(m_Down(X33),queue(host(X32)))
| sP16(host(X35))
| host(X35) != host(X33)
| sP17(index(status,host(X35)))
| ~ sP32(X35) ),
inference(general_splitting,[],[f191,f227_D]) ).
fof(f229,plain,
! [X35,X33] :
( host(X35) != host(X33)
| sP16(host(X35))
| sP17(index(status,host(X35)))
| ~ sP32(X35)
| sP33(X33) ),
inference(cnf_transformation,[],[f229_D]) ).
fof(f229_D,definition,
! [X33] :
( ! [X35] :
( host(X35) != host(X33)
| sP16(host(X35))
| sP17(index(status,host(X35)))
| ~ sP32(X35) )
<=> ~ sP33(X33) ),
introduced(definition,[new_symbols(definition,[sP33])],[general_splitting_component_introduction]) ).
fof(f230,plain,
! [X32,X33] :
( ~ elem(m_Down(X33),queue(host(X32)))
| ~ setIn(X32,alive)
| ~ sP33(X33) ),
inference(general_splitting,[],[f228,f229_D]) ).
fof(f231,plain,
! [X34,X35] :
( host(X34) != sK8(X34,X35)
| ~ elem(m_Down(X34),queue(host(X35)))
| sP34(X35) ),
inference(cnf_transformation,[],[f231_D]) ).
fof(f231_D,definition,
! [X35] :
( ! [X34] :
( host(X34) != sK8(X34,X35)
| ~ elem(m_Down(X34),queue(host(X35))) )
<=> ~ sP34(X35) ),
introduced(definition,[new_symbols(definition,[sP34])],[general_splitting_component_introduction]) ).
fof(f232,plain,
! [X35,X32,X33] :
( ~ setIn(X32,alive)
| ~ elem(m_Down(X33),queue(host(X32)))
| sP18(host(X35))
| host(X35) != host(X33)
| sP19(index(status,host(X35)))
| ~ sP34(X35) ),
inference(general_splitting,[],[f194,f231_D]) ).
fof(f233,plain,
! [X35,X33] :
( host(X35) != host(X33)
| sP18(host(X35))
| sP19(index(status,host(X35)))
| ~ sP34(X35)
| sP35(X33) ),
inference(cnf_transformation,[],[f233_D]) ).
fof(f233_D,definition,
! [X33] :
( ! [X35] :
( host(X35) != host(X33)
| sP18(host(X35))
| sP19(index(status,host(X35)))
| ~ sP34(X35) )
<=> ~ sP35(X33) ),
introduced(definition,[new_symbols(definition,[sP35])],[general_splitting_component_introduction]) ).
fof(f234,plain,
! [X32,X33] :
( ~ elem(m_Down(X33),queue(host(X32)))
| ~ setIn(X32,alive)
| ~ sP35(X33) ),
inference(general_splitting,[],[f232,f233_D]) ).
fof(f235,plain,
! [X34,X35] :
( ~ leq(host(X35),sK8(X34,X35))
| ~ elem(m_Down(X34),queue(host(X35)))
| sP36(X35) ),
inference(cnf_transformation,[],[f235_D]) ).
fof(f235_D,definition,
! [X35] :
( ! [X34] :
( ~ leq(host(X35),sK8(X34,X35))
| ~ elem(m_Down(X34),queue(host(X35))) )
<=> ~ sP36(X35) ),
introduced(definition,[new_symbols(definition,[sP36])],[general_splitting_component_introduction]) ).
fof(f236,plain,
! [X35,X32,X33] :
( ~ setIn(X32,alive)
| ~ elem(m_Down(X33),queue(host(X32)))
| sP20(host(X35))
| host(X35) != host(X33)
| sP21(index(status,host(X35)))
| ~ sP36(X35) ),
inference(general_splitting,[],[f197,f235_D]) ).
fof(f237,plain,
! [X35,X33] :
( host(X35) != host(X33)
| sP20(host(X35))
| sP21(index(status,host(X35)))
| ~ sP36(X35)
| sP37(X33) ),
inference(cnf_transformation,[],[f237_D]) ).
fof(f237_D,definition,
! [X33] :
( ! [X35] :
( host(X35) != host(X33)
| sP20(host(X35))
| sP21(index(status,host(X35)))
| ~ sP36(X35) )
<=> ~ sP37(X33) ),
introduced(definition,[new_symbols(definition,[sP37])],[general_splitting_component_introduction]) ).
fof(f238,plain,
! [X32,X33] :
( ~ elem(m_Down(X33),queue(host(X32)))
| ~ setIn(X32,alive)
| ~ sP37(X33) ),
inference(general_splitting,[],[f236,f237_D]) ).
fof(f239,plain,
! [X34,X35] :
( ~ elem(m_Down(X34),queue(host(X35)))
| leq(s(zero),sK8(X34,X35))
| sP38(X35) ),
inference(cnf_transformation,[],[f239_D]) ).
fof(f239_D,definition,
! [X35] :
( ! [X34] :
( ~ elem(m_Down(X34),queue(host(X35)))
| leq(s(zero),sK8(X34,X35)) )
<=> ~ sP38(X35) ),
introduced(definition,[new_symbols(definition,[sP38])],[general_splitting_component_introduction]) ).
fof(f240,plain,
! [X35,X32,X33] :
( ~ setIn(X32,alive)
| ~ elem(m_Down(X33),queue(host(X32)))
| sP22(host(X35))
| host(X35) != host(X33)
| sP23(index(status,host(X35)))
| ~ sP38(X35) ),
inference(general_splitting,[],[f200,f239_D]) ).
fof(f241,plain,
! [X35,X33] :
( host(X35) != host(X33)
| sP22(host(X35))
| sP23(index(status,host(X35)))
| ~ sP38(X35)
| sP39(X33) ),
inference(cnf_transformation,[],[f241_D]) ).
fof(f241_D,definition,
! [X33] :
( ! [X35] :
( host(X35) != host(X33)
| sP22(host(X35))
| sP23(index(status,host(X35)))
| ~ sP38(X35) )
<=> ~ sP39(X33) ),
introduced(definition,[new_symbols(definition,[sP39])],[general_splitting_component_introduction]) ).
fof(f242,plain,
! [X32,X33] :
( ~ elem(m_Down(X33),queue(host(X32)))
| ~ setIn(X32,alive)
| ~ sP39(X33) ),
inference(general_splitting,[],[f240,f241_D]) ).
fof(f243,plain,
nbr_proc = host(sK5),
inference(forward_demodulation,[],[f119,f118]) ).
fof(f244,plain,
elem(m_Down(sK6),queue(nbr_proc)),
inference(forward_demodulation,[],[f120,f118]) ).
fof(f245,plain,
! [X8] :
( setIn(X8,index(down,nbr_proc))
| host(sK6) = X8
| leq(host(sK7),X8)
| ~ leq(s(zero),X8) ),
inference(forward_demodulation,[],[f121,f118]) ).
fof(f246,plain,
! [X8] :
( setIn(X8,index(down,nbr_proc))
| leq(nbr_proc,X8)
| host(sK6) = X8
| ~ leq(s(zero),X8) ),
inference(forward_demodulation,[],[f245,f118]) ).
fof(f266,plain,
elec_1 = index(status,nbr_proc),
inference(superposition,[],[f117,f118]) ).
fof(f272,plain,
~ sP17(index(status,nbr_proc)),
inference(superposition,[],[f190,f266]) ).
fof(f273,plain,
~ sP19(index(status,nbr_proc)),
inference(superposition,[],[f193,f266]) ).
fof(f274,plain,
~ sP21(index(status,nbr_proc)),
inference(superposition,[],[f196,f266]) ).
fof(f275,plain,
~ sP23(index(status,nbr_proc)),
inference(superposition,[],[f199,f266]) ).
fof(f279,plain,
( elem(m_Down(sK5),sK0)
| m_Down(sK5) = m_Halt(sK2) ),
inference(resolution,[],[f122,f128]) ).
fof(f280,plain,
elem(m_Down(sK5),sK0),
inference(forward_subsumption_resolution,[],[f279,f160]) ).
fof(f290,plain,
! [X0] :
( elem(X0,queue(host(sK2)))
| ~ elem(X0,sK0) ),
inference(superposition,[],[f132,f93]) ).
fof(f494,plain,
! [X0] :
( ~ leq(nbr_proc,sK8(X0,sK7))
| ~ elem(m_Down(X0),queue(nbr_proc))
| sP36(sK7) ),
inference(superposition,[],[f235,f118]) ).
fof(f496,definition,
( spl40_10
<=> sP36(sK7) ),
introduced(definition,[new_symbols(definition,[spl40_10])],[avatar_definition]) ).
fof(f498,plain,
( sP36(sK7)
| ~ spl40_10 ),
inference(avatar_component_clause,[],[f496]) ).
fof(f500,definition,
( spl40_11
<=> ! [X0] :
( ~ leq(nbr_proc,sK8(X0,sK7))
| ~ elem(m_Down(X0),queue(nbr_proc)) ) ),
introduced(definition,[new_symbols(definition,[spl40_11])],[avatar_definition]) ).
fof(f501,plain,
( ! [X0] :
( ~ leq(nbr_proc,sK8(X0,sK7))
| ~ elem(m_Down(X0),queue(nbr_proc)) )
| ~ spl40_11 ),
inference(avatar_component_clause,[],[f500]) ).
fof(f502,plain,
( spl40_10
| spl40_11 ),
inference(avatar_split_clause,[],[f494,f500,f496]) ).
fof(f538,plain,
! [X0] :
( ~ elem(m_Down(X0),queue(nbr_proc))
| leq(s(zero),sK8(X0,sK7))
| sP38(sK7) ),
inference(superposition,[],[f239,f118]) ).
fof(f540,definition,
( spl40_18
<=> sP38(sK7) ),
introduced(definition,[new_symbols(definition,[spl40_18])],[avatar_definition]) ).
fof(f542,plain,
( sP38(sK7)
| ~ spl40_18 ),
inference(avatar_component_clause,[],[f540]) ).
fof(f544,definition,
( spl40_19
<=> ! [X0] :
( ~ elem(m_Down(X0),queue(nbr_proc))
| leq(s(zero),sK8(X0,sK7)) ) ),
introduced(definition,[new_symbols(definition,[spl40_19])],[avatar_definition]) ).
fof(f545,plain,
( ! [X0] :
( leq(s(zero),sK8(X0,sK7))
| ~ elem(m_Down(X0),queue(nbr_proc)) )
| ~ spl40_19 ),
inference(avatar_component_clause,[],[f544]) ).
fof(f546,plain,
( spl40_18
| spl40_19 ),
inference(avatar_split_clause,[],[f538,f544,f540]) ).
fof(f581,plain,
! [X0] :
( ~ setIn(sK8(X0,sK7),index(down,nbr_proc))
| ~ elem(m_Down(X0),queue(nbr_proc))
| sP32(sK7) ),
inference(superposition,[],[f227,f118]) ).
fof(f583,definition,
( spl40_26
<=> sP32(sK7) ),
introduced(definition,[new_symbols(definition,[spl40_26])],[avatar_definition]) ).
fof(f585,plain,
( sP32(sK7)
| ~ spl40_26 ),
inference(avatar_component_clause,[],[f583]) ).
fof(f587,definition,
( spl40_27
<=> ! [X0] :
( ~ setIn(sK8(X0,sK7),index(down,nbr_proc))
| ~ elem(m_Down(X0),queue(nbr_proc)) ) ),
introduced(definition,[new_symbols(definition,[spl40_27])],[avatar_definition]) ).
fof(f588,plain,
( ! [X0] :
( ~ setIn(sK8(X0,sK7),index(down,nbr_proc))
| ~ elem(m_Down(X0),queue(nbr_proc)) )
| ~ spl40_27 ),
inference(avatar_component_clause,[],[f587]) ).
fof(f589,plain,
( spl40_26
| spl40_27 ),
inference(avatar_split_clause,[],[f581,f587,f583]) ).
fof(f625,plain,
! [X0] :
( host(X0) != nbr_proc
| sP16(nbr_proc)
| sP17(index(status,nbr_proc))
| ~ sP32(sK7)
| sP33(X0) ),
inference(superposition,[],[f229,f118]) ).
fof(f641,definition,
( spl40_36
<=> sP33(sK5) ),
introduced(definition,[new_symbols(definition,[spl40_36])],[avatar_definition]) ).
fof(f655,plain,
! [X0] :
( host(X0) != nbr_proc
| sP17(index(status,nbr_proc))
| ~ sP32(sK7)
| sP33(X0) ),
inference(forward_subsumption_resolution,[],[f625,f189]) ).
fof(f669,plain,
! [X0] :
( host(X0) != nbr_proc
| ~ sP32(sK7)
| sP33(X0) ),
inference(forward_subsumption_resolution,[],[f655,f272]) ).
fof(f697,plain,
( ! [X0] :
( host(X0) != nbr_proc
| sP33(X0) )
| ~ spl40_26 ),
inference(forward_subsumption_resolution,[],[f669,f585]) ).
fof(f710,plain,
! [X0] :
( host(X0) != nbr_proc
| sP18(host(X0))
| sP19(index(status,host(X0)))
| ~ sP34(X0)
| sP35(sK5) ),
inference(superposition,[],[f233,f243]) ).
fof(f718,definition,
( spl40_48
<=> ! [X0] :
( host(X0) != nbr_proc
| ~ sP34(X0)
| sP19(index(status,host(X0)))
| sP18(host(X0)) ) ),
introduced(definition,[new_symbols(definition,[spl40_48])],[avatar_definition]) ).
fof(f719,plain,
( ! [X0] :
( host(X0) != nbr_proc
| ~ sP34(X0)
| sP19(index(status,host(X0)))
| sP18(host(X0)) )
| ~ spl40_48 ),
inference(avatar_component_clause,[],[f718]) ).
fof(f722,definition,
( spl40_49
<=> sP35(sK5) ),
introduced(definition,[new_symbols(definition,[spl40_49])],[avatar_definition]) ).
fof(f725,plain,
( spl40_49
| spl40_48 ),
inference(avatar_split_clause,[],[f710,f718,f722]) ).
fof(f786,definition,
( spl40_62
<=> sP34(sK7) ),
introduced(definition,[new_symbols(definition,[spl40_62])],[avatar_definition]) ).
fof(f787,plain,
( sP34(sK7)
| ~ spl40_62 ),
inference(avatar_component_clause,[],[f786]) ).
fof(f788,plain,
( ~ sP34(sK7)
| spl40_62 ),
inference(avatar_component_clause,[],[f786]) ).
fof(f805,plain,
! [X0] :
( host(X0) != nbr_proc
| sP20(nbr_proc)
| sP21(index(status,nbr_proc))
| ~ sP36(sK7)
| sP37(X0) ),
inference(superposition,[],[f237,f118]) ).
fof(f821,definition,
( spl40_67
<=> sP37(sK5) ),
introduced(definition,[new_symbols(definition,[spl40_67])],[avatar_definition]) ).
fof(f823,plain,
( sP37(sK5)
| ~ spl40_67 ),
inference(avatar_component_clause,[],[f821]) ).
fof(f835,plain,
! [X0] :
( host(X0) != nbr_proc
| sP21(index(status,nbr_proc))
| ~ sP36(sK7)
| sP37(X0) ),
inference(forward_subsumption_resolution,[],[f805,f195]) ).
fof(f849,plain,
! [X0] :
( host(X0) != nbr_proc
| ~ sP36(sK7)
| sP37(X0) ),
inference(forward_subsumption_resolution,[],[f835,f274]) ).
fof(f877,plain,
( ! [X0] :
( host(X0) != nbr_proc
| sP37(X0) )
| ~ spl40_10 ),
inference(forward_subsumption_resolution,[],[f849,f498]) ).
fof(f886,plain,
! [X0] :
( host(X0) != nbr_proc
| sP22(nbr_proc)
| sP23(index(status,nbr_proc))
| ~ sP38(sK7)
| sP39(X0) ),
inference(superposition,[],[f241,f118]) ).
fof(f902,definition,
( spl40_80
<=> sP39(sK5) ),
introduced(definition,[new_symbols(definition,[spl40_80])],[avatar_definition]) ).
fof(f904,plain,
( sP39(sK5)
| ~ spl40_80 ),
inference(avatar_component_clause,[],[f902]) ).
fof(f916,plain,
! [X0] :
( host(X0) != nbr_proc
| sP23(index(status,nbr_proc))
| ~ sP38(sK7)
| sP39(X0) ),
inference(forward_subsumption_resolution,[],[f886,f198]) ).
fof(f930,plain,
! [X0] :
( host(X0) != nbr_proc
| ~ sP38(sK7)
| sP39(X0) ),
inference(forward_subsumption_resolution,[],[f916,f275]) ).
fof(f958,plain,
( ! [X0] :
( host(X0) != nbr_proc
| sP39(X0) )
| ~ spl40_18 ),
inference(forward_subsumption_resolution,[],[f930,f542]) ).
fof(f1086,plain,
( nbr_proc != nbr_proc
| sP33(sK5)
| ~ spl40_26 ),
inference(superposition,[],[f697,f243]) ).
fof(f1089,plain,
( sP33(sK5)
| ~ spl40_26 ),
inference(trivial_inequality_removal,[],[f1086]) ).
fof(f1091,plain,
( spl40_36
| ~ spl40_26 ),
inference(avatar_split_clause,[],[f1089,f583,f641]) ).
fof(f1118,plain,
( nbr_proc != nbr_proc
| sP37(sK5)
| ~ spl40_10 ),
inference(superposition,[],[f877,f243]) ).
fof(f1121,plain,
( sP37(sK5)
| ~ spl40_10 ),
inference(trivial_inequality_removal,[],[f1118]) ).
fof(f1123,plain,
( spl40_67
| ~ spl40_10 ),
inference(avatar_split_clause,[],[f1121,f496,f821]) ).
fof(f1132,plain,
( nbr_proc != nbr_proc
| sP39(sK5)
| ~ spl40_18 ),
inference(superposition,[],[f958,f243]) ).
fof(f1135,plain,
( sP39(sK5)
| ~ spl40_18 ),
inference(trivial_inequality_removal,[],[f1132]) ).
fof(f1137,plain,
( spl40_80
| ~ spl40_18 ),
inference(avatar_split_clause,[],[f1135,f540,f902]) ).
fof(f1189,plain,
! [X0] :
( ~ elem(m_Down(X0),sK0)
| ~ setIn(sK2,alive)
| ~ sP39(X0) ),
inference(resolution,[],[f290,f242]) ).
fof(f1190,plain,
! [X0] :
( ~ elem(m_Down(X0),sK0)
| ~ setIn(sK2,alive)
| ~ sP37(X0) ),
inference(resolution,[],[f290,f238]) ).
fof(f1191,plain,
! [X0] :
( ~ elem(m_Down(X0),sK0)
| ~ setIn(sK2,alive)
| ~ sP35(X0) ),
inference(resolution,[],[f290,f234]) ).
fof(f1192,plain,
! [X0] :
( ~ elem(m_Down(X0),sK0)
| ~ setIn(sK2,alive)
| ~ sP33(X0) ),
inference(resolution,[],[f290,f230]) ).
fof(f1204,plain,
! [X0] :
( ~ elem(m_Down(X0),sK0)
| ~ sP33(X0) ),
inference(forward_subsumption_resolution,[],[f1192,f108]) ).
fof(f1205,plain,
! [X0] :
( ~ elem(m_Down(X0),sK0)
| ~ sP35(X0) ),
inference(forward_subsumption_resolution,[],[f1191,f108]) ).
fof(f1206,plain,
! [X0] :
( ~ elem(m_Down(X0),sK0)
| ~ sP37(X0) ),
inference(forward_subsumption_resolution,[],[f1190,f108]) ).
fof(f1207,plain,
! [X0] :
( ~ elem(m_Down(X0),sK0)
| ~ sP39(X0) ),
inference(forward_subsumption_resolution,[],[f1189,f108]) ).
fof(f1227,plain,
~ sP33(sK5),
inference(resolution,[],[f1204,f280]) ).
fof(f1228,plain,
~ spl40_36,
inference(avatar_split_clause,[],[f1227,f641]) ).
fof(f1229,plain,
~ sP35(sK5),
inference(resolution,[],[f1205,f280]) ).
fof(f1230,plain,
~ spl40_49,
inference(avatar_split_clause,[],[f1229,f722]) ).
fof(f1231,plain,
~ sP37(sK5),
inference(resolution,[],[f1206,f280]) ).
fof(f1232,plain,
( $false
| ~ spl40_67 ),
inference(forward_subsumption_resolution,[],[f1231,f823]) ).
fof(f1233,plain,
~ spl40_67,
inference(avatar_contradiction_clause,[],[f1232]) ).
fof(f1272,plain,
~ sP39(sK5),
inference(resolution,[],[f1207,f280]) ).
fof(f1273,plain,
( $false
| ~ spl40_80 ),
inference(forward_subsumption_resolution,[],[f1272,f904]) ).
fof(f1274,plain,
~ spl40_80,
inference(avatar_contradiction_clause,[],[f1273]) ).
fof(f1417,plain,
( ! [X0] :
( ~ elem(m_Down(X0),queue(nbr_proc))
| leq(nbr_proc,sK8(X0,sK7))
| host(sK6) = sK8(X0,sK7)
| ~ leq(s(zero),sK8(X0,sK7)) )
| ~ spl40_27 ),
inference(resolution,[],[f588,f246]) ).
fof(f1418,plain,
( ! [X0] :
( ~ elem(m_Down(X0),queue(nbr_proc))
| host(sK6) = sK8(X0,sK7)
| ~ leq(s(zero),sK8(X0,sK7)) )
| ~ spl40_11
| ~ spl40_27 ),
inference(forward_subsumption_resolution,[],[f1417,f501]) ).
fof(f1419,plain,
( ! [X0] :
( host(sK6) = sK8(X0,sK7)
| ~ elem(m_Down(X0),queue(nbr_proc)) )
| ~ spl40_11
| ~ spl40_19
| ~ spl40_27 ),
inference(forward_subsumption_resolution,[],[f1418,f545]) ).
fof(f1682,plain,
( nbr_proc != nbr_proc
| ~ sP34(sK7)
| sP19(index(status,nbr_proc))
| sP18(nbr_proc)
| ~ spl40_48 ),
inference(superposition,[],[f719,f118]) ).
fof(f1683,plain,
( ~ sP34(sK7)
| sP19(index(status,nbr_proc))
| sP18(nbr_proc)
| ~ spl40_48 ),
inference(trivial_inequality_removal,[],[f1682]) ).
fof(f2678,plain,
( ! [X0] :
( host(X0) != host(sK6)
| ~ elem(m_Down(X0),queue(host(sK7)))
| sP34(sK7)
| ~ elem(m_Down(X0),queue(nbr_proc)) )
| ~ spl40_11
| ~ spl40_19
| ~ spl40_27 ),
inference(superposition,[],[f231,f1419]) ).
fof(f2682,plain,
( ! [X0] :
( host(X0) != host(sK6)
| ~ elem(m_Down(X0),queue(host(sK7)))
| ~ elem(m_Down(X0),queue(nbr_proc)) )
| ~ spl40_11
| ~ spl40_19
| ~ spl40_27
| spl40_62 ),
inference(forward_subsumption_resolution,[],[f2678,f788]) ).
fof(f3037,plain,
( ! [X0] :
( ~ elem(m_Down(X0),queue(nbr_proc))
| host(X0) != host(sK6)
| ~ elem(m_Down(X0),queue(nbr_proc)) )
| ~ spl40_11
| ~ spl40_19
| ~ spl40_27
| spl40_62 ),
inference(forward_demodulation,[],[f2682,f118]) ).
fof(f3038,plain,
( ! [X0] :
( host(X0) != host(sK6)
| ~ elem(m_Down(X0),queue(nbr_proc)) )
| ~ spl40_11
| ~ spl40_19
| ~ spl40_27
| spl40_62 ),
inference(duplicate_literal_removal,[],[f3037]) ).
fof(f3717,plain,
( ~ elem(m_Down(sK6),queue(nbr_proc))
| ~ spl40_11
| ~ spl40_19
| ~ spl40_27
| spl40_62 ),
inference(equality_resolution,[],[f3038]) ).
fof(f3720,plain,
( $false
| ~ spl40_11
| ~ spl40_19
| ~ spl40_27
| spl40_62 ),
inference(forward_subsumption_resolution,[],[f3717,f244]) ).
fof(f3721,plain,
( ~ spl40_11
| ~ spl40_19
| ~ spl40_27
| spl40_62 ),
inference(avatar_contradiction_clause,[],[f3720]) ).
fof(f3728,plain,
( sP19(index(status,nbr_proc))
| sP18(nbr_proc)
| ~ spl40_48
| ~ spl40_62 ),
inference(forward_subsumption_resolution,[],[f1683,f787]) ).
fof(f3732,plain,
( sP18(nbr_proc)
| ~ spl40_48
| ~ spl40_62 ),
inference(forward_subsumption_resolution,[],[f3728,f273]) ).
fof(f3737,plain,
( $false
| ~ spl40_48
| ~ spl40_62 ),
inference(forward_subsumption_resolution,[],[f3732,f192]) ).
fof(f3738,plain,
( ~ spl40_48
| ~ spl40_62 ),
inference(avatar_contradiction_clause,[],[f3737]) ).
cnf(s9,plain,
( spl40_10
| spl40_11 ),
inference(sat_conversion,[],[f502]) ).
cnf(s14,plain,
( spl40_18
| spl40_19 ),
inference(sat_conversion,[],[f546]) ).
cnf(s19,plain,
( spl40_26
| spl40_27 ),
inference(sat_conversion,[],[f589]) ).
cnf(s33,plain,
( spl40_48
| spl40_49 ),
inference(sat_conversion,[],[f725]) ).
cnf(s63,plain,
( ~ spl40_26
| spl40_36 ),
inference(sat_conversion,[],[f1091]) ).
cnf(s71,plain,
( ~ spl40_10
| spl40_67 ),
inference(sat_conversion,[],[f1123]) ).
cnf(s75,plain,
( ~ spl40_18
| spl40_80 ),
inference(sat_conversion,[],[f1137]) ).
cnf(s80,plain,
~ spl40_36,
inference(sat_conversion,[],[f1228]) ).
cnf(s81,plain,
~ spl40_49,
inference(sat_conversion,[],[f1230]) ).
cnf(s82,plain,
~ spl40_67,
inference(sat_conversion,[],[f1233]) ).
cnf(s85,plain,
~ spl40_80,
inference(sat_conversion,[],[f1274]) ).
cnf(s200,plain,
( ~ spl40_11
| ~ spl40_19
| ~ spl40_27
| spl40_62 ),
inference(sat_conversion,[],[f3721]) ).
cnf(s203,plain,
( ~ spl40_48
| ~ spl40_62 ),
inference(sat_conversion,[],[f3738]) ).
cnf(s208,plain,
~ spl40_18,
inference(rat,[],[s75,s85]) ).
cnf(s209,plain,
~ spl40_10,
inference(rat,[],[s71,s82]) ).
cnf(s211,plain,
~ spl40_26,
inference(rat,[],[s63,s80]) ).
cnf(s214,plain,
spl40_48,
inference(rat,[],[s33,s81]) ).
cnf(s215,plain,
~ spl40_62,
inference(rat,[],[s203,s214]) ).
cnf(s218,plain,
spl40_27,
inference(rat,[],[s19,s211]) ).
cnf(s220,plain,
spl40_19,
inference(rat,[],[s14,s208]) ).
cnf(s221,plain,
~ spl40_11,
inference(rat,[],[s200,s215,s218,s220]) ).
cnf(s224,plain,
$false,
inference(rat,[],[s9,s221,s209]) ).
fof(f3741,plain,
$false,
inference(avatar_sat_refutation,[],[s224]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV472+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.20 % Computer : n019.cluster.edu
% 0.09/0.20 % Model : x86_64 x86_64
% 0.09/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20 % Memory : 8046.5625MB
% 0.09/0.20 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Mon Sep 28 11:10:18 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.21 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.24 Running first-order theorem proving
% 0.09/0.24 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.57/1.20 % (3941457)Detected formulas, will run a generic FOF schedule.
% 3.57/1.20 % (3941466)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2826644464:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.57/1.20 % (3941463)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=1787272838:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.57/1.20 % (3941465)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=510055249:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.57/1.20 % (3941468)dis-21_1_sil=8000:lcm=predicate:random_seed=4035435428:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 3.57/1.20 % (3941467)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2562241757:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.57/1.20 % (3941462)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=1759687597:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.57/1.20 % (3941464)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=2594467143:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.57/1.20 % (3941466)Instruction limit reached!
% 3.57/1.20 % (3941466)------------------------------
% 3.57/1.20 % (3941466)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.57/1.20 % (3941466)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.57/1.20 % (3941466)CaDiCaL version: 2.1.3
% 3.57/1.20 % (3941466)Termination reason: Instruction limit
% 3.57/1.20 % (3941466)Termination phase: Saturation
% 3.57/1.20 % (3941466)Time elapsed: 0.037 s
% 3.57/1.20 % (3941466)Peak memory usage: 88 MB
% 3.57/1.20 % (3941466)Instructions burned: 120 (million)
% 3.57/1.20 % (3941465)First to succeed.
% 3.57/1.20 % (3941468)Instruction limit reached!
% 3.57/1.20 % (3941468)------------------------------
% 3.57/1.20 % (3941468)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.57/1.20 % (3941468)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.57/1.20 % (3941468)CaDiCaL version: 2.1.3
% 3.57/1.20 % (3941468)Termination reason: Instruction limit
% 3.57/1.20 % (3941468)Termination phase: Saturation
% 3.57/1.20 % (3941468)Time elapsed: 0.071 s
% 3.57/1.20 % (3941468)Peak memory usage: 88 MB
% 3.57/1.20 % (3941468)Instructions burned: 130 (million)
% 3.57/1.20 % (3941465)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3941457"
% 3.57/1.20 % (3941467)Instruction limit reached!
% 3.57/1.20 % (3941467)------------------------------
% 3.57/1.20 % (3941467)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.57/1.20 % (3941467)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.57/1.20 % (3941467)CaDiCaL version: 2.1.3
% 3.57/1.20 % (3941467)Termination reason: Instruction limit
% 3.57/1.20 % (3941467)Termination phase: Saturation
% 3.57/1.20 % (3941467)Time elapsed: 0.125 s
% 3.57/1.20 % (3941467)Peak memory usage: 89 MB
% 3.57/1.20 % (3941467)Instructions burned: 140 (million)
% 3.57/1.20 % (3941476)lrs+10_1_sil=8000:sp=occurrence:random_seed=3864126020:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 3.57/1.20 % (3941476)Also succeeded, but the first one will report.
% 3.57/1.20 % (3941477)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3017394097:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.57/1.20 % (3941478)lrs+1011_1_sil=32000:sp=occurrence:random_seed=4221742222:i=325:sd=1:ss=axioms:sgt=32_2996 on theBenchmark for (2996ds/325Mi)
% 3.57/1.20 % (3941477)Also succeeded, but the first one will report.
% 3.57/1.20 % (3941478)Also succeeded, but the first one will report.
% 3.57/1.20 % (3941465)Refutation found. Thanks to Tanya!
% 3.57/1.20 % SZS status Theorem for theBenchmark
% 3.57/1.20 % SZS output start Proof for theBenchmark
% See solution above
% 4.22/1.40 % (3941465)------------------------------
% 4.22/1.40 % (3941465)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.22/1.40 % (3941465)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.22/1.40 % (3941465)CaDiCaL version: 2.1.3
% 4.22/1.40 % (3941465)Termination reason: Refutation
% 4.22/1.40 % (3941465)Time elapsed: 0.074 s
% 4.22/1.40 % (3941465)Peak memory usage: 91 MB
% 4.22/1.40 % (3941465)Instructions burned: 116 (million)
% 4.22/1.40 % (3941465)------------------------------
% 4.22/1.40 % (3941465)------------------------------
% 4.22/1.40 % (3941457)Success in time 0.509 s
% 4.22/1.40 % Vampire exiting
%------------------------------------------------------------------------------