TSTP Solution File: SWV449+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWV449+1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n001.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon Jun 24 17:14:20 EDT 2024
% Result : Theorem 17.26s 3.14s
% Output : CNFRefutation 17.26s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f19,axiom,
! [X4,X5] : m_Down(X4) != m_Ldr(X5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_18) ).
fof(f47,axiom,
! [X4,X5,X3] :
( elem(X4,cons(X5,X3))
<=> ( elem(X4,X3)
| X4 = X5 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_46) ).
fof(f48,axiom,
! [X4,X5,X3] :
( elem(X4,snoc(X3,X5))
<=> ( elem(X4,X3)
| X4 = X5 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_47) ).
fof(f67,conjecture,
! [X11,X12,X4,X5] :
( ( queue(host(X4)) = cons(m_Ack(X12,X5),X11)
& ! [X6,X15,X14,X13] :
( ( host(X13) = host(X14)
& host(X6) = host(X15)
& setIn(X14,alive)
& setIn(X6,alive)
& host(X6) != host(X14) )
=> ~ ( elem(m_Down(X15),queue(host(X14)))
& elem(m_Down(X13),queue(host(X6))) ) )
& ! [X6,X13] :
( ( host(X6) = host(X13)
& X6 != X13 )
=> ( ~ setIn(X13,alive)
| ~ setIn(X6,alive) ) )
& ! [X6,X13] :
( ( host(X6) = host(X13)
& leq(X13,X6)
& ~ setIn(X6,alive) )
=> ~ setIn(X13,alive) )
& ! [X6,X14,X13] :
( elem(m_Ack(X13,X6),queue(host(X14)))
=> ~ leq(host(X6),host(X13)) )
& ! [X6,X13] :
( elem(m_Halt(X13),queue(host(X6)))
=> ~ leq(host(X6),host(X13)) )
& ! [X6,X13] :
( elem(m_Down(X13),queue(host(X6)))
=> host(X6) != host(X13) )
& ! [X6,X13] :
( elem(m_Down(X13),queue(host(X6)))
=> ~ setIn(X13,alive) )
& ! [X6,X13] :
( setIn(X13,alive)
=> ~ elem(m_Down(X13),queue(host(X6))) ) )
=> ( setIn(X4,alive)
=> ( ( host(X5) = index(pendack,host(X4))
& elec_2 = index(status,host(X4))
& index(elid,host(X4)) = X12 )
=> ( leq(nbr_proc,index(pendack,host(X4)))
=> ! [X6] :
( ( host(X5) = host(X6)
| setIn(host(X6),index(acks,host(X4))) )
=> ! [X16] :
( host(X6) = host(X16)
=> ( host(X4) = host(X16)
=> ! [X17,X18] :
( host(X6) != host(X18)
=> ( host(X4) != host(X18)
=> ! [X19] :
( ( host(X18) = host(X19)
& host(X16) = host(X17)
& setIn(X18,alive)
& setIn(X16,alive)
& host(X16) != host(X18) )
=> ~ ( elem(m_Down(X19),snoc(X11,m_Ldr(X4)))
& elem(m_Down(X17),queue(host(X18))) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
fof(f68,negated_conjecture,
~ ! [X11,X12,X4,X5] :
( ( queue(host(X4)) = cons(m_Ack(X12,X5),X11)
& ! [X6,X15,X14,X13] :
( ( host(X13) = host(X14)
& host(X6) = host(X15)
& setIn(X14,alive)
& setIn(X6,alive)
& host(X6) != host(X14) )
=> ~ ( elem(m_Down(X15),queue(host(X14)))
& elem(m_Down(X13),queue(host(X6))) ) )
& ! [X6,X13] :
( ( host(X6) = host(X13)
& X6 != X13 )
=> ( ~ setIn(X13,alive)
| ~ setIn(X6,alive) ) )
& ! [X6,X13] :
( ( host(X6) = host(X13)
& leq(X13,X6)
& ~ setIn(X6,alive) )
=> ~ setIn(X13,alive) )
& ! [X6,X14,X13] :
( elem(m_Ack(X13,X6),queue(host(X14)))
=> ~ leq(host(X6),host(X13)) )
& ! [X6,X13] :
( elem(m_Halt(X13),queue(host(X6)))
=> ~ leq(host(X6),host(X13)) )
& ! [X6,X13] :
( elem(m_Down(X13),queue(host(X6)))
=> host(X6) != host(X13) )
& ! [X6,X13] :
( elem(m_Down(X13),queue(host(X6)))
=> ~ setIn(X13,alive) )
& ! [X6,X13] :
( setIn(X13,alive)
=> ~ elem(m_Down(X13),queue(host(X6))) ) )
=> ( setIn(X4,alive)
=> ( ( host(X5) = index(pendack,host(X4))
& elec_2 = index(status,host(X4))
& index(elid,host(X4)) = X12 )
=> ( leq(nbr_proc,index(pendack,host(X4)))
=> ! [X6] :
( ( host(X5) = host(X6)
| setIn(host(X6),index(acks,host(X4))) )
=> ! [X16] :
( host(X6) = host(X16)
=> ( host(X4) = host(X16)
=> ! [X17,X18] :
( host(X6) != host(X18)
=> ( host(X4) != host(X18)
=> ! [X19] :
( ( host(X18) = host(X19)
& host(X16) = host(X17)
& setIn(X18,alive)
& setIn(X16,alive)
& host(X16) != host(X18) )
=> ~ ( elem(m_Down(X19),snoc(X11,m_Ldr(X4)))
& elem(m_Down(X17),queue(host(X18))) ) ) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[],[f67]) ).
fof(f79,plain,
! [X0,X1] : m_Down(X0) != m_Ldr(X1),
inference(rectify,[],[f19]) ).
fof(f105,plain,
! [X0,X1,X2] :
( elem(X0,cons(X1,X2))
<=> ( elem(X0,X2)
| X0 = X1 ) ),
inference(rectify,[],[f47]) ).
fof(f106,plain,
! [X0,X1,X2] :
( elem(X0,snoc(X2,X1))
<=> ( elem(X0,X2)
| X0 = X1 ) ),
inference(rectify,[],[f48]) ).
fof(f124,plain,
~ ! [X0,X1,X2,X3] :
( ( queue(host(X2)) = cons(m_Ack(X1,X3),X0)
& ! [X4,X5,X6,X7] :
( ( host(X6) = host(X7)
& host(X4) = host(X5)
& setIn(X6,alive)
& setIn(X4,alive)
& host(X4) != host(X6) )
=> ~ ( elem(m_Down(X5),queue(host(X6)))
& elem(m_Down(X7),queue(host(X4))) ) )
& ! [X8,X9] :
( ( host(X8) = host(X9)
& X8 != X9 )
=> ( ~ setIn(X9,alive)
| ~ setIn(X8,alive) ) )
& ! [X10,X11] :
( ( host(X10) = host(X11)
& leq(X11,X10)
& ~ setIn(X10,alive) )
=> ~ setIn(X11,alive) )
& ! [X12,X13,X14] :
( elem(m_Ack(X14,X12),queue(host(X13)))
=> ~ leq(host(X12),host(X14)) )
& ! [X15,X16] :
( elem(m_Halt(X16),queue(host(X15)))
=> ~ leq(host(X15),host(X16)) )
& ! [X17,X18] :
( elem(m_Down(X18),queue(host(X17)))
=> host(X18) != host(X17) )
& ! [X19,X20] :
( elem(m_Down(X20),queue(host(X19)))
=> ~ setIn(X20,alive) )
& ! [X21,X22] :
( setIn(X22,alive)
=> ~ elem(m_Down(X22),queue(host(X21))) ) )
=> ( setIn(X2,alive)
=> ( ( host(X3) = index(pendack,host(X2))
& elec_2 = index(status,host(X2))
& 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(f140,plain,
? [X0,X1,X2,X3] :
( ? [X23] :
( ? [X24] :
( ? [X25,X26] :
( ? [X27] :
( elem(m_Down(X27),snoc(X0,m_Ldr(X2)))
& elem(m_Down(X25),queue(host(X26)))
& host(X26) = host(X27)
& host(X24) = host(X25)
& setIn(X26,alive)
& setIn(X24,alive)
& host(X24) != host(X26) )
& host(X2) != host(X26)
& host(X23) != host(X26) )
& host(X2) = host(X24)
& host(X23) = host(X24) )
& ( host(X3) = host(X23)
| setIn(host(X23),index(acks,host(X2))) ) )
& leq(nbr_proc,index(pendack,host(X2)))
& host(X3) = index(pendack,host(X2))
& elec_2 = index(status,host(X2))
& index(elid,host(X2)) = X1
& setIn(X2,alive)
& queue(host(X2)) = cons(m_Ack(X1,X3),X0)
& ! [X4,X5,X6,X7] :
( ~ elem(m_Down(X5),queue(host(X6)))
| ~ elem(m_Down(X7),queue(host(X4)))
| host(X6) != host(X7)
| host(X4) != host(X5)
| ~ setIn(X6,alive)
| ~ setIn(X4,alive)
| host(X4) = host(X6) )
& ! [X8,X9] :
( ~ setIn(X9,alive)
| ~ setIn(X8,alive)
| host(X8) != host(X9)
| X8 = X9 )
& ! [X10,X11] :
( ~ setIn(X11,alive)
| host(X10) != host(X11)
| ~ leq(X11,X10)
| setIn(X10,alive) )
& ! [X12,X13,X14] :
( ~ leq(host(X12),host(X14))
| ~ elem(m_Ack(X14,X12),queue(host(X13))) )
& ! [X15,X16] :
( ~ leq(host(X15),host(X16))
| ~ elem(m_Halt(X16),queue(host(X15))) )
& ! [X17,X18] :
( host(X18) != host(X17)
| ~ elem(m_Down(X18),queue(host(X17))) )
& ! [X19,X20] :
( ~ setIn(X20,alive)
| ~ elem(m_Down(X20),queue(host(X19))) )
& ! [X21,X22] :
( ~ elem(m_Down(X22),queue(host(X21)))
| ~ setIn(X22,alive) ) ),
inference(ennf_transformation,[],[f124]) ).
fof(f141,plain,
? [X0,X1,X2,X3] :
( ? [X23] :
( ? [X24] :
( ? [X25,X26] :
( ? [X27] :
( elem(m_Down(X27),snoc(X0,m_Ldr(X2)))
& elem(m_Down(X25),queue(host(X26)))
& host(X26) = host(X27)
& host(X24) = host(X25)
& setIn(X26,alive)
& setIn(X24,alive)
& host(X24) != host(X26) )
& host(X2) != host(X26)
& host(X23) != host(X26) )
& host(X2) = host(X24)
& host(X23) = host(X24) )
& ( host(X3) = host(X23)
| setIn(host(X23),index(acks,host(X2))) ) )
& leq(nbr_proc,index(pendack,host(X2)))
& host(X3) = index(pendack,host(X2))
& elec_2 = index(status,host(X2))
& index(elid,host(X2)) = X1
& setIn(X2,alive)
& queue(host(X2)) = cons(m_Ack(X1,X3),X0)
& ! [X4,X5,X6,X7] :
( ~ elem(m_Down(X5),queue(host(X6)))
| ~ elem(m_Down(X7),queue(host(X4)))
| host(X6) != host(X7)
| host(X4) != host(X5)
| ~ setIn(X6,alive)
| ~ setIn(X4,alive)
| host(X4) = host(X6) )
& ! [X8,X9] :
( ~ setIn(X9,alive)
| ~ setIn(X8,alive)
| host(X8) != host(X9)
| X8 = X9 )
& ! [X10,X11] :
( ~ setIn(X11,alive)
| host(X10) != host(X11)
| ~ leq(X11,X10)
| setIn(X10,alive) )
& ! [X12,X13,X14] :
( ~ leq(host(X12),host(X14))
| ~ elem(m_Ack(X14,X12),queue(host(X13))) )
& ! [X15,X16] :
( ~ leq(host(X15),host(X16))
| ~ elem(m_Halt(X16),queue(host(X15))) )
& ! [X17,X18] :
( host(X18) != host(X17)
| ~ elem(m_Down(X18),queue(host(X17))) )
& ! [X19,X20] :
( ~ setIn(X20,alive)
| ~ elem(m_Down(X20),queue(host(X19))) )
& ! [X21,X22] :
( ~ elem(m_Down(X22),queue(host(X21)))
| ~ setIn(X22,alive) ) ),
inference(flattening,[],[f140]) ).
fof(f147,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,[],[f105]) ).
fof(f148,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,[],[f147]) ).
fof(f149,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,[],[f106]) ).
fof(f150,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,[],[f149]) ).
fof(f170,plain,
? [X0,X1,X2,X3] :
( ? [X4] :
( ? [X5] :
( ? [X6,X7] :
( ? [X8] :
( elem(m_Down(X8),snoc(X0,m_Ldr(X2)))
& elem(m_Down(X6),queue(host(X7)))
& host(X7) = host(X8)
& host(X5) = host(X6)
& setIn(X7,alive)
& setIn(X5,alive)
& host(X5) != host(X7) )
& host(X2) != host(X7)
& host(X4) != host(X7) )
& host(X2) = host(X5)
& host(X4) = host(X5) )
& ( host(X3) = host(X4)
| setIn(host(X4),index(acks,host(X2))) ) )
& leq(nbr_proc,index(pendack,host(X2)))
& host(X3) = index(pendack,host(X2))
& elec_2 = index(status,host(X2))
& index(elid,host(X2)) = X1
& setIn(X2,alive)
& queue(host(X2)) = cons(m_Ack(X1,X3),X0)
& ! [X9,X10,X11,X12] :
( ~ elem(m_Down(X10),queue(host(X11)))
| ~ elem(m_Down(X12),queue(host(X9)))
| host(X11) != host(X12)
| host(X9) != host(X10)
| ~ setIn(X11,alive)
| ~ setIn(X9,alive)
| host(X9) = host(X11) )
& ! [X13,X14] :
( ~ setIn(X14,alive)
| ~ setIn(X13,alive)
| host(X13) != host(X14)
| X13 = X14 )
& ! [X15,X16] :
( ~ setIn(X16,alive)
| host(X15) != host(X16)
| ~ leq(X16,X15)
| setIn(X15,alive) )
& ! [X17,X18,X19] :
( ~ leq(host(X17),host(X19))
| ~ elem(m_Ack(X19,X17),queue(host(X18))) )
& ! [X20,X21] :
( ~ leq(host(X20),host(X21))
| ~ elem(m_Halt(X21),queue(host(X20))) )
& ! [X22,X23] :
( host(X23) != host(X22)
| ~ elem(m_Down(X23),queue(host(X22))) )
& ! [X24,X25] :
( ~ setIn(X25,alive)
| ~ elem(m_Down(X25),queue(host(X24))) )
& ! [X26,X27] :
( ~ elem(m_Down(X27),queue(host(X26)))
| ~ setIn(X27,alive) ) ),
inference(rectify,[],[f141]) ).
fof(f171,plain,
( ? [X0,X1,X2,X3] :
( ? [X4] :
( ? [X5] :
( ? [X6,X7] :
( ? [X8] :
( elem(m_Down(X8),snoc(X0,m_Ldr(X2)))
& elem(m_Down(X6),queue(host(X7)))
& host(X7) = host(X8)
& host(X5) = host(X6)
& setIn(X7,alive)
& setIn(X5,alive)
& host(X5) != host(X7) )
& host(X2) != host(X7)
& host(X4) != host(X7) )
& host(X2) = host(X5)
& host(X4) = host(X5) )
& ( host(X3) = host(X4)
| setIn(host(X4),index(acks,host(X2))) ) )
& leq(nbr_proc,index(pendack,host(X2)))
& host(X3) = index(pendack,host(X2))
& elec_2 = index(status,host(X2))
& index(elid,host(X2)) = X1
& setIn(X2,alive)
& queue(host(X2)) = cons(m_Ack(X1,X3),X0)
& ! [X9,X10,X11,X12] :
( ~ elem(m_Down(X10),queue(host(X11)))
| ~ elem(m_Down(X12),queue(host(X9)))
| host(X11) != host(X12)
| host(X9) != host(X10)
| ~ setIn(X11,alive)
| ~ setIn(X9,alive)
| host(X9) = host(X11) )
& ! [X13,X14] :
( ~ setIn(X14,alive)
| ~ setIn(X13,alive)
| host(X13) != host(X14)
| X13 = X14 )
& ! [X15,X16] :
( ~ setIn(X16,alive)
| host(X15) != host(X16)
| ~ leq(X16,X15)
| setIn(X15,alive) )
& ! [X17,X18,X19] :
( ~ leq(host(X17),host(X19))
| ~ elem(m_Ack(X19,X17),queue(host(X18))) )
& ! [X20,X21] :
( ~ leq(host(X20),host(X21))
| ~ elem(m_Halt(X21),queue(host(X20))) )
& ! [X22,X23] :
( host(X23) != host(X22)
| ~ elem(m_Down(X23),queue(host(X22))) )
& ! [X24,X25] :
( ~ setIn(X25,alive)
| ~ elem(m_Down(X25),queue(host(X24))) )
& ! [X26,X27] :
( ~ elem(m_Down(X27),queue(host(X26)))
| ~ setIn(X27,alive) ) )
=> ( ? [X4] :
( ? [X5] :
( ? [X7,X6] :
( ? [X8] :
( elem(m_Down(X8),snoc(sK3,m_Ldr(sK5)))
& elem(m_Down(X6),queue(host(X7)))
& host(X7) = host(X8)
& host(X5) = host(X6)
& setIn(X7,alive)
& setIn(X5,alive)
& host(X5) != host(X7) )
& host(X7) != host(sK5)
& host(X4) != host(X7) )
& host(X5) = host(sK5)
& host(X4) = host(X5) )
& ( host(X4) = host(sK6)
| setIn(host(X4),index(acks,host(sK5))) ) )
& leq(nbr_proc,index(pendack,host(sK5)))
& host(sK6) = index(pendack,host(sK5))
& elec_2 = index(status,host(sK5))
& sK4 = index(elid,host(sK5))
& setIn(sK5,alive)
& queue(host(sK5)) = cons(m_Ack(sK4,sK6),sK3)
& ! [X9,X10,X11,X12] :
( ~ elem(m_Down(X10),queue(host(X11)))
| ~ elem(m_Down(X12),queue(host(X9)))
| host(X11) != host(X12)
| host(X9) != host(X10)
| ~ setIn(X11,alive)
| ~ setIn(X9,alive)
| host(X9) = host(X11) )
& ! [X13,X14] :
( ~ setIn(X14,alive)
| ~ setIn(X13,alive)
| host(X13) != host(X14)
| X13 = X14 )
& ! [X15,X16] :
( ~ setIn(X16,alive)
| host(X15) != host(X16)
| ~ leq(X16,X15)
| setIn(X15,alive) )
& ! [X17,X18,X19] :
( ~ leq(host(X17),host(X19))
| ~ elem(m_Ack(X19,X17),queue(host(X18))) )
& ! [X20,X21] :
( ~ leq(host(X20),host(X21))
| ~ elem(m_Halt(X21),queue(host(X20))) )
& ! [X22,X23] :
( host(X23) != host(X22)
| ~ elem(m_Down(X23),queue(host(X22))) )
& ! [X24,X25] :
( ~ setIn(X25,alive)
| ~ elem(m_Down(X25),queue(host(X24))) )
& ! [X26,X27] :
( ~ elem(m_Down(X27),queue(host(X26)))
| ~ setIn(X27,alive) ) ) ),
introduced(choice_axiom,[]) ).
fof(f172,plain,
( ? [X4] :
( ? [X5] :
( ? [X7,X6] :
( ? [X8] :
( elem(m_Down(X8),snoc(sK3,m_Ldr(sK5)))
& elem(m_Down(X6),queue(host(X7)))
& host(X7) = host(X8)
& host(X5) = host(X6)
& setIn(X7,alive)
& setIn(X5,alive)
& host(X5) != host(X7) )
& host(X7) != host(sK5)
& host(X4) != host(X7) )
& host(X5) = host(sK5)
& host(X4) = host(X5) )
& ( host(X4) = host(sK6)
| setIn(host(X4),index(acks,host(sK5))) ) )
=> ( ? [X5] :
( ? [X7,X6] :
( ? [X8] :
( elem(m_Down(X8),snoc(sK3,m_Ldr(sK5)))
& elem(m_Down(X6),queue(host(X7)))
& host(X7) = host(X8)
& host(X5) = host(X6)
& setIn(X7,alive)
& setIn(X5,alive)
& host(X5) != host(X7) )
& host(X7) != host(sK5)
& host(X7) != host(sK7) )
& host(X5) = host(sK5)
& host(X5) = host(sK7) )
& ( host(sK6) = host(sK7)
| setIn(host(sK7),index(acks,host(sK5))) ) ) ),
introduced(choice_axiom,[]) ).
fof(f173,plain,
( ? [X5] :
( ? [X7,X6] :
( ? [X8] :
( elem(m_Down(X8),snoc(sK3,m_Ldr(sK5)))
& elem(m_Down(X6),queue(host(X7)))
& host(X7) = host(X8)
& host(X5) = host(X6)
& setIn(X7,alive)
& setIn(X5,alive)
& host(X5) != host(X7) )
& host(X7) != host(sK5)
& host(X7) != host(sK7) )
& host(X5) = host(sK5)
& host(X5) = host(sK7) )
=> ( ? [X7,X6] :
( ? [X8] :
( elem(m_Down(X8),snoc(sK3,m_Ldr(sK5)))
& elem(m_Down(X6),queue(host(X7)))
& host(X7) = host(X8)
& host(X6) = host(sK8)
& setIn(X7,alive)
& setIn(sK8,alive)
& host(X7) != host(sK8) )
& host(X7) != host(sK5)
& host(X7) != host(sK7) )
& host(sK5) = host(sK8)
& host(sK7) = host(sK8) ) ),
introduced(choice_axiom,[]) ).
fof(f174,plain,
( ? [X7,X6] :
( ? [X8] :
( elem(m_Down(X8),snoc(sK3,m_Ldr(sK5)))
& elem(m_Down(X6),queue(host(X7)))
& host(X7) = host(X8)
& host(X6) = host(sK8)
& setIn(X7,alive)
& setIn(sK8,alive)
& host(X7) != host(sK8) )
& host(X7) != host(sK5)
& host(X7) != host(sK7) )
=> ( ? [X8] :
( elem(m_Down(X8),snoc(sK3,m_Ldr(sK5)))
& elem(m_Down(sK9),queue(host(sK10)))
& host(X8) = host(sK10)
& host(sK8) = host(sK9)
& setIn(sK10,alive)
& setIn(sK8,alive)
& host(sK8) != host(sK10) )
& host(sK5) != host(sK10)
& host(sK7) != host(sK10) ) ),
introduced(choice_axiom,[]) ).
fof(f175,plain,
( ? [X8] :
( elem(m_Down(X8),snoc(sK3,m_Ldr(sK5)))
& elem(m_Down(sK9),queue(host(sK10)))
& host(X8) = host(sK10)
& host(sK8) = host(sK9)
& setIn(sK10,alive)
& setIn(sK8,alive)
& host(sK8) != host(sK10) )
=> ( elem(m_Down(sK11),snoc(sK3,m_Ldr(sK5)))
& elem(m_Down(sK9),queue(host(sK10)))
& host(sK10) = host(sK11)
& host(sK8) = host(sK9)
& setIn(sK10,alive)
& setIn(sK8,alive)
& host(sK8) != host(sK10) ) ),
introduced(choice_axiom,[]) ).
fof(f176,plain,
( elem(m_Down(sK11),snoc(sK3,m_Ldr(sK5)))
& elem(m_Down(sK9),queue(host(sK10)))
& host(sK10) = host(sK11)
& host(sK8) = host(sK9)
& setIn(sK10,alive)
& setIn(sK8,alive)
& host(sK8) != host(sK10)
& host(sK5) != host(sK10)
& host(sK7) != host(sK10)
& host(sK5) = host(sK8)
& host(sK7) = host(sK8)
& ( host(sK6) = host(sK7)
| setIn(host(sK7),index(acks,host(sK5))) )
& leq(nbr_proc,index(pendack,host(sK5)))
& host(sK6) = index(pendack,host(sK5))
& elec_2 = index(status,host(sK5))
& sK4 = index(elid,host(sK5))
& setIn(sK5,alive)
& queue(host(sK5)) = cons(m_Ack(sK4,sK6),sK3)
& ! [X9,X10,X11,X12] :
( ~ elem(m_Down(X10),queue(host(X11)))
| ~ elem(m_Down(X12),queue(host(X9)))
| host(X11) != host(X12)
| host(X9) != host(X10)
| ~ setIn(X11,alive)
| ~ setIn(X9,alive)
| host(X9) = host(X11) )
& ! [X13,X14] :
( ~ setIn(X14,alive)
| ~ setIn(X13,alive)
| host(X13) != host(X14)
| X13 = X14 )
& ! [X15,X16] :
( ~ setIn(X16,alive)
| host(X15) != host(X16)
| ~ leq(X16,X15)
| setIn(X15,alive) )
& ! [X17,X18,X19] :
( ~ leq(host(X17),host(X19))
| ~ elem(m_Ack(X19,X17),queue(host(X18))) )
& ! [X20,X21] :
( ~ leq(host(X20),host(X21))
| ~ elem(m_Halt(X21),queue(host(X20))) )
& ! [X22,X23] :
( host(X23) != host(X22)
| ~ elem(m_Down(X23),queue(host(X22))) )
& ! [X24,X25] :
( ~ setIn(X25,alive)
| ~ elem(m_Down(X25),queue(host(X24))) )
& ! [X26,X27] :
( ~ elem(m_Down(X27),queue(host(X26)))
| ~ setIn(X27,alive) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6,sK7,sK8,sK9,sK10,sK11])],[f170,f175,f174,f173,f172,f171]) ).
fof(f196,plain,
! [X0,X1] : m_Down(X0) != m_Ldr(X1),
inference(cnf_transformation,[],[f79]) ).
fof(f231,plain,
! [X2,X0,X1] :
( elem(X0,cons(X1,X2))
| ~ elem(X0,X2) ),
inference(cnf_transformation,[],[f148]) ).
fof(f232,plain,
! [X2,X0,X1] :
( elem(X0,X2)
| X0 = X1
| ~ elem(X0,snoc(X2,X1)) ),
inference(cnf_transformation,[],[f150]) ).
fof(f280,plain,
! [X10,X11,X9,X12] :
( ~ elem(m_Down(X10),queue(host(X11)))
| ~ elem(m_Down(X12),queue(host(X9)))
| host(X11) != host(X12)
| host(X9) != host(X10)
| ~ setIn(X11,alive)
| ~ setIn(X9,alive)
| host(X9) = host(X11) ),
inference(cnf_transformation,[],[f176]) ).
fof(f281,plain,
queue(host(sK5)) = cons(m_Ack(sK4,sK6),sK3),
inference(cnf_transformation,[],[f176]) ).
fof(f282,plain,
setIn(sK5,alive),
inference(cnf_transformation,[],[f176]) ).
fof(f289,plain,
host(sK5) = host(sK8),
inference(cnf_transformation,[],[f176]) ).
fof(f291,plain,
host(sK5) != host(sK10),
inference(cnf_transformation,[],[f176]) ).
fof(f294,plain,
setIn(sK10,alive),
inference(cnf_transformation,[],[f176]) ).
fof(f295,plain,
host(sK8) = host(sK9),
inference(cnf_transformation,[],[f176]) ).
fof(f296,plain,
host(sK10) = host(sK11),
inference(cnf_transformation,[],[f176]) ).
fof(f297,plain,
elem(m_Down(sK9),queue(host(sK10))),
inference(cnf_transformation,[],[f176]) ).
fof(f298,plain,
elem(m_Down(sK11),snoc(sK3,m_Ldr(sK5))),
inference(cnf_transformation,[],[f176]) ).
cnf(c_68,plain,
m_Down(X0) != m_Ldr(X1),
inference(cnf_transformation,[],[f196]) ).
cnf(c_95,plain,
( ~ elem(X0,X1)
| elem(X0,cons(X2,X1)) ),
inference(cnf_transformation,[],[f231]) ).
cnf(c_100,plain,
( ~ elem(X0,snoc(X1,X2))
| X0 = X2
| elem(X0,X1) ),
inference(cnf_transformation,[],[f232]) ).
cnf(c_139,negated_conjecture,
elem(m_Down(sK11),snoc(sK3,m_Ldr(sK5))),
inference(cnf_transformation,[],[f298]) ).
cnf(c_140,negated_conjecture,
elem(m_Down(sK9),queue(host(sK10))),
inference(cnf_transformation,[],[f297]) ).
cnf(c_141,negated_conjecture,
host(sK11) = host(sK10),
inference(cnf_transformation,[],[f296]) ).
cnf(c_142,negated_conjecture,
host(sK9) = host(sK8),
inference(cnf_transformation,[],[f295]) ).
cnf(c_143,negated_conjecture,
setIn(sK10,alive),
inference(cnf_transformation,[],[f294]) ).
cnf(c_146,negated_conjecture,
host(sK5) != host(sK10),
inference(cnf_transformation,[],[f291]) ).
cnf(c_148,negated_conjecture,
host(sK5) = host(sK8),
inference(cnf_transformation,[],[f289]) ).
cnf(c_155,negated_conjecture,
setIn(sK5,alive),
inference(cnf_transformation,[],[f282]) ).
cnf(c_156,negated_conjecture,
cons(m_Ack(sK4,sK6),sK3) = queue(host(sK5)),
inference(cnf_transformation,[],[f281]) ).
cnf(c_157,negated_conjecture,
( host(X0) != host(X1)
| host(X2) != host(X3)
| ~ elem(m_Down(X1),queue(host(X2)))
| ~ elem(m_Down(X3),queue(host(X0)))
| ~ setIn(X0,alive)
| ~ setIn(X2,alive)
| host(X0) = host(X2) ),
inference(cnf_transformation,[],[f280]) ).
cnf(c_884,plain,
host(sK5) = host(sK9),
inference(light_normalisation,[status(thm)],[c_142,c_148]) ).
cnf(c_2100,plain,
m_Ack(sK4,sK6) = sP0_iProver_def,
definition ).
cnf(c_2101,plain,
cons(sP0_iProver_def,sK3) = sP1_iProver_def,
definition ).
cnf(c_2102,plain,
host(sK5) = sP2_iProver_def,
definition ).
cnf(c_2103,plain,
queue(sP2_iProver_def) = sP3_iProver_def,
definition ).
cnf(c_2109,plain,
host(sK10) = sP9_iProver_def,
definition ).
cnf(c_2110,plain,
host(sK11) = sP10_iProver_def,
definition ).
cnf(c_2111,plain,
m_Down(sK9) = sP11_iProver_def,
definition ).
cnf(c_2112,plain,
queue(sP9_iProver_def) = sP12_iProver_def,
definition ).
cnf(c_2113,plain,
m_Down(sK11) = sP13_iProver_def,
definition ).
cnf(c_2114,plain,
m_Ldr(sK5) = sP14_iProver_def,
definition ).
cnf(c_2115,plain,
snoc(sK3,sP14_iProver_def) = sP15_iProver_def,
definition ).
cnf(c_2122,negated_conjecture,
( host(X0) != host(X1)
| host(X2) != host(X3)
| ~ elem(m_Down(X1),queue(host(X2)))
| ~ elem(m_Down(X3),queue(host(X0)))
| ~ setIn(X0,alive)
| ~ setIn(X2,alive)
| host(X0) = host(X2) ),
inference(demodulation,[status(thm)],[c_157]) ).
cnf(c_2123,negated_conjecture,
sP1_iProver_def = sP3_iProver_def,
inference(demodulation,[status(thm)],[c_156,c_2102,c_2103,c_2100,c_2101]) ).
cnf(c_2124,negated_conjecture,
setIn(sK5,alive),
inference(demodulation,[status(thm)],[c_155]) ).
cnf(c_2129,negated_conjecture,
sP2_iProver_def != sP9_iProver_def,
inference(demodulation,[status(thm)],[c_146,c_2109]) ).
cnf(c_2131,negated_conjecture,
setIn(sK10,alive),
inference(demodulation,[status(thm)],[c_143]) ).
cnf(c_2132,negated_conjecture,
sP10_iProver_def = sP9_iProver_def,
inference(demodulation,[status(thm)],[c_141,c_2110]) ).
cnf(c_2133,negated_conjecture,
elem(sP11_iProver_def,sP12_iProver_def),
inference(demodulation,[status(thm)],[c_140,c_2112,c_2111]) ).
cnf(c_2134,negated_conjecture,
elem(sP13_iProver_def,sP15_iProver_def),
inference(demodulation,[status(thm)],[c_139,c_2114,c_2115,c_2113]) ).
cnf(c_3936,plain,
host(sK9) = sP2_iProver_def,
inference(light_normalisation,[status(thm)],[c_884,c_2102]) ).
cnf(c_4092,plain,
( host(X0) != host(X1)
| host(X2) != sP2_iProver_def
| ~ elem(m_Down(X2),queue(host(X0)))
| ~ elem(m_Down(X1),queue(host(sK5)))
| ~ setIn(X0,alive)
| ~ setIn(sK5,alive)
| host(X0) = host(sK5) ),
inference(superposition,[status(thm)],[c_2102,c_2122]) ).
cnf(c_4112,plain,
( host(X0) != host(X1)
| host(X2) != sP2_iProver_def
| ~ elem(m_Down(X2),queue(host(X0)))
| ~ elem(m_Down(X1),sP1_iProver_def)
| ~ setIn(X0,alive)
| ~ setIn(sK5,alive)
| host(X0) = sP2_iProver_def ),
inference(light_normalisation,[status(thm)],[c_4092,c_2102,c_2103,c_2123]) ).
cnf(c_4113,plain,
( host(X0) != host(X1)
| host(X2) != sP2_iProver_def
| ~ elem(m_Down(X2),queue(host(X0)))
| ~ elem(m_Down(X1),sP1_iProver_def)
| ~ setIn(X0,alive)
| host(X0) = sP2_iProver_def ),
inference(forward_subsumption_resolution,[status(thm)],[c_4112,c_2124]) ).
cnf(c_4545,plain,
host(sK11) = sP9_iProver_def,
inference(light_normalisation,[status(thm)],[c_2110,c_2132]) ).
cnf(c_4850,plain,
m_Down(X0) != sP14_iProver_def,
inference(superposition,[status(thm)],[c_2114,c_68]) ).
cnf(c_4900,plain,
( host(X0) != sP2_iProver_def
| host(X1) != sP9_iProver_def
| ~ elem(m_Down(X0),queue(host(sK10)))
| ~ elem(m_Down(X1),sP1_iProver_def)
| ~ setIn(sK10,alive)
| host(sK10) = sP2_iProver_def ),
inference(superposition,[status(thm)],[c_2109,c_4113]) ).
cnf(c_4951,plain,
( host(X0) != sP2_iProver_def
| host(X1) != sP9_iProver_def
| ~ elem(m_Down(X0),sP12_iProver_def)
| ~ elem(m_Down(X1),sP1_iProver_def)
| ~ setIn(sK10,alive)
| sP2_iProver_def = sP9_iProver_def ),
inference(light_normalisation,[status(thm)],[c_4900,c_2109,c_2112]) ).
cnf(c_4952,plain,
( host(X0) != sP2_iProver_def
| host(X1) != sP9_iProver_def
| ~ elem(m_Down(X0),sP12_iProver_def)
| ~ elem(m_Down(X1),sP1_iProver_def) ),
inference(forward_subsumption_resolution,[status(thm)],[c_4951,c_2129,c_2131]) ).
cnf(c_4967,plain,
( host(X0) != sP9_iProver_def
| ~ elem(m_Down(X0),sP1_iProver_def)
| ~ elem(m_Down(sK9),sP12_iProver_def) ),
inference(superposition,[status(thm)],[c_3936,c_4952]) ).
cnf(c_4977,plain,
( host(X0) != sP9_iProver_def
| ~ elem(m_Down(X0),sP1_iProver_def)
| ~ elem(sP11_iProver_def,sP12_iProver_def) ),
inference(light_normalisation,[status(thm)],[c_4967,c_2111]) ).
cnf(c_4978,plain,
( host(X0) != sP9_iProver_def
| ~ elem(m_Down(X0),sP1_iProver_def) ),
inference(forward_subsumption_resolution,[status(thm)],[c_4977,c_2133]) ).
cnf(c_4989,plain,
~ elem(m_Down(sK11),sP1_iProver_def),
inference(superposition,[status(thm)],[c_4545,c_4978]) ).
cnf(c_4994,plain,
~ elem(sP13_iProver_def,sP1_iProver_def),
inference(light_normalisation,[status(thm)],[c_4989,c_2113]) ).
cnf(c_5454,plain,
sP13_iProver_def != sP14_iProver_def,
inference(superposition,[status(thm)],[c_2113,c_4850]) ).
cnf(c_5831,plain,
( ~ elem(X0,sK3)
| elem(X0,sP1_iProver_def) ),
inference(superposition,[status(thm)],[c_2101,c_95]) ).
cnf(c_7231,plain,
( ~ elem(X0,sP15_iProver_def)
| X0 = sP14_iProver_def
| elem(X0,sK3) ),
inference(superposition,[status(thm)],[c_2115,c_100]) ).
cnf(c_48171,plain,
( sP13_iProver_def = sP14_iProver_def
| elem(sP13_iProver_def,sK3) ),
inference(superposition,[status(thm)],[c_2134,c_7231]) ).
cnf(c_48179,plain,
elem(sP13_iProver_def,sK3),
inference(forward_subsumption_resolution,[status(thm)],[c_48171,c_5454]) ).
cnf(c_48200,plain,
elem(sP13_iProver_def,sP1_iProver_def),
inference(superposition,[status(thm)],[c_48179,c_5831]) ).
cnf(c_48201,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_48200,c_4994]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWV449+1 : TPTP v8.2.0. Released v4.0.0.
% 0.06/0.12 % Command : run_iprover %s %d THM
% 0.11/0.33 % Computer : n001.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Thu Jun 20 14:13:09 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 17.26/3.14 % SZS status Started for theBenchmark.p
% 17.26/3.14 % SZS status Theorem for theBenchmark.p
% 17.26/3.14
% 17.26/3.14 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 17.26/3.14
% 17.26/3.14 ------ iProver source info
% 17.26/3.14
% 17.26/3.14 git: date: 2024-06-12 09:56:46 +0000
% 17.26/3.14 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 17.26/3.14 git: non_committed_changes: false
% 17.26/3.14
% 17.26/3.14 ------ Parsing...
% 17.26/3.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 17.26/3.14
% 17.26/3.14 ------ 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
% 17.26/3.14
% 17.26/3.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 17.26/3.14
% 17.26/3.14 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 17.26/3.14 ------ Proving...
% 17.26/3.14 ------ Problem Properties
% 17.26/3.14
% 17.26/3.14
% 17.26/3.14 clauses 125
% 17.26/3.14 conjectures 19
% 17.26/3.14 EPR 26
% 17.26/3.14 Horn 109
% 17.26/3.14 unary 76
% 17.26/3.14 binary 27
% 17.26/3.14 lits 209
% 17.26/3.14 lits eq 95
% 17.26/3.14 fd_pure 0
% 17.26/3.14 fd_pseudo 0
% 17.26/3.14 fd_cond 0
% 17.26/3.14 fd_pseudo_cond 12
% 17.26/3.14 AC symbols 0
% 17.26/3.14
% 17.26/3.14 ------ Schedule dynamic 5 is on
% 17.26/3.14
% 17.26/3.14 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 17.26/3.14
% 17.26/3.14
% 17.26/3.14 ------
% 17.26/3.14 Current options:
% 17.26/3.14 ------
% 17.26/3.14
% 17.26/3.14
% 17.26/3.14
% 17.26/3.14
% 17.26/3.14 ------ Proving...
% 17.26/3.14
% 17.26/3.14
% 17.26/3.14 % SZS status Theorem for theBenchmark.p
% 17.26/3.14
% 17.26/3.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 17.26/3.14
% 17.26/3.15
%------------------------------------------------------------------------------