%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV467+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 : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 01:24:21 PM UTC 2026
% Result : Theorem 9.79s 1.85s
% Output : Refutation 9.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 12
% Syntax : Number of formulae : 110 ( 30 unt; 8 def)
% Number of atoms : 836 ( 292 equ)
% Maximal formula atoms : 98 ( 7 avg)
% Number of connectives : 1167 ( 441 ~; 363 |; 272 &)
% ( 10 <=>; 81 =>; 0 <=; 0 <~>)
% Maximal formula depth : 43 ( 6 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 13 ( 11 usr; 9 prp; 0-2 aty)
% Number of functors : 29 ( 29 usr; 19 con; 0-2 aty)
% Number of variables : 329 ( 2 sgn 311 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0] : leq(host(X0),nbr_proc),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_46) ).
fof(f62,axiom,
! [X0,X1] :
( ( leq(X0,X1)
& leq(X1,X0) )
<=> X0 = X1 ),
file('/export/starexec/sandbox/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] :
( 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] :
( ( X5 != X4
& host(X5) = host(X4) )
=> ( ~ setIn(X4,alive)
| ~ setIn(X5,alive) ) )
& ! [X4,X5] :
( ( setIn(X5,alive)
& elem(m_Ack(X5,X4),queue(host(X5))) )
=> leq(host(X4),index(pendack,host(X5))) )
& ! [X4,X5] :
( ( setIn(X5,alive)
& index(status,host(X5)) = elec_1 )
=> ~ elem(m_Ack(X5,X4),queue(host(X5))) )
& ! [X4] :
( ( ( index(status,host(X4)) = elec_1
| index(status,host(X4)) = elec_2 )
& setIn(X4,alive) )
=> index(elid,host(X4)) = X4 )
& ! [X4,X6,X5] :
( ( setIn(X5,alive)
& elem(m_Down(X6),queue(host(X5)))
& host(X6) = host(X4) )
=> ~ ( setIn(X4,alive)
& index(ldr,host(X4)) = host(X4)
& index(status,host(X4)) = norm ) )
& ! [X4,X5] :
( ( ~ leq(host(X4),host(X5))
& setIn(X4,alive)
& setIn(X5,alive)
& index(status,host(X4)) = elec_2
& index(status,host(X5)) = elec_2 )
=> leq(index(pendack,host(X5)),host(X4)) )
& ! [X4,X6,X5] :
( ( setIn(X4,alive)
& setIn(X5,alive)
& host(X5) = host(X6)
& index(status,host(X4)) = elec_2
& index(status,host(X5)) = elec_2 )
=> ~ elem(m_Ack(X4,X6),queue(host(X4))) )
& ! [X4,X5] :
( ( ~ leq(host(X4),host(X5))
& setIn(X4,alive)
& setIn(X5,alive)
& index(status,host(X4)) = elec_2
& index(status,host(X5)) = elec_2 )
=> ~ leq(index(pendack,host(X4)),index(pendack,host(X5))) )
& ! [X4,X6,X5] :
( ( ~ leq(index(pendack,host(X5)),host(X4))
& setIn(X5,alive)
& elem(m_Halt(X5),queue(host(X6)))
& index(status,host(X5)) = elec_2 )
=> ~ ( setIn(X4,alive)
& index(ldr,host(X4)) = host(X4)
& index(status,host(X4)) = norm ) )
& ! [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))) ) )
& ! [X4,X7,X6,X5] :
( ( setIn(X5,alive)
& elem(m_Down(X6),queue(host(X5)))
& elem(m_Ack(X5,X7),queue(host(X5)))
& leq(nbr_proc,s(index(pendack,host(X5))))
& index(status,host(X5)) = elec_2
& host(X7) = index(pendack,host(X5))
& host(X6) = s(index(pendack,host(X5))) )
=> ~ ( setIn(X4,alive)
& index(ldr,host(X4)) = host(X4)
& index(status,host(X4)) = norm ) )
& 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] :
( ~ setIn(host(X4),setEmpty)
=> ! [X8] :
( host(X2) = host(X8)
=> ! [X9,X10,X11] :
( host(X2) != host(X11)
=> ( ( setIn(X11,alive)
& elem(m_Down(X10),queue(host(X11)))
& elem(m_Ack(X11,X9),queue(host(X11)))
& leq(nbr_proc,s(index(pendack,host(X11))))
& index(status,host(X11)) = elec_2
& host(X9) = index(pendack,host(X11))
& host(X10) = s(index(pendack,host(X11))) )
=> ~ ( setIn(X8,alive)
& host(X2) = host(X8) ) ) ) ) ) ) ) ) ) ) ),
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] :
( 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] :
( ( X5 != X4
& host(X5) = host(X4) )
=> ( ~ setIn(X4,alive)
| ~ setIn(X5,alive) ) )
& ! [X4,X5] :
( ( setIn(X5,alive)
& elem(m_Ack(X5,X4),queue(host(X5))) )
=> leq(host(X4),index(pendack,host(X5))) )
& ! [X4,X5] :
( ( setIn(X5,alive)
& index(status,host(X5)) = elec_1 )
=> ~ elem(m_Ack(X5,X4),queue(host(X5))) )
& ! [X4] :
( ( ( index(status,host(X4)) = elec_1
| index(status,host(X4)) = elec_2 )
& setIn(X4,alive) )
=> index(elid,host(X4)) = X4 )
& ! [X4,X6,X5] :
( ( setIn(X5,alive)
& elem(m_Down(X6),queue(host(X5)))
& host(X6) = host(X4) )
=> ~ ( setIn(X4,alive)
& index(ldr,host(X4)) = host(X4)
& index(status,host(X4)) = norm ) )
& ! [X4,X5] :
( ( ~ leq(host(X4),host(X5))
& setIn(X4,alive)
& setIn(X5,alive)
& index(status,host(X4)) = elec_2
& index(status,host(X5)) = elec_2 )
=> leq(index(pendack,host(X5)),host(X4)) )
& ! [X4,X6,X5] :
( ( setIn(X4,alive)
& setIn(X5,alive)
& host(X5) = host(X6)
& index(status,host(X4)) = elec_2
& index(status,host(X5)) = elec_2 )
=> ~ elem(m_Ack(X4,X6),queue(host(X4))) )
& ! [X4,X5] :
( ( ~ leq(host(X4),host(X5))
& setIn(X4,alive)
& setIn(X5,alive)
& index(status,host(X4)) = elec_2
& index(status,host(X5)) = elec_2 )
=> ~ leq(index(pendack,host(X4)),index(pendack,host(X5))) )
& ! [X4,X6,X5] :
( ( ~ leq(index(pendack,host(X5)),host(X4))
& setIn(X5,alive)
& elem(m_Halt(X5),queue(host(X6)))
& index(status,host(X5)) = elec_2 )
=> ~ ( setIn(X4,alive)
& index(ldr,host(X4)) = host(X4)
& index(status,host(X4)) = norm ) )
& ! [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))) ) )
& ! [X4,X7,X6,X5] :
( ( setIn(X5,alive)
& elem(m_Down(X6),queue(host(X5)))
& elem(m_Ack(X5,X7),queue(host(X5)))
& leq(nbr_proc,s(index(pendack,host(X5))))
& index(status,host(X5)) = elec_2
& host(X7) = index(pendack,host(X5))
& host(X6) = s(index(pendack,host(X5))) )
=> ~ ( setIn(X4,alive)
& index(ldr,host(X4)) = host(X4)
& index(status,host(X4)) = norm ) )
& 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] :
( ~ setIn(host(X4),setEmpty)
=> ! [X8] :
( host(X2) = host(X8)
=> ! [X9,X10,X11] :
( host(X2) != host(X11)
=> ( ( setIn(X11,alive)
& elem(m_Down(X10),queue(host(X11)))
& elem(m_Ack(X11,X9),queue(host(X11)))
& leq(nbr_proc,s(index(pendack,host(X11))))
& index(status,host(X11)) = elec_2
& host(X9) = index(pendack,host(X11))
& host(X10) = s(index(pendack,host(X11))) )
=> ~ ( setIn(X8,alive)
& host(X2) = host(X8) ) ) ) ) ) ) ) ) ) ) ),
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] :
( elem(m_Halt(X9),queue(host(X8)))
=> ~ leq(host(X8),host(X9)) )
& ! [X10,X11,X12] :
( elem(m_Ack(X12,X10),queue(host(X11)))
=> ~ leq(host(X10),host(X12)) )
& ! [X13,X14] :
( ( X13 != X14
& host(X13) = host(X14) )
=> ( ~ setIn(X13,alive)
| ~ setIn(X14,alive) ) )
& ! [X15,X16] :
( ( setIn(X16,alive)
& elem(m_Ack(X16,X15),queue(host(X16))) )
=> leq(host(X15),index(pendack,host(X16))) )
& ! [X17,X18] :
( ( setIn(X18,alive)
& elec_1 = index(status,host(X18)) )
=> ~ elem(m_Ack(X18,X17),queue(host(X18))) )
& ! [X19] :
( ( ( elec_1 = index(status,host(X19))
| elec_2 = index(status,host(X19)) )
& setIn(X19,alive) )
=> index(elid,host(X19)) = X19 )
& ! [X20,X21,X22] :
( ( setIn(X22,alive)
& elem(m_Down(X21),queue(host(X22)))
& host(X20) = host(X21) )
=> ~ ( setIn(X20,alive)
& host(X20) = index(ldr,host(X20))
& norm = index(status,host(X20)) ) )
& ! [X23,X24] :
( ( ~ leq(host(X23),host(X24))
& setIn(X23,alive)
& setIn(X24,alive)
& elec_2 = index(status,host(X23))
& elec_2 = index(status,host(X24)) )
=> leq(index(pendack,host(X24)),host(X23)) )
& ! [X25,X26,X27] :
( ( setIn(X25,alive)
& setIn(X27,alive)
& host(X27) = host(X26)
& elec_2 = index(status,host(X25))
& elec_2 = index(status,host(X27)) )
=> ~ elem(m_Ack(X25,X26),queue(host(X25))) )
& ! [X28,X29] :
( ( ~ leq(host(X28),host(X29))
& setIn(X28,alive)
& setIn(X29,alive)
& elec_2 = index(status,host(X28))
& elec_2 = index(status,host(X29)) )
=> ~ leq(index(pendack,host(X28)),index(pendack,host(X29))) )
& ! [X30,X31,X32] :
( ( ~ leq(index(pendack,host(X32)),host(X30))
& setIn(X32,alive)
& elem(m_Halt(X32),queue(host(X31)))
& elec_2 = index(status,host(X32)) )
=> ~ ( setIn(X30,alive)
& host(X30) = index(ldr,host(X30))
& norm = index(status,host(X30)) ) )
& ! [X33,X34,X35,X36] :
( ( ! [X37] :
( ( ~ leq(host(X36),X37)
& leq(s(zero),X37) )
=> ( setIn(X37,index(down,host(X36)))
| host(X35) = X37 ) )
& elem(m_Down(X35),queue(host(X36)))
& nbr_proc = host(X36)
& host(X36) = host(X34)
& elec_1 = index(status,host(X36)) )
=> ~ ( setIn(X33,alive)
& elem(m_Down(X34),queue(host(X33))) ) )
& ! [X38,X39,X40,X41] :
( ( setIn(X41,alive)
& elem(m_Down(X40),queue(host(X41)))
& elem(m_Ack(X41,X39),queue(host(X41)))
& leq(nbr_proc,s(index(pendack,host(X41))))
& elec_2 = index(status,host(X41))
& index(pendack,host(X41)) = host(X39)
& s(index(pendack,host(X41))) = host(X40) )
=> ~ ( setIn(X38,alive)
& host(X38) = index(ldr,host(X38))
& norm = index(status,host(X38)) ) )
& 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))) ) )
=> ( ( ! [X42] :
( ( ~ leq(host(X2),X42)
& leq(s(zero),X42) )
=> ( setIn(X42,index(down,host(X2)))
| host(X3) = X42 ) )
& index(status,host(X2)) = elec_1 )
=> ( leq(nbr_proc,host(X2))
=> ! [X43] :
( ~ setIn(host(X43),setEmpty)
=> ! [X44] :
( host(X2) = host(X44)
=> ! [X45,X46,X47] :
( host(X2) != host(X47)
=> ( ( setIn(X47,alive)
& elem(m_Down(X46),queue(host(X47)))
& elem(m_Ack(X47,X45),queue(host(X47)))
& leq(nbr_proc,s(index(pendack,host(X47))))
& elec_2 = index(status,host(X47))
& index(pendack,host(X47)) = host(X45)
& s(index(pendack,host(X47))) = host(X46) )
=> ~ ( setIn(X44,alive)
& host(X2) = host(X44) ) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f68]) ).
fof(f85,plain,
? [X0,X2,X3] :
( ? [X43] :
( ? [X44] :
( ? [X45,X46,X47] :
( setIn(X44,alive)
& host(X2) = host(X44)
& setIn(X47,alive)
& elem(m_Down(X46),queue(host(X47)))
& elem(m_Ack(X47,X45),queue(host(X47)))
& leq(nbr_proc,s(index(pendack,host(X47))))
& elec_2 = index(status,host(X47))
& index(pendack,host(X47)) = host(X45)
& s(index(pendack,host(X47))) = host(X46)
& host(X2) != host(X47) )
& host(X2) = host(X44) )
& ~ setIn(host(X43),setEmpty) )
& leq(nbr_proc,host(X2))
& ! [X42] :
( setIn(X42,index(down,host(X2)))
| host(X3) = X42
| leq(host(X2),X42)
| ~ leq(s(zero),X42) )
& 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] :
( ~ 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] :
( ~ leq(host(X8),host(X9))
| ~ elem(m_Halt(X9),queue(host(X8))) )
& ! [X10,X11,X12] :
( ~ leq(host(X10),host(X12))
| ~ elem(m_Ack(X12,X10),queue(host(X11))) )
& ! [X13,X14] :
( ~ setIn(X13,alive)
| ~ setIn(X14,alive)
| X13 = X14
| host(X13) != host(X14) )
& ! [X15,X16] :
( leq(host(X15),index(pendack,host(X16)))
| ~ setIn(X16,alive)
| ~ elem(m_Ack(X16,X15),queue(host(X16))) )
& ! [X17,X18] :
( ~ elem(m_Ack(X18,X17),queue(host(X18)))
| ~ setIn(X18,alive)
| elec_1 != index(status,host(X18)) )
& ! [X19] :
( index(elid,host(X19)) = X19
| ( elec_1 != index(status,host(X19))
& elec_2 != index(status,host(X19)) )
| ~ setIn(X19,alive) )
& ! [X20,X21,X22] :
( ~ setIn(X20,alive)
| host(X20) != index(ldr,host(X20))
| norm != index(status,host(X20))
| ~ setIn(X22,alive)
| ~ elem(m_Down(X21),queue(host(X22)))
| host(X20) != host(X21) )
& ! [X23,X24] :
( leq(index(pendack,host(X24)),host(X23))
| leq(host(X23),host(X24))
| ~ setIn(X23,alive)
| ~ setIn(X24,alive)
| elec_2 != index(status,host(X23))
| elec_2 != index(status,host(X24)) )
& ! [X25,X26,X27] :
( ~ elem(m_Ack(X25,X26),queue(host(X25)))
| ~ setIn(X25,alive)
| ~ setIn(X27,alive)
| host(X27) != host(X26)
| elec_2 != index(status,host(X25))
| elec_2 != index(status,host(X27)) )
& ! [X28,X29] :
( ~ leq(index(pendack,host(X28)),index(pendack,host(X29)))
| leq(host(X28),host(X29))
| ~ setIn(X28,alive)
| ~ setIn(X29,alive)
| elec_2 != index(status,host(X28))
| elec_2 != index(status,host(X29)) )
& ! [X30,X31,X32] :
( ~ setIn(X30,alive)
| host(X30) != index(ldr,host(X30))
| norm != index(status,host(X30))
| leq(index(pendack,host(X32)),host(X30))
| ~ setIn(X32,alive)
| ~ elem(m_Halt(X32),queue(host(X31)))
| elec_2 != index(status,host(X32)) )
& ! [X33,X34,X35,X36] :
( ~ setIn(X33,alive)
| ~ elem(m_Down(X34),queue(host(X33)))
| ? [X37] :
( ~ setIn(X37,index(down,host(X36)))
& host(X35) != X37
& ~ leq(host(X36),X37)
& leq(s(zero),X37) )
| ~ elem(m_Down(X35),queue(host(X36)))
| nbr_proc != host(X36)
| host(X36) != host(X34)
| elec_1 != index(status,host(X36)) )
& ! [X38,X39,X40,X41] :
( ~ setIn(X38,alive)
| host(X38) != index(ldr,host(X38))
| norm != index(status,host(X38))
| ~ setIn(X41,alive)
| ~ elem(m_Down(X40),queue(host(X41)))
| ~ elem(m_Ack(X41,X39),queue(host(X41)))
| ~ leq(nbr_proc,s(index(pendack,host(X41))))
| elec_2 != index(status,host(X41))
| index(pendack,host(X41)) != host(X39)
| s(index(pendack,host(X41))) != host(X40) )
& queue(host(X2)) = cons(m_Down(X3),X0) ),
inference(ennf_transformation,[],[f69]) ).
fof(f86,plain,
? [X0,X2,X3] :
( ? [X43] :
( ? [X44] :
( ? [X45,X46,X47] :
( setIn(X44,alive)
& host(X2) = host(X44)
& setIn(X47,alive)
& elem(m_Down(X46),queue(host(X47)))
& elem(m_Ack(X47,X45),queue(host(X47)))
& leq(nbr_proc,s(index(pendack,host(X47))))
& elec_2 = index(status,host(X47))
& index(pendack,host(X47)) = host(X45)
& s(index(pendack,host(X47))) = host(X46)
& host(X2) != host(X47) )
& host(X2) = host(X44) )
& ~ setIn(host(X43),setEmpty) )
& leq(nbr_proc,host(X2))
& ! [X42] :
( setIn(X42,index(down,host(X2)))
| host(X3) = X42
| leq(host(X2),X42)
| ~ leq(s(zero),X42) )
& 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] :
( ~ 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] :
( ~ leq(host(X8),host(X9))
| ~ elem(m_Halt(X9),queue(host(X8))) )
& ! [X10,X11,X12] :
( ~ leq(host(X10),host(X12))
| ~ elem(m_Ack(X12,X10),queue(host(X11))) )
& ! [X13,X14] :
( ~ setIn(X13,alive)
| ~ setIn(X14,alive)
| X13 = X14
| host(X13) != host(X14) )
& ! [X15,X16] :
( leq(host(X15),index(pendack,host(X16)))
| ~ setIn(X16,alive)
| ~ elem(m_Ack(X16,X15),queue(host(X16))) )
& ! [X17,X18] :
( ~ elem(m_Ack(X18,X17),queue(host(X18)))
| ~ setIn(X18,alive)
| elec_1 != index(status,host(X18)) )
& ! [X19] :
( index(elid,host(X19)) = X19
| ( elec_1 != index(status,host(X19))
& elec_2 != index(status,host(X19)) )
| ~ setIn(X19,alive) )
& ! [X20,X21,X22] :
( ~ setIn(X20,alive)
| host(X20) != index(ldr,host(X20))
| norm != index(status,host(X20))
| ~ setIn(X22,alive)
| ~ elem(m_Down(X21),queue(host(X22)))
| host(X20) != host(X21) )
& ! [X23,X24] :
( leq(index(pendack,host(X24)),host(X23))
| leq(host(X23),host(X24))
| ~ setIn(X23,alive)
| ~ setIn(X24,alive)
| elec_2 != index(status,host(X23))
| elec_2 != index(status,host(X24)) )
& ! [X25,X26,X27] :
( ~ elem(m_Ack(X25,X26),queue(host(X25)))
| ~ setIn(X25,alive)
| ~ setIn(X27,alive)
| host(X27) != host(X26)
| elec_2 != index(status,host(X25))
| elec_2 != index(status,host(X27)) )
& ! [X28,X29] :
( ~ leq(index(pendack,host(X28)),index(pendack,host(X29)))
| leq(host(X28),host(X29))
| ~ setIn(X28,alive)
| ~ setIn(X29,alive)
| elec_2 != index(status,host(X28))
| elec_2 != index(status,host(X29)) )
& ! [X30,X31,X32] :
( ~ setIn(X30,alive)
| host(X30) != index(ldr,host(X30))
| norm != index(status,host(X30))
| leq(index(pendack,host(X32)),host(X30))
| ~ setIn(X32,alive)
| ~ elem(m_Halt(X32),queue(host(X31)))
| elec_2 != index(status,host(X32)) )
& ! [X33,X34,X35,X36] :
( ~ setIn(X33,alive)
| ~ elem(m_Down(X34),queue(host(X33)))
| ? [X37] :
( ~ setIn(X37,index(down,host(X36)))
& host(X35) != X37
& ~ leq(host(X36),X37)
& leq(s(zero),X37) )
| ~ elem(m_Down(X35),queue(host(X36)))
| nbr_proc != host(X36)
| host(X36) != host(X34)
| elec_1 != index(status,host(X36)) )
& ! [X38,X39,X40,X41] :
( ~ setIn(X38,alive)
| host(X38) != index(ldr,host(X38))
| norm != index(status,host(X38))
| ~ setIn(X41,alive)
| ~ elem(m_Down(X40),queue(host(X41)))
| ~ elem(m_Ack(X41,X39),queue(host(X41)))
| ~ leq(nbr_proc,s(index(pendack,host(X41))))
| elec_2 != index(status,host(X41))
| index(pendack,host(X41)) != host(X39)
| s(index(pendack,host(X41))) != host(X40) )
& queue(host(X2)) = cons(m_Down(X3),X0) ),
inference(flattening,[],[f85]) ).
fof(f92,plain,
! [X0] : leq(host(X0),nbr_proc),
inference(cnf_transformation,[],[f5]) ).
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(f184,plain,
s(index(pendack,host(sK11))) = host(sK10),
inference(cnf_transformation,[],[f86]) ).
fof(f185,plain,
index(pendack,host(sK11)) = host(sK9),
inference(cnf_transformation,[],[f86]) ).
fof(f187,plain,
leq(nbr_proc,s(index(pendack,host(sK11)))),
inference(cnf_transformation,[],[f86]) ).
fof(f189,plain,
elem(m_Down(sK10),queue(host(sK11))),
inference(cnf_transformation,[],[f86]) ).
fof(f190,plain,
setIn(sK11,alive),
inference(cnf_transformation,[],[f86]) ).
fof(f194,plain,
! [X36,X34,X35,X33] :
( elec_1 != index(status,host(X36))
| host(X36) != host(X34)
| nbr_proc != host(X36)
| ~ elem(m_Down(X35),queue(host(X36)))
| leq(s(zero),sK7(X35,X36))
| ~ elem(m_Down(X34),queue(host(X33)))
| ~ setIn(X33,alive) ),
inference(cnf_transformation,[],[f86]) ).
fof(f195,plain,
! [X36,X34,X35,X33] :
( elec_1 != index(status,host(X36))
| host(X36) != host(X34)
| nbr_proc != host(X36)
| ~ elem(m_Down(X35),queue(host(X36)))
| ~ leq(host(X36),sK7(X35,X36))
| ~ elem(m_Down(X34),queue(host(X33)))
| ~ setIn(X33,alive) ),
inference(cnf_transformation,[],[f86]) ).
fof(f196,plain,
! [X36,X34,X35,X33] :
( elec_1 != index(status,host(X36))
| host(X36) != host(X34)
| nbr_proc != host(X36)
| ~ elem(m_Down(X35),queue(host(X36)))
| host(X35) != sK7(X35,X36)
| ~ elem(m_Down(X34),queue(host(X33)))
| ~ setIn(X33,alive) ),
inference(cnf_transformation,[],[f86]) ).
fof(f197,plain,
! [X36,X34,X35,X33] :
( elec_1 != index(status,host(X36))
| host(X36) != host(X34)
| nbr_proc != host(X36)
| ~ elem(m_Down(X35),queue(host(X36)))
| ~ setIn(sK7(X35,X36),index(down,host(X36)))
| ~ elem(m_Down(X34),queue(host(X33)))
| ~ setIn(X33,alive) ),
inference(cnf_transformation,[],[f86]) ).
fof(f201,plain,
! [X42] :
( ~ leq(s(zero),X42)
| leq(host(sK4),X42)
| host(sK5) = X42
| setIn(X42,index(down,host(sK4))) ),
inference(cnf_transformation,[],[f86]) ).
fof(f217,plain,
queue(host(sK4)) = cons(m_Down(sK5),sK3),
inference(cnf_transformation,[],[f86]) ).
fof(f220,plain,
elec_1 = index(status,host(sK4)),
inference(cnf_transformation,[],[f86]) ).
fof(f221,plain,
leq(nbr_proc,host(sK4)),
inference(cnf_transformation,[],[f86]) ).
fof(f228,plain,
! [X2,X1] : elem(X1,cons(X1,X2)),
inference(equality_resolution,[],[f141]) ).
fof(f258,plain,
! [X42] :
( ~ leq(s(zero),X42)
| leq(host(sK4),X42)
| host(sK5) = X42
| ~ setIn(X42,index(down,host(sK4))) ),
inference(consistent_polarity_flipping,[],[f201]) ).
fof(f262,plain,
! [X36,X34,X35,X33] :
( nbr_proc != host(X36)
| host(X36) != host(X34)
| elec_1 != index(status,host(X36))
| ~ elem(m_Down(X35),queue(host(X36)))
| setIn(sK7(X35,X36),index(down,host(X36)))
| ~ elem(m_Down(X34),queue(host(X33)))
| setIn(X33,alive) ),
inference(consistent_polarity_flipping,[],[f197]) ).
fof(f263,plain,
! [X36,X34,X35,X33] :
( host(X35) != sK7(X35,X36)
| host(X36) != host(X34)
| nbr_proc != host(X36)
| ~ elem(m_Down(X35),queue(host(X36)))
| elec_1 != index(status,host(X36))
| ~ elem(m_Down(X34),queue(host(X33)))
| setIn(X33,alive) ),
inference(consistent_polarity_flipping,[],[f196]) ).
fof(f264,plain,
! [X36,X34,X35,X33] :
( nbr_proc != host(X36)
| host(X36) != host(X34)
| elec_1 != index(status,host(X36))
| ~ elem(m_Down(X35),queue(host(X36)))
| ~ leq(host(X36),sK7(X35,X36))
| ~ elem(m_Down(X34),queue(host(X33)))
| setIn(X33,alive) ),
inference(consistent_polarity_flipping,[],[f195]) ).
fof(f265,plain,
! [X36,X34,X35,X33] :
( nbr_proc != host(X36)
| host(X36) != host(X34)
| elec_1 != index(status,host(X36))
| ~ elem(m_Down(X35),queue(host(X36)))
| leq(s(zero),sK7(X35,X36))
| ~ elem(m_Down(X34),queue(host(X33)))
| setIn(X33,alive) ),
inference(consistent_polarity_flipping,[],[f194]) ).
fof(f267,plain,
~ setIn(sK11,alive),
inference(consistent_polarity_flipping,[],[f190]) ).
fof(f293,plain,
leq(nbr_proc,s(host(sK9))),
inference(forward_demodulation,[],[f187,f185]) ).
fof(f294,plain,
host(sK10) = s(host(sK9)),
inference(forward_demodulation,[],[f184,f185]) ).
fof(f295,plain,
leq(nbr_proc,host(sK10)),
inference(superposition,[],[f293,f294]) ).
fof(f422,definition,
( spl12_17
<=> nbr_proc = host(sK4) ),
introduced(definition,[new_symbols(definition,[spl12_17])],[avatar_definition]) ).
fof(f423,plain,
( nbr_proc = host(sK4)
| ~ spl12_17 ),
inference(avatar_component_clause,[],[f422]) ).
fof(f491,plain,
elem(m_Down(sK5),queue(host(sK4))),
inference(superposition,[],[f228,f217]) ).
fof(f557,plain,
( ~ leq(host(sK4),nbr_proc)
| nbr_proc = host(sK4) ),
inference(resolution,[],[f173,f221]) ).
fof(f558,plain,
( ~ leq(host(sK10),nbr_proc)
| nbr_proc = host(sK10) ),
inference(resolution,[],[f173,f295]) ).
fof(f562,plain,
nbr_proc = host(sK10),
inference(forward_subsumption_resolution,[],[f558,f92]) ).
fof(f563,plain,
nbr_proc = host(sK4),
inference(forward_subsumption_resolution,[],[f557,f92]) ).
fof(f578,plain,
spl12_17,
inference(avatar_split_clause,[],[f563,f422]) ).
fof(f607,plain,
( elec_1 = index(status,nbr_proc)
| ~ spl12_17 ),
inference(superposition,[],[f220,f423]) ).
fof(f639,plain,
( ! [X2,X0,X1] :
( nbr_proc != nbr_proc
| host(X0) != nbr_proc
| elec_1 != index(status,nbr_proc)
| ~ elem(m_Down(X1),queue(nbr_proc))
| setIn(sK7(X1,sK4),index(down,nbr_proc))
| ~ elem(m_Down(X0),queue(host(X2)))
| setIn(X2,alive) )
| ~ spl12_17 ),
inference(superposition,[],[f262,f423]) ).
fof(f640,plain,
( ! [X2,X0,X1] :
( nbr_proc != nbr_proc
| host(X0) != nbr_proc
| elec_1 != index(status,nbr_proc)
| ~ elem(m_Down(X1),queue(nbr_proc))
| ~ leq(nbr_proc,sK7(X1,sK4))
| ~ elem(m_Down(X0),queue(host(X2)))
| setIn(X2,alive) )
| ~ spl12_17 ),
inference(superposition,[],[f264,f423]) ).
fof(f641,plain,
( ! [X2,X0,X1] :
( nbr_proc != nbr_proc
| host(X0) != nbr_proc
| elec_1 != index(status,nbr_proc)
| ~ elem(m_Down(X1),queue(nbr_proc))
| leq(s(zero),sK7(X1,sK4))
| ~ elem(m_Down(X0),queue(host(X2)))
| setIn(X2,alive) )
| ~ spl12_17 ),
inference(superposition,[],[f265,f423]) ).
fof(f647,plain,
( ! [X2,X0,X1] :
( host(X0) != nbr_proc
| elec_1 != index(status,nbr_proc)
| ~ elem(m_Down(X1),queue(nbr_proc))
| leq(s(zero),sK7(X1,sK4))
| ~ elem(m_Down(X0),queue(host(X2)))
| setIn(X2,alive) )
| ~ spl12_17 ),
inference(trivial_inequality_removal,[],[f641]) ).
fof(f648,plain,
( ! [X2,X0,X1] :
( host(X0) != nbr_proc
| elec_1 != index(status,nbr_proc)
| ~ elem(m_Down(X1),queue(nbr_proc))
| ~ leq(nbr_proc,sK7(X1,sK4))
| ~ elem(m_Down(X0),queue(host(X2)))
| setIn(X2,alive) )
| ~ spl12_17 ),
inference(trivial_inequality_removal,[],[f640]) ).
fof(f649,plain,
( ! [X2,X0,X1] :
( host(X0) != nbr_proc
| elec_1 != index(status,nbr_proc)
| ~ elem(m_Down(X1),queue(nbr_proc))
| setIn(sK7(X1,sK4),index(down,nbr_proc))
| ~ elem(m_Down(X0),queue(host(X2)))
| setIn(X2,alive) )
| ~ spl12_17 ),
inference(trivial_inequality_removal,[],[f639]) ).
fof(f652,definition,
( spl12_32
<=> ! [X1] :
( ~ elem(m_Down(X1),queue(nbr_proc))
| leq(s(zero),sK7(X1,sK4)) ) ),
introduced(definition,[new_symbols(definition,[spl12_32])],[avatar_definition]) ).
fof(f653,plain,
( ! [X1] :
( ~ elem(m_Down(X1),queue(nbr_proc))
| leq(s(zero),sK7(X1,sK4)) )
| ~ spl12_32 ),
inference(avatar_component_clause,[],[f652]) ).
fof(f655,definition,
( spl12_33
<=> elec_1 = index(status,nbr_proc) ),
introduced(definition,[new_symbols(definition,[spl12_33])],[avatar_definition]) ).
fof(f659,definition,
( spl12_34
<=> ! [X2,X0] :
( host(X0) != nbr_proc
| setIn(X2,alive)
| ~ elem(m_Down(X0),queue(host(X2))) ) ),
introduced(definition,[new_symbols(definition,[spl12_34])],[avatar_definition]) ).
fof(f660,plain,
( ! [X2,X0] :
( host(X0) != nbr_proc
| setIn(X2,alive)
| ~ elem(m_Down(X0),queue(host(X2))) )
| ~ spl12_34 ),
inference(avatar_component_clause,[],[f659]) ).
fof(f661,plain,
( spl12_32
| ~ spl12_33
| spl12_34
| ~ spl12_17 ),
inference(avatar_split_clause,[],[f647,f422,f659,f655,f652]) ).
fof(f663,definition,
( spl12_35
<=> ! [X1] :
( ~ elem(m_Down(X1),queue(nbr_proc))
| ~ leq(nbr_proc,sK7(X1,sK4)) ) ),
introduced(definition,[new_symbols(definition,[spl12_35])],[avatar_definition]) ).
fof(f664,plain,
( ! [X1] :
( ~ elem(m_Down(X1),queue(nbr_proc))
| ~ leq(nbr_proc,sK7(X1,sK4)) )
| ~ spl12_35 ),
inference(avatar_component_clause,[],[f663]) ).
fof(f665,plain,
( spl12_35
| ~ spl12_33
| spl12_34
| ~ spl12_17 ),
inference(avatar_split_clause,[],[f648,f422,f659,f655,f663]) ).
fof(f667,definition,
( spl12_36
<=> ! [X1] :
( ~ elem(m_Down(X1),queue(nbr_proc))
| setIn(sK7(X1,sK4),index(down,nbr_proc)) ) ),
introduced(definition,[new_symbols(definition,[spl12_36])],[avatar_definition]) ).
fof(f668,plain,
( ! [X1] :
( setIn(sK7(X1,sK4),index(down,nbr_proc))
| ~ elem(m_Down(X1),queue(nbr_proc)) )
| ~ spl12_36 ),
inference(avatar_component_clause,[],[f667]) ).
fof(f669,plain,
( spl12_36
| ~ spl12_33
| spl12_34
| ~ spl12_17 ),
inference(avatar_split_clause,[],[f649,f422,f659,f655,f667]) ).
fof(f682,plain,
( spl12_33
| ~ spl12_17 ),
inference(avatar_split_clause,[],[f607,f422,f655]) ).
fof(f928,plain,
( elem(m_Down(sK5),queue(nbr_proc))
| ~ spl12_17 ),
inference(forward_demodulation,[],[f491,f423]) ).
fof(f2449,plain,
( ! [X0] :
( nbr_proc != nbr_proc
| setIn(X0,alive)
| ~ elem(m_Down(sK10),queue(host(X0))) )
| ~ spl12_34 ),
inference(superposition,[],[f660,f562]) ).
fof(f2450,plain,
( ! [X0] :
( ~ elem(m_Down(sK10),queue(host(X0)))
| setIn(X0,alive) )
| ~ spl12_34 ),
inference(trivial_inequality_removal,[],[f2449]) ).
fof(f14710,plain,
( ~ leq(nbr_proc,sK7(sK5,sK4))
| ~ spl12_17
| ~ spl12_35 ),
inference(resolution,[],[f664,f928]) ).
fof(f14715,plain,
( leq(s(zero),sK7(sK5,sK4))
| ~ spl12_17
| ~ spl12_32 ),
inference(resolution,[],[f653,f928]) ).
fof(f14789,definition,
( spl12_222
<=> host(sK5) = sK7(sK5,sK4) ),
introduced(definition,[new_symbols(definition,[spl12_222])],[avatar_definition]) ).
fof(f14791,plain,
( host(sK5) = sK7(sK5,sK4)
| ~ spl12_222 ),
inference(avatar_component_clause,[],[f14789]) ).
fof(f14793,definition,
( spl12_223
<=> setIn(sK7(sK5,sK4),index(down,nbr_proc)) ),
introduced(definition,[new_symbols(definition,[spl12_223])],[avatar_definition]) ).
fof(f14795,plain,
( ~ setIn(sK7(sK5,sK4),index(down,nbr_proc))
| spl12_223 ),
inference(avatar_component_clause,[],[f14793]) ).
fof(f14855,plain,
( leq(host(sK4),sK7(sK5,sK4))
| host(sK5) = sK7(sK5,sK4)
| ~ setIn(sK7(sK5,sK4),index(down,host(sK4)))
| ~ spl12_17
| ~ spl12_32 ),
inference(resolution,[],[f14715,f258]) ).
fof(f14887,plain,
( leq(nbr_proc,sK7(sK5,sK4))
| host(sK5) = sK7(sK5,sK4)
| ~ setIn(sK7(sK5,sK4),index(down,host(sK4)))
| ~ spl12_17
| ~ spl12_32 ),
inference(forward_demodulation,[],[f14855,f423]) ).
fof(f14888,plain,
( host(sK5) = sK7(sK5,sK4)
| ~ setIn(sK7(sK5,sK4),index(down,host(sK4)))
| ~ spl12_17
| ~ spl12_32
| ~ spl12_35 ),
inference(forward_subsumption_resolution,[],[f14887,f14710]) ).
fof(f14889,plain,
( ~ setIn(sK7(sK5,sK4),index(down,nbr_proc))
| host(sK5) = sK7(sK5,sK4)
| ~ spl12_17
| ~ spl12_32
| ~ spl12_35 ),
inference(forward_demodulation,[],[f14888,f423]) ).
fof(f14890,plain,
( spl12_222
| ~ spl12_223
| ~ spl12_17
| ~ spl12_32
| ~ spl12_35 ),
inference(avatar_split_clause,[],[f14889,f663,f652,f422,f14793,f14789]) ).
fof(f18047,plain,
( ~ elem(m_Down(sK5),queue(nbr_proc))
| ~ spl12_36
| spl12_223 ),
inference(resolution,[],[f14795,f668]) ).
fof(f18048,plain,
( $false
| ~ spl12_17
| ~ spl12_36
| spl12_223 ),
inference(forward_subsumption_resolution,[],[f18047,f928]) ).
fof(f18049,plain,
( ~ spl12_17
| ~ spl12_36
| spl12_223 ),
inference(avatar_contradiction_clause,[],[f18048]) ).
fof(f18213,plain,
( setIn(sK11,alive)
| ~ spl12_34 ),
inference(resolution,[],[f2450,f189]) ).
fof(f18218,plain,
( $false
| ~ spl12_34 ),
inference(forward_subsumption_resolution,[],[f18213,f267]) ).
fof(f18219,plain,
~ spl12_34,
inference(avatar_contradiction_clause,[],[f18218]) ).
fof(f50779,plain,
( ! [X0,X1] :
( host(sK5) != host(sK5)
| host(X0) != host(sK4)
| nbr_proc != host(sK4)
| ~ elem(m_Down(sK5),queue(host(sK4)))
| elec_1 != index(status,host(sK4))
| ~ elem(m_Down(X0),queue(host(X1)))
| setIn(X1,alive) )
| ~ spl12_222 ),
inference(superposition,[],[f263,f14791]) ).
fof(f50780,plain,
( ! [X0,X1] :
( host(X0) != host(sK4)
| nbr_proc != host(sK4)
| ~ elem(m_Down(sK5),queue(host(sK4)))
| elec_1 != index(status,host(sK4))
| ~ elem(m_Down(X0),queue(host(X1)))
| setIn(X1,alive) )
| ~ spl12_222 ),
inference(trivial_inequality_removal,[],[f50779]) ).
fof(f50781,plain,
( ! [X0,X1] :
( host(X0) != host(sK4)
| ~ elem(m_Down(sK5),queue(host(sK4)))
| elec_1 != index(status,host(sK4))
| ~ elem(m_Down(X0),queue(host(X1)))
| setIn(X1,alive) )
| ~ spl12_17
| ~ spl12_222 ),
inference(forward_subsumption_resolution,[],[f50780,f423]) ).
fof(f50783,plain,
( ! [X0,X1] :
( host(X0) != host(sK4)
| ~ elem(m_Down(sK5),queue(host(sK4)))
| ~ elem(m_Down(X0),queue(host(X1)))
| setIn(X1,alive) )
| ~ spl12_17
| ~ spl12_222 ),
inference(forward_subsumption_resolution,[],[f50781,f220]) ).
fof(f50784,plain,
( ! [X0,X1] :
( host(X0) != nbr_proc
| ~ elem(m_Down(sK5),queue(host(sK4)))
| ~ elem(m_Down(X0),queue(host(X1)))
| setIn(X1,alive) )
| ~ spl12_17
| ~ spl12_222 ),
inference(forward_demodulation,[],[f50783,f423]) ).
fof(f50785,plain,
( ! [X0,X1] :
( ~ elem(m_Down(sK5),queue(nbr_proc))
| host(X0) != nbr_proc
| ~ elem(m_Down(X0),queue(host(X1)))
| setIn(X1,alive) )
| ~ spl12_17
| ~ spl12_222 ),
inference(forward_demodulation,[],[f50784,f423]) ).
fof(f50786,plain,
( ! [X0,X1] :
( host(X0) != nbr_proc
| ~ elem(m_Down(X0),queue(host(X1)))
| setIn(X1,alive) )
| ~ spl12_17
| ~ spl12_222 ),
inference(forward_subsumption_resolution,[],[f50785,f928]) ).
fof(f50787,plain,
( spl12_34
| ~ spl12_17
| ~ spl12_222 ),
inference(avatar_split_clause,[],[f50786,f14789,f422,f659]) ).
cnf(s21,plain,
spl12_17,
inference(sat_conversion,[],[f578]) ).
cnf(s24,plain,
( ~ spl12_17
| spl12_32
| ~ spl12_33
| spl12_34 ),
inference(sat_conversion,[],[f661]) ).
cnf(s25,plain,
( ~ spl12_17
| ~ spl12_33
| spl12_34
| spl12_35 ),
inference(sat_conversion,[],[f665]) ).
cnf(s26,plain,
( ~ spl12_17
| ~ spl12_33
| spl12_34
| spl12_36 ),
inference(sat_conversion,[],[f669]) ).
cnf(s27,plain,
( ~ spl12_17
| spl12_33 ),
inference(sat_conversion,[],[f682]) ).
cnf(s484,plain,
( ~ spl12_17
| ~ spl12_32
| ~ spl12_35
| spl12_222
| ~ spl12_223 ),
inference(sat_conversion,[],[f14890]) ).
cnf(s792,plain,
( ~ spl12_17
| ~ spl12_36
| spl12_223 ),
inference(sat_conversion,[],[f18049]) ).
cnf(s811,plain,
~ spl12_34,
inference(sat_conversion,[],[f18219]) ).
cnf(s2981,plain,
( ~ spl12_17
| spl12_34
| ~ spl12_222 ),
inference(sat_conversion,[],[f50787]) ).
cnf(s3042,plain,
( ~ spl12_17
| ~ spl12_33
| spl12_36 ),
inference(rat,[],[s26,s811]) ).
cnf(s3043,plain,
( ~ spl12_17
| ~ spl12_33
| spl12_35 ),
inference(rat,[],[s25,s811]) ).
cnf(s3044,plain,
( ~ spl12_17
| spl12_32
| ~ spl12_33 ),
inference(rat,[],[s24,s811]) ).
cnf(s3045,plain,
~ spl12_222,
inference(rat,[],[s2981,s811,s21]) ).
cnf(s3049,plain,
spl12_33,
inference(rat,[],[s27,s21]) ).
cnf(s3050,plain,
spl12_32,
inference(rat,[],[s3044,s3049,s21]) ).
cnf(s3056,plain,
spl12_36,
inference(rat,[],[s3042,s21,s3049]) ).
cnf(s3057,plain,
spl12_35,
inference(rat,[],[s3043,s21,s3049]) ).
cnf(s3058,plain,
spl12_223,
inference(rat,[],[s792,s21,s3056]) ).
cnf(s3059,plain,
$false,
inference(rat,[],[s484,s3050,s3045,s21,s3058,s3057]) ).
fof(f50788,plain,
$false,
inference(avatar_sat_refutation,[],[s3059]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV467+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.09/0.19 % Computer : n009.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Mon Sep 28 11:10:15 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22 Running first-order model finding
% 0.09/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
% 9.79/1.85 % (2967108)Will run a generic schedule for satisfiability detection.
% 9.79/1.85 % (2967118)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1587419124:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 9.79/1.85 % (2967114)% WARNING: option uhcvi not known.
% 9.79/1.85 % (2967113)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1299354732_2999 on theBenchmark for (2999ds/0Mi)
% 9.79/1.85 % (2967114)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2793594683:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 9.79/1.85 % (2967115)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3796562989:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 9.79/1.85 % (2967116)dis+10_1_sil=32000:sp=arity:random_seed=2633408128:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 9.79/1.85 % (2967117)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=531437695:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 9.79/1.85 % (2967119)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=45638738:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 9.79/1.85 % Detected minimum model sizes of [4]
% 9.79/1.85 % Detected maximum model sizes of [max]
% 9.79/1.85 % TRYING [4]
% 9.79/1.85 % (2967118)Instruction limit reached!
% 9.79/1.85 % (2967118)------------------------------
% 9.79/1.85 % (2967118)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 9.79/1.85 % (2967118)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.79/1.85 % (2967118)CaDiCaL version: 2.1.3
% 9.79/1.85 % (2967118)Termination reason: Instruction limit
% 9.79/1.85 % (2967118)Termination phase: Saturation
% 9.79/1.85 % (2967118)Time elapsed: 0.046 s
% 9.79/1.85 % (2967118)Peak memory usage: 13 MB
% 9.79/1.85 % (2967118)Instructions burned: 133 (million)
% 9.79/1.85 % TRYING [5]
% 9.79/1.85 % (2967127)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=654536784:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 9.79/1.85 % Detected minimum model sizes of [4]
% 9.79/1.85 % Detected maximum model sizes of [max]
% 9.79/1.85 % TRYING [4]
% 9.79/1.85 % (2967117)Instruction limit reached!
% 9.79/1.85 % (2967117)------------------------------
% 9.79/1.85 % (2967117)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 9.79/1.85 % (2967117)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.79/1.85 % (2967117)CaDiCaL version: 2.1.3
% 9.79/1.85 % (2967117)Termination reason: Instruction limit
% 9.79/1.85 % (2967117)Termination phase: Saturation
% 9.79/1.85 % (2967117)Time elapsed: 0.071 s
% 9.79/1.85 % (2967117)Peak memory usage: 12 MB
% 9.79/1.85 % (2967117)Instructions burned: 116 (million)
% 9.79/1.85 % (2967116)Instruction limit reached!
% 9.79/1.85 % (2967116)------------------------------
% 9.79/1.85 % (2967116)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 9.79/1.85 % (2967116)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.79/1.85 % (2967116)CaDiCaL version: 2.1.3
% 9.79/1.85 % (2967116)Termination reason: Instruction limit
% 9.79/1.85 % (2967116)Termination phase: Saturation
% 9.79/1.85 % (2967116)Time elapsed: 0.071 s
% 9.79/1.85 % (2967116)Peak memory usage: 13 MB
% 9.79/1.85 % (2967116)Instructions burned: 104 (million)
% 9.79/1.85 % TRYING [5]
% 9.79/1.85 % (2967129)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=231212760:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 9.79/1.85 % TRYING [6]
% 9.79/1.85 % (2967130)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=3662685197:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 9.79/1.85 % (2967119)Instruction limit reached!
% 9.79/1.85 % (2967119)------------------------------
% 9.79/1.85 % (2967119)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 9.79/1.85 % (2967119)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.79/1.85 % (2967119)CaDiCaL version: 2.1.3
% 9.79/1.85 % (2967119)Termination reason: Instruction limit
% 9.79/1.85 % (2967119)Termination phase: Saturation
% 9.79/1.85 % (2967119)Time elapsed: 0.104 s
% 9.79/1.85 % (2967119)Peak memory usage: 13 MB
% 9.79/1.85 % (2967119)Instructions burned: 160 (million)
% 9.79/1.85 % TRYING [6]
% 9.79/1.85 % (2967133)ott-21_1_sil=16000:fs=off:random_seed=4156561208:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 9.79/1.85 % (2967129)Instruction limit reached!
% 9.79/1.85 % (2967129)------------------------------
% 9.79/1.85 % (2967129)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 9.79/1.85 % (2967129)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.79/1.85 % (2967129)CaDiCaL version: 2.1.3
% 9.79/1.85 % (2967129)Termination reason: Instruction limit
% 9.79/1.85 % (2967129)Termination phase: Saturation
% 9.79/1.85 % (2967129)Time elapsed: 0.089 s
% 9.79/1.85 % (2967129)Peak memory usage: 13 MB
% 9.79/1.85 % (2967129)Instructions burned: 131 (million)
% 9.79/1.85 % TRYING [7]
% 9.79/1.85 % (2967135)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2033689336:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 9.79/1.85 % (2967133)Instruction limit reached!
% 9.79/1.85 % (2967133)------------------------------
% 9.79/1.85 % (2967133)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 9.79/1.85 % (2967133)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.79/1.85 % (2967133)CaDiCaL version: 2.1.3
% 9.79/1.85 % (2967133)Termination reason: Instruction limit
% 9.79/1.85 % (2967133)Termination phase: Saturation
% 9.79/1.85 % (2967133)Time elapsed: 0.097 s
% 9.79/1.85 % (2967133)Peak memory usage: 13 MB
% 9.79/1.85 % (2967133)Instructions burned: 181 (million)
% 9.79/1.85 % TRYING [7]
% 9.79/1.85 % (2967127)Instruction limit reached!
% 9.79/1.85 % (2967127)------------------------------
% 9.79/1.85 % (2967127)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 9.79/1.85 % (2967127)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.79/1.85 % (2967127)CaDiCaL version: 2.1.3
% 9.79/1.85 % (2967127)Termination reason: Instruction limit
% 9.79/1.85 % (2967127)Termination phase: Finite model building constraint generation
% 9.79/1.85 % (2967127)Time elapsed: 0.173 s
% 9.79/1.85 % (2967127)Peak memory usage: 29 MB
% 9.79/1.85 % (2967127)Instructions burned: 721 (million)
% 9.79/1.85 % (2967137)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2150880015:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 9.79/1.85 % (2967138)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=772577901:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 9.79/1.85 % Detected minimum model sizes of [4]
% 9.79/1.85 % Detected maximum model sizes of [max]
% 9.79/1.85 % TRYING [4]
% 9.79/1.85 % TRYING [5]
% 9.79/1.85 % TRYING [8]
% 9.79/1.85 % TRYING [6]
% 9.79/1.85 % (2967130)Instruction limit reached!
% 9.79/1.85 % (2967130)------------------------------
% 9.79/1.85 % (2967130)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 9.79/1.85 % (2967130)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.79/1.85 % (2967130)CaDiCaL version: 2.1.3
% 9.79/1.85 % (2967130)Termination reason: Instruction limit
% 9.79/1.85 % (2967130)Termination phase: Saturation
% 9.79/1.85 % (2967130)Time elapsed: 0.387 s
% 9.79/1.85 % (2967130)Peak memory usage: 16 MB
% 9.79/1.85 % (2967130)Instructions burned: 684 (million)
% 9.79/1.85 % (2967141)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=2643659075:i=889:ins=1_2994 on theBenchmark for (2994ds/889Mi)
% 9.79/1.85 % (2967135)Instruction limit reached!
% 9.79/1.85 % (2967135)------------------------------
% 9.79/1.85 % (2967135)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 9.79/1.85 % (2967135)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.79/1.85 % (2967135)CaDiCaL version: 2.1.3
% 9.79/1.85 % (2967135)Termination reason: Instruction limit
% 9.79/1.85 % (2967135)Termination phase: Saturation
% 9.79/1.85 % (2967135)Time elapsed: 0.313 s
% 9.79/1.85 % (2967135)Peak memory usage: 14 MB
% 9.79/1.85 % (2967135)Instructions burned: 479 (million)
% 9.79/1.85 % (2967143)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=1341640249: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)
% 9.79/1.85 % TRYING [14]
% 9.79/1.85 % (2967137)Instruction limit reached!
% 9.79/1.85 % (2967137)------------------------------
% 9.79/1.85 % (2967137)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 9.79/1.85 % (2967137)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.79/1.85 % (2967137)CaDiCaL version: 2.1.3
% 9.79/1.85 % (2967137)Termination reason: Instruction limit
% 9.79/1.85 % (2967137)Termination phase: Finite model building SAT solving
% 9.79/1.85 % (2967137)Time elapsed: 0.331 s
% 9.79/1.85 % (2967137)Peak memory usage: 23 MB
% 9.79/1.85 % (2967137)Instructions burned: 868 (million)
% 9.79/1.85 % (2967145)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=2174434555:i=879:kws=inv_precedence:fsr=off_2993 on theBenchmark for (2993ds/879Mi)
% 9.79/1.85 % (2967138)Instruction limit reached!
% 9.79/1.85 % (2967138)------------------------------
% 9.79/1.85 % (2967138)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 9.79/1.85 % (2967138)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.79/1.85 % (2967138)CaDiCaL version: 2.1.3
% 9.79/1.85 % (2967138)Termination reason: Instruction limit
% 9.79/1.85 % (2967138)Termination phase: Saturation
% 9.79/1.85 % (2967138)Time elapsed: 0.387 s
% 9.79/1.85 % (2967138)Peak memory usage: 20 MB
% 9.79/1.85 % (2967138)Instructions burned: 1179 (million)
% 9.79/1.85 % (2967147)fmb+10_1_sil=64000:random_seed=3694814530:i=22061:nm=2:gsp=on_2993 on theBenchmark for (2993ds/22061Mi)
% 9.79/1.85 % Detected minimum model sizes of [4]
% 9.79/1.85 % Detected maximum model sizes of [max]
% 9.79/1.85 % TRYING [4]
% 9.79/1.85 % TRYING [5]
% 9.79/1.85 % TRYING [9]
% 9.79/1.85 % TRYING [6]
% 9.79/1.85 % (2967141)Instruction limit reached!
% 9.79/1.85 % (2967141)------------------------------
% 9.79/1.85 % (2967141)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 9.79/1.85 % (2967141)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.79/1.85 % (2967141)CaDiCaL version: 2.1.3
% 9.79/1.85 % (2967141)Termination reason: Instruction limit
% 9.79/1.85 % (2967141)Termination phase: Finite model building constraint generation
% 9.79/1.85 % (2967141)Time elapsed: 0.327 s
% 9.79/1.85 % (2967141)Peak memory usage: 76 MB
% 9.79/1.85 % (2967141)Instructions burned: 891 (million)
% 9.79/1.85 % TRYING [7]
% 9.79/1.85 % (2967149)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=2920905011:i=9515:nm=5_2991 on theBenchmark for (2991ds/9515Mi)
% 9.79/1.85 % Detected minimum model sizes of [4]
% 9.79/1.85 % Detected maximum model sizes of [max]
% 9.79/1.85 % TRYING [20]
% 9.79/1.85 % (2967143)Instruction limit reached!
% 9.79/1.85 % (2967143)------------------------------
% 9.79/1.85 % (2967143)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 9.79/1.85 % (2967143)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.79/1.85 % (2967143)CaDiCaL version: 2.1.3
% 9.79/1.85 % (2967143)Termination reason: Instruction limit
% 9.79/1.85 % (2967143)Termination phase: Saturation
% 9.79/1.85 % (2967143)Time elapsed: 0.337 s
% 9.79/1.85 % (2967143)Peak memory usage: 34 MB
% 9.79/1.85 % (2967143)Instructions burned: 693 (million)
% 9.79/1.85 % (2967151)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=3992702568:fmbsr=1.7:i=920_2990 on theBenchmark for (2990ds/920Mi)
% 9.79/1.85 % Detected minimum model sizes of [4]
% 9.79/1.85 % Detected maximum model sizes of [max]
% 9.79/1.85 % TRYING [8]
% 9.79/1.85 % TRYING [8]
% 9.79/1.85 % (2967145)Instruction limit reached!
% 9.79/1.85 % (2967145)------------------------------
% 9.79/1.85 % (2967145)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 9.79/1.85 % (2967145)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.79/1.85 % (2967145)CaDiCaL version: 2.1.3
% 9.79/1.85 % (2967145)Termination reason: Instruction limit
% 9.79/1.85 % (2967145)Termination phase: Saturation
% 9.79/1.85 % (2967145)Time elapsed: 0.494 s
% 9.79/1.85 % (2967145)Peak memory usage: 21 MB
% 9.79/1.85 % (2967145)Instructions burned: 880 (million)
% 9.79/1.85 % (2967153)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=1002429924:i=5131_2988 on theBenchmark for (2988ds/5131Mi)
% 9.79/1.85 % TRYING [9]
% 9.79/1.85 % (2967151)Instruction limit reached!
% 9.79/1.85 % (2967151)------------------------------
% 9.79/1.85 % (2967151)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 9.79/1.85 % (2967151)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.79/1.85 % (2967151)CaDiCaL version: 2.1.3
% 9.79/1.85 % (2967151)Termination reason: Instruction limit
% 9.79/1.85 % (2967151)Termination phase: Finite model building SAT solving
% 9.79/1.85 % (2967151)Time elapsed: 0.416 s
% 9.79/1.85 % (2967151)Peak memory usage: 59 MB
% 9.79/1.85 % (2967151)Instructions burned: 920 (million)
% 9.79/1.85 % (2967155)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=1980275786:i=1472:ins=7:fdi=8:gsp=on_2986 on theBenchmark for (2986ds/1472Mi)
% 9.79/1.85 % (2967114) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2967108-2967114"...
% 9.79/1.85 % (2967114)...printing done.
% 9.79/1.85 % (2967114)Refutation found. Thanks to Tanya!
% 9.79/1.85 % SZS status Theorem for theBenchmark
% 9.79/1.85 % SZS output start Proof for theBenchmark
% See solution above
% 9.79/1.86 % (2967114)------------------------------
% 9.79/1.86 % (2967114)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 9.79/1.86 % (2967114)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.79/1.86 % (2967114)CaDiCaL version: 2.1.3
% 9.79/1.86 % (2967114)Termination reason: Refutation
% 9.79/1.86 % (2967114)Time elapsed: 1.562 s
% 9.79/1.86 % (2967114)Peak memory usage: 24 MB
% 9.79/1.86 % (2967114)Instructions burned: 2595 (million)
% 9.79/1.86 % (2967108)Success in time 1.62 s
% 9.79/1.86 % Vampire exiting
%------------------------------------------------------------------------------