TSTP Solution File: SWV452+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWV452+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n014.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 : Thu Aug 31 22:37:34 EDT 2023
% Result : Theorem 0.45s 1.16s
% Output : CNFRefutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 8
% Syntax : Number of formulae : 82 ( 26 unt; 0 def)
% Number of atoms : 704 ( 341 equ)
% Maximal formula atoms : 100 ( 8 avg)
% Number of connectives : 987 ( 365 ~; 247 |; 313 &)
% ( 4 <=>; 58 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 24 ( 24 usr; 16 con; 0-2 aty)
% Number of variables : 324 ( 1 sgn; 243 !; 48 ?)
% Comments :
%------------------------------------------------------------------------------
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(f62,axiom,
! [X4,X5] :
( ( leq(X5,X4)
& leq(X4,X5) )
<=> X4 = X5 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_61) ).
fof(f67,conjecture,
! [X11,X12,X4,X5] :
( ( queue(host(X4)) = cons(m_Down(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)
=> ( ~ leq(host(X4),host(X5))
=> ( ( ( host(X5) = host(index(elid,host(X4)))
& wait = index(status,host(X4)) )
| ( norm = index(status,host(X4))
& host(X5) = index(ldr,host(X4)) ) )
=> ( ( host(X4) = host(X12)
& ~ setIn(X12,pids)
& ! [X6] :
( host(X4) = host(X6)
=> leq(X6,X12) ) )
=> ( s(zero) != host(X12)
=> ! [X6] :
( host(X4) = host(X6)
=> ! [X16,X17] :
( host(X4) != host(X17)
=> ! [X18] :
( ( host(X17) = host(X18)
& host(X6) = host(X16)
& host(X6) != host(X17)
& ( X12 = X17
| ( setIn(X17,alive)
& X4 != X17 ) )
& ( X6 = X12
| ( setIn(X6,alive)
& X4 != X6 ) ) )
=> ~ ( elem(m_Down(X16),queue(host(X17)))
& elem(m_Down(X18),X11) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
fof(f68,negated_conjecture,
~ ! [X11,X12,X4,X5] :
( ( queue(host(X4)) = cons(m_Down(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)
=> ( ~ leq(host(X4),host(X5))
=> ( ( ( host(X5) = host(index(elid,host(X4)))
& wait = index(status,host(X4)) )
| ( norm = index(status,host(X4))
& host(X5) = index(ldr,host(X4)) ) )
=> ( ( host(X4) = host(X12)
& ~ setIn(X12,pids)
& ! [X6] :
( host(X4) = host(X6)
=> leq(X6,X12) ) )
=> ( s(zero) != host(X12)
=> ! [X6] :
( host(X4) = host(X6)
=> ! [X16,X17] :
( host(X4) != host(X17)
=> ! [X18] :
( ( host(X17) = host(X18)
& host(X6) = host(X16)
& host(X6) != host(X17)
& ( X12 = X17
| ( setIn(X17,alive)
& X4 != X17 ) )
& ( X6 = X12
| ( setIn(X6,alive)
& X4 != X6 ) ) )
=> ~ ( elem(m_Down(X16),queue(host(X17)))
& elem(m_Down(X18),X11) ) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[],[f67]) ).
fof(f105,plain,
! [X0,X1,X2] :
( elem(X0,cons(X1,X2))
<=> ( elem(X0,X2)
| X0 = X1 ) ),
inference(rectify,[],[f47]) ).
fof(f119,plain,
! [X0,X1] :
( ( leq(X1,X0)
& leq(X0,X1) )
<=> X0 = X1 ),
inference(rectify,[],[f62]) ).
fof(f124,plain,
~ ! [X0,X1,X2,X3] :
( ( queue(host(X2)) = cons(m_Down(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(X17) != host(X18) )
& ! [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)
=> ( ~ 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)) ) )
=> ( ( host(X2) = host(X1)
& ~ setIn(X1,pids)
& ! [X23] :
( host(X2) = host(X23)
=> leq(X23,X1) ) )
=> ( s(zero) != host(X1)
=> ! [X24] :
( host(X2) = host(X24)
=> ! [X25,X26] :
( host(X2) != host(X26)
=> ! [X27] :
( ( host(X26) = host(X27)
& host(X24) = host(X25)
& host(X24) != host(X26)
& ( X1 = X26
| ( setIn(X26,alive)
& X2 != X26 ) )
& ( X1 = X24
| ( setIn(X24,alive)
& X2 != X24 ) ) )
=> ~ ( elem(m_Down(X25),queue(host(X26)))
& elem(m_Down(X27),X0) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f68]) ).
fof(f140,plain,
? [X0,X1,X2,X3] :
( ? [X24] :
( ? [X25,X26] :
( ? [X27] :
( elem(m_Down(X25),queue(host(X26)))
& elem(m_Down(X27),X0)
& host(X26) = host(X27)
& host(X24) = host(X25)
& host(X24) != host(X26)
& ( X1 = X26
| ( setIn(X26,alive)
& X2 != X26 ) )
& ( X1 = X24
| ( setIn(X24,alive)
& X2 != X24 ) ) )
& host(X2) != host(X26) )
& host(X2) = host(X24) )
& s(zero) != host(X1)
& host(X2) = host(X1)
& ~ setIn(X1,pids)
& ! [X23] :
( leq(X23,X1)
| host(X2) != host(X23) )
& ( ( host(X3) = host(index(elid,host(X2)))
& wait = index(status,host(X2)) )
| ( norm = index(status,host(X2))
& host(X3) = index(ldr,host(X2)) ) )
& ~ leq(host(X2),host(X3))
& setIn(X2,alive)
& queue(host(X2)) = cons(m_Down(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(X17) != host(X18)
| ~ 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] :
( ? [X24] :
( ? [X25,X26] :
( ? [X27] :
( elem(m_Down(X25),queue(host(X26)))
& elem(m_Down(X27),X0)
& host(X26) = host(X27)
& host(X24) = host(X25)
& host(X24) != host(X26)
& ( X1 = X26
| ( setIn(X26,alive)
& X2 != X26 ) )
& ( X1 = X24
| ( setIn(X24,alive)
& X2 != X24 ) ) )
& host(X2) != host(X26) )
& host(X2) = host(X24) )
& s(zero) != host(X1)
& host(X2) = host(X1)
& ~ setIn(X1,pids)
& ! [X23] :
( leq(X23,X1)
| host(X2) != host(X23) )
& ( ( host(X3) = host(index(elid,host(X2)))
& wait = index(status,host(X2)) )
| ( norm = index(status,host(X2))
& host(X3) = index(ldr,host(X2)) ) )
& ~ leq(host(X2),host(X3))
& setIn(X2,alive)
& queue(host(X2)) = cons(m_Down(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(X17) != host(X18)
| ~ 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(f165,plain,
! [X0,X1] :
( ( ( leq(X1,X0)
& leq(X0,X1) )
| X0 != X1 )
& ( X0 = X1
| ~ leq(X1,X0)
| ~ leq(X0,X1) ) ),
inference(nnf_transformation,[],[f119]) ).
fof(f166,plain,
! [X0,X1] :
( ( ( leq(X1,X0)
& leq(X0,X1) )
| X0 != X1 )
& ( X0 = X1
| ~ leq(X1,X0)
| ~ leq(X0,X1) ) ),
inference(flattening,[],[f165]) ).
fof(f170,plain,
? [X0,X1,X2,X3] :
( ? [X4] :
( ? [X5,X6] :
( ? [X7] :
( elem(m_Down(X5),queue(host(X6)))
& elem(m_Down(X7),X0)
& host(X6) = host(X7)
& host(X4) = host(X5)
& host(X4) != host(X6)
& ( X1 = X6
| ( setIn(X6,alive)
& X2 != X6 ) )
& ( X1 = X4
| ( setIn(X4,alive)
& X2 != X4 ) ) )
& host(X2) != host(X6) )
& host(X2) = host(X4) )
& s(zero) != host(X1)
& host(X2) = host(X1)
& ~ setIn(X1,pids)
& ! [X8] :
( leq(X8,X1)
| host(X2) != host(X8) )
& ( ( host(X3) = host(index(elid,host(X2)))
& wait = index(status,host(X2)) )
| ( norm = index(status,host(X2))
& host(X3) = index(ldr,host(X2)) ) )
& ~ leq(host(X2),host(X3))
& setIn(X2,alive)
& queue(host(X2)) = cons(m_Down(X3),X0)
& ! [X9,X10,X11,X12] :
( ~ elem(m_Down(X10),queue(host(X11)))
| ~ elem(m_Down(X12),queue(host(X9)))
| host(X12) != host(X11)
| 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] :
( elem(m_Down(X5),queue(host(X6)))
& elem(m_Down(X7),X0)
& host(X6) = host(X7)
& host(X4) = host(X5)
& host(X4) != host(X6)
& ( X1 = X6
| ( setIn(X6,alive)
& X2 != X6 ) )
& ( X1 = X4
| ( setIn(X4,alive)
& X2 != X4 ) ) )
& host(X2) != host(X6) )
& host(X2) = host(X4) )
& s(zero) != host(X1)
& host(X2) = host(X1)
& ~ setIn(X1,pids)
& ! [X8] :
( leq(X8,X1)
| host(X2) != host(X8) )
& ( ( host(X3) = host(index(elid,host(X2)))
& wait = index(status,host(X2)) )
| ( norm = index(status,host(X2))
& host(X3) = index(ldr,host(X2)) ) )
& ~ leq(host(X2),host(X3))
& setIn(X2,alive)
& queue(host(X2)) = cons(m_Down(X3),X0)
& ! [X9,X10,X11,X12] :
( ~ elem(m_Down(X10),queue(host(X11)))
| ~ elem(m_Down(X12),queue(host(X9)))
| host(X12) != host(X11)
| 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] :
( ? [X6,X5] :
( ? [X7] :
( elem(m_Down(X5),queue(host(X6)))
& elem(m_Down(X7),sK3)
& host(X6) = host(X7)
& host(X4) = host(X5)
& host(X4) != host(X6)
& ( sK4 = X6
| ( setIn(X6,alive)
& sK5 != X6 ) )
& ( sK4 = X4
| ( setIn(X4,alive)
& sK5 != X4 ) ) )
& host(X6) != host(sK5) )
& host(X4) = host(sK5) )
& s(zero) != host(sK4)
& host(sK5) = host(sK4)
& ~ setIn(sK4,pids)
& ! [X8] :
( leq(X8,sK4)
| host(X8) != host(sK5) )
& ( ( host(sK6) = host(index(elid,host(sK5)))
& wait = index(status,host(sK5)) )
| ( norm = index(status,host(sK5))
& host(sK6) = index(ldr,host(sK5)) ) )
& ~ leq(host(sK5),host(sK6))
& setIn(sK5,alive)
& queue(host(sK5)) = cons(m_Down(sK6),sK3)
& ! [X9,X10,X11,X12] :
( ~ elem(m_Down(X10),queue(host(X11)))
| ~ elem(m_Down(X12),queue(host(X9)))
| host(X12) != host(X11)
| 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] :
( ? [X6,X5] :
( ? [X7] :
( elem(m_Down(X5),queue(host(X6)))
& elem(m_Down(X7),sK3)
& host(X6) = host(X7)
& host(X4) = host(X5)
& host(X4) != host(X6)
& ( sK4 = X6
| ( setIn(X6,alive)
& sK5 != X6 ) )
& ( sK4 = X4
| ( setIn(X4,alive)
& sK5 != X4 ) ) )
& host(X6) != host(sK5) )
& host(X4) = host(sK5) )
=> ( ? [X6,X5] :
( ? [X7] :
( elem(m_Down(X5),queue(host(X6)))
& elem(m_Down(X7),sK3)
& host(X6) = host(X7)
& host(X5) = host(sK7)
& host(X6) != host(sK7)
& ( sK4 = X6
| ( setIn(X6,alive)
& sK5 != X6 ) )
& ( sK4 = sK7
| ( setIn(sK7,alive)
& sK5 != sK7 ) ) )
& host(X6) != host(sK5) )
& host(sK5) = host(sK7) ) ),
introduced(choice_axiom,[]) ).
fof(f173,plain,
( ? [X6,X5] :
( ? [X7] :
( elem(m_Down(X5),queue(host(X6)))
& elem(m_Down(X7),sK3)
& host(X6) = host(X7)
& host(X5) = host(sK7)
& host(X6) != host(sK7)
& ( sK4 = X6
| ( setIn(X6,alive)
& sK5 != X6 ) )
& ( sK4 = sK7
| ( setIn(sK7,alive)
& sK5 != sK7 ) ) )
& host(X6) != host(sK5) )
=> ( ? [X7] :
( elem(m_Down(sK8),queue(host(sK9)))
& elem(m_Down(X7),sK3)
& host(X7) = host(sK9)
& host(sK7) = host(sK8)
& host(sK7) != host(sK9)
& ( sK4 = sK9
| ( setIn(sK9,alive)
& sK5 != sK9 ) )
& ( sK4 = sK7
| ( setIn(sK7,alive)
& sK5 != sK7 ) ) )
& host(sK5) != host(sK9) ) ),
introduced(choice_axiom,[]) ).
fof(f174,plain,
( ? [X7] :
( elem(m_Down(sK8),queue(host(sK9)))
& elem(m_Down(X7),sK3)
& host(X7) = host(sK9)
& host(sK7) = host(sK8)
& host(sK7) != host(sK9)
& ( sK4 = sK9
| ( setIn(sK9,alive)
& sK5 != sK9 ) )
& ( sK4 = sK7
| ( setIn(sK7,alive)
& sK5 != sK7 ) ) )
=> ( elem(m_Down(sK8),queue(host(sK9)))
& elem(m_Down(sK10),sK3)
& host(sK9) = host(sK10)
& host(sK7) = host(sK8)
& host(sK7) != host(sK9)
& ( sK4 = sK9
| ( setIn(sK9,alive)
& sK5 != sK9 ) )
& ( sK4 = sK7
| ( setIn(sK7,alive)
& sK5 != sK7 ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f175,plain,
( elem(m_Down(sK8),queue(host(sK9)))
& elem(m_Down(sK10),sK3)
& host(sK9) = host(sK10)
& host(sK7) = host(sK8)
& host(sK7) != host(sK9)
& ( sK4 = sK9
| ( setIn(sK9,alive)
& sK5 != sK9 ) )
& ( sK4 = sK7
| ( setIn(sK7,alive)
& sK5 != sK7 ) )
& host(sK5) != host(sK9)
& host(sK5) = host(sK7)
& s(zero) != host(sK4)
& host(sK5) = host(sK4)
& ~ setIn(sK4,pids)
& ! [X8] :
( leq(X8,sK4)
| host(X8) != host(sK5) )
& ( ( host(sK6) = host(index(elid,host(sK5)))
& wait = index(status,host(sK5)) )
| ( norm = index(status,host(sK5))
& host(sK6) = index(ldr,host(sK5)) ) )
& ~ leq(host(sK5),host(sK6))
& setIn(sK5,alive)
& queue(host(sK5)) = cons(m_Down(sK6),sK3)
& ! [X9,X10,X11,X12] :
( ~ elem(m_Down(X10),queue(host(X11)))
| ~ elem(m_Down(X12),queue(host(X9)))
| host(X12) != host(X11)
| 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])],[f170,f174,f173,f172,f171]) ).
fof(f230,plain,
! [X2,X0,X1] :
( elem(X0,cons(X1,X2))
| ~ elem(X0,X2) ),
inference(cnf_transformation,[],[f148]) ).
fof(f262,plain,
! [X0,X1] :
( X0 = X1
| ~ leq(X1,X0)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f166]) ).
fof(f263,plain,
! [X0,X1] :
( leq(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f166]) ).
fof(f274,plain,
! [X22,X23] :
( host(X23) != host(X22)
| ~ elem(m_Down(X23),queue(host(X22))) ),
inference(cnf_transformation,[],[f175]) ).
fof(f277,plain,
! [X16,X15] :
( ~ setIn(X16,alive)
| host(X15) != host(X16)
| ~ leq(X16,X15)
| setIn(X15,alive) ),
inference(cnf_transformation,[],[f175]) ).
fof(f278,plain,
! [X14,X13] :
( ~ setIn(X14,alive)
| ~ setIn(X13,alive)
| host(X13) != host(X14)
| X13 = X14 ),
inference(cnf_transformation,[],[f175]) ).
fof(f279,plain,
! [X10,X11,X9,X12] :
( ~ elem(m_Down(X10),queue(host(X11)))
| ~ elem(m_Down(X12),queue(host(X9)))
| host(X12) != host(X11)
| host(X9) != host(X10)
| ~ setIn(X11,alive)
| ~ setIn(X9,alive)
| host(X9) = host(X11) ),
inference(cnf_transformation,[],[f175]) ).
fof(f280,plain,
queue(host(sK5)) = cons(m_Down(sK6),sK3),
inference(cnf_transformation,[],[f175]) ).
fof(f281,plain,
setIn(sK5,alive),
inference(cnf_transformation,[],[f175]) ).
fof(f287,plain,
! [X8] :
( leq(X8,sK4)
| host(X8) != host(sK5) ),
inference(cnf_transformation,[],[f175]) ).
fof(f289,plain,
host(sK5) = host(sK4),
inference(cnf_transformation,[],[f175]) ).
fof(f291,plain,
host(sK5) = host(sK7),
inference(cnf_transformation,[],[f175]) ).
fof(f292,plain,
host(sK5) != host(sK9),
inference(cnf_transformation,[],[f175]) ).
fof(f296,plain,
( sK4 = sK9
| setIn(sK9,alive) ),
inference(cnf_transformation,[],[f175]) ).
fof(f298,plain,
host(sK7) = host(sK8),
inference(cnf_transformation,[],[f175]) ).
fof(f299,plain,
host(sK9) = host(sK10),
inference(cnf_transformation,[],[f175]) ).
fof(f300,plain,
elem(m_Down(sK10),sK3),
inference(cnf_transformation,[],[f175]) ).
fof(f301,plain,
elem(m_Down(sK8),queue(host(sK9))),
inference(cnf_transformation,[],[f175]) ).
fof(f313,plain,
! [X1] : leq(X1,X1),
inference(equality_resolution,[],[f263]) ).
cnf(c_95,plain,
( ~ elem(X0,X1)
| elem(X0,cons(X2,X1)) ),
inference(cnf_transformation,[],[f230]) ).
cnf(c_130,plain,
leq(X0,X0),
inference(cnf_transformation,[],[f313]) ).
cnf(c_131,plain,
( ~ leq(X0,X1)
| ~ leq(X1,X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f262]) ).
cnf(c_139,negated_conjecture,
elem(m_Down(sK8),queue(host(sK9))),
inference(cnf_transformation,[],[f301]) ).
cnf(c_140,negated_conjecture,
elem(m_Down(sK10),sK3),
inference(cnf_transformation,[],[f300]) ).
cnf(c_141,negated_conjecture,
host(sK9) = host(sK10),
inference(cnf_transformation,[],[f299]) ).
cnf(c_142,negated_conjecture,
host(sK8) = host(sK7),
inference(cnf_transformation,[],[f298]) ).
cnf(c_144,negated_conjecture,
( sK9 = sK4
| setIn(sK9,alive) ),
inference(cnf_transformation,[],[f296]) ).
cnf(c_148,negated_conjecture,
host(sK9) != host(sK5),
inference(cnf_transformation,[],[f292]) ).
cnf(c_149,negated_conjecture,
host(sK7) = host(sK5),
inference(cnf_transformation,[],[f291]) ).
cnf(c_151,negated_conjecture,
host(sK4) = host(sK5),
inference(cnf_transformation,[],[f289]) ).
cnf(c_153,negated_conjecture,
( host(X0) != host(sK5)
| leq(X0,sK4) ),
inference(cnf_transformation,[],[f287]) ).
cnf(c_159,negated_conjecture,
setIn(sK5,alive),
inference(cnf_transformation,[],[f281]) ).
cnf(c_160,negated_conjecture,
cons(m_Down(sK6),sK3) = queue(host(sK5)),
inference(cnf_transformation,[],[f280]) ).
cnf(c_161,negated_conjecture,
( host(X0) != host(X1)
| host(X2) != host(X3)
| ~ elem(m_Down(X0),queue(host(X2)))
| ~ elem(m_Down(X3),queue(host(X1)))
| ~ setIn(X1,alive)
| ~ setIn(X2,alive)
| host(X1) = host(X2) ),
inference(cnf_transformation,[],[f279]) ).
cnf(c_162,negated_conjecture,
( host(X0) != host(X1)
| ~ setIn(X0,alive)
| ~ setIn(X1,alive)
| X0 = X1 ),
inference(cnf_transformation,[],[f278]) ).
cnf(c_163,negated_conjecture,
( host(X0) != host(X1)
| ~ leq(X1,X0)
| ~ setIn(X1,alive)
| setIn(X0,alive) ),
inference(cnf_transformation,[],[f277]) ).
cnf(c_166,negated_conjecture,
( host(X0) != host(X1)
| ~ elem(m_Down(X0),queue(host(X1))) ),
inference(cnf_transformation,[],[f274]) ).
cnf(c_169,plain,
leq(sK5,sK5),
inference(instantiation,[status(thm)],[c_130]) ).
cnf(c_213,plain,
( host(sK5) != host(sK5)
| leq(sK5,sK4) ),
inference(instantiation,[status(thm)],[c_153]) ).
cnf(c_223,plain,
( ~ leq(sK5,sK5)
| sK5 = sK5 ),
inference(instantiation,[status(thm)],[c_131]) ).
cnf(c_950,plain,
host(sK8) = host(sK5),
inference(light_normalisation,[status(thm)],[c_142,c_149]) ).
cnf(c_2291,plain,
( X0 != X1
| host(X0) = host(X1) ),
theory(equality) ).
cnf(c_2308,plain,
( sK5 != sK5
| host(sK5) = host(sK5) ),
inference(instantiation,[status(thm)],[c_2291]) ).
cnf(c_4131,plain,
( host(X0) != host(sK9)
| ~ elem(m_Down(sK10),queue(host(X0))) ),
inference(superposition,[status(thm)],[c_141,c_166]) ).
cnf(c_4247,plain,
( host(X0) != host(sK5)
| ~ setIn(X0,alive)
| ~ leq(X0,sK4)
| setIn(sK4,alive) ),
inference(superposition,[status(thm)],[c_151,c_163]) ).
cnf(c_4306,plain,
( host(sK5) != host(sK5)
| ~ setIn(sK5,alive)
| ~ leq(sK5,sK4)
| setIn(sK4,alive) ),
inference(instantiation,[status(thm)],[c_4247]) ).
cnf(c_4329,plain,
( host(X0) != host(sK5)
| ~ setIn(X0,alive)
| ~ setIn(sK4,alive)
| X0 = sK4 ),
inference(superposition,[status(thm)],[c_151,c_162]) ).
cnf(c_4376,plain,
( host(X0) != host(X1)
| host(X2) != host(sK5)
| ~ elem(m_Down(X1),queue(host(X2)))
| ~ elem(m_Down(sK8),queue(host(X0)))
| ~ setIn(X0,alive)
| ~ setIn(X2,alive)
| host(X0) = host(X2) ),
inference(superposition,[status(thm)],[c_950,c_161]) ).
cnf(c_4659,plain,
( ~ setIn(X0,alive)
| host(X0) != host(sK5)
| X0 = sK4 ),
inference(global_subsumption_just,[status(thm)],[c_4329,c_159,c_169,c_213,c_223,c_2308,c_4306,c_4329]) ).
cnf(c_4660,plain,
( host(X0) != host(sK5)
| ~ setIn(X0,alive)
| X0 = sK4 ),
inference(renaming,[status(thm)],[c_4659]) ).
cnf(c_4673,plain,
( ~ setIn(sK5,alive)
| sK4 = sK5 ),
inference(equality_resolution,[status(thm)],[c_4660]) ).
cnf(c_4674,plain,
sK4 = sK5,
inference(forward_subsumption_resolution,[status(thm)],[c_4673,c_159]) ).
cnf(c_4691,plain,
( sK9 = sK5
| setIn(sK9,alive) ),
inference(demodulation,[status(thm)],[c_144,c_4674]) ).
cnf(c_4978,plain,
( ~ elem(X0,sK3)
| elem(X0,queue(host(sK5))) ),
inference(superposition,[status(thm)],[c_160,c_95]) ).
cnf(c_7749,plain,
( sK9 != sK5
| host(sK9) = host(sK5) ),
inference(instantiation,[status(thm)],[c_2291]) ).
cnf(c_8005,plain,
( host(X0) != host(sK9)
| host(X1) != host(sK5)
| ~ elem(m_Down(sK8),queue(host(X0)))
| ~ elem(m_Down(sK10),queue(host(X1)))
| ~ setIn(X0,alive)
| ~ setIn(X1,alive)
| host(X0) = host(X1) ),
inference(superposition,[status(thm)],[c_141,c_4376]) ).
cnf(c_8518,plain,
( host(X0) != host(sK5)
| ~ elem(m_Down(sK10),queue(host(X0)))
| ~ elem(m_Down(sK8),queue(host(sK9)))
| ~ setIn(X0,alive)
| ~ setIn(sK9,alive)
| host(X0) = host(sK9) ),
inference(equality_resolution,[status(thm)],[c_8005]) ).
cnf(c_8519,plain,
( host(X0) != host(sK5)
| ~ elem(m_Down(sK10),queue(host(X0)))
| ~ setIn(X0,alive)
| ~ setIn(sK9,alive)
| host(X0) = host(sK9) ),
inference(forward_subsumption_resolution,[status(thm)],[c_8518,c_139]) ).
cnf(c_8603,plain,
( host(X0) != host(sK5)
| ~ elem(m_Down(sK10),queue(host(X0)))
| ~ setIn(X0,alive) ),
inference(global_subsumption_just,[status(thm)],[c_8519,c_148,c_4131,c_4691,c_7749,c_8519]) ).
cnf(c_8616,plain,
( ~ elem(m_Down(sK10),queue(host(sK5)))
| ~ setIn(sK5,alive) ),
inference(equality_resolution,[status(thm)],[c_8603]) ).
cnf(c_8617,plain,
~ elem(m_Down(sK10),queue(host(sK5))),
inference(forward_subsumption_resolution,[status(thm)],[c_8616,c_159]) ).
cnf(c_8626,plain,
~ elem(m_Down(sK10),sK3),
inference(superposition,[status(thm)],[c_4978,c_8617]) ).
cnf(c_8627,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_8626,c_140]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWV452+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.12/0.35 % Computer : n014.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 300
% 0.12/0.35 % DateTime : Tue Aug 29 07:31:15 EDT 2023
% 0.12/0.35 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.45/1.16 % SZS status Started for theBenchmark.p
% 0.45/1.16 % SZS status Theorem for theBenchmark.p
% 0.45/1.16
% 0.45/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.45/1.16
% 0.45/1.16 ------ iProver source info
% 0.45/1.16
% 0.45/1.16 git: date: 2023-05-31 18:12:56 +0000
% 0.45/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.45/1.16 git: non_committed_changes: false
% 0.45/1.16 git: last_make_outside_of_git: false
% 0.45/1.16
% 0.45/1.16 ------ Parsing...
% 0.45/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.45/1.16
% 0.45/1.16 ------ Preprocessing... sup_sim: 5 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.45/1.16
% 0.45/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.45/1.16
% 0.45/1.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.45/1.16 ------ Proving...
% 0.45/1.16 ------ Problem Properties
% 0.45/1.16
% 0.45/1.16
% 0.45/1.16 clauses 114
% 0.45/1.16 conjectures 26
% 0.45/1.16 EPR 20
% 0.45/1.16 Horn 93
% 0.45/1.16 unary 57
% 0.45/1.16 binary 35
% 0.45/1.16 lits 206
% 0.45/1.16 lits eq 91
% 0.45/1.16 fd_pure 0
% 0.45/1.16 fd_pseudo 0
% 0.45/1.16 fd_cond 0
% 0.45/1.16 fd_pseudo_cond 12
% 0.45/1.16 AC symbols 0
% 0.45/1.16
% 0.45/1.16 ------ Schedule dynamic 5 is on
% 0.45/1.16
% 0.45/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.45/1.16
% 0.45/1.16
% 0.45/1.16 ------
% 0.45/1.16 Current options:
% 0.45/1.16 ------
% 0.45/1.16
% 0.45/1.16
% 0.45/1.16
% 0.45/1.16
% 0.45/1.16 ------ Proving...
% 0.45/1.16
% 0.45/1.16
% 0.45/1.16 % SZS status Theorem for theBenchmark.p
% 0.45/1.16
% 0.45/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.45/1.16
% 0.45/1.16
%------------------------------------------------------------------------------