%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV456+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 : n011.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 : 21
% Number of leaves : 10
% Syntax : Number of formulae : 100 ( 27 unt; 8 def)
% Number of atoms : 611 ( 251 equ)
% Maximal formula atoms : 56 ( 6 avg)
% Number of connectives : 838 ( 327 ~; 229 |; 216 &)
% ( 9 <=>; 57 =>; 0 <=; 0 <~>)
% Maximal formula depth : 36 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 9 prp; 0-2 aty)
% Number of functors : 25 ( 25 usr; 17 con; 0-2 aty)
% Number of variables : 240 ( 0 sgn 216 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
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(f67,conjecture,
! [X0,X1,X2,X3] :
( ( ! [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))) ) )
& ! [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)))
& setIn(host(X7),index(down,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(X1) != host(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(X10),X0)
& setIn(host(X8),index(down,host(X9))) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
fof(f68,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( ! [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))) ) )
& ! [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)))
& setIn(host(X7),index(down,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(X1) != host(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(X10),X0)
& setIn(host(X8),index(down,host(X9))) ) ) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f67]) ).
fof(f69,plain,
~ ! [X0,X1,X2,X3] :
( ( ! [X4,X5] :
( elem(m_Down(X5),queue(host(X4)))
=> ~ setIn(X5,alive) )
& ! [X6,X7] :
( elem(m_Down(X7),queue(host(X6)))
=> host(X6) != host(X7) )
& ! [X8,X9] :
( elem(m_Halt(X9),queue(host(X8)))
=> ~ leq(host(X8),host(X9)) )
& ! [X10,X11,X12] :
( elem(m_Ack(X12,X10),queue(host(X11)))
=> ~ leq(host(X10),host(X12)) )
& ! [X13,X14] :
( ( ~ setIn(X13,alive)
& leq(X14,X13)
& host(X13) = host(X14) )
=> ~ setIn(X14,alive) )
& ! [X15,X16] :
( ( X15 != X16
& host(X15) = host(X16) )
=> ( ~ setIn(X15,alive)
| ~ setIn(X16,alive) ) )
& ! [X17,X18,X19,X20] :
( ( host(X17) != host(X19)
& setIn(X17,alive)
& setIn(X19,alive)
& host(X17) = host(X18)
& host(X19) = host(X20) )
=> ~ ( elem(m_Down(X20),queue(host(X17)))
& elem(m_Down(X18),queue(host(X19))) ) )
& ! [X21,X22,X23,X24] :
( ( host(X21) != host(X23)
& setIn(X21,alive)
& setIn(X23,alive)
& host(X21) = host(X22)
& host(X23) = host(X24) )
=> ~ ( elem(m_Down(X24),queue(host(X21)))
& setIn(host(X22),index(down,host(X23))) ) )
& 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))) ) )
=> ( ( ! [X25] :
( host(X2) = host(X25)
=> leq(X25,X1) )
& ~ setIn(X1,pids)
& host(X2) = host(X1) )
=> ( host(X1) != s(zero)
=> ! [X26] :
( host(X2) = host(X26)
=> ! [X27,X28] :
( host(X1) != host(X28)
=> ( host(X2) != host(X28)
=> ! [X29] :
( ( ( ( X2 != X26
& setIn(X26,alive) )
| X1 = X26 )
& ( ( X2 != X28
& setIn(X28,alive) )
| X1 = X28 )
& host(X26) != host(X28)
& host(X26) = host(X27)
& host(X28) = host(X29) )
=> ~ ( elem(m_Down(X29),X0)
& setIn(host(X27),index(down,host(X28))) ) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f68]) ).
fof(f85,plain,
? [X0,X1,X2,X3] :
( ? [X26] :
( ? [X27,X28] :
( ? [X29] :
( elem(m_Down(X29),X0)
& setIn(host(X27),index(down,host(X28)))
& ( ( X2 != X26
& setIn(X26,alive) )
| X1 = X26 )
& ( ( X2 != X28
& setIn(X28,alive) )
| X1 = X28 )
& host(X26) != host(X28)
& host(X26) = host(X27)
& host(X28) = host(X29) )
& host(X2) != host(X28)
& host(X1) != host(X28) )
& host(X2) = host(X26) )
& host(X1) != s(zero)
& ! [X25] :
( leq(X25,X1)
| host(X2) != host(X25) )
& ~ 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] :
( ~ setIn(X5,alive)
| ~ elem(m_Down(X5),queue(host(X4))) )
& ! [X6,X7] :
( host(X6) != host(X7)
| ~ elem(m_Down(X7),queue(host(X6))) )
& ! [X8,X9] :
( ~ leq(host(X8),host(X9))
| ~ elem(m_Halt(X9),queue(host(X8))) )
& ! [X10,X11,X12] :
( ~ leq(host(X10),host(X12))
| ~ elem(m_Ack(X12,X10),queue(host(X11))) )
& ! [X13,X14] :
( ~ setIn(X14,alive)
| setIn(X13,alive)
| ~ leq(X14,X13)
| host(X13) != host(X14) )
& ! [X15,X16] :
( ~ setIn(X15,alive)
| ~ setIn(X16,alive)
| X15 = X16
| host(X15) != host(X16) )
& ! [X17,X18,X19,X20] :
( ~ elem(m_Down(X20),queue(host(X17)))
| ~ elem(m_Down(X18),queue(host(X19)))
| host(X17) = host(X19)
| ~ setIn(X17,alive)
| ~ setIn(X19,alive)
| host(X17) != host(X18)
| host(X19) != host(X20) )
& ! [X21,X22,X23,X24] :
( ~ elem(m_Down(X24),queue(host(X21)))
| ~ setIn(host(X22),index(down,host(X23)))
| host(X21) = host(X23)
| ~ setIn(X21,alive)
| ~ setIn(X23,alive)
| host(X21) != host(X22)
| host(X23) != host(X24) )
& queue(host(X2)) = cons(m_Down(X3),X0) ),
inference(ennf_transformation,[],[f69]) ).
fof(f86,plain,
? [X0,X1,X2,X3] :
( ? [X26] :
( ? [X27,X28] :
( ? [X29] :
( elem(m_Down(X29),X0)
& setIn(host(X27),index(down,host(X28)))
& ( ( X2 != X26
& setIn(X26,alive) )
| X1 = X26 )
& ( ( X2 != X28
& setIn(X28,alive) )
| X1 = X28 )
& host(X26) != host(X28)
& host(X26) = host(X27)
& host(X28) = host(X29) )
& host(X2) != host(X28)
& host(X1) != host(X28) )
& host(X2) = host(X26) )
& host(X1) != s(zero)
& ! [X25] :
( leq(X25,X1)
| host(X2) != host(X25) )
& ~ 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] :
( ~ setIn(X5,alive)
| ~ elem(m_Down(X5),queue(host(X4))) )
& ! [X6,X7] :
( host(X6) != host(X7)
| ~ elem(m_Down(X7),queue(host(X6))) )
& ! [X8,X9] :
( ~ leq(host(X8),host(X9))
| ~ elem(m_Halt(X9),queue(host(X8))) )
& ! [X10,X11,X12] :
( ~ leq(host(X10),host(X12))
| ~ elem(m_Ack(X12,X10),queue(host(X11))) )
& ! [X13,X14] :
( ~ setIn(X14,alive)
| setIn(X13,alive)
| ~ leq(X14,X13)
| host(X13) != host(X14) )
& ! [X15,X16] :
( ~ setIn(X15,alive)
| ~ setIn(X16,alive)
| X15 = X16
| host(X15) != host(X16) )
& ! [X17,X18,X19,X20] :
( ~ elem(m_Down(X20),queue(host(X17)))
| ~ elem(m_Down(X18),queue(host(X19)))
| host(X17) = host(X19)
| ~ setIn(X17,alive)
| ~ setIn(X19,alive)
| host(X17) != host(X18)
| host(X19) != host(X20) )
& ! [X21,X22,X23,X24] :
( ~ elem(m_Down(X24),queue(host(X21)))
| ~ setIn(host(X22),index(down,host(X23)))
| host(X21) = host(X23)
| ~ setIn(X21,alive)
| ~ setIn(X23,alive)
| host(X21) != host(X22)
| host(X23) != host(X24) )
& 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(X7),X0)
& setIn(host(X5),index(down,host(X6)))
& ( ( 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(X1) != 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] :
( ~ setIn(X10,alive)
| ~ elem(m_Down(X10),queue(host(X9))) )
& ! [X11,X12] :
( host(X11) != host(X12)
| ~ elem(m_Down(X12),queue(host(X11))) )
& ! [X13,X14] :
( ~ leq(host(X13),host(X14))
| ~ elem(m_Halt(X14),queue(host(X13))) )
& ! [X15,X16,X17] :
( ~ leq(host(X15),host(X17))
| ~ elem(m_Ack(X17,X15),queue(host(X16))) )
& ! [X18,X19] :
( ~ setIn(X19,alive)
| setIn(X18,alive)
| ~ leq(X19,X18)
| host(X19) != host(X18) )
& ! [X20,X21] :
( ~ setIn(X20,alive)
| ~ setIn(X21,alive)
| X20 = X21
| host(X20) != host(X21) )
& ! [X22,X23,X24,X25] :
( ~ elem(m_Down(X25),queue(host(X22)))
| ~ elem(m_Down(X23),queue(host(X24)))
| host(X22) = host(X24)
| ~ setIn(X22,alive)
| ~ setIn(X24,alive)
| host(X23) != host(X22)
| host(X24) != host(X25) )
& ! [X26,X27,X28,X29] :
( ~ elem(m_Down(X29),queue(host(X26)))
| ~ setIn(host(X27),index(down,host(X28)))
| host(X26) = host(X28)
| ~ setIn(X26,alive)
| ~ setIn(X28,alive)
| host(X26) != host(X27)
| host(X28) != host(X29) )
& queue(host(X2)) = cons(m_Down(X3),X0) ),
inference(rectify,[],[f86]) ).
fof(f113,plain,
( elem(m_Down(sK10),sK3)
& setIn(host(sK8),index(down,host(sK9)))
& ( ( sK5 != sK7
& setIn(sK7,alive) )
| sK4 = sK7 )
& ( ( sK5 != sK9
& setIn(sK9,alive) )
| sK4 = sK9 )
& host(sK9) != host(sK7)
& host(sK8) = host(sK7)
& host(sK9) = host(sK10)
& host(sK9) != host(sK5)
& host(sK9) != host(sK4)
& 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] :
( ~ setIn(X10,alive)
| ~ elem(m_Down(X10),queue(host(X9))) )
& ! [X11,X12] :
( host(X11) != host(X12)
| ~ elem(m_Down(X12),queue(host(X11))) )
& ! [X13,X14] :
( ~ leq(host(X13),host(X14))
| ~ elem(m_Halt(X14),queue(host(X13))) )
& ! [X15,X16,X17] :
( ~ leq(host(X15),host(X17))
| ~ elem(m_Ack(X17,X15),queue(host(X16))) )
& ! [X18,X19] :
( ~ setIn(X19,alive)
| setIn(X18,alive)
| ~ leq(X19,X18)
| host(X19) != host(X18) )
& ! [X20,X21] :
( ~ setIn(X20,alive)
| ~ setIn(X21,alive)
| X20 = X21
| host(X20) != host(X21) )
& ! [X22,X23,X24,X25] :
( ~ elem(m_Down(X25),queue(host(X22)))
| ~ elem(m_Down(X23),queue(host(X24)))
| host(X22) = host(X24)
| ~ setIn(X22,alive)
| ~ setIn(X24,alive)
| host(X23) != host(X22)
| host(X24) != host(X25) )
& ! [X26,X27,X28,X29] :
( ~ elem(m_Down(X29),queue(host(X26)))
| ~ setIn(host(X27),index(down,host(X28)))
| host(X26) = host(X28)
| ~ setIn(X26,alive)
| ~ setIn(X28,alive)
| host(X26) != host(X27)
| host(X28) != host(X29) )
& 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,
! [X28,X29,X26,X27] :
( host(X28) != host(X29)
| ~ setIn(host(X27),index(down,host(X28)))
| host(X26) = host(X28)
| ~ setIn(X26,alive)
| ~ setIn(X28,alive)
| host(X26) != host(X27)
| ~ elem(m_Down(X29),queue(host(X26))) ),
inference(cnf_transformation,[],[f113]) ).
fof(f213,plain,
! [X21,X20] :
( host(X20) != host(X21)
| ~ setIn(X21,alive)
| X20 = X21
| ~ setIn(X20,alive) ),
inference(cnf_transformation,[],[f113]) ).
fof(f214,plain,
! [X18,X19] :
( host(X19) != host(X18)
| setIn(X18,alive)
| ~ leq(X19,X18)
| ~ setIn(X19,alive) ),
inference(cnf_transformation,[],[f113]) ).
fof(f217,plain,
! [X11,X12] :
( host(X11) != host(X12)
| ~ elem(m_Down(X12),queue(host(X11))) ),
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(sK4),
inference(cnf_transformation,[],[f113]) ).
fof(f232,plain,
host(sK9) = host(sK10),
inference(cnf_transformation,[],[f113]) ).
fof(f233,plain,
host(sK8) = host(sK7),
inference(cnf_transformation,[],[f113]) ).
fof(f235,plain,
( setIn(sK9,alive)
| sK4 = sK9 ),
inference(cnf_transformation,[],[f113]) ).
fof(f237,plain,
( setIn(sK7,alive)
| sK4 = sK7 ),
inference(cnf_transformation,[],[f113]) ).
fof(f239,plain,
setIn(host(sK8),index(down,host(sK9))),
inference(cnf_transformation,[],[f113]) ).
fof(f240,plain,
elem(m_Down(sK10),sK3),
inference(cnf_transformation,[],[f113]) ).
fof(f275,definition,
( spl11_5
<=> sK4 = sK9 ),
introduced(definition,[new_symbols(definition,[spl11_5])],[avatar_definition]) ).
fof(f277,plain,
( sK4 = sK9
| ~ spl11_5 ),
inference(avatar_component_clause,[],[f275]) ).
fof(f279,definition,
( spl11_6
<=> setIn(sK9,alive) ),
introduced(definition,[new_symbols(definition,[spl11_6])],[avatar_definition]) ).
fof(f281,plain,
( setIn(sK9,alive)
| ~ spl11_6 ),
inference(avatar_component_clause,[],[f279]) ).
fof(f282,plain,
( spl11_5
| spl11_6 ),
inference(avatar_split_clause,[],[f235,f279,f275]) ).
fof(f289,definition,
( spl11_8
<=> sK4 = sK7 ),
introduced(definition,[new_symbols(definition,[spl11_8])],[avatar_definition]) ).
fof(f290,plain,
( sK4 != sK7
| spl11_8 ),
inference(avatar_component_clause,[],[f289]) ).
fof(f291,plain,
( sK4 = sK7
| ~ spl11_8 ),
inference(avatar_component_clause,[],[f289]) ).
fof(f293,definition,
( spl11_9
<=> setIn(sK7,alive) ),
introduced(definition,[new_symbols(definition,[spl11_9])],[avatar_definition]) ).
fof(f295,plain,
( setIn(sK7,alive)
| ~ spl11_9 ),
inference(avatar_component_clause,[],[f293]) ).
fof(f296,plain,
( spl11_8
| spl11_9 ),
inference(avatar_split_clause,[],[f237,f293,f289]) ).
fof(f303,plain,
host(sK7) = host(sK4),
inference(forward_demodulation,[],[f229,f225]) ).
fof(f304,plain,
( host(sK4) != host(sK4)
| ~ spl11_5 ),
inference(forward_demodulation,[],[f230,f277]) ).
fof(f305,plain,
( $false
| ~ spl11_5 ),
inference(trivial_inequality_removal,[],[f304]) ).
fof(f306,plain,
~ spl11_5,
inference(avatar_contradiction_clause,[],[f305]) ).
fof(f308,plain,
( host(sK8) = host(sK4)
| ~ spl11_8 ),
inference(forward_demodulation,[],[f233,f291]) ).
fof(f311,plain,
( setIn(host(sK4),index(down,host(sK9)))
| ~ spl11_8 ),
inference(forward_demodulation,[],[f239,f308]) ).
fof(f313,plain,
cons(m_Down(sK6),sK3) = queue(host(sK4)),
inference(forward_demodulation,[],[f210,f225]) ).
fof(f314,plain,
! [X8] :
( host(X8) != host(sK4)
| leq(X8,sK4) ),
inference(forward_demodulation,[],[f227,f225]) ).
fof(f315,plain,
( host(sK4) != host(sK4)
| leq(sK5,sK4) ),
inference(superposition,[],[f314,f225]) ).
fof(f320,plain,
leq(sK5,sK4),
inference(trivial_inequality_removal,[],[f315]) ).
fof(f331,plain,
! [X0] :
( host(X0) != host(sK9)
| ~ elem(m_Down(sK10),queue(host(X0))) ),
inference(superposition,[],[f217,f232]) ).
fof(f343,plain,
! [X0] :
( host(X0) != host(sK4)
| ~ setIn(sK5,alive)
| sK5 = X0
| ~ setIn(X0,alive) ),
inference(superposition,[],[f213,f225]) ).
fof(f364,plain,
! [X0] :
( host(X0) != host(sK4)
| sK5 = X0
| ~ setIn(X0,alive) ),
inference(forward_subsumption_resolution,[],[f343,f219]) ).
fof(f368,plain,
! [X0] :
( host(X0) != host(sK4)
| setIn(X0,alive)
| ~ leq(sK5,X0)
| ~ setIn(sK5,alive) ),
inference(superposition,[],[f214,f225]) ).
fof(f384,plain,
! [X0] :
( host(X0) != host(sK4)
| setIn(X0,alive)
| ~ leq(sK5,X0) ),
inference(forward_subsumption_resolution,[],[f368,f219]) ).
fof(f402,plain,
( sK4 = sK5
| ~ setIn(sK4,alive) ),
inference(equality_resolution,[],[f364]) ).
fof(f405,definition,
( spl11_17
<=> setIn(sK4,alive) ),
introduced(definition,[new_symbols(definition,[spl11_17])],[avatar_definition]) ).
fof(f409,definition,
( spl11_18
<=> sK4 = sK5 ),
introduced(definition,[new_symbols(definition,[spl11_18])],[avatar_definition]) ).
fof(f411,plain,
( sK4 = sK5
| ~ spl11_18 ),
inference(avatar_component_clause,[],[f409]) ).
fof(f412,plain,
( ~ spl11_17
| spl11_18 ),
inference(avatar_split_clause,[],[f402,f409,f405]) ).
fof(f427,plain,
( setIn(sK4,alive)
| ~ leq(sK5,sK4) ),
inference(equality_resolution,[],[f384]) ).
fof(f438,plain,
setIn(sK4,alive),
inference(forward_subsumption_resolution,[],[f427,f320]) ).
fof(f439,plain,
spl11_17,
inference(avatar_split_clause,[],[f438,f405]) ).
fof(f459,plain,
! [X2,X0,X1] :
( host(X1) != host(X2)
| ~ setIn(host(X1),index(down,host(X0)))
| host(X0) = host(X2)
| ~ setIn(X2,alive)
| ~ setIn(X0,alive)
| host(X0) != host(sK9)
| ~ elem(m_Down(sK10),queue(host(X2))) ),
inference(superposition,[],[f211,f232]) ).
fof(f470,definition,
( spl11_20
<=> elem(m_Down(sK10),queue(host(sK4))) ),
introduced(definition,[new_symbols(definition,[spl11_20])],[avatar_definition]) ).
fof(f472,plain,
( ~ elem(m_Down(sK10),queue(host(sK4)))
| spl11_20 ),
inference(avatar_component_clause,[],[f470]) ).
fof(f538,plain,
! [X0,X1] :
( host(X1) != host(sK9)
| host(X0) = host(X1)
| ~ setIn(X0,alive)
| ~ setIn(X1,alive)
| ~ setIn(host(X0),index(down,host(X1)))
| ~ elem(m_Down(sK10),queue(host(X0))) ),
inference(equality_resolution,[],[f459]) ).
fof(f540,plain,
! [X0] :
( host(X0) = host(sK9)
| ~ setIn(X0,alive)
| ~ setIn(sK9,alive)
| ~ setIn(host(X0),index(down,host(sK9)))
| ~ elem(m_Down(sK10),queue(host(X0))) ),
inference(equality_resolution,[],[f538]) ).
fof(f542,plain,
! [X0] :
( ~ setIn(X0,alive)
| ~ setIn(sK9,alive)
| ~ setIn(host(X0),index(down,host(sK9)))
| ~ elem(m_Down(sK10),queue(host(X0))) ),
inference(forward_subsumption_resolution,[],[f540,f331]) ).
fof(f543,plain,
( ! [X0] :
( ~ setIn(host(X0),index(down,host(sK9)))
| ~ setIn(X0,alive)
| ~ elem(m_Down(sK10),queue(host(X0))) )
| ~ spl11_6 ),
inference(forward_subsumption_resolution,[],[f542,f281]) ).
fof(f545,plain,
( ~ setIn(host(sK4),index(down,host(sK9)))
| ~ setIn(sK5,alive)
| ~ elem(m_Down(sK10),queue(host(sK4)))
| ~ spl11_6 ),
inference(superposition,[],[f543,f225]) ).
fof(f601,plain,
! [X0] :
( elem(X0,queue(host(sK4)))
| ~ elem(X0,sK3) ),
inference(superposition,[],[f167,f313]) ).
fof(f604,plain,
( ~ elem(m_Down(sK10),sK3)
| spl11_20 ),
inference(resolution,[],[f601,f472]) ).
fof(f609,plain,
( $false
| spl11_20 ),
inference(forward_subsumption_resolution,[],[f604,f240]) ).
fof(f610,plain,
spl11_20,
inference(avatar_contradiction_clause,[],[f609]) ).
fof(f614,plain,
( ~ setIn(sK5,alive)
| ~ elem(m_Down(sK10),queue(host(sK4)))
| ~ spl11_6
| ~ spl11_8 ),
inference(forward_subsumption_resolution,[],[f545,f311]) ).
fof(f621,plain,
( ~ elem(m_Down(sK10),queue(host(sK4)))
| ~ spl11_6
| ~ spl11_8 ),
inference(forward_subsumption_resolution,[],[f614,f219]) ).
fof(f623,plain,
( ~ spl11_20
| ~ spl11_6
| ~ spl11_8 ),
inference(avatar_split_clause,[],[f621,f289,f279,f470]) ).
fof(f667,definition,
( spl11_29
<=> host(sK7) = host(sK4) ),
introduced(definition,[new_symbols(definition,[spl11_29])],[avatar_definition]) ).
fof(f668,plain,
( host(sK7) = host(sK4)
| ~ spl11_29 ),
inference(avatar_component_clause,[],[f667]) ).
fof(f687,plain,
spl11_29,
inference(avatar_split_clause,[],[f303,f667]) ).
fof(f707,plain,
( host(sK4) != host(sK4)
| sK5 = sK7
| ~ setIn(sK7,alive)
| ~ spl11_29 ),
inference(superposition,[],[f364,f668]) ).
fof(f720,plain,
( sK5 = sK7
| ~ setIn(sK7,alive)
| ~ spl11_29 ),
inference(trivial_inequality_removal,[],[f707]) ).
fof(f726,plain,
( sK5 = sK7
| ~ spl11_9
| ~ spl11_29 ),
inference(forward_subsumption_resolution,[],[f720,f295]) ).
fof(f733,plain,
( sK4 = sK7
| ~ spl11_9
| ~ spl11_18
| ~ spl11_29 ),
inference(forward_demodulation,[],[f726,f411]) ).
fof(f734,plain,
( $false
| spl11_8
| ~ spl11_9
| ~ spl11_18
| ~ spl11_29 ),
inference(forward_subsumption_resolution,[],[f733,f290]) ).
fof(f735,plain,
( spl11_8
| ~ spl11_9
| ~ spl11_18
| ~ spl11_29 ),
inference(avatar_contradiction_clause,[],[f734]) ).
cnf(s5,plain,
( spl11_5
| spl11_6 ),
inference(sat_conversion,[],[f282]) ).
cnf(s7,plain,
( spl11_8
| spl11_9 ),
inference(sat_conversion,[],[f296]) ).
cnf(s9,plain,
~ spl11_5,
inference(sat_conversion,[],[f306]) ).
cnf(s16,plain,
( ~ spl11_17
| spl11_18 ),
inference(sat_conversion,[],[f412]) ).
cnf(s19,plain,
spl11_17,
inference(sat_conversion,[],[f439]) ).
cnf(s24,plain,
spl11_20,
inference(sat_conversion,[],[f610]) ).
cnf(s28,plain,
( ~ spl11_6
| ~ spl11_8
| ~ spl11_20 ),
inference(sat_conversion,[],[f623]) ).
cnf(s34,plain,
spl11_29,
inference(sat_conversion,[],[f687]) ).
cnf(s38,plain,
( spl11_8
| ~ spl11_9
| ~ spl11_18
| ~ spl11_29 ),
inference(sat_conversion,[],[f735]) ).
cnf(s44,plain,
spl11_18,
inference(rat,[],[s16,s19]) ).
cnf(s46,plain,
spl11_6,
inference(rat,[],[s5,s9]) ).
cnf(s48,plain,
~ spl11_8,
inference(rat,[],[s28,s24,s46]) ).
cnf(s49,plain,
~ spl11_9,
inference(rat,[],[s38,s34,s44,s48]) ).
cnf(s51,plain,
$false,
inference(rat,[],[s7,s49,s48]) ).
fof(f736,plain,
$false,
inference(avatar_sat_refutation,[],[s51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV456+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19 % Computer : n011.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.20 % CPULimit : 300
% 0.08/0.20 % WCLimit : 300
% 0.08/0.20 % DateTime : Mon Sep 28 11:09:01 UTC 2026
% 0.08/0.20 % CPUTime :
% 0.08/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22 Running first-order model finding
% 0.08/0.22 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.20/0.30 % (3327402)Will run a generic schedule for satisfiability detection.
% 0.20/0.30 % (3327408)% WARNING: option uhcvi not known.
% 0.20/0.30 % (3327408)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2393411548:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.30 % (3327407)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1732963783_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.30 % (3327412)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=341930981:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.30 % (3327409)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1768802207:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.30 % (3327410)dis+10_1_sil=32000:sp=arity:random_seed=3477223857:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.30 % (3327413)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3549857426:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.30 % (3327411)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2419320648: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 % (3327410) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3327402-3327410"...
% 0.20/0.30 % (3327410)...printing done.
% 0.20/0.30 % (3327410)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 % (3327410)------------------------------
% 0.20/0.30 % (3327410)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.30 % (3327410)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.30 % (3327410)CaDiCaL version: 2.1.3
% 0.20/0.30 % (3327410)Termination reason: Refutation
% 0.20/0.30 % (3327410)Time elapsed: 0.021 s
% 0.20/0.30 % (3327410)Peak memory usage: 13 MB
% 0.20/0.30 % (3327410)Instructions burned: 32 (million)
% 0.20/0.30 % (3327402)Success in time 0.069 s
% 0.20/0.30 % Vampire exiting
%------------------------------------------------------------------------------