%------------------------------------------------------------------------------
% File : Vampire---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 THM
% Computer : n009.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:50 PM UTC 2026
% Result : Theorem 3.12s 1.08s
% Output : Refutation 3.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 6
% Syntax : Number of formulae : 62 ( 22 unt; 2 def)
% Number of atoms : 446 ( 177 equ)
% Maximal formula atoms : 44 ( 7 avg)
% Number of connectives : 613 ( 229 ~; 149 |; 177 &)
% ( 4 <=>; 54 =>; 0 <=; 0 <~>)
% Maximal formula depth : 35 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 2 prp; 0-2 aty)
% Number of functors : 25 ( 25 usr; 16 con; 0-2 aty)
% Number of variables : 247 ( 0 sgn 220 !; 27 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f19,axiom,
! [X0,X1] : m_Down(X0) != m_Ldr(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_18) ).
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] :
( 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(f70,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(f71,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,[],[f70]) ).
fof(f77,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,[],[f71]) ).
fof(f78,plain,
( elem(m_Down(sK8),sK0)
& elem(m_Down(sK6),snoc(queue(host(sK7)),m_Ldr(sK2)))
& host(sK7) != host(sK5)
& setIn(sK5,alive)
& setIn(sK7,alive)
& host(sK5) = host(sK6)
& host(sK7) = host(sK8)
& host(sK7) != host(sK2)
& host(sK7) = host(sK4)
& host(sK5) = host(sK2)
& host(sK5) != host(sK4)
& ( setIn(host(sK4),index(acks,host(sK2)))
| host(sK4) = host(sK3) )
& leq(nbr_proc,index(pendack,host(sK2)))
& sK1 = index(elid,host(sK2))
& elec_2 = index(status,host(sK2))
& host(sK3) = index(pendack,host(sK2))
& setIn(sK2,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(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(X8,sK8)],[f77]) ).
fof(f79,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(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(flattening,[],[f79]) ).
fof(f81,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(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(flattening,[],[f81]) ).
fof(f88,plain,
queue(host(sK2)) = cons(m_Ack(sK1,sK3),sK0),
inference(cnf_transformation,[],[f78]) ).
fof(f89,plain,
! [X26,X27,X24,X25] :
( ~ 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) ),
inference(cnf_transformation,[],[f78]) ).
fof(f90,plain,
! [X22,X23] :
( host(X22) != host(X23)
| ~ setIn(X23,alive)
| X22 = X23
| ~ setIn(X22,alive) ),
inference(cnf_transformation,[],[f78]) ).
fof(f94,plain,
! [X14,X13] :
( host(X13) != host(X14)
| ~ elem(m_Down(X14),queue(host(X13))) ),
inference(cnf_transformation,[],[f78]) ).
fof(f97,plain,
setIn(sK2,alive),
inference(cnf_transformation,[],[f78]) ).
fof(f104,plain,
host(sK5) = host(sK2),
inference(cnf_transformation,[],[f78]) ).
fof(f107,plain,
host(sK7) = host(sK8),
inference(cnf_transformation,[],[f78]) ).
fof(f108,plain,
host(sK5) = host(sK6),
inference(cnf_transformation,[],[f78]) ).
fof(f109,plain,
setIn(sK7,alive),
inference(cnf_transformation,[],[f78]) ).
fof(f110,plain,
setIn(sK5,alive),
inference(cnf_transformation,[],[f78]) ).
fof(f112,plain,
elem(m_Down(sK6),snoc(queue(host(sK7)),m_Ldr(sK2))),
inference(cnf_transformation,[],[f78]) ).
fof(f113,plain,
elem(m_Down(sK8),sK0),
inference(cnf_transformation,[],[f78]) ).
fof(f118,plain,
! [X2,X0,X1] :
( ~ elem(X0,snoc(X2,X1))
| elem(X0,X2)
| X0 = X1 ),
inference(cnf_transformation,[],[f80]) ).
fof(f122,plain,
! [X2,X0,X1] :
( elem(X0,cons(X1,X2))
| ~ elem(X0,X2) ),
inference(cnf_transformation,[],[f82]) ).
fof(f141,plain,
! [X0,X1] : m_Down(X0) != m_Ldr(X1),
inference(cnf_transformation,[],[f19]) ).
fof(f158,plain,
! [X26,X27,X24] :
( host(X26) != host(X27)
| ~ elem(m_Down(X27),queue(host(X24)))
| sP12(X24,X26) ),
inference(cnf_transformation,[],[f158_D]) ).
fof(f158_D,definition,
! [X26,X24] :
( ! [X27] :
( host(X26) != host(X27)
| ~ elem(m_Down(X27),queue(host(X24))) )
<=> ~ sP12(X24,X26) ),
introduced(definition,[new_symbols(definition,[sP12])],[general_splitting_component_introduction]) ).
fof(f159,plain,
! [X26,X24,X25] :
( host(X24) != host(X25)
| host(X24) = host(X26)
| ~ setIn(X24,alive)
| ~ setIn(X26,alive)
| ~ elem(m_Down(X25),queue(host(X26)))
| ~ sP12(X24,X26) ),
inference(general_splitting,[],[f89,f158_D]) ).
fof(f170,plain,
host(sK6) = host(sK2),
inference(forward_demodulation,[],[f108,f104]) ).
fof(f192,plain,
! [X0] :
( elem(X0,queue(host(sK2)))
| ~ elem(X0,sK0) ),
inference(superposition,[],[f122,f88]) ).
fof(f202,plain,
( elem(m_Down(sK6),queue(host(sK7)))
| m_Down(sK6) = m_Ldr(sK2) ),
inference(resolution,[],[f112,f118]) ).
fof(f203,plain,
elem(m_Down(sK6),queue(host(sK7))),
inference(forward_subsumption_resolution,[],[f202,f141]) ).
fof(f215,plain,
! [X0] :
( host(X0) != host(sK2)
| ~ elem(m_Down(sK6),queue(host(X0))) ),
inference(superposition,[],[f94,f170]) ).
fof(f233,plain,
! [X0] :
( host(X0) != host(sK2)
| ~ setIn(sK5,alive)
| sK5 = X0
| ~ setIn(X0,alive) ),
inference(superposition,[],[f90,f104]) ).
fof(f246,plain,
! [X0] :
( host(X0) != host(sK2)
| sK5 = X0
| ~ setIn(X0,alive) ),
inference(forward_subsumption_resolution,[],[f233,f110]) ).
fof(f278,plain,
! [X0,X1] :
( host(X0) != host(sK7)
| ~ elem(m_Down(sK8),queue(host(X1)))
| sP12(X1,X0) ),
inference(superposition,[],[f158,f107]) ).
fof(f281,plain,
! [X0,X1] :
( host(X0) != host(sK2)
| host(X1) = host(sK2)
| ~ setIn(sK5,alive)
| ~ setIn(X1,alive)
| ~ elem(m_Down(X0),queue(host(X1)))
| ~ sP12(sK5,X1) ),
inference(superposition,[],[f159,f104]) ).
fof(f289,plain,
! [X0,X1] :
( host(X0) != host(sK2)
| host(X1) = host(sK2)
| ~ setIn(X1,alive)
| ~ elem(m_Down(X0),queue(host(X1)))
| ~ sP12(sK5,X1) ),
inference(forward_subsumption_resolution,[],[f281,f110]) ).
fof(f333,plain,
( sK2 = sK5
| ~ setIn(sK2,alive) ),
inference(equality_resolution,[],[f246]) ).
fof(f335,plain,
sK2 = sK5,
inference(forward_subsumption_resolution,[],[f333,f97]) ).
fof(f495,plain,
! [X0] :
( ~ elem(m_Down(sK8),queue(host(X0)))
| sP12(X0,sK7) ),
inference(equality_resolution,[],[f278]) ).
fof(f511,plain,
! [X0] :
( host(sK2) != host(sK2)
| host(X0) = host(sK2)
| ~ setIn(X0,alive)
| ~ elem(m_Down(sK6),queue(host(X0)))
| ~ sP12(sK5,X0) ),
inference(superposition,[],[f289,f170]) ).
fof(f514,plain,
! [X0] :
( host(X0) = host(sK2)
| ~ setIn(X0,alive)
| ~ elem(m_Down(sK6),queue(host(X0)))
| ~ sP12(sK5,X0) ),
inference(trivial_inequality_removal,[],[f511]) ).
fof(f517,plain,
! [X0] :
( ~ setIn(X0,alive)
| ~ elem(m_Down(sK6),queue(host(X0)))
| ~ sP12(sK5,X0) ),
inference(forward_subsumption_resolution,[],[f514,f215]) ).
fof(f520,plain,
! [X0] :
( ~ elem(m_Down(sK6),queue(host(X0)))
| ~ setIn(X0,alive)
| ~ sP12(sK2,X0) ),
inference(forward_demodulation,[],[f517,f335]) ).
fof(f720,definition,
( spl13_26
<=> sP12(sK2,sK7) ),
introduced(definition,[new_symbols(definition,[spl13_26])],[avatar_definition]) ).
fof(f722,plain,
( sP12(sK2,sK7)
| ~ spl13_26 ),
inference(avatar_component_clause,[],[f720]) ).
fof(f724,plain,
( sP12(sK2,sK7)
| ~ elem(m_Down(sK8),sK0) ),
inference(resolution,[],[f495,f192]) ).
fof(f729,plain,
sP12(sK2,sK7),
inference(forward_subsumption_resolution,[],[f724,f113]) ).
fof(f730,plain,
spl13_26,
inference(avatar_split_clause,[],[f729,f720]) ).
fof(f755,plain,
( ~ setIn(sK7,alive)
| ~ sP12(sK2,sK7) ),
inference(resolution,[],[f520,f203]) ).
fof(f761,plain,
~ sP12(sK2,sK7),
inference(forward_subsumption_resolution,[],[f755,f109]) ).
fof(f762,plain,
( $false
| ~ spl13_26 ),
inference(forward_subsumption_resolution,[],[f761,f722]) ).
fof(f763,plain,
~ spl13_26,
inference(avatar_contradiction_clause,[],[f762]) ).
cnf(s19,plain,
spl13_26,
inference(sat_conversion,[],[f730]) ).
cnf(s20,plain,
~ spl13_26,
inference(sat_conversion,[],[f763]) ).
cnf(s21,plain,
$false,
inference(rat,[],[s19,s20]) ).
fof(f764,plain,
$false,
inference(avatar_sat_refutation,[],[s21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV450+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.08/0.18 % Computer : n009.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:45 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.21 Running first-order theorem proving
% 0.08/0.21 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.12/1.08 % (2965822)Detected formulas, will run a generic FOF schedule.
% 3.12/1.08 % (2965829)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=917195319:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.12/1.08 % (2965828)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=2245356052:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.12/1.08 % (2965830)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=767562373:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.12/1.08 % (2965832)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1648027810:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.12/1.08 % (2965827)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=3519847526:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.12/1.08 % (2965833)dis-21_1_sil=8000:lcm=predicate:random_seed=3079170349: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.12/1.08 % (2965831)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=987112626:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.12/1.08 % (2965830)First to succeed.
% 3.12/1.08 % (2965830)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2965822"
% 3.12/1.08 % (2965831)Also succeeded, but the first one will report.
% 3.12/1.08 % (2965833)Instruction limit reached!
% 3.12/1.08 % (2965833)------------------------------
% 3.12/1.08 % (2965833)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.12/1.08 % (2965833)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.12/1.08 % (2965833)CaDiCaL version: 2.1.3
% 3.12/1.08 % (2965833)Termination reason: Instruction limit
% 3.12/1.08 % (2965833)Termination phase: Saturation
% 3.12/1.08 % (2965833)Time elapsed: 0.060 s
% 3.12/1.08 % (2965833)Peak memory usage: 89 MB
% 3.12/1.08 % (2965833)Instructions burned: 129 (million)
% 3.12/1.08 % (2965832)Instruction limit reached!
% 3.12/1.08 % (2965832)------------------------------
% 3.12/1.08 % (2965832)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.12/1.08 % (2965832)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.12/1.08 % (2965832)CaDiCaL version: 2.1.3
% 3.12/1.08 % (2965832)Termination reason: Instruction limit
% 3.12/1.08 % (2965832)Termination phase: Saturation
% 3.12/1.08 % (2965832)Time elapsed: 0.095 s
% 3.12/1.08 % (2965832)Peak memory usage: 90 MB
% 3.12/1.08 % (2965832)Instructions burned: 139 (million)
% 3.12/1.08 % (2965841)lrs+10_1_sil=8000:sp=occurrence:random_seed=3743456118:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.12/1.08 % (2965842)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3829342982:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.12/1.08 % (2965842)Also succeeded, but the first one will report.
% 3.12/1.08 % (2965841)Also succeeded, but the first one will report.
% 3.12/1.08 % (2965830)Refutation found. Thanks to Tanya!
% 3.12/1.08 % SZS status Theorem for theBenchmark
% 3.12/1.08 % SZS output start Proof for theBenchmark
% See solution above
% 3.63/1.28 % (2965830)------------------------------
% 3.63/1.28 % (2965830)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.63/1.28 % (2965830)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.63/1.28 % (2965830)CaDiCaL version: 2.1.3
% 3.63/1.28 % (2965830)Termination reason: Refutation
% 3.63/1.28 % (2965830)Time elapsed: 0.016 s
% 3.63/1.28 % (2965830)Peak memory usage: 89 MB
% 3.63/1.28 % (2965830)Instructions burned: 23 (million)
% 3.63/1.28 % (2965830)------------------------------
% 3.63/1.28 % (2965830)------------------------------
% 3.63/1.28 % (2965822)Success in time 0.43 s
% 3.63/1.28 % Vampire exiting
%------------------------------------------------------------------------------