%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV474+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n010.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 0.90s 0.44s
% Output : Refutation 0.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 16
% Syntax : Number of formulae : 136 ( 40 unt; 11 def)
% Number of atoms : 783 ( 325 equ)
% Maximal formula atoms : 75 ( 5 avg)
% Number of connectives : 1031 ( 384 ~; 370 |; 201 &)
% ( 13 <=>; 63 =>; 0 <=; 0 <~>)
% Maximal formula depth : 36 ( 5 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 16 ( 14 usr; 12 prp; 0-2 aty)
% Number of functors : 27 ( 27 usr; 19 con; 0-2 aty)
% Number of variables : 266 ( 2 sgn 248 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] : leq(s(zero),host(X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_02) ).
fof(f5,axiom,
! [X0] : leq(host(X0),nbr_proc),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_04) ).
fof(f47,axiom,
! [X0,X1,X2] :
( elem(X0,cons(X1,X2))
<=> ( X0 = X1
| elem(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_46) ).
fof(f62,axiom,
! [X0,X1] :
( ( leq(X0,X1)
& leq(X1,X0) )
<=> X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_61) ).
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_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 )
=> ! [X4] :
( host(X2) != host(X4)
=> ! [X9,X10,X11] :
( host(X2) = host(X11)
=> ( ( ! [X8] :
( ( ~ leq(host(X11),X8)
& leq(s(zero),X8) )
=> ( setIn(X8,index(down,host(X2)))
| X8 = host(X3)
| X8 = host(X10) ) )
& elem(m_Down(X10),X0)
& host(X11) = host(X9)
& host(X11) = nbr_proc
& index(status,host(X11)) = elec_1 )
=> ~ ( setIn(X4,alive)
& elem(m_Down(X9),queue(host(X4))) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/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_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 )
=> ! [X4] :
( host(X2) != host(X4)
=> ! [X9,X10,X11] :
( host(X2) = host(X11)
=> ( ( ! [X8] :
( ( ~ leq(host(X11),X8)
& leq(s(zero),X8) )
=> ( setIn(X8,index(down,host(X2)))
| X8 = host(X3)
| X8 = host(X10) ) )
& elem(m_Down(X10),X0)
& host(X11) = host(X9)
& host(X11) = nbr_proc
& index(status,host(X11)) = elec_1 )
=> ~ ( setIn(X4,alive)
& elem(m_Down(X9),queue(host(X4))) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f67]) ).
fof(f69,plain,
~ ! [X0,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_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))) ) )
=> ( ~ ( ! [X32] :
( ( ~ leq(host(X2),X32)
& leq(s(zero),X32) )
=> ( setIn(X32,index(down,host(X2)))
| host(X3) = X32 ) )
& index(status,host(X2)) = elec_1 )
=> ! [X33] :
( host(X2) != host(X33)
=> ! [X34,X35,X36] :
( host(X2) = host(X36)
=> ( ( ! [X37] :
( ( ~ leq(host(X36),X37)
& leq(s(zero),X37) )
=> ( setIn(X37,index(down,host(X2)))
| host(X3) = X37
| host(X35) = X37 ) )
& elem(m_Down(X35),X0)
& host(X36) = host(X34)
& nbr_proc = host(X36)
& elec_1 = index(status,host(X36)) )
=> ~ ( setIn(X33,alive)
& elem(m_Down(X34),queue(host(X33))) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f68]) ).
fof(f85,plain,
? [X0,X2,X3] :
( ? [X33] :
( ? [X34,X35,X36] :
( setIn(X33,alive)
& elem(m_Down(X34),queue(host(X33)))
& ! [X37] :
( setIn(X37,index(down,host(X2)))
| host(X3) = X37
| host(X35) = X37
| leq(host(X36),X37)
| ~ leq(s(zero),X37) )
& elem(m_Down(X35),X0)
& host(X36) = host(X34)
& nbr_proc = host(X36)
& elec_1 = index(status,host(X36))
& host(X2) = host(X36) )
& host(X2) != host(X33) )
& ( ? [X32] :
( ~ setIn(X32,index(down,host(X2)))
& host(X3) != X32
& ~ leq(host(X2),X32)
& leq(s(zero),X32) )
| elec_1 != index(status,host(X2)) )
& ( 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] :
( ~ 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_Down(X3),X0) ),
inference(ennf_transformation,[],[f69]) ).
fof(f86,plain,
? [X0,X2,X3] :
( ? [X33] :
( ? [X34,X35,X36] :
( setIn(X33,alive)
& elem(m_Down(X34),queue(host(X33)))
& ! [X37] :
( setIn(X37,index(down,host(X2)))
| host(X3) = X37
| host(X35) = X37
| leq(host(X36),X37)
| ~ leq(s(zero),X37) )
& elem(m_Down(X35),X0)
& host(X36) = host(X34)
& nbr_proc = host(X36)
& elec_1 = index(status,host(X36))
& host(X2) = host(X36) )
& host(X2) != host(X33) )
& ( ? [X32] :
( ~ setIn(X32,index(down,host(X2)))
& host(X3) != X32
& ~ leq(host(X2),X32)
& leq(s(zero),X32) )
| elec_1 != index(status,host(X2)) )
& ( 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] :
( ~ 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_Down(X3),X0) ),
inference(flattening,[],[f85]) ).
fof(f90,plain,
! [X0] : leq(s(zero),host(X0)),
inference(cnf_transformation,[],[f3]) ).
fof(f92,plain,
! [X0] : leq(host(X0),nbr_proc),
inference(cnf_transformation,[],[f5]) ).
fof(f140,plain,
! [X2,X0,X1] :
( elem(X0,cons(X1,X2))
| ~ elem(X0,X2) ),
inference(cnf_transformation,[],[f47]) ).
fof(f141,plain,
! [X2,X0,X1] :
( X0 != X1
| elem(X0,cons(X1,X2)) ),
inference(cnf_transformation,[],[f47]) ).
fof(f173,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| ~ leq(X1,X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f62]) ).
fof(f183,plain,
! [X37] :
( ~ leq(s(zero),X37)
| leq(host(sK11),X37)
| host(sK10) = X37
| host(sK5) = X37
| setIn(X37,index(down,host(sK4))) ),
inference(cnf_transformation,[],[f86]) ).
fof(f184,plain,
host(sK11) = host(sK4),
inference(cnf_transformation,[],[f86]) ).
fof(f185,plain,
elec_1 = index(status,host(sK11)),
inference(cnf_transformation,[],[f86]) ).
fof(f186,plain,
nbr_proc = host(sK11),
inference(cnf_transformation,[],[f86]) ).
fof(f187,plain,
host(sK11) = host(sK9),
inference(cnf_transformation,[],[f86]) ).
fof(f188,plain,
elem(m_Down(sK10),sK3),
inference(cnf_transformation,[],[f86]) ).
fof(f189,plain,
elem(m_Down(sK9),queue(host(sK6))),
inference(cnf_transformation,[],[f86]) ).
fof(f190,plain,
setIn(sK6,alive),
inference(cnf_transformation,[],[f86]) ).
fof(f195,plain,
( elec_1 != index(status,host(sK4))
| leq(s(zero),sK7) ),
inference(cnf_transformation,[],[f86]) ).
fof(f196,plain,
( elec_1 != index(status,host(sK4))
| ~ leq(host(sK4),sK7) ),
inference(cnf_transformation,[],[f86]) ).
fof(f197,plain,
( elec_1 != index(status,host(sK4))
| sK7 != host(sK5) ),
inference(cnf_transformation,[],[f86]) ).
fof(f198,plain,
( elec_1 != index(status,host(sK4))
| ~ setIn(sK7,index(down,host(sK4))) ),
inference(cnf_transformation,[],[f86]) ).
fof(f201,plain,
host(sK4) != host(sK6),
inference(cnf_transformation,[],[f86]) ).
fof(f208,plain,
! [X21,X19,X22,X20] :
( host(X21) != host(X22)
| host(X19) != host(X20)
| ~ setIn(X21,alive)
| ~ setIn(X19,alive)
| host(X19) = host(X21)
| ~ elem(m_Down(X20),queue(host(X21)))
| ~ elem(m_Down(X22),queue(host(X19))) ),
inference(cnf_transformation,[],[f86]) ).
fof(f209,plain,
! [X26,X24,X25,X23] :
( host(X25) != host(X26)
| host(X23) != host(X24)
| ~ setIn(X25,alive)
| ~ setIn(X23,alive)
| host(X23) = host(X25)
| ~ setIn(host(X24),index(down,host(X25)))
| ~ elem(m_Down(X26),queue(host(X23))) ),
inference(cnf_transformation,[],[f86]) ).
fof(f212,plain,
queue(host(sK4)) = cons(m_Down(sK5),sK3),
inference(cnf_transformation,[],[f86]) ).
fof(f213,plain,
setIn(sK4,alive),
inference(cnf_transformation,[],[f86]) ).
fof(f221,plain,
! [X2,X1] : elem(X1,cons(X1,X2)),
inference(equality_resolution,[],[f141]) ).
fof(f229,definition,
( spl12_1
<=> leq(s(zero),sK7) ),
introduced(definition,[new_symbols(definition,[spl12_1])],[avatar_definition]) ).
fof(f231,plain,
( leq(s(zero),sK7)
| ~ spl12_1 ),
inference(avatar_component_clause,[],[f229]) ).
fof(f233,definition,
( spl12_2
<=> elec_1 = index(status,host(sK4)) ),
introduced(definition,[new_symbols(definition,[spl12_2])],[avatar_definition]) ).
fof(f235,plain,
( elec_1 != index(status,host(sK4))
| spl12_2 ),
inference(avatar_component_clause,[],[f233]) ).
fof(f236,plain,
( spl12_1
| ~ spl12_2 ),
inference(avatar_split_clause,[],[f195,f233,f229]) ).
fof(f238,definition,
( spl12_3
<=> leq(host(sK4),sK7) ),
introduced(definition,[new_symbols(definition,[spl12_3])],[avatar_definition]) ).
fof(f240,plain,
( ~ leq(host(sK4),sK7)
| spl12_3 ),
inference(avatar_component_clause,[],[f238]) ).
fof(f241,plain,
( ~ spl12_3
| ~ spl12_2 ),
inference(avatar_split_clause,[],[f196,f233,f238]) ).
fof(f243,definition,
( spl12_4
<=> sK7 = host(sK5) ),
introduced(definition,[new_symbols(definition,[spl12_4])],[avatar_definition]) ).
fof(f245,plain,
( sK7 != host(sK5)
| spl12_4 ),
inference(avatar_component_clause,[],[f243]) ).
fof(f246,plain,
( ~ spl12_4
| ~ spl12_2 ),
inference(avatar_split_clause,[],[f197,f233,f243]) ).
fof(f248,definition,
( spl12_5
<=> setIn(sK7,index(down,host(sK4))) ),
introduced(definition,[new_symbols(definition,[spl12_5])],[avatar_definition]) ).
fof(f250,plain,
( ~ setIn(sK7,index(down,host(sK4)))
| spl12_5 ),
inference(avatar_component_clause,[],[f248]) ).
fof(f251,plain,
( ~ spl12_5
| ~ spl12_2 ),
inference(avatar_split_clause,[],[f198,f233,f248]) ).
fof(f270,plain,
nbr_proc = host(sK4),
inference(forward_demodulation,[],[f184,f186]) ).
fof(f271,plain,
nbr_proc = host(sK9),
inference(forward_demodulation,[],[f187,f186]) ).
fof(f272,plain,
nbr_proc != host(sK6),
inference(forward_demodulation,[],[f201,f270]) ).
fof(f274,plain,
elec_1 = index(status,nbr_proc),
inference(forward_demodulation,[],[f185,f186]) ).
fof(f275,plain,
( elec_1 != index(status,nbr_proc)
| spl12_2 ),
inference(forward_demodulation,[],[f235,f270]) ).
fof(f276,plain,
( $false
| spl12_2 ),
inference(forward_subsumption_resolution,[],[f275,f274]) ).
fof(f277,plain,
spl12_2,
inference(avatar_contradiction_clause,[],[f276]) ).
fof(f279,plain,
( ~ leq(nbr_proc,sK7)
| spl12_3 ),
inference(forward_demodulation,[],[f240,f270]) ).
fof(f280,plain,
( ~ setIn(sK7,index(down,nbr_proc))
| spl12_5 ),
inference(forward_demodulation,[],[f250,f270]) ).
fof(f281,plain,
cons(m_Down(sK5),sK3) = queue(nbr_proc),
inference(forward_demodulation,[],[f212,f270]) ).
fof(f414,plain,
! [X37] :
( leq(nbr_proc,X37)
| ~ leq(s(zero),X37)
| host(sK10) = X37
| host(sK5) = X37
| setIn(X37,index(down,host(sK4))) ),
inference(forward_demodulation,[],[f183,f186]) ).
fof(f415,plain,
! [X37] :
( setIn(X37,index(down,nbr_proc))
| leq(nbr_proc,X37)
| ~ leq(s(zero),X37)
| host(sK10) = X37
| host(sK5) = X37 ),
inference(forward_demodulation,[],[f414,f270]) ).
fof(f416,plain,
( leq(nbr_proc,sK7)
| ~ leq(s(zero),sK7)
| sK7 = host(sK10)
| sK7 = host(sK5)
| spl12_5 ),
inference(resolution,[],[f415,f280]) ).
fof(f417,plain,
( ~ leq(s(zero),sK7)
| sK7 = host(sK10)
| sK7 = host(sK5)
| spl12_3
| spl12_5 ),
inference(forward_subsumption_resolution,[],[f416,f279]) ).
fof(f418,plain,
( sK7 = host(sK10)
| sK7 = host(sK5)
| ~ spl12_1
| spl12_3
| spl12_5 ),
inference(forward_subsumption_resolution,[],[f417,f231]) ).
fof(f419,plain,
( sK7 = host(sK10)
| ~ spl12_1
| spl12_3
| spl12_4
| spl12_5 ),
inference(forward_subsumption_resolution,[],[f418,f245]) ).
fof(f467,definition,
( spl12_22
<=> elem(m_Down(sK10),queue(nbr_proc)) ),
introduced(definition,[new_symbols(definition,[spl12_22])],[avatar_definition]) ).
fof(f469,plain,
( ~ elem(m_Down(sK10),queue(nbr_proc))
| spl12_22 ),
inference(avatar_component_clause,[],[f467]) ).
fof(f549,plain,
! [X2,X0,X1] :
( ~ setIn(X1,alive)
| host(X1) != host(X2)
| ~ setIn(X0,alive)
| host(X0) != nbr_proc
| host(X0) = host(X1)
| ~ elem(m_Down(X2),queue(host(X0)))
| ~ elem(m_Down(sK9),queue(host(X1))) ),
inference(superposition,[],[f208,f271]) ).
fof(f550,plain,
( ! [X2,X0,X1] :
( ~ setIn(X1,alive)
| host(X1) != host(X2)
| ~ setIn(X0,alive)
| host(X0) != sK7
| host(X0) = host(X1)
| ~ elem(m_Down(X2),queue(host(X0)))
| ~ elem(m_Down(sK10),queue(host(X1))) )
| ~ spl12_1
| spl12_3
| spl12_4
| spl12_5 ),
inference(superposition,[],[f208,f419]) ).
fof(f632,definition,
( spl12_28
<=> ! [X0,X1] :
( host(X0) != sK7
| host(X0) = nbr_proc
| ~ setIn(X0,alive)
| host(X1) != nbr_proc
| ~ elem(m_Down(X1),queue(host(X0))) ) ),
introduced(definition,[new_symbols(definition,[spl12_28])],[avatar_definition]) ).
fof(f633,plain,
( ! [X0,X1] :
( ~ setIn(X0,alive)
| host(X0) = nbr_proc
| host(X0) != sK7
| host(X1) != nbr_proc
| ~ elem(m_Down(X1),queue(host(X0))) )
| ~ spl12_28 ),
inference(avatar_component_clause,[],[f632]) ).
fof(f635,plain,
! [X2,X0,X1] :
( host(X0) != nbr_proc
| host(X1) != host(X2)
| ~ setIn(sK4,alive)
| ~ setIn(X1,alive)
| host(X1) = nbr_proc
| ~ setIn(host(X2),index(down,nbr_proc))
| ~ elem(m_Down(X0),queue(host(X1))) ),
inference(superposition,[],[f209,f270]) ).
fof(f645,plain,
! [X2,X0,X1] :
( ~ setIn(X1,alive)
| host(X1) != host(X2)
| host(X0) != nbr_proc
| host(X1) = nbr_proc
| ~ setIn(host(X2),index(down,nbr_proc))
| ~ elem(m_Down(X0),queue(host(X1))) ),
inference(forward_subsumption_resolution,[],[f635,f213]) ).
fof(f910,definition,
( spl12_56
<=> host(sK5) = host(sK6) ),
introduced(definition,[new_symbols(definition,[spl12_56])],[avatar_definition]) ).
fof(f912,plain,
( host(sK5) = host(sK6)
| ~ spl12_56 ),
inference(avatar_component_clause,[],[f910]) ).
fof(f922,definition,
( spl12_59
<=> sK7 = host(sK6) ),
introduced(definition,[new_symbols(definition,[spl12_59])],[avatar_definition]) ).
fof(f1134,plain,
! [X0,X1] :
( host(X0) != host(sK6)
| host(X1) != nbr_proc
| nbr_proc = host(sK6)
| ~ setIn(host(X0),index(down,nbr_proc))
| ~ elem(m_Down(X1),queue(host(sK6))) ),
inference(resolution,[],[f645,f190]) ).
fof(f1136,plain,
! [X0,X1] :
( host(X0) != host(sK6)
| host(X1) != nbr_proc
| ~ setIn(host(X0),index(down,nbr_proc))
| ~ elem(m_Down(X1),queue(host(sK6))) ),
inference(forward_subsumption_resolution,[],[f1134,f272]) ).
fof(f1250,plain,
elem(m_Down(sK5),queue(nbr_proc)),
inference(superposition,[],[f221,f281]) ).
fof(f1293,definition,
( spl12_78
<=> ! [X1] :
( host(X1) != nbr_proc
| ~ elem(m_Down(X1),queue(host(sK6))) ) ),
introduced(definition,[new_symbols(definition,[spl12_78])],[avatar_definition]) ).
fof(f1294,plain,
( ! [X1] :
( ~ elem(m_Down(X1),queue(host(sK6)))
| host(X1) != nbr_proc )
| ~ spl12_78 ),
inference(avatar_component_clause,[],[f1293]) ).
fof(f1296,definition,
( spl12_79
<=> ! [X0] :
( host(X0) != host(sK6)
| ~ setIn(host(X0),index(down,nbr_proc)) ) ),
introduced(definition,[new_symbols(definition,[spl12_79])],[avatar_definition]) ).
fof(f1297,plain,
( ! [X0] :
( ~ setIn(host(X0),index(down,nbr_proc))
| host(X0) != host(sK6) )
| ~ spl12_79 ),
inference(avatar_component_clause,[],[f1296]) ).
fof(f1298,plain,
( spl12_78
| spl12_79 ),
inference(avatar_split_clause,[],[f1136,f1296,f1293]) ).
fof(f1325,plain,
( ! [X0] :
( host(X0) != host(sK6)
| leq(nbr_proc,host(X0))
| ~ leq(s(zero),host(X0))
| host(X0) = host(sK10)
| host(X0) = host(sK5) )
| ~ spl12_79 ),
inference(resolution,[],[f1297,f415]) ).
fof(f1330,plain,
( ! [X0] :
( host(X0) != host(sK6)
| leq(nbr_proc,host(X0))
| host(X0) = host(sK10)
| host(X0) = host(sK5) )
| ~ spl12_79 ),
inference(forward_subsumption_resolution,[],[f1325,f90]) ).
fof(f1331,plain,
( ! [X0] :
( leq(nbr_proc,host(X0))
| host(X0) != host(sK6)
| host(X0) = sK7
| host(X0) = host(sK5) )
| ~ spl12_1
| spl12_3
| spl12_4
| spl12_5
| ~ spl12_79 ),
inference(forward_demodulation,[],[f1330,f419]) ).
fof(f1350,plain,
! [X0,X1] :
( host(X0) != host(sK6)
| ~ setIn(X1,alive)
| host(X1) != nbr_proc
| host(X1) = host(sK6)
| ~ elem(m_Down(X0),queue(host(X1)))
| ~ elem(m_Down(sK9),queue(host(sK6))) ),
inference(resolution,[],[f549,f190]) ).
fof(f1353,plain,
! [X0,X1] :
( ~ setIn(X1,alive)
| host(X0) != host(sK6)
| host(X1) != nbr_proc
| host(X1) = host(sK6)
| ~ elem(m_Down(X0),queue(host(X1))) ),
inference(forward_subsumption_resolution,[],[f1350,f189]) ).
fof(f1356,plain,
! [X0] :
( host(X0) != host(sK6)
| nbr_proc != host(sK4)
| host(sK4) = host(sK6)
| ~ elem(m_Down(X0),queue(host(sK4))) ),
inference(resolution,[],[f1353,f213]) ).
fof(f1357,plain,
! [X0] :
( host(X0) != host(sK6)
| host(sK4) = host(sK6)
| ~ elem(m_Down(X0),queue(host(sK4))) ),
inference(forward_subsumption_resolution,[],[f1356,f270]) ).
fof(f1358,plain,
! [X0] :
( nbr_proc = host(sK6)
| host(X0) != host(sK6)
| ~ elem(m_Down(X0),queue(host(sK4))) ),
inference(forward_demodulation,[],[f1357,f270]) ).
fof(f1359,plain,
! [X0] :
( host(X0) != host(sK6)
| ~ elem(m_Down(X0),queue(host(sK4))) ),
inference(forward_subsumption_resolution,[],[f1358,f272]) ).
fof(f1360,plain,
! [X0] :
( ~ elem(m_Down(X0),queue(nbr_proc))
| host(X0) != host(sK6) ),
inference(forward_demodulation,[],[f1359,f270]) ).
fof(f1361,plain,
host(sK5) != host(sK6),
inference(resolution,[],[f1360,f1250]) ).
fof(f1469,plain,
( ! [X0,X1] :
( host(X0) != host(sK4)
| ~ setIn(X1,alive)
| host(X1) != sK7
| host(X1) = host(sK4)
| ~ elem(m_Down(X0),queue(host(X1)))
| ~ elem(m_Down(sK10),queue(host(sK4))) )
| ~ spl12_1
| spl12_3
| spl12_4
| spl12_5 ),
inference(resolution,[],[f550,f213]) ).
fof(f1470,plain,
( ! [X0,X1] :
( host(X0) != nbr_proc
| ~ setIn(X1,alive)
| host(X1) != sK7
| host(X1) = host(sK4)
| ~ elem(m_Down(X0),queue(host(X1)))
| ~ elem(m_Down(sK10),queue(host(sK4))) )
| ~ spl12_1
| spl12_3
| spl12_4
| spl12_5 ),
inference(forward_demodulation,[],[f1469,f270]) ).
fof(f1479,plain,
( ! [X0,X1] :
( host(X1) = nbr_proc
| host(X0) != nbr_proc
| ~ setIn(X1,alive)
| host(X1) != sK7
| ~ elem(m_Down(X0),queue(host(X1)))
| ~ elem(m_Down(sK10),queue(host(sK4))) )
| ~ spl12_1
| spl12_3
| spl12_4
| spl12_5 ),
inference(forward_demodulation,[],[f1470,f270]) ).
fof(f1480,plain,
( ! [X0,X1] :
( ~ elem(m_Down(sK10),queue(nbr_proc))
| host(X1) = nbr_proc
| host(X0) != nbr_proc
| ~ setIn(X1,alive)
| host(X1) != sK7
| ~ elem(m_Down(X0),queue(host(X1))) )
| ~ spl12_1
| spl12_3
| spl12_4
| spl12_5 ),
inference(forward_demodulation,[],[f1479,f270]) ).
fof(f1543,plain,
! [X0] :
( ~ elem(X0,sK3)
| elem(X0,queue(nbr_proc)) ),
inference(superposition,[],[f140,f281]) ).
fof(f1545,plain,
elem(m_Down(sK10),queue(nbr_proc)),
inference(resolution,[],[f1543,f188]) ).
fof(f1562,plain,
( $false
| spl12_22 ),
inference(forward_subsumption_resolution,[],[f1545,f469]) ).
fof(f1563,plain,
spl12_22,
inference(avatar_contradiction_clause,[],[f1562]) ).
fof(f1564,plain,
( spl12_28
| ~ spl12_22
| ~ spl12_1
| spl12_3
| spl12_4
| spl12_5 ),
inference(avatar_split_clause,[],[f1480,f248,f243,f238,f229,f467,f632]) ).
fof(f1693,plain,
( ! [X0] :
( nbr_proc = host(sK6)
| sK7 != host(sK6)
| host(X0) != nbr_proc
| ~ elem(m_Down(X0),queue(host(sK6))) )
| ~ spl12_28 ),
inference(resolution,[],[f633,f190]) ).
fof(f1863,plain,
( ! [X0] :
( ~ leq(host(X0),nbr_proc)
| host(X0) = nbr_proc
| host(X0) != host(sK6)
| host(X0) = sK7
| host(X0) = host(sK5) )
| ~ spl12_1
| spl12_3
| spl12_4
| spl12_5
| ~ spl12_79 ),
inference(resolution,[],[f173,f1331]) ).
fof(f1868,plain,
( ! [X0] :
( host(X0) != host(sK6)
| host(X0) = nbr_proc
| host(X0) = sK7
| host(X0) = host(sK5) )
| ~ spl12_1
| spl12_3
| spl12_4
| spl12_5
| ~ spl12_79 ),
inference(forward_subsumption_resolution,[],[f1863,f92]) ).
fof(f2051,plain,
( nbr_proc = host(sK6)
| sK7 = host(sK6)
| host(sK5) = host(sK6)
| ~ spl12_1
| spl12_3
| spl12_4
| spl12_5
| ~ spl12_79 ),
inference(equality_resolution,[],[f1868]) ).
fof(f2052,plain,
( sK7 = host(sK6)
| host(sK5) = host(sK6)
| ~ spl12_1
| spl12_3
| spl12_4
| spl12_5
| ~ spl12_79 ),
inference(forward_subsumption_resolution,[],[f2051,f272]) ).
fof(f2056,plain,
( nbr_proc != host(sK9)
| ~ spl12_78 ),
inference(resolution,[],[f1294,f189]) ).
fof(f2059,plain,
( $false
| ~ spl12_78 ),
inference(forward_subsumption_resolution,[],[f2056,f271]) ).
fof(f2060,plain,
~ spl12_78,
inference(avatar_contradiction_clause,[],[f2059]) ).
fof(f2063,plain,
( ! [X0] :
( sK7 != host(sK6)
| host(X0) != nbr_proc
| ~ elem(m_Down(X0),queue(host(sK6))) )
| ~ spl12_28 ),
inference(forward_subsumption_resolution,[],[f1693,f272]) ).
fof(f2065,plain,
( spl12_78
| ~ spl12_59
| ~ spl12_28 ),
inference(avatar_split_clause,[],[f2063,f632,f922,f1293]) ).
fof(f2107,plain,
( spl12_56
| spl12_59
| ~ spl12_1
| spl12_3
| spl12_4
| spl12_5
| ~ spl12_79 ),
inference(avatar_split_clause,[],[f2052,f1296,f248,f243,f238,f229,f922,f910]) ).
fof(f2486,plain,
( $false
| ~ spl12_56 ),
inference(forward_subsumption_resolution,[],[f912,f1361]) ).
fof(f2487,plain,
~ spl12_56,
inference(avatar_contradiction_clause,[],[f2486]) ).
cnf(s1,plain,
( spl12_1
| ~ spl12_2 ),
inference(sat_conversion,[],[f236]) ).
cnf(s2,plain,
( ~ spl12_2
| ~ spl12_3 ),
inference(sat_conversion,[],[f241]) ).
cnf(s3,plain,
( ~ spl12_2
| ~ spl12_4 ),
inference(sat_conversion,[],[f246]) ).
cnf(s4,plain,
( ~ spl12_2
| ~ spl12_5 ),
inference(sat_conversion,[],[f251]) ).
cnf(s7,plain,
spl12_2,
inference(sat_conversion,[],[f277]) ).
cnf(s83,plain,
( spl12_78
| spl12_79 ),
inference(sat_conversion,[],[f1298]) ).
cnf(s95,plain,
spl12_22,
inference(sat_conversion,[],[f1563]) ).
cnf(s96,plain,
( ~ spl12_1
| spl12_3
| spl12_4
| spl12_5
| ~ spl12_22
| spl12_28 ),
inference(sat_conversion,[],[f1564]) ).
cnf(s114,plain,
~ spl12_78,
inference(sat_conversion,[],[f2060]) ).
cnf(s116,plain,
( ~ spl12_28
| ~ spl12_59
| spl12_78 ),
inference(sat_conversion,[],[f2065]) ).
cnf(s138,plain,
( ~ spl12_1
| spl12_3
| spl12_4
| spl12_5
| spl12_56
| spl12_59
| ~ spl12_79 ),
inference(sat_conversion,[],[f2107]) ).
cnf(s182,plain,
~ spl12_56,
inference(sat_conversion,[],[f2487]) ).
cnf(s183,plain,
( ~ spl12_1
| spl12_3
| spl12_4
| spl12_5
| spl12_59
| ~ spl12_79 ),
inference(rat,[],[s138,s182]) ).
cnf(s188,plain,
spl12_79,
inference(rat,[],[s83,s114]) ).
cnf(s201,plain,
~ spl12_5,
inference(rat,[],[s4,s7]) ).
cnf(s202,plain,
~ spl12_4,
inference(rat,[],[s3,s7]) ).
cnf(s203,plain,
~ spl12_3,
inference(rat,[],[s2,s7]) ).
cnf(s204,plain,
spl12_1,
inference(rat,[],[s1,s7]) ).
cnf(s207,plain,
spl12_59,
inference(rat,[],[s183,s188,s203,s201,s202,s204]) ).
cnf(s216,plain,
spl12_28,
inference(rat,[],[s96,s203,s95,s201,s202,s204]) ).
cnf(s221,plain,
$false,
inference(rat,[],[s116,s114,s207,s216]) ).
fof(f2488,plain,
$false,
inference(avatar_sat_refutation,[],[s221]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV474+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.20 % Computer : n010.cluster.edu
% 0.09/0.20 % Model : x86_64 x86_64
% 0.09/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20 % Memory : 8046.5625MB
% 0.09/0.20 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Mon Sep 28 11:11:33 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.23 Running first-order model finding
% 0.09/0.23 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.90/0.44 % (1854792)Will run a generic schedule for satisfiability detection.
% 0.90/0.44 % (1854798)% WARNING: option uhcvi not known.
% 0.90/0.44 % (1854798)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2851299174:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.90/0.44 % (1854797)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4285433871_2999 on theBenchmark for (2999ds/0Mi)
% 0.90/0.44 % (1854801)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3045254478:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.90/0.44 % (1854799)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4077238708:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.90/0.44 % (1854800)dis+10_1_sil=32000:sp=arity:random_seed=419479681:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.90/0.44 % (1854802)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1422227556:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.90/0.44 % (1854803)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3300086043:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.90/0.44 % Detected minimum model sizes of [4]
% 0.90/0.44 % Detected maximum model sizes of [max]
% 0.90/0.44 % TRYING [4]
% 0.90/0.44 % TRYING [5]
% 0.90/0.44 % (1854800)Instruction limit reached!
% 0.90/0.44 % (1854800)------------------------------
% 0.90/0.44 % (1854800)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.90/0.44 % (1854800)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.90/0.44 % (1854800)CaDiCaL version: 2.1.3
% 0.90/0.44 % (1854800)Termination reason: Instruction limit
% 0.90/0.44 % (1854800)Termination phase: Saturation
% 0.90/0.44 % (1854800)Time elapsed: 0.070 s
% 0.90/0.44 % (1854800)Peak memory usage: 13 MB
% 0.90/0.44 % (1854800)Instructions burned: 104 (million)
% 0.90/0.44 % (1854801)Instruction limit reached!
% 0.90/0.44 % (1854801)------------------------------
% 0.90/0.44 % (1854801)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.90/0.44 % (1854801)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.90/0.44 % (1854801)CaDiCaL version: 2.1.3
% 0.90/0.44 % (1854801)Termination reason: Instruction limit
% 0.90/0.44 % (1854801)Termination phase: Saturation
% 0.90/0.44 % (1854801)Time elapsed: 0.073 s
% 0.90/0.44 % (1854801)Peak memory usage: 13 MB
% 0.90/0.44 % (1854801)Instructions burned: 117 (million)
% 0.90/0.44 % TRYING [6]
% 0.90/0.44 % (1854802)Instruction limit reached!
% 0.90/0.44 % (1854802)------------------------------
% 0.90/0.44 % (1854802)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.90/0.44 % (1854802)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.90/0.44 % (1854802)CaDiCaL version: 2.1.3
% 0.90/0.44 % (1854802)Termination reason: Instruction limit
% 0.90/0.44 % (1854802)Termination phase: Saturation
% 0.90/0.44 % (1854802)Time elapsed: 0.080 s
% 0.90/0.44 % (1854802)Peak memory usage: 13 MB
% 0.90/0.44 % (1854802)Instructions burned: 132 (million)
% 0.90/0.44 % (1854811)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=546730759:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 0.90/0.44 % (1854812)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1629470655:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 0.90/0.44 % (1854813)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=1166948656:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 0.90/0.44 % Detected minimum model sizes of [4]
% 0.90/0.44 % Detected maximum model sizes of [max]
% 0.90/0.44 % TRYING [4]
% 0.90/0.44 % (1854803)Instruction limit reached!
% 0.90/0.44 % (1854803)------------------------------
% 0.90/0.44 % (1854803)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.90/0.44 % (1854803)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.90/0.44 % (1854803)CaDiCaL version: 2.1.3
% 0.90/0.44 % (1854803)Termination reason: Instruction limit
% 0.90/0.44 % (1854803)Termination phase: Saturation
% 0.90/0.44 % (1854803)Time elapsed: 0.103 s
% 0.90/0.44 % (1854803)Peak memory usage: 14 MB
% 0.90/0.44 % (1854803)Instructions burned: 160 (million)
% 0.90/0.44 % (1854817)ott-21_1_sil=16000:fs=off:random_seed=1341220217:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 0.90/0.44 % TRYING [5]
% 0.90/0.44 % TRYING [7]
% 0.90/0.44 % (1854813) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1854792-1854813"...
% 0.90/0.44 % (1854813)...printing done.
% 0.90/0.44 % (1854813)Refutation found. Thanks to Tanya!
% 0.90/0.44 % SZS status Theorem for theBenchmark
% 0.90/0.44 % SZS output start Proof for theBenchmark
% See solution above
% 0.90/0.45 % (1854813)------------------------------
% 0.90/0.45 % (1854813)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.90/0.45 % (1854813)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.90/0.45 % (1854813)CaDiCaL version: 2.1.3
% 0.90/0.45 % (1854813)Termination reason: Refutation
% 0.90/0.45 % (1854813)Time elapsed: 0.068 s
% 0.90/0.45 % (1854813)Peak memory usage: 14 MB
% 0.90/0.45 % (1854813)Instructions burned: 106 (million)
% 0.90/0.45 % (1854792)Success in time 0.207 s
% 0.90/0.45 % Vampire exiting
%------------------------------------------------------------------------------