%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV460+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 : n017.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:20 PM UTC 2026
% Result : Theorem 0.21s 0.31s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 10
% Syntax : Number of formulae : 71 ( 22 unt; 3 def)
% Number of atoms : 514 ( 180 equ)
% Maximal formula atoms : 72 ( 7 avg)
% Number of connectives : 680 ( 237 ~; 180 |; 190 &)
% ( 7 <=>; 66 =>; 0 <=; 0 <~>)
% Maximal formula depth : 33 ( 5 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 8 ( 6 usr; 4 prp; 0-2 aty)
% Number of functors : 25 ( 25 usr; 17 con; 0-2 aty)
% Number of variables : 202 ( 2 sgn 192 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] : leq(s(zero),host(X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_02) ).
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(f59,axiom,
! [X0] : ~ leq(s(X0),X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_58) ).
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(f64,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> leq(s(X0),s(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_63) ).
fof(f65,axiom,
! [X0,X1] :
( leq(X0,s(X1))
<=> ( X0 = s(X1)
| leq(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_64) ).
fof(f67,conjecture,
! [X0,X1,X2,X3] :
( ( ! [X4,X5] :
( elem(m_Halt(X5),queue(host(X4)))
=> ~ leq(host(X4),host(X5)) )
& ! [X4] :
( index(status,host(X4)) = elec_2
=> ~ leq(index(pendack,host(X4)),host(X4)) )
& ! [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)
& index(status,host(X5)) = elec_2 )
=> ~ elem(m_Ack(X4,X5),queue(host(X4))) )
& ! [X4] :
( ( ( index(status,host(X4)) = elec_1
| index(status,host(X4)) = elec_2 )
& setIn(X4,alive) )
=> index(elid,host(X4)) = X4 )
& ! [X4,X5] :
( ( setIn(X4,alive)
& setIn(X5,alive)
& setIn(host(X5),index(down,host(X4)))
& index(status,host(X5)) = elec_2 )
=> leq(index(pendack,host(X5)),host(X4)) )
& ! [X4,X6,X5] :
( ( ~ leq(host(X5),host(X4))
& setIn(X4,alive)
& setIn(X5,alive)
& host(X5) = host(X6)
& index(status,host(X5)) = elec_2 )
=> ~ elem(m_Down(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(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,X6,X5] :
( ( setIn(X4,alive)
& setIn(X5,alive)
& elem(m_Down(X6),queue(host(X4)))
& host(X5) = host(X6)
& index(status,host(X5)) = elec_2 )
=> leq(index(pendack,host(X5)),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))) )
& 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] :
( host(X2) = host(X4)
=> ! [X7] :
( host(X2) != host(X7)
=> ( ( ~ leq(host(X4),host(X7))
& setIn(X4,alive)
& setIn(X7,alive)
& index(status,host(X7)) = elec_2 )
=> ~ leq(s(host(X2)),index(pendack,host(X7))) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
fof(f68,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( ! [X4,X5] :
( elem(m_Halt(X5),queue(host(X4)))
=> ~ leq(host(X4),host(X5)) )
& ! [X4] :
( index(status,host(X4)) = elec_2
=> ~ leq(index(pendack,host(X4)),host(X4)) )
& ! [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)
& index(status,host(X5)) = elec_2 )
=> ~ elem(m_Ack(X4,X5),queue(host(X4))) )
& ! [X4] :
( ( ( index(status,host(X4)) = elec_1
| index(status,host(X4)) = elec_2 )
& setIn(X4,alive) )
=> index(elid,host(X4)) = X4 )
& ! [X4,X5] :
( ( setIn(X4,alive)
& setIn(X5,alive)
& setIn(host(X5),index(down,host(X4)))
& index(status,host(X5)) = elec_2 )
=> leq(index(pendack,host(X5)),host(X4)) )
& ! [X4,X6,X5] :
( ( ~ leq(host(X5),host(X4))
& setIn(X4,alive)
& setIn(X5,alive)
& host(X5) = host(X6)
& index(status,host(X5)) = elec_2 )
=> ~ elem(m_Down(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(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,X6,X5] :
( ( setIn(X4,alive)
& setIn(X5,alive)
& elem(m_Down(X6),queue(host(X4)))
& host(X5) = host(X6)
& index(status,host(X5)) = elec_2 )
=> leq(index(pendack,host(X5)),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))) )
& 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] :
( host(X2) = host(X4)
=> ! [X7] :
( host(X2) != host(X7)
=> ( ( ~ leq(host(X4),host(X7))
& setIn(X4,alive)
& setIn(X7,alive)
& index(status,host(X7)) = elec_2 )
=> ~ leq(s(host(X2)),index(pendack,host(X7))) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f67]) ).
fof(f69,plain,
~ ! [X0,X2,X3] :
( ( ! [X4,X5] :
( elem(m_Halt(X5),queue(host(X4)))
=> ~ leq(host(X4),host(X5)) )
& ! [X6] :
( elec_2 = index(status,host(X6))
=> ~ leq(index(pendack,host(X6)),host(X6)) )
& ! [X7,X8,X9] :
( elem(m_Ack(X9,X7),queue(host(X8)))
=> ~ leq(host(X7),host(X9)) )
& ! [X10,X11] :
( ( X10 != X11
& host(X10) = host(X11) )
=> ( ~ setIn(X10,alive)
| ~ setIn(X11,alive) ) )
& ! [X12,X13] :
( ( setIn(X13,alive)
& elec_2 = index(status,host(X13)) )
=> ~ elem(m_Ack(X12,X13),queue(host(X12))) )
& ! [X14] :
( ( ( elec_1 = index(status,host(X14))
| elec_2 = index(status,host(X14)) )
& setIn(X14,alive) )
=> index(elid,host(X14)) = X14 )
& ! [X15,X16] :
( ( setIn(X15,alive)
& setIn(X16,alive)
& setIn(host(X16),index(down,host(X15)))
& elec_2 = index(status,host(X16)) )
=> leq(index(pendack,host(X16)),host(X15)) )
& ! [X17,X18,X19] :
( ( ~ leq(host(X19),host(X17))
& setIn(X17,alive)
& setIn(X19,alive)
& host(X19) = host(X18)
& elec_2 = index(status,host(X19)) )
=> ~ elem(m_Down(X18),queue(host(X17))) )
& ! [X20,X21] :
( ( ~ leq(host(X20),host(X21))
& setIn(X20,alive)
& setIn(X21,alive)
& elec_2 = index(status,host(X20))
& elec_2 = index(status,host(X21)) )
=> leq(index(pendack,host(X21)),host(X20)) )
& ! [X22,X23,X24] :
( ( setIn(X22,alive)
& setIn(X24,alive)
& host(X24) = host(X23)
& elec_2 = index(status,host(X22))
& elec_2 = index(status,host(X24)) )
=> ~ elem(m_Ack(X22,X23),queue(host(X22))) )
& ! [X25,X26,X27] :
( ( setIn(X25,alive)
& setIn(X27,alive)
& elem(m_Down(X26),queue(host(X25)))
& host(X27) = host(X26)
& elec_2 = index(status,host(X27)) )
=> leq(index(pendack,host(X27)),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))) )
& 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))) ) )
=> ( ( ! [X30] :
( ( ~ leq(host(X2),X30)
& leq(s(zero),X30) )
=> ( setIn(X30,index(down,host(X2)))
| host(X3) = X30 ) )
& index(status,host(X2)) = elec_1 )
=> ( ~ leq(nbr_proc,host(X2))
=> ! [X31] :
( host(X2) = host(X31)
=> ! [X32] :
( host(X2) != host(X32)
=> ( ( ~ leq(host(X31),host(X32))
& setIn(X31,alive)
& setIn(X32,alive)
& elec_2 = index(status,host(X32)) )
=> ~ leq(s(host(X2)),index(pendack,host(X32))) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f68]) ).
fof(f85,plain,
? [X0,X2,X3] :
( ? [X31] :
( ? [X32] :
( leq(s(host(X2)),index(pendack,host(X32)))
& ~ leq(host(X31),host(X32))
& setIn(X31,alive)
& setIn(X32,alive)
& elec_2 = index(status,host(X32))
& host(X2) != host(X32) )
& host(X2) = host(X31) )
& ~ leq(nbr_proc,host(X2))
& ! [X30] :
( setIn(X30,index(down,host(X2)))
| host(X3) = X30
| leq(host(X2),X30)
| ~ leq(s(zero),X30) )
& 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_Halt(X5),queue(host(X4))) )
& ! [X6] :
( ~ leq(index(pendack,host(X6)),host(X6))
| elec_2 != index(status,host(X6)) )
& ! [X7,X8,X9] :
( ~ leq(host(X7),host(X9))
| ~ elem(m_Ack(X9,X7),queue(host(X8))) )
& ! [X10,X11] :
( ~ setIn(X10,alive)
| ~ setIn(X11,alive)
| X10 = X11
| host(X10) != host(X11) )
& ! [X12,X13] :
( ~ elem(m_Ack(X12,X13),queue(host(X12)))
| ~ setIn(X13,alive)
| elec_2 != index(status,host(X13)) )
& ! [X14] :
( index(elid,host(X14)) = X14
| ( elec_1 != index(status,host(X14))
& elec_2 != index(status,host(X14)) )
| ~ setIn(X14,alive) )
& ! [X15,X16] :
( leq(index(pendack,host(X16)),host(X15))
| ~ setIn(X15,alive)
| ~ setIn(X16,alive)
| ~ setIn(host(X16),index(down,host(X15)))
| elec_2 != index(status,host(X16)) )
& ! [X17,X18,X19] :
( ~ elem(m_Down(X18),queue(host(X17)))
| leq(host(X19),host(X17))
| ~ setIn(X17,alive)
| ~ setIn(X19,alive)
| host(X19) != host(X18)
| elec_2 != index(status,host(X19)) )
& ! [X20,X21] :
( leq(index(pendack,host(X21)),host(X20))
| leq(host(X20),host(X21))
| ~ setIn(X20,alive)
| ~ setIn(X21,alive)
| elec_2 != index(status,host(X20))
| elec_2 != index(status,host(X21)) )
& ! [X22,X23,X24] :
( ~ elem(m_Ack(X22,X23),queue(host(X22)))
| ~ setIn(X22,alive)
| ~ setIn(X24,alive)
| host(X24) != host(X23)
| elec_2 != index(status,host(X22))
| elec_2 != index(status,host(X24)) )
& ! [X25,X26,X27] :
( leq(index(pendack,host(X27)),host(X25))
| ~ setIn(X25,alive)
| ~ setIn(X27,alive)
| ~ elem(m_Down(X26),queue(host(X25)))
| host(X27) != host(X26)
| 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)) )
& queue(host(X2)) = cons(m_Down(X3),X0) ),
inference(ennf_transformation,[],[f69]) ).
fof(f86,plain,
? [X0,X2,X3] :
( ? [X31] :
( ? [X32] :
( leq(s(host(X2)),index(pendack,host(X32)))
& ~ leq(host(X31),host(X32))
& setIn(X31,alive)
& setIn(X32,alive)
& elec_2 = index(status,host(X32))
& host(X2) != host(X32) )
& host(X2) = host(X31) )
& ~ leq(nbr_proc,host(X2))
& ! [X30] :
( setIn(X30,index(down,host(X2)))
| host(X3) = X30
| leq(host(X2),X30)
| ~ leq(s(zero),X30) )
& 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_Halt(X5),queue(host(X4))) )
& ! [X6] :
( ~ leq(index(pendack,host(X6)),host(X6))
| elec_2 != index(status,host(X6)) )
& ! [X7,X8,X9] :
( ~ leq(host(X7),host(X9))
| ~ elem(m_Ack(X9,X7),queue(host(X8))) )
& ! [X10,X11] :
( ~ setIn(X10,alive)
| ~ setIn(X11,alive)
| X10 = X11
| host(X10) != host(X11) )
& ! [X12,X13] :
( ~ elem(m_Ack(X12,X13),queue(host(X12)))
| ~ setIn(X13,alive)
| elec_2 != index(status,host(X13)) )
& ! [X14] :
( index(elid,host(X14)) = X14
| ( elec_1 != index(status,host(X14))
& elec_2 != index(status,host(X14)) )
| ~ setIn(X14,alive) )
& ! [X15,X16] :
( leq(index(pendack,host(X16)),host(X15))
| ~ setIn(X15,alive)
| ~ setIn(X16,alive)
| ~ setIn(host(X16),index(down,host(X15)))
| elec_2 != index(status,host(X16)) )
& ! [X17,X18,X19] :
( ~ elem(m_Down(X18),queue(host(X17)))
| leq(host(X19),host(X17))
| ~ setIn(X17,alive)
| ~ setIn(X19,alive)
| host(X19) != host(X18)
| elec_2 != index(status,host(X19)) )
& ! [X20,X21] :
( leq(index(pendack,host(X21)),host(X20))
| leq(host(X20),host(X21))
| ~ setIn(X20,alive)
| ~ setIn(X21,alive)
| elec_2 != index(status,host(X20))
| elec_2 != index(status,host(X21)) )
& ! [X22,X23,X24] :
( ~ elem(m_Ack(X22,X23),queue(host(X22)))
| ~ setIn(X22,alive)
| ~ setIn(X24,alive)
| host(X24) != host(X23)
| elec_2 != index(status,host(X22))
| elec_2 != index(status,host(X24)) )
& ! [X25,X26,X27] :
( leq(index(pendack,host(X27)),host(X25))
| ~ setIn(X25,alive)
| ~ setIn(X27,alive)
| ~ elem(m_Down(X26),queue(host(X25)))
| host(X27) != host(X26)
| 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)) )
& 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(f141,plain,
! [X2,X0,X1] :
( X0 != X1
| elem(X0,cons(X1,X2)) ),
inference(cnf_transformation,[],[f47]) ).
fof(f170,plain,
! [X0] : ~ leq(s(X0),X0),
inference(cnf_transformation,[],[f59]) ).
fof(f173,plain,
! [X0,X1] :
( ~ leq(X1,X0)
| ~ leq(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f62]) ).
fof(f177,plain,
! [X0,X1] :
( ~ leq(s(X0),s(X1))
| leq(X0,X1) ),
inference(cnf_transformation,[],[f64]) ).
fof(f180,plain,
! [X0,X1] :
( leq(X0,s(X1))
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f65]) ).
fof(f184,plain,
elec_2 = index(status,host(sK7)),
inference(cnf_transformation,[],[f86]) ).
fof(f185,plain,
setIn(sK7,alive),
inference(cnf_transformation,[],[f86]) ).
fof(f186,plain,
setIn(sK6,alive),
inference(cnf_transformation,[],[f86]) ).
fof(f187,plain,
~ leq(host(sK6),host(sK7)),
inference(cnf_transformation,[],[f86]) ).
fof(f188,plain,
leq(s(host(sK4)),index(pendack,host(sK7))),
inference(cnf_transformation,[],[f86]) ).
fof(f191,plain,
host(sK4) = host(sK6),
inference(cnf_transformation,[],[f86]) ).
fof(f192,plain,
! [X30] :
( setIn(X30,index(down,host(sK4)))
| leq(host(sK4),X30)
| host(sK5) = X30
| ~ leq(s(zero),X30) ),
inference(cnf_transformation,[],[f86]) ).
fof(f198,plain,
! [X16,X15] :
( ~ setIn(host(X16),index(down,host(X15)))
| elec_2 != index(status,host(X16))
| ~ setIn(X16,alive)
| ~ setIn(X15,alive)
| leq(index(pendack,host(X16)),host(X15)) ),
inference(cnf_transformation,[],[f86]) ).
fof(f202,plain,
! [X26,X27,X25] :
( ~ elem(m_Down(X26),queue(host(X25)))
| host(X27) != host(X26)
| elec_2 != index(status,host(X27))
| ~ setIn(X27,alive)
| ~ setIn(X25,alive)
| leq(index(pendack,host(X27)),host(X25)) ),
inference(cnf_transformation,[],[f86]) ).
fof(f206,plain,
queue(host(sK4)) = cons(m_Down(sK5),sK3),
inference(cnf_transformation,[],[f86]) ).
fof(f207,plain,
setIn(sK4,alive),
inference(cnf_transformation,[],[f86]) ).
fof(f217,plain,
! [X2,X1] : elem(X1,cons(X1,X2)),
inference(equality_resolution,[],[f141]) ).
fof(f242,plain,
~ leq(host(sK4),host(sK7)),
inference(superposition,[],[f187,f191]) ).
fof(f278,plain,
! [X0] :
( elec_2 != index(status,host(X0))
| ~ setIn(X0,alive)
| ~ setIn(sK4,alive)
| leq(index(pendack,host(X0)),host(sK4))
| leq(host(sK4),host(X0))
| host(X0) = host(sK5)
| ~ leq(s(zero),host(X0)) ),
inference(resolution,[],[f198,f192]) ).
fof(f283,plain,
! [X0] :
( elec_2 != index(status,host(X0))
| ~ setIn(X0,alive)
| leq(index(pendack,host(X0)),host(sK4))
| leq(host(sK4),host(X0))
| host(X0) = host(sK5)
| ~ leq(s(zero),host(X0)) ),
inference(forward_subsumption_resolution,[],[f278,f207]) ).
fof(f285,plain,
! [X0] :
( ~ setIn(X0,alive)
| elec_2 != index(status,host(X0))
| leq(index(pendack,host(X0)),host(sK4))
| leq(host(sK4),host(X0))
| host(X0) = host(sK5) ),
inference(forward_subsumption_resolution,[],[f283,f90]) ).
fof(f329,plain,
! [X0,X1] :
( ~ elem(m_Down(X0),queue(host(sK4)))
| host(X0) != host(X1)
| elec_2 != index(status,host(X1))
| ~ setIn(X1,alive)
| ~ setIn(sK6,alive)
| leq(index(pendack,host(X1)),host(sK4)) ),
inference(superposition,[],[f202,f191]) ).
fof(f330,plain,
! [X0,X1] :
( ~ elem(m_Down(X0),queue(host(sK4)))
| host(X0) != host(X1)
| elec_2 != index(status,host(X1))
| ~ setIn(X1,alive)
| leq(index(pendack,host(X1)),host(sK4)) ),
inference(forward_subsumption_resolution,[],[f329,f186]) ).
fof(f336,plain,
( elec_2 != index(status,host(sK7))
| leq(index(pendack,host(sK7)),host(sK4))
| leq(host(sK4),host(sK7))
| host(sK7) = host(sK5) ),
inference(resolution,[],[f285,f185]) ).
fof(f341,plain,
( leq(index(pendack,host(sK7)),host(sK4))
| leq(host(sK4),host(sK7))
| host(sK7) = host(sK5) ),
inference(forward_subsumption_resolution,[],[f336,f184]) ).
fof(f343,plain,
( leq(index(pendack,host(sK7)),host(sK4))
| host(sK7) = host(sK5) ),
inference(forward_subsumption_resolution,[],[f341,f242]) ).
fof(f345,definition,
( spl8_5
<=> host(sK7) = host(sK5) ),
introduced(definition,[new_symbols(definition,[spl8_5])],[avatar_definition]) ).
fof(f347,plain,
( host(sK7) = host(sK5)
| ~ spl8_5 ),
inference(avatar_component_clause,[],[f345]) ).
fof(f349,definition,
( spl8_6
<=> leq(index(pendack,host(sK7)),host(sK4)) ),
introduced(definition,[new_symbols(definition,[spl8_6])],[avatar_definition]) ).
fof(f350,plain,
( ~ leq(index(pendack,host(sK7)),host(sK4))
| spl8_6 ),
inference(avatar_component_clause,[],[f349]) ).
fof(f351,plain,
( leq(index(pendack,host(sK7)),host(sK4))
| ~ spl8_6 ),
inference(avatar_component_clause,[],[f349]) ).
fof(f352,plain,
( spl8_5
| spl8_6 ),
inference(avatar_split_clause,[],[f343,f349,f345]) ).
fof(f380,definition,
( spl8_7
<=> leq(index(pendack,host(sK5)),host(sK4)) ),
introduced(definition,[new_symbols(definition,[spl8_7])],[avatar_definition]) ).
fof(f382,plain,
( leq(index(pendack,host(sK5)),host(sK4))
| ~ spl8_7 ),
inference(avatar_component_clause,[],[f380]) ).
fof(f451,plain,
elem(m_Down(sK5),queue(host(sK4))),
inference(superposition,[],[f217,f206]) ).
fof(f452,plain,
! [X0] :
( ~ setIn(X0,alive)
| elec_2 != index(status,host(X0))
| host(X0) != host(sK5)
| leq(index(pendack,host(X0)),host(sK4)) ),
inference(resolution,[],[f451,f330]) ).
fof(f465,plain,
( elec_2 != index(status,host(sK7))
| host(sK7) != host(sK5)
| leq(index(pendack,host(sK7)),host(sK4)) ),
inference(resolution,[],[f452,f185]) ).
fof(f470,plain,
( host(sK7) != host(sK5)
| leq(index(pendack,host(sK7)),host(sK4)) ),
inference(forward_subsumption_resolution,[],[f465,f184]) ).
fof(f472,plain,
( leq(index(pendack,host(sK7)),host(sK4))
| ~ spl8_5 ),
inference(forward_subsumption_resolution,[],[f470,f347]) ).
fof(f473,plain,
( leq(index(pendack,host(sK5)),host(sK4))
| ~ spl8_5 ),
inference(forward_demodulation,[],[f472,f347]) ).
fof(f474,plain,
( spl8_7
| ~ spl8_5 ),
inference(avatar_split_clause,[],[f473,f345,f380]) ).
fof(f551,plain,
! [X0,X1] :
( ~ leq(s(X0),X1)
| leq(X0,X1) ),
inference(resolution,[],[f177,f180]) ).
fof(f572,plain,
leq(host(sK4),index(pendack,host(sK7))),
inference(resolution,[],[f551,f188]) ).
fof(f588,plain,
( ~ leq(host(sK4),index(pendack,host(sK7)))
| host(sK4) = index(pendack,host(sK7))
| ~ spl8_6 ),
inference(resolution,[],[f173,f351]) ).
fof(f604,plain,
( host(sK4) = index(pendack,host(sK7))
| ~ spl8_6 ),
inference(forward_subsumption_resolution,[],[f588,f572]) ).
fof(f691,plain,
( leq(s(host(sK4)),host(sK4))
| ~ spl8_6 ),
inference(superposition,[],[f188,f604]) ).
fof(f694,plain,
( $false
| ~ spl8_6 ),
inference(forward_subsumption_resolution,[],[f691,f170]) ).
fof(f695,plain,
~ spl8_6,
inference(avatar_contradiction_clause,[],[f694]) ).
fof(f696,plain,
( ~ leq(index(pendack,host(sK5)),host(sK4))
| ~ spl8_5
| spl8_6 ),
inference(forward_demodulation,[],[f350,f347]) ).
fof(f702,plain,
( $false
| ~ spl8_5
| spl8_6
| ~ spl8_7 ),
inference(forward_subsumption_resolution,[],[f696,f382]) ).
fof(f703,plain,
( ~ spl8_5
| spl8_6
| ~ spl8_7 ),
inference(avatar_contradiction_clause,[],[f702]) ).
cnf(s3,plain,
( spl8_5
| spl8_6 ),
inference(sat_conversion,[],[f352]) ).
cnf(s6,plain,
( ~ spl8_5
| spl8_7 ),
inference(sat_conversion,[],[f474]) ).
cnf(s11,plain,
~ spl8_6,
inference(sat_conversion,[],[f695]) ).
cnf(s12,plain,
( ~ spl8_5
| spl8_6
| ~ spl8_7 ),
inference(sat_conversion,[],[f703]) ).
cnf(s13,plain,
spl8_5,
inference(rat,[],[s3,s11]) ).
cnf(s14,plain,
~ spl8_7,
inference(rat,[],[s12,s11,s13]) ).
cnf(s15,plain,
$false,
inference(rat,[],[s6,s14,s13]) ).
fof(f705,plain,
$false,
inference(avatar_sat_refutation,[],[s15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV460+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21 % Computer : n017.cluster.edu
% 0.08/0.21 % Model : x86_64 x86_64
% 0.08/0.21 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.21 % Memory : 8046.5625MB
% 0.08/0.21 % OS : Linux 6.8.0-71-generic
% 0.08/0.21 % CPULimit : 300
% 0.08/0.21 % WCLimit : 300
% 0.08/0.21 % DateTime : Mon Sep 28 11:04:36 UTC 2026
% 0.08/0.21 % CPUTime :
% 0.08/0.21 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.24 Running first-order model finding
% 0.08/0.24 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.21/0.31 % (3479654)Will run a generic schedule for satisfiability detection.
% 0.21/0.31 % (3479664)% WARNING: option uhcvi not known.
% 0.21/0.31 % (3479664)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=417872342:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.21/0.31 % (3479666)dis+10_1_sil=32000:sp=arity:random_seed=3523803739:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.21/0.31 % (3479663)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1819809867_2999 on theBenchmark for (2999ds/0Mi)
% 0.21/0.31 % (3479669)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3557757296:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.21/0.31 % (3479665)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1237404700:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.21/0.31 % (3479667)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2567956746:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.21/0.31 % (3479668)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2178378023:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.21/0.31 % Detected minimum model sizes of [4]
% 0.21/0.31 % Detected maximum model sizes of [max]
% 0.21/0.31 % TRYING [4]
% 0.21/0.31 % (3479667) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3479654-3479667"...
% 0.21/0.31 % (3479667)...printing done.
% 0.21/0.31 % (3479664) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3479654-3479664"...
% 0.21/0.31 % (3479667)Refutation found. Thanks to Tanya!
% 0.21/0.31 % SZS status Theorem for theBenchmark
% 0.21/0.31 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.31 % (3479667)------------------------------
% 0.21/0.31 % (3479667)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.31 % (3479667)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.31 % (3479667)CaDiCaL version: 2.1.3
% 0.21/0.31 % (3479667)Termination reason: Refutation
% 0.21/0.31 % (3479667)Time elapsed: 0.020 s
% 0.21/0.31 % (3479667)Peak memory usage: 13 MB
% 0.21/0.31 % (3479667)Instructions burned: 30 (million)
% 0.21/0.31 % (3479654)Success in time 0.061 s
% 0.21/0.31 % Vampire exiting
%------------------------------------------------------------------------------