%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV450+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n007.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:18 PM UTC 2026
% Result : Theorem 0.64s 0.47s
% Output : Refutation 0.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 7
% Syntax : Number of formulae : 65 ( 25 unt; 3 def)
% Number of atoms : 448 ( 178 equ)
% Maximal formula atoms : 44 ( 6 avg)
% Number of connectives : 616 ( 233 ~; 147 |; 177 &)
% ( 5 <=>; 54 =>; 0 <=; 0 <~>)
% Maximal formula depth : 35 ( 7 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 8 ( 6 usr; 4 prp; 0-2 aty)
% Number of functors : 25 ( 25 usr; 16 con; 0-2 aty)
% Number of variables : 236 ( 0 sgn 209 !; 27 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f19,axiom,
! [X0,X1] : m_Down(X0) != m_Ldr(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_18) ).
fof(f47,axiom,
! [X0,X1,X2] :
( elem(X0,cons(X1,X2))
<=> ( X0 = X1
| elem(X0,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_46) ).
fof(f48,axiom,
! [X0,X1,X2] :
( elem(X0,snoc(X2,X1))
<=> ( X0 = X1
| elem(X0,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_47) ).
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_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] :
( ( setIn(host(X4),index(acks,host(X2)))
| host(X4) = host(X3) )
=> ! [X8] :
( host(X4) != host(X8)
=> ( host(X2) = host(X8)
=> ! [X9,X10] :
( host(X4) = host(X10)
=> ( host(X2) != host(X10)
=> ! [X11] :
( ( host(X10) != host(X8)
& setIn(X8,alive)
& setIn(X10,alive)
& host(X9) = host(X8)
& host(X11) = host(X10) )
=> ~ ( elem(m_Down(X11),X0)
& elem(m_Down(X9),snoc(queue(host(X10)),m_Ldr(X2))) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/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_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] :
( ( setIn(host(X4),index(acks,host(X2)))
| host(X4) = host(X3) )
=> ! [X8] :
( host(X4) != host(X8)
=> ( host(X2) = host(X8)
=> ! [X9,X10] :
( host(X4) = host(X10)
=> ( host(X2) != host(X10)
=> ! [X11] :
( ( host(X10) != host(X8)
& setIn(X8,alive)
& setIn(X10,alive)
& host(X9) = host(X8)
& host(X11) = host(X10) )
=> ~ ( elem(m_Down(X11),X0)
& elem(m_Down(X9),snoc(queue(host(X10)),m_Ldr(X2))) ) ) ) ) ) ) ) ) ) ) ),
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(X8) != host(X9) )
& ! [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_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)))
=> ! [X23] :
( ( setIn(host(X23),index(acks,host(X2)))
| host(X3) = host(X23) )
=> ! [X24] :
( host(X23) != host(X24)
=> ( host(X2) = host(X24)
=> ! [X25,X26] :
( host(X23) = 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),snoc(queue(host(X26)),m_Ldr(X2))) ) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f68]) ).
fof(f85,plain,
? [X0,X1,X2,X3] :
( ? [X23] :
( ? [X24] :
( ? [X25,X26] :
( ? [X27] :
( elem(m_Down(X27),X0)
& elem(m_Down(X25),snoc(queue(host(X26)),m_Ldr(X2)))
& host(X24) != host(X26)
& setIn(X24,alive)
& setIn(X26,alive)
& host(X24) = host(X25)
& host(X26) = host(X27) )
& host(X2) != host(X26)
& host(X23) = host(X26) )
& host(X2) = host(X24)
& host(X23) != host(X24) )
& ( setIn(host(X23),index(acks,host(X2)))
| host(X3) = host(X23) ) )
& 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] :
( ~ 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(X8) != host(X9)
| ~ 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_Ack(X1,X3),X0) ),
inference(ennf_transformation,[],[f69]) ).
fof(f86,plain,
? [X0,X1,X2,X3] :
( ? [X23] :
( ? [X24] :
( ? [X25,X26] :
( ? [X27] :
( elem(m_Down(X27),X0)
& elem(m_Down(X25),snoc(queue(host(X26)),m_Ldr(X2)))
& host(X24) != host(X26)
& setIn(X24,alive)
& setIn(X26,alive)
& host(X24) = host(X25)
& host(X26) = host(X27) )
& host(X2) != host(X26)
& host(X23) = host(X26) )
& host(X2) = host(X24)
& host(X23) != host(X24) )
& ( setIn(host(X23),index(acks,host(X2)))
| host(X3) = host(X23) ) )
& 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] :
( ~ 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(X8) != host(X9)
| ~ 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_Ack(X1,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(f94,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(f95,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,[],[f94]) ).
fof(f112,plain,
? [X0,X1,X2,X3] :
( ? [X4] :
( ? [X5] :
( ? [X6,X7] :
( ? [X8] :
( elem(m_Down(X8),X0)
& elem(m_Down(X6),snoc(queue(host(X7)),m_Ldr(X2)))
& host(X5) != host(X7)
& setIn(X5,alive)
& setIn(X7,alive)
& host(X5) = host(X6)
& host(X7) = host(X8) )
& host(X2) != host(X7)
& host(X4) = host(X7) )
& host(X2) = host(X5)
& host(X4) != host(X5) )
& ( setIn(host(X4),index(acks,host(X2)))
| host(X4) = host(X3) ) )
& 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] :
( ~ 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_Ack(X1,X3),X0) ),
inference(rectify,[],[f86]) ).
fof(f113,plain,
( elem(m_Down(sK11),sK3)
& elem(m_Down(sK9),snoc(queue(host(sK10)),m_Ldr(sK5)))
& host(sK10) != host(sK8)
& setIn(sK8,alive)
& setIn(sK10,alive)
& host(sK8) = host(sK9)
& host(sK10) = host(sK11)
& host(sK10) != host(sK5)
& host(sK10) = host(sK7)
& host(sK8) = host(sK5)
& host(sK8) != host(sK7)
& ( setIn(host(sK7),index(acks,host(sK5)))
| host(sK7) = host(sK6) )
& leq(nbr_proc,index(pendack,host(sK5)))
& sK4 = index(elid,host(sK5))
& elec_2 = index(status,host(sK5))
& host(sK6) = index(pendack,host(sK5))
& 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_Ack(sK4,sK6),sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6,sK7,sK8,sK9,sK10,sK11]),skolemize(X0,sK3),skolemize(X1,sK4),skolemize(X2,sK5),skolemize(X3,sK6),skolemize(X4,sK7),skolemize(X5,sK8),skolemize(X6,sK9),skolemize(X7,sK10),skolemize(X8,sK11)],[f112]) ).
fof(f133,plain,
! [X0,X1] : m_Down(X0) != m_Ldr(X1),
inference(cnf_transformation,[],[f19]) ).
fof(f167,plain,
! [X2,X0,X1] :
( elem(X0,cons(X1,X2))
| ~ elem(X0,X2) ),
inference(cnf_transformation,[],[f93]) ).
fof(f169,plain,
! [X2,X0,X1] :
( ~ elem(X0,snoc(X2,X1))
| elem(X0,X2)
| X0 = X1 ),
inference(cnf_transformation,[],[f95]) ).
fof(f210,plain,
queue(host(sK5)) = cons(m_Ack(sK4,sK6),sK3),
inference(cnf_transformation,[],[f113]) ).
fof(f211,plain,
! [X26,X27,X24,X25] :
( host(X26) != host(X27)
| ~ elem(m_Down(X25),queue(host(X26)))
| host(X24) = host(X26)
| ~ setIn(X24,alive)
| ~ setIn(X26,alive)
| host(X24) != host(X25)
| ~ elem(m_Down(X27),queue(host(X24))) ),
inference(cnf_transformation,[],[f113]) ).
fof(f226,plain,
host(sK8) = host(sK5),
inference(cnf_transformation,[],[f113]) ).
fof(f227,plain,
host(sK10) = host(sK7),
inference(cnf_transformation,[],[f113]) ).
fof(f228,plain,
host(sK10) != host(sK5),
inference(cnf_transformation,[],[f113]) ).
fof(f229,plain,
host(sK10) = host(sK11),
inference(cnf_transformation,[],[f113]) ).
fof(f230,plain,
host(sK8) = host(sK9),
inference(cnf_transformation,[],[f113]) ).
fof(f231,plain,
setIn(sK10,alive),
inference(cnf_transformation,[],[f113]) ).
fof(f232,plain,
setIn(sK8,alive),
inference(cnf_transformation,[],[f113]) ).
fof(f234,plain,
elem(m_Down(sK9),snoc(queue(host(sK10)),m_Ldr(sK5))),
inference(cnf_transformation,[],[f113]) ).
fof(f235,plain,
elem(m_Down(sK11),sK3),
inference(cnf_transformation,[],[f113]) ).
fof(f259,plain,
host(sK5) != host(sK7),
inference(forward_demodulation,[],[f228,f227]) ).
fof(f260,plain,
host(sK11) = host(sK7),
inference(forward_demodulation,[],[f229,f227]) ).
fof(f261,plain,
host(sK9) = host(sK5),
inference(forward_demodulation,[],[f230,f226]) ).
fof(f269,plain,
elem(m_Down(sK9),snoc(queue(host(sK7)),m_Ldr(sK5))),
inference(forward_demodulation,[],[f234,f227]) ).
fof(f402,plain,
! [X2,X0,X1] :
( host(X0) != host(sK5)
| ~ elem(m_Down(X1),queue(host(sK5)))
| host(X2) = host(sK5)
| ~ setIn(X2,alive)
| ~ setIn(sK8,alive)
| host(X1) != host(X2)
| ~ elem(m_Down(X0),queue(host(X2))) ),
inference(superposition,[],[f211,f226]) ).
fof(f413,plain,
! [X2,X0,X1] :
( host(X1) != host(X2)
| ~ elem(m_Down(X1),queue(host(sK5)))
| host(X2) = host(sK5)
| ~ setIn(X2,alive)
| host(X0) != host(sK5)
| ~ elem(m_Down(X0),queue(host(X2))) ),
inference(forward_subsumption_resolution,[],[f402,f232]) ).
fof(f457,definition,
( spl12_11
<=> elem(m_Down(sK9),queue(host(sK7))) ),
introduced(definition,[new_symbols(definition,[spl12_11])],[avatar_definition]) ).
fof(f458,plain,
( elem(m_Down(sK9),queue(host(sK7)))
| ~ spl12_11 ),
inference(avatar_component_clause,[],[f457]) ).
fof(f467,definition,
( spl12_13
<=> ! [X1] :
( host(X1) != host(sK7)
| ~ elem(m_Down(X1),queue(host(sK5))) ) ),
introduced(definition,[new_symbols(definition,[spl12_13])],[avatar_definition]) ).
fof(f468,plain,
( ! [X1] :
( host(X1) != host(sK7)
| ~ elem(m_Down(X1),queue(host(sK5))) )
| ~ spl12_13 ),
inference(avatar_component_clause,[],[f467]) ).
fof(f470,definition,
( spl12_14
<=> ! [X0] :
( host(X0) != host(sK5)
| ~ elem(m_Down(X0),queue(host(sK7))) ) ),
introduced(definition,[new_symbols(definition,[spl12_14])],[avatar_definition]) ).
fof(f471,plain,
( ! [X0] :
( host(X0) != host(sK5)
| ~ elem(m_Down(X0),queue(host(sK7))) )
| ~ spl12_14 ),
inference(avatar_component_clause,[],[f470]) ).
fof(f476,plain,
( host(sK7) != host(sK7)
| ~ elem(m_Down(sK11),queue(host(sK5)))
| ~ spl12_13 ),
inference(superposition,[],[f468,f260]) ).
fof(f478,plain,
( ~ elem(m_Down(sK11),queue(host(sK5)))
| ~ spl12_13 ),
inference(trivial_inequality_removal,[],[f476]) ).
fof(f484,plain,
! [X0,X1] :
( host(X0) != host(sK7)
| ~ elem(m_Down(X0),queue(host(sK5)))
| host(sK5) = host(sK7)
| ~ setIn(sK10,alive)
| host(X1) != host(sK5)
| ~ elem(m_Down(X1),queue(host(sK7))) ),
inference(superposition,[],[f413,f227]) ).
fof(f571,plain,
! [X0] :
( elem(X0,queue(host(sK5)))
| ~ elem(X0,sK3) ),
inference(superposition,[],[f167,f210]) ).
fof(f576,plain,
( ~ elem(m_Down(sK11),sK3)
| ~ spl12_13 ),
inference(resolution,[],[f571,f478]) ).
fof(f581,plain,
( $false
| ~ spl12_13 ),
inference(forward_subsumption_resolution,[],[f576,f235]) ).
fof(f582,plain,
~ spl12_13,
inference(avatar_contradiction_clause,[],[f581]) ).
fof(f584,plain,
! [X0,X1] :
( host(X0) != host(sK7)
| ~ elem(m_Down(X0),queue(host(sK5)))
| ~ setIn(sK10,alive)
| host(X1) != host(sK5)
| ~ elem(m_Down(X1),queue(host(sK7))) ),
inference(forward_subsumption_resolution,[],[f484,f259]) ).
fof(f604,plain,
! [X0,X1] :
( host(X0) != host(sK7)
| ~ elem(m_Down(X0),queue(host(sK5)))
| host(X1) != host(sK5)
| ~ elem(m_Down(X1),queue(host(sK7))) ),
inference(forward_subsumption_resolution,[],[f584,f231]) ).
fof(f611,plain,
( spl12_14
| spl12_13 ),
inference(avatar_split_clause,[],[f604,f467,f470]) ).
fof(f940,plain,
( elem(m_Down(sK9),queue(host(sK7)))
| m_Down(sK9) = m_Ldr(sK5) ),
inference(resolution,[],[f169,f269]) ).
fof(f950,plain,
elem(m_Down(sK9),queue(host(sK7))),
inference(forward_subsumption_resolution,[],[f940,f133]) ).
fof(f952,plain,
spl12_11,
inference(avatar_split_clause,[],[f950,f457]) ).
fof(f2646,plain,
( host(sK5) != host(sK5)
| ~ elem(m_Down(sK9),queue(host(sK7)))
| ~ spl12_14 ),
inference(superposition,[],[f471,f261]) ).
fof(f2650,plain,
( ~ elem(m_Down(sK9),queue(host(sK7)))
| ~ spl12_14 ),
inference(trivial_inequality_removal,[],[f2646]) ).
fof(f2652,plain,
( $false
| ~ spl12_11
| ~ spl12_14 ),
inference(forward_subsumption_resolution,[],[f2650,f458]) ).
fof(f2653,plain,
( ~ spl12_11
| ~ spl12_14 ),
inference(avatar_contradiction_clause,[],[f2652]) ).
cnf(s12,plain,
~ spl12_13,
inference(sat_conversion,[],[f582]) ).
cnf(s17,plain,
( spl12_13
| spl12_14 ),
inference(sat_conversion,[],[f611]) ).
cnf(s51,plain,
spl12_11,
inference(sat_conversion,[],[f952]) ).
cnf(s160,plain,
( ~ spl12_11
| ~ spl12_14 ),
inference(sat_conversion,[],[f2653]) ).
cnf(s169,plain,
~ spl12_14,
inference(rat,[],[s160,s51]) ).
cnf(s179,plain,
spl12_13,
inference(rat,[],[s17,s169]) ).
cnf(s181,plain,
$false,
inference(rat,[],[s12,s179]) ).
fof(f2655,plain,
$false,
inference(avatar_sat_refutation,[],[s181]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWV450+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.25 % Computer : n007.cluster.edu
% 0.12/0.25 % Model : x86_64 x86_64
% 0.12/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.25 % Memory : 8046.5625MB
% 0.12/0.25 % OS : Linux 6.8.0-71-generic
% 0.12/0.25 % CPULimit : 300
% 0.12/0.25 % WCLimit : 300
% 0.12/0.25 % DateTime : Mon Sep 28 11:06:40 UTC 2026
% 0.12/0.26 % CPUTime :
% 0.12/0.26 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.25/0.31 Running first-order model finding
% 0.25/0.31 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.64/0.47 % (2323987)Will run a generic schedule for satisfiability detection.
% 0.64/0.47 % (2323993)% WARNING: option uhcvi not known.
% 0.64/0.47 % (2323994)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4167441882:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.64/0.47 % (2323993)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=664836780:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.64/0.47 % (2323992)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=653119991_2999 on theBenchmark for (2999ds/0Mi)
% 0.64/0.47 % (2323998)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=486530839:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.64/0.47 % (2323995)dis+10_1_sil=32000:sp=arity:random_seed=3041043549:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.64/0.47 % (2323996)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=601355599:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.64/0.47 % (2323997)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4175900968:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.64/0.47 % Detected minimum model sizes of [4]
% 0.64/0.47 % Detected maximum model sizes of [max]
% 0.64/0.47 % TRYING [4]
% 0.64/0.47 % TRYING [5]
% 0.64/0.47 % (2323995) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2323987-2323995"...
% 0.64/0.47 % (2323996)Instruction limit reached!
% 0.64/0.47 % (2323996)------------------------------
% 0.64/0.47 % (2323996)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.64/0.47 % (2323996)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.64/0.47 % (2323996)CaDiCaL version: 2.1.3
% 0.64/0.47 % (2323996)Termination reason: Instruction limit
% 0.64/0.47 % (2323996)Termination phase: Saturation
% 0.64/0.47 % (2323996)Time elapsed: 0.105 s
% 0.64/0.47 % (2323996)Peak memory usage: 12 MB
% 0.64/0.47 % (2323996)Instructions burned: 116 (million)
% 0.64/0.47 % (2323995)...printing done.
% 0.64/0.47 % (2323995)Refutation found. Thanks to Tanya!
% 0.64/0.47 % SZS status Theorem for theBenchmark
% 0.64/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.64/0.47 % (2323995)------------------------------
% 0.64/0.47 % (2323995)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.64/0.47 % (2323995)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.64/0.47 % (2323995)CaDiCaL version: 2.1.3
% 0.64/0.47 % (2323995)Termination reason: Refutation
% 0.64/0.47 % (2323995)Time elapsed: 0.107 s
% 0.64/0.47 % (2323995)Peak memory usage: 13 MB
% 0.64/0.47 % (2323995)Instructions burned: 95 (million)
% 0.64/0.47 % (2323987)Success in time 0.149 s
% 0.64/0.47 % Vampire exiting
%------------------------------------------------------------------------------