%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV449+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 : n014.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 4.52s 1.32s
% Output : CNFRefutation 4.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 4
% Syntax : Number of formulae : 54 ( 23 unt; 0 def)
% Number of atoms : 428 ( 177 equ)
% Maximal formula atoms : 44 ( 7 avg)
% Number of connectives : 594 ( 220 ~; 141 |; 177 &)
% ( 2 <=>; 54 =>; 0 <=; 0 <~>)
% Maximal formula depth : 37 ( 7 avg)
% Maximal term depth : 3 ( 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 : 25 ( 25 usr; 16 con; 0-2 aty)
% Number of variables : 249 ( 0 sgn 222 !; 27 ?; 28 :)
% Comments :
%------------------------------------------------------------------------------
fof(f19,axiom,
! [X0,X1] : m_Down(X0) != m_Ldr(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_18) ).
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(f48,axiom,
! [X0,X1,X2] :
( elem(X0,snoc(X2,X1))
<=> ( elem(X0,X2)
| X0 = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_47) ).
fof(f67,conjecture,
! [X0,X1,X2,X3] :
( ( queue(host(X2)) = cons(m_Ack(X1,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)
=> ( ( host(X3) = index(pendack,host(X2))
& index(status,host(X2)) = elec_2
& index(elid,host(X2)) = X1 )
=> ( leq(nbr_proc,index(pendack,host(X2)))
=> ! [X4] :
( ( host(X4) = host(X3)
| setIn(host(X4),index(acks,host(X2))) )
=> ! [X8] :
( host(X4) = host(X8)
=> ( host(X2) = host(X8)
=> ! [X9,X10] :
( host(X4) != host(X10)
=> ( host(X2) != host(X10)
=> ! [X11] :
( ( host(X11) = host(X10)
& host(X9) = host(X8)
& setIn(X10,alive)
& setIn(X8,alive)
& host(X10) != host(X8) )
=> ~ ( elem(m_Down(X11),snoc(X0,m_Ldr(X2)))
& elem(m_Down(X9),queue(host(X10))) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
fof(f68,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( queue(host(X2)) = cons(m_Ack(X1,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)
=> ( ( host(X3) = index(pendack,host(X2))
& index(status,host(X2)) = elec_2
& index(elid,host(X2)) = X1 )
=> ( leq(nbr_proc,index(pendack,host(X2)))
=> ! [X4] :
( ( host(X4) = host(X3)
| setIn(host(X4),index(acks,host(X2))) )
=> ! [X8] :
( host(X4) = host(X8)
=> ( host(X2) = host(X8)
=> ! [X9,X10] :
( host(X4) != host(X10)
=> ( host(X2) != host(X10)
=> ! [X11] :
( ( host(X11) = host(X10)
& host(X9) = host(X8)
& setIn(X10,alive)
& setIn(X8,alive)
& host(X10) != host(X8) )
=> ~ ( elem(m_Down(X11),snoc(X0,m_Ldr(X2)))
& elem(m_Down(X9),queue(host(X10))) ) ) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f67]) ).
fof(f69,plain,
~ ! [X0,X1,X2,X3] :
( ( queue(host(X2)) = cons(m_Ack(X1,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(X8) != host(X9) )
& ! [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)
=> ( ( host(X3) = index(pendack,host(X2))
& index(status,host(X2)) = elec_2
& index(elid,host(X2)) = X1 )
=> ( leq(nbr_proc,index(pendack,host(X2)))
=> ! [X23] :
( ( host(X3) = host(X23)
| setIn(host(X23),index(acks,host(X2))) )
=> ! [X24] :
( host(X23) = host(X24)
=> ( host(X2) = host(X24)
=> ! [X25,X26] :
( host(X23) != 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(X27),snoc(X0,m_Ldr(X2)))
& elem(m_Down(X25),queue(host(X26))) ) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f68]) ).
fof(f70,plain,
? [X0,X1,X2,X3] :
( queue(host(X2)) = cons(m_Ack(X1,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(X8) != host(X9) )
& ! [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)
& host(X3) = index(pendack,host(X2))
& index(status,host(X2)) = elec_2
& index(elid,host(X2)) = X1
& leq(nbr_proc,index(pendack,host(X2)))
& ? [X23] :
( ( host(X3) = host(X23)
| setIn(host(X23),index(acks,host(X2))) )
& ? [X24] :
( host(X23) = host(X24)
& host(X2) = host(X24)
& ? [X25,X26] :
( host(X23) != 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(X27),snoc(X0,m_Ldr(X2)))
& elem(m_Down(X25),queue(host(X26))) ) ) ) ) ),
inference(ennf_transformation,[],[f69]) ).
fof(f71,plain,
? [X0,X1,X2,X3] :
( queue(host(X2)) = cons(m_Ack(X1,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(X8) != host(X9) )
& ! [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)
& host(X3) = index(pendack,host(X2))
& index(status,host(X2)) = elec_2
& index(elid,host(X2)) = X1
& leq(nbr_proc,index(pendack,host(X2)))
& ? [X23] :
( ( host(X3) = host(X23)
| setIn(host(X23),index(acks,host(X2))) )
& ? [X24] :
( host(X23) = host(X24)
& host(X2) = host(X24)
& ? [X25,X26] :
( host(X23) != 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(X27),snoc(X0,m_Ldr(X2)))
& elem(m_Down(X25),queue(host(X26))) ) ) ) ) ),
inference(flattening,[],[f70]) ).
fof(f82,plain,
? [X0,X1,X2,X3] :
( queue(host(X2)) = cons(m_Ack(X1,X3),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(X2,alive)
& host(X3) = index(pendack,host(X2))
& index(status,host(X2)) = elec_2
& index(elid,host(X2)) = X1
& leq(nbr_proc,index(pendack,host(X2)))
& ? [X4] :
( ( host(X4) = host(X3)
| setIn(host(X4),index(acks,host(X2))) )
& ? [X5] :
( host(X4) = host(X5)
& host(X2) = host(X5)
& ? [X6,X7] :
( host(X4) != host(X7)
& host(X2) != host(X7)
& ? [X8] :
( host(X7) = host(X8)
& host(X5) = host(X6)
& setIn(X7,alive)
& setIn(X5,alive)
& host(X5) != host(X7)
& elem(m_Down(X8),snoc(X0,m_Ldr(X2)))
& elem(m_Down(X6),queue(host(X7))) ) ) ) ) ),
inference(rectify,[],[f71]) ).
fof(f83,plain,
( queue(host(sK2)) = cons(m_Ack(sK1,sK3),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(sK2,alive)
& host(sK3) = index(pendack,host(sK2))
& elec_2 = index(status,host(sK2))
& sK1 = index(elid,host(sK2))
& leq(nbr_proc,index(pendack,host(sK2)))
& ( host(sK4) = host(sK3)
| setIn(host(sK4),index(acks,host(sK2))) )
& host(sK5) = host(sK4)
& host(sK5) = host(sK2)
& host(sK7) != host(sK4)
& host(sK7) != host(sK2)
& host(sK7) = host(sK8)
& host(sK5) = host(sK6)
& setIn(sK7,alive)
& setIn(sK5,alive)
& host(sK7) != host(sK5)
& elem(m_Down(sK8),snoc(sK0,m_Ldr(sK2)))
& elem(m_Down(sK6),queue(host(sK7))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6,sK7,sK8]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4),skolemize(X5,sK5),skolemize(X6,sK6),skolemize(X7,sK7),skolemize(X8,sK8)],[f82]) ).
fof(f84,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(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(flattening,[],[f84]) ).
fof(f86,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(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(flattening,[],[f86]) ).
fof(f98,plain,
queue(host(sK2)) = cons(m_Ack(sK1,sK3),sK0),
inference(cnf_transformation,[],[f83]) ).
fof(f99,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,[],[f83]) ).
fof(f104,plain,
! [X14,X13] :
( ~ elem(m_Down(X14),queue(host(X13)))
| host(X13) != host(X14) ),
inference(cnf_transformation,[],[f83]) ).
fof(f107,plain,
setIn(sK2,alive),
inference(cnf_transformation,[],[f83]) ).
fof(f114,plain,
host(sK5) = host(sK2),
inference(cnf_transformation,[],[f83]) ).
fof(f117,plain,
host(sK7) = host(sK8),
inference(cnf_transformation,[],[f83]) ).
fof(f118,plain,
host(sK5) = host(sK6),
inference(cnf_transformation,[],[f83]) ).
fof(f119,plain,
setIn(sK7,alive),
inference(cnf_transformation,[],[f83]) ).
fof(f122,plain,
elem(m_Down(sK8),snoc(sK0,m_Ldr(sK2))),
inference(cnf_transformation,[],[f83]) ).
fof(f123,plain,
elem(m_Down(sK6),queue(host(sK7))),
inference(cnf_transformation,[],[f83]) ).
fof(f131,plain,
! [X2,X0,X1] :
( ~ elem(X0,snoc(X2,X1))
| elem(X0,X2)
| X0 = X1 ),
inference(cnf_transformation,[],[f85]) ).
fof(f135,plain,
! [X2,X0,X1] :
( ~ elem(X0,X2)
| elem(X0,cons(X1,X2)) ),
inference(cnf_transformation,[],[f87]) ).
fof(f157,plain,
! [X0,X1] : m_Down(X0) != m_Ldr(X1),
inference(cnf_transformation,[],[f19]) ).
tcf(c_49,negated_conjecture,
elem(m_Down(sK6),queue(host(sK7))),
inference(cnf_transformation,[],[f123]) ).
tcf(c_50,negated_conjecture,
elem(m_Down(sK8),snoc(sK0,m_Ldr(sK2))),
inference(cnf_transformation,[],[f122]) ).
tcf(c_53,negated_conjecture,
setIn(sK7,alive),
inference(cnf_transformation,[],[f119]) ).
tcf(c_54,negated_conjecture,
host(sK6) = host(sK5),
inference(cnf_transformation,[],[f118]) ).
tcf(c_55,negated_conjecture,
host(sK7) = host(sK8),
inference(cnf_transformation,[],[f117]) ).
tcf(c_58,negated_conjecture,
host(sK2) = host(sK5),
inference(cnf_transformation,[],[f114]) ).
tcf(c_65,negated_conjecture,
setIn(sK2,alive),
inference(cnf_transformation,[],[f107]) ).
tcf(c_68,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ elem(m_Down(X1),queue(host(X0)))
| ( host(X0) != host(X1) ) ),
inference(cnf_transformation,[],[f104]) ).
tcf(c_73,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,[],[f99]) ).
tcf(c_74,negated_conjecture,
cons(m_Ack(sK1,sK3),sK0) = queue(host(sK2)),
inference(cnf_transformation,[],[f98]) ).
tcf(c_84,plain,
! [X0: $i,X1: $i,X2: $i] :
( elem(X0,X1)
| ( X0 = X2 )
| ~ elem(X0,snoc(X1,X2)) ),
inference(cnf_transformation,[],[f131]) ).
tcf(c_86,plain,
! [X0: $i,X1: $i,X2: $i] :
( elem(X0,cons(X2,X1))
| ~ elem(X0,X1) ),
inference(cnf_transformation,[],[f135]) ).
tcf(c_105,plain,
! [X0: $i,X1: $i] : m_Down(X0) != m_Ldr(X1),
inference(cnf_transformation,[],[f157]) ).
tcf(c_629,plain,
host(sK6) = host(sK2),
inference(light_normalisation,[status(thm)],[c_54,c_58]) ).
tcf(c_2606,plain,
! [X0: $i] :
( ~ elem(m_Down(sK6),queue(host(X0)))
| ( host(X0) != host(sK2) ) ),
inference(superposition,[status(thm)],[c_629,c_68]) ).
tcf(c_2720,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(sK2) ) ),
inference(superposition,[status(thm)],[c_629,c_73]) ).
tcf(c_3040,plain,
! [X0: $i,X1: $i] :
( ( host(X0) = host(sK2) )
| ~ setIn(sK2,alive)
| ~ setIn(X0,alive)
| ~ elem(m_Down(sK6),queue(host(X0)))
| ~ elem(m_Down(X1),queue(host(sK2)))
| ( host(X0) != host(X1) ) ),
inference(equality_resolution,[status(thm)],[c_2720]) ).
tcf(c_3041,plain,
! [X0: $i,X1: $i] :
( ( host(X0) = host(sK2) )
| ~ setIn(X0,alive)
| ~ elem(m_Down(sK6),queue(host(X0)))
| ~ elem(m_Down(X1),queue(host(sK2)))
| ( host(X0) != host(X1) ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_3040,c_65]) ).
tcf(c_3086,plain,
! [X0: $i,X1: $i] :
( ( host(X0) != host(X1) )
| ~ elem(m_Down(X1),queue(host(sK2)))
| ~ elem(m_Down(sK6),queue(host(X0)))
| ~ setIn(X0,alive) ),
inference(global_subsumption_just,[status(thm)],[c_3041,c_2606,c_3041]) ).
tcf(c_3087,plain,
! [X0: $i,X1: $i] :
( ~ setIn(X0,alive)
| ~ elem(m_Down(sK6),queue(host(X0)))
| ~ elem(m_Down(X1),queue(host(sK2)))
| ( host(X0) != host(X1) ) ),
inference(renaming,[status(thm)],[c_3086]) ).
tcf(c_3101,plain,
! [X0: $i] :
( ~ setIn(X0,alive)
| ~ elem(m_Down(sK8),queue(host(sK2)))
| ~ elem(m_Down(sK6),queue(host(X0)))
| ( host(X0) != host(sK7) ) ),
inference(superposition,[status(thm)],[c_55,c_3087]) ).
tcf(c_3143,plain,
( ~ setIn(sK7,alive)
| ~ elem(m_Down(sK8),queue(host(sK2)))
| ~ elem(m_Down(sK6),queue(host(sK7))) ),
inference(equality_resolution,[status(thm)],[c_3101]) ).
tcf(c_3144,plain,
~ elem(m_Down(sK8),queue(host(sK2))),
inference(forward_subsumption_resolution,[status(thm)],[c_3143,c_53,c_49]) ).
tcf(c_3253,plain,
! [X0: $i] :
( elem(X0,queue(host(sK2)))
| ~ elem(X0,sK0) ),
inference(superposition,[status(thm)],[c_74,c_86]) ).
tcf(c_3282,plain,
~ elem(m_Down(sK8),sK0),
inference(superposition,[status(thm)],[c_3253,c_3144]) ).
tcf(c_4206,plain,
( elem(m_Down(sK8),sK0)
| ( m_Down(sK8) = m_Ldr(sK2) ) ),
inference(superposition,[status(thm)],[c_50,c_84]) ).
tcf(c_4209,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_4206,c_3282,c_105]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV449+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.37 % Computer : n014.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Thu Sep 24 19:47:17 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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.11/0.43
% 0.11/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.43
% 0.11/0.43 % Detected problem language: tptp
% 0.11/0.44 % Proving...
% 4.52/1.32 % SZS status Started for theBenchmark.p
% 4.52/1.32 % SZS status Theorem for theBenchmark.p
% 4.52/1.32
% 4.52/1.32 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.52/1.32
% 4.52/1.32 % ------ iProver source info
% 4.52/1.32
% 4.52/1.32 % git: date: 2026-07-19 20:42:38 +0200
% 4.52/1.32 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.52/1.32 % git: non_committed_changes: false
% 4.52/1.32
% 4.52/1.32 % ------ Parsing...
% 4.52/1.32 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.52/1.32
% 4.52/1.32 % ------ Preprocessing... sup_sim: 9 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 %
% 4.52/1.32
% 4.52/1.32 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.52/1.32
% 4.52/1.32 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.52/1.32 % ------ Proving...
% 4.52/1.32 % ------ Problem Properties
% 4.52/1.32
% 4.52/1.32 %
% 4.52/1.32 % clauses 80
% 4.52/1.32 % conjectures 19
% 4.52/1.32 % EPR 15
% 4.52/1.32 % Horn 75
% 4.52/1.32 % unary 50
% 4.52/1.32 % binary 21
% 4.52/1.32 % lits 126
% 4.52/1.32 % lits eq 63
% 4.52/1.32 % fd_pure 0
% 4.52/1.32 % fd_pseudo 0
% 4.52/1.32 % fd_cond 0
% 4.52/1.32 % fd_pseudo_cond 12
% 4.52/1.32 % AC symbols 0
% 4.52/1.32
% 4.52/1.32 % ------ Schedule dynamic 5 is on
% 4.52/1.32
% 4.52/1.32 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.52/1.32
% 4.52/1.32
% 4.52/1.32 % ------
% 4.52/1.32 % Current options:
% 4.52/1.32 % ------
% 4.52/1.32
% 4.52/1.32
% 4.52/1.32 %
% 4.52/1.32
% 4.52/1.32 % ------ Proving...
% 4.52/1.32 %
% 4.52/1.32
% 4.52/1.32 % SZS status Theorem for theBenchmark.p
% 4.52/1.32
% 4.52/1.32 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.52/1.33
% 4.52/1.33
%------------------------------------------------------------------------------