%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWV470+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n007.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 01:15:53 PM UTC 2026
% Result : Theorem 2.21s 0.81s
% Output : Refutation 3.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 9
% Syntax : Number of formulae : 93 ( 21 unt; 5 def)
% Number of atoms : 753 ( 315 equ)
% Maximal formula atoms : 66 ( 8 avg)
% Number of connectives : 1111 ( 451 ~; 358 |; 238 &)
% ( 7 <=>; 57 =>; 0 <=; 0 <~>)
% Maximal formula depth : 33 ( 7 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 10 ( 8 usr; 6 prp; 0-2 aty)
% Number of functors : 30 ( 30 usr; 18 con; 0-2 aty)
% Number of variables : 353 ( 0 sgn 329 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f13,axiom,
! [X0,X1,X2] : m_Ack(X0,X1) != m_Down(X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_12) ).
fof(f47,axiom,
! [X0,X1,X2] :
( elem(X0,cons(X1,X2))
<=> ( X0 = X1
| elem(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_46) ).
fof(f48,axiom,
! [X0,X1,X2] :
( elem(X0,snoc(X2,X1))
<=> ( X0 = X1
| elem(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',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),queue(host(X9)))
& host(X9) = host(X4)
& host(X9) = nbr_proc
& index(status,host(X9)) = elec_1 )
=> ~ ( setIn(X3,alive)
& elem(m_Down(X4),snoc(X0,m_Ack(X2,X1))) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/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),queue(host(X9)))
& host(X9) = host(X4)
& host(X9) = nbr_proc
& index(status,host(X9)) = elec_1 )
=> ~ ( setIn(X3,alive)
& elem(m_Down(X4),snoc(X0,m_Ack(X2,X1))) ) ) ) ) ) ) ) ),
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),queue(host(X34)))
& host(X34) = host(X32)
& nbr_proc = host(X34)
& elec_1 = index(status,host(X34)) )
=> ~ ( setIn(X31,alive)
& elem(m_Down(X32),snoc(X0,m_Ack(X2,X1))) ) ) ) ) ) ) ) ),
inference(rectify,[],[f68]) ).
fof(f70,plain,
? [X0,X1,X2] :
( ? [X31] :
( ? [X32,X33,X34] :
( setIn(X31,alive)
& elem(m_Down(X32),snoc(X0,m_Ack(X2,X1)))
& ! [X35] :
( setIn(X35,index(down,host(X34)))
| host(X33) = X35
| leq(host(X34),X35)
| ~ leq(s(zero),X35) )
& elem(m_Down(X33),queue(host(X34)))
& 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(f71,plain,
? [X0,X1,X2] :
( ? [X31] :
( ? [X32,X33,X34] :
( setIn(X31,alive)
& elem(m_Down(X32),snoc(X0,m_Ack(X2,X1)))
& ! [X35] :
( setIn(X35,index(down,host(X34)))
| host(X33) = X35
| leq(host(X34),X35)
| ~ leq(s(zero),X35) )
& elem(m_Down(X33),queue(host(X34)))
& 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,[],[f70]) ).
fof(f87,plain,
? [X0,X1,X2] :
( ? [X3] :
( ? [X4,X5,X6] :
( setIn(X3,alive)
& elem(m_Down(X4),snoc(X0,m_Ack(X2,X1)))
& ! [X7] :
( setIn(X7,index(down,host(X6)))
| host(X5) = X7
| leq(host(X6),X7)
| ~ leq(s(zero),X7) )
& elem(m_Down(X5),queue(host(X6)))
& host(X4) = host(X6)
& nbr_proc = host(X6)
& elec_1 = index(status,host(X6))
& host(X1) != host(X6)
& host(X2) != host(X6) )
& host(X1) = host(X3)
& host(X2) = host(X3) )
& setIn(X1,alive)
& ! [X8,X9] :
( ~ leq(host(X8),host(X9))
| ~ elem(m_Ldr(X9),queue(host(X8))) )
& ! [X10,X11] :
( host(X10) != host(X11)
| ~ elem(m_Down(X11),queue(host(X10))) )
& ! [X12,X13] :
( ~ elem(m_NotNorm(X12),queue(host(X13)))
| nbr_proc != host(X13) )
& ! [X14,X15] :
( ~ setIn(X14,alive)
| ~ setIn(X15,alive)
| X14 = X15
| host(X14) != host(X15) )
& ! [X16] :
( index(elid,host(X16)) = X16
| ( elec_1 != index(status,host(X16))
& elec_2 != index(status,host(X16)) )
| ~ setIn(X16,alive) )
& ! [X17,X18,X19] :
( ~ elem(m_Down(X17),queue(host(X18)))
| host(X18) = host(X19)
| ~ setIn(X19,alive)
| host(X17) != host(X19)
| host(X18) != index(ldr,host(X19))
| norm != index(status,host(X19)) )
& ! [X20,X21,X22] :
( ~ elem(m_Down(X20),queue(host(X21)))
| host(X21) = host(X22)
| ~ setIn(X22,alive)
| host(X20) != host(X22)
| wait != index(status,host(X22))
| host(X21) != host(index(elid,host(X22))) )
& ! [X23,X24,X25,X26] :
( ~ elem(m_Down(X26),queue(host(X23)))
| ~ elem(m_Down(X24),queue(host(X25)))
| host(X23) = host(X25)
| ~ setIn(X23,alive)
| ~ setIn(X25,alive)
| host(X24) != host(X23)
| host(X25) != host(X26) )
& ! [X27,X28,X29,X30] :
( ~ elem(m_Down(X30),queue(host(X27)))
| ~ setIn(host(X28),index(down,host(X29)))
| host(X29) = host(X27)
| ~ setIn(X27,alive)
| ~ setIn(X29,alive)
| host(X28) != host(X27)
| host(X29) != host(X30) )
& ! [X31,X32,X33,X34] :
( ~ setIn(X31,alive)
| ~ elem(m_Down(X32),queue(host(X31)))
| ? [X35] :
( ~ setIn(X35,index(down,host(X34)))
& host(X33) != X35
& ~ leq(host(X34),X35)
& leq(s(zero),X35) )
| ~ elem(m_Down(X33),queue(host(X34)))
| host(X34) != host(X32)
| nbr_proc != host(X34)
| elec_1 != index(status,host(X34)) )
& queue(host(X1)) = cons(m_Halt(X2),X0) ),
inference(rectify,[],[f71]) ).
fof(f88,plain,
( setIn(sK3,alive)
& elem(m_Down(sK4),snoc(sK0,m_Ack(sK2,sK1)))
& ! [X7] :
( setIn(X7,index(down,host(sK6)))
| host(sK5) = X7
| leq(host(sK6),X7)
| ~ leq(s(zero),X7) )
& elem(m_Down(sK5),queue(host(sK6)))
& host(sK6) = host(sK4)
& nbr_proc = host(sK6)
& elec_1 = index(status,host(sK6))
& host(sK6) != host(sK1)
& host(sK6) != host(sK2)
& host(sK1) = host(sK3)
& host(sK2) = host(sK3)
& setIn(sK1,alive)
& ! [X8,X9] :
( ~ leq(host(X8),host(X9))
| ~ elem(m_Ldr(X9),queue(host(X8))) )
& ! [X10,X11] :
( host(X10) != host(X11)
| ~ elem(m_Down(X11),queue(host(X10))) )
& ! [X12,X13] :
( ~ elem(m_NotNorm(X12),queue(host(X13)))
| nbr_proc != host(X13) )
& ! [X14,X15] :
( ~ setIn(X14,alive)
| ~ setIn(X15,alive)
| X14 = X15
| host(X14) != host(X15) )
& ! [X16] :
( index(elid,host(X16)) = X16
| ( elec_1 != index(status,host(X16))
& elec_2 != index(status,host(X16)) )
| ~ setIn(X16,alive) )
& ! [X17,X18,X19] :
( ~ elem(m_Down(X17),queue(host(X18)))
| host(X18) = host(X19)
| ~ setIn(X19,alive)
| host(X17) != host(X19)
| host(X18) != index(ldr,host(X19))
| norm != index(status,host(X19)) )
& ! [X20,X21,X22] :
( ~ elem(m_Down(X20),queue(host(X21)))
| host(X21) = host(X22)
| ~ setIn(X22,alive)
| host(X20) != host(X22)
| wait != index(status,host(X22))
| host(X21) != host(index(elid,host(X22))) )
& ! [X23,X24,X25,X26] :
( ~ elem(m_Down(X26),queue(host(X23)))
| ~ elem(m_Down(X24),queue(host(X25)))
| host(X23) = host(X25)
| ~ setIn(X23,alive)
| ~ setIn(X25,alive)
| host(X24) != host(X23)
| host(X25) != host(X26) )
& ! [X27,X28,X29,X30] :
( ~ elem(m_Down(X30),queue(host(X27)))
| ~ setIn(host(X28),index(down,host(X29)))
| host(X29) = host(X27)
| ~ setIn(X27,alive)
| ~ setIn(X29,alive)
| host(X28) != host(X27)
| host(X29) != host(X30) )
& ! [X31,X32,X33,X34] :
( ~ setIn(X31,alive)
| ~ elem(m_Down(X32),queue(host(X31)))
| ( ~ setIn(sK7(X33,X34),index(down,host(X34)))
& host(X33) != sK7(X33,X34)
& ~ leq(host(X34),sK7(X33,X34))
& leq(s(zero),sK7(X33,X34)) )
| ~ elem(m_Down(X33),queue(host(X34)))
| host(X34) != host(X32)
| nbr_proc != host(X34)
| elec_1 != index(status,host(X34)) )
& queue(host(sK1)) = cons(m_Halt(sK2),sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6,sK7]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4),skolemize(X5,sK5),skolemize(X6,sK6),skolemize(X35,sK7(X33,X34))],[f87]) ).
fof(f97,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(f98,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,[],[f97]) ).
fof(f99,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(f100,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,[],[f99]) ).
fof(f114,plain,
queue(host(sK1)) = cons(m_Halt(sK2),sK0),
inference(cnf_transformation,[],[f88]) ).
fof(f115,plain,
! [X31,X34,X32,X33] :
( elec_1 != index(status,host(X34))
| ~ elem(m_Down(X32),queue(host(X31)))
| leq(s(zero),sK7(X33,X34))
| ~ elem(m_Down(X33),queue(host(X34)))
| host(X34) != host(X32)
| nbr_proc != host(X34)
| ~ setIn(X31,alive) ),
inference(cnf_transformation,[],[f88]) ).
fof(f116,plain,
! [X31,X34,X32,X33] :
( elec_1 != index(status,host(X34))
| ~ elem(m_Down(X32),queue(host(X31)))
| ~ leq(host(X34),sK7(X33,X34))
| ~ elem(m_Down(X33),queue(host(X34)))
| host(X34) != host(X32)
| nbr_proc != host(X34)
| ~ setIn(X31,alive) ),
inference(cnf_transformation,[],[f88]) ).
fof(f117,plain,
! [X31,X34,X32,X33] :
( elec_1 != index(status,host(X34))
| ~ elem(m_Down(X32),queue(host(X31)))
| host(X33) != sK7(X33,X34)
| ~ elem(m_Down(X33),queue(host(X34)))
| host(X34) != host(X32)
| nbr_proc != host(X34)
| ~ setIn(X31,alive) ),
inference(cnf_transformation,[],[f88]) ).
fof(f118,plain,
! [X31,X34,X32,X33] :
( elec_1 != index(status,host(X34))
| ~ elem(m_Down(X32),queue(host(X31)))
| ~ setIn(sK7(X33,X34),index(down,host(X34)))
| ~ elem(m_Down(X33),queue(host(X34)))
| host(X34) != host(X32)
| nbr_proc != host(X34)
| ~ setIn(X31,alive) ),
inference(cnf_transformation,[],[f88]) ).
fof(f131,plain,
host(sK1) = host(sK3),
inference(cnf_transformation,[],[f88]) ).
fof(f134,plain,
elec_1 = index(status,host(sK6)),
inference(cnf_transformation,[],[f88]) ).
fof(f135,plain,
nbr_proc = host(sK6),
inference(cnf_transformation,[],[f88]) ).
fof(f136,plain,
host(sK6) = host(sK4),
inference(cnf_transformation,[],[f88]) ).
fof(f137,plain,
elem(m_Down(sK5),queue(host(sK6))),
inference(cnf_transformation,[],[f88]) ).
fof(f138,plain,
! [X7] :
( setIn(X7,index(down,host(sK6)))
| host(sK5) = X7
| leq(host(sK6),X7)
| ~ leq(s(zero),X7) ),
inference(cnf_transformation,[],[f88]) ).
fof(f139,plain,
elem(m_Down(sK4),snoc(sK0,m_Ack(sK2,sK1))),
inference(cnf_transformation,[],[f88]) ).
fof(f140,plain,
setIn(sK3,alive),
inference(cnf_transformation,[],[f88]) ).
fof(f143,plain,
! [X2,X0,X1] : m_Ack(X0,X1) != m_Down(X2),
inference(cnf_transformation,[],[f13]) ).
fof(f160,plain,
! [X2,X0,X1] :
( ~ elem(X0,snoc(X2,X1))
| elem(X0,X2)
| X0 = X1 ),
inference(cnf_transformation,[],[f98]) ).
fof(f164,plain,
! [X2,X0,X1] :
( elem(X0,cons(X1,X2))
| ~ elem(X0,X2) ),
inference(cnf_transformation,[],[f100]) ).
fof(f251,plain,
nbr_proc = host(sK4),
inference(forward_demodulation,[],[f136,f135]) ).
fof(f252,plain,
elem(m_Down(sK5),queue(nbr_proc)),
inference(forward_demodulation,[],[f137,f135]) ).
fof(f253,plain,
! [X7] :
( setIn(X7,index(down,nbr_proc))
| host(sK5) = X7
| leq(host(sK6),X7)
| ~ leq(s(zero),X7) ),
inference(forward_demodulation,[],[f138,f135]) ).
fof(f254,plain,
! [X7] :
( setIn(X7,index(down,nbr_proc))
| leq(nbr_proc,X7)
| host(sK5) = X7
| ~ leq(s(zero),X7) ),
inference(forward_demodulation,[],[f253,f135]) ).
fof(f260,plain,
elec_1 = index(status,nbr_proc),
inference(superposition,[],[f134,f135]) ).
fof(f524,plain,
! [X2,X0,X1] :
( elec_1 != elec_1
| ~ elem(m_Down(X0),queue(host(X1)))
| leq(s(zero),sK7(X2,sK6))
| ~ elem(m_Down(X2),queue(host(sK6)))
| host(X0) != host(sK6)
| nbr_proc != host(sK6)
| ~ setIn(X1,alive) ),
inference(superposition,[],[f115,f134]) ).
fof(f525,plain,
! [X2,X0,X1] :
( ~ elem(m_Down(X0),queue(host(X1)))
| leq(s(zero),sK7(X2,sK6))
| ~ elem(m_Down(X2),queue(host(sK6)))
| host(X0) != host(sK6)
| nbr_proc != host(sK6)
| ~ setIn(X1,alive) ),
inference(trivial_inequality_removal,[],[f524]) ).
fof(f528,plain,
! [X2,X0,X1] :
( ~ elem(m_Down(X0),queue(host(X1)))
| leq(s(zero),sK7(X2,sK6))
| ~ elem(m_Down(X2),queue(host(sK6)))
| host(X0) != host(sK6)
| ~ setIn(X1,alive) ),
inference(forward_subsumption_resolution,[],[f525,f135]) ).
fof(f532,plain,
! [X2,X0,X1] :
( ~ elem(m_Down(X2),queue(nbr_proc))
| ~ elem(m_Down(X0),queue(host(X1)))
| leq(s(zero),sK7(X2,sK6))
| host(X0) != host(sK6)
| ~ setIn(X1,alive) ),
inference(forward_demodulation,[],[f528,f135]) ).
fof(f534,definition,
( spl11_14
<=> ! [X2] :
( leq(s(zero),sK7(X2,sK6))
| ~ elem(m_Down(X2),queue(nbr_proc)) ) ),
introduced(definition,[new_symbols(definition,[spl11_14])],[avatar_definition]) ).
fof(f535,plain,
( ! [X2] :
( leq(s(zero),sK7(X2,sK6))
| ~ elem(m_Down(X2),queue(nbr_proc)) )
| ~ spl11_14 ),
inference(avatar_component_clause,[],[f534]) ).
fof(f537,definition,
( spl11_15
<=> ! [X0,X1] :
( ~ elem(m_Down(X0),queue(host(X1)))
| ~ setIn(X1,alive)
| host(X0) != nbr_proc ) ),
introduced(definition,[new_symbols(definition,[spl11_15])],[avatar_definition]) ).
fof(f538,plain,
( ! [X0,X1] :
( host(X0) != nbr_proc
| ~ setIn(X1,alive)
| ~ elem(m_Down(X0),queue(host(X1))) )
| ~ spl11_15 ),
inference(avatar_component_clause,[],[f537]) ).
fof(f544,plain,
! [X2,X0,X1] :
( host(X0) != nbr_proc
| ~ elem(m_Down(X2),queue(nbr_proc))
| ~ elem(m_Down(X0),queue(host(X1)))
| leq(s(zero),sK7(X2,sK6))
| ~ setIn(X1,alive) ),
inference(forward_demodulation,[],[f532,f135]) ).
fof(f545,plain,
( spl11_14
| spl11_15 ),
inference(avatar_split_clause,[],[f544,f537,f534]) ).
fof(f549,plain,
( ! [X0] :
( nbr_proc != nbr_proc
| ~ setIn(X0,alive)
| ~ elem(m_Down(sK4),queue(host(X0))) )
| ~ spl11_15 ),
inference(superposition,[],[f538,f251]) ).
fof(f552,plain,
( ! [X0] :
( ~ elem(m_Down(sK4),queue(host(X0)))
| ~ setIn(X0,alive) )
| ~ spl11_15 ),
inference(trivial_inequality_removal,[],[f549]) ).
fof(f558,plain,
! [X2,X0,X1] :
( elec_1 != index(status,nbr_proc)
| ~ elem(m_Down(X0),queue(host(X1)))
| ~ leq(nbr_proc,sK7(X2,sK6))
| ~ elem(m_Down(X2),queue(nbr_proc))
| host(X0) != nbr_proc
| nbr_proc != nbr_proc
| ~ setIn(X1,alive) ),
inference(superposition,[],[f116,f135]) ).
fof(f561,plain,
! [X2,X0,X1] :
( elec_1 != index(status,nbr_proc)
| ~ elem(m_Down(X0),queue(host(X1)))
| ~ leq(nbr_proc,sK7(X2,sK6))
| ~ elem(m_Down(X2),queue(nbr_proc))
| host(X0) != nbr_proc
| ~ setIn(X1,alive) ),
inference(trivial_inequality_removal,[],[f558]) ).
fof(f580,plain,
! [X2,X0,X1] :
( elec_1 != index(status,nbr_proc)
| ~ elem(m_Down(X0),queue(host(X1)))
| host(X2) != sK7(X2,sK6)
| ~ elem(m_Down(X2),queue(nbr_proc))
| host(X0) != nbr_proc
| nbr_proc != nbr_proc
| ~ setIn(X1,alive) ),
inference(superposition,[],[f117,f135]) ).
fof(f583,plain,
! [X2,X0,X1] :
( elec_1 != index(status,nbr_proc)
| ~ elem(m_Down(X0),queue(host(X1)))
| host(X2) != sK7(X2,sK6)
| ~ elem(m_Down(X2),queue(nbr_proc))
| host(X0) != nbr_proc
| ~ setIn(X1,alive) ),
inference(trivial_inequality_removal,[],[f580]) ).
fof(f593,plain,
! [X2,X0,X1] :
( elec_1 != index(status,nbr_proc)
| ~ elem(m_Down(X0),queue(host(X1)))
| ~ setIn(sK7(X2,sK6),index(down,nbr_proc))
| ~ elem(m_Down(X2),queue(nbr_proc))
| host(X0) != nbr_proc
| nbr_proc != nbr_proc
| ~ setIn(X1,alive) ),
inference(superposition,[],[f118,f135]) ).
fof(f596,plain,
! [X2,X0,X1] :
( elec_1 != index(status,nbr_proc)
| ~ elem(m_Down(X0),queue(host(X1)))
| ~ setIn(sK7(X2,sK6),index(down,nbr_proc))
| ~ elem(m_Down(X2),queue(nbr_proc))
| host(X0) != nbr_proc
| ~ setIn(X1,alive) ),
inference(trivial_inequality_removal,[],[f593]) ).
fof(f604,plain,
( ~ elem(m_Down(sK4),queue(host(sK1)))
| ~ setIn(sK3,alive)
| ~ spl11_15 ),
inference(superposition,[],[f552,f131]) ).
fof(f609,plain,
( ~ elem(m_Down(sK4),queue(host(sK1)))
| ~ spl11_15 ),
inference(forward_subsumption_resolution,[],[f604,f140]) ).
fof(f939,plain,
! [X0] :
( elem(X0,queue(host(sK1)))
| ~ elem(X0,sK0) ),
inference(superposition,[],[f164,f114]) ).
fof(f946,plain,
( ~ elem(m_Down(sK4),sK0)
| ~ spl11_15 ),
inference(resolution,[],[f939,f609]) ).
fof(f1155,plain,
( elem(m_Down(sK4),sK0)
| m_Down(sK4) = m_Ack(sK2,sK1) ),
inference(resolution,[],[f160,f139]) ).
fof(f1160,plain,
( m_Down(sK4) = m_Ack(sK2,sK1)
| ~ spl11_15 ),
inference(forward_subsumption_resolution,[],[f1155,f946]) ).
fof(f1161,plain,
( $false
| ~ spl11_15 ),
inference(forward_subsumption_resolution,[],[f1160,f143]) ).
fof(f1162,plain,
~ spl11_15,
inference(avatar_contradiction_clause,[],[f1161]) ).
fof(f1163,plain,
! [X2,X0,X1] :
( ~ elem(m_Down(X0),queue(host(X1)))
| ~ leq(nbr_proc,sK7(X2,sK6))
| ~ elem(m_Down(X2),queue(nbr_proc))
| host(X0) != nbr_proc
| ~ setIn(X1,alive) ),
inference(forward_subsumption_resolution,[],[f561,f260]) ).
fof(f1166,definition,
( spl11_32
<=> ! [X2] :
( ~ elem(m_Down(X2),queue(nbr_proc))
| ~ leq(nbr_proc,sK7(X2,sK6)) ) ),
introduced(definition,[new_symbols(definition,[spl11_32])],[avatar_definition]) ).
fof(f1167,plain,
( ! [X2] :
( ~ leq(nbr_proc,sK7(X2,sK6))
| ~ elem(m_Down(X2),queue(nbr_proc)) )
| ~ spl11_32 ),
inference(avatar_component_clause,[],[f1166]) ).
fof(f1169,plain,
! [X2,X0,X1] :
( ~ elem(m_Down(X0),queue(host(X1)))
| host(X2) != sK7(X2,sK6)
| ~ elem(m_Down(X2),queue(nbr_proc))
| host(X0) != nbr_proc
| ~ setIn(X1,alive) ),
inference(forward_subsumption_resolution,[],[f583,f260]) ).
fof(f1172,definition,
( spl11_33
<=> ! [X2] :
( ~ elem(m_Down(X2),queue(nbr_proc))
| host(X2) != sK7(X2,sK6) ) ),
introduced(definition,[new_symbols(definition,[spl11_33])],[avatar_definition]) ).
fof(f1173,plain,
( ! [X2] :
( host(X2) != sK7(X2,sK6)
| ~ elem(m_Down(X2),queue(nbr_proc)) )
| ~ spl11_33 ),
inference(avatar_component_clause,[],[f1172]) ).
fof(f1175,plain,
! [X2,X0,X1] :
( ~ elem(m_Down(X0),queue(host(X1)))
| ~ setIn(sK7(X2,sK6),index(down,nbr_proc))
| ~ elem(m_Down(X2),queue(nbr_proc))
| host(X0) != nbr_proc
| ~ setIn(X1,alive) ),
inference(forward_subsumption_resolution,[],[f596,f260]) ).
fof(f1178,definition,
( spl11_34
<=> ! [X2] :
( ~ elem(m_Down(X2),queue(nbr_proc))
| ~ setIn(sK7(X2,sK6),index(down,nbr_proc)) ) ),
introduced(definition,[new_symbols(definition,[spl11_34])],[avatar_definition]) ).
fof(f1179,plain,
( ! [X2] :
( ~ setIn(sK7(X2,sK6),index(down,nbr_proc))
| ~ elem(m_Down(X2),queue(nbr_proc)) )
| ~ spl11_34 ),
inference(avatar_component_clause,[],[f1178]) ).
fof(f1209,plain,
( spl11_32
| spl11_15 ),
inference(avatar_split_clause,[],[f1163,f537,f1166]) ).
fof(f1214,plain,
( spl11_33
| spl11_15 ),
inference(avatar_split_clause,[],[f1169,f537,f1172]) ).
fof(f1219,plain,
( spl11_34
| spl11_15 ),
inference(avatar_split_clause,[],[f1175,f537,f1178]) ).
fof(f1334,plain,
( ! [X0] :
( ~ elem(m_Down(X0),queue(nbr_proc))
| leq(nbr_proc,sK7(X0,sK6))
| host(sK5) = sK7(X0,sK6)
| ~ leq(s(zero),sK7(X0,sK6)) )
| ~ spl11_34 ),
inference(resolution,[],[f1179,f254]) ).
fof(f1335,plain,
( ! [X0] :
( ~ elem(m_Down(X0),queue(nbr_proc))
| host(sK5) = sK7(X0,sK6)
| ~ leq(s(zero),sK7(X0,sK6)) )
| ~ spl11_32
| ~ spl11_34 ),
inference(forward_subsumption_resolution,[],[f1334,f1167]) ).
fof(f1336,plain,
( ! [X0] :
( ~ elem(m_Down(X0),queue(nbr_proc))
| host(sK5) = sK7(X0,sK6) )
| ~ spl11_14
| ~ spl11_32
| ~ spl11_34 ),
inference(forward_subsumption_resolution,[],[f1335,f535]) ).
fof(f1337,plain,
( host(sK5) = sK7(sK5,sK6)
| ~ spl11_14
| ~ spl11_32
| ~ spl11_34 ),
inference(resolution,[],[f1336,f252]) ).
fof(f1342,plain,
( host(sK5) != host(sK5)
| ~ elem(m_Down(sK5),queue(nbr_proc))
| ~ spl11_14
| ~ spl11_32
| ~ spl11_33
| ~ spl11_34 ),
inference(superposition,[],[f1173,f1337]) ).
fof(f1345,plain,
( ~ elem(m_Down(sK5),queue(nbr_proc))
| ~ spl11_14
| ~ spl11_32
| ~ spl11_33
| ~ spl11_34 ),
inference(trivial_inequality_removal,[],[f1342]) ).
fof(f1347,plain,
( $false
| ~ spl11_14
| ~ spl11_32
| ~ spl11_33
| ~ spl11_34 ),
inference(forward_subsumption_resolution,[],[f1345,f252]) ).
fof(f1348,plain,
( ~ spl11_14
| ~ spl11_32
| ~ spl11_33
| ~ spl11_34 ),
inference(avatar_contradiction_clause,[],[f1347]) ).
cnf(s17,plain,
( spl11_14
| spl11_15 ),
inference(sat_conversion,[],[f545]) ).
cnf(s27,plain,
~ spl11_15,
inference(sat_conversion,[],[f1162]) ).
cnf(s37,plain,
( spl11_15
| spl11_32 ),
inference(sat_conversion,[],[f1209]) ).
cnf(s39,plain,
( spl11_15
| spl11_33 ),
inference(sat_conversion,[],[f1214]) ).
cnf(s41,plain,
( spl11_15
| spl11_34 ),
inference(sat_conversion,[],[f1219]) ).
cnf(s48,plain,
( ~ spl11_14
| ~ spl11_32
| ~ spl11_33
| ~ spl11_34 ),
inference(sat_conversion,[],[f1348]) ).
cnf(s52,plain,
spl11_34,
inference(rat,[],[s41,s27]) ).
cnf(s54,plain,
spl11_33,
inference(rat,[],[s39,s27]) ).
cnf(s56,plain,
spl11_32,
inference(rat,[],[s37,s27]) ).
cnf(s57,plain,
~ spl11_14,
inference(rat,[],[s48,s52,s54,s56]) ).
cnf(s58,plain,
$false,
inference(rat,[],[s17,s27,s57]) ).
fof(f1350,plain,
$false,
inference(avatar_sat_refutation,[],[s58]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV470+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.19 % Computer : n007.cluster.edu
% 0.07/0.19 % Model : x86_64 x86_64
% 0.07/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19 % Memory : 8046.5625MB
% 0.07/0.19 % OS : Linux 6.8.0-71-generic
% 0.07/0.19 % CPULimit : 300
% 0.07/0.19 % WCLimit : 300
% 0.07/0.19 % DateTime : Mon Sep 28 11:08:11 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.23 Running first-order theorem proving
% 0.07/0.23 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.21/0.81 % (2325722)Detected formulas, will run a generic FOF schedule.
% 2.21/0.81 % (2325733)dis-21_1_sil=8000:lcm=predicate:random_seed=2679931660:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 2.21/0.81 % (2325733)Instruction limit reached!
% 2.21/0.81 % (2325733)------------------------------
% 2.21/0.81 % (2325733)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.21/0.81 % (2325733)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.21/0.81 % (2325733)CaDiCaL version: 2.1.3
% 2.21/0.81 % (2325733)Termination reason: Instruction limit
% 2.21/0.81 % (2325733)Termination phase: Saturation
% 2.21/0.81 % (2325733)Time elapsed: 0.037 s
% 2.21/0.81 % (2325733)Peak memory usage: 89 MB
% 2.21/0.81 % (2325733)Instructions burned: 130 (million)
% 2.21/0.81 % (2325732)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3693626591:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.21/0.81 % (2325731)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1959151038:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.21/0.81 % (2325730)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3609793882:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.21/0.81 % (2325727)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=2736420553:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.21/0.81 % (2325729)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=342740849:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.21/0.81 % (2325728)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=672034642:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.21/0.81 % (2325730)Instruction limit reached!
% 2.21/0.81 % (2325730)------------------------------
% 2.21/0.81 % (2325730)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.21/0.81 % (2325730)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.21/0.81 % (2325730)CaDiCaL version: 2.1.3
% 2.21/0.81 % (2325730)Termination reason: Instruction limit
% 2.21/0.81 % (2325730)Termination phase: Saturation
% 2.21/0.81 % (2325730)Time elapsed: 0.067 s
% 2.21/0.81 % (2325730)Peak memory usage: 89 MB
% 2.21/0.81 % (2325730)Instructions burned: 110 (million)
% 2.21/0.81 % (2325731)Instruction limit reached!
% 2.21/0.81 % (2325731)------------------------------
% 2.21/0.81 % (2325731)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.21/0.81 % (2325731)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.21/0.81 % (2325731)CaDiCaL version: 2.1.3
% 2.21/0.81 % (2325731)Termination reason: Instruction limit
% 2.21/0.81 % (2325731)Termination phase: Saturation
% 2.21/0.81 % (2325731)Time elapsed: 0.071 s
% 2.21/0.81 % (2325731)Peak memory usage: 88 MB
% 2.21/0.81 % (2325731)Instructions burned: 120 (million)
% 2.21/0.81 % (2325741)lrs+10_1_sil=8000:sp=occurrence:random_seed=2331004851:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 2.21/0.81 % (2325741)First to succeed.
% 2.21/0.81 % (2325732)Instruction limit reached!
% 2.21/0.81 % (2325732)------------------------------
% 2.21/0.81 % (2325732)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.21/0.81 % (2325732)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.21/0.81 % (2325732)CaDiCaL version: 2.1.3
% 2.21/0.81 % (2325732)Termination reason: Instruction limit
% 2.21/0.81 % (2325732)Termination phase: Saturation
% 2.21/0.81 % (2325732)Time elapsed: 0.100 s
% 2.21/0.81 % (2325732)Peak memory usage: 90 MB
% 2.21/0.81 % (2325732)Instructions burned: 140 (million)
% 2.21/0.81 % (2325741)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2325722"
% 2.21/0.81 % (2325742)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3058584227:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.21/0.81 % (2325743)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2145500542:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 2.21/0.81 % (2325745)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=2210739930:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 2.21/0.81 % (2325741)Refutation found. Thanks to Tanya!
% 2.21/0.81 % SZS status Theorem for theBenchmark
% 2.21/0.81 % SZS output start Proof for theBenchmark
% See solution above
% 3.13/0.99 % (2325741)------------------------------
% 3.13/0.99 % (2325741)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.13/0.99 % (2325741)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.13/0.99 % (2325741)CaDiCaL version: 2.1.3
% 3.13/0.99 % (2325741)Termination reason: Refutation
% 3.13/0.99 % (2325741)Time elapsed: 0.019 s
% 3.13/0.99 % (2325741)Peak memory usage: 90 MB
% 3.13/0.99 % (2325741)Instructions burned: 58 (million)
% 3.13/0.99 % (2325741)------------------------------
% 3.13/0.99 % (2325741)------------------------------
% 3.13/0.99 % (2325722)Success in time 0.39 s
% 3.13/0.99 % Vampire exiting
%------------------------------------------------------------------------------