%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWV455+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n019.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 01:15:51 PM UTC 2026
% Result : Theorem 2.94s 1.07s
% Output : Refutation 3.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 2
% Syntax : Number of formulae : 37 ( 17 unt; 0 def)
% Number of atoms : 398 ( 164 equ)
% Maximal formula atoms : 46 ( 10 avg)
% Number of connectives : 601 ( 240 ~; 130 |; 179 &)
% ( 1 <=>; 51 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 8 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 25 ( 25 usr; 17 con; 0-2 aty)
% Number of variables : 213 ( 189 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f47,axiom,
! [X0,X1,X2] :
( elem(X0,cons(X1,X2))
<=> ( X0 = X1
| elem(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_46) ).
fof(f67,conjecture,
! [X0,X1,X2,X3] :
( ( ! [X4,X5] :
( setIn(X5,alive)
=> ~ elem(m_Down(X5),queue(host(X4))) )
& ! [X4,X5] :
( elem(m_Down(X5),queue(host(X4)))
=> ~ setIn(X5,alive) )
& ! [X4,X5] :
( elem(m_Down(X5),queue(host(X4)))
=> host(X5) != host(X4) )
& ! [X4,X5] :
( elem(m_Halt(X5),queue(host(X4)))
=> ~ leq(host(X4),host(X5)) )
& ! [X4,X6,X5] :
( elem(m_Ack(X5,X4),queue(host(X6)))
=> ~ leq(host(X4),host(X5)) )
& ! [X4,X5] :
( ( ~ setIn(X4,alive)
& leq(X5,X4)
& host(X5) = host(X4) )
=> ~ setIn(X5,alive) )
& ! [X4,X5] :
( ( X5 != X4
& host(X5) = host(X4) )
=> ( ~ setIn(X4,alive)
| ~ setIn(X5,alive) ) )
& ! [X4,X7,X6,X5] :
( ( host(X6) != host(X4)
& setIn(X4,alive)
& setIn(X6,alive)
& host(X7) = host(X4)
& host(X5) = host(X6) )
=> ~ ( elem(m_Down(X5),queue(host(X4)))
& elem(m_Down(X7),queue(host(X6))) ) )
& queue(host(X2)) = cons(m_Down(X3),X0) )
=> ( setIn(X2,alive)
=> ( ~ leq(host(X2),host(X3))
=> ( ~ ( ( index(ldr,host(X2)) = host(X3)
& index(status,host(X2)) = norm )
| ( index(status,host(X2)) = wait
& host(X3) = host(index(elid,host(X2))) ) )
=> ( ~ ( ! [X4] :
( ( ~ leq(host(X2),X4)
& leq(s(zero),X4) )
=> ( setIn(X4,index(down,host(X2)))
| X4 = host(X3) ) )
& index(status,host(X2)) = elec_1 )
=> ! [X4] :
( host(X2) != host(X4)
=> ! [X8,X9] :
( host(X2) = host(X9)
=> ! [X10] :
( ( host(X9) != host(X4)
& setIn(X4,alive)
& setIn(X9,alive)
& host(X8) = host(X4)
& host(X10) = host(X9) )
=> ~ ( elem(m_Down(X8),X0)
& elem(m_Down(X10),queue(host(X4))) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
fof(f68,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( ! [X4,X5] :
( setIn(X5,alive)
=> ~ elem(m_Down(X5),queue(host(X4))) )
& ! [X4,X5] :
( elem(m_Down(X5),queue(host(X4)))
=> ~ setIn(X5,alive) )
& ! [X4,X5] :
( elem(m_Down(X5),queue(host(X4)))
=> host(X5) != host(X4) )
& ! [X4,X5] :
( elem(m_Halt(X5),queue(host(X4)))
=> ~ leq(host(X4),host(X5)) )
& ! [X4,X6,X5] :
( elem(m_Ack(X5,X4),queue(host(X6)))
=> ~ leq(host(X4),host(X5)) )
& ! [X4,X5] :
( ( ~ setIn(X4,alive)
& leq(X5,X4)
& host(X5) = host(X4) )
=> ~ setIn(X5,alive) )
& ! [X4,X5] :
( ( X5 != X4
& host(X5) = host(X4) )
=> ( ~ setIn(X4,alive)
| ~ setIn(X5,alive) ) )
& ! [X4,X7,X6,X5] :
( ( host(X6) != host(X4)
& setIn(X4,alive)
& setIn(X6,alive)
& host(X7) = host(X4)
& host(X5) = host(X6) )
=> ~ ( elem(m_Down(X5),queue(host(X4)))
& elem(m_Down(X7),queue(host(X6))) ) )
& queue(host(X2)) = cons(m_Down(X3),X0) )
=> ( setIn(X2,alive)
=> ( ~ leq(host(X2),host(X3))
=> ( ~ ( ( index(ldr,host(X2)) = host(X3)
& index(status,host(X2)) = norm )
| ( index(status,host(X2)) = wait
& host(X3) = host(index(elid,host(X2))) ) )
=> ( ~ ( ! [X4] :
( ( ~ leq(host(X2),X4)
& leq(s(zero),X4) )
=> ( setIn(X4,index(down,host(X2)))
| X4 = host(X3) ) )
& index(status,host(X2)) = elec_1 )
=> ! [X4] :
( host(X2) != host(X4)
=> ! [X8,X9] :
( host(X2) = host(X9)
=> ! [X10] :
( ( host(X9) != host(X4)
& setIn(X4,alive)
& setIn(X9,alive)
& host(X8) = host(X4)
& host(X10) = host(X9) )
=> ~ ( elem(m_Down(X8),X0)
& elem(m_Down(X10),queue(host(X4))) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f67]) ).
fof(f69,plain,
~ ! [X0,X2,X3] :
( ( ! [X4,X5] :
( setIn(X5,alive)
=> ~ elem(m_Down(X5),queue(host(X4))) )
& ! [X6,X7] :
( elem(m_Down(X7),queue(host(X6)))
=> ~ setIn(X7,alive) )
& ! [X8,X9] :
( elem(m_Down(X9),queue(host(X8)))
=> host(X9) != host(X8) )
& ! [X10,X11] :
( elem(m_Halt(X11),queue(host(X10)))
=> ~ leq(host(X10),host(X11)) )
& ! [X12,X13,X14] :
( elem(m_Ack(X14,X12),queue(host(X13)))
=> ~ leq(host(X12),host(X14)) )
& ! [X15,X16] :
( ( ~ setIn(X15,alive)
& leq(X16,X15)
& host(X15) = host(X16) )
=> ~ setIn(X16,alive) )
& ! [X17,X18] :
( ( X17 != X18
& host(X17) = host(X18) )
=> ( ~ setIn(X17,alive)
| ~ setIn(X18,alive) ) )
& ! [X19,X20,X21,X22] :
( ( host(X19) != host(X21)
& setIn(X19,alive)
& setIn(X21,alive)
& host(X19) = host(X20)
& host(X21) = host(X22) )
=> ~ ( elem(m_Down(X22),queue(host(X19)))
& elem(m_Down(X20),queue(host(X21))) ) )
& queue(host(X2)) = cons(m_Down(X3),X0) )
=> ( setIn(X2,alive)
=> ( ~ leq(host(X2),host(X3))
=> ( ~ ( ( index(ldr,host(X2)) = host(X3)
& index(status,host(X2)) = norm )
| ( index(status,host(X2)) = wait
& host(X3) = host(index(elid,host(X2))) ) )
=> ( ~ ( ! [X23] :
( ( ~ leq(host(X2),X23)
& leq(s(zero),X23) )
=> ( setIn(X23,index(down,host(X2)))
| host(X3) = X23 ) )
& index(status,host(X2)) = elec_1 )
=> ! [X24] :
( host(X2) != host(X24)
=> ! [X25,X26] :
( host(X2) = host(X26)
=> ! [X27] :
( ( host(X24) != host(X26)
& setIn(X24,alive)
& setIn(X26,alive)
& host(X24) = host(X25)
& host(X26) = host(X27) )
=> ~ ( elem(m_Down(X25),X0)
& elem(m_Down(X27),queue(host(X24))) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f68]) ).
fof(f70,plain,
? [X0,X2,X3] :
( ? [X24] :
( ? [X25,X26] :
( ? [X27] :
( elem(m_Down(X25),X0)
& elem(m_Down(X27),queue(host(X24)))
& host(X24) != host(X26)
& setIn(X24,alive)
& setIn(X26,alive)
& host(X24) = host(X25)
& host(X26) = host(X27) )
& host(X2) = host(X26) )
& host(X2) != host(X24) )
& ( ? [X23] :
( ~ setIn(X23,index(down,host(X2)))
& host(X3) != X23
& ~ leq(host(X2),X23)
& leq(s(zero),X23) )
| 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] :
( ~ elem(m_Down(X5),queue(host(X4)))
| ~ setIn(X5,alive) )
& ! [X6,X7] :
( ~ setIn(X7,alive)
| ~ elem(m_Down(X7),queue(host(X6))) )
& ! [X8,X9] :
( host(X9) != host(X8)
| ~ elem(m_Down(X9),queue(host(X8))) )
& ! [X10,X11] :
( ~ leq(host(X10),host(X11))
| ~ elem(m_Halt(X11),queue(host(X10))) )
& ! [X12,X13,X14] :
( ~ leq(host(X12),host(X14))
| ~ elem(m_Ack(X14,X12),queue(host(X13))) )
& ! [X15,X16] :
( ~ setIn(X16,alive)
| setIn(X15,alive)
| ~ leq(X16,X15)
| host(X15) != host(X16) )
& ! [X17,X18] :
( ~ setIn(X17,alive)
| ~ setIn(X18,alive)
| X17 = X18
| host(X17) != host(X18) )
& ! [X19,X20,X21,X22] :
( ~ elem(m_Down(X22),queue(host(X19)))
| ~ elem(m_Down(X20),queue(host(X21)))
| host(X19) = host(X21)
| ~ setIn(X19,alive)
| ~ setIn(X21,alive)
| host(X19) != host(X20)
| host(X21) != host(X22) )
& queue(host(X2)) = cons(m_Down(X3),X0) ),
inference(ennf_transformation,[],[f69]) ).
fof(f71,plain,
? [X0,X2,X3] :
( ? [X24] :
( ? [X25,X26] :
( ? [X27] :
( elem(m_Down(X25),X0)
& elem(m_Down(X27),queue(host(X24)))
& host(X24) != host(X26)
& setIn(X24,alive)
& setIn(X26,alive)
& host(X24) = host(X25)
& host(X26) = host(X27) )
& host(X2) = host(X26) )
& host(X2) != host(X24) )
& ( ? [X23] :
( ~ setIn(X23,index(down,host(X2)))
& host(X3) != X23
& ~ leq(host(X2),X23)
& leq(s(zero),X23) )
| 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] :
( ~ elem(m_Down(X5),queue(host(X4)))
| ~ setIn(X5,alive) )
& ! [X6,X7] :
( ~ setIn(X7,alive)
| ~ elem(m_Down(X7),queue(host(X6))) )
& ! [X8,X9] :
( host(X9) != host(X8)
| ~ elem(m_Down(X9),queue(host(X8))) )
& ! [X10,X11] :
( ~ leq(host(X10),host(X11))
| ~ elem(m_Halt(X11),queue(host(X10))) )
& ! [X12,X13,X14] :
( ~ leq(host(X12),host(X14))
| ~ elem(m_Ack(X14,X12),queue(host(X13))) )
& ! [X15,X16] :
( ~ setIn(X16,alive)
| setIn(X15,alive)
| ~ leq(X16,X15)
| host(X15) != host(X16) )
& ! [X17,X18] :
( ~ setIn(X17,alive)
| ~ setIn(X18,alive)
| X17 = X18
| host(X17) != host(X18) )
& ! [X19,X20,X21,X22] :
( ~ elem(m_Down(X22),queue(host(X19)))
| ~ elem(m_Down(X20),queue(host(X21)))
| host(X19) = host(X21)
| ~ setIn(X19,alive)
| ~ setIn(X21,alive)
| host(X19) != host(X20)
| host(X21) != host(X22) )
& queue(host(X2)) = cons(m_Down(X3),X0) ),
inference(flattening,[],[f70]) ).
fof(f78,plain,
? [X0,X1,X2] :
( ? [X3] :
( ? [X4,X5] :
( ? [X6] :
( elem(m_Down(X4),X0)
& elem(m_Down(X6),queue(host(X3)))
& host(X5) != host(X3)
& setIn(X3,alive)
& setIn(X5,alive)
& host(X4) = host(X3)
& host(X5) = host(X6) )
& host(X1) = host(X5) )
& host(X1) != host(X3) )
& ( ? [X7] :
( ~ setIn(X7,index(down,host(X1)))
& host(X2) != X7
& ~ leq(host(X1),X7)
& leq(s(zero),X7) )
| elec_1 != index(status,host(X1)) )
& ( host(X2) != index(ldr,host(X1))
| norm != index(status,host(X1)) )
& ( wait != index(status,host(X1))
| host(X2) != host(index(elid,host(X1))) )
& ~ leq(host(X1),host(X2))
& setIn(X1,alive)
& ! [X8,X9] :
( ~ elem(m_Down(X9),queue(host(X8)))
| ~ setIn(X9,alive) )
& ! [X10,X11] :
( ~ setIn(X11,alive)
| ~ elem(m_Down(X11),queue(host(X10))) )
& ! [X12,X13] :
( host(X13) != host(X12)
| ~ elem(m_Down(X13),queue(host(X12))) )
& ! [X14,X15] :
( ~ leq(host(X14),host(X15))
| ~ elem(m_Halt(X15),queue(host(X14))) )
& ! [X16,X17,X18] :
( ~ leq(host(X16),host(X18))
| ~ elem(m_Ack(X18,X16),queue(host(X17))) )
& ! [X19,X20] :
( ~ setIn(X20,alive)
| setIn(X19,alive)
| ~ leq(X20,X19)
| host(X19) != host(X20) )
& ! [X21,X22] :
( ~ setIn(X21,alive)
| ~ setIn(X22,alive)
| X21 = X22
| host(X21) != host(X22) )
& ! [X23,X24,X25,X26] :
( ~ elem(m_Down(X26),queue(host(X23)))
| ~ elem(m_Down(X24),queue(host(X25)))
| host(X25) = host(X23)
| ~ setIn(X23,alive)
| ~ setIn(X25,alive)
| host(X24) != host(X23)
| host(X26) != host(X25) )
& queue(host(X1)) = cons(m_Down(X2),X0) ),
inference(rectify,[],[f71]) ).
fof(f79,plain,
( elem(m_Down(sK4),sK0)
& elem(m_Down(sK6),queue(host(sK3)))
& host(sK3) != host(sK5)
& setIn(sK3,alive)
& setIn(sK5,alive)
& host(sK3) = host(sK4)
& host(sK5) = host(sK6)
& host(sK5) = host(sK1)
& host(sK3) != host(sK1)
& ( ( ~ setIn(sK7,index(down,host(sK1)))
& sK7 != host(sK2)
& ~ leq(host(sK1),sK7)
& leq(s(zero),sK7) )
| elec_1 != index(status,host(sK1)) )
& ( host(sK2) != index(ldr,host(sK1))
| norm != index(status,host(sK1)) )
& ( wait != index(status,host(sK1))
| host(sK2) != host(index(elid,host(sK1))) )
& ~ leq(host(sK1),host(sK2))
& setIn(sK1,alive)
& ! [X8,X9] :
( ~ elem(m_Down(X9),queue(host(X8)))
| ~ setIn(X9,alive) )
& ! [X10,X11] :
( ~ setIn(X11,alive)
| ~ elem(m_Down(X11),queue(host(X10))) )
& ! [X12,X13] :
( host(X13) != host(X12)
| ~ elem(m_Down(X13),queue(host(X12))) )
& ! [X14,X15] :
( ~ leq(host(X14),host(X15))
| ~ elem(m_Halt(X15),queue(host(X14))) )
& ! [X16,X17,X18] :
( ~ leq(host(X16),host(X18))
| ~ elem(m_Ack(X18,X16),queue(host(X17))) )
& ! [X19,X20] :
( ~ setIn(X20,alive)
| setIn(X19,alive)
| ~ leq(X20,X19)
| host(X19) != host(X20) )
& ! [X21,X22] :
( ~ setIn(X21,alive)
| ~ setIn(X22,alive)
| X21 = X22
| host(X21) != host(X22) )
& ! [X23,X24,X25,X26] :
( ~ elem(m_Down(X26),queue(host(X23)))
| ~ elem(m_Down(X24),queue(host(X25)))
| host(X25) = host(X23)
| ~ setIn(X23,alive)
| ~ setIn(X25,alive)
| host(X24) != host(X23)
| host(X26) != host(X25) )
& queue(host(sK1)) = cons(m_Down(sK2),sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6,sK7]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4),skolemize(X5,sK5),skolemize(X6,sK6),skolemize(X7,sK7)],[f78]) ).
fof(f82,plain,
! [X0,X1,X2] :
( ( elem(X0,cons(X1,X2))
| ( X0 != X1
& ~ elem(X0,X2) ) )
& ( X0 = X1
| elem(X0,X2)
| ~ elem(X0,cons(X1,X2)) ) ),
inference(nnf_transformation,[],[f47]) ).
fof(f83,plain,
! [X0,X1,X2] :
( ( elem(X0,cons(X1,X2))
| ( X0 != X1
& ~ elem(X0,X2) ) )
& ( X0 = X1
| elem(X0,X2)
| ~ elem(X0,cons(X1,X2)) ) ),
inference(flattening,[],[f82]) ).
fof(f91,plain,
queue(host(sK1)) = cons(m_Down(sK2),sK0),
inference(cnf_transformation,[],[f79]) ).
fof(f92,plain,
! [X26,X24,X25,X23] :
( host(X26) != host(X25)
| ~ elem(m_Down(X24),queue(host(X25)))
| host(X25) = host(X23)
| ~ setIn(X23,alive)
| ~ setIn(X25,alive)
| host(X24) != host(X23)
| ~ elem(m_Down(X26),queue(host(X23))) ),
inference(cnf_transformation,[],[f79]) ).
fof(f109,plain,
host(sK5) = host(sK1),
inference(cnf_transformation,[],[f79]) ).
fof(f110,plain,
host(sK5) = host(sK6),
inference(cnf_transformation,[],[f79]) ).
fof(f111,plain,
host(sK3) = host(sK4),
inference(cnf_transformation,[],[f79]) ).
fof(f112,plain,
setIn(sK5,alive),
inference(cnf_transformation,[],[f79]) ).
fof(f113,plain,
setIn(sK3,alive),
inference(cnf_transformation,[],[f79]) ).
fof(f114,plain,
host(sK3) != host(sK5),
inference(cnf_transformation,[],[f79]) ).
fof(f115,plain,
elem(m_Down(sK6),queue(host(sK3))),
inference(cnf_transformation,[],[f79]) ).
fof(f116,plain,
elem(m_Down(sK4),sK0),
inference(cnf_transformation,[],[f79]) ).
fof(f125,plain,
! [X2,X0,X1] :
( elem(X0,cons(X1,X2))
| ~ elem(X0,X2) ),
inference(cnf_transformation,[],[f83]) ).
fof(f165,plain,
host(sK3) != host(sK6),
inference(forward_demodulation,[],[f114,f110]) ).
fof(f166,plain,
host(sK4) != host(sK6),
inference(forward_demodulation,[],[f165,f111]) ).
fof(f167,plain,
elem(m_Down(sK6),queue(host(sK4))),
inference(forward_demodulation,[],[f115,f111]) ).
fof(f171,plain,
cons(m_Down(sK2),sK0) = queue(host(sK5)),
inference(forward_demodulation,[],[f91,f109]) ).
fof(f172,plain,
cons(m_Down(sK2),sK0) = queue(host(sK6)),
inference(forward_demodulation,[],[f171,f110]) ).
fof(f294,plain,
! [X2,X0,X1] :
( host(X0) != host(sK4)
| ~ elem(m_Down(X1),queue(host(sK4)))
| host(X2) = host(sK4)
| ~ setIn(X2,alive)
| ~ setIn(sK3,alive)
| host(X1) != host(X2)
| ~ elem(m_Down(X0),queue(host(X2))) ),
inference(superposition,[],[f92,f111]) ).
fof(f296,plain,
! [X2,X0,X1] :
( host(X1) != host(X2)
| ~ elem(m_Down(X1),queue(host(sK4)))
| host(X2) = host(sK4)
| ~ setIn(X2,alive)
| host(X0) != host(sK4)
| ~ elem(m_Down(X0),queue(host(X2))) ),
inference(forward_subsumption_resolution,[],[f294,f113]) ).
fof(f308,plain,
! [X0,X1] :
( host(X0) != host(sK6)
| ~ elem(m_Down(X0),queue(host(sK4)))
| host(sK4) = host(sK6)
| ~ setIn(sK5,alive)
| host(X1) != host(sK4)
| ~ elem(m_Down(X1),queue(host(sK6))) ),
inference(superposition,[],[f296,f110]) ).
fof(f310,plain,
! [X0,X1] :
( host(X0) != host(sK6)
| ~ elem(m_Down(X0),queue(host(sK4)))
| ~ setIn(sK5,alive)
| host(X1) != host(sK4)
| ~ elem(m_Down(X1),queue(host(sK6))) ),
inference(forward_subsumption_resolution,[],[f308,f166]) ).
fof(f313,plain,
! [X0,X1] :
( host(X1) != host(sK4)
| ~ elem(m_Down(X0),queue(host(sK4)))
| host(X0) != host(sK6)
| ~ elem(m_Down(X1),queue(host(sK6))) ),
inference(forward_subsumption_resolution,[],[f310,f112]) ).
fof(f322,plain,
! [X0] :
( host(X0) != host(sK6)
| ~ elem(m_Down(X0),queue(host(sK4)))
| ~ elem(m_Down(sK4),queue(host(sK6))) ),
inference(equality_resolution,[],[f313]) ).
fof(f327,plain,
( ~ elem(m_Down(sK6),queue(host(sK4)))
| ~ elem(m_Down(sK4),queue(host(sK6))) ),
inference(equality_resolution,[],[f322]) ).
fof(f329,plain,
~ elem(m_Down(sK4),queue(host(sK6))),
inference(forward_subsumption_resolution,[],[f327,f167]) ).
fof(f377,plain,
! [X0] :
( elem(X0,queue(host(sK6)))
| ~ elem(X0,sK0) ),
inference(superposition,[],[f125,f172]) ).
fof(f381,plain,
~ elem(m_Down(sK4),sK0),
inference(resolution,[],[f377,f329]) ).
fof(f387,plain,
$false,
inference(forward_subsumption_resolution,[],[f381,f116]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWV455+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.25 % Computer : n019.cluster.edu
% 0.10/0.25 % Model : x86_64 x86_64
% 0.10/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.25 % Memory : 8046.5625MB
% 0.10/0.25 % OS : Linux 6.8.0-71-generic
% 0.10/0.25 % CPULimit : 300
% 0.10/0.25 % WCLimit : 300
% 0.10/0.25 % DateTime : Mon Sep 28 11:09:03 UTC 2026
% 0.10/0.25 % CPUTime :
% 0.10/0.25 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.31 Running first-order theorem proving
% 0.24/0.31 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.94/1.07 % (3940064)Detected formulas, will run a generic FOF schedule.
% 2.94/1.07 % (3940073)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1505370773:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.94/1.07 % (3940073)First to succeed.
% 2.94/1.07 % (3940073)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3940064"
% 2.94/1.07 % (3940074)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=656445136:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.94/1.07 % (3940074)Also succeeded, but the first one will report.
% 2.94/1.07 % (3940069)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=4259687006:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.94/1.07 % (3940071)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=1397939359:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.94/1.07 % (3940070)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=2597568366:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.94/1.07 % (3940072)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1286964480:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.94/1.07 % (3940072)Also succeeded, but the first one will report.
% 2.94/1.07 % (3940075)dis-21_1_sil=8000:lcm=predicate:random_seed=117871145:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 2.94/1.07 % (3940073)Refutation found. Thanks to Tanya!
% 2.94/1.07 % SZS status Theorem for theBenchmark
% 2.94/1.07 % SZS output start Proof for theBenchmark
% See solution above
% 3.33/1.26 % (3940073)------------------------------
% 3.33/1.26 % (3940073)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.33/1.26 % (3940073)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.33/1.26 % (3940073)CaDiCaL version: 2.1.3
% 3.33/1.26 % (3940073)Termination reason: Refutation
% 3.33/1.26 % (3940073)Time elapsed: 0.006 s
% 3.33/1.26 % (3940073)Peak memory usage: 88 MB
% 3.33/1.26 % (3940073)Instructions burned: 16 (million)
% 3.33/1.26 % (3940073)------------------------------
% 3.33/1.26 % (3940073)------------------------------
% 3.33/1.26 % (3940064)Success in time 0.38 s
% 3.33/1.26 % Vampire exiting
%------------------------------------------------------------------------------