%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWV451+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n018.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:50 PM UTC 2026
% Result : Theorem 3.10s 1.12s
% Output : Refutation 3.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 13
% Syntax : Number of formulae : 122 ( 32 unt; 9 def)
% Number of atoms : 645 ( 241 equ)
% Maximal formula atoms : 51 ( 5 avg)
% Number of connectives : 870 ( 347 ~; 245 |; 209 &)
% ( 9 <=>; 60 =>; 0 <=; 0 <~>)
% Maximal formula depth : 39 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 7 prp; 0-2 aty)
% Number of functors : 26 ( 26 usr; 16 con; 0-2 aty)
% Number of variables : 258 ( 0 sgn 234 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f18,axiom,
! [X0,X1] : m_Down(X0) != m_Halt(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_17) ).
fof(f47,axiom,
! [X0,X1,X2] :
( elem(X0,cons(X1,X2))
<=> ( X0 = X1
| elem(X0,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_46) ).
fof(f48,axiom,
! [X0,X1,X2] :
( elem(X0,snoc(X2,X1))
<=> ( X0 = X1
| elem(X0,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_47) ).
fof(f67,conjecture,
! [X0,X1,X2,X3] :
( ( ! [X4,X5] :
( setIn(X5,alive)
=> ~ elem(m_Down(X5),queue(host(X4))) )
& ! [X4,X5] :
( elem(m_Down(X5),queue(host(X4)))
=> ~ setIn(X5,alive) )
& ! [X4,X5] :
( elem(m_Down(X5),queue(host(X4)))
=> host(X5) != host(X4) )
& ! [X4,X5] :
( elem(m_Halt(X5),queue(host(X4)))
=> ~ leq(host(X4),host(X5)) )
& ! [X4,X6,X5] :
( elem(m_Ack(X5,X4),queue(host(X6)))
=> ~ leq(host(X4),host(X5)) )
& ! [X4,X5] :
( ( ~ setIn(X4,alive)
& leq(X5,X4)
& host(X5) = host(X4) )
=> ~ setIn(X5,alive) )
& ! [X4,X5] :
( ( X5 != X4
& host(X5) = host(X4) )
=> ( ~ setIn(X4,alive)
| ~ setIn(X5,alive) ) )
& ! [X4,X7,X6,X5] :
( ( host(X6) != host(X4)
& setIn(X4,alive)
& setIn(X6,alive)
& host(X7) = host(X4)
& host(X5) = host(X6) )
=> ~ ( elem(m_Down(X5),queue(host(X4)))
& elem(m_Down(X7),queue(host(X6))) ) )
& queue(host(X3)) = cons(m_NotNorm(X2),X0) )
=> ( setIn(X3,alive)
=> ( ( index(ldr,host(X3)) = host(X3)
& index(status,host(X3)) = norm
& index(elid,host(X3)) = X2 )
=> ( ( ! [X4] :
( host(X3) = host(X4)
=> leq(X4,X1) )
& ~ setIn(X1,pids)
& host(X3) = host(X1) )
=> ( host(X1) = s(zero)
=> ( ~ leq(nbr_proc,host(X1))
=> ! [X4] :
( s(host(X1)) = host(X4)
=> ( host(X3) != host(X4)
=> ! [X8,X9] :
( s(host(X1)) != host(X9)
=> ( host(X3) = host(X9)
=> ! [X10] :
( ( ( ( X4 != X3
& setIn(X4,alive) )
| X4 = X1 )
& ( ( X9 != X3
& setIn(X9,alive) )
| X9 = X1 )
& host(X9) != host(X4)
& host(X8) = host(X4)
& host(X10) = host(X9) )
=> ~ ( elem(m_Down(X8),X0)
& elem(m_Down(X10),snoc(queue(host(X4)),m_Halt(X1))) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
fof(f68,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( ! [X4,X5] :
( setIn(X5,alive)
=> ~ elem(m_Down(X5),queue(host(X4))) )
& ! [X4,X5] :
( elem(m_Down(X5),queue(host(X4)))
=> ~ setIn(X5,alive) )
& ! [X4,X5] :
( elem(m_Down(X5),queue(host(X4)))
=> host(X5) != host(X4) )
& ! [X4,X5] :
( elem(m_Halt(X5),queue(host(X4)))
=> ~ leq(host(X4),host(X5)) )
& ! [X4,X6,X5] :
( elem(m_Ack(X5,X4),queue(host(X6)))
=> ~ leq(host(X4),host(X5)) )
& ! [X4,X5] :
( ( ~ setIn(X4,alive)
& leq(X5,X4)
& host(X5) = host(X4) )
=> ~ setIn(X5,alive) )
& ! [X4,X5] :
( ( X5 != X4
& host(X5) = host(X4) )
=> ( ~ setIn(X4,alive)
| ~ setIn(X5,alive) ) )
& ! [X4,X7,X6,X5] :
( ( host(X6) != host(X4)
& setIn(X4,alive)
& setIn(X6,alive)
& host(X7) = host(X4)
& host(X5) = host(X6) )
=> ~ ( elem(m_Down(X5),queue(host(X4)))
& elem(m_Down(X7),queue(host(X6))) ) )
& queue(host(X3)) = cons(m_NotNorm(X2),X0) )
=> ( setIn(X3,alive)
=> ( ( index(ldr,host(X3)) = host(X3)
& index(status,host(X3)) = norm
& index(elid,host(X3)) = X2 )
=> ( ( ! [X4] :
( host(X3) = host(X4)
=> leq(X4,X1) )
& ~ setIn(X1,pids)
& host(X3) = host(X1) )
=> ( host(X1) = s(zero)
=> ( ~ leq(nbr_proc,host(X1))
=> ! [X4] :
( s(host(X1)) = host(X4)
=> ( host(X3) != host(X4)
=> ! [X8,X9] :
( s(host(X1)) != host(X9)
=> ( host(X3) = host(X9)
=> ! [X10] :
( ( ( ( X4 != X3
& setIn(X4,alive) )
| X4 = X1 )
& ( ( X9 != X3
& setIn(X9,alive) )
| X9 = X1 )
& host(X9) != host(X4)
& host(X8) = host(X4)
& host(X10) = host(X9) )
=> ~ ( elem(m_Down(X8),X0)
& elem(m_Down(X10),snoc(queue(host(X4)),m_Halt(X1))) ) ) ) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f67]) ).
fof(f69,plain,
~ ! [X0,X1,X2,X3] :
( ( ! [X4,X5] :
( setIn(X5,alive)
=> ~ elem(m_Down(X5),queue(host(X4))) )
& ! [X6,X7] :
( elem(m_Down(X7),queue(host(X6)))
=> ~ setIn(X7,alive) )
& ! [X8,X9] :
( elem(m_Down(X9),queue(host(X8)))
=> host(X9) != host(X8) )
& ! [X10,X11] :
( elem(m_Halt(X11),queue(host(X10)))
=> ~ leq(host(X10),host(X11)) )
& ! [X12,X13,X14] :
( elem(m_Ack(X14,X12),queue(host(X13)))
=> ~ leq(host(X12),host(X14)) )
& ! [X15,X16] :
( ( ~ setIn(X15,alive)
& leq(X16,X15)
& host(X15) = host(X16) )
=> ~ setIn(X16,alive) )
& ! [X17,X18] :
( ( X17 != X18
& host(X17) = host(X18) )
=> ( ~ setIn(X17,alive)
| ~ setIn(X18,alive) ) )
& ! [X19,X20,X21,X22] :
( ( host(X19) != host(X21)
& setIn(X19,alive)
& setIn(X21,alive)
& host(X19) = host(X20)
& host(X21) = host(X22) )
=> ~ ( elem(m_Down(X22),queue(host(X19)))
& elem(m_Down(X20),queue(host(X21))) ) )
& queue(host(X3)) = cons(m_NotNorm(X2),X0) )
=> ( setIn(X3,alive)
=> ( ( index(ldr,host(X3)) = host(X3)
& index(status,host(X3)) = norm
& index(elid,host(X3)) = X2 )
=> ( ( ! [X23] :
( host(X3) = host(X23)
=> leq(X23,X1) )
& ~ setIn(X1,pids)
& host(X3) = host(X1) )
=> ( host(X1) = s(zero)
=> ( ~ leq(nbr_proc,host(X1))
=> ! [X24] :
( s(host(X1)) = host(X24)
=> ( host(X3) != host(X24)
=> ! [X25,X26] :
( s(host(X1)) != host(X26)
=> ( host(X3) = host(X26)
=> ! [X27] :
( ( ( ( X3 != X24
& setIn(X24,alive) )
| X1 = X24 )
& ( ( X3 != X26
& setIn(X26,alive) )
| X1 = X26 )
& host(X24) != host(X26)
& host(X24) = host(X25)
& host(X26) = host(X27) )
=> ~ ( elem(m_Down(X25),X0)
& elem(m_Down(X27),snoc(queue(host(X24)),m_Halt(X1))) ) ) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f68]) ).
fof(f70,plain,
? [X0,X1,X2,X3] :
( ? [X24] :
( ? [X25,X26] :
( ? [X27] :
( elem(m_Down(X25),X0)
& elem(m_Down(X27),snoc(queue(host(X24)),m_Halt(X1)))
& ( ( X3 != X24
& setIn(X24,alive) )
| X1 = X24 )
& ( ( X3 != X26
& setIn(X26,alive) )
| X1 = X26 )
& host(X24) != host(X26)
& host(X24) = host(X25)
& host(X26) = host(X27) )
& host(X3) = host(X26)
& s(host(X1)) != host(X26) )
& host(X3) != host(X24)
& s(host(X1)) = host(X24) )
& ~ leq(nbr_proc,host(X1))
& host(X1) = s(zero)
& ! [X23] :
( leq(X23,X1)
| host(X3) != host(X23) )
& ~ setIn(X1,pids)
& host(X3) = host(X1)
& index(ldr,host(X3)) = host(X3)
& index(status,host(X3)) = norm
& index(elid,host(X3)) = X2
& setIn(X3,alive)
& ! [X4,X5] :
( ~ elem(m_Down(X5),queue(host(X4)))
| ~ setIn(X5,alive) )
& ! [X6,X7] :
( ~ setIn(X7,alive)
| ~ elem(m_Down(X7),queue(host(X6))) )
& ! [X8,X9] :
( host(X9) != host(X8)
| ~ elem(m_Down(X9),queue(host(X8))) )
& ! [X10,X11] :
( ~ leq(host(X10),host(X11))
| ~ elem(m_Halt(X11),queue(host(X10))) )
& ! [X12,X13,X14] :
( ~ leq(host(X12),host(X14))
| ~ elem(m_Ack(X14,X12),queue(host(X13))) )
& ! [X15,X16] :
( ~ setIn(X16,alive)
| setIn(X15,alive)
| ~ leq(X16,X15)
| host(X15) != host(X16) )
& ! [X17,X18] :
( ~ setIn(X17,alive)
| ~ setIn(X18,alive)
| X17 = X18
| host(X17) != host(X18) )
& ! [X19,X20,X21,X22] :
( ~ elem(m_Down(X22),queue(host(X19)))
| ~ elem(m_Down(X20),queue(host(X21)))
| host(X19) = host(X21)
| ~ setIn(X19,alive)
| ~ setIn(X21,alive)
| host(X19) != host(X20)
| host(X21) != host(X22) )
& queue(host(X3)) = cons(m_NotNorm(X2),X0) ),
inference(ennf_transformation,[],[f69]) ).
fof(f71,plain,
? [X0,X1,X2,X3] :
( ? [X24] :
( ? [X25,X26] :
( ? [X27] :
( elem(m_Down(X25),X0)
& elem(m_Down(X27),snoc(queue(host(X24)),m_Halt(X1)))
& ( ( X3 != X24
& setIn(X24,alive) )
| X1 = X24 )
& ( ( X3 != X26
& setIn(X26,alive) )
| X1 = X26 )
& host(X24) != host(X26)
& host(X24) = host(X25)
& host(X26) = host(X27) )
& host(X3) = host(X26)
& s(host(X1)) != host(X26) )
& host(X3) != host(X24)
& s(host(X1)) = host(X24) )
& ~ leq(nbr_proc,host(X1))
& host(X1) = s(zero)
& ! [X23] :
( leq(X23,X1)
| host(X3) != host(X23) )
& ~ setIn(X1,pids)
& host(X3) = host(X1)
& index(ldr,host(X3)) = host(X3)
& index(status,host(X3)) = norm
& index(elid,host(X3)) = X2
& setIn(X3,alive)
& ! [X4,X5] :
( ~ elem(m_Down(X5),queue(host(X4)))
| ~ setIn(X5,alive) )
& ! [X6,X7] :
( ~ setIn(X7,alive)
| ~ elem(m_Down(X7),queue(host(X6))) )
& ! [X8,X9] :
( host(X9) != host(X8)
| ~ elem(m_Down(X9),queue(host(X8))) )
& ! [X10,X11] :
( ~ leq(host(X10),host(X11))
| ~ elem(m_Halt(X11),queue(host(X10))) )
& ! [X12,X13,X14] :
( ~ leq(host(X12),host(X14))
| ~ elem(m_Ack(X14,X12),queue(host(X13))) )
& ! [X15,X16] :
( ~ setIn(X16,alive)
| setIn(X15,alive)
| ~ leq(X16,X15)
| host(X15) != host(X16) )
& ! [X17,X18] :
( ~ setIn(X17,alive)
| ~ setIn(X18,alive)
| X17 = X18
| host(X17) != host(X18) )
& ! [X19,X20,X21,X22] :
( ~ elem(m_Down(X22),queue(host(X19)))
| ~ elem(m_Down(X20),queue(host(X21)))
| host(X19) = host(X21)
| ~ setIn(X19,alive)
| ~ setIn(X21,alive)
| host(X19) != host(X20)
| host(X21) != host(X22) )
& queue(host(X3)) = cons(m_NotNorm(X2),X0) ),
inference(flattening,[],[f70]) ).
fof(f79,plain,
? [X0,X1,X2,X3] :
( ? [X4] :
( ? [X5,X6] :
( ? [X7] :
( elem(m_Down(X5),X0)
& elem(m_Down(X7),snoc(queue(host(X4)),m_Halt(X1)))
& ( ( X3 != X4
& setIn(X4,alive) )
| X1 = X4 )
& ( ( X3 != X6
& setIn(X6,alive) )
| X1 = X6 )
& host(X4) != host(X6)
& host(X4) = host(X5)
& host(X6) = host(X7) )
& host(X6) = host(X3)
& host(X6) != s(host(X1)) )
& host(X4) != host(X3)
& host(X4) = s(host(X1)) )
& ~ leq(nbr_proc,host(X1))
& host(X1) = s(zero)
& ! [X8] :
( leq(X8,X1)
| host(X3) != host(X8) )
& ~ setIn(X1,pids)
& host(X3) = host(X1)
& index(ldr,host(X3)) = host(X3)
& index(status,host(X3)) = norm
& index(elid,host(X3)) = X2
& setIn(X3,alive)
& ! [X9,X10] :
( ~ elem(m_Down(X10),queue(host(X9)))
| ~ setIn(X10,alive) )
& ! [X11,X12] :
( ~ setIn(X12,alive)
| ~ elem(m_Down(X12),queue(host(X11))) )
& ! [X13,X14] :
( host(X13) != host(X14)
| ~ elem(m_Down(X14),queue(host(X13))) )
& ! [X15,X16] :
( ~ leq(host(X15),host(X16))
| ~ elem(m_Halt(X16),queue(host(X15))) )
& ! [X17,X18,X19] :
( ~ leq(host(X17),host(X19))
| ~ elem(m_Ack(X19,X17),queue(host(X18))) )
& ! [X20,X21] :
( ~ setIn(X21,alive)
| setIn(X20,alive)
| ~ leq(X21,X20)
| host(X21) != host(X20) )
& ! [X22,X23] :
( ~ setIn(X22,alive)
| ~ setIn(X23,alive)
| X22 = X23
| host(X22) != host(X23) )
& ! [X24,X25,X26,X27] :
( ~ elem(m_Down(X27),queue(host(X24)))
| ~ elem(m_Down(X25),queue(host(X26)))
| host(X24) = host(X26)
| ~ setIn(X24,alive)
| ~ setIn(X26,alive)
| host(X24) != host(X25)
| host(X26) != host(X27) )
& queue(host(X3)) = cons(m_NotNorm(X2),X0) ),
inference(rectify,[],[f71]) ).
fof(f80,plain,
( elem(m_Down(sK5),sK0)
& elem(m_Down(sK7),snoc(queue(host(sK4)),m_Halt(sK1)))
& ( ( sK3 != sK4
& setIn(sK4,alive) )
| sK1 = sK4 )
& ( ( sK3 != sK6
& setIn(sK6,alive) )
| sK1 = sK6 )
& host(sK4) != host(sK6)
& host(sK4) = host(sK5)
& host(sK6) = host(sK7)
& host(sK6) = host(sK3)
& host(sK6) != s(host(sK1))
& host(sK4) != host(sK3)
& host(sK4) = s(host(sK1))
& ~ leq(nbr_proc,host(sK1))
& s(zero) = host(sK1)
& ! [X8] :
( leq(X8,sK1)
| host(X8) != host(sK3) )
& ~ setIn(sK1,pids)
& host(sK3) = host(sK1)
& host(sK3) = index(ldr,host(sK3))
& norm = index(status,host(sK3))
& sK2 = index(elid,host(sK3))
& setIn(sK3,alive)
& ! [X9,X10] :
( ~ elem(m_Down(X10),queue(host(X9)))
| ~ setIn(X10,alive) )
& ! [X11,X12] :
( ~ setIn(X12,alive)
| ~ elem(m_Down(X12),queue(host(X11))) )
& ! [X13,X14] :
( host(X13) != host(X14)
| ~ elem(m_Down(X14),queue(host(X13))) )
& ! [X15,X16] :
( ~ leq(host(X15),host(X16))
| ~ elem(m_Halt(X16),queue(host(X15))) )
& ! [X17,X18,X19] :
( ~ leq(host(X17),host(X19))
| ~ elem(m_Ack(X19,X17),queue(host(X18))) )
& ! [X20,X21] :
( ~ setIn(X21,alive)
| setIn(X20,alive)
| ~ leq(X21,X20)
| host(X21) != host(X20) )
& ! [X22,X23] :
( ~ setIn(X22,alive)
| ~ setIn(X23,alive)
| X22 = X23
| host(X22) != host(X23) )
& ! [X24,X25,X26,X27] :
( ~ elem(m_Down(X27),queue(host(X24)))
| ~ elem(m_Down(X25),queue(host(X26)))
| host(X24) = host(X26)
| ~ setIn(X24,alive)
| ~ setIn(X26,alive)
| host(X24) != host(X25)
| host(X26) != host(X27) )
& queue(host(sK3)) = cons(m_NotNorm(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(X7,sK7)],[f79]) ).
fof(f81,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(f82,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,[],[f81]) ).
fof(f83,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(f84,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,[],[f83]) ).
fof(f93,plain,
queue(host(sK3)) = cons(m_NotNorm(sK2),sK0),
inference(cnf_transformation,[],[f80]) ).
fof(f94,plain,
! [X26,X27,X24,X25] :
( ~ elem(m_Down(X27),queue(host(X24)))
| ~ elem(m_Down(X25),queue(host(X26)))
| host(X24) = host(X26)
| ~ setIn(X24,alive)
| ~ setIn(X26,alive)
| host(X24) != host(X25)
| host(X26) != host(X27) ),
inference(cnf_transformation,[],[f80]) ).
fof(f95,plain,
! [X22,X23] :
( host(X22) != host(X23)
| ~ setIn(X23,alive)
| X22 = X23
| ~ setIn(X22,alive) ),
inference(cnf_transformation,[],[f80]) ).
fof(f96,plain,
! [X21,X20] :
( host(X21) != host(X20)
| setIn(X20,alive)
| ~ leq(X21,X20)
| ~ setIn(X21,alive) ),
inference(cnf_transformation,[],[f80]) ).
fof(f99,plain,
! [X14,X13] :
( host(X13) != host(X14)
| ~ elem(m_Down(X14),queue(host(X13))) ),
inference(cnf_transformation,[],[f80]) ).
fof(f102,plain,
setIn(sK3,alive),
inference(cnf_transformation,[],[f80]) ).
fof(f106,plain,
host(sK3) = host(sK1),
inference(cnf_transformation,[],[f80]) ).
fof(f108,plain,
! [X8] :
( leq(X8,sK1)
| host(X8) != host(sK3) ),
inference(cnf_transformation,[],[f80]) ).
fof(f111,plain,
host(sK4) = s(host(sK1)),
inference(cnf_transformation,[],[f80]) ).
fof(f112,plain,
host(sK4) != host(sK3),
inference(cnf_transformation,[],[f80]) ).
fof(f114,plain,
host(sK6) = host(sK3),
inference(cnf_transformation,[],[f80]) ).
fof(f115,plain,
host(sK6) = host(sK7),
inference(cnf_transformation,[],[f80]) ).
fof(f116,plain,
host(sK4) = host(sK5),
inference(cnf_transformation,[],[f80]) ).
fof(f118,plain,
( setIn(sK6,alive)
| sK1 = sK6 ),
inference(cnf_transformation,[],[f80]) ).
fof(f120,plain,
( setIn(sK4,alive)
| sK1 = sK4 ),
inference(cnf_transformation,[],[f80]) ).
fof(f122,plain,
elem(m_Down(sK7),snoc(queue(host(sK4)),m_Halt(sK1))),
inference(cnf_transformation,[],[f80]) ).
fof(f123,plain,
elem(m_Down(sK5),sK0),
inference(cnf_transformation,[],[f80]) ).
fof(f128,plain,
! [X2,X0,X1] :
( ~ elem(X0,snoc(X2,X1))
| elem(X0,X2)
| X0 = X1 ),
inference(cnf_transformation,[],[f82]) ).
fof(f132,plain,
! [X2,X0,X1] :
( elem(X0,cons(X1,X2))
| ~ elem(X0,X2) ),
inference(cnf_transformation,[],[f84]) ).
fof(f156,plain,
! [X0,X1] : m_Halt(X1) != m_Down(X0),
inference(cnf_transformation,[],[f18]) ).
fof(f174,definition,
~ sP12(host(sK4)),
introduced(definition,[new_symbols(definition,[sP12])],[inequality_splitting_name_introduction]) ).
fof(f175,plain,
sP12(host(sK3)),
inference(inequality_splitting,[],[f112,f174]) ).
fof(f176,definition,
~ sP13(host(sK3)),
introduced(definition,[new_symbols(definition,[sP13])],[inequality_splitting_name_introduction]) ).
fof(f177,plain,
! [X8] :
( sP13(host(X8))
| leq(X8,sK1) ),
inference(inequality_splitting,[],[f108,f176]) ).
fof(f187,plain,
! [X26,X27,X24] :
( host(X26) != host(X27)
| ~ elem(m_Down(X27),queue(host(X24)))
| sP14(X24,X26) ),
inference(cnf_transformation,[],[f187_D]) ).
fof(f187_D,definition,
! [X26,X24] :
( ! [X27] :
( host(X26) != host(X27)
| ~ elem(m_Down(X27),queue(host(X24))) )
<=> ~ sP14(X24,X26) ),
introduced(definition,[new_symbols(definition,[sP14])],[general_splitting_component_introduction]) ).
fof(f188,plain,
! [X26,X24,X25] :
( host(X24) != host(X25)
| host(X24) = host(X26)
| ~ setIn(X24,alive)
| ~ setIn(X26,alive)
| ~ elem(m_Down(X25),queue(host(X26)))
| ~ sP14(X24,X26) ),
inference(general_splitting,[],[f94,f187_D]) ).
fof(f189,plain,
sP12(host(sK1)),
inference(forward_demodulation,[],[f175,f106]) ).
fof(f190,plain,
host(sK6) = host(sK1),
inference(forward_demodulation,[],[f114,f106]) ).
fof(f191,plain,
host(sK5) = s(host(sK1)),
inference(forward_demodulation,[],[f116,f111]) ).
fof(f193,definition,
( spl15_1
<=> sK1 = sK6 ),
introduced(definition,[new_symbols(definition,[spl15_1])],[avatar_definition]) ).
fof(f195,plain,
( sK1 = sK6
| ~ spl15_1 ),
inference(avatar_component_clause,[],[f193]) ).
fof(f197,definition,
( spl15_2
<=> setIn(sK6,alive) ),
introduced(definition,[new_symbols(definition,[spl15_2])],[avatar_definition]) ).
fof(f198,plain,
( ~ setIn(sK6,alive)
| spl15_2 ),
inference(avatar_component_clause,[],[f197]) ).
fof(f199,plain,
( setIn(sK6,alive)
| ~ spl15_2 ),
inference(avatar_component_clause,[],[f197]) ).
fof(f200,plain,
( spl15_1
| spl15_2 ),
inference(avatar_split_clause,[],[f118,f197,f193]) ).
fof(f207,definition,
( spl15_4
<=> sK1 = sK4 ),
introduced(definition,[new_symbols(definition,[spl15_4])],[avatar_definition]) ).
fof(f209,plain,
( sK1 = sK4
| ~ spl15_4 ),
inference(avatar_component_clause,[],[f207]) ).
fof(f211,definition,
( spl15_5
<=> setIn(sK4,alive) ),
introduced(definition,[new_symbols(definition,[spl15_5])],[avatar_definition]) ).
fof(f213,plain,
( setIn(sK4,alive)
| ~ spl15_5 ),
inference(avatar_component_clause,[],[f211]) ).
fof(f214,plain,
( spl15_4
| spl15_5 ),
inference(avatar_split_clause,[],[f120,f211,f207]) ).
fof(f220,plain,
elem(m_Down(sK7),snoc(queue(s(host(sK1))),m_Halt(sK1))),
inference(forward_demodulation,[],[f122,f111]) ).
fof(f221,plain,
( ~ sP12(host(sK1))
| ~ spl15_4 ),
inference(superposition,[],[f174,f209]) ).
fof(f223,plain,
( $false
| ~ spl15_4 ),
inference(forward_subsumption_resolution,[],[f221,f189]) ).
fof(f224,plain,
~ spl15_4,
inference(avatar_contradiction_clause,[],[f223]) ).
fof(f302,plain,
leq(sK3,sK1),
inference(resolution,[],[f177,f176]) ).
fof(f324,definition,
( spl15_17
<=> sK1 = sK3 ),
introduced(definition,[new_symbols(definition,[spl15_17])],[avatar_definition]) ).
fof(f326,plain,
( sK1 = sK3
| ~ spl15_17 ),
inference(avatar_component_clause,[],[f324]) ).
fof(f366,plain,
! [X0] :
( elem(X0,queue(host(sK3)))
| ~ elem(X0,sK0) ),
inference(superposition,[],[f132,f93]) ).
fof(f369,plain,
! [X0] :
( elem(X0,queue(host(sK1)))
| ~ elem(X0,sK0) ),
inference(forward_demodulation,[],[f366,f106]) ).
fof(f388,plain,
( elem(m_Down(sK7),queue(s(host(sK1))))
| m_Down(sK7) = m_Halt(sK1) ),
inference(resolution,[],[f220,f128]) ).
fof(f389,plain,
elem(m_Down(sK7),queue(s(host(sK1)))),
inference(forward_subsumption_resolution,[],[f388,f156]) ).
fof(f406,plain,
! [X0] :
( host(X0) != host(sK6)
| ~ elem(m_Down(sK7),queue(host(X0))) ),
inference(superposition,[],[f99,f115]) ).
fof(f408,plain,
! [X0] :
( host(X0) != host(sK1)
| ~ elem(m_Down(sK7),queue(host(X0))) ),
inference(forward_demodulation,[],[f406,f190]) ).
fof(f424,plain,
! [X0] :
( host(X0) != host(sK1)
| ~ setIn(sK6,alive)
| sK6 = X0
| ~ setIn(X0,alive) ),
inference(superposition,[],[f95,f190]) ).
fof(f429,plain,
( ! [X0] :
( host(X0) != host(sK1)
| sK6 = X0
| ~ setIn(X0,alive) )
| ~ spl15_2 ),
inference(forward_subsumption_resolution,[],[f424,f199]) ).
fof(f454,plain,
! [X0] :
( host(X0) != host(sK1)
| setIn(X0,alive)
| ~ leq(sK3,X0)
| ~ setIn(sK3,alive) ),
inference(superposition,[],[f96,f106]) ).
fof(f469,plain,
! [X0] :
( host(X0) != host(sK1)
| setIn(X0,alive)
| ~ leq(sK3,X0) ),
inference(forward_subsumption_resolution,[],[f454,f102]) ).
fof(f472,plain,
! [X0,X1] :
( host(X0) != s(host(sK1))
| ~ elem(m_Down(X0),queue(host(X1)))
| sP14(X1,sK4) ),
inference(superposition,[],[f187,f111]) ).
fof(f488,plain,
! [X0,X1] :
( host(X0) != host(sK1)
| host(X1) = host(sK1)
| ~ setIn(sK6,alive)
| ~ setIn(X1,alive)
| ~ elem(m_Down(X0),queue(host(X1)))
| ~ sP14(sK6,X1) ),
inference(superposition,[],[f188,f190]) ).
fof(f497,plain,
( ! [X0,X1] :
( host(X0) != host(sK1)
| host(X1) = host(sK1)
| ~ setIn(X1,alive)
| ~ elem(m_Down(X0),queue(host(X1)))
| ~ sP14(sK6,X1) )
| ~ spl15_2 ),
inference(forward_subsumption_resolution,[],[f488,f199]) ).
fof(f700,plain,
( host(sK1) != host(sK1)
| sK3 = sK6
| ~ setIn(sK3,alive)
| ~ spl15_2 ),
inference(superposition,[],[f429,f106]) ).
fof(f704,plain,
( sK1 = sK6
| ~ setIn(sK1,alive)
| ~ spl15_2 ),
inference(equality_resolution,[],[f429]) ).
fof(f705,plain,
( sK3 = sK6
| ~ setIn(sK3,alive)
| ~ spl15_2 ),
inference(trivial_inequality_removal,[],[f700]) ).
fof(f707,definition,
( spl15_39
<=> setIn(sK1,alive) ),
introduced(definition,[new_symbols(definition,[spl15_39])],[avatar_definition]) ).
fof(f708,plain,
( setIn(sK1,alive)
| ~ spl15_39 ),
inference(avatar_component_clause,[],[f707]) ).
fof(f709,plain,
( ~ setIn(sK1,alive)
| spl15_39 ),
inference(avatar_component_clause,[],[f707]) ).
fof(f710,plain,
( ~ spl15_39
| spl15_1
| ~ spl15_2 ),
inference(avatar_split_clause,[],[f704,f197,f193,f707]) ).
fof(f711,plain,
( sK3 = sK6
| ~ spl15_2 ),
inference(forward_subsumption_resolution,[],[f705,f102]) ).
fof(f746,plain,
( sK1 = sK3
| ~ spl15_1
| ~ spl15_2 ),
inference(superposition,[],[f711,f195]) ).
fof(f747,plain,
( spl15_17
| ~ spl15_1
| ~ spl15_2 ),
inference(avatar_split_clause,[],[f746,f197,f193,f324]) ).
fof(f799,plain,
( setIn(sK1,alive)
| ~ leq(sK3,sK1) ),
inference(equality_resolution,[],[f469]) ).
fof(f1084,plain,
! [X0] :
( s(host(sK1)) != s(host(sK1))
| ~ elem(m_Down(sK5),queue(host(X0)))
| sP14(X0,sK4) ),
inference(superposition,[],[f472,f191]) ).
fof(f1087,plain,
! [X0] :
( ~ elem(m_Down(sK5),queue(host(X0)))
| sP14(X0,sK4) ),
inference(trivial_inequality_removal,[],[f1084]) ).
fof(f1152,plain,
( ! [X0] :
( host(sK6) != host(sK1)
| host(X0) = host(sK1)
| ~ setIn(X0,alive)
| ~ elem(m_Down(sK7),queue(host(X0)))
| ~ sP14(sK6,X0) )
| ~ spl15_2 ),
inference(superposition,[],[f497,f115]) ).
fof(f1157,plain,
( ! [X0] :
( host(sK6) != host(sK1)
| ~ setIn(X0,alive)
| ~ elem(m_Down(sK7),queue(host(X0)))
| ~ sP14(sK6,X0) )
| ~ spl15_2 ),
inference(forward_subsumption_resolution,[],[f1152,f408]) ).
fof(f1161,plain,
( ! [X0] :
( ~ setIn(X0,alive)
| ~ elem(m_Down(sK7),queue(host(X0)))
| ~ sP14(sK6,X0) )
| ~ spl15_2 ),
inference(forward_subsumption_resolution,[],[f1157,f190]) ).
fof(f1165,plain,
( ! [X0] :
( ~ sP14(sK3,X0)
| ~ setIn(X0,alive)
| ~ elem(m_Down(sK7),queue(host(X0))) )
| ~ spl15_2 ),
inference(forward_demodulation,[],[f1161,f711]) ).
fof(f1168,plain,
( ! [X0] :
( ~ elem(m_Down(sK7),queue(host(X0)))
| ~ setIn(X0,alive)
| ~ sP14(sK1,X0) )
| ~ spl15_2
| ~ spl15_17 ),
inference(forward_demodulation,[],[f1165,f326]) ).
fof(f1655,plain,
( sP14(sK1,sK4)
| ~ elem(m_Down(sK5),sK0) ),
inference(resolution,[],[f1087,f369]) ).
fof(f1664,plain,
sP14(sK1,sK4),
inference(forward_subsumption_resolution,[],[f1655,f123]) ).
fof(f2687,plain,
( ~ elem(m_Down(sK7),queue(s(host(sK1))))
| ~ setIn(sK4,alive)
| ~ sP14(sK1,sK4)
| ~ spl15_2
| ~ spl15_17 ),
inference(superposition,[],[f1168,f111]) ).
fof(f2691,plain,
( ~ setIn(sK4,alive)
| ~ sP14(sK1,sK4)
| ~ spl15_2
| ~ spl15_17 ),
inference(forward_subsumption_resolution,[],[f2687,f389]) ).
fof(f2692,plain,
( ~ sP14(sK1,sK4)
| ~ spl15_2
| ~ spl15_5
| ~ spl15_17 ),
inference(forward_subsumption_resolution,[],[f2691,f213]) ).
fof(f2693,plain,
( $false
| ~ spl15_2
| ~ spl15_5
| ~ spl15_17 ),
inference(forward_subsumption_resolution,[],[f2692,f1664]) ).
fof(f2694,plain,
( ~ spl15_2
| ~ spl15_5
| ~ spl15_17 ),
inference(avatar_contradiction_clause,[],[f2693]) ).
fof(f2695,plain,
( ~ setIn(sK1,alive)
| ~ spl15_1
| spl15_2 ),
inference(forward_demodulation,[],[f198,f195]) ).
fof(f2759,plain,
( $false
| ~ spl15_1
| spl15_2
| ~ spl15_39 ),
inference(forward_subsumption_resolution,[],[f2695,f708]) ).
fof(f2760,plain,
( ~ spl15_1
| spl15_2
| ~ spl15_39 ),
inference(avatar_contradiction_clause,[],[f2759]) ).
fof(f2789,plain,
( ~ leq(sK3,sK1)
| spl15_39 ),
inference(forward_subsumption_resolution,[],[f799,f709]) ).
fof(f2796,plain,
( $false
| spl15_39 ),
inference(forward_subsumption_resolution,[],[f2789,f302]) ).
fof(f2797,plain,
spl15_39,
inference(avatar_contradiction_clause,[],[f2796]) ).
cnf(s1,plain,
( spl15_1
| spl15_2 ),
inference(sat_conversion,[],[f200]) ).
cnf(s3,plain,
( spl15_4
| spl15_5 ),
inference(sat_conversion,[],[f214]) ).
cnf(s5,plain,
~ spl15_4,
inference(sat_conversion,[],[f224]) ).
cnf(s28,plain,
( spl15_1
| ~ spl15_2
| ~ spl15_39 ),
inference(sat_conversion,[],[f710]) ).
cnf(s30,plain,
( ~ spl15_1
| ~ spl15_2
| spl15_17 ),
inference(sat_conversion,[],[f747]) ).
cnf(s101,plain,
( ~ spl15_2
| ~ spl15_5
| ~ spl15_17 ),
inference(sat_conversion,[],[f2694]) ).
cnf(s102,plain,
( ~ spl15_1
| spl15_2
| ~ spl15_39 ),
inference(sat_conversion,[],[f2760]) ).
cnf(s104,plain,
spl15_39,
inference(sat_conversion,[],[f2797]) ).
cnf(s106,plain,
( ~ spl15_1
| spl15_2 ),
inference(rat,[],[s102,s104]) ).
cnf(s116,plain,
( spl15_1
| ~ spl15_2 ),
inference(rat,[],[s28,s104]) ).
cnf(s118,plain,
spl15_5,
inference(rat,[],[s3,s5]) ).
cnf(s119,plain,
spl15_1,
inference(rat,[],[s1,s116]) ).
cnf(s120,plain,
spl15_2,
inference(rat,[],[s106,s119]) ).
cnf(s123,plain,
spl15_17,
inference(rat,[],[s30,s120,s119]) ).
cnf(s124,plain,
$false,
inference(rat,[],[s101,s118,s123,s120]) ).
fof(f2804,plain,
$false,
inference(avatar_sat_refutation,[],[s124]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV451+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.18 % Computer : n018.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Mon Sep 28 11:10:55 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.22 Running first-order theorem proving
% 0.09/0.22 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.10/1.12 % (3304191)Detected formulas, will run a generic FOF schedule.
% 3.10/1.12 % (3304200)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1016565545:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.10/1.12 % (3304202)dis-21_1_sil=8000:lcm=predicate:random_seed=2274998633: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)
% 3.10/1.12 % (3304196)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=3005927:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.10/1.12 % (3304199)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=163341646:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.10/1.12 % (3304197)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=2438183397:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.10/1.12 % (3304198)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=1067628937:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.10/1.12 % (3304201)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3524206032:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.10/1.12 % (3304200)Instruction limit reached!
% 3.10/1.12 % (3304200)------------------------------
% 3.10/1.12 % (3304200)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.10/1.12 % (3304200)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.10/1.12 % (3304200)CaDiCaL version: 2.1.3
% 3.10/1.12 % (3304200)Termination reason: Instruction limit
% 3.10/1.12 % (3304200)Termination phase: Saturation
% 3.10/1.12 % (3304200)Time elapsed: 0.039 s
% 3.10/1.12 % (3304200)Peak memory usage: 88 MB
% 3.10/1.12 % (3304200)Instructions burned: 122 (million)
% 3.10/1.12 % (3304199)First to succeed.
% 3.10/1.12 % (3304199)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3304191"
% 3.10/1.12 % (3304202)Instruction limit reached!
% 3.10/1.12 % (3304202)------------------------------
% 3.10/1.12 % (3304202)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.10/1.12 % (3304202)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.10/1.12 % (3304202)CaDiCaL version: 2.1.3
% 3.10/1.12 % (3304202)Termination reason: Instruction limit
% 3.10/1.12 % (3304202)Termination phase: Saturation
% 3.10/1.12 % (3304202)Time elapsed: 0.062 s
% 3.10/1.12 % (3304202)Peak memory usage: 89 MB
% 3.10/1.12 % (3304202)Instructions burned: 131 (million)
% 3.10/1.12 % (3304210)lrs+10_1_sil=8000:sp=occurrence:random_seed=2397010105:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 3.10/1.12 % (3304201)Instruction limit reached!
% 3.10/1.12 % (3304201)------------------------------
% 3.10/1.12 % (3304201)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.10/1.12 % (3304201)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.10/1.12 % (3304201)CaDiCaL version: 2.1.3
% 3.10/1.12 % (3304201)Termination reason: Instruction limit
% 3.10/1.12 % (3304201)Termination phase: Saturation
% 3.10/1.12 % (3304201)Time elapsed: 0.102 s
% 3.10/1.12 % (3304201)Peak memory usage: 90 MB
% 3.10/1.12 % (3304201)Instructions burned: 139 (million)
% 3.10/1.12 % (3304211)lrs+10_1_sil=32000:urr=on:br=off:random_seed=579919465:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.10/1.12 % (3304210)Instruction limit reached!
% 3.10/1.12 % (3304210)------------------------------
% 3.10/1.12 % (3304210)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.10/1.12 % (3304210)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.10/1.12 % (3304210)CaDiCaL version: 2.1.3
% 3.10/1.12 % (3304210)Termination reason: Instruction limit
% 3.10/1.12 % (3304210)Termination phase: Saturation
% 3.10/1.12 % (3304210)Time elapsed: 0.104 s
% 3.10/1.12 % (3304210)Peak memory usage: 90 MB
% 3.10/1.12 % (3304210)Instructions burned: 288 (million)
% 3.10/1.12 % (3304211)Also succeeded, but the first one will report.
% 3.10/1.12 % (3304213)lrs+1011_1_sil=32000:sp=occurrence:random_seed=4112522207:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 3.10/1.12 % (3304215)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=1760892842:s2a=on:i=248:s2at=1.23:gtg=position_2996 on theBenchmark for (2996ds/248Mi)
% 3.10/1.12 % (3304199)Refutation found. Thanks to Tanya!
% 3.10/1.12 % SZS status Theorem for theBenchmark
% 3.10/1.12 % SZS output start Proof for theBenchmark
% See solution above
% 3.85/1.21 % (3304199)------------------------------
% 3.85/1.21 % (3304199)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.85/1.21 % (3304199)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.85/1.21 % (3304199)CaDiCaL version: 2.1.3
% 3.85/1.21 % (3304199)Termination reason: Refutation
% 3.85/1.21 % (3304199)Time elapsed: 0.059 s
% 3.85/1.21 % (3304199)Peak memory usage: 90 MB
% 3.85/1.21 % (3304199)Instructions burned: 91 (million)
% 3.85/1.21 % (3304199)------------------------------
% 3.85/1.21 % (3304199)------------------------------
% 3.85/1.21 % (3304191)Success in time 0.465 s
% 3.85/1.21 % Vampire exiting
%------------------------------------------------------------------------------