%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV451+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 : n016.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:11 PM UTC 2026
% Result : Theorem 0.64s 1.17s
% Output : CNFRefutation 0.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 5
% Syntax : Number of formulae : 74 ( 29 unt; 0 def)
% Number of atoms : 538 ( 247 equ)
% Maximal formula atoms : 51 ( 7 avg)
% Number of connectives : 763 ( 299 ~; 193 |; 209 &)
% ( 2 <=>; 60 =>; 0 <=; 0 <~>)
% Maximal formula depth : 40 ( 7 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 : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 26 ( 26 usr; 16 con; 0-2 aty)
% Number of variables : 269 ( 0 sgn 245 !; 24 ?; 47 :)
% Comments :
%------------------------------------------------------------------------------
fof(f18,axiom,
! [X0,X1] : m_Down(X0) != m_Halt(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_17) ).
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(f48,axiom,
! [X0,X1,X2] :
( elem(X0,snoc(X2,X1))
<=> ( elem(X0,X2)
| X0 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_47) ).
fof(f67,conjecture,
! [X0,X1,X2,X3] :
( ( queue(host(X3)) = cons(m_NotNorm(X2),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(X3,alive)
=> ( ( index(elid,host(X3)) = X2
& index(status,host(X3)) = norm
& index(ldr,host(X3)) = host(X3) )
=> ( ( host(X3) = host(X1)
& ~ setIn(X1,pids)
& ! [X4] :
( host(X3) = host(X4)
=> leq(X4,X1) ) )
=> ( host(X1) = s(zero)
=> ( ~ leq(nbr_proc,host(X1))
=> ! [X4] :
( s(host(X1)) = host(X4)
=> ( host(X3) != host(X4)
=> ! [X8,X9] :
( s(host(X1)) != host(X9)
=> ( host(X3) = host(X9)
=> ! [X10] :
( ( host(X10) = host(X9)
& host(X8) = host(X4)
& host(X9) != host(X4)
& ( X9 = X1
| ( setIn(X9,alive)
& X9 != X3 ) )
& ( X4 = X1
| ( setIn(X4,alive)
& X4 != X3 ) ) )
=> ~ ( elem(m_Down(X10),snoc(queue(host(X4)),m_Halt(X1)))
& elem(m_Down(X8),X0) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
fof(f68,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( queue(host(X3)) = cons(m_NotNorm(X2),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(X3,alive)
=> ( ( index(elid,host(X3)) = X2
& index(status,host(X3)) = norm
& index(ldr,host(X3)) = host(X3) )
=> ( ( host(X3) = host(X1)
& ~ setIn(X1,pids)
& ! [X4] :
( host(X3) = host(X4)
=> leq(X4,X1) ) )
=> ( host(X1) = s(zero)
=> ( ~ leq(nbr_proc,host(X1))
=> ! [X4] :
( s(host(X1)) = host(X4)
=> ( host(X3) != host(X4)
=> ! [X8,X9] :
( s(host(X1)) != host(X9)
=> ( host(X3) = host(X9)
=> ! [X10] :
( ( host(X10) = host(X9)
& host(X8) = host(X4)
& host(X9) != host(X4)
& ( X9 = X1
| ( setIn(X9,alive)
& X9 != X3 ) )
& ( X4 = X1
| ( setIn(X4,alive)
& X4 != X3 ) ) )
=> ~ ( elem(m_Down(X10),snoc(queue(host(X4)),m_Halt(X1)))
& elem(m_Down(X8),X0) ) ) ) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f67]) ).
fof(f69,plain,
~ ! [X0,X1,X2,X3] :
( ( queue(host(X3)) = cons(m_NotNorm(X2),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(X3,alive)
=> ( ( index(elid,host(X3)) = X2
& index(status,host(X3)) = norm
& index(ldr,host(X3)) = host(X3) )
=> ( ( host(X3) = host(X1)
& ~ setIn(X1,pids)
& ! [X23] :
( host(X3) = host(X23)
=> leq(X23,X1) ) )
=> ( host(X1) = s(zero)
=> ( ~ leq(nbr_proc,host(X1))
=> ! [X24] :
( s(host(X1)) = host(X24)
=> ( host(X3) != host(X24)
=> ! [X25,X26] :
( s(host(X1)) != host(X26)
=> ( host(X3) = host(X26)
=> ! [X27] :
( ( host(X26) = host(X27)
& host(X24) = host(X25)
& host(X24) != host(X26)
& ( X1 = X26
| ( setIn(X26,alive)
& X3 != X26 ) )
& ( X1 = X24
| ( setIn(X24,alive)
& X3 != X24 ) ) )
=> ~ ( elem(m_Down(X27),snoc(queue(host(X24)),m_Halt(X1)))
& elem(m_Down(X25),X0) ) ) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f68]) ).
fof(f70,plain,
? [X0,X1,X2,X3] :
( queue(host(X3)) = cons(m_NotNorm(X2),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(X3,alive)
& index(elid,host(X3)) = X2
& index(status,host(X3)) = norm
& index(ldr,host(X3)) = host(X3)
& host(X3) = host(X1)
& ~ setIn(X1,pids)
& ! [X23] :
( host(X3) != host(X23)
| leq(X23,X1) )
& host(X1) = s(zero)
& ~ leq(nbr_proc,host(X1))
& ? [X24] :
( s(host(X1)) = host(X24)
& host(X3) != host(X24)
& ? [X25,X26] :
( s(host(X1)) != host(X26)
& host(X3) = host(X26)
& ? [X27] :
( host(X26) = host(X27)
& host(X24) = host(X25)
& host(X24) != host(X26)
& ( X1 = X26
| ( setIn(X26,alive)
& X3 != X26 ) )
& ( X1 = X24
| ( setIn(X24,alive)
& X3 != X24 ) )
& elem(m_Down(X27),snoc(queue(host(X24)),m_Halt(X1)))
& elem(m_Down(X25),X0) ) ) ) ),
inference(ennf_transformation,[],[f69]) ).
fof(f71,plain,
? [X0,X1,X2,X3] :
( queue(host(X3)) = cons(m_NotNorm(X2),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(X3,alive)
& index(elid,host(X3)) = X2
& index(status,host(X3)) = norm
& index(ldr,host(X3)) = host(X3)
& host(X3) = host(X1)
& ~ setIn(X1,pids)
& ! [X23] :
( host(X3) != host(X23)
| leq(X23,X1) )
& host(X1) = s(zero)
& ~ leq(nbr_proc,host(X1))
& ? [X24] :
( s(host(X1)) = host(X24)
& host(X3) != host(X24)
& ? [X25,X26] :
( s(host(X1)) != host(X26)
& host(X3) = host(X26)
& ? [X27] :
( host(X26) = host(X27)
& host(X24) = host(X25)
& host(X24) != host(X26)
& ( X1 = X26
| ( setIn(X26,alive)
& X3 != X26 ) )
& ( X1 = X24
| ( setIn(X24,alive)
& X3 != X24 ) )
& elem(m_Down(X27),snoc(queue(host(X24)),m_Halt(X1)))
& elem(m_Down(X25),X0) ) ) ) ),
inference(flattening,[],[f70]) ).
fof(f83,plain,
? [X0,X1,X2,X3] :
( queue(host(X3)) = cons(m_NotNorm(X2),X0)
& ! [X24,X25,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),queue(host(X24))) )
& ! [X22,X23] :
( host(X22) != host(X23)
| X22 = X23
| ~ setIn(X23,alive)
| ~ setIn(X22,alive) )
& ! [X20,X21] :
( host(X21) != host(X20)
| ~ leq(X21,X20)
| setIn(X20,alive)
| ~ setIn(X21,alive) )
& ! [X17,X18,X19] :
( ~ elem(m_Ack(X19,X17),queue(host(X18)))
| ~ leq(host(X17),host(X19)) )
& ! [X15,X16] :
( ~ elem(m_Halt(X16),queue(host(X15)))
| ~ leq(host(X15),host(X16)) )
& ! [X13,X14] :
( ~ elem(m_Down(X14),queue(host(X13)))
| host(X13) != host(X14) )
& ! [X11,X12] :
( ~ elem(m_Down(X12),queue(host(X11)))
| ~ setIn(X12,alive) )
& ! [X9,X10] :
( ~ setIn(X10,alive)
| ~ elem(m_Down(X10),queue(host(X9))) )
& setIn(X3,alive)
& index(elid,host(X3)) = X2
& index(status,host(X3)) = norm
& index(ldr,host(X3)) = host(X3)
& host(X3) = host(X1)
& ~ setIn(X1,pids)
& ! [X8] :
( host(X3) != host(X8)
| leq(X8,X1) )
& host(X1) = s(zero)
& ~ leq(nbr_proc,host(X1))
& ? [X4] :
( host(X4) = s(host(X1))
& host(X4) != host(X3)
& ? [X5,X6] :
( host(X6) != s(host(X1))
& host(X6) = host(X3)
& ? [X7] :
( host(X6) = host(X7)
& host(X4) = host(X5)
& host(X4) != host(X6)
& ( X1 = X6
| ( setIn(X6,alive)
& X3 != X6 ) )
& ( X1 = X4
| ( setIn(X4,alive)
& X3 != X4 ) )
& elem(m_Down(X7),snoc(queue(host(X4)),m_Halt(X1)))
& elem(m_Down(X5),X0) ) ) ) ),
inference(rectify,[],[f71]) ).
fof(f84,plain,
( queue(host(sK3)) = cons(m_NotNorm(sK2),sK0)
& ! [X24,X25,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),queue(host(X24))) )
& ! [X22,X23] :
( host(X22) != host(X23)
| X22 = X23
| ~ setIn(X23,alive)
| ~ setIn(X22,alive) )
& ! [X20,X21] :
( host(X21) != host(X20)
| ~ leq(X21,X20)
| setIn(X20,alive)
| ~ setIn(X21,alive) )
& ! [X17,X18,X19] :
( ~ elem(m_Ack(X19,X17),queue(host(X18)))
| ~ leq(host(X17),host(X19)) )
& ! [X15,X16] :
( ~ elem(m_Halt(X16),queue(host(X15)))
| ~ leq(host(X15),host(X16)) )
& ! [X13,X14] :
( ~ elem(m_Down(X14),queue(host(X13)))
| host(X13) != host(X14) )
& ! [X11,X12] :
( ~ elem(m_Down(X12),queue(host(X11)))
| ~ setIn(X12,alive) )
& ! [X9,X10] :
( ~ setIn(X10,alive)
| ~ elem(m_Down(X10),queue(host(X9))) )
& setIn(sK3,alive)
& sK2 = index(elid,host(sK3))
& norm = index(status,host(sK3))
& host(sK3) = index(ldr,host(sK3))
& host(sK3) = host(sK1)
& ~ setIn(sK1,pids)
& ! [X8] :
( host(X8) != host(sK3)
| leq(X8,sK1) )
& s(zero) = host(sK1)
& ~ leq(nbr_proc,host(sK1))
& host(sK4) = s(host(sK1))
& host(sK4) != host(sK3)
& host(sK6) != s(host(sK1))
& host(sK6) = host(sK3)
& host(sK6) = host(sK7)
& host(sK4) = host(sK5)
& host(sK4) != host(sK6)
& ( sK1 = sK6
| ( setIn(sK6,alive)
& sK3 != sK6 ) )
& ( sK1 = sK4
| ( setIn(sK4,alive)
& sK3 != sK4 ) )
& elem(m_Down(sK7),snoc(queue(host(sK4)),m_Halt(sK1)))
& elem(m_Down(sK5),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)],[f83]) ).
fof(f85,plain,
! [X0,X1,X2] :
( ( ~ elem(X0,snoc(X2,X1))
| elem(X0,X2)
| X0 = X1 )
& ( ( ~ elem(X0,X2)
& X0 != X1 )
| elem(X0,snoc(X2,X1)) ) ),
inference(nnf_transformation,[],[f48]) ).
fof(f86,plain,
! [X0,X1,X2] :
( ( ~ elem(X0,snoc(X2,X1))
| elem(X0,X2)
| X0 = X1 )
& ( ( ~ elem(X0,X2)
& X0 != X1 )
| elem(X0,snoc(X2,X1)) ) ),
inference(flattening,[],[f85]) ).
fof(f87,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(f88,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,[],[f87]) ).
fof(f99,plain,
queue(host(sK3)) = cons(m_NotNorm(sK2),sK0),
inference(cnf_transformation,[],[f84]) ).
fof(f100,plain,
! [X26,X27,X24,X25] :
( 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),queue(host(X24))) ),
inference(cnf_transformation,[],[f84]) ).
fof(f105,plain,
! [X14,X13] :
( ~ elem(m_Down(X14),queue(host(X13)))
| host(X13) != host(X14) ),
inference(cnf_transformation,[],[f84]) ).
fof(f108,plain,
setIn(sK3,alive),
inference(cnf_transformation,[],[f84]) ).
fof(f112,plain,
host(sK3) = host(sK1),
inference(cnf_transformation,[],[f84]) ).
fof(f118,plain,
host(sK4) != host(sK3),
inference(cnf_transformation,[],[f84]) ).
fof(f120,plain,
host(sK6) = host(sK3),
inference(cnf_transformation,[],[f84]) ).
fof(f121,plain,
host(sK6) = host(sK7),
inference(cnf_transformation,[],[f84]) ).
fof(f122,plain,
host(sK4) = host(sK5),
inference(cnf_transformation,[],[f84]) ).
fof(f126,plain,
( sK1 = sK4
| setIn(sK4,alive) ),
inference(cnf_transformation,[],[f84]) ).
fof(f128,plain,
elem(m_Down(sK7),snoc(queue(host(sK4)),m_Halt(sK1))),
inference(cnf_transformation,[],[f84]) ).
fof(f129,plain,
elem(m_Down(sK5),sK0),
inference(cnf_transformation,[],[f84]) ).
fof(f138,plain,
! [X2,X0,X1] :
( ~ elem(X0,snoc(X2,X1))
| elem(X0,X2)
| X0 = X1 ),
inference(cnf_transformation,[],[f86]) ).
fof(f142,plain,
! [X2,X0,X1] :
( ~ elem(X0,X2)
| elem(X0,cons(X1,X2)) ),
inference(cnf_transformation,[],[f88]) ).
fof(f170,plain,
! [X0,X1] : m_Halt(X1) != m_Down(X0),
inference(cnf_transformation,[],[f18]) ).
tcf(c_49,negated_conjecture,
elem(m_Down(sK5),sK0),
inference(cnf_transformation,[],[f129]) ).
tcf(c_50,negated_conjecture,
elem(m_Down(sK7),snoc(queue(host(sK4)),m_Halt(sK1))),
inference(cnf_transformation,[],[f128]) ).
tcf(c_52,negated_conjecture,
( setIn(sK4,alive)
| ( sK4 = sK1 ) ),
inference(cnf_transformation,[],[f126]) ).
tcf(c_56,negated_conjecture,
host(sK5) = host(sK4),
inference(cnf_transformation,[],[f122]) ).
tcf(c_57,negated_conjecture,
host(sK7) = host(sK6),
inference(cnf_transformation,[],[f121]) ).
tcf(c_58,negated_conjecture,
host(sK3) = host(sK6),
inference(cnf_transformation,[],[f120]) ).
tcf(c_60,negated_conjecture,
host(sK4) != host(sK3),
inference(cnf_transformation,[],[f118]) ).
tcf(c_66,negated_conjecture,
host(sK1) = host(sK3),
inference(cnf_transformation,[],[f112]) ).
tcf(c_70,negated_conjecture,
setIn(sK3,alive),
inference(cnf_transformation,[],[f108]) ).
tcf(c_73,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ elem(m_Down(X1),queue(host(X0)))
| ( host(X0) != host(X1) ) ),
inference(cnf_transformation,[],[f105]) ).
tcf(c_78,negated_conjecture,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( host(X0) = host(X2) )
| ~ setIn(X2,alive)
| ~ setIn(X0,alive)
| ~ elem(m_Down(X3),queue(host(X0)))
| ~ elem(m_Down(X1),queue(host(X2)))
| ( host(X2) != host(X3) )
| ( host(X0) != host(X1) ) ),
inference(cnf_transformation,[],[f100]) ).
tcf(c_79,negated_conjecture,
cons(m_NotNorm(sK2),sK0) = queue(host(sK3)),
inference(cnf_transformation,[],[f99]) ).
tcf(c_90,plain,
! [X0: $i,X1: $i,X2: $i] :
( elem(X0,X1)
| ( X0 = X2 )
| ~ elem(X0,snoc(X1,X2)) ),
inference(cnf_transformation,[],[f138]) ).
tcf(c_92,plain,
! [X0: $i,X1: $i,X2: $i] :
( elem(X0,cons(X2,X1))
| ~ elem(X0,X1) ),
inference(cnf_transformation,[],[f142]) ).
tcf(c_118,plain,
! [X0: $i,X1: $i] : m_Down(X0) != m_Halt(X1),
inference(cnf_transformation,[],[f170]) ).
tcf(c_698,plain,
host(sK1) = host(sK6),
inference(light_normalisation,[status(thm)],[c_58,c_66]) ).
tcf(c_699,plain,
host(sK7) = host(sK1),
inference(light_normalisation,[status(thm)],[c_57,c_698]) ).
tcf(c_702,plain,
host(sK4) != host(sK1),
inference(light_normalisation,[status(thm)],[c_60,c_66]) ).
tcf(c_743,plain,
cons(m_NotNorm(sK2),sK0) = queue(host(sK1)),
inference(light_normalisation,[status(thm)],[c_79,c_66]) ).
tcf(c_1585,plain,
! [X0: $i,X1: $i] :
( ( host(X0) = host(X1) )
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_2878,plain,
! [X0: $i] :
( ~ elem(m_Down(sK6),queue(host(X0)))
| ( host(X0) != host(sK1) ) ),
inference(superposition,[status(thm)],[c_698,c_73]) ).
tcf(c_2902,plain,
! [X0: $i] :
( ~ elem(m_Down(sK7),queue(host(X0)))
| ( host(X0) != host(sK1) ) ),
inference(superposition,[status(thm)],[c_699,c_73]) ).
tcf(c_3034,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( host(X0) = host(X1) )
| ~ setIn(X1,alive)
| ~ setIn(X0,alive)
| ~ elem(m_Down(sK6),queue(host(X1)))
| ~ elem(m_Down(X2),queue(host(X0)))
| ( host(X1) != host(X2) )
| ( host(X0) != host(sK1) ) ),
inference(superposition,[status(thm)],[c_698,c_78]) ).
tcf(c_3036,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( host(X0) = host(X1) )
| ~ setIn(X1,alive)
| ~ setIn(X0,alive)
| ~ elem(m_Down(sK7),queue(host(X1)))
| ~ elem(m_Down(X2),queue(host(X0)))
| ( host(X1) != host(X2) )
| ( host(X0) != host(sK1) ) ),
inference(superposition,[status(thm)],[c_699,c_78]) ).
tcf(c_3375,plain,
! [X0: $i,X1: $i] :
( ( host(X0) = host(sK3) )
| ~ setIn(sK3,alive)
| ~ setIn(X0,alive)
| ~ elem(m_Down(sK6),queue(host(X0)))
| ~ elem(m_Down(X1),queue(host(sK3)))
| ( host(X0) != host(X1) ) ),
inference(superposition,[status(thm)],[c_66,c_3034]) ).
tcf(c_3383,plain,
! [X0: $i,X1: $i] :
( ( host(X0) = host(sK1) )
| ~ setIn(sK3,alive)
| ~ setIn(X0,alive)
| ~ elem(m_Down(sK6),queue(host(X0)))
| ~ elem(m_Down(X1),queue(host(sK1)))
| ( host(X0) != host(X1) ) ),
inference(light_normalisation,[status(thm)],[c_3375,c_66]) ).
tcf(c_3384,plain,
! [X0: $i,X1: $i] :
( ( host(X0) = host(sK1) )
| ~ setIn(X0,alive)
| ~ elem(m_Down(sK6),queue(host(X0)))
| ~ elem(m_Down(X1),queue(host(sK1)))
| ( host(X0) != host(X1) ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_3383,c_70]) ).
tcf(c_3499,plain,
! [X0: $i,X1: $i] :
( ( host(X0) != host(X1) )
| ~ elem(m_Down(X1),queue(host(sK1)))
| ~ elem(m_Down(sK6),queue(host(X0)))
| ~ setIn(X0,alive) ),
inference(global_subsumption_just,[status(thm)],[c_3384,c_2878,c_3384]) ).
tcf(c_3500,plain,
! [X0: $i,X1: $i] :
( ~ setIn(X0,alive)
| ~ elem(m_Down(sK6),queue(host(X0)))
| ~ elem(m_Down(X1),queue(host(sK1)))
| ( host(X0) != host(X1) ) ),
inference(renaming,[status(thm)],[c_3499]) ).
tcf(c_3514,plain,
! [X0: $i] :
( ~ setIn(X0,alive)
| ~ elem(m_Down(sK5),queue(host(sK1)))
| ~ elem(m_Down(sK6),queue(host(X0)))
| ( host(X0) != host(sK4) ) ),
inference(superposition,[status(thm)],[c_56,c_3500]) ).
tcf(c_3575,plain,
! [X0: $i] :
( elem(X0,queue(host(sK1)))
| ~ elem(X0,sK0) ),
inference(superposition,[status(thm)],[c_743,c_92]) ).
tcf(c_3696,plain,
( ~ setIn(sK4,alive)
| ~ elem(m_Down(sK6),queue(host(sK4)))
| ~ elem(m_Down(sK5),queue(host(sK1))) ),
inference(equality_resolution,[status(thm)],[c_3514]) ).
tcf(c_3738,plain,
! [X0: $i,X1: $i] :
( ( host(X0) = host(sK3) )
| ~ setIn(sK3,alive)
| ~ setIn(X0,alive)
| ~ elem(m_Down(sK7),queue(host(X0)))
| ~ elem(m_Down(X1),queue(host(sK3)))
| ( host(X0) != host(X1) ) ),
inference(superposition,[status(thm)],[c_66,c_3036]) ).
tcf(c_3746,plain,
! [X0: $i,X1: $i] :
( ( host(X0) = host(sK1) )
| ~ setIn(sK3,alive)
| ~ setIn(X0,alive)
| ~ elem(m_Down(sK7),queue(host(X0)))
| ~ elem(m_Down(X1),queue(host(sK1)))
| ( host(X0) != host(X1) ) ),
inference(light_normalisation,[status(thm)],[c_3738,c_66]) ).
tcf(c_3747,plain,
! [X0: $i,X1: $i] :
( ( host(X0) = host(sK1) )
| ~ setIn(X0,alive)
| ~ elem(m_Down(sK7),queue(host(X0)))
| ~ elem(m_Down(X1),queue(host(sK1)))
| ( host(X0) != host(X1) ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_3746,c_70]) ).
tcf(c_4144,plain,
! [X0: $i,X1: $i] :
( ( host(X0) != host(X1) )
| ~ elem(m_Down(X1),queue(host(sK1)))
| ~ elem(m_Down(sK7),queue(host(X0)))
| ~ setIn(X0,alive) ),
inference(global_subsumption_just,[status(thm)],[c_3747,c_2902,c_3747]) ).
tcf(c_4145,plain,
! [X0: $i,X1: $i] :
( ~ setIn(X0,alive)
| ~ elem(m_Down(sK7),queue(host(X0)))
| ~ elem(m_Down(X1),queue(host(sK1)))
| ( host(X0) != host(X1) ) ),
inference(renaming,[status(thm)],[c_4144]) ).
tcf(c_4159,plain,
! [X0: $i] :
( ~ setIn(X0,alive)
| ~ elem(m_Down(sK5),queue(host(sK1)))
| ~ elem(m_Down(sK7),queue(host(X0)))
| ( host(X0) != host(sK4) ) ),
inference(superposition,[status(thm)],[c_56,c_4145]) ).
tcf(c_4186,plain,
( ~ setIn(sK4,alive)
| ~ elem(m_Down(sK7),queue(host(sK4)))
| ~ elem(m_Down(sK5),queue(host(sK1))) ),
inference(equality_resolution,[status(thm)],[c_4159]) ).
tcf(c_4649,plain,
( elem(m_Down(sK7),queue(host(sK4)))
| ( m_Down(sK7) = m_Halt(sK1) ) ),
inference(superposition,[status(thm)],[c_50,c_90]) ).
tcf(c_4652,plain,
elem(m_Down(sK7),queue(host(sK4))),
inference(forward_subsumption_resolution,[status(thm)],[c_4649,c_118]) ).
tcf(c_6298,plain,
( ( host(sK4) = host(sK1) )
| ( sK4 != sK1 ) ),
inference(instantiation,[status(thm)],[c_1585]) ).
tcf(c_6506,plain,
~ elem(m_Down(sK5),queue(host(sK1))),
inference(global_subsumption_just,[status(thm)],[c_3696,c_52,c_702,c_4186,c_4652,c_6298]) ).
tcf(c_6508,plain,
~ elem(m_Down(sK5),sK0),
inference(superposition,[status(thm)],[c_3575,c_6506]) ).
tcf(c_6509,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_6508,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV451+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.35 % Computer : n016.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:52:30 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.39 Running first-order theorem proving
% 0.13/0.39 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.13/0.40
% 0.13/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.40
% 0.13/0.40 % Detected problem language: tptp
% 0.13/0.41 % Proving...
% 0.64/1.17 % SZS status Started for theBenchmark.p
% 0.64/1.17 % SZS status Theorem for theBenchmark.p
% 0.64/1.17
% 0.64/1.17 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.64/1.17
% 0.64/1.17 % ------ iProver source info
% 0.64/1.17
% 0.64/1.17 % git: date: 2026-07-19 20:42:38 +0200
% 0.64/1.17 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.64/1.17 % git: non_committed_changes: false
% 0.64/1.17
% 0.64/1.17 % ------ Parsing...
% 0.64/1.17 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.64/1.17
% 0.64/1.17 % ------ Preprocessing... sup_sim: 15 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 %
% 0.64/1.17
% 0.64/1.17 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.64/1.17
% 0.64/1.17 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.64/1.17 % ------ Proving...
% 0.64/1.17 % ------ Problem Properties
% 0.64/1.17
% 0.64/1.17 %
% 0.64/1.17 % clauses 86
% 0.64/1.17 % conjectures 20
% 0.64/1.17 % EPR 18
% 0.64/1.17 % Horn 80
% 0.64/1.17 % unary 50
% 0.64/1.17 % binary 27
% 0.64/1.17 % lits 138
% 0.64/1.17 % lits eq 71
% 0.64/1.17 % fd_pure 0
% 0.64/1.17 % fd_pseudo 0
% 0.64/1.17 % fd_cond 0
% 0.64/1.17 % fd_pseudo_cond 12
% 0.64/1.17 % AC symbols 0
% 0.64/1.17
% 0.64/1.17 % ------ Schedule dynamic 5 is on
% 0.64/1.17
% 0.64/1.17 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.64/1.17
% 0.64/1.17
% 0.64/1.17 % ------
% 0.64/1.17 % Current options:
% 0.64/1.17 % ------
% 0.64/1.17
% 0.64/1.17
% 0.64/1.17 %
% 0.64/1.17
% 0.64/1.17 % ------ Proving...
% 0.64/1.17 %
% 0.64/1.17
% 0.64/1.17 % SZS status Theorem for theBenchmark.p
% 0.64/1.17
% 0.64/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.64/1.17
% 0.64/1.17
%------------------------------------------------------------------------------