%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV455+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n002.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 : Fri Sep 25 03:22:12 PM UTC 2026
% Result : Theorem 3.10s 11.11s
% Output : CNFRefutation 3.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 12
% Syntax : Number of formulae : 70 ( 45 unt; 10 def)
% Number of atoms : 519 ( 196 equ)
% Maximal formula atoms : 46 ( 7 avg)
% Number of connectives : 646 ( 263 ~; 152 |; 179 &)
% ( 1 <=>; 51 =>; 0 <=; 0 <~>)
% Maximal formula depth : 34 ( 6 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 15 ( 13 usr; 11 prp; 0-2 aty)
% Number of functors : 25 ( 25 usr; 17 con; 0-2 aty)
% Number of variables : 229 ( 2 sgn 205 !; 24 ?; 30 :)
% Comments :
%------------------------------------------------------------------------------
fof(f47,axiom,
! [X0,X1,X2] :
( elem(X0,cons(X1,X2))
<=> ( elem(X0,X2)
| X0 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_46) ).
fof(f67,conjecture,
! [X0,X1,X2,X3] :
( ( queue(host(X2)) = cons(m_Down(X3),X0)
& ! [X4,X7,X6,X5] :
( ( host(X5) = host(X6)
& host(X7) = host(X4)
& setIn(X6,alive)
& setIn(X4,alive)
& host(X6) != host(X4) )
=> ~ ( elem(m_Down(X7),queue(host(X6)))
& elem(m_Down(X5),queue(host(X4))) ) )
& ! [X4,X5] :
( ( host(X5) = host(X4)
& X5 != X4 )
=> ( ~ setIn(X5,alive)
| ~ setIn(X4,alive) ) )
& ! [X4,X5] :
( ( host(X5) = host(X4)
& leq(X5,X4)
& ~ setIn(X4,alive) )
=> ~ setIn(X5,alive) )
& ! [X4,X6,X5] :
( elem(m_Ack(X5,X4),queue(host(X6)))
=> ~ leq(host(X4),host(X5)) )
& ! [X4,X5] :
( elem(m_Halt(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_Down(X5),queue(host(X4)))
=> ~ setIn(X5,alive) )
& ! [X4,X5] :
( setIn(X5,alive)
=> ~ elem(m_Down(X5),queue(host(X4))) ) )
=> ( setIn(X2,alive)
=> ( ~ leq(host(X2),host(X3))
=> ( ~ ( ( host(X3) = host(index(elid,host(X2)))
& index(status,host(X2)) = wait )
| ( index(status,host(X2)) = norm
& index(ldr,host(X2)) = host(X3) ) )
=> ( ~ ( index(status,host(X2)) = elec_1
& ! [X4] :
( ( leq(s(zero),X4)
& ~ leq(host(X2),X4) )
=> ( X4 = host(X3)
| setIn(X4,index(down,host(X2))) ) ) )
=> ! [X4] :
( host(X2) != host(X4)
=> ! [X8,X9] :
( host(X2) = host(X9)
=> ! [X10] :
( ( host(X10) = host(X9)
& host(X8) = host(X4)
& setIn(X9,alive)
& setIn(X4,alive)
& host(X9) != host(X4) )
=> ~ ( elem(m_Down(X10),queue(host(X4)))
& elem(m_Down(X8),X0) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
fof(f68,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( queue(host(X2)) = cons(m_Down(X3),X0)
& ! [X4,X7,X6,X5] :
( ( host(X5) = host(X6)
& host(X7) = host(X4)
& setIn(X6,alive)
& setIn(X4,alive)
& host(X6) != host(X4) )
=> ~ ( elem(m_Down(X7),queue(host(X6)))
& elem(m_Down(X5),queue(host(X4))) ) )
& ! [X4,X5] :
( ( host(X5) = host(X4)
& X5 != X4 )
=> ( ~ setIn(X5,alive)
| ~ setIn(X4,alive) ) )
& ! [X4,X5] :
( ( host(X5) = host(X4)
& leq(X5,X4)
& ~ setIn(X4,alive) )
=> ~ setIn(X5,alive) )
& ! [X4,X6,X5] :
( elem(m_Ack(X5,X4),queue(host(X6)))
=> ~ leq(host(X4),host(X5)) )
& ! [X4,X5] :
( elem(m_Halt(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_Down(X5),queue(host(X4)))
=> ~ setIn(X5,alive) )
& ! [X4,X5] :
( setIn(X5,alive)
=> ~ elem(m_Down(X5),queue(host(X4))) ) )
=> ( setIn(X2,alive)
=> ( ~ leq(host(X2),host(X3))
=> ( ~ ( ( host(X3) = host(index(elid,host(X2)))
& index(status,host(X2)) = wait )
| ( index(status,host(X2)) = norm
& index(ldr,host(X2)) = host(X3) ) )
=> ( ~ ( index(status,host(X2)) = elec_1
& ! [X4] :
( ( leq(s(zero),X4)
& ~ leq(host(X2),X4) )
=> ( X4 = host(X3)
| setIn(X4,index(down,host(X2))) ) ) )
=> ! [X4] :
( host(X2) != host(X4)
=> ! [X8,X9] :
( host(X2) = host(X9)
=> ! [X10] :
( ( host(X10) = host(X9)
& host(X8) = host(X4)
& setIn(X9,alive)
& setIn(X4,alive)
& host(X9) != host(X4) )
=> ~ ( elem(m_Down(X10),queue(host(X4)))
& elem(m_Down(X8),X0) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f67]) ).
fof(f69,plain,
~ ! [X0,X2,X3] :
( ( queue(host(X2)) = cons(m_Down(X3),X0)
& ! [X19,X20,X21,X22] :
( ( host(X21) = host(X22)
& host(X19) = host(X20)
& setIn(X21,alive)
& setIn(X19,alive)
& host(X19) != host(X21) )
=> ~ ( elem(m_Down(X20),queue(host(X21)))
& elem(m_Down(X22),queue(host(X19))) ) )
& ! [X17,X18] :
( ( host(X17) = host(X18)
& X17 != X18 )
=> ( ~ setIn(X18,alive)
| ~ setIn(X17,alive) ) )
& ! [X15,X16] :
( ( host(X15) = host(X16)
& leq(X16,X15)
& ~ setIn(X15,alive) )
=> ~ setIn(X16,alive) )
& ! [X12,X13,X14] :
( elem(m_Ack(X14,X12),queue(host(X13)))
=> ~ leq(host(X12),host(X14)) )
& ! [X10,X11] :
( elem(m_Halt(X11),queue(host(X10)))
=> ~ leq(host(X10),host(X11)) )
& ! [X8,X9] :
( elem(m_Down(X9),queue(host(X8)))
=> host(X9) != host(X8) )
& ! [X6,X7] :
( elem(m_Down(X7),queue(host(X6)))
=> ~ setIn(X7,alive) )
& ! [X4,X5] :
( setIn(X5,alive)
=> ~ elem(m_Down(X5),queue(host(X4))) ) )
=> ( setIn(X2,alive)
=> ( ~ leq(host(X2),host(X3))
=> ( ~ ( ( host(X3) = host(index(elid,host(X2)))
& index(status,host(X2)) = wait )
| ( index(status,host(X2)) = norm
& index(ldr,host(X2)) = host(X3) ) )
=> ( ~ ( index(status,host(X2)) = elec_1
& ! [X23] :
( ( leq(s(zero),X23)
& ~ leq(host(X2),X23) )
=> ( host(X3) = X23
| setIn(X23,index(down,host(X2))) ) ) )
=> ! [X24] :
( host(X2) != host(X24)
=> ! [X25,X26] :
( host(X2) = host(X26)
=> ! [X27] :
( ( host(X26) = host(X27)
& host(X24) = host(X25)
& setIn(X26,alive)
& setIn(X24,alive)
& host(X24) != host(X26) )
=> ~ ( elem(m_Down(X27),queue(host(X24)))
& elem(m_Down(X25),X0) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f68]) ).
fof(f85,plain,
? [X0,X2,X3] :
( queue(host(X2)) = cons(m_Down(X3),X0)
& ! [X19,X20,X21,X22] :
( host(X21) != host(X22)
| host(X19) != host(X20)
| ~ setIn(X21,alive)
| ~ setIn(X19,alive)
| host(X19) = host(X21)
| ~ elem(m_Down(X20),queue(host(X21)))
| ~ elem(m_Down(X22),queue(host(X19))) )
& ! [X17,X18] :
( host(X17) != host(X18)
| X17 = X18
| ~ setIn(X18,alive)
| ~ setIn(X17,alive) )
& ! [X15,X16] :
( host(X15) != host(X16)
| ~ leq(X16,X15)
| setIn(X15,alive)
| ~ setIn(X16,alive) )
& ! [X12,X13,X14] :
( ~ elem(m_Ack(X14,X12),queue(host(X13)))
| ~ leq(host(X12),host(X14)) )
& ! [X10,X11] :
( ~ elem(m_Halt(X11),queue(host(X10)))
| ~ leq(host(X10),host(X11)) )
& ! [X8,X9] :
( ~ elem(m_Down(X9),queue(host(X8)))
| host(X9) != host(X8) )
& ! [X6,X7] :
( ~ elem(m_Down(X7),queue(host(X6)))
| ~ setIn(X7,alive) )
& ! [X4,X5] :
( ~ setIn(X5,alive)
| ~ elem(m_Down(X5),queue(host(X4))) )
& setIn(X2,alive)
& ~ leq(host(X2),host(X3))
& ( host(X3) != host(index(elid,host(X2)))
| wait != index(status,host(X2)) )
& ( norm != index(status,host(X2))
| host(X3) != index(ldr,host(X2)) )
& ( elec_1 != index(status,host(X2))
| ? [X23] :
( leq(s(zero),X23)
& ~ leq(host(X2),X23)
& host(X3) != X23
& ~ setIn(X23,index(down,host(X2))) ) )
& ? [X24] :
( host(X2) != host(X24)
& ? [X25,X26] :
( host(X2) = host(X26)
& ? [X27] :
( host(X26) = host(X27)
& host(X24) = host(X25)
& setIn(X26,alive)
& setIn(X24,alive)
& host(X24) != host(X26)
& elem(m_Down(X27),queue(host(X24)))
& elem(m_Down(X25),X0) ) ) ) ),
inference(ennf_transformation,[],[f69]) ).
fof(f86,plain,
? [X0,X2,X3] :
( queue(host(X2)) = cons(m_Down(X3),X0)
& ! [X19,X20,X21,X22] :
( host(X21) != host(X22)
| host(X19) != host(X20)
| ~ setIn(X21,alive)
| ~ setIn(X19,alive)
| host(X19) = host(X21)
| ~ elem(m_Down(X20),queue(host(X21)))
| ~ elem(m_Down(X22),queue(host(X19))) )
& ! [X17,X18] :
( host(X17) != host(X18)
| X17 = X18
| ~ setIn(X18,alive)
| ~ setIn(X17,alive) )
& ! [X15,X16] :
( host(X15) != host(X16)
| ~ leq(X16,X15)
| setIn(X15,alive)
| ~ setIn(X16,alive) )
& ! [X12,X13,X14] :
( ~ elem(m_Ack(X14,X12),queue(host(X13)))
| ~ leq(host(X12),host(X14)) )
& ! [X10,X11] :
( ~ elem(m_Halt(X11),queue(host(X10)))
| ~ leq(host(X10),host(X11)) )
& ! [X8,X9] :
( ~ elem(m_Down(X9),queue(host(X8)))
| host(X9) != host(X8) )
& ! [X6,X7] :
( ~ elem(m_Down(X7),queue(host(X6)))
| ~ setIn(X7,alive) )
& ! [X4,X5] :
( ~ setIn(X5,alive)
| ~ elem(m_Down(X5),queue(host(X4))) )
& setIn(X2,alive)
& ~ leq(host(X2),host(X3))
& ( host(X3) != host(index(elid,host(X2)))
| wait != index(status,host(X2)) )
& ( norm != index(status,host(X2))
| host(X3) != index(ldr,host(X2)) )
& ( elec_1 != index(status,host(X2))
| ? [X23] :
( leq(s(zero),X23)
& ~ leq(host(X2),X23)
& host(X3) != X23
& ~ setIn(X23,index(down,host(X2))) ) )
& ? [X24] :
( host(X2) != host(X24)
& ? [X25,X26] :
( host(X2) = host(X26)
& ? [X27] :
( host(X26) = host(X27)
& host(X24) = host(X25)
& setIn(X26,alive)
& setIn(X24,alive)
& host(X24) != host(X26)
& elem(m_Down(X27),queue(host(X24)))
& elem(m_Down(X25),X0) ) ) ) ),
inference(flattening,[],[f85]) ).
fof(f92,plain,
! [X0,X1,X2] :
( ( ~ elem(X0,cons(X1,X2))
| elem(X0,X2)
| X0 = X1 )
& ( ( ~ elem(X0,X2)
& X0 != X1 )
| elem(X0,cons(X1,X2)) ) ),
inference(nnf_transformation,[],[f47]) ).
fof(f93,plain,
! [X0,X1,X2] :
( ( ~ elem(X0,cons(X1,X2))
| elem(X0,X2)
| X0 = X1 )
& ( ( ~ elem(X0,X2)
& X0 != X1 )
| elem(X0,cons(X1,X2)) ) ),
inference(flattening,[],[f92]) ).
fof(f112,plain,
? [X0,X1,X2] :
( queue(host(X1)) = cons(m_Down(X2),X0)
& ! [X23,X24,X25,X26] :
( host(X26) != host(X25)
| host(X24) != host(X23)
| ~ setIn(X25,alive)
| ~ setIn(X23,alive)
| host(X25) = host(X23)
| ~ elem(m_Down(X24),queue(host(X25)))
| ~ elem(m_Down(X26),queue(host(X23))) )
& ! [X21,X22] :
( host(X21) != host(X22)
| X21 = X22
| ~ setIn(X22,alive)
| ~ setIn(X21,alive) )
& ! [X19,X20] :
( host(X19) != host(X20)
| ~ leq(X20,X19)
| setIn(X19,alive)
| ~ setIn(X20,alive) )
& ! [X16,X17,X18] :
( ~ elem(m_Ack(X18,X16),queue(host(X17)))
| ~ leq(host(X16),host(X18)) )
& ! [X14,X15] :
( ~ elem(m_Halt(X15),queue(host(X14)))
| ~ leq(host(X14),host(X15)) )
& ! [X12,X13] :
( ~ elem(m_Down(X13),queue(host(X12)))
| host(X13) != host(X12) )
& ! [X10,X11] :
( ~ elem(m_Down(X11),queue(host(X10)))
| ~ setIn(X11,alive) )
& ! [X8,X9] :
( ~ setIn(X9,alive)
| ~ elem(m_Down(X9),queue(host(X8))) )
& setIn(X1,alive)
& ~ leq(host(X1),host(X2))
& ( host(X2) != host(index(elid,host(X1)))
| wait != index(status,host(X1)) )
& ( norm != index(status,host(X1))
| host(X2) != index(ldr,host(X1)) )
& ( elec_1 != index(status,host(X1))
| ? [X7] :
( leq(s(zero),X7)
& ~ leq(host(X1),X7)
& host(X2) != X7
& ~ setIn(X7,index(down,host(X1))) ) )
& ? [X3] :
( host(X1) != host(X3)
& ? [X4,X5] :
( host(X1) = host(X5)
& ? [X6] :
( host(X5) = host(X6)
& host(X4) = host(X3)
& setIn(X5,alive)
& setIn(X3,alive)
& host(X5) != host(X3)
& elem(m_Down(X6),queue(host(X3)))
& elem(m_Down(X4),X0) ) ) ) ),
inference(rectify,[],[f86]) ).
fof(f113,plain,
( queue(host(sK4)) = cons(m_Down(sK5),sK3)
& ! [X23,X24,X25,X26] :
( host(X26) != host(X25)
| host(X24) != host(X23)
| ~ setIn(X25,alive)
| ~ setIn(X23,alive)
| host(X25) = host(X23)
| ~ elem(m_Down(X24),queue(host(X25)))
| ~ elem(m_Down(X26),queue(host(X23))) )
& ! [X21,X22] :
( host(X21) != host(X22)
| X21 = X22
| ~ setIn(X22,alive)
| ~ setIn(X21,alive) )
& ! [X19,X20] :
( host(X19) != host(X20)
| ~ leq(X20,X19)
| setIn(X19,alive)
| ~ setIn(X20,alive) )
& ! [X16,X17,X18] :
( ~ elem(m_Ack(X18,X16),queue(host(X17)))
| ~ leq(host(X16),host(X18)) )
& ! [X14,X15] :
( ~ elem(m_Halt(X15),queue(host(X14)))
| ~ leq(host(X14),host(X15)) )
& ! [X12,X13] :
( ~ elem(m_Down(X13),queue(host(X12)))
| host(X13) != host(X12) )
& ! [X10,X11] :
( ~ elem(m_Down(X11),queue(host(X10)))
| ~ setIn(X11,alive) )
& ! [X8,X9] :
( ~ setIn(X9,alive)
| ~ elem(m_Down(X9),queue(host(X8))) )
& setIn(sK4,alive)
& ~ leq(host(sK4),host(sK5))
& ( host(sK5) != host(index(elid,host(sK4)))
| wait != index(status,host(sK4)) )
& ( norm != index(status,host(sK4))
| host(sK5) != index(ldr,host(sK4)) )
& ( elec_1 != index(status,host(sK4))
| ( leq(s(zero),sK10)
& ~ leq(host(sK4),sK10)
& sK10 != host(sK5)
& ~ setIn(sK10,index(down,host(sK4))) ) )
& host(sK6) != host(sK4)
& host(sK8) = host(sK4)
& host(sK8) = host(sK9)
& host(sK6) = host(sK7)
& setIn(sK8,alive)
& setIn(sK6,alive)
& host(sK6) != host(sK8)
& elem(m_Down(sK9),queue(host(sK6)))
& elem(m_Down(sK7),sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6,sK7,sK8,sK9,sK10]),skolemize(X0,sK3),skolemize(X1,sK4),skolemize(X2,sK5),skolemize(X3,sK6),skolemize(X4,sK7),skolemize(X5,sK8),skolemize(X6,sK9),skolemize(X7,sK10)],[f112]) ).
fof(f167,plain,
! [X2,X0,X1] :
( ~ elem(X0,X2)
| elem(X0,cons(X1,X2)) ),
inference(cnf_transformation,[],[f93]) ).
fof(f210,plain,
queue(host(sK4)) = cons(m_Down(sK5),sK3),
inference(cnf_transformation,[],[f113]) ).
fof(f211,plain,
! [X26,X24,X25,X23] :
( host(X26) != host(X25)
| host(X24) != host(X23)
| ~ setIn(X25,alive)
| ~ setIn(X23,alive)
| host(X25) = host(X23)
| ~ elem(m_Down(X24),queue(host(X25)))
| ~ elem(m_Down(X26),queue(host(X23))) ),
inference(cnf_transformation,[],[f113]) ).
fof(f219,plain,
setIn(sK4,alive),
inference(cnf_transformation,[],[f113]) ).
fof(f227,plain,
host(sK6) != host(sK4),
inference(cnf_transformation,[],[f113]) ).
fof(f228,plain,
host(sK8) = host(sK4),
inference(cnf_transformation,[],[f113]) ).
fof(f229,plain,
host(sK8) = host(sK9),
inference(cnf_transformation,[],[f113]) ).
fof(f230,plain,
host(sK6) = host(sK7),
inference(cnf_transformation,[],[f113]) ).
fof(f232,plain,
setIn(sK6,alive),
inference(cnf_transformation,[],[f113]) ).
fof(f234,plain,
elem(m_Down(sK9),queue(host(sK6))),
inference(cnf_transformation,[],[f113]) ).
fof(f235,plain,
elem(m_Down(sK7),sK3),
inference(cnf_transformation,[],[f113]) ).
tcf(c_96,plain,
! [X0: $i,X1: $i,X2: $i] :
( elem(X0,cons(X2,X1))
| ~ elem(X0,X1) ),
inference(cnf_transformation,[],[f167]) ).
tcf(c_139,negated_conjecture,
elem(m_Down(sK7),sK3),
inference(cnf_transformation,[],[f235]) ).
tcf(c_140,negated_conjecture,
elem(m_Down(sK9),queue(host(sK6))),
inference(cnf_transformation,[],[f234]) ).
tcf(c_142,negated_conjecture,
setIn(sK6,alive),
inference(cnf_transformation,[],[f232]) ).
tcf(c_144,negated_conjecture,
host(sK7) = host(sK6),
inference(cnf_transformation,[],[f230]) ).
tcf(c_145,negated_conjecture,
host(sK9) = host(sK8),
inference(cnf_transformation,[],[f229]) ).
tcf(c_146,negated_conjecture,
host(sK8) = host(sK4),
inference(cnf_transformation,[],[f228]) ).
tcf(c_147,negated_conjecture,
host(sK6) != host(sK4),
inference(cnf_transformation,[],[f227]) ).
tcf(c_155,negated_conjecture,
setIn(sK4,alive),
inference(cnf_transformation,[],[f219]) ).
tcf(c_163,negated_conjecture,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( host(X1) = host(X3) )
| ~ setIn(X3,alive)
| ~ setIn(X1,alive)
| ~ elem(m_Down(X2),queue(host(X1)))
| ~ elem(m_Down(X0),queue(host(X3)))
| ( host(X2) != host(X3) )
| ( host(X0) != host(X1) ) ),
inference(cnf_transformation,[],[f211]) ).
tcf(c_164,negated_conjecture,
cons(m_Down(sK5),sK3) = queue(host(sK4)),
inference(cnf_transformation,[],[f210]) ).
tcf(c_915,plain,
host(sK9) = host(sK4),
inference(light_normalisation,[status(thm)],[c_145,c_146]) ).
tcf(c_2197,definition,
iPr_def_10 = host(sK9),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_2198,definition,
iPr_def_11 = host(sK4),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_2199,definition,
iPr_def_12 = m_Down(sK5),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_2200,definition,
iPr_def_13 = cons(iPr_def_12,sK3),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_2201,definition,
iPr_def_14 = queue(iPr_def_11),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_2209,definition,
iPr_def_22 = host(sK6),
introduced(definition,[new_symbols(definition,[iPr_def_22])],[]) ).
tcf(c_2211,definition,
iPr_def_24 = host(sK7),
introduced(definition,[new_symbols(definition,[iPr_def_24])],[]) ).
tcf(c_2212,definition,
iPr_def_25 = m_Down(sK9),
introduced(definition,[new_symbols(definition,[iPr_def_25])],[]) ).
tcf(c_2213,definition,
iPr_def_26 = queue(iPr_def_22),
introduced(definition,[new_symbols(definition,[iPr_def_26])],[]) ).
tcf(c_2214,definition,
iPr_def_27 = m_Down(sK7),
introduced(definition,[new_symbols(definition,[iPr_def_27])],[]) ).
tcf(c_2215,plain,
iPr_def_10 = iPr_def_11,
inference(demodulation,[status(thm)],[c_915,c_2198,c_2197]) ).
tcf(c_2216,negated_conjecture,
iPr_def_13 = iPr_def_14,
inference(demodulation,[status(thm)],[c_164,c_2201,c_2199,c_2200]) ).
tcf(c_2217,negated_conjecture,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( host(X1) = host(X3) )
| ~ setIn(X3,alive)
| ~ setIn(X1,alive)
| ~ elem(m_Down(X2),queue(host(X1)))
| ~ elem(m_Down(X0),queue(host(X3)))
| ( host(X2) != host(X3) )
| ( host(X0) != host(X1) ) ),
inference(demodulation,[status(thm)],[c_163]) ).
tcf(c_2224,negated_conjecture,
setIn(sK4,alive),
inference(demodulation,[status(thm)],[c_155]) ).
tcf(c_2232,negated_conjecture,
iPr_def_22 != iPr_def_11,
inference(demodulation,[status(thm)],[c_147,c_2209]) ).
tcf(c_2234,negated_conjecture,
iPr_def_24 = iPr_def_22,
inference(demodulation,[status(thm)],[c_144,c_2211]) ).
tcf(c_2236,negated_conjecture,
setIn(sK6,alive),
inference(demodulation,[status(thm)],[c_142]) ).
tcf(c_2237,negated_conjecture,
elem(iPr_def_25,iPr_def_26),
inference(demodulation,[status(thm)],[c_140,c_2213,c_2212]) ).
tcf(c_2238,negated_conjecture,
elem(iPr_def_27,sK3),
inference(demodulation,[status(thm)],[c_139,c_2214]) ).
tcf(c_4050,plain,
iPr_def_10 != iPr_def_22,
inference(light_normalisation,[status(thm)],[c_2232,c_2215]) ).
tcf(c_4076,plain,
host(sK4) = iPr_def_10,
inference(light_normalisation,[status(thm)],[c_2198,c_2215]) ).
tcf(c_4311,plain,
queue(iPr_def_10) = iPr_def_13,
inference(light_normalisation,[status(thm)],[c_2201,c_2215,c_2216]) ).
tcf(c_4590,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( host(X2) = host(sK6) )
| ~ setIn(sK6,alive)
| ~ setIn(X2,alive)
| ~ elem(m_Down(X1),queue(host(sK6)))
| ~ elem(m_Down(X0),queue(host(X2)))
| ( host(X1) != host(X2) )
| ( host(X0) != iPr_def_22 ) ),
inference(superposition,[status(thm)],[c_2209,c_2217]) ).
tcf(c_4634,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( host(X2) = iPr_def_22 )
| ~ setIn(sK6,alive)
| ~ setIn(X2,alive)
| ~ elem(m_Down(X1),iPr_def_26)
| ~ elem(m_Down(X0),queue(host(X2)))
| ( host(X1) != host(X2) )
| ( host(X0) != iPr_def_22 ) ),
inference(light_normalisation,[status(thm)],[c_4590,c_2209,c_2213]) ).
tcf(c_4635,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( host(X2) = iPr_def_22 )
| ~ setIn(X2,alive)
| ~ elem(m_Down(X1),iPr_def_26)
| ~ elem(m_Down(X0),queue(host(X2)))
| ( host(X1) != host(X2) )
| ( host(X0) != iPr_def_22 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_4634,c_2236]) ).
tcf(c_4731,plain,
host(sK7) = iPr_def_22,
inference(light_normalisation,[status(thm)],[c_2211,c_2234]) ).
tcf(c_5098,plain,
! [X0: $i,X1: $i] :
( ( host(sK4) = iPr_def_22 )
| ~ setIn(sK4,alive)
| ~ elem(m_Down(X0),iPr_def_26)
| ~ elem(m_Down(X1),queue(host(sK4)))
| ( host(X1) != iPr_def_22 )
| ( host(X0) != iPr_def_10 ) ),
inference(superposition,[status(thm)],[c_4076,c_4635]) ).
tcf(c_5121,plain,
! [X0: $i,X1: $i] :
( ( iPr_def_10 = iPr_def_22 )
| ~ setIn(sK4,alive)
| ~ elem(m_Down(X1),iPr_def_13)
| ~ elem(m_Down(X0),iPr_def_26)
| ( host(X1) != iPr_def_22 )
| ( host(X0) != iPr_def_10 ) ),
inference(light_normalisation,[status(thm)],[c_5098,c_4076,c_4311]) ).
tcf(c_5122,plain,
! [X0: $i,X1: $i] :
( ~ elem(m_Down(X1),iPr_def_13)
| ~ elem(m_Down(X0),iPr_def_26)
| ( host(X1) != iPr_def_22 )
| ( host(X0) != iPr_def_10 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_5121,c_4050,c_2224]) ).
tcf(c_5175,plain,
! [X0: $i] :
( ~ elem(m_Down(sK9),iPr_def_26)
| ~ elem(m_Down(X0),iPr_def_13)
| ( host(X0) != iPr_def_22 ) ),
inference(superposition,[status(thm)],[c_2197,c_5122]) ).
tcf(c_5182,plain,
! [X0: $i] :
( ~ elem(iPr_def_25,iPr_def_26)
| ~ elem(m_Down(X0),iPr_def_13)
| ( host(X0) != iPr_def_22 ) ),
inference(light_normalisation,[status(thm)],[c_5175,c_2212]) ).
tcf(c_5183,plain,
! [X0: $i] :
( ~ elem(m_Down(X0),iPr_def_13)
| ( host(X0) != iPr_def_22 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_5182,c_2237]) ).
tcf(c_5194,plain,
~ elem(m_Down(sK7),iPr_def_13),
inference(superposition,[status(thm)],[c_4731,c_5183]) ).
tcf(c_5199,plain,
~ elem(iPr_def_27,iPr_def_13),
inference(light_normalisation,[status(thm)],[c_5194,c_2214]) ).
tcf(c_5978,plain,
! [X0: $i] :
( elem(X0,iPr_def_13)
| ~ elem(X0,sK3) ),
inference(superposition,[status(thm)],[c_2200,c_96]) ).
tcf(c_6352,plain,
elem(iPr_def_27,iPr_def_13),
inference(superposition,[status(thm)],[c_2238,c_5978]) ).
tcf(c_6353,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_6352,c_5199]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV455+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/10.39 % Computer : n002.cluster.edu
% 0.11/10.39 % Model : x86_64 x86_64
% 0.11/10.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.39 % Memory : 8046.5625MB
% 0.11/10.39 % OS : Linux 6.8.0-71-generic
% 0.11/10.40 % CPULimit : 300
% 0.11/10.40 % WCLimit : 300
% 0.11/10.40 % DateTime : Thu Sep 24 19:50:32 UTC 2026
% 0.15/10.40 % CPUTime :
% 0.15/10.40 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/10.44 Running first-order theorem proving
% 0.15/10.44 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/10.45
% 0.15/10.45 % ======== iProver multi-core TPTP/SMT =========
% 0.15/10.45
% 0.15/10.45 % Detected problem language: tptp
% 0.15/10.46 % Proving...
% 3.10/11.11 % SZS status Started for theBenchmark.p
% 3.10/11.11 % SZS status Theorem for theBenchmark.p
% 3.10/11.11
% 3.10/11.11 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.10/11.11
% 3.10/11.11 % ------ iProver source info
% 3.10/11.11
% 3.10/11.11 % git: date: 2026-07-19 20:42:38 +0200
% 3.10/11.11 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.10/11.11 % git: non_committed_changes: false
% 3.10/11.11
% 3.10/11.11 % ------ Parsing...
% 3.10/11.11 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.10/11.11
% 3.10/11.11 % ------ Preprocessing... sup_sim: 4 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 3.10/11.11
% 3.10/11.11 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.10/11.11
% 3.10/11.11 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.10/11.11 % ------ Proving...
% 3.10/11.11 % ------ Problem Properties
% 3.10/11.11
% 3.10/11.11 %
% 3.10/11.11 % clauses 128
% 3.10/11.11 % conjectures 23
% 3.10/11.11 % EPR 31
% 3.10/11.11 % Horn 113
% 3.10/11.11 % unary 74
% 3.10/11.11 % binary 32
% 3.10/11.11 % lits 217
% 3.10/11.11 % lits eq 101
% 3.10/11.11 % fd_pure 0
% 3.10/11.11 % fd_pseudo 0
% 3.10/11.11 % fd_cond 0
% 3.10/11.11 % fd_pseudo_cond 12
% 3.10/11.11 % AC symbols 0
% 3.10/11.11
% 3.10/11.11 % ------ Schedule dynamic 5 is on
% 3.10/11.11
% 3.10/11.11 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.10/11.11
% 3.10/11.11
% 3.10/11.11 % ------
% 3.10/11.11 % Current options:
% 3.10/11.11 % ------
% 3.10/11.11
% 3.10/11.11
% 3.10/11.11 %
% 3.10/11.11
% 3.10/11.11 % ------ Proving...
% 3.10/11.11 %
% 3.10/11.11
% 3.10/11.11 % SZS status Theorem for theBenchmark.p
% 3.10/11.11
% 3.10/11.11 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.10/11.12
% 3.10/11.12
%------------------------------------------------------------------------------