%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV454+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n026.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:24:19 PM UTC 2026
% Result : Theorem 0.21s 0.28s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 3
% Syntax : Number of formulae : 42 ( 16 unt; 1 def)
% Number of atoms : 431 ( 173 equ)
% Maximal formula atoms : 49 ( 10 avg)
% Number of connectives : 640 ( 251 ~; 144 |; 183 &)
% ( 2 <=>; 60 =>; 0 <=; 0 <~>)
% Maximal formula depth : 34 ( 8 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 2 prp; 0-2 aty)
% Number of functors : 25 ( 25 usr; 17 con; 0-2 aty)
% Number of variables : 213 ( 2 sgn 192 !; 21 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f47,axiom,
! [X0,X1,X2] :
( elem(X0,cons(X1,X2))
<=> ( X0 = X1
| elem(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',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] :
( ( ~ leq(host(X2),X4)
& leq(s(zero),X4) )
=> ( setIn(X4,index(down,host(X2)))
| X4 = host(X3) ) )
& index(status,host(X2)) = elec_1 )
=> ( ~ leq(nbr_proc,host(X2))
=> ! [X4] :
( s(host(X2)) != host(X4)
=> ( host(X2) = host(X4)
=> ! [X8,X9] :
( s(host(X2)) != host(X9)
=> ( host(X2) != host(X9)
=> ! [X10] :
( ( host(X9) != host(X4)
& setIn(X4,alive)
& setIn(X9,alive)
& 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] :
( ( ~ leq(host(X2),X4)
& leq(s(zero),X4) )
=> ( setIn(X4,index(down,host(X2)))
| X4 = host(X3) ) )
& index(status,host(X2)) = elec_1 )
=> ( ~ leq(nbr_proc,host(X2))
=> ! [X4] :
( s(host(X2)) != host(X4)
=> ( host(X2) = host(X4)
=> ! [X8,X9] :
( s(host(X2)) != host(X9)
=> ( host(X2) != host(X9)
=> ! [X10] :
( ( host(X9) != host(X4)
& setIn(X4,alive)
& setIn(X9,alive)
& 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,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] :
( ( ~ leq(host(X2),X23)
& leq(s(zero),X23) )
=> ( setIn(X23,index(down,host(X2)))
| host(X3) = X23 ) )
& index(status,host(X2)) = elec_1 )
=> ( ~ leq(nbr_proc,host(X2))
=> ! [X24] :
( s(host(X2)) != host(X24)
=> ( host(X2) = host(X24)
=> ! [X25,X26] :
( s(host(X2)) != host(X26)
=> ( host(X2) != host(X26)
=> ! [X27] :
( ( host(X24) != host(X26)
& setIn(X24,alive)
& setIn(X26,alive)
& 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,X2,X3] :
( ? [X24] :
( ? [X25,X26] :
( ? [X27] :
( elem(m_Down(X27),X0)
& 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) )
& host(X2) != host(X26)
& s(host(X2)) != host(X26) )
& host(X2) = host(X24)
& s(host(X2)) != host(X24) )
& ~ leq(nbr_proc,host(X2))
& ! [X23] :
( setIn(X23,index(down,host(X2)))
| host(X3) = X23
| leq(host(X2),X23)
| ~ leq(s(zero),X23) )
& index(status,host(X2)) = elec_1
& ( host(X3) != index(ldr,host(X2))
| norm != index(status,host(X2)) )
& ( wait != index(status,host(X2))
| 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,X2,X3] :
( ? [X24] :
( ? [X25,X26] :
( ? [X27] :
( elem(m_Down(X27),X0)
& 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) )
& host(X2) != host(X26)
& s(host(X2)) != host(X26) )
& host(X2) = host(X24)
& s(host(X2)) != host(X24) )
& ~ leq(nbr_proc,host(X2))
& ! [X23] :
( setIn(X23,index(down,host(X2)))
| host(X3) = X23
| leq(host(X2),X23)
| ~ leq(s(zero),X23) )
& index(status,host(X2)) = elec_1
& ( host(X3) != index(ldr,host(X2))
| norm != index(status,host(X2)) )
& ( wait != index(status,host(X2))
| 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] :
( elem(m_Down(X6),X0)
& elem(m_Down(X4),queue(host(X5)))
& host(X5) != host(X3)
& setIn(X3,alive)
& setIn(X5,alive)
& host(X4) = host(X3)
& host(X5) = host(X6) )
& host(X1) != host(X5)
& host(X5) != s(host(X1)) )
& host(X1) = host(X3)
& host(X3) != s(host(X1)) )
& ~ leq(nbr_proc,host(X1))
& ! [X7] :
( setIn(X7,index(down,host(X1)))
| host(X2) = X7
| leq(host(X1),X7)
| ~ leq(s(zero),X7) )
& elec_1 = index(status,host(X1))
& ( host(X2) != index(ldr,host(X1))
| norm != index(status,host(X1)) )
& ( wait != index(status,host(X1))
| host(X2) != host(index(elid,host(X1))) )
& ~ leq(host(X1),host(X2))
& setIn(X1,alive)
& ! [X8,X9] :
( ~ elem(m_Down(X9),queue(host(X8)))
| ~ setIn(X9,alive) )
& ! [X10,X11] :
( ~ setIn(X11,alive)
| ~ elem(m_Down(X11),queue(host(X10))) )
& ! [X12,X13] :
( host(X13) != host(X12)
| ~ elem(m_Down(X13),queue(host(X12))) )
& ! [X14,X15] :
( ~ leq(host(X14),host(X15))
| ~ elem(m_Halt(X15),queue(host(X14))) )
& ! [X16,X17,X18] :
( ~ leq(host(X16),host(X18))
| ~ elem(m_Ack(X18,X16),queue(host(X17))) )
& ! [X19,X20] :
( ~ setIn(X20,alive)
| setIn(X19,alive)
| ~ leq(X20,X19)
| host(X19) != host(X20) )
& ! [X21,X22] :
( ~ setIn(X21,alive)
| ~ setIn(X22,alive)
| X21 = X22
| host(X21) != host(X22) )
& ! [X23,X24,X25,X26] :
( ~ elem(m_Down(X26),queue(host(X23)))
| ~ elem(m_Down(X24),queue(host(X25)))
| host(X25) = host(X23)
| ~ setIn(X23,alive)
| ~ setIn(X25,alive)
| host(X24) != host(X23)
| host(X26) != host(X25) )
& queue(host(X1)) = cons(m_Down(X2),X0) ),
inference(rectify,[],[f86]) ).
fof(f113,plain,
( elem(m_Down(sK9),sK3)
& elem(m_Down(sK7),queue(host(sK8)))
& host(sK8) != host(sK6)
& setIn(sK6,alive)
& setIn(sK8,alive)
& host(sK6) = host(sK7)
& host(sK8) = host(sK9)
& host(sK8) != host(sK4)
& host(sK8) != s(host(sK4))
& host(sK6) = host(sK4)
& host(sK6) != s(host(sK4))
& ~ leq(nbr_proc,host(sK4))
& ! [X7] :
( setIn(X7,index(down,host(sK4)))
| host(sK5) = X7
| leq(host(sK4),X7)
| ~ leq(s(zero),X7) )
& elec_1 = index(status,host(sK4))
& ( host(sK5) != index(ldr,host(sK4))
| norm != index(status,host(sK4)) )
& ( wait != index(status,host(sK4))
| host(sK5) != host(index(elid,host(sK4))) )
& ~ leq(host(sK4),host(sK5))
& setIn(sK4,alive)
& ! [X8,X9] :
( ~ elem(m_Down(X9),queue(host(X8)))
| ~ setIn(X9,alive) )
& ! [X10,X11] :
( ~ setIn(X11,alive)
| ~ elem(m_Down(X11),queue(host(X10))) )
& ! [X12,X13] :
( host(X13) != host(X12)
| ~ elem(m_Down(X13),queue(host(X12))) )
& ! [X14,X15] :
( ~ leq(host(X14),host(X15))
| ~ elem(m_Halt(X15),queue(host(X14))) )
& ! [X16,X17,X18] :
( ~ leq(host(X16),host(X18))
| ~ elem(m_Ack(X18,X16),queue(host(X17))) )
& ! [X19,X20] :
( ~ setIn(X20,alive)
| setIn(X19,alive)
| ~ leq(X20,X19)
| host(X19) != host(X20) )
& ! [X21,X22] :
( ~ setIn(X21,alive)
| ~ setIn(X22,alive)
| X21 = X22
| host(X21) != host(X22) )
& ! [X23,X24,X25,X26] :
( ~ elem(m_Down(X26),queue(host(X23)))
| ~ elem(m_Down(X24),queue(host(X25)))
| host(X25) = host(X23)
| ~ setIn(X23,alive)
| ~ setIn(X25,alive)
| host(X24) != host(X23)
| host(X26) != host(X25) )
& queue(host(sK4)) = cons(m_Down(sK5),sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6,sK7,sK8,sK9]),skolemize(X0,sK3),skolemize(X1,sK4),skolemize(X2,sK5),skolemize(X3,sK6),skolemize(X4,sK7),skolemize(X5,sK8),skolemize(X6,sK9)],[f112]) ).
fof(f167,plain,
! [X2,X0,X1] :
( elem(X0,cons(X1,X2))
| ~ elem(X0,X2) ),
inference(cnf_transformation,[],[f93]) ).
fof(f210,plain,
queue(host(sK4)) = cons(m_Down(sK5),sK3),
inference(cnf_transformation,[],[f113]) ).
fof(f211,plain,
! [X26,X24,X25,X23] :
( host(X26) != host(X25)
| ~ elem(m_Down(X24),queue(host(X25)))
| host(X25) = host(X23)
| ~ setIn(X23,alive)
| ~ setIn(X25,alive)
| host(X24) != host(X23)
| ~ elem(m_Down(X26),queue(host(X23))) ),
inference(cnf_transformation,[],[f113]) ).
fof(f216,plain,
! [X12,X13] :
( host(X13) != host(X12)
| ~ elem(m_Down(X13),queue(host(X12))) ),
inference(cnf_transformation,[],[f113]) ).
fof(f219,plain,
setIn(sK4,alive),
inference(cnf_transformation,[],[f113]) ).
fof(f227,plain,
host(sK6) = host(sK4),
inference(cnf_transformation,[],[f113]) ).
fof(f230,plain,
host(sK8) = host(sK9),
inference(cnf_transformation,[],[f113]) ).
fof(f231,plain,
host(sK6) = host(sK7),
inference(cnf_transformation,[],[f113]) ).
fof(f232,plain,
setIn(sK8,alive),
inference(cnf_transformation,[],[f113]) ).
fof(f235,plain,
elem(m_Down(sK7),queue(host(sK8))),
inference(cnf_transformation,[],[f113]) ).
fof(f236,plain,
elem(m_Down(sK9),sK3),
inference(cnf_transformation,[],[f113]) ).
fof(f268,plain,
host(sK7) = host(sK4),
inference(forward_demodulation,[],[f231,f227]) ).
fof(f279,plain,
! [X0] :
( host(X0) != host(sK8)
| ~ elem(m_Down(sK9),queue(host(X0))) ),
inference(superposition,[],[f216,f230]) ).
fof(f363,plain,
! [X2,X0,X1] :
( host(X1) != host(X2)
| ~ elem(m_Down(X1),queue(host(X0)))
| host(X0) = host(X2)
| ~ setIn(X2,alive)
| ~ setIn(X0,alive)
| host(X0) != host(sK8)
| ~ elem(m_Down(sK9),queue(host(X2))) ),
inference(superposition,[],[f211,f230]) ).
fof(f377,definition,
( spl10_7
<=> elem(m_Down(sK9),queue(host(sK4))) ),
introduced(definition,[new_symbols(definition,[spl10_7])],[avatar_definition]) ).
fof(f379,plain,
( ~ elem(m_Down(sK9),queue(host(sK4)))
| spl10_7 ),
inference(avatar_component_clause,[],[f377]) ).
fof(f389,plain,
! [X0,X1] :
( host(X1) != host(sK8)
| ~ elem(m_Down(sK7),queue(host(X1)))
| host(X0) = host(X1)
| ~ setIn(X0,alive)
| ~ setIn(X1,alive)
| host(X0) != host(sK4)
| ~ elem(m_Down(sK9),queue(host(X0))) ),
inference(superposition,[],[f363,f268]) ).
fof(f403,plain,
! [X0] :
( ~ elem(m_Down(sK7),queue(host(sK8)))
| host(X0) = host(sK8)
| ~ setIn(X0,alive)
| ~ setIn(sK8,alive)
| host(X0) != host(sK4)
| ~ elem(m_Down(sK9),queue(host(X0))) ),
inference(equality_resolution,[],[f389]) ).
fof(f405,plain,
! [X0] :
( ~ elem(m_Down(sK7),queue(host(sK8)))
| ~ setIn(X0,alive)
| ~ setIn(sK8,alive)
| host(X0) != host(sK4)
| ~ elem(m_Down(sK9),queue(host(X0))) ),
inference(forward_subsumption_resolution,[],[f403,f279]) ).
fof(f406,plain,
! [X0] :
( ~ setIn(X0,alive)
| ~ setIn(sK8,alive)
| host(X0) != host(sK4)
| ~ elem(m_Down(sK9),queue(host(X0))) ),
inference(forward_subsumption_resolution,[],[f405,f235]) ).
fof(f407,plain,
! [X0] :
( host(X0) != host(sK4)
| ~ setIn(X0,alive)
| ~ elem(m_Down(sK9),queue(host(X0))) ),
inference(forward_subsumption_resolution,[],[f406,f232]) ).
fof(f414,plain,
( ~ setIn(sK4,alive)
| ~ elem(m_Down(sK9),queue(host(sK4))) ),
inference(equality_resolution,[],[f407]) ).
fof(f457,plain,
! [X0] :
( elem(X0,queue(host(sK4)))
| ~ elem(X0,sK3) ),
inference(superposition,[],[f167,f210]) ).
fof(f460,plain,
( ~ elem(m_Down(sK9),sK3)
| spl10_7 ),
inference(resolution,[],[f457,f379]) ).
fof(f465,plain,
( $false
| spl10_7 ),
inference(forward_subsumption_resolution,[],[f460,f236]) ).
fof(f466,plain,
spl10_7,
inference(avatar_contradiction_clause,[],[f465]) ).
fof(f469,plain,
~ elem(m_Down(sK9),queue(host(sK4))),
inference(forward_subsumption_resolution,[],[f414,f219]) ).
fof(f472,plain,
~ spl10_7,
inference(avatar_split_clause,[],[f469,f377]) ).
cnf(s7,plain,
spl10_7,
inference(sat_conversion,[],[f466]) ).
cnf(s9,plain,
~ spl10_7,
inference(sat_conversion,[],[f472]) ).
cnf(s11,plain,
$false,
inference(rat,[],[s7,s9]) ).
fof(f473,plain,
$false,
inference(avatar_sat_refutation,[],[s11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV454+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19 % Computer : n026.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Mon Sep 28 11:11:42 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22 Running first-order model finding
% 0.08/0.22 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.28 % (3790069)Will run a generic schedule for satisfiability detection.
% 0.21/0.28 % (3790074)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3234241598_2999 on theBenchmark for (2999ds/0Mi)
% 0.21/0.28 % (3790075)% WARNING: option uhcvi not known.
% 0.21/0.28 % Detected minimum model sizes of [4]
% 0.21/0.28 % Detected maximum model sizes of [max]
% 0.21/0.28 % TRYING [4]
% 0.21/0.28 % (3790078)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1119022674:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.21/0.28 % (3790076)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=46493236:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.21/0.28 % (3790075)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1545436564:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.21/0.28 % (3790077)dis+10_1_sil=32000:sp=arity:random_seed=2589800151:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.21/0.28 % (3790080)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=336246259:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.21/0.28 % (3790079)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3255192701:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.21/0.28 % TRYING [5]
% 0.21/0.28 % (3790077) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3790069-3790077"...
% 0.21/0.28 % (3790077)...printing done.
% 0.21/0.28 % (3790077)Refutation found. Thanks to Tanya!
% 0.21/0.28 % SZS status Theorem for theBenchmark
% 0.21/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.28 % (3790077)------------------------------
% 0.21/0.28 % (3790077)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.28 % (3790077)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.28 % (3790077)CaDiCaL version: 2.1.3
% 0.21/0.28 % (3790077)Termination reason: Refutation
% 0.21/0.28 % (3790077)Time elapsed: 0.013 s
% 0.21/0.28 % (3790077)Peak memory usage: 12 MB
% 0.21/0.28 % (3790077)Instructions burned: 19 (million)
% 0.21/0.28 % (3790069)Success in time 0.05 s
% 0.21/0.28 % Vampire exiting
%------------------------------------------------------------------------------