%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWV454+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 : n006.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:51 PM UTC 2026
% Result : Theorem 3.07s 1.08s
% Output : Refutation 3.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 2
% Syntax : Number of formulae : 32 ( 13 unt; 0 def)
% Number of atoms : 407 ( 177 equ)
% Maximal formula atoms : 49 ( 12 avg)
% Number of connectives : 608 ( 233 ~; 131 |; 183 &)
% ( 1 <=>; 60 =>; 0 <=; 0 <~>)
% Maximal formula depth : 34 ( 10 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 25 ( 25 usr; 17 con; 0-2 aty)
% Number of variables : 211 ( 190 !; 21 ?)
% Comments :
%------------------------------------------------------------------------------
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(f67,conjecture,
! [X0,X1,X2,X3] :
( ( ! [X4,X5] :
( setIn(X5,alive)
=> ~ elem(m_Down(X5),queue(host(X4))) )
& ! [X4,X5] :
( elem(m_Down(X5),queue(host(X4)))
=> ~ setIn(X5,alive) )
& ! [X4,X5] :
( elem(m_Down(X5),queue(host(X4)))
=> host(X5) != host(X4) )
& ! [X4,X5] :
( elem(m_Halt(X5),queue(host(X4)))
=> ~ leq(host(X4),host(X5)) )
& ! [X4,X6,X5] :
( elem(m_Ack(X5,X4),queue(host(X6)))
=> ~ leq(host(X4),host(X5)) )
& ! [X4,X5] :
( ( ~ setIn(X4,alive)
& leq(X5,X4)
& host(X5) = host(X4) )
=> ~ setIn(X5,alive) )
& ! [X4,X5] :
( ( X5 != X4
& host(X5) = host(X4) )
=> ( ~ setIn(X4,alive)
| ~ setIn(X5,alive) ) )
& ! [X4,X7,X6,X5] :
( ( host(X6) != host(X4)
& setIn(X4,alive)
& setIn(X6,alive)
& host(X7) = host(X4)
& host(X5) = host(X6) )
=> ~ ( elem(m_Down(X5),queue(host(X4)))
& elem(m_Down(X7),queue(host(X6))) ) )
& queue(host(X2)) = cons(m_Down(X3),X0) )
=> ( setIn(X2,alive)
=> ( ~ leq(host(X2),host(X3))
=> ( ~ ( ( index(ldr,host(X2)) = host(X3)
& index(status,host(X2)) = norm )
| ( index(status,host(X2)) = wait
& host(X3) = host(index(elid,host(X2))) ) )
=> ( ( ! [X4] :
( ( ~ leq(host(X2),X4)
& leq(s(zero),X4) )
=> ( setIn(X4,index(down,host(X2)))
| X4 = host(X3) ) )
& index(status,host(X2)) = elec_1 )
=> ( ~ leq(nbr_proc,host(X2))
=> ! [X4] :
( s(host(X2)) != host(X4)
=> ( host(X2) = host(X4)
=> ! [X8,X9] :
( s(host(X2)) != host(X9)
=> ( host(X2) != host(X9)
=> ! [X10] :
( ( host(X9) != host(X4)
& setIn(X4,alive)
& setIn(X9,alive)
& host(X8) = host(X4)
& host(X10) = host(X9) )
=> ~ ( elem(m_Down(X10),X0)
& elem(m_Down(X8),queue(host(X9))) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
fof(f68,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( ! [X4,X5] :
( setIn(X5,alive)
=> ~ elem(m_Down(X5),queue(host(X4))) )
& ! [X4,X5] :
( elem(m_Down(X5),queue(host(X4)))
=> ~ setIn(X5,alive) )
& ! [X4,X5] :
( elem(m_Down(X5),queue(host(X4)))
=> host(X5) != host(X4) )
& ! [X4,X5] :
( elem(m_Halt(X5),queue(host(X4)))
=> ~ leq(host(X4),host(X5)) )
& ! [X4,X6,X5] :
( elem(m_Ack(X5,X4),queue(host(X6)))
=> ~ leq(host(X4),host(X5)) )
& ! [X4,X5] :
( ( ~ setIn(X4,alive)
& leq(X5,X4)
& host(X5) = host(X4) )
=> ~ setIn(X5,alive) )
& ! [X4,X5] :
( ( X5 != X4
& host(X5) = host(X4) )
=> ( ~ setIn(X4,alive)
| ~ setIn(X5,alive) ) )
& ! [X4,X7,X6,X5] :
( ( host(X6) != host(X4)
& setIn(X4,alive)
& setIn(X6,alive)
& host(X7) = host(X4)
& host(X5) = host(X6) )
=> ~ ( elem(m_Down(X5),queue(host(X4)))
& elem(m_Down(X7),queue(host(X6))) ) )
& queue(host(X2)) = cons(m_Down(X3),X0) )
=> ( setIn(X2,alive)
=> ( ~ leq(host(X2),host(X3))
=> ( ~ ( ( index(ldr,host(X2)) = host(X3)
& index(status,host(X2)) = norm )
| ( index(status,host(X2)) = wait
& host(X3) = host(index(elid,host(X2))) ) )
=> ( ( ! [X4] :
( ( ~ leq(host(X2),X4)
& leq(s(zero),X4) )
=> ( setIn(X4,index(down,host(X2)))
| X4 = host(X3) ) )
& index(status,host(X2)) = elec_1 )
=> ( ~ leq(nbr_proc,host(X2))
=> ! [X4] :
( s(host(X2)) != host(X4)
=> ( host(X2) = host(X4)
=> ! [X8,X9] :
( s(host(X2)) != host(X9)
=> ( host(X2) != host(X9)
=> ! [X10] :
( ( host(X9) != host(X4)
& setIn(X4,alive)
& setIn(X9,alive)
& host(X8) = host(X4)
& host(X10) = host(X9) )
=> ~ ( elem(m_Down(X10),X0)
& elem(m_Down(X8),queue(host(X9))) ) ) ) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f67]) ).
fof(f69,plain,
~ ! [X0,X2,X3] :
( ( ! [X4,X5] :
( setIn(X5,alive)
=> ~ elem(m_Down(X5),queue(host(X4))) )
& ! [X6,X7] :
( elem(m_Down(X7),queue(host(X6)))
=> ~ setIn(X7,alive) )
& ! [X8,X9] :
( elem(m_Down(X9),queue(host(X8)))
=> host(X9) != host(X8) )
& ! [X10,X11] :
( elem(m_Halt(X11),queue(host(X10)))
=> ~ leq(host(X10),host(X11)) )
& ! [X12,X13,X14] :
( elem(m_Ack(X14,X12),queue(host(X13)))
=> ~ leq(host(X12),host(X14)) )
& ! [X15,X16] :
( ( ~ setIn(X15,alive)
& leq(X16,X15)
& host(X15) = host(X16) )
=> ~ setIn(X16,alive) )
& ! [X17,X18] :
( ( X17 != X18
& host(X17) = host(X18) )
=> ( ~ setIn(X17,alive)
| ~ setIn(X18,alive) ) )
& ! [X19,X20,X21,X22] :
( ( host(X19) != host(X21)
& setIn(X19,alive)
& setIn(X21,alive)
& host(X19) = host(X20)
& host(X21) = host(X22) )
=> ~ ( elem(m_Down(X22),queue(host(X19)))
& elem(m_Down(X20),queue(host(X21))) ) )
& queue(host(X2)) = cons(m_Down(X3),X0) )
=> ( setIn(X2,alive)
=> ( ~ leq(host(X2),host(X3))
=> ( ~ ( ( index(ldr,host(X2)) = host(X3)
& index(status,host(X2)) = norm )
| ( index(status,host(X2)) = wait
& host(X3) = host(index(elid,host(X2))) ) )
=> ( ( ! [X23] :
( ( ~ leq(host(X2),X23)
& leq(s(zero),X23) )
=> ( setIn(X23,index(down,host(X2)))
| host(X3) = X23 ) )
& index(status,host(X2)) = elec_1 )
=> ( ~ leq(nbr_proc,host(X2))
=> ! [X24] :
( s(host(X2)) != host(X24)
=> ( host(X2) = host(X24)
=> ! [X25,X26] :
( s(host(X2)) != host(X26)
=> ( host(X2) != host(X26)
=> ! [X27] :
( ( host(X24) != host(X26)
& setIn(X24,alive)
& setIn(X26,alive)
& host(X24) = host(X25)
& host(X26) = host(X27) )
=> ~ ( elem(m_Down(X27),X0)
& elem(m_Down(X25),queue(host(X26))) ) ) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f68]) ).
fof(f85,plain,
? [X0,X2,X3] :
( ? [X24] :
( ? [X25,X26] :
( ? [X27] :
( elem(m_Down(X27),X0)
& 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) )
& host(X2) != host(X26)
& s(host(X2)) != host(X26) )
& host(X2) = host(X24)
& s(host(X2)) != host(X24) )
& ~ leq(nbr_proc,host(X2))
& ! [X23] :
( setIn(X23,index(down,host(X2)))
| host(X3) = X23
| leq(host(X2),X23)
| ~ leq(s(zero),X23) )
& index(status,host(X2)) = elec_1
& ( host(X3) != index(ldr,host(X2))
| norm != index(status,host(X2)) )
& ( wait != index(status,host(X2))
| host(X3) != host(index(elid,host(X2))) )
& ~ leq(host(X2),host(X3))
& setIn(X2,alive)
& ! [X4,X5] :
( ~ elem(m_Down(X5),queue(host(X4)))
| ~ setIn(X5,alive) )
& ! [X6,X7] :
( ~ setIn(X7,alive)
| ~ elem(m_Down(X7),queue(host(X6))) )
& ! [X8,X9] :
( host(X9) != host(X8)
| ~ elem(m_Down(X9),queue(host(X8))) )
& ! [X10,X11] :
( ~ leq(host(X10),host(X11))
| ~ elem(m_Halt(X11),queue(host(X10))) )
& ! [X12,X13,X14] :
( ~ leq(host(X12),host(X14))
| ~ elem(m_Ack(X14,X12),queue(host(X13))) )
& ! [X15,X16] :
( ~ setIn(X16,alive)
| setIn(X15,alive)
| ~ leq(X16,X15)
| host(X15) != host(X16) )
& ! [X17,X18] :
( ~ setIn(X17,alive)
| ~ setIn(X18,alive)
| X17 = X18
| host(X17) != host(X18) )
& ! [X19,X20,X21,X22] :
( ~ elem(m_Down(X22),queue(host(X19)))
| ~ elem(m_Down(X20),queue(host(X21)))
| host(X19) = host(X21)
| ~ setIn(X19,alive)
| ~ setIn(X21,alive)
| host(X19) != host(X20)
| host(X21) != host(X22) )
& queue(host(X2)) = cons(m_Down(X3),X0) ),
inference(ennf_transformation,[],[f69]) ).
fof(f86,plain,
? [X0,X2,X3] :
( ? [X24] :
( ? [X25,X26] :
( ? [X27] :
( elem(m_Down(X27),X0)
& 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) )
& host(X2) != host(X26)
& s(host(X2)) != host(X26) )
& host(X2) = host(X24)
& s(host(X2)) != host(X24) )
& ~ leq(nbr_proc,host(X2))
& ! [X23] :
( setIn(X23,index(down,host(X2)))
| host(X3) = X23
| leq(host(X2),X23)
| ~ leq(s(zero),X23) )
& index(status,host(X2)) = elec_1
& ( host(X3) != index(ldr,host(X2))
| norm != index(status,host(X2)) )
& ( wait != index(status,host(X2))
| host(X3) != host(index(elid,host(X2))) )
& ~ leq(host(X2),host(X3))
& setIn(X2,alive)
& ! [X4,X5] :
( ~ elem(m_Down(X5),queue(host(X4)))
| ~ setIn(X5,alive) )
& ! [X6,X7] :
( ~ setIn(X7,alive)
| ~ elem(m_Down(X7),queue(host(X6))) )
& ! [X8,X9] :
( host(X9) != host(X8)
| ~ elem(m_Down(X9),queue(host(X8))) )
& ! [X10,X11] :
( ~ leq(host(X10),host(X11))
| ~ elem(m_Halt(X11),queue(host(X10))) )
& ! [X12,X13,X14] :
( ~ leq(host(X12),host(X14))
| ~ elem(m_Ack(X14,X12),queue(host(X13))) )
& ! [X15,X16] :
( ~ setIn(X16,alive)
| setIn(X15,alive)
| ~ leq(X16,X15)
| host(X15) != host(X16) )
& ! [X17,X18] :
( ~ setIn(X17,alive)
| ~ setIn(X18,alive)
| X17 = X18
| host(X17) != host(X18) )
& ! [X19,X20,X21,X22] :
( ~ elem(m_Down(X22),queue(host(X19)))
| ~ elem(m_Down(X20),queue(host(X21)))
| host(X19) = host(X21)
| ~ setIn(X19,alive)
| ~ setIn(X21,alive)
| host(X19) != host(X20)
| host(X21) != host(X22) )
& queue(host(X2)) = cons(m_Down(X3),X0) ),
inference(flattening,[],[f85]) ).
fof(f92,plain,
! [X0,X1,X2] :
( ( elem(X0,cons(X1,X2))
| ( X0 != X1
& ~ elem(X0,X2) ) )
& ( X0 = X1
| elem(X0,X2)
| ~ elem(X0,cons(X1,X2)) ) ),
inference(nnf_transformation,[],[f47]) ).
fof(f93,plain,
! [X0,X1,X2] :
( ( elem(X0,cons(X1,X2))
| ( X0 != X1
& ~ elem(X0,X2) ) )
& ( X0 = X1
| elem(X0,X2)
| ~ elem(X0,cons(X1,X2)) ) ),
inference(flattening,[],[f92]) ).
fof(f112,plain,
? [X0,X1,X2] :
( ? [X3] :
( ? [X4,X5] :
( ? [X6] :
( elem(m_Down(X6),X0)
& elem(m_Down(X4),queue(host(X5)))
& host(X5) != host(X3)
& setIn(X3,alive)
& setIn(X5,alive)
& host(X4) = host(X3)
& host(X5) = host(X6) )
& host(X1) != host(X5)
& host(X5) != s(host(X1)) )
& host(X1) = host(X3)
& host(X3) != s(host(X1)) )
& ~ leq(nbr_proc,host(X1))
& ! [X7] :
( setIn(X7,index(down,host(X1)))
| host(X2) = X7
| leq(host(X1),X7)
| ~ leq(s(zero),X7) )
& elec_1 = index(status,host(X1))
& ( host(X2) != index(ldr,host(X1))
| norm != index(status,host(X1)) )
& ( wait != index(status,host(X1))
| host(X2) != host(index(elid,host(X1))) )
& ~ leq(host(X1),host(X2))
& setIn(X1,alive)
& ! [X8,X9] :
( ~ elem(m_Down(X9),queue(host(X8)))
| ~ setIn(X9,alive) )
& ! [X10,X11] :
( ~ setIn(X11,alive)
| ~ elem(m_Down(X11),queue(host(X10))) )
& ! [X12,X13] :
( host(X13) != host(X12)
| ~ elem(m_Down(X13),queue(host(X12))) )
& ! [X14,X15] :
( ~ leq(host(X14),host(X15))
| ~ elem(m_Halt(X15),queue(host(X14))) )
& ! [X16,X17,X18] :
( ~ leq(host(X16),host(X18))
| ~ elem(m_Ack(X18,X16),queue(host(X17))) )
& ! [X19,X20] :
( ~ setIn(X20,alive)
| setIn(X19,alive)
| ~ leq(X20,X19)
| host(X19) != host(X20) )
& ! [X21,X22] :
( ~ setIn(X21,alive)
| ~ setIn(X22,alive)
| X21 = X22
| host(X21) != host(X22) )
& ! [X23,X24,X25,X26] :
( ~ elem(m_Down(X26),queue(host(X23)))
| ~ elem(m_Down(X24),queue(host(X25)))
| host(X25) = host(X23)
| ~ setIn(X23,alive)
| ~ setIn(X25,alive)
| host(X24) != host(X23)
| host(X26) != host(X25) )
& queue(host(X1)) = cons(m_Down(X2),X0) ),
inference(rectify,[],[f86]) ).
fof(f113,plain,
( elem(m_Down(sK9),sK3)
& elem(m_Down(sK7),queue(host(sK8)))
& host(sK8) != host(sK6)
& setIn(sK6,alive)
& setIn(sK8,alive)
& host(sK6) = host(sK7)
& host(sK8) = host(sK9)
& host(sK8) != host(sK4)
& host(sK8) != s(host(sK4))
& host(sK6) = host(sK4)
& host(sK6) != s(host(sK4))
& ~ leq(nbr_proc,host(sK4))
& ! [X7] :
( setIn(X7,index(down,host(sK4)))
| host(sK5) = X7
| leq(host(sK4),X7)
| ~ leq(s(zero),X7) )
& elec_1 = index(status,host(sK4))
& ( host(sK5) != index(ldr,host(sK4))
| norm != index(status,host(sK4)) )
& ( wait != index(status,host(sK4))
| host(sK5) != host(index(elid,host(sK4))) )
& ~ leq(host(sK4),host(sK5))
& setIn(sK4,alive)
& ! [X8,X9] :
( ~ elem(m_Down(X9),queue(host(X8)))
| ~ setIn(X9,alive) )
& ! [X10,X11] :
( ~ setIn(X11,alive)
| ~ elem(m_Down(X11),queue(host(X10))) )
& ! [X12,X13] :
( host(X13) != host(X12)
| ~ elem(m_Down(X13),queue(host(X12))) )
& ! [X14,X15] :
( ~ leq(host(X14),host(X15))
| ~ elem(m_Halt(X15),queue(host(X14))) )
& ! [X16,X17,X18] :
( ~ leq(host(X16),host(X18))
| ~ elem(m_Ack(X18,X16),queue(host(X17))) )
& ! [X19,X20] :
( ~ setIn(X20,alive)
| setIn(X19,alive)
| ~ leq(X20,X19)
| host(X19) != host(X20) )
& ! [X21,X22] :
( ~ setIn(X21,alive)
| ~ setIn(X22,alive)
| X21 = X22
| host(X21) != host(X22) )
& ! [X23,X24,X25,X26] :
( ~ elem(m_Down(X26),queue(host(X23)))
| ~ elem(m_Down(X24),queue(host(X25)))
| host(X25) = host(X23)
| ~ setIn(X23,alive)
| ~ setIn(X25,alive)
| host(X24) != host(X23)
| host(X26) != host(X25) )
& queue(host(sK4)) = cons(m_Down(sK5),sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6,sK7,sK8,sK9]),skolemize(X0,sK3),skolemize(X1,sK4),skolemize(X2,sK5),skolemize(X3,sK6),skolemize(X4,sK7),skolemize(X5,sK8),skolemize(X6,sK9)],[f112]) ).
fof(f167,plain,
! [X2,X0,X1] :
( elem(X0,cons(X1,X2))
| ~ elem(X0,X2) ),
inference(cnf_transformation,[],[f93]) ).
fof(f210,plain,
queue(host(sK4)) = cons(m_Down(sK5),sK3),
inference(cnf_transformation,[],[f113]) ).
fof(f211,plain,
! [X26,X24,X25,X23] :
( ~ setIn(X23,alive)
| ~ elem(m_Down(X24),queue(host(X25)))
| host(X25) = host(X23)
| ~ elem(m_Down(X26),queue(host(X23)))
| ~ setIn(X25,alive)
| host(X24) != host(X23)
| host(X26) != host(X25) ),
inference(cnf_transformation,[],[f113]) ).
fof(f219,plain,
setIn(sK4,alive),
inference(cnf_transformation,[],[f113]) ).
fof(f227,plain,
host(sK6) = host(sK4),
inference(cnf_transformation,[],[f113]) ).
fof(f229,plain,
host(sK8) != host(sK4),
inference(cnf_transformation,[],[f113]) ).
fof(f230,plain,
host(sK8) = host(sK9),
inference(cnf_transformation,[],[f113]) ).
fof(f231,plain,
host(sK6) = host(sK7),
inference(cnf_transformation,[],[f113]) ).
fof(f232,plain,
setIn(sK8,alive),
inference(cnf_transformation,[],[f113]) ).
fof(f235,plain,
elem(m_Down(sK7),queue(host(sK8))),
inference(cnf_transformation,[],[f113]) ).
fof(f236,plain,
elem(m_Down(sK9),sK3),
inference(cnf_transformation,[],[f113]) ).
fof(f268,plain,
host(sK7) = host(sK4),
inference(forward_demodulation,[],[f231,f227]) ).
fof(f306,plain,
! [X2,X0,X1] :
( ~ elem(m_Down(X2),queue(host(sK8)))
| host(X1) = host(sK8)
| ~ elem(m_Down(X0),queue(host(X1)))
| ~ setIn(X1,alive)
| host(X0) != host(sK8)
| host(X1) != host(X2) ),
inference(resolution,[],[f211,f232]) ).
fof(f320,plain,
! [X0,X1] :
( host(X0) = host(sK8)
| ~ elem(m_Down(X1),queue(host(X0)))
| ~ setIn(X0,alive)
| host(X1) != host(sK8)
| host(X0) != host(sK7) ),
inference(resolution,[],[f306,f235]) ).
fof(f323,plain,
! [X0,X1] :
( ~ setIn(X0,alive)
| host(X0) = host(sK8)
| ~ elem(m_Down(X1),queue(host(X0)))
| host(X0) != host(sK4)
| host(X1) != host(sK8) ),
inference(forward_demodulation,[],[f320,f268]) ).
fof(f324,plain,
! [X0] :
( host(sK8) = host(sK4)
| ~ elem(m_Down(X0),queue(host(sK4)))
| host(sK4) != host(sK4)
| host(X0) != host(sK8) ),
inference(resolution,[],[f323,f219]) ).
fof(f327,plain,
! [X0] :
( host(sK8) = host(sK4)
| ~ elem(m_Down(X0),queue(host(sK4)))
| host(X0) != host(sK8) ),
inference(trivial_inequality_removal,[],[f324]) ).
fof(f329,plain,
! [X0] :
( ~ elem(m_Down(X0),queue(host(sK4)))
| host(X0) != host(sK8) ),
inference(forward_subsumption_resolution,[],[f327,f229]) ).
fof(f526,plain,
! [X0] :
( ~ elem(X0,sK3)
| elem(X0,queue(host(sK4))) ),
inference(superposition,[],[f167,f210]) ).
fof(f527,plain,
elem(m_Down(sK9),queue(host(sK4))),
inference(resolution,[],[f526,f236]) ).
fof(f529,plain,
host(sK8) != host(sK9),
inference(resolution,[],[f527,f329]) ).
fof(f534,plain,
$false,
inference(forward_subsumption_resolution,[],[f529,f230]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV454+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.18 % Computer : n006.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Mon Sep 28 11:08:55 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running first-order theorem proving
% 0.08/0.22 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
% 3.07/1.08 % (3891620)Detected formulas, will run a generic FOF schedule.
% 3.07/1.08 % (3891627)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=2531630505:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.07/1.08 % (3891630)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1330352548:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.07/1.08 % (3891625)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=2374064433:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.07/1.08 % (3891629)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2142746455:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.07/1.08 % (3891631)dis-21_1_sil=8000:lcm=predicate:random_seed=1109598507: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.07/1.08 % (3891628)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2431832688:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.07/1.08 % (3891626)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=1246933214:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.07/1.08 % (3891630)First to succeed.
% 3.07/1.08 % (3891629)Also succeeded, but the first one will report.
% 3.07/1.08 % (3891630)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3891620"
% 3.07/1.08 % (3891628)Also succeeded, but the first one will report.
% 3.07/1.08 % (3891631)Instruction limit reached!
% 3.07/1.08 % (3891631)------------------------------
% 3.07/1.08 % (3891631)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.07/1.08 % (3891631)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.07/1.08 % (3891631)CaDiCaL version: 2.1.3
% 3.07/1.08 % (3891631)Termination reason: Instruction limit
% 3.07/1.08 % (3891631)Termination phase: Saturation
% 3.07/1.08 % (3891631)Time elapsed: 0.060 s
% 3.07/1.08 % (3891631)Peak memory usage: 90 MB
% 3.07/1.08 % (3891631)Instructions burned: 129 (million)
% 3.07/1.08 % (3891639)lrs+10_1_sil=8000:sp=occurrence:random_seed=825879710:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.07/1.08 % (3891639)Also succeeded, but the first one will report.
% 3.07/1.08 % (3891630)Refutation found. Thanks to Tanya!
% 3.07/1.08 % SZS status Theorem for theBenchmark
% 3.07/1.08 % SZS output start Proof for theBenchmark
% See solution above
% 3.50/1.17 % (3891630)------------------------------
% 3.50/1.17 % (3891630)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.50/1.17 % (3891630)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.50/1.17 % (3891630)CaDiCaL version: 2.1.3
% 3.50/1.17 % (3891630)Termination reason: Refutation
% 3.50/1.17 % (3891630)Time elapsed: 0.014 s
% 3.50/1.17 % (3891630)Peak memory usage: 89 MB
% 3.50/1.17 % (3891630)Instructions burned: 20 (million)
% 3.50/1.17 % (3891630)------------------------------
% 3.50/1.17 % (3891630)------------------------------
% 3.50/1.17 % (3891620)Success in time 0.42 s
% 3.50/1.17 % Vampire exiting
%------------------------------------------------------------------------------