%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV451+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.20s 0.30s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 14
% Syntax : Number of formulae : 106 ( 33 unt; 10 def)
% Number of atoms : 607 ( 250 equ)
% Maximal formula atoms : 51 ( 5 avg)
% Number of connectives : 787 ( 286 ~; 220 |; 209 &)
% ( 12 <=>; 60 =>; 0 <=; 0 <~>)
% Maximal formula depth : 39 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 11 prp; 0-2 aty)
% Number of functors : 26 ( 26 usr; 16 con; 0-2 aty)
% Number of variables : 256 ( 0 sgn 232 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f18,axiom,
! [X0,X1] : m_Down(X0) != m_Halt(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_17) ).
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(f48,axiom,
! [X0,X1,X2] :
( elem(X0,snoc(X2,X1))
<=> ( X0 = X1
| elem(X0,X2) ) ),
file('/export/starexec/sandbox2/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(X3)) = cons(m_NotNorm(X2),X0) )
=> ( setIn(X3,alive)
=> ( ( index(ldr,host(X3)) = host(X3)
& index(status,host(X3)) = norm
& index(elid,host(X3)) = X2 )
=> ( ( ! [X4] :
( host(X3) = host(X4)
=> leq(X4,X1) )
& ~ setIn(X1,pids)
& host(X3) = host(X1) )
=> ( host(X1) = s(zero)
=> ( ~ leq(nbr_proc,host(X1))
=> ! [X4] :
( s(host(X1)) = host(X4)
=> ( host(X3) != host(X4)
=> ! [X8,X9] :
( s(host(X1)) != host(X9)
=> ( host(X3) = host(X9)
=> ! [X10] :
( ( ( ( X4 != X3
& setIn(X4,alive) )
| X4 = X1 )
& ( ( X9 != X3
& setIn(X9,alive) )
| X9 = X1 )
& host(X9) != host(X4)
& host(X8) = host(X4)
& host(X10) = host(X9) )
=> ~ ( elem(m_Down(X8),X0)
& elem(m_Down(X10),snoc(queue(host(X4)),m_Halt(X1))) ) ) ) ) ) ) ) ) ) ) ) ),
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(X3)) = cons(m_NotNorm(X2),X0) )
=> ( setIn(X3,alive)
=> ( ( index(ldr,host(X3)) = host(X3)
& index(status,host(X3)) = norm
& index(elid,host(X3)) = X2 )
=> ( ( ! [X4] :
( host(X3) = host(X4)
=> leq(X4,X1) )
& ~ setIn(X1,pids)
& host(X3) = host(X1) )
=> ( host(X1) = s(zero)
=> ( ~ leq(nbr_proc,host(X1))
=> ! [X4] :
( s(host(X1)) = host(X4)
=> ( host(X3) != host(X4)
=> ! [X8,X9] :
( s(host(X1)) != host(X9)
=> ( host(X3) = host(X9)
=> ! [X10] :
( ( ( ( X4 != X3
& setIn(X4,alive) )
| X4 = X1 )
& ( ( X9 != X3
& setIn(X9,alive) )
| X9 = X1 )
& host(X9) != host(X4)
& host(X8) = host(X4)
& host(X10) = host(X9) )
=> ~ ( elem(m_Down(X8),X0)
& elem(m_Down(X10),snoc(queue(host(X4)),m_Halt(X1))) ) ) ) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f67]) ).
fof(f69,plain,
~ ! [X0,X1,X2,X3] :
( ( ! [X4,X5] :
( setIn(X5,alive)
=> ~ elem(m_Down(X5),queue(host(X4))) )
& ! [X6,X7] :
( elem(m_Down(X7),queue(host(X6)))
=> ~ setIn(X7,alive) )
& ! [X8,X9] :
( elem(m_Down(X9),queue(host(X8)))
=> host(X9) != host(X8) )
& ! [X10,X11] :
( elem(m_Halt(X11),queue(host(X10)))
=> ~ leq(host(X10),host(X11)) )
& ! [X12,X13,X14] :
( elem(m_Ack(X14,X12),queue(host(X13)))
=> ~ leq(host(X12),host(X14)) )
& ! [X15,X16] :
( ( ~ setIn(X15,alive)
& leq(X16,X15)
& host(X15) = host(X16) )
=> ~ setIn(X16,alive) )
& ! [X17,X18] :
( ( X17 != X18
& host(X17) = host(X18) )
=> ( ~ setIn(X17,alive)
| ~ setIn(X18,alive) ) )
& ! [X19,X20,X21,X22] :
( ( host(X19) != host(X21)
& setIn(X19,alive)
& setIn(X21,alive)
& host(X19) = host(X20)
& host(X21) = host(X22) )
=> ~ ( elem(m_Down(X22),queue(host(X19)))
& elem(m_Down(X20),queue(host(X21))) ) )
& queue(host(X3)) = cons(m_NotNorm(X2),X0) )
=> ( setIn(X3,alive)
=> ( ( index(ldr,host(X3)) = host(X3)
& index(status,host(X3)) = norm
& index(elid,host(X3)) = X2 )
=> ( ( ! [X23] :
( host(X3) = host(X23)
=> leq(X23,X1) )
& ~ setIn(X1,pids)
& host(X3) = host(X1) )
=> ( host(X1) = s(zero)
=> ( ~ leq(nbr_proc,host(X1))
=> ! [X24] :
( s(host(X1)) = host(X24)
=> ( host(X3) != host(X24)
=> ! [X25,X26] :
( s(host(X1)) != host(X26)
=> ( host(X3) = host(X26)
=> ! [X27] :
( ( ( ( X3 != X24
& setIn(X24,alive) )
| X1 = X24 )
& ( ( X3 != X26
& setIn(X26,alive) )
| X1 = X26 )
& host(X24) != host(X26)
& host(X24) = host(X25)
& host(X26) = host(X27) )
=> ~ ( elem(m_Down(X25),X0)
& elem(m_Down(X27),snoc(queue(host(X24)),m_Halt(X1))) ) ) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f68]) ).
fof(f85,plain,
? [X0,X1,X2,X3] :
( ? [X24] :
( ? [X25,X26] :
( ? [X27] :
( elem(m_Down(X25),X0)
& elem(m_Down(X27),snoc(queue(host(X24)),m_Halt(X1)))
& ( ( X3 != X24
& setIn(X24,alive) )
| X1 = X24 )
& ( ( X3 != X26
& setIn(X26,alive) )
| X1 = X26 )
& host(X24) != host(X26)
& host(X24) = host(X25)
& host(X26) = host(X27) )
& host(X3) = host(X26)
& s(host(X1)) != host(X26) )
& host(X3) != host(X24)
& s(host(X1)) = host(X24) )
& ~ leq(nbr_proc,host(X1))
& host(X1) = s(zero)
& ! [X23] :
( leq(X23,X1)
| host(X3) != host(X23) )
& ~ setIn(X1,pids)
& host(X3) = host(X1)
& index(ldr,host(X3)) = host(X3)
& index(status,host(X3)) = norm
& index(elid,host(X3)) = X2
& setIn(X3,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(X3)) = cons(m_NotNorm(X2),X0) ),
inference(ennf_transformation,[],[f69]) ).
fof(f86,plain,
? [X0,X1,X2,X3] :
( ? [X24] :
( ? [X25,X26] :
( ? [X27] :
( elem(m_Down(X25),X0)
& elem(m_Down(X27),snoc(queue(host(X24)),m_Halt(X1)))
& ( ( X3 != X24
& setIn(X24,alive) )
| X1 = X24 )
& ( ( X3 != X26
& setIn(X26,alive) )
| X1 = X26 )
& host(X24) != host(X26)
& host(X24) = host(X25)
& host(X26) = host(X27) )
& host(X3) = host(X26)
& s(host(X1)) != host(X26) )
& host(X3) != host(X24)
& s(host(X1)) = host(X24) )
& ~ leq(nbr_proc,host(X1))
& host(X1) = s(zero)
& ! [X23] :
( leq(X23,X1)
| host(X3) != host(X23) )
& ~ setIn(X1,pids)
& host(X3) = host(X1)
& index(ldr,host(X3)) = host(X3)
& index(status,host(X3)) = norm
& index(elid,host(X3)) = X2
& setIn(X3,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(X3)) = cons(m_NotNorm(X2),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] :
( elem(m_Down(X5),X0)
& elem(m_Down(X7),snoc(queue(host(X4)),m_Halt(X1)))
& ( ( X3 != X4
& setIn(X4,alive) )
| X1 = X4 )
& ( ( X3 != X6
& setIn(X6,alive) )
| X1 = X6 )
& host(X4) != host(X6)
& host(X4) = host(X5)
& host(X6) = host(X7) )
& host(X6) = host(X3)
& host(X6) != s(host(X1)) )
& host(X4) != host(X3)
& host(X4) = s(host(X1)) )
& ~ leq(nbr_proc,host(X1))
& host(X1) = s(zero)
& ! [X8] :
( leq(X8,X1)
| host(X3) != host(X8) )
& ~ setIn(X1,pids)
& host(X3) = host(X1)
& index(ldr,host(X3)) = host(X3)
& index(status,host(X3)) = norm
& index(elid,host(X3)) = X2
& setIn(X3,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(X3)) = cons(m_NotNorm(X2),X0) ),
inference(rectify,[],[f86]) ).
fof(f113,plain,
( elem(m_Down(sK8),sK3)
& elem(m_Down(sK10),snoc(queue(host(sK7)),m_Halt(sK4)))
& ( ( sK6 != sK7
& setIn(sK7,alive) )
| sK4 = sK7 )
& ( ( sK6 != sK9
& setIn(sK9,alive) )
| sK4 = sK9 )
& host(sK7) != host(sK9)
& host(sK7) = host(sK8)
& host(sK9) = host(sK10)
& host(sK9) = host(sK6)
& host(sK9) != s(host(sK4))
& host(sK7) != host(sK6)
& host(sK7) = s(host(sK4))
& ~ leq(nbr_proc,host(sK4))
& s(zero) = host(sK4)
& ! [X8] :
( leq(X8,sK4)
| host(X8) != host(sK6) )
& ~ setIn(sK4,pids)
& host(sK6) = host(sK4)
& host(sK6) = index(ldr,host(sK6))
& norm = index(status,host(sK6))
& sK5 = index(elid,host(sK6))
& setIn(sK6,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(sK6)) = cons(m_NotNorm(sK5),sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6,sK7,sK8,sK9,sK10]),skolemize(X0,sK3),skolemize(X1,sK4),skolemize(X2,sK5),skolemize(X3,sK6),skolemize(X4,sK7),skolemize(X5,sK8),skolemize(X6,sK9),skolemize(X7,sK10)],[f112]) ).
fof(f132,plain,
! [X0,X1] : m_Halt(X1) != m_Down(X0),
inference(cnf_transformation,[],[f18]) ).
fof(f167,plain,
! [X2,X0,X1] :
( elem(X0,cons(X1,X2))
| ~ elem(X0,X2) ),
inference(cnf_transformation,[],[f93]) ).
fof(f169,plain,
! [X2,X0,X1] :
( X0 = X1
| elem(X0,X2)
| ~ elem(X0,snoc(X2,X1)) ),
inference(cnf_transformation,[],[f95]) ).
fof(f210,plain,
queue(host(sK6)) = cons(m_NotNorm(sK5),sK3),
inference(cnf_transformation,[],[f113]) ).
fof(f211,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,[],[f113]) ).
fof(f216,plain,
! [X14,X13] :
( host(X13) != host(X14)
| ~ elem(m_Down(X14),queue(host(X13))) ),
inference(cnf_transformation,[],[f113]) ).
fof(f219,plain,
setIn(sK6,alive),
inference(cnf_transformation,[],[f113]) ).
fof(f223,plain,
host(sK6) = host(sK4),
inference(cnf_transformation,[],[f113]) ).
fof(f231,plain,
host(sK9) = host(sK6),
inference(cnf_transformation,[],[f113]) ).
fof(f232,plain,
host(sK9) = host(sK10),
inference(cnf_transformation,[],[f113]) ).
fof(f233,plain,
host(sK7) = host(sK8),
inference(cnf_transformation,[],[f113]) ).
fof(f237,plain,
( setIn(sK7,alive)
| sK4 = sK7 ),
inference(cnf_transformation,[],[f113]) ).
fof(f239,plain,
elem(m_Down(sK10),snoc(queue(host(sK7)),m_Halt(sK4))),
inference(cnf_transformation,[],[f113]) ).
fof(f240,plain,
elem(m_Down(sK8),sK3),
inference(cnf_transformation,[],[f113]) ).
fof(f259,plain,
! [X2,X0,X1] :
( ~ elem(X0,cons(X1,X2))
| elem(X0,X2) ),
inference(consistent_polarity_flipping,[],[f167]) ).
fof(f263,plain,
! [X2,X0,X1] :
( elem(X0,snoc(X2,X1))
| ~ elem(X0,X2)
| X0 = X1 ),
inference(consistent_polarity_flipping,[],[f169]) ).
fof(f270,plain,
~ elem(m_Down(sK8),sK3),
inference(consistent_polarity_flipping,[],[f240]) ).
fof(f271,plain,
~ elem(m_Down(sK10),snoc(queue(host(sK7)),m_Halt(sK4))),
inference(consistent_polarity_flipping,[],[f239]) ).
fof(f272,plain,
( ~ setIn(sK7,alive)
| sK4 = sK7 ),
inference(consistent_polarity_flipping,[],[f237]) ).
fof(f275,plain,
~ setIn(sK6,alive),
inference(consistent_polarity_flipping,[],[f219]) ).
fof(f278,plain,
! [X14,X13] :
( elem(m_Down(X14),queue(host(X13)))
| host(X13) != host(X14) ),
inference(consistent_polarity_flipping,[],[f216]) ).
fof(f283,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(consistent_polarity_flipping,[],[f211]) ).
fof(f299,definition,
( spl11_4
<=> sK4 = sK7 ),
introduced(definition,[new_symbols(definition,[spl11_4])],[avatar_definition]) ).
fof(f301,plain,
( sK4 = sK7
| ~ spl11_4 ),
inference(avatar_component_clause,[],[f299]) ).
fof(f303,definition,
( spl11_5
<=> setIn(sK7,alive) ),
introduced(definition,[new_symbols(definition,[spl11_5])],[avatar_definition]) ).
fof(f306,plain,
( spl11_4
| ~ spl11_5 ),
inference(avatar_split_clause,[],[f272,f303,f299]) ).
fof(f348,definition,
( spl11_10
<=> host(sK7) = host(sK4) ),
introduced(definition,[new_symbols(definition,[spl11_10])],[avatar_definition]) ).
fof(f350,plain,
( host(sK7) != host(sK4)
| spl11_10 ),
inference(avatar_component_clause,[],[f348]) ).
fof(f483,definition,
( spl11_26
<=> setIn(sK6,alive) ),
introduced(definition,[new_symbols(definition,[spl11_26])],[avatar_definition]) ).
fof(f485,plain,
( setIn(sK6,alive)
| ~ spl11_26 ),
inference(avatar_component_clause,[],[f483]) ).
fof(f490,plain,
( $false
| ~ spl11_26 ),
inference(resolution,[],[f485,f275]) ).
fof(f491,plain,
~ spl11_26,
inference(avatar_contradiction_clause,[],[f490]) ).
fof(f694,definition,
( spl11_57
<=> host(sK9) = host(sK4) ),
introduced(definition,[new_symbols(definition,[spl11_57])],[avatar_definition]) ).
fof(f696,plain,
( host(sK9) != host(sK4)
| spl11_57 ),
inference(avatar_component_clause,[],[f694]) ).
fof(f700,plain,
( host(sK6) != host(sK4)
| spl11_57 ),
inference(superposition,[],[f696,f231]) ).
fof(f701,plain,
( host(sK4) != host(sK4)
| spl11_57 ),
inference(superposition,[],[f700,f223]) ).
fof(f702,plain,
( $false
| spl11_57 ),
inference(trivial_inequality_removal,[],[f701]) ).
fof(f703,plain,
spl11_57,
inference(avatar_contradiction_clause,[],[f702]) ).
fof(f1132,plain,
! [X2,X0,X1] :
( elem(m_Down(X0),queue(host(sK4)))
| elem(m_Down(X1),queue(host(X2)))
| host(X2) = host(sK4)
| setIn(sK6,alive)
| setIn(X2,alive)
| host(X1) != host(sK4)
| host(X0) != host(X2) ),
inference(superposition,[],[f283,f223]) ).
fof(f1142,definition,
( spl11_60
<=> ! [X2,X0,X1] :
( elem(m_Down(X0),queue(host(sK4)))
| host(X0) != host(X2)
| elem(m_Down(X1),queue(host(X2)))
| host(X1) != host(sK4)
| setIn(X2,alive)
| host(X2) = host(sK4) ) ),
introduced(definition,[new_symbols(definition,[spl11_60])],[avatar_definition]) ).
fof(f1143,plain,
( ! [X2,X0,X1] :
( elem(m_Down(X0),queue(host(sK4)))
| host(X0) != host(X2)
| elem(m_Down(X1),queue(host(X2)))
| host(X1) != host(sK4)
| setIn(X2,alive)
| host(X2) = host(sK4) )
| ~ spl11_60 ),
inference(avatar_component_clause,[],[f1142]) ).
fof(f1145,plain,
( spl11_26
| spl11_60 ),
inference(avatar_split_clause,[],[f1132,f1142,f483]) ).
fof(f2122,plain,
! [X0] :
( elem(X0,sK3)
| ~ elem(X0,queue(host(sK6))) ),
inference(superposition,[],[f259,f210]) ).
fof(f2123,plain,
~ elem(m_Down(sK8),queue(host(sK6))),
inference(resolution,[],[f2122,f270]) ).
fof(f2129,plain,
~ elem(m_Down(sK8),queue(host(sK4))),
inference(superposition,[],[f2123,f223]) ).
fof(f2136,plain,
( ! [X0,X1] :
( host(X0) != host(sK8)
| elem(m_Down(X1),queue(host(X0)))
| host(X1) != host(sK4)
| setIn(X0,alive)
| host(X0) = host(sK4) )
| ~ spl11_60 ),
inference(resolution,[],[f2129,f1143]) ).
fof(f2138,plain,
host(sK8) != host(sK4),
inference(resolution,[],[f2129,f278]) ).
fof(f2141,definition,
( spl11_66
<=> ! [X0,X1] :
( elem(m_Down(X0),queue(host(X1)))
| host(X1) != host(sK8)
| host(X0) != host(sK4)
| setIn(X1,alive)
| host(X1) = host(sK4) ) ),
introduced(definition,[new_symbols(definition,[spl11_66])],[avatar_definition]) ).
fof(f2142,plain,
( ! [X0,X1] :
( host(X1) != host(sK8)
| elem(m_Down(X0),queue(host(X1)))
| host(X0) != host(sK4)
| setIn(X1,alive)
| host(X1) = host(sK4) )
| ~ spl11_66 ),
inference(avatar_component_clause,[],[f2141]) ).
fof(f2144,plain,
( spl11_66
| ~ spl11_60 ),
inference(avatar_split_clause,[],[f2136,f1142,f2141]) ).
fof(f2145,plain,
host(sK7) != host(sK4),
inference(superposition,[],[f2138,f233]) ).
fof(f2222,plain,
( ! [X0,X1] :
( host(X1) != host(sK4)
| elem(m_Down(X1),queue(host(X0)))
| host(X0) != host(sK7)
| setIn(X0,alive)
| host(X0) = host(sK4) )
| ~ spl11_66 ),
inference(superposition,[],[f2142,f233]) ).
fof(f2272,plain,
( ! [X0] :
( host(sK9) != host(sK4)
| elem(m_Down(sK10),queue(host(X0)))
| host(X0) != host(sK7)
| setIn(X0,alive)
| host(X0) = host(sK4) )
| ~ spl11_66 ),
inference(superposition,[],[f2222,f232]) ).
fof(f2277,definition,
( spl11_68
<=> ! [X0] :
( elem(m_Down(sK10),queue(host(X0)))
| host(X0) = host(sK4)
| setIn(X0,alive)
| host(X0) != host(sK7) ) ),
introduced(definition,[new_symbols(definition,[spl11_68])],[avatar_definition]) ).
fof(f2278,plain,
( ! [X0] :
( elem(m_Down(sK10),queue(host(X0)))
| host(X0) = host(sK4)
| setIn(X0,alive)
| host(X0) != host(sK7) )
| ~ spl11_68 ),
inference(avatar_component_clause,[],[f2277]) ).
fof(f2279,plain,
( spl11_68
| ~ spl11_57
| ~ spl11_66 ),
inference(avatar_split_clause,[],[f2272,f2141,f694,f2277]) ).
fof(f4475,plain,
( ~ elem(m_Down(sK10),queue(host(sK7)))
| m_Down(sK10) = m_Halt(sK4) ),
inference(resolution,[],[f263,f271]) ).
fof(f4482,definition,
( spl11_116
<=> m_Down(sK10) = m_Halt(sK4) ),
introduced(definition,[new_symbols(definition,[spl11_116])],[avatar_definition]) ).
fof(f4484,plain,
( m_Down(sK10) = m_Halt(sK4)
| ~ spl11_116 ),
inference(avatar_component_clause,[],[f4482]) ).
fof(f4486,definition,
( spl11_117
<=> elem(m_Down(sK10),queue(host(sK7))) ),
introduced(definition,[new_symbols(definition,[spl11_117])],[avatar_definition]) ).
fof(f4488,plain,
( ~ elem(m_Down(sK10),queue(host(sK7)))
| spl11_117 ),
inference(avatar_component_clause,[],[f4486]) ).
fof(f4489,plain,
( spl11_116
| ~ spl11_117 ),
inference(avatar_split_clause,[],[f4475,f4486,f4482]) ).
fof(f4490,plain,
( host(sK7) = host(sK4)
| setIn(sK7,alive)
| host(sK7) != host(sK7)
| ~ spl11_68
| spl11_117 ),
inference(resolution,[],[f4488,f2278]) ).
fof(f4496,plain,
( host(sK7) = host(sK4)
| setIn(sK7,alive)
| ~ spl11_68
| spl11_117 ),
inference(trivial_inequality_removal,[],[f4490]) ).
fof(f4506,plain,
( spl11_5
| spl11_10
| ~ spl11_68
| spl11_117 ),
inference(avatar_split_clause,[],[f4496,f4486,f2277,f348,f303]) ).
fof(f4510,plain,
( ! [X0] : m_Halt(X0) != m_Halt(sK4)
| ~ spl11_116 ),
inference(superposition,[],[f132,f4484]) ).
fof(f4520,plain,
( $false
| ~ spl11_116 ),
inference(equality_resolution,[],[f4510]) ).
fof(f4521,plain,
~ spl11_116,
inference(avatar_contradiction_clause,[],[f4520]) ).
fof(f4527,plain,
( host(sK4) != host(sK4)
| ~ spl11_4
| spl11_10 ),
inference(superposition,[],[f350,f301]) ).
fof(f4609,plain,
( $false
| ~ spl11_4
| spl11_10 ),
inference(trivial_inequality_removal,[],[f4527]) ).
fof(f4610,plain,
( ~ spl11_4
| spl11_10 ),
inference(avatar_contradiction_clause,[],[f4609]) ).
fof(f4618,plain,
~ spl11_10,
inference(avatar_split_clause,[],[f2145,f348]) ).
cnf(s3,plain,
( spl11_4
| ~ spl11_5 ),
inference(sat_conversion,[],[f306]) ).
cnf(s18,plain,
~ spl11_26,
inference(sat_conversion,[],[f491]) ).
cnf(s40,plain,
spl11_57,
inference(sat_conversion,[],[f703]) ).
cnf(s68,plain,
( spl11_26
| spl11_60 ),
inference(sat_conversion,[],[f1145]) ).
cnf(s80,plain,
( ~ spl11_60
| spl11_66 ),
inference(sat_conversion,[],[f2144]) ).
cnf(s82,plain,
( ~ spl11_57
| ~ spl11_66
| spl11_68 ),
inference(sat_conversion,[],[f2279]) ).
cnf(s139,plain,
( spl11_116
| ~ spl11_117 ),
inference(sat_conversion,[],[f4489]) ).
cnf(s142,plain,
( spl11_5
| spl11_10
| ~ spl11_68
| spl11_117 ),
inference(sat_conversion,[],[f4506]) ).
cnf(s143,plain,
~ spl11_116,
inference(sat_conversion,[],[f4521]) ).
cnf(s144,plain,
( ~ spl11_4
| spl11_10 ),
inference(sat_conversion,[],[f4610]) ).
cnf(s152,plain,
~ spl11_10,
inference(sat_conversion,[],[f4618]) ).
cnf(s154,plain,
~ spl11_4,
inference(rat,[],[s144,s152]) ).
cnf(s155,plain,
( spl11_5
| ~ spl11_68
| spl11_117 ),
inference(rat,[],[s142,s152]) ).
cnf(s156,plain,
~ spl11_117,
inference(rat,[],[s139,s143]) ).
cnf(s177,plain,
spl11_60,
inference(rat,[],[s68,s18]) ).
cnf(s179,plain,
spl11_66,
inference(rat,[],[s80,s177]) ).
cnf(s181,plain,
spl11_68,
inference(rat,[],[s82,s40,s179]) ).
cnf(s182,plain,
spl11_5,
inference(rat,[],[s155,s156,s181]) ).
cnf(s190,plain,
$false,
inference(rat,[],[s3,s182,s154]) ).
fof(f4623,plain,
$false,
inference(avatar_sat_refutation,[],[s190]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV451+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19 % Computer : n026.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Mon Sep 28 11:11:12 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.23 Running first-order model finding
% 0.09/0.23 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.20/0.30 % (3788245)Will run a generic schedule for satisfiability detection.
% 0.20/0.30 % (3788256)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3579155211:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.30 % (3788251)% WARNING: option uhcvi not known.
% 0.20/0.30 % (3788250)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3861811888_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.30 % (3788252)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2510518325:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.30 % (3788253)dis+10_1_sil=32000:sp=arity:random_seed=373654572:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.30 % (3788251)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=835700254:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.30 % (3788255)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1066110095:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.30 % (3788254)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=112903094:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.30 % Detected minimum model sizes of [4]
% 0.20/0.30 % Detected maximum model sizes of [max]
% 0.20/0.30 % TRYING [4]
% 0.20/0.30 % TRYING [5]
% 0.20/0.30 % (3788256) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3788245-3788256"...
% 0.20/0.30 % (3788256)...printing done.
% 0.20/0.30 % (3788256)Refutation found. Thanks to Tanya!
% 0.20/0.30 % SZS status Theorem for theBenchmark
% 0.20/0.30 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.30 % (3788256)------------------------------
% 0.20/0.30 % (3788256)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.30 % (3788256)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.30 % (3788256)CaDiCaL version: 2.1.3
% 0.20/0.30 % (3788256)Termination reason: Refutation
% 0.20/0.30 % (3788256)Time elapsed: 0.041 s
% 0.20/0.30 % (3788256)Peak memory usage: 14 MB
% 0.20/0.30 % (3788256)Instructions burned: 119 (million)
% 0.20/0.30 % (3788245)Success in time 0.064 s
% 0.20/0.30 % Vampire exiting
%------------------------------------------------------------------------------