%------------------------------------------------------------------------------
% File : Vampire-SAT---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 SAT
% Computer : n012.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:21 PM UTC 2026
% Result : Theorem 0.08s 0.17s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 9
% Syntax : Number of formulae : 89 ( 20 unt; 5 def)
% Number of atoms : 740 ( 312 equ)
% Maximal formula atoms : 66 ( 8 avg)
% Number of connectives : 1092 ( 441 ~; 349 |; 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 : 347 ( 0 sgn 323 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f13,axiom,
! [X0,X1,X2] : m_Ack(X0,X1) != m_Down(X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_12) ).
fof(f47,axiom,
! [X0,X1,X2] :
( elem(X0,cons(X1,X2))
<=> ( X0 = X1
| elem(X0,X2) ) ),
file('/export/starexec/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] :
( 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(f85,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(f86,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,[],[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] :
( 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,[],[f86]) ).
fof(f113,plain,
( setIn(sK6,alive)
& elem(m_Down(sK7),snoc(sK3,m_Ack(sK5,sK4)))
& ! [X7] :
( setIn(X7,index(down,host(sK9)))
| host(sK8) = X7
| leq(host(sK9),X7)
| ~ leq(s(zero),X7) )
& elem(m_Down(sK8),queue(host(sK9)))
& host(sK9) = host(sK7)
& nbr_proc = host(sK9)
& elec_1 = index(status,host(sK9))
& host(sK9) != host(sK4)
& host(sK9) != host(sK5)
& host(sK4) = host(sK6)
& host(sK5) = host(sK6)
& setIn(sK4,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(sK10(X33,X34),index(down,host(X34)))
& host(X33) != sK10(X33,X34)
& ~ leq(host(X34),sK10(X33,X34))
& leq(s(zero),sK10(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(sK4)) = cons(m_Halt(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(X35,sK10(X33,X34))],[f112]) ).
fof(f127,plain,
! [X2,X0,X1] : m_Ack(X0,X1) != m_Down(X2),
inference(cnf_transformation,[],[f13]) ).
fof(f167,plain,
! [X2,X0,X1] :
( elem(X0,cons(X1,X2))
| ~ elem(X0,X2) ),
inference(cnf_transformation,[],[f93]) ).
fof(f169,plain,
! [X2,X0,X1] :
( ~ elem(X0,snoc(X2,X1))
| elem(X0,X2)
| X0 = X1 ),
inference(cnf_transformation,[],[f95]) ).
fof(f210,plain,
queue(host(sK4)) = cons(m_Halt(sK5),sK3),
inference(cnf_transformation,[],[f113]) ).
fof(f211,plain,
! [X31,X34,X32,X33] :
( elec_1 != index(status,host(X34))
| ~ elem(m_Down(X32),queue(host(X31)))
| leq(s(zero),sK10(X33,X34))
| ~ elem(m_Down(X33),queue(host(X34)))
| host(X34) != host(X32)
| nbr_proc != host(X34)
| ~ setIn(X31,alive) ),
inference(cnf_transformation,[],[f113]) ).
fof(f212,plain,
! [X31,X34,X32,X33] :
( elec_1 != index(status,host(X34))
| ~ elem(m_Down(X32),queue(host(X31)))
| ~ leq(host(X34),sK10(X33,X34))
| ~ elem(m_Down(X33),queue(host(X34)))
| host(X34) != host(X32)
| nbr_proc != host(X34)
| ~ setIn(X31,alive) ),
inference(cnf_transformation,[],[f113]) ).
fof(f213,plain,
! [X31,X34,X32,X33] :
( elec_1 != index(status,host(X34))
| ~ elem(m_Down(X32),queue(host(X31)))
| host(X33) != sK10(X33,X34)
| ~ elem(m_Down(X33),queue(host(X34)))
| host(X34) != host(X32)
| nbr_proc != host(X34)
| ~ setIn(X31,alive) ),
inference(cnf_transformation,[],[f113]) ).
fof(f214,plain,
! [X31,X34,X32,X33] :
( elec_1 != index(status,host(X34))
| ~ elem(m_Down(X32),queue(host(X31)))
| ~ setIn(sK10(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,[],[f113]) ).
fof(f225,plain,
setIn(sK4,alive),
inference(cnf_transformation,[],[f113]) ).
fof(f230,plain,
elec_1 = index(status,host(sK9)),
inference(cnf_transformation,[],[f113]) ).
fof(f231,plain,
nbr_proc = host(sK9),
inference(cnf_transformation,[],[f113]) ).
fof(f232,plain,
host(sK9) = host(sK7),
inference(cnf_transformation,[],[f113]) ).
fof(f233,plain,
elem(m_Down(sK8),queue(host(sK9))),
inference(cnf_transformation,[],[f113]) ).
fof(f234,plain,
! [X7] :
( setIn(X7,index(down,host(sK9)))
| host(sK8) = X7
| leq(host(sK9),X7)
| ~ leq(s(zero),X7) ),
inference(cnf_transformation,[],[f113]) ).
fof(f235,plain,
elem(m_Down(sK7),snoc(sK3,m_Ack(sK5,sK4))),
inference(cnf_transformation,[],[f113]) ).
fof(f254,plain,
nbr_proc = host(sK7),
inference(forward_demodulation,[],[f232,f231]) ).
fof(f255,plain,
elec_1 = index(status,nbr_proc),
inference(forward_demodulation,[],[f230,f231]) ).
fof(f256,plain,
elem(m_Down(sK8),queue(nbr_proc)),
inference(forward_demodulation,[],[f233,f231]) ).
fof(f383,plain,
! [X7] :
( setIn(X7,index(down,nbr_proc))
| host(sK8) = X7
| leq(host(sK9),X7)
| ~ leq(s(zero),X7) ),
inference(forward_demodulation,[],[f234,f231]) ).
fof(f384,plain,
! [X7] :
( setIn(X7,index(down,nbr_proc))
| leq(nbr_proc,X7)
| host(sK8) = X7
| ~ leq(s(zero),X7) ),
inference(forward_demodulation,[],[f383,f231]) ).
fof(f509,plain,
! [X2,X0,X1] :
( elec_1 != index(status,nbr_proc)
| ~ elem(m_Down(X0),queue(host(X1)))
| leq(s(zero),sK10(X2,sK9))
| ~ elem(m_Down(X2),queue(nbr_proc))
| host(X0) != nbr_proc
| nbr_proc != nbr_proc
| ~ setIn(X1,alive) ),
inference(superposition,[],[f211,f231]) ).
fof(f510,plain,
! [X2,X0,X1] :
( elec_1 != index(status,nbr_proc)
| ~ elem(m_Down(X0),queue(host(X1)))
| leq(s(zero),sK10(X2,sK9))
| ~ elem(m_Down(X2),queue(nbr_proc))
| host(X0) != nbr_proc
| ~ setIn(X1,alive) ),
inference(trivial_inequality_removal,[],[f509]) ).
fof(f512,plain,
! [X2,X0,X1] :
( ~ elem(m_Down(X0),queue(host(X1)))
| leq(s(zero),sK10(X2,sK9))
| ~ elem(m_Down(X2),queue(nbr_proc))
| host(X0) != nbr_proc
| ~ setIn(X1,alive) ),
inference(forward_subsumption_resolution,[],[f510,f255]) ).
fof(f515,definition,
( spl11_17
<=> ! [X2] :
( leq(s(zero),sK10(X2,sK9))
| ~ elem(m_Down(X2),queue(nbr_proc)) ) ),
introduced(definition,[new_symbols(definition,[spl11_17])],[avatar_definition]) ).
fof(f516,plain,
( ! [X2] :
( leq(s(zero),sK10(X2,sK9))
| ~ elem(m_Down(X2),queue(nbr_proc)) )
| ~ spl11_17 ),
inference(avatar_component_clause,[],[f515]) ).
fof(f518,definition,
( spl11_18
<=> ! [X0,X1] :
( ~ elem(m_Down(X0),queue(host(X1)))
| ~ setIn(X1,alive)
| host(X0) != nbr_proc ) ),
introduced(definition,[new_symbols(definition,[spl11_18])],[avatar_definition]) ).
fof(f519,plain,
( ! [X0,X1] :
( host(X0) != nbr_proc
| ~ setIn(X1,alive)
| ~ elem(m_Down(X0),queue(host(X1))) )
| ~ spl11_18 ),
inference(avatar_component_clause,[],[f518]) ).
fof(f520,plain,
( spl11_17
| spl11_18 ),
inference(avatar_split_clause,[],[f512,f518,f515]) ).
fof(f529,plain,
! [X2,X0,X1] :
( elec_1 != index(status,nbr_proc)
| ~ elem(m_Down(X0),queue(host(X1)))
| ~ leq(nbr_proc,sK10(X2,sK9))
| ~ elem(m_Down(X2),queue(nbr_proc))
| host(X0) != nbr_proc
| nbr_proc != nbr_proc
| ~ setIn(X1,alive) ),
inference(superposition,[],[f212,f231]) ).
fof(f530,plain,
! [X2,X0,X1] :
( elec_1 != index(status,nbr_proc)
| ~ elem(m_Down(X0),queue(host(X1)))
| ~ leq(nbr_proc,sK10(X2,sK9))
| ~ elem(m_Down(X2),queue(nbr_proc))
| host(X0) != nbr_proc
| ~ setIn(X1,alive) ),
inference(trivial_inequality_removal,[],[f529]) ).
fof(f532,plain,
! [X2,X0,X1] :
( ~ elem(m_Down(X0),queue(host(X1)))
| ~ leq(nbr_proc,sK10(X2,sK9))
| ~ elem(m_Down(X2),queue(nbr_proc))
| host(X0) != nbr_proc
| ~ setIn(X1,alive) ),
inference(forward_subsumption_resolution,[],[f530,f255]) ).
fof(f535,definition,
( spl11_20
<=> ! [X2] :
( ~ leq(nbr_proc,sK10(X2,sK9))
| ~ elem(m_Down(X2),queue(nbr_proc)) ) ),
introduced(definition,[new_symbols(definition,[spl11_20])],[avatar_definition]) ).
fof(f536,plain,
( ! [X2] :
( ~ leq(nbr_proc,sK10(X2,sK9))
| ~ elem(m_Down(X2),queue(nbr_proc)) )
| ~ spl11_20 ),
inference(avatar_component_clause,[],[f535]) ).
fof(f537,plain,
( spl11_20
| spl11_18 ),
inference(avatar_split_clause,[],[f532,f518,f535]) ).
fof(f546,plain,
! [X2,X0,X1] :
( elec_1 != index(status,nbr_proc)
| ~ elem(m_Down(X0),queue(host(X1)))
| host(X2) != sK10(X2,sK9)
| ~ elem(m_Down(X2),queue(nbr_proc))
| host(X0) != nbr_proc
| nbr_proc != nbr_proc
| ~ setIn(X1,alive) ),
inference(superposition,[],[f213,f231]) ).
fof(f547,plain,
! [X2,X0,X1] :
( elec_1 != index(status,nbr_proc)
| ~ elem(m_Down(X0),queue(host(X1)))
| host(X2) != sK10(X2,sK9)
| ~ elem(m_Down(X2),queue(nbr_proc))
| host(X0) != nbr_proc
| ~ setIn(X1,alive) ),
inference(trivial_inequality_removal,[],[f546]) ).
fof(f549,plain,
! [X2,X0,X1] :
( ~ elem(m_Down(X0),queue(host(X1)))
| host(X2) != sK10(X2,sK9)
| ~ elem(m_Down(X2),queue(nbr_proc))
| host(X0) != nbr_proc
| ~ setIn(X1,alive) ),
inference(forward_subsumption_resolution,[],[f547,f255]) ).
fof(f552,definition,
( spl11_22
<=> ! [X2] :
( host(X2) != sK10(X2,sK9)
| ~ elem(m_Down(X2),queue(nbr_proc)) ) ),
introduced(definition,[new_symbols(definition,[spl11_22])],[avatar_definition]) ).
fof(f553,plain,
( ! [X2] :
( host(X2) != sK10(X2,sK9)
| ~ elem(m_Down(X2),queue(nbr_proc)) )
| ~ spl11_22 ),
inference(avatar_component_clause,[],[f552]) ).
fof(f554,plain,
( spl11_22
| spl11_18 ),
inference(avatar_split_clause,[],[f549,f518,f552]) ).
fof(f571,plain,
! [X2,X0,X1] :
( elec_1 != index(status,nbr_proc)
| ~ elem(m_Down(X0),queue(host(X1)))
| ~ setIn(sK10(X2,sK9),index(down,nbr_proc))
| ~ elem(m_Down(X2),queue(nbr_proc))
| host(X0) != nbr_proc
| nbr_proc != nbr_proc
| ~ setIn(X1,alive) ),
inference(superposition,[],[f214,f231]) ).
fof(f572,plain,
! [X2,X0,X1] :
( elec_1 != index(status,nbr_proc)
| ~ elem(m_Down(X0),queue(host(X1)))
| ~ setIn(sK10(X2,sK9),index(down,nbr_proc))
| ~ elem(m_Down(X2),queue(nbr_proc))
| host(X0) != nbr_proc
| ~ setIn(X1,alive) ),
inference(trivial_inequality_removal,[],[f571]) ).
fof(f574,plain,
! [X2,X0,X1] :
( ~ elem(m_Down(X0),queue(host(X1)))
| ~ setIn(sK10(X2,sK9),index(down,nbr_proc))
| ~ elem(m_Down(X2),queue(nbr_proc))
| host(X0) != nbr_proc
| ~ setIn(X1,alive) ),
inference(forward_subsumption_resolution,[],[f572,f255]) ).
fof(f577,definition,
( spl11_24
<=> ! [X2] :
( ~ setIn(sK10(X2,sK9),index(down,nbr_proc))
| ~ elem(m_Down(X2),queue(nbr_proc)) ) ),
introduced(definition,[new_symbols(definition,[spl11_24])],[avatar_definition]) ).
fof(f578,plain,
( ! [X2] :
( ~ setIn(sK10(X2,sK9),index(down,nbr_proc))
| ~ elem(m_Down(X2),queue(nbr_proc)) )
| ~ spl11_24 ),
inference(avatar_component_clause,[],[f577]) ).
fof(f579,plain,
( spl11_24
| spl11_18 ),
inference(avatar_split_clause,[],[f574,f518,f577]) ).
fof(f587,plain,
( ! [X0] :
( nbr_proc != nbr_proc
| ~ setIn(X0,alive)
| ~ elem(m_Down(sK7),queue(host(X0))) )
| ~ spl11_18 ),
inference(superposition,[],[f519,f254]) ).
fof(f590,plain,
( ! [X0] :
( ~ elem(m_Down(sK7),queue(host(X0)))
| ~ setIn(X0,alive) )
| ~ spl11_18 ),
inference(trivial_inequality_removal,[],[f587]) ).
fof(f848,plain,
! [X0] :
( elem(X0,queue(host(sK4)))
| ~ elem(X0,sK3) ),
inference(superposition,[],[f167,f210]) ).
fof(f857,plain,
( ~ elem(m_Down(sK7),sK3)
| ~ setIn(sK4,alive)
| ~ spl11_18 ),
inference(resolution,[],[f848,f590]) ).
fof(f861,plain,
( ~ elem(m_Down(sK7),sK3)
| ~ spl11_18 ),
inference(forward_subsumption_resolution,[],[f857,f225]) ).
fof(f1029,plain,
( elem(m_Down(sK7),sK3)
| m_Down(sK7) = m_Ack(sK5,sK4) ),
inference(resolution,[],[f169,f235]) ).
fof(f1035,plain,
( m_Down(sK7) = m_Ack(sK5,sK4)
| ~ spl11_18 ),
inference(forward_subsumption_resolution,[],[f1029,f861]) ).
fof(f1036,plain,
( $false
| ~ spl11_18 ),
inference(forward_subsumption_resolution,[],[f1035,f127]) ).
fof(f1037,plain,
~ spl11_18,
inference(avatar_contradiction_clause,[],[f1036]) ).
fof(f1139,plain,
( ! [X0] :
( ~ elem(m_Down(X0),queue(nbr_proc))
| leq(nbr_proc,sK10(X0,sK9))
| host(sK8) = sK10(X0,sK9)
| ~ leq(s(zero),sK10(X0,sK9)) )
| ~ spl11_24 ),
inference(resolution,[],[f578,f384]) ).
fof(f1140,plain,
( ! [X0] :
( ~ elem(m_Down(X0),queue(nbr_proc))
| host(sK8) = sK10(X0,sK9)
| ~ leq(s(zero),sK10(X0,sK9)) )
| ~ spl11_20
| ~ spl11_24 ),
inference(forward_subsumption_resolution,[],[f1139,f536]) ).
fof(f1141,plain,
( ! [X0] :
( ~ elem(m_Down(X0),queue(nbr_proc))
| host(sK8) = sK10(X0,sK9) )
| ~ spl11_17
| ~ spl11_20
| ~ spl11_24 ),
inference(forward_subsumption_resolution,[],[f1140,f516]) ).
fof(f1142,plain,
( host(sK8) = sK10(sK8,sK9)
| ~ spl11_17
| ~ spl11_20
| ~ spl11_24 ),
inference(resolution,[],[f1141,f256]) ).
fof(f1147,plain,
( host(sK8) != host(sK8)
| ~ elem(m_Down(sK8),queue(nbr_proc))
| ~ spl11_17
| ~ spl11_20
| ~ spl11_22
| ~ spl11_24 ),
inference(superposition,[],[f553,f1142]) ).
fof(f1150,plain,
( ~ elem(m_Down(sK8),queue(nbr_proc))
| ~ spl11_17
| ~ spl11_20
| ~ spl11_22
| ~ spl11_24 ),
inference(trivial_inequality_removal,[],[f1147]) ).
fof(f1152,plain,
( $false
| ~ spl11_17
| ~ spl11_20
| ~ spl11_22
| ~ spl11_24 ),
inference(forward_subsumption_resolution,[],[f1150,f256]) ).
fof(f1153,plain,
( ~ spl11_17
| ~ spl11_20
| ~ spl11_22
| ~ spl11_24 ),
inference(avatar_contradiction_clause,[],[f1152]) ).
cnf(s19,plain,
( spl11_17
| spl11_18 ),
inference(sat_conversion,[],[f520]) ).
cnf(s21,plain,
( spl11_18
| spl11_20 ),
inference(sat_conversion,[],[f537]) ).
cnf(s23,plain,
( spl11_18
| spl11_22 ),
inference(sat_conversion,[],[f554]) ).
cnf(s25,plain,
( spl11_18
| spl11_24 ),
inference(sat_conversion,[],[f579]) ).
cnf(s36,plain,
~ spl11_18,
inference(sat_conversion,[],[f1037]) ).
cnf(s40,plain,
( ~ spl11_17
| ~ spl11_20
| ~ spl11_22
| ~ spl11_24 ),
inference(sat_conversion,[],[f1153]) ).
cnf(s43,plain,
spl11_24,
inference(rat,[],[s25,s36]) ).
cnf(s45,plain,
spl11_22,
inference(rat,[],[s23,s36]) ).
cnf(s47,plain,
spl11_20,
inference(rat,[],[s21,s36]) ).
cnf(s48,plain,
~ spl11_17,
inference(rat,[],[s40,s43,s45,s47]) ).
cnf(s50,plain,
$false,
inference(rat,[],[s19,s36,s48]) ).
fof(f1155,plain,
$false,
inference(avatar_sat_refutation,[],[s50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SWV470+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.02 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.00/0.11 % Computer : n012.cluster.edu
% 0.00/0.11 % Model : x86_64 x86_64
% 0.00/0.11 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.11 % Memory : 8046.5625MB
% 0.00/0.11 % OS : Linux 6.8.0-71-generic
% 0.00/0.11 % CPULimit : 300
% 0.00/0.11 % WCLimit : 300
% 0.00/0.11 % DateTime : Mon Sep 28 11:09:49 UTC 2026
% 0.00/0.11 % CPUTime :
% 0.00/0.11 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.13 Running first-order model finding
% 0.08/0.13 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.08/0.17 % (3316580)Will run a generic schedule for satisfiability detection.
% 0.08/0.17 % (3316586)% WARNING: option uhcvi not known.
% 0.08/0.17 % (3316586)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1999290790:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.08/0.17 % (3316585)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1637404730_2999 on theBenchmark for (2999ds/0Mi)
% 0.08/0.17 % (3316588)dis+10_1_sil=32000:sp=arity:random_seed=2618812691:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.17 % (3316587)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2721114715:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.08/0.17 % (3316591)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3101720665:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.08/0.17 % (3316589)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2670678401:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.08/0.17 % (3316590)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2289362314:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.08/0.17 % Detected minimum model sizes of [4]
% 0.08/0.17 % Detected maximum model sizes of [max]
% 0.08/0.17 % TRYING [4]
% 0.08/0.17 % (3316588) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3316580-3316588"...
% 0.08/0.17 % (3316588)...printing done.
% 0.08/0.17 % (3316588)Refutation found. Thanks to Tanya!
% 0.08/0.17 % SZS status Theorem for theBenchmark
% 0.08/0.17 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.17 % (3316588)------------------------------
% 0.08/0.17 % (3316588)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.17 % (3316588)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.17 % (3316588)CaDiCaL version: 2.1.3
% 0.08/0.17 % (3316588)Termination reason: Refutation
% 0.08/0.17 % (3316588)Time elapsed: 0.016 s
% 0.08/0.17 % (3316588)Peak memory usage: 13 MB
% 0.08/0.17 % (3316588)Instructions burned: 50 (million)
% 0.08/0.17 % (3316580)Success in time 0.04 s
% 0.08/0.17 % Vampire exiting
%------------------------------------------------------------------------------