%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV471+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 : n018.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:22 PM UTC 2026
% Result : Theorem 0.21s 0.32s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 8
% Syntax : Number of formulae : 72 ( 21 unt; 4 def)
% Number of atoms : 526 ( 245 equ)
% Maximal formula atoms : 66 ( 7 avg)
% Number of connectives : 748 ( 294 ~; 213 |; 178 &)
% ( 6 <=>; 57 =>; 0 <=; 0 <~>)
% Maximal formula depth : 33 ( 6 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 9 ( 7 usr; 5 prp; 0-2 aty)
% Number of functors : 29 ( 29 usr; 17 con; 0-2 aty)
% Number of variables : 259 ( 0 sgn 243 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f13,axiom,
! [X0,X1,X2] : m_Ack(X0,X1) != m_Down(X2),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_12) ).
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] :
( elem(m_Ldr(X4),queue(host(X3)))
=> ~ leq(host(X3),host(X4)) )
& ! [X3,X4] :
( elem(m_Down(X4),queue(host(X3)))
=> host(X4) != host(X3) )
& ! [X3,X4] :
( host(X4) = nbr_proc
=> ~ elem(m_NotNorm(X3),queue(host(X4))) )
& ! [X3,X4] :
( ( X4 != X3
& host(X4) = host(X3) )
=> ( ~ setIn(X3,alive)
| ~ setIn(X4,alive) ) )
& ! [X3] :
( ( ( index(status,host(X3)) = elec_1
| index(status,host(X3)) = elec_2 )
& setIn(X3,alive) )
=> index(elid,host(X3)) = X3 )
& ! [X3,X4,X5] :
( ( host(X5) != host(X4)
& setIn(X5,alive)
& host(X5) = host(X3)
& index(ldr,host(X5)) = host(X4)
& index(status,host(X5)) = norm )
=> ~ elem(m_Down(X3),queue(host(X4))) )
& ! [X3,X4,X5] :
( ( host(X5) != host(X4)
& setIn(X5,alive)
& host(X5) = host(X3)
& index(status,host(X5)) = wait
& host(index(elid,host(X5))) = host(X4) )
=> ~ elem(m_Down(X3),queue(host(X4))) )
& ! [X3,X4,X6,X5] :
( ( host(X6) != host(X3)
& setIn(X3,alive)
& setIn(X6,alive)
& host(X4) = host(X3)
& host(X5) = host(X6) )
=> ~ ( elem(m_Down(X5),queue(host(X3)))
& elem(m_Down(X4),queue(host(X6))) ) )
& ! [X3,X4,X6,X5] :
( ( host(X6) != host(X3)
& setIn(X3,alive)
& setIn(X6,alive)
& host(X4) = host(X3)
& host(X5) = host(X6) )
=> ~ ( elem(m_Down(X5),queue(host(X3)))
& setIn(host(X4),index(down,host(X6))) ) )
& ! [X3,X4,X6,X5] :
( ( ! [X7] :
( ( ~ leq(host(X5),X7)
& leq(s(zero),X7) )
=> ( setIn(X7,index(down,host(X5)))
| X7 = host(X6) ) )
& elem(m_Down(X6),queue(host(X5)))
& host(X5) = host(X4)
& host(X5) = nbr_proc
& index(status,host(X5)) = elec_1 )
=> ~ ( setIn(X3,alive)
& elem(m_Down(X4),queue(host(X3))) ) )
& queue(host(X1)) = cons(m_Halt(X2),X0) )
=> ( setIn(X1,alive)
=> ! [X3] :
( host(X2) != host(X3)
=> ( host(X1) = host(X3)
=> ! [X4,X8,X9] :
( host(X2) = host(X9)
=> ( host(X1) != host(X9)
=> ( ( ! [X7] :
( ( ~ leq(host(X9),X7)
& leq(s(zero),X7) )
=> ( setIn(X7,index(down,host(X9)))
| X7 = host(X8) ) )
& elem(m_Down(X8),snoc(queue(host(X9)),m_Ack(X2,X1)))
& host(X9) = host(X4)
& host(X9) = nbr_proc
& index(status,host(X9)) = elec_1 )
=> ~ ( setIn(X3,alive)
& elem(m_Down(X4),X0) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
fof(f68,negated_conjecture,
~ ! [X0,X1,X2] :
( ( ! [X3,X4] :
( elem(m_Ldr(X4),queue(host(X3)))
=> ~ leq(host(X3),host(X4)) )
& ! [X3,X4] :
( elem(m_Down(X4),queue(host(X3)))
=> host(X4) != host(X3) )
& ! [X3,X4] :
( host(X4) = nbr_proc
=> ~ elem(m_NotNorm(X3),queue(host(X4))) )
& ! [X3,X4] :
( ( X4 != X3
& host(X4) = host(X3) )
=> ( ~ setIn(X3,alive)
| ~ setIn(X4,alive) ) )
& ! [X3] :
( ( ( index(status,host(X3)) = elec_1
| index(status,host(X3)) = elec_2 )
& setIn(X3,alive) )
=> index(elid,host(X3)) = X3 )
& ! [X3,X4,X5] :
( ( host(X5) != host(X4)
& setIn(X5,alive)
& host(X5) = host(X3)
& index(ldr,host(X5)) = host(X4)
& index(status,host(X5)) = norm )
=> ~ elem(m_Down(X3),queue(host(X4))) )
& ! [X3,X4,X5] :
( ( host(X5) != host(X4)
& setIn(X5,alive)
& host(X5) = host(X3)
& index(status,host(X5)) = wait
& host(index(elid,host(X5))) = host(X4) )
=> ~ elem(m_Down(X3),queue(host(X4))) )
& ! [X3,X4,X6,X5] :
( ( host(X6) != host(X3)
& setIn(X3,alive)
& setIn(X6,alive)
& host(X4) = host(X3)
& host(X5) = host(X6) )
=> ~ ( elem(m_Down(X5),queue(host(X3)))
& elem(m_Down(X4),queue(host(X6))) ) )
& ! [X3,X4,X6,X5] :
( ( host(X6) != host(X3)
& setIn(X3,alive)
& setIn(X6,alive)
& host(X4) = host(X3)
& host(X5) = host(X6) )
=> ~ ( elem(m_Down(X5),queue(host(X3)))
& setIn(host(X4),index(down,host(X6))) ) )
& ! [X3,X4,X6,X5] :
( ( ! [X7] :
( ( ~ leq(host(X5),X7)
& leq(s(zero),X7) )
=> ( setIn(X7,index(down,host(X5)))
| X7 = host(X6) ) )
& elem(m_Down(X6),queue(host(X5)))
& host(X5) = host(X4)
& host(X5) = nbr_proc
& index(status,host(X5)) = elec_1 )
=> ~ ( setIn(X3,alive)
& elem(m_Down(X4),queue(host(X3))) ) )
& queue(host(X1)) = cons(m_Halt(X2),X0) )
=> ( setIn(X1,alive)
=> ! [X3] :
( host(X2) != host(X3)
=> ( host(X1) = host(X3)
=> ! [X4,X8,X9] :
( host(X2) = host(X9)
=> ( host(X1) != host(X9)
=> ( ( ! [X7] :
( ( ~ leq(host(X9),X7)
& leq(s(zero),X7) )
=> ( setIn(X7,index(down,host(X9)))
| X7 = host(X8) ) )
& elem(m_Down(X8),snoc(queue(host(X9)),m_Ack(X2,X1)))
& host(X9) = host(X4)
& host(X9) = nbr_proc
& index(status,host(X9)) = elec_1 )
=> ~ ( setIn(X3,alive)
& elem(m_Down(X4),X0) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f67]) ).
fof(f69,plain,
~ ! [X0,X1,X2] :
( ( ! [X3,X4] :
( elem(m_Ldr(X4),queue(host(X3)))
=> ~ leq(host(X3),host(X4)) )
& ! [X5,X6] :
( elem(m_Down(X6),queue(host(X5)))
=> host(X5) != host(X6) )
& ! [X7,X8] :
( nbr_proc = host(X8)
=> ~ elem(m_NotNorm(X7),queue(host(X8))) )
& ! [X9,X10] :
( ( X9 != X10
& host(X9) = host(X10) )
=> ( ~ setIn(X9,alive)
| ~ setIn(X10,alive) ) )
& ! [X11] :
( ( ( elec_1 = index(status,host(X11))
| elec_2 = index(status,host(X11)) )
& setIn(X11,alive) )
=> index(elid,host(X11)) = X11 )
& ! [X12,X13,X14] :
( ( host(X13) != host(X14)
& setIn(X14,alive)
& host(X14) = host(X12)
& host(X13) = index(ldr,host(X14))
& norm = index(status,host(X14)) )
=> ~ elem(m_Down(X12),queue(host(X13))) )
& ! [X15,X16,X17] :
( ( host(X16) != host(X17)
& setIn(X17,alive)
& host(X17) = host(X15)
& wait = index(status,host(X17))
& host(X16) = host(index(elid,host(X17))) )
=> ~ elem(m_Down(X15),queue(host(X16))) )
& ! [X18,X19,X20,X21] :
( ( host(X18) != host(X20)
& setIn(X18,alive)
& setIn(X20,alive)
& host(X18) = host(X19)
& host(X20) = host(X21) )
=> ~ ( elem(m_Down(X21),queue(host(X18)))
& elem(m_Down(X19),queue(host(X20))) ) )
& ! [X22,X23,X24,X25] :
( ( host(X22) != host(X24)
& setIn(X22,alive)
& setIn(X24,alive)
& host(X22) = host(X23)
& host(X24) = host(X25) )
=> ~ ( elem(m_Down(X25),queue(host(X22)))
& setIn(host(X23),index(down,host(X24))) ) )
& ! [X26,X27,X28,X29] :
( ( ! [X30] :
( ( ~ leq(host(X29),X30)
& leq(s(zero),X30) )
=> ( setIn(X30,index(down,host(X29)))
| host(X28) = X30 ) )
& elem(m_Down(X28),queue(host(X29)))
& host(X29) = host(X27)
& nbr_proc = host(X29)
& elec_1 = index(status,host(X29)) )
=> ~ ( setIn(X26,alive)
& elem(m_Down(X27),queue(host(X26))) ) )
& queue(host(X1)) = cons(m_Halt(X2),X0) )
=> ( setIn(X1,alive)
=> ! [X31] :
( host(X2) != host(X31)
=> ( host(X1) = host(X31)
=> ! [X32,X33,X34] :
( host(X2) = host(X34)
=> ( host(X1) != host(X34)
=> ( ( ! [X35] :
( ( ~ leq(host(X34),X35)
& leq(s(zero),X35) )
=> ( setIn(X35,index(down,host(X34)))
| host(X33) = X35 ) )
& elem(m_Down(X33),snoc(queue(host(X34)),m_Ack(X2,X1)))
& host(X34) = host(X32)
& nbr_proc = host(X34)
& elec_1 = index(status,host(X34)) )
=> ~ ( setIn(X31,alive)
& elem(m_Down(X32),X0) ) ) ) ) ) ) ) ),
inference(rectify,[],[f68]) ).
fof(f85,plain,
? [X0,X1,X2] :
( ? [X31] :
( ? [X32,X33,X34] :
( setIn(X31,alive)
& elem(m_Down(X32),X0)
& ! [X35] :
( setIn(X35,index(down,host(X34)))
| host(X33) = X35
| leq(host(X34),X35)
| ~ leq(s(zero),X35) )
& elem(m_Down(X33),snoc(queue(host(X34)),m_Ack(X2,X1)))
& host(X34) = host(X32)
& nbr_proc = host(X34)
& elec_1 = index(status,host(X34))
& host(X1) != host(X34)
& host(X2) = host(X34) )
& host(X1) = host(X31)
& host(X2) != host(X31) )
& setIn(X1,alive)
& ! [X3,X4] :
( ~ leq(host(X3),host(X4))
| ~ elem(m_Ldr(X4),queue(host(X3))) )
& ! [X5,X6] :
( host(X5) != host(X6)
| ~ elem(m_Down(X6),queue(host(X5))) )
& ! [X7,X8] :
( ~ elem(m_NotNorm(X7),queue(host(X8)))
| nbr_proc != host(X8) )
& ! [X9,X10] :
( ~ setIn(X9,alive)
| ~ setIn(X10,alive)
| X9 = X10
| host(X9) != host(X10) )
& ! [X11] :
( index(elid,host(X11)) = X11
| ( elec_1 != index(status,host(X11))
& elec_2 != index(status,host(X11)) )
| ~ setIn(X11,alive) )
& ! [X12,X13,X14] :
( ~ elem(m_Down(X12),queue(host(X13)))
| host(X13) = host(X14)
| ~ setIn(X14,alive)
| host(X14) != host(X12)
| host(X13) != index(ldr,host(X14))
| norm != index(status,host(X14)) )
& ! [X15,X16,X17] :
( ~ elem(m_Down(X15),queue(host(X16)))
| host(X16) = host(X17)
| ~ setIn(X17,alive)
| host(X17) != host(X15)
| wait != index(status,host(X17))
| host(X16) != host(index(elid,host(X17))) )
& ! [X18,X19,X20,X21] :
( ~ elem(m_Down(X21),queue(host(X18)))
| ~ elem(m_Down(X19),queue(host(X20)))
| host(X18) = host(X20)
| ~ setIn(X18,alive)
| ~ setIn(X20,alive)
| host(X18) != host(X19)
| host(X20) != host(X21) )
& ! [X22,X23,X24,X25] :
( ~ elem(m_Down(X25),queue(host(X22)))
| ~ setIn(host(X23),index(down,host(X24)))
| host(X22) = host(X24)
| ~ setIn(X22,alive)
| ~ setIn(X24,alive)
| host(X22) != host(X23)
| host(X24) != host(X25) )
& ! [X26,X27,X28,X29] :
( ~ setIn(X26,alive)
| ~ elem(m_Down(X27),queue(host(X26)))
| ? [X30] :
( ~ setIn(X30,index(down,host(X29)))
& host(X28) != X30
& ~ leq(host(X29),X30)
& leq(s(zero),X30) )
| ~ elem(m_Down(X28),queue(host(X29)))
| host(X29) != host(X27)
| nbr_proc != host(X29)
| elec_1 != index(status,host(X29)) )
& queue(host(X1)) = cons(m_Halt(X2),X0) ),
inference(ennf_transformation,[],[f69]) ).
fof(f86,plain,
? [X0,X1,X2] :
( ? [X31] :
( ? [X32,X33,X34] :
( setIn(X31,alive)
& elem(m_Down(X32),X0)
& ! [X35] :
( setIn(X35,index(down,host(X34)))
| host(X33) = X35
| leq(host(X34),X35)
| ~ leq(s(zero),X35) )
& elem(m_Down(X33),snoc(queue(host(X34)),m_Ack(X2,X1)))
& host(X34) = host(X32)
& nbr_proc = host(X34)
& elec_1 = index(status,host(X34))
& host(X1) != host(X34)
& host(X2) = host(X34) )
& host(X1) = host(X31)
& host(X2) != host(X31) )
& setIn(X1,alive)
& ! [X3,X4] :
( ~ leq(host(X3),host(X4))
| ~ elem(m_Ldr(X4),queue(host(X3))) )
& ! [X5,X6] :
( host(X5) != host(X6)
| ~ elem(m_Down(X6),queue(host(X5))) )
& ! [X7,X8] :
( ~ elem(m_NotNorm(X7),queue(host(X8)))
| nbr_proc != host(X8) )
& ! [X9,X10] :
( ~ setIn(X9,alive)
| ~ setIn(X10,alive)
| X9 = X10
| host(X9) != host(X10) )
& ! [X11] :
( index(elid,host(X11)) = X11
| ( elec_1 != index(status,host(X11))
& elec_2 != index(status,host(X11)) )
| ~ setIn(X11,alive) )
& ! [X12,X13,X14] :
( ~ elem(m_Down(X12),queue(host(X13)))
| host(X13) = host(X14)
| ~ setIn(X14,alive)
| host(X14) != host(X12)
| host(X13) != index(ldr,host(X14))
| norm != index(status,host(X14)) )
& ! [X15,X16,X17] :
( ~ elem(m_Down(X15),queue(host(X16)))
| host(X16) = host(X17)
| ~ setIn(X17,alive)
| host(X17) != host(X15)
| wait != index(status,host(X17))
| host(X16) != host(index(elid,host(X17))) )
& ! [X18,X19,X20,X21] :
( ~ elem(m_Down(X21),queue(host(X18)))
| ~ elem(m_Down(X19),queue(host(X20)))
| host(X18) = host(X20)
| ~ setIn(X18,alive)
| ~ setIn(X20,alive)
| host(X18) != host(X19)
| host(X20) != host(X21) )
& ! [X22,X23,X24,X25] :
( ~ elem(m_Down(X25),queue(host(X22)))
| ~ setIn(host(X23),index(down,host(X24)))
| host(X22) = host(X24)
| ~ setIn(X22,alive)
| ~ setIn(X24,alive)
| host(X22) != host(X23)
| host(X24) != host(X25) )
& ! [X26,X27,X28,X29] :
( ~ setIn(X26,alive)
| ~ elem(m_Down(X27),queue(host(X26)))
| ? [X30] :
( ~ setIn(X30,index(down,host(X29)))
& host(X28) != X30
& ~ leq(host(X29),X30)
& leq(s(zero),X30) )
| ~ elem(m_Down(X28),queue(host(X29)))
| host(X29) != host(X27)
| nbr_proc != host(X29)
| elec_1 != index(status,host(X29)) )
& queue(host(X1)) = cons(m_Halt(X2),X0) ),
inference(flattening,[],[f85]) ).
fof(f100,plain,
! [X2,X0,X1] : m_Ack(X0,X1) != m_Down(X2),
inference(cnf_transformation,[],[f13]) ).
fof(f140,plain,
! [X2,X0,X1] :
( elem(X0,cons(X1,X2))
| ~ elem(X0,X2) ),
inference(cnf_transformation,[],[f47]) ).
fof(f142,plain,
! [X2,X0,X1] :
( ~ elem(X0,snoc(X2,X1))
| X0 = X1
| elem(X0,X2) ),
inference(cnf_transformation,[],[f48]) ).
fof(f183,plain,
! [X35] :
( setIn(X35,index(down,host(sK10)))
| leq(host(sK10),X35)
| host(sK9) = X35
| ~ leq(s(zero),X35) ),
inference(cnf_transformation,[],[f86]) ).
fof(f186,plain,
elec_1 = index(status,host(sK10)),
inference(cnf_transformation,[],[f86]) ).
fof(f187,plain,
nbr_proc = host(sK10),
inference(cnf_transformation,[],[f86]) ).
fof(f188,plain,
host(sK10) = host(sK8),
inference(cnf_transformation,[],[f86]) ).
fof(f189,plain,
elem(m_Down(sK9),snoc(queue(host(sK10)),m_Ack(sK5,sK4))),
inference(cnf_transformation,[],[f86]) ).
fof(f190,plain,
elem(m_Down(sK8),sK3),
inference(cnf_transformation,[],[f86]) ).
fof(f192,plain,
! [X28,X29,X26,X27] :
( ~ setIn(X26,alive)
| nbr_proc != host(X29)
| host(X29) != host(X27)
| ~ elem(m_Down(X28),queue(host(X29)))
| leq(s(zero),sK7(X28,X29))
| ~ elem(m_Down(X27),queue(host(X26)))
| elec_1 != index(status,host(X29)) ),
inference(cnf_transformation,[],[f86]) ).
fof(f193,plain,
! [X28,X29,X26,X27] :
( ~ setIn(X26,alive)
| nbr_proc != host(X29)
| host(X29) != host(X27)
| ~ elem(m_Down(X28),queue(host(X29)))
| ~ leq(host(X29),sK7(X28,X29))
| ~ elem(m_Down(X27),queue(host(X26)))
| elec_1 != index(status,host(X29)) ),
inference(cnf_transformation,[],[f86]) ).
fof(f194,plain,
! [X28,X29,X26,X27] :
( ~ setIn(X26,alive)
| nbr_proc != host(X29)
| host(X29) != host(X27)
| ~ elem(m_Down(X28),queue(host(X29)))
| host(X28) != sK7(X28,X29)
| ~ elem(m_Down(X27),queue(host(X26)))
| elec_1 != index(status,host(X29)) ),
inference(cnf_transformation,[],[f86]) ).
fof(f195,plain,
! [X28,X29,X26,X27] :
( ~ setIn(sK7(X28,X29),index(down,host(X29)))
| ~ setIn(X26,alive)
| host(X29) != host(X27)
| ~ elem(m_Down(X28),queue(host(X29)))
| elec_1 != index(status,host(X29))
| ~ elem(m_Down(X27),queue(host(X26)))
| nbr_proc != host(X29) ),
inference(cnf_transformation,[],[f86]) ).
fof(f208,plain,
queue(host(sK4)) = cons(m_Halt(sK5),sK3),
inference(cnf_transformation,[],[f86]) ).
fof(f209,plain,
setIn(sK4,alive),
inference(cnf_transformation,[],[f86]) ).
fof(f223,plain,
nbr_proc = host(sK8),
inference(forward_demodulation,[],[f188,f187]) ).
fof(f224,plain,
elem(m_Down(sK9),snoc(queue(nbr_proc),m_Ack(sK5,sK4))),
inference(forward_demodulation,[],[f189,f187]) ).
fof(f227,plain,
elec_1 = index(status,nbr_proc),
inference(superposition,[],[f186,f187]) ).
fof(f418,plain,
! [X2,X0,X1] :
( ~ elem(m_Down(X2),queue(host(X0)))
| ~ elem(m_Down(X1),queue(host(sK4)))
| host(X0) != nbr_proc
| host(X2) != sK7(X2,X0)
| host(X0) != host(X1)
| elec_1 != index(status,host(X0)) ),
inference(resolution,[],[f194,f209]) ).
fof(f433,plain,
! [X2,X0,X1] :
( ~ setIn(X1,alive)
| host(X2) != host(sK10)
| ~ elem(m_Down(X0),queue(host(sK10)))
| elec_1 != index(status,host(sK10))
| ~ elem(m_Down(X2),queue(host(X1)))
| nbr_proc != host(sK10)
| leq(host(sK10),sK7(X0,sK10))
| host(sK9) = sK7(X0,sK10)
| ~ leq(s(zero),sK7(X0,sK10)) ),
inference(resolution,[],[f195,f183]) ).
fof(f443,plain,
! [X2,X0,X1] :
( ~ setIn(X1,alive)
| host(X2) != host(sK10)
| ~ elem(m_Down(X0),queue(host(sK10)))
| elec_1 != index(status,host(sK10))
| ~ elem(m_Down(X2),queue(host(X1)))
| nbr_proc != host(sK10)
| host(sK9) = sK7(X0,sK10)
| ~ leq(s(zero),sK7(X0,sK10)) ),
inference(forward_subsumption_resolution,[],[f433,f193]) ).
fof(f445,definition,
( spl11_18
<=> ! [X2,X1] :
( ~ setIn(X1,alive)
| nbr_proc != host(X2)
| ~ elem(m_Down(X2),queue(host(X1))) ) ),
introduced(definition,[new_symbols(definition,[spl11_18])],[avatar_definition]) ).
fof(f446,plain,
( ! [X2,X1] :
( ~ setIn(X1,alive)
| nbr_proc != host(X2)
| ~ elem(m_Down(X2),queue(host(X1))) )
| ~ spl11_18 ),
inference(avatar_component_clause,[],[f445]) ).
fof(f456,plain,
! [X2,X0,X1] :
( ~ setIn(X1,alive)
| host(X2) != host(sK10)
| ~ elem(m_Down(X0),queue(host(sK10)))
| elec_1 != index(status,host(sK10))
| ~ elem(m_Down(X2),queue(host(X1)))
| nbr_proc != host(sK10)
| host(sK9) = sK7(X0,sK10) ),
inference(forward_subsumption_resolution,[],[f443,f192]) ).
fof(f458,plain,
! [X2,X0,X1] :
( ~ setIn(X1,alive)
| host(X2) != host(sK10)
| ~ elem(m_Down(X0),queue(host(sK10)))
| ~ elem(m_Down(X2),queue(host(X1)))
| nbr_proc != host(sK10)
| host(sK9) = sK7(X0,sK10) ),
inference(forward_subsumption_resolution,[],[f456,f186]) ).
fof(f460,plain,
! [X2,X0,X1] :
( ~ setIn(X1,alive)
| host(X2) != host(sK10)
| ~ elem(m_Down(X0),queue(host(sK10)))
| ~ elem(m_Down(X2),queue(host(X1)))
| host(sK9) = sK7(X0,sK10) ),
inference(forward_subsumption_resolution,[],[f458,f187]) ).
fof(f462,plain,
! [X2,X0,X1] :
( nbr_proc != host(X2)
| ~ setIn(X1,alive)
| ~ elem(m_Down(X0),queue(host(sK10)))
| ~ elem(m_Down(X2),queue(host(X1)))
| host(sK9) = sK7(X0,sK10) ),
inference(forward_demodulation,[],[f460,f187]) ).
fof(f467,plain,
! [X2,X0,X1] :
( ~ elem(m_Down(X0),queue(nbr_proc))
| nbr_proc != host(X2)
| ~ setIn(X1,alive)
| ~ elem(m_Down(X2),queue(host(X1)))
| host(sK9) = sK7(X0,sK10) ),
inference(forward_demodulation,[],[f462,f187]) ).
fof(f469,definition,
( spl11_22
<=> ! [X0] :
( ~ elem(m_Down(X0),queue(nbr_proc))
| host(sK9) = sK7(X0,sK10) ) ),
introduced(definition,[new_symbols(definition,[spl11_22])],[avatar_definition]) ).
fof(f470,plain,
( ! [X0] :
( ~ elem(m_Down(X0),queue(nbr_proc))
| host(sK9) = sK7(X0,sK10) )
| ~ spl11_22 ),
inference(avatar_component_clause,[],[f469]) ).
fof(f471,plain,
( spl11_18
| spl11_22 ),
inference(avatar_split_clause,[],[f467,f469,f445]) ).
fof(f473,plain,
( ! [X0] :
( ~ elem(m_Down(X0),queue(host(sK4)))
| host(X0) != nbr_proc )
| ~ spl11_18 ),
inference(resolution,[],[f446,f209]) ).
fof(f501,plain,
! [X0,X1] :
( ~ elem(m_Down(X0),queue(nbr_proc))
| ~ elem(m_Down(X1),queue(host(sK4)))
| nbr_proc != nbr_proc
| host(X0) != sK7(X0,sK10)
| host(X1) != nbr_proc
| elec_1 != index(status,nbr_proc) ),
inference(superposition,[],[f418,f187]) ).
fof(f502,plain,
! [X0,X1] :
( ~ elem(m_Down(X0),queue(nbr_proc))
| ~ elem(m_Down(X1),queue(host(sK4)))
| host(X0) != sK7(X0,sK10)
| host(X1) != nbr_proc
| elec_1 != index(status,nbr_proc) ),
inference(trivial_inequality_removal,[],[f501]) ).
fof(f574,plain,
! [X0] :
( elem(X0,queue(host(sK4)))
| ~ elem(X0,sK3) ),
inference(superposition,[],[f140,f208]) ).
fof(f578,plain,
( ! [X0] :
( ~ elem(m_Down(X0),sK3)
| host(X0) != nbr_proc )
| ~ spl11_18 ),
inference(resolution,[],[f574,f473]) ).
fof(f607,plain,
( nbr_proc != host(sK8)
| ~ spl11_18 ),
inference(resolution,[],[f578,f190]) ).
fof(f608,plain,
( $false
| ~ spl11_18 ),
inference(forward_subsumption_resolution,[],[f607,f223]) ).
fof(f609,plain,
~ spl11_18,
inference(avatar_contradiction_clause,[],[f608]) ).
fof(f613,plain,
! [X0,X1] :
( ~ elem(m_Down(X0),queue(nbr_proc))
| ~ elem(m_Down(X1),queue(host(sK4)))
| host(X0) != sK7(X0,sK10)
| host(X1) != nbr_proc ),
inference(forward_subsumption_resolution,[],[f502,f227]) ).
fof(f619,definition,
( spl11_28
<=> ! [X1] :
( host(X1) != nbr_proc
| ~ elem(m_Down(X1),queue(host(sK4))) ) ),
introduced(definition,[new_symbols(definition,[spl11_28])],[avatar_definition]) ).
fof(f620,plain,
( ! [X1] :
( ~ elem(m_Down(X1),queue(host(sK4)))
| host(X1) != nbr_proc )
| ~ spl11_28 ),
inference(avatar_component_clause,[],[f619]) ).
fof(f635,definition,
( spl11_32
<=> ! [X0] :
( ~ elem(m_Down(X0),queue(nbr_proc))
| host(X0) != sK7(X0,sK10) ) ),
introduced(definition,[new_symbols(definition,[spl11_32])],[avatar_definition]) ).
fof(f636,plain,
( ! [X0] :
( ~ elem(m_Down(X0),queue(nbr_proc))
| host(X0) != sK7(X0,sK10) )
| ~ spl11_32 ),
inference(avatar_component_clause,[],[f635]) ).
fof(f637,plain,
( spl11_28
| spl11_32 ),
inference(avatar_split_clause,[],[f613,f635,f619]) ).
fof(f715,plain,
( ! [X0] :
( ~ elem(m_Down(X0),sK3)
| host(X0) != nbr_proc )
| ~ spl11_28 ),
inference(resolution,[],[f620,f574]) ).
fof(f716,plain,
( nbr_proc != host(sK8)
| ~ spl11_28 ),
inference(resolution,[],[f715,f190]) ).
fof(f717,plain,
( $false
| ~ spl11_28 ),
inference(forward_subsumption_resolution,[],[f716,f223]) ).
fof(f718,plain,
~ spl11_28,
inference(avatar_contradiction_clause,[],[f717]) ).
fof(f776,plain,
( m_Down(sK9) = m_Ack(sK5,sK4)
| elem(m_Down(sK9),queue(nbr_proc)) ),
inference(resolution,[],[f142,f224]) ).
fof(f780,plain,
elem(m_Down(sK9),queue(nbr_proc)),
inference(forward_subsumption_resolution,[],[f776,f100]) ).
fof(f782,plain,
( host(sK9) != sK7(sK9,sK10)
| ~ spl11_32 ),
inference(resolution,[],[f780,f636]) ).
fof(f784,plain,
( host(sK9) = sK7(sK9,sK10)
| ~ spl11_22 ),
inference(resolution,[],[f780,f470]) ).
fof(f786,plain,
( $false
| ~ spl11_22
| ~ spl11_32 ),
inference(forward_subsumption_resolution,[],[f782,f784]) ).
fof(f787,plain,
( ~ spl11_22
| ~ spl11_32 ),
inference(avatar_contradiction_clause,[],[f786]) ).
cnf(s19,plain,
( spl11_18
| spl11_22 ),
inference(sat_conversion,[],[f471]) ).
cnf(s22,plain,
~ spl11_18,
inference(sat_conversion,[],[f609]) ).
cnf(s27,plain,
( spl11_28
| spl11_32 ),
inference(sat_conversion,[],[f637]) ).
cnf(s31,plain,
~ spl11_28,
inference(sat_conversion,[],[f718]) ).
cnf(s32,plain,
( ~ spl11_22
| ~ spl11_32 ),
inference(sat_conversion,[],[f787]) ).
cnf(s34,plain,
spl11_32,
inference(rat,[],[s27,s31]) ).
cnf(s35,plain,
~ spl11_22,
inference(rat,[],[s32,s34]) ).
cnf(s40,plain,
$false,
inference(rat,[],[s19,s35,s22]) ).
fof(f788,plain,
$false,
inference(avatar_sat_refutation,[],[s40]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWV471+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.21 % Computer : n018.cluster.edu
% 0.09/0.21 % Model : x86_64 x86_64
% 0.09/0.21 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.21 % Memory : 8046.5625MB
% 0.09/0.21 % OS : Linux 6.8.0-71-generic
% 0.09/0.21 % CPULimit : 300
% 0.09/0.21 % WCLimit : 300
% 0.09/0.21 % DateTime : Mon Sep 28 11:13:16 UTC 2026
% 0.09/0.22 % CPUTime :
% 0.09/0.22 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.25 Running first-order model finding
% 0.09/0.25 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.21/0.32 % (3306959)Will run a generic schedule for satisfiability detection.
% 0.21/0.32 % (3306969)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3592965989:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.21/0.32 % (3306965)% WARNING: option uhcvi not known.
% 0.21/0.32 % (3306964)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3253943899_2999 on theBenchmark for (2999ds/0Mi)
% 0.21/0.32 % (3306965)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=459534288:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.21/0.32 % (3306966)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3621515127:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.21/0.32 % (3306967)dis+10_1_sil=32000:sp=arity:random_seed=2846580611:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.21/0.32 % (3306968)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3412629751:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.21/0.32 % (3306970)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3033005247:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.21/0.32 % Detected minimum model sizes of [4]
% 0.21/0.32 % Detected maximum model sizes of [max]
% 0.21/0.32 % TRYING [4]
% 0.21/0.32 % (3306968) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3306959-3306968"...
% 0.21/0.32 % (3306968)...printing done.
% 0.21/0.32 % (3306968)Refutation found. Thanks to Tanya!
% 0.21/0.32 % SZS status Theorem for theBenchmark
% 0.21/0.32 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.32 % (3306968)------------------------------
% 0.21/0.32 % (3306968)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.32 % (3306968)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.32 % (3306968)CaDiCaL version: 2.1.3
% 0.21/0.32 % (3306968)Termination reason: Refutation
% 0.21/0.32 % (3306968)Time elapsed: 0.022 s
% 0.21/0.32 % (3306968)Peak memory usage: 13 MB
% 0.21/0.32 % (3306968)Instructions burned: 35 (million)
% 0.21/0.32 % (3306959)Success in time 0.057 s
% 0.21/0.32 % Vampire exiting
%------------------------------------------------------------------------------