%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV453+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 : n005.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.19s 0.27s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 12
% Syntax : Number of formulae : 98 ( 29 unt; 10 def)
% Number of atoms : 570 ( 223 equ)
% Maximal formula atoms : 50 ( 5 avg)
% Number of connectives : 763 ( 291 ~; 210 |; 197 &)
% ( 11 <=>; 54 =>; 0 <=; 0 <~>)
% Maximal formula depth : 35 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 11 prp; 0-2 aty)
% Number of functors : 24 ( 24 usr; 16 con; 0-2 aty)
% Number of variables : 231 ( 0 sgn 207 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f47,axiom,
! [X0,X1,X2] :
( elem(X0,cons(X1,X2))
<=> ( X0 = X1
| elem(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_46) ).
fof(f67,conjecture,
! [X0,X1,X2,X3] :
( ( ! [X4,X5] :
( setIn(X5,alive)
=> ~ elem(m_Down(X5),queue(host(X4))) )
& ! [X4,X5] :
( elem(m_Down(X5),queue(host(X4)))
=> ~ setIn(X5,alive) )
& ! [X4,X5] :
( elem(m_Down(X5),queue(host(X4)))
=> host(X5) != host(X4) )
& ! [X4,X5] :
( elem(m_Halt(X5),queue(host(X4)))
=> ~ leq(host(X4),host(X5)) )
& ! [X4,X6,X5] :
( elem(m_Ack(X5,X4),queue(host(X6)))
=> ~ leq(host(X4),host(X5)) )
& ! [X4,X5] :
( ( ~ setIn(X4,alive)
& leq(X5,X4)
& host(X5) = host(X4) )
=> ~ setIn(X5,alive) )
& ! [X4,X5] :
( ( X5 != X4
& host(X5) = host(X4) )
=> ( ~ setIn(X4,alive)
| ~ setIn(X5,alive) ) )
& ! [X4,X7,X6,X5] :
( ( host(X6) != host(X4)
& setIn(X4,alive)
& setIn(X6,alive)
& host(X7) = host(X4)
& host(X5) = host(X6) )
=> ~ ( elem(m_Down(X5),queue(host(X4)))
& elem(m_Down(X7),queue(host(X6))) ) )
& queue(host(X2)) = cons(m_Down(X3),X0) )
=> ( setIn(X2,alive)
=> ( ~ leq(host(X2),host(X3))
=> ( ( ( index(ldr,host(X2)) = host(X3)
& index(status,host(X2)) = norm )
| ( index(status,host(X2)) = wait
& host(X3) = host(index(elid,host(X2))) ) )
=> ( ( ! [X4] :
( host(X2) = host(X4)
=> leq(X4,X1) )
& ~ setIn(X1,pids)
& host(X2) = host(X1) )
=> ( host(X1) != s(zero)
=> ! [X4] :
( host(X2) != host(X4)
=> ! [X8,X9] :
( host(X2) = host(X9)
=> ! [X10] :
( ( ( ( X4 != X2
& setIn(X4,alive) )
| X4 = X1 )
& ( ( X9 != X2
& 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),queue(host(X4))) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
fof(f68,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( ! [X4,X5] :
( setIn(X5,alive)
=> ~ elem(m_Down(X5),queue(host(X4))) )
& ! [X4,X5] :
( elem(m_Down(X5),queue(host(X4)))
=> ~ setIn(X5,alive) )
& ! [X4,X5] :
( elem(m_Down(X5),queue(host(X4)))
=> host(X5) != host(X4) )
& ! [X4,X5] :
( elem(m_Halt(X5),queue(host(X4)))
=> ~ leq(host(X4),host(X5)) )
& ! [X4,X6,X5] :
( elem(m_Ack(X5,X4),queue(host(X6)))
=> ~ leq(host(X4),host(X5)) )
& ! [X4,X5] :
( ( ~ setIn(X4,alive)
& leq(X5,X4)
& host(X5) = host(X4) )
=> ~ setIn(X5,alive) )
& ! [X4,X5] :
( ( X5 != X4
& host(X5) = host(X4) )
=> ( ~ setIn(X4,alive)
| ~ setIn(X5,alive) ) )
& ! [X4,X7,X6,X5] :
( ( host(X6) != host(X4)
& setIn(X4,alive)
& setIn(X6,alive)
& host(X7) = host(X4)
& host(X5) = host(X6) )
=> ~ ( elem(m_Down(X5),queue(host(X4)))
& elem(m_Down(X7),queue(host(X6))) ) )
& queue(host(X2)) = cons(m_Down(X3),X0) )
=> ( setIn(X2,alive)
=> ( ~ leq(host(X2),host(X3))
=> ( ( ( index(ldr,host(X2)) = host(X3)
& index(status,host(X2)) = norm )
| ( index(status,host(X2)) = wait
& host(X3) = host(index(elid,host(X2))) ) )
=> ( ( ! [X4] :
( host(X2) = host(X4)
=> leq(X4,X1) )
& ~ setIn(X1,pids)
& host(X2) = host(X1) )
=> ( host(X1) != s(zero)
=> ! [X4] :
( host(X2) != host(X4)
=> ! [X8,X9] :
( host(X2) = host(X9)
=> ! [X10] :
( ( ( ( X4 != X2
& setIn(X4,alive) )
| X4 = X1 )
& ( ( X9 != X2
& 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),queue(host(X4))) ) ) ) ) ) ) ) ) ) ),
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(X2)) = cons(m_Down(X3),X0) )
=> ( setIn(X2,alive)
=> ( ~ leq(host(X2),host(X3))
=> ( ( ( index(ldr,host(X2)) = host(X3)
& index(status,host(X2)) = norm )
| ( index(status,host(X2)) = wait
& host(X3) = host(index(elid,host(X2))) ) )
=> ( ( ! [X23] :
( host(X2) = host(X23)
=> leq(X23,X1) )
& ~ setIn(X1,pids)
& host(X2) = host(X1) )
=> ( host(X1) != s(zero)
=> ! [X24] :
( host(X2) != host(X24)
=> ! [X25,X26] :
( host(X2) = host(X26)
=> ! [X27] :
( ( ( ( X2 != X24
& setIn(X24,alive) )
| X1 = X24 )
& ( ( X2 != 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),queue(host(X24))) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f68]) ).
fof(f85,plain,
? [X0,X1,X2,X3] :
( ? [X24] :
( ? [X25,X26] :
( ? [X27] :
( elem(m_Down(X25),X0)
& elem(m_Down(X27),queue(host(X24)))
& ( ( X2 != X24
& setIn(X24,alive) )
| X1 = X24 )
& ( ( X2 != X26
& setIn(X26,alive) )
| X1 = X26 )
& host(X24) != host(X26)
& host(X24) = host(X25)
& host(X26) = host(X27) )
& host(X2) = host(X26) )
& host(X2) != host(X24) )
& host(X1) != s(zero)
& ! [X23] :
( leq(X23,X1)
| host(X2) != host(X23) )
& ~ setIn(X1,pids)
& host(X2) = host(X1)
& ( ( index(ldr,host(X2)) = host(X3)
& index(status,host(X2)) = norm )
| ( index(status,host(X2)) = wait
& host(X3) = host(index(elid,host(X2))) ) )
& ~ leq(host(X2),host(X3))
& setIn(X2,alive)
& ! [X4,X5] :
( ~ elem(m_Down(X5),queue(host(X4)))
| ~ setIn(X5,alive) )
& ! [X6,X7] :
( ~ setIn(X7,alive)
| ~ elem(m_Down(X7),queue(host(X6))) )
& ! [X8,X9] :
( host(X9) != host(X8)
| ~ elem(m_Down(X9),queue(host(X8))) )
& ! [X10,X11] :
( ~ leq(host(X10),host(X11))
| ~ elem(m_Halt(X11),queue(host(X10))) )
& ! [X12,X13,X14] :
( ~ leq(host(X12),host(X14))
| ~ elem(m_Ack(X14,X12),queue(host(X13))) )
& ! [X15,X16] :
( ~ setIn(X16,alive)
| setIn(X15,alive)
| ~ leq(X16,X15)
| host(X15) != host(X16) )
& ! [X17,X18] :
( ~ setIn(X17,alive)
| ~ setIn(X18,alive)
| X17 = X18
| host(X17) != host(X18) )
& ! [X19,X20,X21,X22] :
( ~ elem(m_Down(X22),queue(host(X19)))
| ~ elem(m_Down(X20),queue(host(X21)))
| host(X19) = host(X21)
| ~ setIn(X19,alive)
| ~ setIn(X21,alive)
| host(X19) != host(X20)
| host(X21) != host(X22) )
& queue(host(X2)) = cons(m_Down(X3),X0) ),
inference(ennf_transformation,[],[f69]) ).
fof(f86,plain,
? [X0,X1,X2,X3] :
( ? [X24] :
( ? [X25,X26] :
( ? [X27] :
( elem(m_Down(X25),X0)
& elem(m_Down(X27),queue(host(X24)))
& ( ( X2 != X24
& setIn(X24,alive) )
| X1 = X24 )
& ( ( X2 != X26
& setIn(X26,alive) )
| X1 = X26 )
& host(X24) != host(X26)
& host(X24) = host(X25)
& host(X26) = host(X27) )
& host(X2) = host(X26) )
& host(X2) != host(X24) )
& host(X1) != s(zero)
& ! [X23] :
( leq(X23,X1)
| host(X2) != host(X23) )
& ~ setIn(X1,pids)
& host(X2) = host(X1)
& ( ( index(ldr,host(X2)) = host(X3)
& index(status,host(X2)) = norm )
| ( index(status,host(X2)) = wait
& host(X3) = host(index(elid,host(X2))) ) )
& ~ leq(host(X2),host(X3))
& setIn(X2,alive)
& ! [X4,X5] :
( ~ elem(m_Down(X5),queue(host(X4)))
| ~ setIn(X5,alive) )
& ! [X6,X7] :
( ~ setIn(X7,alive)
| ~ elem(m_Down(X7),queue(host(X6))) )
& ! [X8,X9] :
( host(X9) != host(X8)
| ~ elem(m_Down(X9),queue(host(X8))) )
& ! [X10,X11] :
( ~ leq(host(X10),host(X11))
| ~ elem(m_Halt(X11),queue(host(X10))) )
& ! [X12,X13,X14] :
( ~ leq(host(X12),host(X14))
| ~ elem(m_Ack(X14,X12),queue(host(X13))) )
& ! [X15,X16] :
( ~ setIn(X16,alive)
| setIn(X15,alive)
| ~ leq(X16,X15)
| host(X15) != host(X16) )
& ! [X17,X18] :
( ~ setIn(X17,alive)
| ~ setIn(X18,alive)
| X17 = X18
| host(X17) != host(X18) )
& ! [X19,X20,X21,X22] :
( ~ elem(m_Down(X22),queue(host(X19)))
| ~ elem(m_Down(X20),queue(host(X21)))
| host(X19) = host(X21)
| ~ setIn(X19,alive)
| ~ setIn(X21,alive)
| host(X19) != host(X20)
| host(X21) != host(X22) )
& queue(host(X2)) = cons(m_Down(X3),X0) ),
inference(flattening,[],[f85]) ).
fof(f92,plain,
! [X0,X1,X2] :
( ( elem(X0,cons(X1,X2))
| ( X0 != X1
& ~ elem(X0,X2) ) )
& ( X0 = X1
| elem(X0,X2)
| ~ elem(X0,cons(X1,X2)) ) ),
inference(nnf_transformation,[],[f47]) ).
fof(f93,plain,
! [X0,X1,X2] :
( ( elem(X0,cons(X1,X2))
| ( X0 != X1
& ~ elem(X0,X2) ) )
& ( X0 = X1
| elem(X0,X2)
| ~ elem(X0,cons(X1,X2)) ) ),
inference(flattening,[],[f92]) ).
fof(f112,plain,
? [X0,X1,X2,X3] :
( ? [X4] :
( ? [X5,X6] :
( ? [X7] :
( elem(m_Down(X5),X0)
& elem(m_Down(X7),queue(host(X4)))
& ( ( X2 != X4
& setIn(X4,alive) )
| X1 = X4 )
& ( ( X2 != X6
& setIn(X6,alive) )
| X1 = X6 )
& host(X4) != host(X6)
& host(X4) = host(X5)
& host(X6) = host(X7) )
& host(X2) = host(X6) )
& host(X2) != host(X4) )
& host(X1) != s(zero)
& ! [X8] :
( leq(X8,X1)
| host(X2) != host(X8) )
& ~ setIn(X1,pids)
& host(X2) = host(X1)
& ( ( index(ldr,host(X2)) = host(X3)
& index(status,host(X2)) = norm )
| ( index(status,host(X2)) = wait
& host(X3) = host(index(elid,host(X2))) ) )
& ~ leq(host(X2),host(X3))
& 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_Down(X3),X0) ),
inference(rectify,[],[f86]) ).
fof(f113,plain,
( elem(m_Down(sK8),sK3)
& elem(m_Down(sK10),queue(host(sK7)))
& ( ( sK5 != sK7
& setIn(sK7,alive) )
| sK4 = sK7 )
& ( ( sK5 != sK9
& setIn(sK9,alive) )
| sK4 = sK9 )
& host(sK7) != host(sK9)
& host(sK7) = host(sK8)
& host(sK9) = host(sK10)
& host(sK9) = host(sK5)
& host(sK7) != host(sK5)
& s(zero) != host(sK4)
& ! [X8] :
( leq(X8,sK4)
| host(X8) != host(sK5) )
& ~ setIn(sK4,pids)
& host(sK5) = host(sK4)
& ( ( host(sK6) = index(ldr,host(sK5))
& norm = index(status,host(sK5)) )
| ( wait = index(status,host(sK5))
& host(sK6) = host(index(elid,host(sK5))) ) )
& ~ leq(host(sK5),host(sK6))
& 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_Down(sK6),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(f167,plain,
! [X2,X0,X1] :
( elem(X0,cons(X1,X2))
| ~ elem(X0,X2) ),
inference(cnf_transformation,[],[f93]) ).
fof(f210,plain,
queue(host(sK5)) = cons(m_Down(sK6),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(f213,plain,
! [X21,X20] :
( ~ setIn(X21,alive)
| setIn(X20,alive)
| ~ leq(X21,X20)
| host(X21) != host(X20) ),
inference(cnf_transformation,[],[f113]) ).
fof(f219,plain,
setIn(sK5,alive),
inference(cnf_transformation,[],[f113]) ).
fof(f225,plain,
host(sK5) = host(sK4),
inference(cnf_transformation,[],[f113]) ).
fof(f227,plain,
! [X8] :
( leq(X8,sK4)
| host(X8) != host(sK5) ),
inference(cnf_transformation,[],[f113]) ).
fof(f229,plain,
host(sK7) != host(sK5),
inference(cnf_transformation,[],[f113]) ).
fof(f230,plain,
host(sK9) = host(sK5),
inference(cnf_transformation,[],[f113]) ).
fof(f231,plain,
host(sK9) = host(sK10),
inference(cnf_transformation,[],[f113]) ).
fof(f232,plain,
host(sK7) = host(sK8),
inference(cnf_transformation,[],[f113]) ).
fof(f234,plain,
( setIn(sK9,alive)
| sK4 = sK9 ),
inference(cnf_transformation,[],[f113]) ).
fof(f236,plain,
( setIn(sK7,alive)
| sK4 = sK7 ),
inference(cnf_transformation,[],[f113]) ).
fof(f238,plain,
elem(m_Down(sK10),queue(host(sK7))),
inference(cnf_transformation,[],[f113]) ).
fof(f239,plain,
elem(m_Down(sK8),sK3),
inference(cnf_transformation,[],[f113]) ).
fof(f260,plain,
! [X2,X0,X1] :
( ~ elem(X0,cons(X1,X2))
| elem(X0,X2) ),
inference(consistent_polarity_flipping,[],[f167]) ).
fof(f297,plain,
~ elem(m_Down(sK8),sK3),
inference(consistent_polarity_flipping,[],[f239]) ).
fof(f298,plain,
~ elem(m_Down(sK10),queue(host(sK7))),
inference(consistent_polarity_flipping,[],[f238]) ).
fof(f299,plain,
! [X8] :
( host(X8) != host(sK5)
| ~ leq(X8,sK4) ),
inference(consistent_polarity_flipping,[],[f227]) ).
fof(f306,plain,
! [X21,X20] :
( host(X21) != host(X20)
| setIn(X20,alive)
| leq(X21,X20)
| ~ setIn(X21,alive) ),
inference(consistent_polarity_flipping,[],[f213]) ).
fof(f307,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(f329,definition,
( spl11_5
<=> sK4 = sK9 ),
introduced(definition,[new_symbols(definition,[spl11_5])],[avatar_definition]) ).
fof(f331,plain,
( sK4 = sK9
| ~ spl11_5 ),
inference(avatar_component_clause,[],[f329]) ).
fof(f333,definition,
( spl11_6
<=> setIn(sK9,alive) ),
introduced(definition,[new_symbols(definition,[spl11_6])],[avatar_definition]) ).
fof(f336,plain,
( spl11_5
| spl11_6 ),
inference(avatar_split_clause,[],[f234,f333,f329]) ).
fof(f343,definition,
( spl11_8
<=> sK4 = sK7 ),
introduced(definition,[new_symbols(definition,[spl11_8])],[avatar_definition]) ).
fof(f345,plain,
( sK4 = sK7
| ~ spl11_8 ),
inference(avatar_component_clause,[],[f343]) ).
fof(f347,definition,
( spl11_9
<=> setIn(sK7,alive) ),
introduced(definition,[new_symbols(definition,[spl11_9])],[avatar_definition]) ).
fof(f350,plain,
( spl11_8
| spl11_9 ),
inference(avatar_split_clause,[],[f236,f347,f343]) ).
fof(f360,plain,
( host(sK5) != host(sK4)
| ~ spl11_8 ),
inference(superposition,[],[f229,f345]) ).
fof(f366,plain,
( host(sK4) != host(sK4)
| ~ spl11_8 ),
inference(superposition,[],[f360,f225]) ).
fof(f367,plain,
( $false
| ~ spl11_8 ),
inference(trivial_inequality_removal,[],[f366]) ).
fof(f368,plain,
~ spl11_8,
inference(avatar_contradiction_clause,[],[f367]) ).
fof(f378,plain,
~ leq(sK5,sK4),
inference(equality_resolution,[],[f299]) ).
fof(f477,definition,
( spl11_15
<=> setIn(sK5,alive) ),
introduced(definition,[new_symbols(definition,[spl11_15])],[avatar_definition]) ).
fof(f479,plain,
( ~ setIn(sK5,alive)
| spl11_15 ),
inference(avatar_component_clause,[],[f477]) ).
fof(f486,plain,
( $false
| spl11_15 ),
inference(resolution,[],[f479,f219]) ).
fof(f487,plain,
spl11_15,
inference(avatar_contradiction_clause,[],[f486]) ).
fof(f569,plain,
! [X0] :
( host(X0) != host(sK5)
| setIn(sK9,alive)
| leq(X0,sK9)
| ~ setIn(X0,alive) ),
inference(superposition,[],[f306,f230]) ).
fof(f581,definition,
( spl11_27
<=> ! [X0] :
( host(X0) != host(sK5)
| ~ setIn(X0,alive)
| leq(X0,sK9) ) ),
introduced(definition,[new_symbols(definition,[spl11_27])],[avatar_definition]) ).
fof(f582,plain,
( ! [X0] :
( host(X0) != host(sK5)
| ~ setIn(X0,alive)
| leq(X0,sK9) )
| ~ spl11_27 ),
inference(avatar_component_clause,[],[f581]) ).
fof(f583,plain,
( spl11_6
| spl11_27 ),
inference(avatar_split_clause,[],[f569,f581,f333]) ).
fof(f975,plain,
( ~ setIn(sK5,alive)
| leq(sK5,sK9)
| ~ spl11_27 ),
inference(equality_resolution,[],[f582]) ).
fof(f979,definition,
( spl11_58
<=> leq(sK5,sK9) ),
introduced(definition,[new_symbols(definition,[spl11_58])],[avatar_definition]) ).
fof(f981,plain,
( leq(sK5,sK9)
| ~ spl11_58 ),
inference(avatar_component_clause,[],[f979]) ).
fof(f1009,plain,
( spl11_58
| ~ spl11_15
| ~ spl11_27 ),
inference(avatar_split_clause,[],[f975,f581,f477,f979]) ).
fof(f1011,plain,
( leq(sK5,sK4)
| ~ spl11_5
| ~ spl11_58 ),
inference(superposition,[],[f981,f331]) ).
fof(f1013,plain,
( $false
| ~ spl11_5
| ~ spl11_58 ),
inference(resolution,[],[f1011,f378]) ).
fof(f1014,plain,
( ~ spl11_5
| ~ spl11_58 ),
inference(avatar_contradiction_clause,[],[f1013]) ).
fof(f1376,plain,
! [X0,X1] :
( elem(m_Down(X0),queue(host(X1)))
| host(X1) = host(sK7)
| ~ setIn(sK7,alive)
| ~ setIn(X1,alive)
| host(X0) != host(sK7)
| host(X1) != host(sK10) ),
inference(resolution,[],[f307,f298]) ).
fof(f1394,definition,
( spl11_70
<=> ! [X0,X1] :
( elem(m_Down(X0),queue(host(X1)))
| host(X1) != host(sK10)
| host(X0) != host(sK7)
| ~ setIn(X1,alive)
| host(X1) = host(sK7) ) ),
introduced(definition,[new_symbols(definition,[spl11_70])],[avatar_definition]) ).
fof(f1395,plain,
( ! [X0,X1] :
( host(X1) != host(sK10)
| elem(m_Down(X0),queue(host(X1)))
| host(X0) != host(sK7)
| ~ setIn(X1,alive)
| host(X1) = host(sK7) )
| ~ spl11_70 ),
inference(avatar_component_clause,[],[f1394]) ).
fof(f1396,plain,
( ~ spl11_9
| spl11_70 ),
inference(avatar_split_clause,[],[f1376,f1394,f347]) ).
fof(f1412,plain,
( ! [X0,X1] :
( host(X1) != host(sK7)
| elem(m_Down(X1),queue(host(X0)))
| host(X0) != host(sK9)
| ~ setIn(X0,alive)
| host(X0) = host(sK7) )
| ~ spl11_70 ),
inference(superposition,[],[f1395,f231]) ).
fof(f1415,plain,
( ! [X0] :
( host(sK7) != host(sK7)
| elem(m_Down(sK8),queue(host(X0)))
| host(X0) != host(sK9)
| ~ setIn(X0,alive)
| host(X0) = host(sK7) )
| ~ spl11_70 ),
inference(superposition,[],[f1412,f232]) ).
fof(f1419,plain,
( ! [X0] :
( elem(m_Down(sK8),queue(host(X0)))
| host(X0) != host(sK9)
| ~ setIn(X0,alive)
| host(X0) = host(sK7) )
| ~ spl11_70 ),
inference(trivial_inequality_removal,[],[f1415]) ).
fof(f1426,definition,
( spl11_72
<=> host(sK7) = host(sK5) ),
introduced(definition,[new_symbols(definition,[spl11_72])],[avatar_definition]) ).
fof(f1428,plain,
( host(sK7) = host(sK5)
| ~ spl11_72 ),
inference(avatar_component_clause,[],[f1426]) ).
fof(f1443,plain,
( host(sK5) != host(sK5)
| ~ spl11_72 ),
inference(superposition,[],[f229,f1428]) ).
fof(f1544,plain,
( $false
| ~ spl11_72 ),
inference(trivial_inequality_removal,[],[f1443]) ).
fof(f1545,plain,
~ spl11_72,
inference(avatar_contradiction_clause,[],[f1544]) ).
fof(f1704,plain,
( elem(m_Down(sK8),queue(host(sK5)))
| host(sK5) != host(sK5)
| ~ setIn(sK9,alive)
| host(sK7) = host(sK5)
| ~ spl11_70 ),
inference(superposition,[],[f1419,f230]) ).
fof(f1707,plain,
( elem(m_Down(sK8),queue(host(sK5)))
| ~ setIn(sK9,alive)
| host(sK7) = host(sK5)
| ~ spl11_70 ),
inference(trivial_inequality_removal,[],[f1704]) ).
fof(f1710,definition,
( spl11_83
<=> elem(m_Down(sK8),queue(host(sK5))) ),
introduced(definition,[new_symbols(definition,[spl11_83])],[avatar_definition]) ).
fof(f1713,plain,
( spl11_72
| ~ spl11_6
| spl11_83
| ~ spl11_70 ),
inference(avatar_split_clause,[],[f1707,f1394,f1710,f333,f1426]) ).
fof(f2678,plain,
! [X0] :
( elem(X0,sK3)
| ~ elem(X0,queue(host(sK5))) ),
inference(superposition,[],[f260,f210]) ).
fof(f2679,plain,
~ elem(m_Down(sK8),queue(host(sK5))),
inference(resolution,[],[f2678,f297]) ).
fof(f2680,plain,
~ spl11_83,
inference(avatar_split_clause,[],[f2679,f1710]) ).
cnf(s5,plain,
( spl11_5
| spl11_6 ),
inference(sat_conversion,[],[f336]) ).
cnf(s7,plain,
( spl11_8
| spl11_9 ),
inference(sat_conversion,[],[f350]) ).
cnf(s9,plain,
~ spl11_8,
inference(sat_conversion,[],[f368]) ).
cnf(s16,plain,
spl11_15,
inference(sat_conversion,[],[f487]) ).
cnf(s22,plain,
( spl11_6
| spl11_27 ),
inference(sat_conversion,[],[f583]) ).
cnf(s55,plain,
( ~ spl11_15
| ~ spl11_27
| spl11_58 ),
inference(sat_conversion,[],[f1009]) ).
cnf(s56,plain,
( ~ spl11_5
| ~ spl11_58 ),
inference(sat_conversion,[],[f1014]) ).
cnf(s73,plain,
( ~ spl11_9
| spl11_70 ),
inference(sat_conversion,[],[f1396]) ).
cnf(s79,plain,
~ spl11_72,
inference(sat_conversion,[],[f1545]) ).
cnf(s97,plain,
( ~ spl11_6
| ~ spl11_70
| spl11_72
| spl11_83 ),
inference(sat_conversion,[],[f1713]) ).
cnf(s105,plain,
~ spl11_83,
inference(sat_conversion,[],[f2680]) ).
cnf(s106,plain,
( ~ spl11_6
| ~ spl11_70
| spl11_72 ),
inference(rat,[],[s97,s105]) ).
cnf(s124,plain,
spl11_9,
inference(rat,[],[s7,s9]) ).
cnf(s125,plain,
spl11_70,
inference(rat,[],[s73,s124]) ).
cnf(s126,plain,
~ spl11_6,
inference(rat,[],[s106,s79,s125]) ).
cnf(s127,plain,
spl11_27,
inference(rat,[],[s22,s126]) ).
cnf(s128,plain,
spl11_58,
inference(rat,[],[s55,s16,s127]) ).
cnf(s129,plain,
~ spl11_5,
inference(rat,[],[s56,s128]) ).
cnf(s131,plain,
$false,
inference(rat,[],[s5,s126,s129]) ).
fof(f2681,plain,
$false,
inference(avatar_sat_refutation,[],[s131]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV453+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.18 % Computer : n005.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:09:01 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21 Running first-order model finding
% 0.08/0.21 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.19/0.27 % (722846)Will run a generic schedule for satisfiability detection.
% 0.19/0.27 % (722857)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2125357690:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.27 % (722852)% WARNING: option uhcvi not known.
% 0.19/0.27 % (722851)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2589954008_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.27 % (722853)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=580719465:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.27 % (722854)dis+10_1_sil=32000:sp=arity:random_seed=4038502525:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.27 % (722852)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2860201943:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.27 % (722856)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1665050589:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.27 % (722855)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=503998152:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.27 % Detected minimum model sizes of [4]
% 0.19/0.27 % Detected maximum model sizes of [max]
% 0.19/0.27 % TRYING [4]
% 0.19/0.27 % (722857) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-722846-722857"...
% 0.19/0.27 % (722854) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-722846-722854"...
% 0.19/0.27 % (722857)...printing done.
% 0.19/0.27 % (722857)Refutation found. Thanks to Tanya!
% 0.19/0.27 % SZS status Theorem for theBenchmark
% 0.19/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.27 % (722857)------------------------------
% 0.19/0.27 % (722857)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.27 % (722857)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.27 % (722857)CaDiCaL version: 2.1.3
% 0.19/0.27 % (722857)Termination reason: Refutation
% 0.19/0.27 % (722857)Time elapsed: 0.022 s
% 0.19/0.27 % (722857)Peak memory usage: 13 MB
% 0.19/0.27 % (722857)Instructions burned: 65 (million)
% 0.19/0.27 % (722846)Success in time 0.051 s
% 0.19/0.27 % Vampire exiting
%------------------------------------------------------------------------------