%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV472+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n008.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:22 PM UTC 2026
% Result : Theorem 7.65s 1.41s
% Output : Refutation 7.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 9
% Syntax : Number of formulae : 82 ( 21 unt; 5 def)
% Number of atoms : 594 ( 250 equ)
% Maximal formula atoms : 70 ( 7 avg)
% Number of connectives : 843 ( 331 ~; 250 |; 192 &)
% ( 7 <=>; 63 =>; 0 <=; 0 <~>)
% Maximal formula depth : 38 ( 7 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 10 ( 8 usr; 6 prp; 0-2 aty)
% Number of functors : 31 ( 31 usr; 19 con; 0-2 aty)
% Number of variables : 274 ( 0 sgn 256 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f18,axiom,
! [X0,X1] : m_Down(X0) != m_Halt(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_17) ).
fof(f47,axiom,
! [X0,X1,X2] :
( elem(X0,cons(X1,X2))
<=> ( X0 = X1
| elem(X0,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_46) ).
fof(f48,axiom,
! [X0,X1,X2] :
( elem(X0,snoc(X2,X1))
<=> ( X0 = X1
| elem(X0,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_47) ).
fof(f67,conjecture,
! [X0,X1,X2,X3] :
( ( ! [X4,X5] :
( elem(m_Ldr(X5),queue(host(X4)))
=> ~ leq(host(X4),host(X5)) )
& ! [X4,X5] :
( elem(m_Down(X5),queue(host(X4)))
=> host(X5) != host(X4) )
& ! [X4,X5] :
( host(X5) = nbr_proc
=> ~ elem(m_NotNorm(X4),queue(host(X5))) )
& ! [X4,X5] :
( ( X5 != X4
& host(X5) = host(X4) )
=> ( ~ setIn(X4,alive)
| ~ setIn(X5,alive) ) )
& ! [X4] :
( ( ( index(status,host(X4)) = elec_1
| index(status,host(X4)) = elec_2 )
& setIn(X4,alive) )
=> index(elid,host(X4)) = X4 )
& ! [X4,X6,X5] :
( ( host(X5) != host(X6)
& setIn(X5,alive)
& host(X5) = host(X4)
& index(status,host(X5)) = norm
& index(ldr,host(X5)) = host(X6) )
=> ~ elem(m_Down(X4),queue(host(X6))) )
& ! [X4,X6,X5] :
( ( host(X5) != host(X6)
& setIn(X5,alive)
& host(X5) = host(X4)
& index(status,host(X5)) = wait
& host(index(elid,host(X5))) = host(X6) )
=> ~ elem(m_Down(X4),queue(host(X6))) )
& ! [X4,X7,X6,X5] :
( ( host(X6) != host(X4)
& setIn(X4,alive)
& setIn(X6,alive)
& host(X7) = host(X4)
& host(X5) = host(X6) )
=> ~ ( elem(m_Down(X5),queue(host(X4)))
& elem(m_Down(X7),queue(host(X6))) ) )
& ! [X4,X7,X6,X5] :
( ( host(X6) != host(X4)
& setIn(X4,alive)
& setIn(X6,alive)
& host(X7) = host(X4)
& host(X5) = host(X6) )
=> ~ ( elem(m_Down(X5),queue(host(X4)))
& setIn(host(X7),index(down,host(X6))) ) )
& ! [X4,X7,X6,X5] :
( ( ! [X8] :
( ( ~ leq(host(X5),X8)
& leq(s(zero),X8) )
=> ( setIn(X8,index(down,host(X5)))
| X8 = host(X6) ) )
& elem(m_Down(X6),queue(host(X5)))
& host(X5) = nbr_proc
& host(X5) = host(X7)
& index(status,host(X5)) = elec_1 )
=> ~ ( setIn(X4,alive)
& elem(m_Down(X7),queue(host(X4))) ) )
& queue(host(X2)) = cons(m_Ack(X1,X3),X0) )
=> ( setIn(X2,alive)
=> ( ( index(elid,host(X2)) = X1
& index(status,host(X2)) = elec_2
& host(X3) = index(pendack,host(X2)) )
=> ( ~ leq(nbr_proc,index(pendack,host(X2)))
=> ! [X4] :
( s(index(pendack,host(X2))) = host(X4)
=> ( host(X2) = host(X4)
=> ! [X9,X10,X11] :
( s(index(pendack,host(X2))) != host(X11)
=> ( host(X2) != host(X11)
=> ( ( ! [X8] :
( ( ~ leq(host(X11),X8)
& leq(s(zero),X8) )
=> ( setIn(X8,index(down,host(X11)))
| X8 = host(X10) ) )
& elem(m_Down(X10),queue(host(X11)))
& host(X11) = host(X9)
& host(X11) = nbr_proc
& index(status,host(X11)) = elec_1 )
=> ~ ( setIn(X4,alive)
& elem(m_Down(X9),snoc(X0,m_Halt(X2))) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
fof(f68,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( ! [X4,X5] :
( elem(m_Ldr(X5),queue(host(X4)))
=> ~ leq(host(X4),host(X5)) )
& ! [X4,X5] :
( elem(m_Down(X5),queue(host(X4)))
=> host(X5) != host(X4) )
& ! [X4,X5] :
( host(X5) = nbr_proc
=> ~ elem(m_NotNorm(X4),queue(host(X5))) )
& ! [X4,X5] :
( ( X5 != X4
& host(X5) = host(X4) )
=> ( ~ setIn(X4,alive)
| ~ setIn(X5,alive) ) )
& ! [X4] :
( ( ( index(status,host(X4)) = elec_1
| index(status,host(X4)) = elec_2 )
& setIn(X4,alive) )
=> index(elid,host(X4)) = X4 )
& ! [X4,X6,X5] :
( ( host(X5) != host(X6)
& setIn(X5,alive)
& host(X5) = host(X4)
& index(status,host(X5)) = norm
& index(ldr,host(X5)) = host(X6) )
=> ~ elem(m_Down(X4),queue(host(X6))) )
& ! [X4,X6,X5] :
( ( host(X5) != host(X6)
& setIn(X5,alive)
& host(X5) = host(X4)
& index(status,host(X5)) = wait
& host(index(elid,host(X5))) = host(X6) )
=> ~ elem(m_Down(X4),queue(host(X6))) )
& ! [X4,X7,X6,X5] :
( ( host(X6) != host(X4)
& setIn(X4,alive)
& setIn(X6,alive)
& host(X7) = host(X4)
& host(X5) = host(X6) )
=> ~ ( elem(m_Down(X5),queue(host(X4)))
& elem(m_Down(X7),queue(host(X6))) ) )
& ! [X4,X7,X6,X5] :
( ( host(X6) != host(X4)
& setIn(X4,alive)
& setIn(X6,alive)
& host(X7) = host(X4)
& host(X5) = host(X6) )
=> ~ ( elem(m_Down(X5),queue(host(X4)))
& setIn(host(X7),index(down,host(X6))) ) )
& ! [X4,X7,X6,X5] :
( ( ! [X8] :
( ( ~ leq(host(X5),X8)
& leq(s(zero),X8) )
=> ( setIn(X8,index(down,host(X5)))
| X8 = host(X6) ) )
& elem(m_Down(X6),queue(host(X5)))
& host(X5) = nbr_proc
& host(X5) = host(X7)
& index(status,host(X5)) = elec_1 )
=> ~ ( setIn(X4,alive)
& elem(m_Down(X7),queue(host(X4))) ) )
& queue(host(X2)) = cons(m_Ack(X1,X3),X0) )
=> ( setIn(X2,alive)
=> ( ( index(elid,host(X2)) = X1
& index(status,host(X2)) = elec_2
& host(X3) = index(pendack,host(X2)) )
=> ( ~ leq(nbr_proc,index(pendack,host(X2)))
=> ! [X4] :
( s(index(pendack,host(X2))) = host(X4)
=> ( host(X2) = host(X4)
=> ! [X9,X10,X11] :
( s(index(pendack,host(X2))) != host(X11)
=> ( host(X2) != host(X11)
=> ( ( ! [X8] :
( ( ~ leq(host(X11),X8)
& leq(s(zero),X8) )
=> ( setIn(X8,index(down,host(X11)))
| X8 = host(X10) ) )
& elem(m_Down(X10),queue(host(X11)))
& host(X11) = host(X9)
& host(X11) = nbr_proc
& index(status,host(X11)) = elec_1 )
=> ~ ( setIn(X4,alive)
& elem(m_Down(X9),snoc(X0,m_Halt(X2))) ) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f67]) ).
fof(f69,plain,
~ ! [X0,X1,X2,X3] :
( ( ! [X4,X5] :
( elem(m_Ldr(X5),queue(host(X4)))
=> ~ leq(host(X4),host(X5)) )
& ! [X6,X7] :
( elem(m_Down(X7),queue(host(X6)))
=> host(X6) != host(X7) )
& ! [X8,X9] :
( nbr_proc = host(X9)
=> ~ elem(m_NotNorm(X8),queue(host(X9))) )
& ! [X10,X11] :
( ( X10 != X11
& host(X11) = host(X10) )
=> ( ~ setIn(X10,alive)
| ~ setIn(X11,alive) ) )
& ! [X12] :
( ( ( elec_1 = index(status,host(X12))
| elec_2 = index(status,host(X12)) )
& setIn(X12,alive) )
=> index(elid,host(X12)) = X12 )
& ! [X13,X14,X15] :
( ( host(X15) != host(X14)
& setIn(X15,alive)
& host(X15) = host(X13)
& norm = index(status,host(X15))
& host(X14) = index(ldr,host(X15)) )
=> ~ elem(m_Down(X13),queue(host(X14))) )
& ! [X16,X17,X18] :
( ( host(X18) != host(X17)
& setIn(X18,alive)
& host(X18) = host(X16)
& wait = index(status,host(X18))
& host(X17) = host(index(elid,host(X18))) )
=> ~ elem(m_Down(X16),queue(host(X17))) )
& ! [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))) ) )
& ! [X23,X24,X25,X26] :
( ( host(X23) != host(X25)
& setIn(X23,alive)
& setIn(X25,alive)
& host(X23) = host(X24)
& host(X25) = host(X26) )
=> ~ ( elem(m_Down(X26),queue(host(X23)))
& setIn(host(X24),index(down,host(X25))) ) )
& ! [X27,X28,X29,X30] :
( ( ! [X31] :
( ( ~ leq(host(X30),X31)
& leq(s(zero),X31) )
=> ( setIn(X31,index(down,host(X30)))
| host(X29) = X31 ) )
& elem(m_Down(X29),queue(host(X30)))
& nbr_proc = host(X30)
& host(X30) = host(X28)
& elec_1 = index(status,host(X30)) )
=> ~ ( setIn(X27,alive)
& elem(m_Down(X28),queue(host(X27))) ) )
& queue(host(X2)) = cons(m_Ack(X1,X3),X0) )
=> ( setIn(X2,alive)
=> ( ( index(elid,host(X2)) = X1
& index(status,host(X2)) = elec_2
& host(X3) = index(pendack,host(X2)) )
=> ( ~ leq(nbr_proc,index(pendack,host(X2)))
=> ! [X32] :
( s(index(pendack,host(X2))) = host(X32)
=> ( host(X2) = host(X32)
=> ! [X33,X34,X35] :
( s(index(pendack,host(X2))) != host(X35)
=> ( host(X2) != host(X35)
=> ( ( ! [X36] :
( ( ~ leq(host(X35),X36)
& leq(s(zero),X36) )
=> ( setIn(X36,index(down,host(X35)))
| host(X34) = X36 ) )
& elem(m_Down(X34),queue(host(X35)))
& host(X35) = host(X33)
& nbr_proc = host(X35)
& elec_1 = index(status,host(X35)) )
=> ~ ( setIn(X32,alive)
& elem(m_Down(X33),snoc(X0,m_Halt(X2))) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f68]) ).
fof(f85,plain,
? [X0,X1,X2,X3] :
( ? [X32] :
( ? [X33,X34,X35] :
( setIn(X32,alive)
& elem(m_Down(X33),snoc(X0,m_Halt(X2)))
& ! [X36] :
( setIn(X36,index(down,host(X35)))
| host(X34) = X36
| leq(host(X35),X36)
| ~ leq(s(zero),X36) )
& elem(m_Down(X34),queue(host(X35)))
& host(X35) = host(X33)
& nbr_proc = host(X35)
& elec_1 = index(status,host(X35))
& host(X2) != host(X35)
& s(index(pendack,host(X2))) != host(X35) )
& host(X2) = host(X32)
& s(index(pendack,host(X2))) = host(X32) )
& ~ leq(nbr_proc,index(pendack,host(X2)))
& index(elid,host(X2)) = X1
& index(status,host(X2)) = elec_2
& host(X3) = index(pendack,host(X2))
& setIn(X2,alive)
& ! [X4,X5] :
( ~ leq(host(X4),host(X5))
| ~ elem(m_Ldr(X5),queue(host(X4))) )
& ! [X6,X7] :
( host(X6) != host(X7)
| ~ elem(m_Down(X7),queue(host(X6))) )
& ! [X8,X9] :
( ~ elem(m_NotNorm(X8),queue(host(X9)))
| nbr_proc != host(X9) )
& ! [X10,X11] :
( ~ setIn(X10,alive)
| ~ setIn(X11,alive)
| X10 = X11
| host(X11) != host(X10) )
& ! [X12] :
( index(elid,host(X12)) = X12
| ( elec_1 != index(status,host(X12))
& elec_2 != index(status,host(X12)) )
| ~ setIn(X12,alive) )
& ! [X13,X14,X15] :
( ~ elem(m_Down(X13),queue(host(X14)))
| host(X15) = host(X14)
| ~ setIn(X15,alive)
| host(X15) != host(X13)
| norm != index(status,host(X15))
| host(X14) != index(ldr,host(X15)) )
& ! [X16,X17,X18] :
( ~ elem(m_Down(X16),queue(host(X17)))
| host(X18) = host(X17)
| ~ setIn(X18,alive)
| host(X18) != host(X16)
| wait != index(status,host(X18))
| host(X17) != host(index(elid,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) )
& ! [X23,X24,X25,X26] :
( ~ elem(m_Down(X26),queue(host(X23)))
| ~ setIn(host(X24),index(down,host(X25)))
| host(X23) = host(X25)
| ~ setIn(X23,alive)
| ~ setIn(X25,alive)
| host(X23) != host(X24)
| host(X25) != host(X26) )
& ! [X27,X28,X29,X30] :
( ~ setIn(X27,alive)
| ~ elem(m_Down(X28),queue(host(X27)))
| ? [X31] :
( ~ setIn(X31,index(down,host(X30)))
& host(X29) != X31
& ~ leq(host(X30),X31)
& leq(s(zero),X31) )
| ~ elem(m_Down(X29),queue(host(X30)))
| nbr_proc != host(X30)
| host(X30) != host(X28)
| elec_1 != index(status,host(X30)) )
& queue(host(X2)) = cons(m_Ack(X1,X3),X0) ),
inference(ennf_transformation,[],[f69]) ).
fof(f86,plain,
? [X0,X1,X2,X3] :
( ? [X32] :
( ? [X33,X34,X35] :
( setIn(X32,alive)
& elem(m_Down(X33),snoc(X0,m_Halt(X2)))
& ! [X36] :
( setIn(X36,index(down,host(X35)))
| host(X34) = X36
| leq(host(X35),X36)
| ~ leq(s(zero),X36) )
& elem(m_Down(X34),queue(host(X35)))
& host(X35) = host(X33)
& nbr_proc = host(X35)
& elec_1 = index(status,host(X35))
& host(X2) != host(X35)
& s(index(pendack,host(X2))) != host(X35) )
& host(X2) = host(X32)
& s(index(pendack,host(X2))) = host(X32) )
& ~ leq(nbr_proc,index(pendack,host(X2)))
& index(elid,host(X2)) = X1
& index(status,host(X2)) = elec_2
& host(X3) = index(pendack,host(X2))
& setIn(X2,alive)
& ! [X4,X5] :
( ~ leq(host(X4),host(X5))
| ~ elem(m_Ldr(X5),queue(host(X4))) )
& ! [X6,X7] :
( host(X6) != host(X7)
| ~ elem(m_Down(X7),queue(host(X6))) )
& ! [X8,X9] :
( ~ elem(m_NotNorm(X8),queue(host(X9)))
| nbr_proc != host(X9) )
& ! [X10,X11] :
( ~ setIn(X10,alive)
| ~ setIn(X11,alive)
| X10 = X11
| host(X11) != host(X10) )
& ! [X12] :
( index(elid,host(X12)) = X12
| ( elec_1 != index(status,host(X12))
& elec_2 != index(status,host(X12)) )
| ~ setIn(X12,alive) )
& ! [X13,X14,X15] :
( ~ elem(m_Down(X13),queue(host(X14)))
| host(X15) = host(X14)
| ~ setIn(X15,alive)
| host(X15) != host(X13)
| norm != index(status,host(X15))
| host(X14) != index(ldr,host(X15)) )
& ! [X16,X17,X18] :
( ~ elem(m_Down(X16),queue(host(X17)))
| host(X18) = host(X17)
| ~ setIn(X18,alive)
| host(X18) != host(X16)
| wait != index(status,host(X18))
| host(X17) != host(index(elid,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) )
& ! [X23,X24,X25,X26] :
( ~ elem(m_Down(X26),queue(host(X23)))
| ~ setIn(host(X24),index(down,host(X25)))
| host(X23) = host(X25)
| ~ setIn(X23,alive)
| ~ setIn(X25,alive)
| host(X23) != host(X24)
| host(X25) != host(X26) )
& ! [X27,X28,X29,X30] :
( ~ setIn(X27,alive)
| ~ elem(m_Down(X28),queue(host(X27)))
| ? [X31] :
( ~ setIn(X31,index(down,host(X30)))
& host(X29) != X31
& ~ leq(host(X30),X31)
& leq(s(zero),X31) )
| ~ elem(m_Down(X29),queue(host(X30)))
| nbr_proc != host(X30)
| host(X30) != host(X28)
| elec_1 != index(status,host(X30)) )
& queue(host(X2)) = cons(m_Ack(X1,X3),X0) ),
inference(flattening,[],[f85]) ).
fof(f105,plain,
! [X0,X1] : m_Halt(X1) != m_Down(X0),
inference(cnf_transformation,[],[f18]) ).
fof(f140,plain,
! [X2,X0,X1] :
( elem(X0,cons(X1,X2))
| ~ elem(X0,X2) ),
inference(cnf_transformation,[],[f47]) ).
fof(f142,plain,
! [X2,X0,X1] :
( ~ elem(X0,snoc(X2,X1))
| X0 = X1
| elem(X0,X2) ),
inference(cnf_transformation,[],[f48]) ).
fof(f183,plain,
! [X36] :
( ~ leq(s(zero),X36)
| leq(host(sK11),X36)
| host(sK10) = X36
| setIn(X36,index(down,host(sK11))) ),
inference(cnf_transformation,[],[f86]) ).
fof(f186,plain,
elec_1 = index(status,host(sK11)),
inference(cnf_transformation,[],[f86]) ).
fof(f187,plain,
nbr_proc = host(sK11),
inference(cnf_transformation,[],[f86]) ).
fof(f188,plain,
host(sK11) = host(sK9),
inference(cnf_transformation,[],[f86]) ).
fof(f189,plain,
elem(m_Down(sK10),queue(host(sK11))),
inference(cnf_transformation,[],[f86]) ).
fof(f190,plain,
elem(m_Down(sK9),snoc(sK3,m_Halt(sK5))),
inference(cnf_transformation,[],[f86]) ).
fof(f192,plain,
! [X28,X29,X27,X30] :
( elec_1 != index(status,host(X30))
| host(X30) != host(X28)
| nbr_proc != host(X30)
| ~ elem(m_Down(X29),queue(host(X30)))
| leq(s(zero),sK8(X29,X30))
| ~ elem(m_Down(X28),queue(host(X27)))
| ~ setIn(X27,alive) ),
inference(cnf_transformation,[],[f86]) ).
fof(f193,plain,
! [X28,X29,X27,X30] :
( elec_1 != index(status,host(X30))
| host(X30) != host(X28)
| nbr_proc != host(X30)
| ~ elem(m_Down(X29),queue(host(X30)))
| ~ leq(host(X30),sK8(X29,X30))
| ~ elem(m_Down(X28),queue(host(X27)))
| ~ setIn(X27,alive) ),
inference(cnf_transformation,[],[f86]) ).
fof(f194,plain,
! [X28,X29,X27,X30] :
( elec_1 != index(status,host(X30))
| host(X30) != host(X28)
| nbr_proc != host(X30)
| ~ elem(m_Down(X29),queue(host(X30)))
| host(X29) != sK8(X29,X30)
| ~ elem(m_Down(X28),queue(host(X27)))
| ~ setIn(X27,alive) ),
inference(cnf_transformation,[],[f86]) ).
fof(f195,plain,
! [X28,X29,X27,X30] :
( elec_1 != index(status,host(X30))
| host(X30) != host(X28)
| nbr_proc != host(X30)
| ~ elem(m_Down(X29),queue(host(X30)))
| ~ setIn(sK8(X29,X30),index(down,host(X30)))
| ~ elem(m_Down(X28),queue(host(X27)))
| ~ setIn(X27,alive) ),
inference(cnf_transformation,[],[f86]) ).
fof(f208,plain,
queue(host(sK5)) = cons(m_Ack(sK4,sK6),sK3),
inference(cnf_transformation,[],[f86]) ).
fof(f209,plain,
setIn(sK5,alive),
inference(cnf_transformation,[],[f86]) ).
fof(f228,plain,
nbr_proc = host(sK9),
inference(forward_demodulation,[],[f188,f187]) ).
fof(f229,plain,
elec_1 = index(status,nbr_proc),
inference(forward_demodulation,[],[f186,f187]) ).
fof(f230,plain,
elem(m_Down(sK10),queue(nbr_proc)),
inference(forward_demodulation,[],[f189,f187]) ).
fof(f280,plain,
! [X36] :
( leq(nbr_proc,X36)
| ~ leq(s(zero),X36)
| host(sK10) = X36
| setIn(X36,index(down,host(sK11))) ),
inference(forward_demodulation,[],[f183,f187]) ).
fof(f281,plain,
! [X36] :
( setIn(X36,index(down,nbr_proc))
| leq(nbr_proc,X36)
| ~ leq(s(zero),X36)
| host(sK10) = X36 ),
inference(forward_demodulation,[],[f280,f187]) ).
fof(f344,plain,
! [X2,X0,X1] :
( elec_1 != index(status,nbr_proc)
| host(X0) != nbr_proc
| nbr_proc != nbr_proc
| ~ elem(m_Down(X1),queue(nbr_proc))
| leq(s(zero),sK8(X1,sK9))
| ~ elem(m_Down(X0),queue(host(X2)))
| ~ setIn(X2,alive) ),
inference(superposition,[],[f192,f228]) ).
fof(f347,plain,
! [X2,X0,X1] :
( elec_1 != index(status,nbr_proc)
| host(X0) != nbr_proc
| ~ elem(m_Down(X1),queue(nbr_proc))
| leq(s(zero),sK8(X1,sK9))
| ~ elem(m_Down(X0),queue(host(X2)))
| ~ setIn(X2,alive) ),
inference(trivial_inequality_removal,[],[f344]) ).
fof(f349,plain,
! [X2,X0,X1] :
( host(X0) != nbr_proc
| ~ elem(m_Down(X1),queue(nbr_proc))
| leq(s(zero),sK8(X1,sK9))
| ~ elem(m_Down(X0),queue(host(X2)))
| ~ setIn(X2,alive) ),
inference(forward_subsumption_resolution,[],[f347,f229]) ).
fof(f352,plain,
! [X2,X0,X1] :
( elec_1 != index(status,nbr_proc)
| host(X0) != nbr_proc
| nbr_proc != nbr_proc
| ~ elem(m_Down(X1),queue(nbr_proc))
| ~ leq(nbr_proc,sK8(X1,sK9))
| ~ elem(m_Down(X0),queue(host(X2)))
| ~ setIn(X2,alive) ),
inference(superposition,[],[f193,f228]) ).
fof(f355,plain,
! [X2,X0,X1] :
( elec_1 != index(status,nbr_proc)
| host(X0) != nbr_proc
| ~ elem(m_Down(X1),queue(nbr_proc))
| ~ leq(nbr_proc,sK8(X1,sK9))
| ~ elem(m_Down(X0),queue(host(X2)))
| ~ setIn(X2,alive) ),
inference(trivial_inequality_removal,[],[f352]) ).
fof(f357,plain,
! [X2,X0,X1] :
( host(X0) != nbr_proc
| ~ elem(m_Down(X1),queue(nbr_proc))
| ~ leq(nbr_proc,sK8(X1,sK9))
| ~ elem(m_Down(X0),queue(host(X2)))
| ~ setIn(X2,alive) ),
inference(forward_subsumption_resolution,[],[f355,f229]) ).
fof(f360,definition,
( spl12_5
<=> ! [X1] :
( ~ elem(m_Down(X1),queue(nbr_proc))
| ~ leq(nbr_proc,sK8(X1,sK9)) ) ),
introduced(definition,[new_symbols(definition,[spl12_5])],[avatar_definition]) ).
fof(f361,plain,
( ! [X1] :
( ~ leq(nbr_proc,sK8(X1,sK9))
| ~ elem(m_Down(X1),queue(nbr_proc)) )
| ~ spl12_5 ),
inference(avatar_component_clause,[],[f360]) ).
fof(f363,definition,
( spl12_6
<=> ! [X2,X0] :
( host(X0) != nbr_proc
| ~ setIn(X2,alive)
| ~ elem(m_Down(X0),queue(host(X2))) ) ),
introduced(definition,[new_symbols(definition,[spl12_6])],[avatar_definition]) ).
fof(f364,plain,
( ! [X2,X0] :
( host(X0) != nbr_proc
| ~ setIn(X2,alive)
| ~ elem(m_Down(X0),queue(host(X2))) )
| ~ spl12_6 ),
inference(avatar_component_clause,[],[f363]) ).
fof(f365,plain,
( spl12_5
| spl12_6 ),
inference(avatar_split_clause,[],[f357,f363,f360]) ).
fof(f367,plain,
! [X2,X0,X1] :
( elec_1 != index(status,nbr_proc)
| host(X0) != nbr_proc
| nbr_proc != nbr_proc
| ~ elem(m_Down(X1),queue(nbr_proc))
| host(X1) != sK8(X1,sK9)
| ~ elem(m_Down(X0),queue(host(X2)))
| ~ setIn(X2,alive) ),
inference(superposition,[],[f194,f228]) ).
fof(f370,plain,
! [X2,X0,X1] :
( elec_1 != index(status,nbr_proc)
| host(X0) != nbr_proc
| ~ elem(m_Down(X1),queue(nbr_proc))
| host(X1) != sK8(X1,sK9)
| ~ elem(m_Down(X0),queue(host(X2)))
| ~ setIn(X2,alive) ),
inference(trivial_inequality_removal,[],[f367]) ).
fof(f372,plain,
! [X2,X0,X1] :
( host(X0) != nbr_proc
| ~ elem(m_Down(X1),queue(nbr_proc))
| host(X1) != sK8(X1,sK9)
| ~ elem(m_Down(X0),queue(host(X2)))
| ~ setIn(X2,alive) ),
inference(forward_subsumption_resolution,[],[f370,f229]) ).
fof(f375,plain,
! [X2,X0,X1] :
( elec_1 != index(status,nbr_proc)
| host(X0) != nbr_proc
| nbr_proc != nbr_proc
| ~ elem(m_Down(X1),queue(nbr_proc))
| ~ setIn(sK8(X1,sK9),index(down,nbr_proc))
| ~ elem(m_Down(X0),queue(host(X2)))
| ~ setIn(X2,alive) ),
inference(superposition,[],[f195,f228]) ).
fof(f378,plain,
! [X2,X0,X1] :
( elec_1 != index(status,nbr_proc)
| host(X0) != nbr_proc
| ~ elem(m_Down(X1),queue(nbr_proc))
| ~ setIn(sK8(X1,sK9),index(down,nbr_proc))
| ~ elem(m_Down(X0),queue(host(X2)))
| ~ setIn(X2,alive) ),
inference(trivial_inequality_removal,[],[f375]) ).
fof(f380,plain,
! [X2,X0,X1] :
( host(X0) != nbr_proc
| ~ elem(m_Down(X1),queue(nbr_proc))
| ~ setIn(sK8(X1,sK9),index(down,nbr_proc))
| ~ elem(m_Down(X0),queue(host(X2)))
| ~ setIn(X2,alive) ),
inference(forward_subsumption_resolution,[],[f378,f229]) ).
fof(f387,plain,
( ! [X0] :
( nbr_proc != nbr_proc
| ~ setIn(X0,alive)
| ~ elem(m_Down(sK9),queue(host(X0))) )
| ~ spl12_6 ),
inference(superposition,[],[f364,f228]) ).
fof(f389,plain,
( ! [X0] :
( ~ elem(m_Down(sK9),queue(host(X0)))
| ~ setIn(X0,alive) )
| ~ spl12_6 ),
inference(trivial_inequality_removal,[],[f387]) ).
fof(f496,plain,
! [X0] :
( elem(X0,queue(host(sK5)))
| ~ elem(X0,sK3) ),
inference(superposition,[],[f140,f208]) ).
fof(f509,plain,
( ~ elem(m_Down(sK9),sK3)
| ~ setIn(sK5,alive)
| ~ spl12_6 ),
inference(resolution,[],[f496,f389]) ).
fof(f513,plain,
( ~ elem(m_Down(sK9),sK3)
| ~ spl12_6 ),
inference(forward_subsumption_resolution,[],[f509,f209]) ).
fof(f663,plain,
( m_Down(sK9) = m_Halt(sK5)
| elem(m_Down(sK9),sK3) ),
inference(resolution,[],[f142,f190]) ).
fof(f667,plain,
elem(m_Down(sK9),sK3),
inference(forward_subsumption_resolution,[],[f663,f105]) ).
fof(f668,plain,
( $false
| ~ spl12_6 ),
inference(forward_subsumption_resolution,[],[f667,f513]) ).
fof(f669,plain,
~ spl12_6,
inference(avatar_contradiction_clause,[],[f668]) ).
fof(f952,definition,
( spl12_17
<=> ! [X1] :
( ~ elem(m_Down(X1),queue(nbr_proc))
| leq(s(zero),sK8(X1,sK9)) ) ),
introduced(definition,[new_symbols(definition,[spl12_17])],[avatar_definition]) ).
fof(f953,plain,
( ! [X1] :
( leq(s(zero),sK8(X1,sK9))
| ~ elem(m_Down(X1),queue(nbr_proc)) )
| ~ spl12_17 ),
inference(avatar_component_clause,[],[f952]) ).
fof(f954,plain,
( spl12_17
| spl12_6 ),
inference(avatar_split_clause,[],[f349,f363,f952]) ).
fof(f988,definition,
( spl12_19
<=> ! [X1] :
( ~ elem(m_Down(X1),queue(nbr_proc))
| host(X1) != sK8(X1,sK9) ) ),
introduced(definition,[new_symbols(definition,[spl12_19])],[avatar_definition]) ).
fof(f989,plain,
( ! [X1] :
( ~ elem(m_Down(X1),queue(nbr_proc))
| host(X1) != sK8(X1,sK9) )
| ~ spl12_19 ),
inference(avatar_component_clause,[],[f988]) ).
fof(f990,plain,
( spl12_19
| spl12_6 ),
inference(avatar_split_clause,[],[f372,f363,f988]) ).
fof(f1001,plain,
( host(sK10) != sK8(sK10,sK9)
| ~ spl12_19 ),
inference(resolution,[],[f989,f230]) ).
fof(f1008,definition,
( spl12_21
<=> ! [X1] :
( ~ elem(m_Down(X1),queue(nbr_proc))
| ~ setIn(sK8(X1,sK9),index(down,nbr_proc)) ) ),
introduced(definition,[new_symbols(definition,[spl12_21])],[avatar_definition]) ).
fof(f1009,plain,
( ! [X1] :
( ~ setIn(sK8(X1,sK9),index(down,nbr_proc))
| ~ elem(m_Down(X1),queue(nbr_proc)) )
| ~ spl12_21 ),
inference(avatar_component_clause,[],[f1008]) ).
fof(f1010,plain,
( spl12_21
| spl12_6 ),
inference(avatar_split_clause,[],[f380,f363,f1008]) ).
fof(f1011,plain,
( ! [X0] :
( ~ elem(m_Down(X0),queue(nbr_proc))
| leq(nbr_proc,sK8(X0,sK9))
| ~ leq(s(zero),sK8(X0,sK9))
| host(sK10) = sK8(X0,sK9) )
| ~ spl12_21 ),
inference(resolution,[],[f1009,f281]) ).
fof(f1012,plain,
( ! [X0] :
( ~ elem(m_Down(X0),queue(nbr_proc))
| leq(nbr_proc,sK8(X0,sK9))
| host(sK10) = sK8(X0,sK9) )
| ~ spl12_17
| ~ spl12_21 ),
inference(forward_subsumption_resolution,[],[f1011,f953]) ).
fof(f1013,plain,
( ! [X0] :
( ~ elem(m_Down(X0),queue(nbr_proc))
| host(sK10) = sK8(X0,sK9) )
| ~ spl12_5
| ~ spl12_17
| ~ spl12_21 ),
inference(forward_subsumption_resolution,[],[f1012,f361]) ).
fof(f3059,plain,
( host(sK10) = sK8(sK10,sK9)
| ~ spl12_5
| ~ spl12_17
| ~ spl12_21 ),
inference(resolution,[],[f1013,f230]) ).
fof(f3061,plain,
( $false
| ~ spl12_5
| ~ spl12_17
| ~ spl12_19
| ~ spl12_21 ),
inference(forward_subsumption_resolution,[],[f3059,f1001]) ).
fof(f3062,plain,
( ~ spl12_5
| ~ spl12_17
| ~ spl12_19
| ~ spl12_21 ),
inference(avatar_contradiction_clause,[],[f3061]) ).
cnf(s3,plain,
( spl12_5
| spl12_6 ),
inference(sat_conversion,[],[f365]) ).
cnf(s8,plain,
~ spl12_6,
inference(sat_conversion,[],[f669]) ).
cnf(s11,plain,
( spl12_6
| spl12_17 ),
inference(sat_conversion,[],[f954]) ).
cnf(s13,plain,
( spl12_6
| spl12_19 ),
inference(sat_conversion,[],[f990]) ).
cnf(s15,plain,
( spl12_6
| spl12_21 ),
inference(sat_conversion,[],[f1010]) ).
cnf(s17,plain,
( ~ spl12_5
| ~ spl12_17
| ~ spl12_19
| ~ spl12_21 ),
inference(sat_conversion,[],[f3062]) ).
cnf(s19,plain,
spl12_21,
inference(rat,[],[s15,s8]) ).
cnf(s21,plain,
spl12_19,
inference(rat,[],[s13,s8]) ).
cnf(s23,plain,
spl12_17,
inference(rat,[],[s11,s8]) ).
cnf(s24,plain,
~ spl12_5,
inference(rat,[],[s17,s19,s21,s23]) ).
cnf(s26,plain,
$false,
inference(rat,[],[s3,s8,s24]) ).
fof(f3063,plain,
$false,
inference(avatar_sat_refutation,[],[s26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV472+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.19 % Computer : n008.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:10:55 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.22 Running first-order model finding
% 0.07/0.22 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.65/1.41 % (2182906)Will run a generic schedule for satisfiability detection.
% 7.65/1.41 % (2182915)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1781648283:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 7.65/1.41 % (2182912)% WARNING: option uhcvi not known.
% 7.65/1.41 % (2182911)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1870825337_2999 on theBenchmark for (2999ds/0Mi)
% 7.65/1.41 % (2182912)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=576488173:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 7.65/1.41 % (2182916)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=442769438:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 7.65/1.41 % (2182913)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2996601742:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 7.65/1.41 % (2182914)dis+10_1_sil=32000:sp=arity:random_seed=3133240350:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 7.65/1.41 % (2182917)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4248875681:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 7.65/1.41 % Detected minimum model sizes of [4]
% 7.65/1.41 % Detected maximum model sizes of [max]
% 7.65/1.41 % TRYING [4]
% 7.65/1.41 % (2182915)Instruction limit reached!
% 7.65/1.41 % (2182915)------------------------------
% 7.65/1.41 % (2182915)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.65/1.41 % (2182915)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.65/1.41 % (2182915)CaDiCaL version: 2.1.3
% 7.65/1.41 % (2182915)Termination reason: Instruction limit
% 7.65/1.41 % (2182915)Termination phase: Saturation
% 7.65/1.41 % (2182915)Time elapsed: 0.041 s
% 7.65/1.41 % (2182915)Peak memory usage: 12 MB
% 7.65/1.41 % (2182915)Instructions burned: 118 (million)
% 7.65/1.41 % TRYING [5]
% 7.65/1.41 % (2182925)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2848129442:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 7.65/1.41 % Detected minimum model sizes of [4]
% 7.65/1.41 % Detected maximum model sizes of [max]
% 7.65/1.41 % TRYING [4]
% 7.65/1.41 % TRYING [5]
% 7.65/1.41 % (2182914)Instruction limit reached!
% 7.65/1.41 % (2182914)------------------------------
% 7.65/1.41 % (2182914)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.65/1.41 % (2182914)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.65/1.41 % (2182914)CaDiCaL version: 2.1.3
% 7.65/1.41 % (2182914)Termination reason: Instruction limit
% 7.65/1.41 % (2182914)Termination phase: Saturation
% 7.65/1.41 % (2182914)Time elapsed: 0.070 s
% 7.65/1.41 % (2182914)Peak memory usage: 12 MB
% 7.65/1.41 % (2182914)Instructions burned: 104 (million)
% 7.65/1.41 % (2182916)Instruction limit reached!
% 7.65/1.41 % (2182916)------------------------------
% 7.65/1.41 % (2182916)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.65/1.41 % (2182916)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.65/1.41 % (2182916)CaDiCaL version: 2.1.3
% 7.65/1.41 % (2182916)Termination reason: Instruction limit
% 7.65/1.41 % (2182916)Termination phase: Saturation
% 7.65/1.41 % (2182916)Time elapsed: 0.081 s
% 7.65/1.41 % (2182916)Peak memory usage: 13 MB
% 7.65/1.41 % (2182916)Instructions burned: 131 (million)
% 7.65/1.41 % TRYING [6]
% 7.65/1.41 % (2182927)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1852266295:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 7.65/1.41 % TRYING [6]
% 7.65/1.41 % (2182917)Instruction limit reached!
% 7.65/1.41 % (2182917)------------------------------
% 7.65/1.41 % (2182917)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.65/1.41 % (2182917)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.65/1.41 % (2182917)CaDiCaL version: 2.1.3
% 7.65/1.41 % (2182917)Termination reason: Instruction limit
% 7.65/1.41 % (2182917)Termination phase: Saturation
% 7.65/1.41 % (2182917)Time elapsed: 0.103 s
% 7.65/1.41 % (2182917)Peak memory usage: 14 MB
% 7.65/1.41 % (2182917)Instructions burned: 160 (million)
% 7.65/1.41 % (2182928)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=46722295:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 7.65/1.41 % (2182931)ott-21_1_sil=16000:fs=off:random_seed=3173780400:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 7.65/1.41 % TRYING [7]
% 7.65/1.41 % (2182927)Instruction limit reached!
% 7.65/1.41 % (2182927)------------------------------
% 7.65/1.41 % (2182927)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.65/1.41 % (2182927)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.65/1.41 % (2182927)CaDiCaL version: 2.1.3
% 7.65/1.41 % (2182927)Termination reason: Instruction limit
% 7.65/1.41 % (2182927)Termination phase: Saturation
% 7.65/1.41 % (2182927)Time elapsed: 0.091 s
% 7.65/1.41 % (2182927)Peak memory usage: 13 MB
% 7.65/1.41 % (2182927)Instructions burned: 132 (million)
% 7.65/1.41 % (2182933)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=609147677:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 7.65/1.41 % TRYING [7]
% 7.65/1.41 % (2182925)Instruction limit reached!
% 7.65/1.41 % (2182925)------------------------------
% 7.65/1.41 % (2182925)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.65/1.41 % (2182925)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.65/1.41 % (2182925)CaDiCaL version: 2.1.3
% 7.65/1.41 % (2182925)Termination reason: Instruction limit
% 7.65/1.41 % (2182925)Termination phase: Finite model building constraint generation
% 7.65/1.41 % (2182925)Time elapsed: 0.169 s
% 7.65/1.41 % (2182925)Peak memory usage: 28 MB
% 7.65/1.41 % (2182925)Instructions burned: 714 (million)
% 7.65/1.41 % (2182931)Instruction limit reached!
% 7.65/1.41 % (2182931)------------------------------
% 7.65/1.41 % (2182931)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.65/1.41 % (2182931)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.65/1.41 % (2182931)CaDiCaL version: 2.1.3
% 7.65/1.41 % (2182931)Termination reason: Instruction limit
% 7.65/1.41 % (2182931)Termination phase: Saturation
% 7.65/1.41 % (2182931)Time elapsed: 0.101 s
% 7.65/1.41 % (2182931)Peak memory usage: 13 MB
% 7.65/1.41 % (2182931)Instructions burned: 181 (million)
% 7.65/1.41 % (2182935)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1142410888:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 7.65/1.41 % (2182936)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3113240011:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 7.65/1.41 % Detected minimum model sizes of [4]
% 7.65/1.41 % Detected maximum model sizes of [max]
% 7.65/1.41 % TRYING [4]
% 7.65/1.41 % TRYING [5]
% 7.65/1.41 % TRYING [6]
% 7.65/1.41 % TRYING [8]
% 7.65/1.41 % (2182935)Instruction limit reached!
% 7.65/1.41 % (2182935)------------------------------
% 7.65/1.41 % (2182935)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.65/1.41 % (2182935)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.65/1.41 % (2182935)CaDiCaL version: 2.1.3
% 7.65/1.41 % (2182935)Termination reason: Instruction limit
% 7.65/1.41 % (2182935)Termination phase: Finite model building SAT solving
% 7.65/1.41 % (2182935)Time elapsed: 0.183 s
% 7.65/1.41 % (2182935)Peak memory usage: 21 MB
% 7.65/1.41 % (2182935)Instructions burned: 870 (million)
% 7.65/1.41 % (2182939)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=3893870430:i=889:ins=1_2995 on theBenchmark for (2995ds/889Mi)
% 7.65/1.41 % TRYING [14]
% 7.65/1.41 % (2182928)Instruction limit reached!
% 7.65/1.41 % (2182928)------------------------------
% 7.65/1.41 % (2182928)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.65/1.41 % (2182928)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.65/1.41 % (2182928)CaDiCaL version: 2.1.3
% 7.65/1.41 % (2182928)Termination reason: Instruction limit
% 7.65/1.41 % (2182928)Termination phase: Saturation
% 7.65/1.41 % (2182928)Time elapsed: 0.371 s
% 7.65/1.41 % (2182928)Peak memory usage: 16 MB
% 7.65/1.41 % (2182928)Instructions burned: 685 (million)
% 7.65/1.41 % (2182941)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=1800979660:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2994 on theBenchmark for (2994ds/692Mi)
% 7.65/1.41 % (2182933)Instruction limit reached!
% 7.65/1.41 % (2182933)------------------------------
% 7.65/1.41 % (2182933)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.65/1.41 % (2182933)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.65/1.41 % (2182933)CaDiCaL version: 2.1.3
% 7.65/1.41 % (2182933)Termination reason: Instruction limit
% 7.65/1.41 % (2182933)Termination phase: Saturation
% 7.65/1.41 % (2182933)Time elapsed: 0.312 s
% 7.65/1.41 % (2182933)Peak memory usage: 14 MB
% 7.65/1.41 % (2182933)Instructions burned: 477 (million)
% 7.65/1.41 % (2182943)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=459053229:i=879:kws=inv_precedence:fsr=off_2994 on theBenchmark for (2994ds/879Mi)
% 7.65/1.41 % (2182939)Instruction limit reached!
% 7.65/1.41 % (2182939)------------------------------
% 7.65/1.41 % (2182939)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.65/1.41 % (2182939)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.65/1.41 % (2182939)CaDiCaL version: 2.1.3
% 7.65/1.41 % (2182939)Termination reason: Instruction limit
% 7.65/1.41 % (2182939)Termination phase: Finite model building constraint generation
% 7.65/1.41 % (2182939)Time elapsed: 0.179 s
% 7.65/1.41 % (2182939)Peak memory usage: 76 MB
% 7.65/1.41 % (2182939)Instructions burned: 896 (million)
% 7.65/1.41 % (2182945)fmb+10_1_sil=64000:random_seed=3705815207:i=22061:nm=2:gsp=on_2993 on theBenchmark for (2993ds/22061Mi)
% 7.65/1.41 % Detected minimum model sizes of [4]
% 7.65/1.41 % Detected maximum model sizes of [max]
% 7.65/1.41 % TRYING [4]
% 7.65/1.41 % TRYING [5]
% 7.65/1.41 % TRYING [6]
% 7.65/1.41 % TRYING [7]
% 7.65/1.41 % (2182941)Instruction limit reached!
% 7.65/1.41 % (2182941)------------------------------
% 7.65/1.41 % (2182941)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.65/1.41 % (2182941)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.65/1.41 % (2182941)CaDiCaL version: 2.1.3
% 7.65/1.41 % (2182941)Termination reason: Instruction limit
% 7.65/1.41 % (2182941)Termination phase: Saturation
% 7.65/1.41 % (2182941)Time elapsed: 0.302 s
% 7.65/1.41 % (2182941)Peak memory usage: 16 MB
% 7.65/1.41 % (2182941)Instructions burned: 693 (million)
% 7.65/1.41 % (2182947)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=2303216087:i=9515:nm=5_2991 on theBenchmark for (2991ds/9515Mi)
% 7.65/1.41 % TRYING [9]
% 7.65/1.41 % Detected minimum model sizes of [4]
% 7.65/1.41 % Detected maximum model sizes of [max]
% 7.65/1.41 % TRYING [20]
% 7.65/1.41 % TRYING [8]
% 7.65/1.41 % (2182936)Instruction limit reached!
% 7.65/1.41 % (2182936)------------------------------
% 7.65/1.41 % (2182936)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.65/1.41 % (2182936)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.65/1.41 % (2182936)CaDiCaL version: 2.1.3
% 7.65/1.41 % (2182936)Termination reason: Instruction limit
% 7.65/1.41 % (2182936)Termination phase: Saturation
% 7.65/1.41 % (2182936)Time elapsed: 0.727 s
% 7.65/1.41 % (2182936)Peak memory usage: 19 MB
% 7.65/1.41 % (2182936)Instructions burned: 1181 (million)
% 7.65/1.41 % (2182949)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=355444289:fmbsr=1.7:i=920_2989 on theBenchmark for (2989ds/920Mi)
% 7.65/1.41 % Detected minimum model sizes of [4]
% 7.65/1.41 % Detected maximum model sizes of [max]
% 7.65/1.41 % TRYING [8]
% 7.65/1.41 % (2182943)Instruction limit reached!
% 7.65/1.41 % (2182943)------------------------------
% 7.65/1.41 % (2182943)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.65/1.41 % (2182943)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.65/1.41 % (2182943)CaDiCaL version: 2.1.3
% 7.65/1.41 % (2182943)Termination reason: Instruction limit
% 7.65/1.41 % (2182943)Termination phase: Saturation
% 7.65/1.41 % (2182943)Time elapsed: 0.496 s
% 7.65/1.41 % (2182943)Peak memory usage: 20 MB
% 7.65/1.41 % (2182943)Instructions burned: 880 (million)
% 7.65/1.41 % (2182951)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=3795843824:i=5131_2989 on theBenchmark for (2989ds/5131Mi)
% 7.65/1.41 % (2182951) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2182906-2182951"...
% 7.65/1.41 % (2182951)...printing done.
% 7.65/1.41 % (2182951)Refutation found. Thanks to Tanya!
% 7.65/1.41 % SZS status Theorem for theBenchmark
% 7.65/1.41 % SZS output start Proof for theBenchmark
% See solution above
% 7.65/1.41 % (2182951)------------------------------
% 7.65/1.41 % (2182951)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.65/1.41 % (2182951)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.65/1.41 % (2182951)CaDiCaL version: 2.1.3
% 7.65/1.41 % (2182951)Termination reason: Refutation
% 7.65/1.41 % (2182951)Time elapsed: 0.073 s
% 7.65/1.41 % (2182951)Peak memory usage: 13 MB
% 7.65/1.41 % (2182951)Instructions burned: 116 (million)
% 7.65/1.41 % (2182906)Success in time 1.186 s
% 7.65/1.41 % Vampire exiting
%------------------------------------------------------------------------------