%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV454+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 03:22:12 PM UTC 2026
% Result : Theorem 3.36s 1.18s
% Output : CNFRefutation 3.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 12
% Syntax : Number of formulae : 75 ( 41 unt; 10 def)
% Number of atoms : 571 ( 217 equ)
% Maximal formula atoms : 49 ( 7 avg)
% Number of connectives : 702 ( 286 ~; 172 |; 183 &)
% ( 1 <=>; 60 =>; 0 <=; 0 <~>)
% Maximal formula depth : 38 ( 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 : 241 ( 2 sgn 220 !; 21 ?; 39 :)
% Comments :
%------------------------------------------------------------------------------
fof(f47,axiom,
! [X0,X1,X2] :
( elem(X0,cons(X1,X2))
<=> ( elem(X0,X2)
| X0 = X1 ) ),
file('/export/starexec/sandbox/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))) ) ) )
=> ( ~ leq(nbr_proc,host(X2))
=> ! [X4] :
( s(host(X2)) != host(X4)
=> ( host(X2) = host(X4)
=> ! [X8,X9] :
( s(host(X2)) != host(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(X8),queue(host(X9)))
& elem(m_Down(X10),X0) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/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))) ) ) )
=> ( ~ leq(nbr_proc,host(X2))
=> ! [X4] :
( s(host(X2)) != host(X4)
=> ( host(X2) = host(X4)
=> ! [X8,X9] :
( s(host(X2)) != host(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(X8),queue(host(X9)))
& elem(m_Down(X10),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))) ) ) )
=> ( ~ leq(nbr_proc,host(X2))
=> ! [X24] :
( s(host(X2)) != host(X24)
=> ( host(X2) = host(X24)
=> ! [X25,X26] :
( s(host(X2)) != host(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(X25),queue(host(X26)))
& elem(m_Down(X27),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)) )
& index(status,host(X2)) = elec_1
& ! [X23] :
( ~ leq(s(zero),X23)
| leq(host(X2),X23)
| host(X3) = X23
| setIn(X23,index(down,host(X2))) )
& ~ leq(nbr_proc,host(X2))
& ? [X24] :
( s(host(X2)) != host(X24)
& host(X2) = host(X24)
& ? [X25,X26] :
( s(host(X2)) != host(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(X25),queue(host(X26)))
& elem(m_Down(X27),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)) )
& index(status,host(X2)) = elec_1
& ! [X23] :
( ~ leq(s(zero),X23)
| leq(host(X2),X23)
| host(X3) = X23
| setIn(X23,index(down,host(X2))) )
& ~ leq(nbr_proc,host(X2))
& ? [X24] :
( s(host(X2)) != host(X24)
& host(X2) = host(X24)
& ? [X25,X26] :
( s(host(X2)) != host(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(X25),queue(host(X26)))
& elem(m_Down(X27),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))) )
& ~ leq(nbr_proc,host(X1))
& ? [X3] :
( host(X3) != s(host(X1))
& host(X1) = host(X3)
& ? [X4,X5] :
( host(X5) != s(host(X1))
& 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(X4),queue(host(X5)))
& elem(m_Down(X6),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))
& ! [X7] :
( ~ leq(s(zero),X7)
| leq(host(sK4),X7)
| host(sK5) = X7
| setIn(X7,index(down,host(sK4))) )
& ~ leq(nbr_proc,host(sK4))
& host(sK6) != s(host(sK4))
& host(sK6) = host(sK4)
& host(sK8) != s(host(sK4))
& host(sK8) != host(sK4)
& host(sK8) = host(sK9)
& host(sK6) = host(sK7)
& setIn(sK8,alive)
& setIn(sK6,alive)
& host(sK8) != host(sK6)
& elem(m_Down(sK7),queue(host(sK8)))
& elem(m_Down(sK9),sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6,sK7,sK8,sK9]),skolemize(X0,sK3),skolemize(X1,sK4),skolemize(X2,sK5),skolemize(X3,sK6),skolemize(X4,sK7),skolemize(X5,sK8),skolemize(X6,sK9)],[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(f216,plain,
! [X12,X13] :
( ~ elem(m_Down(X13),queue(host(X12)))
| host(X13) != host(X12) ),
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(f230,plain,
host(sK8) = host(sK9),
inference(cnf_transformation,[],[f113]) ).
fof(f231,plain,
host(sK6) = host(sK7),
inference(cnf_transformation,[],[f113]) ).
fof(f232,plain,
setIn(sK8,alive),
inference(cnf_transformation,[],[f113]) ).
fof(f235,plain,
elem(m_Down(sK7),queue(host(sK8))),
inference(cnf_transformation,[],[f113]) ).
fof(f236,plain,
elem(m_Down(sK9),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(sK9),sK3),
inference(cnf_transformation,[],[f236]) ).
tcf(c_140,negated_conjecture,
elem(m_Down(sK7),queue(host(sK8))),
inference(cnf_transformation,[],[f235]) ).
tcf(c_143,negated_conjecture,
setIn(sK8,alive),
inference(cnf_transformation,[],[f232]) ).
tcf(c_144,negated_conjecture,
host(sK7) = host(sK6),
inference(cnf_transformation,[],[f231]) ).
tcf(c_145,negated_conjecture,
host(sK9) = host(sK8),
inference(cnf_transformation,[],[f230]) ).
tcf(c_148,negated_conjecture,
host(sK6) = host(sK4),
inference(cnf_transformation,[],[f227]) ).
tcf(c_156,negated_conjecture,
setIn(sK4,alive),
inference(cnf_transformation,[],[f219]) ).
tcf(c_159,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ elem(m_Down(X0),queue(host(X1)))
| ( host(X0) != host(X1) ) ),
inference(cnf_transformation,[],[f216]) ).
tcf(c_164,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_165,negated_conjecture,
cons(m_Down(sK5),sK3) = queue(host(sK4)),
inference(cnf_transformation,[],[f210]) ).
tcf(c_904,plain,
host(sK7) = host(sK4),
inference(light_normalisation,[status(thm)],[c_144,c_148]) ).
tcf(c_2124,definition,
iPr_def_10 = host(sK4),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_2126,definition,
iPr_def_12 = host(sK7),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_2127,definition,
iPr_def_13 = m_Down(sK5),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_2128,definition,
iPr_def_14 = cons(iPr_def_13,sK3),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_2129,definition,
iPr_def_15 = queue(iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_15])],[]) ).
tcf(c_2135,definition,
iPr_def_21 = host(sK8),
introduced(definition,[new_symbols(definition,[iPr_def_21])],[]) ).
tcf(c_2136,definition,
iPr_def_22 = host(sK9),
introduced(definition,[new_symbols(definition,[iPr_def_22])],[]) ).
tcf(c_2137,definition,
iPr_def_23 = m_Down(sK7),
introduced(definition,[new_symbols(definition,[iPr_def_23])],[]) ).
tcf(c_2138,definition,
iPr_def_24 = queue(iPr_def_21),
introduced(definition,[new_symbols(definition,[iPr_def_24])],[]) ).
tcf(c_2139,definition,
iPr_def_25 = m_Down(sK9),
introduced(definition,[new_symbols(definition,[iPr_def_25])],[]) ).
tcf(c_2141,plain,
iPr_def_12 = iPr_def_10,
inference(demodulation,[status(thm)],[c_904,c_2126]) ).
tcf(c_2142,negated_conjecture,
iPr_def_14 = iPr_def_15,
inference(demodulation,[status(thm)],[c_165,c_2129,c_2127,c_2128]) ).
tcf(c_2143,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_164]) ).
tcf(c_2148,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ elem(m_Down(X0),queue(host(X1)))
| ( host(X0) != host(X1) ) ),
inference(demodulation,[status(thm)],[c_159]) ).
tcf(c_2150,negated_conjecture,
setIn(sK4,alive),
inference(demodulation,[status(thm)],[c_156]) ).
tcf(c_2158,negated_conjecture,
iPr_def_22 = iPr_def_21,
inference(demodulation,[status(thm)],[c_145,c_2136]) ).
tcf(c_2159,negated_conjecture,
setIn(sK8,alive),
inference(demodulation,[status(thm)],[c_143]) ).
tcf(c_2161,negated_conjecture,
elem(iPr_def_23,iPr_def_24),
inference(demodulation,[status(thm)],[c_140,c_2138,c_2137]) ).
tcf(c_2162,negated_conjecture,
elem(iPr_def_25,sK3),
inference(demodulation,[status(thm)],[c_139,c_2139]) ).
tcf(c_4002,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( host(X2) = host(sK4) )
| ~ setIn(sK4,alive)
| ~ setIn(X2,alive)
| ~ elem(m_Down(X1),queue(host(sK4)))
| ~ elem(m_Down(X0),queue(host(X2)))
| ( host(X1) != host(X2) )
| ( host(X0) != iPr_def_10 ) ),
inference(superposition,[status(thm)],[c_2124,c_2143]) ).
tcf(c_4010,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( host(X2) = iPr_def_10 )
| ~ setIn(sK4,alive)
| ~ setIn(X2,alive)
| ~ elem(m_Down(X1),iPr_def_14)
| ~ elem(m_Down(X0),queue(host(X2)))
| ( host(X1) != host(X2) )
| ( host(X0) != iPr_def_10 ) ),
inference(light_normalisation,[status(thm)],[c_4002,c_2124,c_2129,c_2142]) ).
tcf(c_4011,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( host(X2) = iPr_def_10 )
| ~ setIn(X2,alive)
| ~ elem(m_Down(X1),iPr_def_14)
| ~ elem(m_Down(X0),queue(host(X2)))
| ( host(X1) != host(X2) )
| ( host(X0) != iPr_def_10 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_4010,c_2150]) ).
tcf(c_4031,plain,
host(sK7) = iPr_def_10,
inference(light_normalisation,[status(thm)],[c_2126,c_2141]) ).
tcf(c_4361,plain,
! [X0: $i] :
( ~ elem(m_Down(X0),queue(host(sK8)))
| ( host(X0) != iPr_def_21 ) ),
inference(superposition,[status(thm)],[c_2135,c_2148]) ).
tcf(c_4391,plain,
! [X0: $i] :
( ~ elem(m_Down(X0),iPr_def_24)
| ( host(X0) != iPr_def_21 ) ),
inference(light_normalisation,[status(thm)],[c_4361,c_2135,c_2138]) ).
tcf(c_4430,plain,
host(sK9) = iPr_def_21,
inference(light_normalisation,[status(thm)],[c_2136,c_2158]) ).
tcf(c_4771,plain,
! [X0: $i,X1: $i] :
( ( host(sK8) = iPr_def_10 )
| ~ setIn(sK8,alive)
| ~ elem(m_Down(X0),iPr_def_14)
| ~ elem(m_Down(X1),queue(host(sK8)))
| ( host(X1) != iPr_def_10 )
| ( host(X0) != iPr_def_21 ) ),
inference(superposition,[status(thm)],[c_2135,c_4011]) ).
tcf(c_4789,plain,
! [X0: $i,X1: $i] :
( ( iPr_def_10 = iPr_def_21 )
| ~ setIn(sK8,alive)
| ~ elem(m_Down(X1),iPr_def_24)
| ~ elem(m_Down(X0),iPr_def_14)
| ( host(X1) != iPr_def_10 )
| ( host(X0) != iPr_def_21 ) ),
inference(light_normalisation,[status(thm)],[c_4771,c_2135,c_2138]) ).
tcf(c_4790,plain,
! [X0: $i,X1: $i] :
( ( iPr_def_10 = iPr_def_21 )
| ~ elem(m_Down(X1),iPr_def_24)
| ~ elem(m_Down(X0),iPr_def_14)
| ( host(X1) != iPr_def_10 )
| ( host(X0) != iPr_def_21 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_4789,c_2159]) ).
tcf(c_5343,plain,
( ~ elem(m_Down(sK7),iPr_def_24)
| ( iPr_def_10 != iPr_def_21 ) ),
inference(superposition,[status(thm)],[c_4031,c_4391]) ).
tcf(c_5352,plain,
( ~ elem(iPr_def_23,iPr_def_24)
| ( iPr_def_10 != iPr_def_21 ) ),
inference(light_normalisation,[status(thm)],[c_5343,c_2137]) ).
tcf(c_5353,plain,
iPr_def_10 != iPr_def_21,
inference(forward_subsumption_resolution,[status(thm)],[c_5352,c_2161]) ).
tcf(c_5354,plain,
! [X0: $i,X1: $i] :
( ~ elem(m_Down(X1),iPr_def_24)
| ~ elem(m_Down(X0),iPr_def_14)
| ( host(X1) != iPr_def_10 )
| ( host(X0) != iPr_def_21 ) ),
inference(backward_subsumption_resolution,[status(thm)],[c_4790,c_5353]) ).
tcf(c_5514,plain,
! [X0: $i] :
( elem(X0,iPr_def_14)
| ~ elem(X0,sK3) ),
inference(superposition,[status(thm)],[c_2128,c_96]) ).
tcf(c_5850,plain,
! [X0: $i] :
( ~ elem(m_Down(sK9),iPr_def_14)
| ~ elem(m_Down(X0),iPr_def_24)
| ( host(X0) != iPr_def_10 ) ),
inference(superposition,[status(thm)],[c_4430,c_5354]) ).
tcf(c_5854,plain,
! [X0: $i] :
( ~ elem(iPr_def_25,iPr_def_14)
| ~ elem(m_Down(X0),iPr_def_24)
| ( host(X0) != iPr_def_10 ) ),
inference(light_normalisation,[status(thm)],[c_5850,c_2139]) ).
tcf(c_6029,plain,
elem(iPr_def_25,iPr_def_14),
inference(superposition,[status(thm)],[c_2162,c_5514]) ).
tcf(c_8893,plain,
! [X0: $i] :
( ( host(X0) != iPr_def_10 )
| ~ elem(m_Down(X0),iPr_def_24) ),
inference(global_subsumption_just,[status(thm)],[c_5854,c_5854,c_6029]) ).
tcf(c_8894,plain,
! [X0: $i] :
( ~ elem(m_Down(X0),iPr_def_24)
| ( host(X0) != iPr_def_10 ) ),
inference(renaming,[status(thm)],[c_8893]) ).
tcf(c_8900,plain,
~ elem(m_Down(sK7),iPr_def_24),
inference(superposition,[status(thm)],[c_4031,c_8894]) ).
tcf(c_8905,plain,
~ elem(iPr_def_23,iPr_def_24),
inference(light_normalisation,[status(thm)],[c_8900,c_2137]) ).
tcf(c_8906,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_8905,c_2161]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV454+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.35 % Computer : n010.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Thu Sep 24 19:47:59 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.39 Running first-order theorem proving
% 0.12/0.39 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.40
% 0.12/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.40
% 0.12/0.40 % Detected problem language: tptp
% 0.12/0.41 % Proving...
% 3.36/1.18 % SZS status Started for theBenchmark.p
% 3.36/1.18 % SZS status Theorem for theBenchmark.p
% 3.36/1.18
% 3.36/1.18 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.36/1.18
% 3.36/1.18 % ------ iProver source info
% 3.36/1.18
% 3.36/1.18 % git: date: 2026-07-19 20:42:38 +0200
% 3.36/1.18 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.36/1.18 % git: non_committed_changes: false
% 3.36/1.18
% 3.36/1.18 % ------ Parsing...
% 3.36/1.18 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.36/1.18
% 3.36/1.18 % ------ Preprocessing... sup_sim: 7 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.36/1.18
% 3.36/1.18 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.36/1.18
% 3.36/1.18 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.36/1.18 % ------ Proving...
% 3.36/1.18 % ------ Problem Properties
% 3.36/1.18
% 3.36/1.18 %
% 3.36/1.18 % clauses 125
% 3.36/1.18 % conjectures 21
% 3.36/1.18 % EPR 30
% 3.36/1.18 % Horn 109
% 3.36/1.18 % unary 76
% 3.36/1.18 % binary 26
% 3.36/1.18 % lits 211
% 3.36/1.18 % lits eq 94
% 3.36/1.18 % fd_pure 0
% 3.36/1.18 % fd_pseudo 0
% 3.36/1.18 % fd_cond 1
% 3.36/1.18 % fd_pseudo_cond 12
% 3.36/1.18 % AC symbols 0
% 3.36/1.18
% 3.36/1.18 % ------ Schedule dynamic 5 is on
% 3.36/1.18
% 3.36/1.18 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.36/1.18
% 3.36/1.18
% 3.36/1.18 % ------
% 3.36/1.18 % Current options:
% 3.36/1.18 % ------
% 3.36/1.18
% 3.36/1.18
% 3.36/1.18 %
% 3.36/1.18
% 3.36/1.18 % ------ Proving...
% 3.36/1.18 %
% 3.36/1.18
% 3.36/1.18 % SZS status Theorem for theBenchmark.p
% 3.36/1.18
% 3.36/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.36/1.18
% 3.36/1.18
%------------------------------------------------------------------------------