%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWV452+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n011.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:51 PM UTC 2026
% Result : Theorem 2.99s 1.10s
% Output : Refutation 3.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 8
% Syntax : Number of formulae : 72 ( 20 unt; 6 def)
% Number of atoms : 505 ( 217 equ)
% Maximal formula atoms : 50 ( 7 avg)
% Number of connectives : 697 ( 264 ~; 175 |; 197 &)
% ( 7 <=>; 54 =>; 0 <=; 0 <~>)
% Maximal formula depth : 35 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 7 prp; 0-2 aty)
% Number of functors : 24 ( 24 usr; 16 con; 0-2 aty)
% Number of variables : 218 ( 0 sgn 194 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f47,axiom,
! [X0,X1,X2] :
( elem(X0,cons(X1,X2))
<=> ( X0 = X1
| elem(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_46) ).
fof(f67,conjecture,
! [X0,X1,X2,X3] :
( ( ! [X4,X5] :
( setIn(X5,alive)
=> ~ elem(m_Down(X5),queue(host(X4))) )
& ! [X4,X5] :
( elem(m_Down(X5),queue(host(X4)))
=> ~ setIn(X5,alive) )
& ! [X4,X5] :
( elem(m_Down(X5),queue(host(X4)))
=> host(X5) != host(X4) )
& ! [X4,X5] :
( elem(m_Halt(X5),queue(host(X4)))
=> ~ leq(host(X4),host(X5)) )
& ! [X4,X6,X5] :
( elem(m_Ack(X5,X4),queue(host(X6)))
=> ~ leq(host(X4),host(X5)) )
& ! [X4,X5] :
( ( ~ setIn(X4,alive)
& leq(X5,X4)
& host(X5) = host(X4) )
=> ~ setIn(X5,alive) )
& ! [X4,X5] :
( ( X5 != X4
& host(X5) = host(X4) )
=> ( ~ setIn(X4,alive)
| ~ setIn(X5,alive) ) )
& ! [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))) ) )
& queue(host(X2)) = cons(m_Down(X3),X0) )
=> ( setIn(X2,alive)
=> ( ~ leq(host(X2),host(X3))
=> ( ( ( index(ldr,host(X2)) = host(X3)
& index(status,host(X2)) = norm )
| ( index(status,host(X2)) = wait
& host(X3) = host(index(elid,host(X2))) ) )
=> ( ( ! [X4] :
( host(X2) = host(X4)
=> leq(X4,X1) )
& ~ setIn(X1,pids)
& host(X2) = host(X1) )
=> ( host(X1) != s(zero)
=> ! [X4] :
( host(X2) = host(X4)
=> ! [X8,X9] :
( host(X2) != host(X9)
=> ! [X10] :
( ( ( ( X4 != X2
& setIn(X4,alive) )
| X4 = X1 )
& ( ( X9 != X2
& setIn(X9,alive) )
| X9 = X1 )
& host(X9) != host(X4)
& host(X8) = host(X4)
& host(X10) = host(X9) )
=> ~ ( elem(m_Down(X10),X0)
& elem(m_Down(X8),queue(host(X9))) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
fof(f68,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( ! [X4,X5] :
( setIn(X5,alive)
=> ~ elem(m_Down(X5),queue(host(X4))) )
& ! [X4,X5] :
( elem(m_Down(X5),queue(host(X4)))
=> ~ setIn(X5,alive) )
& ! [X4,X5] :
( elem(m_Down(X5),queue(host(X4)))
=> host(X5) != host(X4) )
& ! [X4,X5] :
( elem(m_Halt(X5),queue(host(X4)))
=> ~ leq(host(X4),host(X5)) )
& ! [X4,X6,X5] :
( elem(m_Ack(X5,X4),queue(host(X6)))
=> ~ leq(host(X4),host(X5)) )
& ! [X4,X5] :
( ( ~ setIn(X4,alive)
& leq(X5,X4)
& host(X5) = host(X4) )
=> ~ setIn(X5,alive) )
& ! [X4,X5] :
( ( X5 != X4
& host(X5) = host(X4) )
=> ( ~ setIn(X4,alive)
| ~ setIn(X5,alive) ) )
& ! [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))) ) )
& queue(host(X2)) = cons(m_Down(X3),X0) )
=> ( setIn(X2,alive)
=> ( ~ leq(host(X2),host(X3))
=> ( ( ( index(ldr,host(X2)) = host(X3)
& index(status,host(X2)) = norm )
| ( index(status,host(X2)) = wait
& host(X3) = host(index(elid,host(X2))) ) )
=> ( ( ! [X4] :
( host(X2) = host(X4)
=> leq(X4,X1) )
& ~ setIn(X1,pids)
& host(X2) = host(X1) )
=> ( host(X1) != s(zero)
=> ! [X4] :
( host(X2) = host(X4)
=> ! [X8,X9] :
( host(X2) != host(X9)
=> ! [X10] :
( ( ( ( X4 != X2
& setIn(X4,alive) )
| X4 = X1 )
& ( ( X9 != X2
& setIn(X9,alive) )
| X9 = X1 )
& host(X9) != host(X4)
& host(X8) = host(X4)
& host(X10) = host(X9) )
=> ~ ( elem(m_Down(X10),X0)
& elem(m_Down(X8),queue(host(X9))) ) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f67]) ).
fof(f69,plain,
~ ! [X0,X1,X2,X3] :
( ( ! [X4,X5] :
( setIn(X5,alive)
=> ~ elem(m_Down(X5),queue(host(X4))) )
& ! [X6,X7] :
( elem(m_Down(X7),queue(host(X6)))
=> ~ setIn(X7,alive) )
& ! [X8,X9] :
( elem(m_Down(X9),queue(host(X8)))
=> host(X9) != host(X8) )
& ! [X10,X11] :
( elem(m_Halt(X11),queue(host(X10)))
=> ~ leq(host(X10),host(X11)) )
& ! [X12,X13,X14] :
( elem(m_Ack(X14,X12),queue(host(X13)))
=> ~ leq(host(X12),host(X14)) )
& ! [X15,X16] :
( ( ~ setIn(X15,alive)
& leq(X16,X15)
& host(X15) = host(X16) )
=> ~ setIn(X16,alive) )
& ! [X17,X18] :
( ( X17 != X18
& host(X17) = host(X18) )
=> ( ~ setIn(X17,alive)
| ~ setIn(X18,alive) ) )
& ! [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))) ) )
& queue(host(X2)) = cons(m_Down(X3),X0) )
=> ( setIn(X2,alive)
=> ( ~ leq(host(X2),host(X3))
=> ( ( ( index(ldr,host(X2)) = host(X3)
& index(status,host(X2)) = norm )
| ( index(status,host(X2)) = wait
& host(X3) = host(index(elid,host(X2))) ) )
=> ( ( ! [X23] :
( host(X2) = host(X23)
=> leq(X23,X1) )
& ~ setIn(X1,pids)
& host(X2) = host(X1) )
=> ( host(X1) != s(zero)
=> ! [X24] :
( host(X2) = host(X24)
=> ! [X25,X26] :
( host(X2) != host(X26)
=> ! [X27] :
( ( ( ( X2 != X24
& setIn(X24,alive) )
| X1 = X24 )
& ( ( X2 != X26
& setIn(X26,alive) )
| X1 = X26 )
& host(X24) != host(X26)
& host(X24) = host(X25)
& host(X26) = host(X27) )
=> ~ ( elem(m_Down(X27),X0)
& elem(m_Down(X25),queue(host(X26))) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f68]) ).
fof(f85,plain,
? [X0,X1,X2,X3] :
( ? [X24] :
( ? [X25,X26] :
( ? [X27] :
( elem(m_Down(X27),X0)
& elem(m_Down(X25),queue(host(X26)))
& ( ( X2 != X24
& setIn(X24,alive) )
| X1 = X24 )
& ( ( X2 != X26
& setIn(X26,alive) )
| X1 = X26 )
& host(X24) != host(X26)
& host(X24) = host(X25)
& host(X26) = host(X27) )
& host(X2) != host(X26) )
& host(X2) = host(X24) )
& host(X1) != s(zero)
& ! [X23] :
( leq(X23,X1)
| host(X2) != host(X23) )
& ~ setIn(X1,pids)
& host(X2) = host(X1)
& ( ( index(ldr,host(X2)) = host(X3)
& index(status,host(X2)) = norm )
| ( index(status,host(X2)) = wait
& host(X3) = host(index(elid,host(X2))) ) )
& ~ leq(host(X2),host(X3))
& setIn(X2,alive)
& ! [X4,X5] :
( ~ elem(m_Down(X5),queue(host(X4)))
| ~ setIn(X5,alive) )
& ! [X6,X7] :
( ~ setIn(X7,alive)
| ~ elem(m_Down(X7),queue(host(X6))) )
& ! [X8,X9] :
( host(X9) != host(X8)
| ~ elem(m_Down(X9),queue(host(X8))) )
& ! [X10,X11] :
( ~ leq(host(X10),host(X11))
| ~ elem(m_Halt(X11),queue(host(X10))) )
& ! [X12,X13,X14] :
( ~ leq(host(X12),host(X14))
| ~ elem(m_Ack(X14,X12),queue(host(X13))) )
& ! [X15,X16] :
( ~ setIn(X16,alive)
| setIn(X15,alive)
| ~ leq(X16,X15)
| host(X15) != host(X16) )
& ! [X17,X18] :
( ~ setIn(X17,alive)
| ~ setIn(X18,alive)
| X17 = X18
| host(X17) != 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) )
& queue(host(X2)) = cons(m_Down(X3),X0) ),
inference(ennf_transformation,[],[f69]) ).
fof(f86,plain,
? [X0,X1,X2,X3] :
( ? [X24] :
( ? [X25,X26] :
( ? [X27] :
( elem(m_Down(X27),X0)
& elem(m_Down(X25),queue(host(X26)))
& ( ( X2 != X24
& setIn(X24,alive) )
| X1 = X24 )
& ( ( X2 != X26
& setIn(X26,alive) )
| X1 = X26 )
& host(X24) != host(X26)
& host(X24) = host(X25)
& host(X26) = host(X27) )
& host(X2) != host(X26) )
& host(X2) = host(X24) )
& host(X1) != s(zero)
& ! [X23] :
( leq(X23,X1)
| host(X2) != host(X23) )
& ~ setIn(X1,pids)
& host(X2) = host(X1)
& ( ( index(ldr,host(X2)) = host(X3)
& index(status,host(X2)) = norm )
| ( index(status,host(X2)) = wait
& host(X3) = host(index(elid,host(X2))) ) )
& ~ leq(host(X2),host(X3))
& setIn(X2,alive)
& ! [X4,X5] :
( ~ elem(m_Down(X5),queue(host(X4)))
| ~ setIn(X5,alive) )
& ! [X6,X7] :
( ~ setIn(X7,alive)
| ~ elem(m_Down(X7),queue(host(X6))) )
& ! [X8,X9] :
( host(X9) != host(X8)
| ~ elem(m_Down(X9),queue(host(X8))) )
& ! [X10,X11] :
( ~ leq(host(X10),host(X11))
| ~ elem(m_Halt(X11),queue(host(X10))) )
& ! [X12,X13,X14] :
( ~ leq(host(X12),host(X14))
| ~ elem(m_Ack(X14,X12),queue(host(X13))) )
& ! [X15,X16] :
( ~ setIn(X16,alive)
| setIn(X15,alive)
| ~ leq(X16,X15)
| host(X15) != host(X16) )
& ! [X17,X18] :
( ~ setIn(X17,alive)
| ~ setIn(X18,alive)
| X17 = X18
| host(X17) != 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) )
& queue(host(X2)) = cons(m_Down(X3),X0) ),
inference(flattening,[],[f85]) ).
fof(f92,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(f93,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,[],[f92]) ).
fof(f112,plain,
? [X0,X1,X2,X3] :
( ? [X4] :
( ? [X5,X6] :
( ? [X7] :
( elem(m_Down(X7),X0)
& elem(m_Down(X5),queue(host(X6)))
& ( ( X2 != X4
& setIn(X4,alive) )
| X1 = X4 )
& ( ( X2 != X6
& setIn(X6,alive) )
| X1 = X6 )
& host(X4) != host(X6)
& host(X4) = host(X5)
& host(X6) = host(X7) )
& host(X2) != host(X6) )
& host(X2) = host(X4) )
& host(X1) != s(zero)
& ! [X8] :
( leq(X8,X1)
| host(X2) != host(X8) )
& ~ setIn(X1,pids)
& host(X2) = host(X1)
& ( ( index(ldr,host(X2)) = host(X3)
& index(status,host(X2)) = norm )
| ( index(status,host(X2)) = wait
& host(X3) = host(index(elid,host(X2))) ) )
& ~ leq(host(X2),host(X3))
& setIn(X2,alive)
& ! [X9,X10] :
( ~ elem(m_Down(X10),queue(host(X9)))
| ~ setIn(X10,alive) )
& ! [X11,X12] :
( ~ setIn(X12,alive)
| ~ elem(m_Down(X12),queue(host(X11))) )
& ! [X13,X14] :
( host(X13) != host(X14)
| ~ elem(m_Down(X14),queue(host(X13))) )
& ! [X15,X16] :
( ~ leq(host(X15),host(X16))
| ~ elem(m_Halt(X16),queue(host(X15))) )
& ! [X17,X18,X19] :
( ~ leq(host(X17),host(X19))
| ~ elem(m_Ack(X19,X17),queue(host(X18))) )
& ! [X20,X21] :
( ~ setIn(X21,alive)
| setIn(X20,alive)
| ~ leq(X21,X20)
| host(X21) != host(X20) )
& ! [X22,X23] :
( ~ setIn(X22,alive)
| ~ setIn(X23,alive)
| X22 = X23
| host(X22) != 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(X24) != host(X25)
| host(X26) != host(X27) )
& queue(host(X2)) = cons(m_Down(X3),X0) ),
inference(rectify,[],[f86]) ).
fof(f113,plain,
( elem(m_Down(sK10),sK3)
& elem(m_Down(sK8),queue(host(sK9)))
& ( ( sK5 != sK7
& setIn(sK7,alive) )
| sK4 = sK7 )
& ( ( sK5 != sK9
& setIn(sK9,alive) )
| sK4 = sK9 )
& host(sK9) != host(sK7)
& host(sK7) = host(sK8)
& host(sK9) = host(sK10)
& host(sK9) != host(sK5)
& host(sK7) = host(sK5)
& s(zero) != host(sK4)
& ! [X8] :
( leq(X8,sK4)
| host(X8) != host(sK5) )
& ~ setIn(sK4,pids)
& host(sK5) = host(sK4)
& ( ( host(sK6) = index(ldr,host(sK5))
& norm = index(status,host(sK5)) )
| ( wait = index(status,host(sK5))
& host(sK6) = host(index(elid,host(sK5))) ) )
& ~ leq(host(sK5),host(sK6))
& setIn(sK5,alive)
& ! [X9,X10] :
( ~ elem(m_Down(X10),queue(host(X9)))
| ~ setIn(X10,alive) )
& ! [X11,X12] :
( ~ setIn(X12,alive)
| ~ elem(m_Down(X12),queue(host(X11))) )
& ! [X13,X14] :
( host(X13) != host(X14)
| ~ elem(m_Down(X14),queue(host(X13))) )
& ! [X15,X16] :
( ~ leq(host(X15),host(X16))
| ~ elem(m_Halt(X16),queue(host(X15))) )
& ! [X17,X18,X19] :
( ~ leq(host(X17),host(X19))
| ~ elem(m_Ack(X19,X17),queue(host(X18))) )
& ! [X20,X21] :
( ~ setIn(X21,alive)
| setIn(X20,alive)
| ~ leq(X21,X20)
| host(X21) != host(X20) )
& ! [X22,X23] :
( ~ setIn(X22,alive)
| ~ setIn(X23,alive)
| X22 = X23
| host(X22) != 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(X24) != host(X25)
| host(X26) != host(X27) )
& queue(host(sK5)) = cons(m_Down(sK6),sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6,sK7,sK8,sK9,sK10]),skolemize(X0,sK3),skolemize(X1,sK4),skolemize(X2,sK5),skolemize(X3,sK6),skolemize(X4,sK7),skolemize(X5,sK8),skolemize(X6,sK9),skolemize(X7,sK10)],[f112]) ).
fof(f167,plain,
! [X2,X0,X1] :
( elem(X0,cons(X1,X2))
| ~ elem(X0,X2) ),
inference(cnf_transformation,[],[f93]) ).
fof(f210,plain,
queue(host(sK5)) = cons(m_Down(sK6),sK3),
inference(cnf_transformation,[],[f113]) ).
fof(f211,plain,
! [X26,X27,X24,X25] :
( ~ setIn(X24,alive)
| ~ elem(m_Down(X25),queue(host(X26)))
| host(X24) = host(X26)
| ~ elem(m_Down(X27),queue(host(X24)))
| ~ setIn(X26,alive)
| host(X24) != host(X25)
| host(X26) != host(X27) ),
inference(cnf_transformation,[],[f113]) ).
fof(f212,plain,
! [X22,X23] :
( ~ setIn(X22,alive)
| ~ setIn(X23,alive)
| X22 = X23
| host(X22) != host(X23) ),
inference(cnf_transformation,[],[f113]) ).
fof(f219,plain,
setIn(sK5,alive),
inference(cnf_transformation,[],[f113]) ).
fof(f225,plain,
host(sK5) = host(sK4),
inference(cnf_transformation,[],[f113]) ).
fof(f229,plain,
host(sK7) = host(sK5),
inference(cnf_transformation,[],[f113]) ).
fof(f230,plain,
host(sK9) != host(sK5),
inference(cnf_transformation,[],[f113]) ).
fof(f231,plain,
host(sK9) = host(sK10),
inference(cnf_transformation,[],[f113]) ).
fof(f232,plain,
host(sK7) = host(sK8),
inference(cnf_transformation,[],[f113]) ).
fof(f234,plain,
( setIn(sK9,alive)
| sK4 = sK9 ),
inference(cnf_transformation,[],[f113]) ).
fof(f236,plain,
( setIn(sK7,alive)
| sK4 = sK7 ),
inference(cnf_transformation,[],[f113]) ).
fof(f237,plain,
( sK5 != sK7
| sK4 = sK7 ),
inference(cnf_transformation,[],[f113]) ).
fof(f238,plain,
elem(m_Down(sK8),queue(host(sK9))),
inference(cnf_transformation,[],[f113]) ).
fof(f239,plain,
elem(m_Down(sK10),sK3),
inference(cnf_transformation,[],[f113]) ).
fof(f274,definition,
( spl11_5
<=> sK4 = sK9 ),
introduced(definition,[new_symbols(definition,[spl11_5])],[avatar_definition]) ).
fof(f276,plain,
( sK4 = sK9
| ~ spl11_5 ),
inference(avatar_component_clause,[],[f274]) ).
fof(f278,definition,
( spl11_6
<=> setIn(sK9,alive) ),
introduced(definition,[new_symbols(definition,[spl11_6])],[avatar_definition]) ).
fof(f280,plain,
( setIn(sK9,alive)
| ~ spl11_6 ),
inference(avatar_component_clause,[],[f278]) ).
fof(f281,plain,
( spl11_5
| spl11_6 ),
inference(avatar_split_clause,[],[f234,f278,f274]) ).
fof(f288,definition,
( spl11_8
<=> sK4 = sK7 ),
introduced(definition,[new_symbols(definition,[spl11_8])],[avatar_definition]) ).
fof(f290,plain,
( sK4 = sK7
| ~ spl11_8 ),
inference(avatar_component_clause,[],[f288]) ).
fof(f292,definition,
( spl11_9
<=> setIn(sK7,alive) ),
introduced(definition,[new_symbols(definition,[spl11_9])],[avatar_definition]) ).
fof(f294,plain,
( setIn(sK7,alive)
| ~ spl11_9 ),
inference(avatar_component_clause,[],[f292]) ).
fof(f295,plain,
( spl11_8
| spl11_9 ),
inference(avatar_split_clause,[],[f236,f292,f288]) ).
fof(f297,definition,
( spl11_10
<=> sK5 = sK7 ),
introduced(definition,[new_symbols(definition,[spl11_10])],[avatar_definition]) ).
fof(f300,plain,
( spl11_8
| ~ spl11_10 ),
inference(avatar_split_clause,[],[f237,f297,f288]) ).
fof(f303,plain,
( host(sK5) != host(sK4)
| ~ spl11_5 ),
inference(forward_demodulation,[],[f230,f276]) ).
fof(f304,plain,
( $false
| ~ spl11_5 ),
inference(forward_subsumption_resolution,[],[f303,f225]) ).
fof(f305,plain,
~ spl11_5,
inference(avatar_contradiction_clause,[],[f304]) ).
fof(f306,plain,
( host(sK8) = host(sK4)
| ~ spl11_8 ),
inference(forward_demodulation,[],[f232,f290]) ).
fof(f307,plain,
( host(sK8) = host(sK5)
| ~ spl11_8 ),
inference(forward_demodulation,[],[f306,f225]) ).
fof(f329,plain,
! [X0] :
( ~ setIn(X0,alive)
| sK5 = X0
| host(X0) != host(sK5) ),
inference(resolution,[],[f212,f219]) ).
fof(f351,plain,
( ! [X2,X0,X1] :
( ~ elem(m_Down(X2),queue(host(sK9)))
| host(X1) = host(sK9)
| ~ elem(m_Down(X0),queue(host(X1)))
| ~ setIn(X1,alive)
| host(X0) != host(sK9)
| host(X1) != host(X2) )
| ~ spl11_6 ),
inference(resolution,[],[f211,f280]) ).
fof(f368,plain,
( ! [X0,X1] :
( host(X0) = host(sK9)
| ~ elem(m_Down(X1),queue(host(X0)))
| ~ setIn(X0,alive)
| host(X1) != host(sK9)
| host(X0) != host(sK8) )
| ~ spl11_6 ),
inference(resolution,[],[f351,f238]) ).
fof(f371,plain,
( ! [X0,X1] :
( ~ setIn(X0,alive)
| host(X0) = host(sK9)
| ~ elem(m_Down(X1),queue(host(X0)))
| host(X0) != host(sK5)
| host(X1) != host(sK9) )
| ~ spl11_6
| ~ spl11_8 ),
inference(forward_demodulation,[],[f368,f307]) ).
fof(f375,plain,
( ! [X0] :
( host(sK9) = host(sK5)
| ~ elem(m_Down(X0),queue(host(sK5)))
| host(sK5) != host(sK5)
| host(X0) != host(sK9) )
| ~ spl11_6
| ~ spl11_8 ),
inference(resolution,[],[f371,f219]) ).
fof(f378,plain,
( ! [X0] :
( host(sK9) = host(sK5)
| ~ elem(m_Down(X0),queue(host(sK5)))
| host(X0) != host(sK9) )
| ~ spl11_6
| ~ spl11_8 ),
inference(trivial_inequality_removal,[],[f375]) ).
fof(f380,plain,
( ! [X0] :
( ~ elem(m_Down(X0),queue(host(sK5)))
| host(X0) != host(sK9) )
| ~ spl11_6
| ~ spl11_8 ),
inference(forward_subsumption_resolution,[],[f378,f230]) ).
fof(f511,plain,
! [X0] :
( ~ elem(X0,sK3)
| elem(X0,queue(host(sK5))) ),
inference(superposition,[],[f167,f210]) ).
fof(f513,plain,
elem(m_Down(sK10),queue(host(sK5))),
inference(resolution,[],[f511,f239]) ).
fof(f514,plain,
( host(sK9) != host(sK10)
| ~ spl11_6
| ~ spl11_8 ),
inference(resolution,[],[f513,f380]) ).
fof(f519,plain,
( $false
| ~ spl11_6
| ~ spl11_8 ),
inference(forward_subsumption_resolution,[],[f514,f231]) ).
fof(f520,plain,
( ~ spl11_6
| ~ spl11_8 ),
inference(avatar_contradiction_clause,[],[f519]) ).
fof(f525,plain,
( sK5 = sK7
| host(sK7) != host(sK5)
| ~ spl11_9 ),
inference(resolution,[],[f294,f329]) ).
fof(f529,definition,
( spl11_26
<=> host(sK7) = host(sK5) ),
introduced(definition,[new_symbols(definition,[spl11_26])],[avatar_definition]) ).
fof(f532,plain,
( ~ spl11_26
| spl11_10
| ~ spl11_9 ),
inference(avatar_split_clause,[],[f525,f292,f297,f529]) ).
fof(f542,plain,
spl11_26,
inference(avatar_split_clause,[],[f229,f529]) ).
cnf(s5,plain,
( spl11_5
| spl11_6 ),
inference(sat_conversion,[],[f281]) ).
cnf(s7,plain,
( spl11_8
| spl11_9 ),
inference(sat_conversion,[],[f295]) ).
cnf(s8,plain,
( spl11_8
| ~ spl11_10 ),
inference(sat_conversion,[],[f300]) ).
cnf(s9,plain,
~ spl11_5,
inference(sat_conversion,[],[f305]) ).
cnf(s18,plain,
( ~ spl11_6
| ~ spl11_8 ),
inference(sat_conversion,[],[f520]) ).
cnf(s20,plain,
( ~ spl11_9
| spl11_10
| ~ spl11_26 ),
inference(sat_conversion,[],[f532]) ).
cnf(s22,plain,
spl11_26,
inference(sat_conversion,[],[f542]) ).
cnf(s23,plain,
( ~ spl11_9
| spl11_10 ),
inference(rat,[],[s20,s22]) ).
cnf(s25,plain,
spl11_6,
inference(rat,[],[s5,s9]) ).
cnf(s26,plain,
~ spl11_8,
inference(rat,[],[s18,s25]) ).
cnf(s27,plain,
~ spl11_10,
inference(rat,[],[s8,s26]) ).
cnf(s28,plain,
spl11_9,
inference(rat,[],[s7,s26]) ).
cnf(s29,plain,
$false,
inference(rat,[],[s23,s27,s28]) ).
fof(f543,plain,
$false,
inference(avatar_sat_refutation,[],[s29]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV452+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.18 % Computer : n011.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Mon Sep 28 11:08:31 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running first-order theorem proving
% 0.08/0.22 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.99/1.10 % (3326649)Detected formulas, will run a generic FOF schedule.
% 2.99/1.10 % (3326689)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2369692495:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.99/1.10 % (3326689)Instruction limit reached!
% 2.99/1.10 % (3326689)------------------------------
% 2.99/1.10 % (3326689)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.99/1.10 % (3326689)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.99/1.10 % (3326689)CaDiCaL version: 2.1.3
% 2.99/1.10 % (3326689)Termination reason: Instruction limit
% 2.99/1.10 % (3326689)Termination phase: Saturation
% 2.99/1.10 % (3326689)Time elapsed: 0.037 s
% 2.99/1.10 % (3326689)Peak memory usage: 88 MB
% 2.99/1.10 % (3326689)Instructions burned: 122 (million)
% 2.99/1.10 % (3326690)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2629118675:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.99/1.10 % (3326685)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=2074194587:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.99/1.10 % (3326688)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=4154992608:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.99/1.10 % (3326686)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=2827690255:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.99/1.10 % (3326687)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=2174464052:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.99/1.10 % (3326691)dis-21_1_sil=8000:lcm=predicate:random_seed=4217126334: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)
% 2.99/1.10 % (3326690)First to succeed.
% 2.99/1.10 % (3326690)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3326649"
% 2.99/1.10 % (3326688)Also succeeded, but the first one will report.
% 2.99/1.10 % (3326691)Instruction limit reached!
% 2.99/1.10 % (3326691)------------------------------
% 2.99/1.10 % (3326691)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.99/1.10 % (3326691)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.99/1.10 % (3326691)CaDiCaL version: 2.1.3
% 2.99/1.10 % (3326691)Termination reason: Instruction limit
% 2.99/1.10 % (3326691)Termination phase: Saturation
% 2.99/1.10 % (3326691)Time elapsed: 0.062 s
% 2.99/1.10 % (3326691)Peak memory usage: 89 MB
% 2.99/1.10 % (3326691)Instructions burned: 131 (million)
% 2.99/1.10 % (3326693)lrs+10_1_sil=8000:sp=occurrence:random_seed=2695051924:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 2.99/1.10 % (3326693)Also succeeded, but the first one will report.
% 2.99/1.10 % (3326700)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2252246174:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.99/1.10 % (3326700)Also succeeded, but the first one will report.
% 2.99/1.10 % (3326690)Refutation found. Thanks to Tanya!
% 2.99/1.10 % SZS status Theorem for theBenchmark
% 2.99/1.10 % SZS output start Proof for theBenchmark
% See solution above
% 3.56/1.19 % (3326690)------------------------------
% 3.56/1.19 % (3326690)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.56/1.19 % (3326690)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.56/1.19 % (3326690)CaDiCaL version: 2.1.3
% 3.56/1.19 % (3326690)Termination reason: Refutation
% 3.56/1.19 % (3326690)Time elapsed: 0.015 s
% 3.56/1.19 % (3326690)Peak memory usage: 90 MB
% 3.56/1.19 % (3326690)Instructions burned: 21 (million)
% 3.56/1.19 % (3326690)------------------------------
% 3.56/1.19 % (3326690)------------------------------
% 3.56/1.19 % (3326649)Success in time 0.431 s
% 3.56/1.19 % Vampire exiting
%------------------------------------------------------------------------------