TSTP Solution File: SWV455+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWV455+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n004.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:35 EDT 2023
% Result : Theorem 3.06s 1.16s
% Output : CNFRefutation 3.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 7
% Syntax : Number of formulae : 50 ( 22 unt; 0 def)
% Number of atoms : 566 ( 235 equ)
% Maximal formula atoms : 92 ( 11 avg)
% Number of connectives : 843 ( 327 ~; 181 |; 277 &)
% ( 2 <=>; 56 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 7 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 25 ( 25 usr; 17 con; 0-2 aty)
% Number of variables : 287 ( 3 sgn; 216 !; 50 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f47,axiom,
! [X4,X5,X3] :
( elem(X4,cons(X5,X3))
<=> ( elem(X4,X3)
| X4 = X5 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_46) ).
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)) ) )
=> ( ~ ( elec_1 = index(status,host(X4))
& ! [X6] :
( ( leq(s(zero),X6)
& ~ leq(host(X4),X6) )
=> ( host(X5) = X6
| setIn(X6,index(down,host(X4))) ) ) )
=> ! [X6] :
( host(X4) != host(X6)
=> ! [X16,X17] :
( host(X4) = host(X17)
=> ! [X18] :
( ( host(X17) = host(X18)
& host(X6) = host(X16)
& setIn(X17,alive)
& setIn(X6,alive)
& host(X6) != host(X17) )
=> ~ ( elem(m_Down(X18),queue(host(X6)))
& elem(m_Down(X16),X11) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/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)) ) )
=> ( ~ ( elec_1 = index(status,host(X4))
& ! [X6] :
( ( leq(s(zero),X6)
& ~ leq(host(X4),X6) )
=> ( host(X5) = X6
| setIn(X6,index(down,host(X4))) ) ) )
=> ! [X6] :
( host(X4) != host(X6)
=> ! [X16,X17] :
( host(X4) = host(X17)
=> ! [X18] :
( ( host(X17) = host(X18)
& host(X6) = host(X16)
& setIn(X17,alive)
& setIn(X6,alive)
& host(X6) != host(X17) )
=> ~ ( elem(m_Down(X18),queue(host(X6)))
& elem(m_Down(X16),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(f124,plain,
~ ! [X0,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)) ) )
=> ( ~ ( elec_1 = index(status,host(X2))
& ! [X23] :
( ( leq(s(zero),X23)
& ~ leq(host(X2),X23) )
=> ( host(X3) = X23
| setIn(X23,index(down,host(X2))) ) ) )
=> ! [X24] :
( host(X2) != host(X24)
=> ! [X25,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),queue(host(X24)))
& elem(m_Down(X25),X0) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f68]) ).
fof(f140,plain,
? [X0,X2,X3] :
( ? [X24] :
( ? [X25,X26] :
( ? [X27] :
( elem(m_Down(X27),queue(host(X24)))
& elem(m_Down(X25),X0)
& host(X26) = host(X27)
& host(X24) = host(X25)
& setIn(X26,alive)
& setIn(X24,alive)
& host(X24) != host(X26) )
& host(X2) = host(X26) )
& host(X2) != host(X24) )
& ( elec_1 != index(status,host(X2))
| ? [X23] :
( host(X3) != X23
& ~ setIn(X23,index(down,host(X2)))
& leq(s(zero),X23)
& ~ leq(host(X2),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,X2,X3] :
( ? [X24] :
( ? [X25,X26] :
( ? [X27] :
( elem(m_Down(X27),queue(host(X24)))
& elem(m_Down(X25),X0)
& host(X26) = host(X27)
& host(X24) = host(X25)
& setIn(X26,alive)
& setIn(X24,alive)
& host(X24) != host(X26) )
& host(X2) = host(X26) )
& host(X2) != host(X24) )
& ( elec_1 != index(status,host(X2))
| ? [X23] :
( host(X3) != X23
& ~ setIn(X23,index(down,host(X2)))
& leq(s(zero),X23)
& ~ leq(host(X2),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(f170,plain,
? [X0,X1,X2] :
( ? [X3] :
( ? [X4,X5] :
( ? [X6] :
( elem(m_Down(X6),queue(host(X3)))
& elem(m_Down(X4),X0)
& host(X5) = host(X6)
& host(X3) = host(X4)
& setIn(X5,alive)
& setIn(X3,alive)
& host(X3) != host(X5) )
& host(X1) = host(X5) )
& host(X3) != host(X1) )
& ( elec_1 != index(status,host(X1))
| ? [X7] :
( host(X2) != X7
& ~ setIn(X7,index(down,host(X1)))
& leq(s(zero),X7)
& ~ leq(host(X1),X7) ) )
& ( host(X2) != host(index(elid,host(X1)))
| wait != index(status,host(X1)) )
& ( norm != index(status,host(X1))
| host(X2) != index(ldr,host(X1)) )
& ~ leq(host(X1),host(X2))
& setIn(X1,alive)
& queue(host(X1)) = cons(m_Down(X2),X0)
& ! [X8,X9,X10,X11] :
( ~ elem(m_Down(X9),queue(host(X10)))
| ~ elem(m_Down(X11),queue(host(X8)))
| host(X10) != host(X11)
| host(X8) != host(X9)
| ~ setIn(X10,alive)
| ~ setIn(X8,alive)
| host(X8) = host(X10) )
& ! [X12,X13] :
( ~ setIn(X13,alive)
| ~ setIn(X12,alive)
| host(X13) != host(X12)
| X12 = X13 )
& ! [X14,X15] :
( ~ setIn(X15,alive)
| host(X14) != host(X15)
| ~ leq(X15,X14)
| setIn(X14,alive) )
& ! [X16,X17,X18] :
( ~ leq(host(X16),host(X18))
| ~ elem(m_Ack(X18,X16),queue(host(X17))) )
& ! [X19,X20] :
( ~ leq(host(X19),host(X20))
| ~ elem(m_Halt(X20),queue(host(X19))) )
& ! [X21,X22] :
( host(X21) != host(X22)
| ~ elem(m_Down(X22),queue(host(X21))) )
& ! [X23,X24] :
( ~ setIn(X24,alive)
| ~ elem(m_Down(X24),queue(host(X23))) )
& ! [X25,X26] :
( ~ elem(m_Down(X26),queue(host(X25)))
| ~ setIn(X26,alive) ) ),
inference(rectify,[],[f141]) ).
fof(f171,plain,
( ? [X0,X1,X2] :
( ? [X3] :
( ? [X4,X5] :
( ? [X6] :
( elem(m_Down(X6),queue(host(X3)))
& elem(m_Down(X4),X0)
& host(X5) = host(X6)
& host(X3) = host(X4)
& setIn(X5,alive)
& setIn(X3,alive)
& host(X3) != host(X5) )
& host(X1) = host(X5) )
& host(X3) != host(X1) )
& ( elec_1 != index(status,host(X1))
| ? [X7] :
( host(X2) != X7
& ~ setIn(X7,index(down,host(X1)))
& leq(s(zero),X7)
& ~ leq(host(X1),X7) ) )
& ( host(X2) != host(index(elid,host(X1)))
| wait != index(status,host(X1)) )
& ( norm != index(status,host(X1))
| host(X2) != index(ldr,host(X1)) )
& ~ leq(host(X1),host(X2))
& setIn(X1,alive)
& queue(host(X1)) = cons(m_Down(X2),X0)
& ! [X8,X9,X10,X11] :
( ~ elem(m_Down(X9),queue(host(X10)))
| ~ elem(m_Down(X11),queue(host(X8)))
| host(X10) != host(X11)
| host(X8) != host(X9)
| ~ setIn(X10,alive)
| ~ setIn(X8,alive)
| host(X8) = host(X10) )
& ! [X12,X13] :
( ~ setIn(X13,alive)
| ~ setIn(X12,alive)
| host(X13) != host(X12)
| X12 = X13 )
& ! [X14,X15] :
( ~ setIn(X15,alive)
| host(X14) != host(X15)
| ~ leq(X15,X14)
| setIn(X14,alive) )
& ! [X16,X17,X18] :
( ~ leq(host(X16),host(X18))
| ~ elem(m_Ack(X18,X16),queue(host(X17))) )
& ! [X19,X20] :
( ~ leq(host(X19),host(X20))
| ~ elem(m_Halt(X20),queue(host(X19))) )
& ! [X21,X22] :
( host(X21) != host(X22)
| ~ elem(m_Down(X22),queue(host(X21))) )
& ! [X23,X24] :
( ~ setIn(X24,alive)
| ~ elem(m_Down(X24),queue(host(X23))) )
& ! [X25,X26] :
( ~ elem(m_Down(X26),queue(host(X25)))
| ~ setIn(X26,alive) ) )
=> ( ? [X3] :
( ? [X5,X4] :
( ? [X6] :
( elem(m_Down(X6),queue(host(X3)))
& elem(m_Down(X4),sK3)
& host(X5) = host(X6)
& host(X3) = host(X4)
& setIn(X5,alive)
& setIn(X3,alive)
& host(X3) != host(X5) )
& host(X5) = host(sK4) )
& host(X3) != host(sK4) )
& ( elec_1 != index(status,host(sK4))
| ? [X7] :
( host(sK5) != X7
& ~ setIn(X7,index(down,host(sK4)))
& leq(s(zero),X7)
& ~ leq(host(sK4),X7) ) )
& ( host(sK5) != host(index(elid,host(sK4)))
| wait != index(status,host(sK4)) )
& ( norm != index(status,host(sK4))
| host(sK5) != index(ldr,host(sK4)) )
& ~ leq(host(sK4),host(sK5))
& setIn(sK4,alive)
& queue(host(sK4)) = cons(m_Down(sK5),sK3)
& ! [X8,X9,X10,X11] :
( ~ elem(m_Down(X9),queue(host(X10)))
| ~ elem(m_Down(X11),queue(host(X8)))
| host(X10) != host(X11)
| host(X8) != host(X9)
| ~ setIn(X10,alive)
| ~ setIn(X8,alive)
| host(X8) = host(X10) )
& ! [X12,X13] :
( ~ setIn(X13,alive)
| ~ setIn(X12,alive)
| host(X13) != host(X12)
| X12 = X13 )
& ! [X14,X15] :
( ~ setIn(X15,alive)
| host(X14) != host(X15)
| ~ leq(X15,X14)
| setIn(X14,alive) )
& ! [X16,X17,X18] :
( ~ leq(host(X16),host(X18))
| ~ elem(m_Ack(X18,X16),queue(host(X17))) )
& ! [X19,X20] :
( ~ leq(host(X19),host(X20))
| ~ elem(m_Halt(X20),queue(host(X19))) )
& ! [X21,X22] :
( host(X21) != host(X22)
| ~ elem(m_Down(X22),queue(host(X21))) )
& ! [X23,X24] :
( ~ setIn(X24,alive)
| ~ elem(m_Down(X24),queue(host(X23))) )
& ! [X25,X26] :
( ~ elem(m_Down(X26),queue(host(X25)))
| ~ setIn(X26,alive) ) ) ),
introduced(choice_axiom,[]) ).
fof(f172,plain,
( ? [X3] :
( ? [X5,X4] :
( ? [X6] :
( elem(m_Down(X6),queue(host(X3)))
& elem(m_Down(X4),sK3)
& host(X5) = host(X6)
& host(X3) = host(X4)
& setIn(X5,alive)
& setIn(X3,alive)
& host(X3) != host(X5) )
& host(X5) = host(sK4) )
& host(X3) != host(sK4) )
=> ( ? [X5,X4] :
( ? [X6] :
( elem(m_Down(X6),queue(host(sK6)))
& elem(m_Down(X4),sK3)
& host(X5) = host(X6)
& host(X4) = host(sK6)
& setIn(X5,alive)
& setIn(sK6,alive)
& host(X5) != host(sK6) )
& host(X5) = host(sK4) )
& host(sK4) != host(sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f173,plain,
( ? [X5,X4] :
( ? [X6] :
( elem(m_Down(X6),queue(host(sK6)))
& elem(m_Down(X4),sK3)
& host(X5) = host(X6)
& host(X4) = host(sK6)
& setIn(X5,alive)
& setIn(sK6,alive)
& host(X5) != host(sK6) )
& host(X5) = host(sK4) )
=> ( ? [X6] :
( elem(m_Down(X6),queue(host(sK6)))
& elem(m_Down(sK7),sK3)
& host(X6) = host(sK8)
& host(sK6) = host(sK7)
& setIn(sK8,alive)
& setIn(sK6,alive)
& host(sK6) != host(sK8) )
& host(sK4) = host(sK8) ) ),
introduced(choice_axiom,[]) ).
fof(f174,plain,
( ? [X6] :
( elem(m_Down(X6),queue(host(sK6)))
& elem(m_Down(sK7),sK3)
& host(X6) = host(sK8)
& host(sK6) = host(sK7)
& setIn(sK8,alive)
& setIn(sK6,alive)
& host(sK6) != host(sK8) )
=> ( elem(m_Down(sK9),queue(host(sK6)))
& elem(m_Down(sK7),sK3)
& host(sK8) = host(sK9)
& host(sK6) = host(sK7)
& setIn(sK8,alive)
& setIn(sK6,alive)
& host(sK6) != host(sK8) ) ),
introduced(choice_axiom,[]) ).
fof(f175,plain,
( ? [X7] :
( host(sK5) != X7
& ~ setIn(X7,index(down,host(sK4)))
& leq(s(zero),X7)
& ~ leq(host(sK4),X7) )
=> ( host(sK5) != sK10
& ~ setIn(sK10,index(down,host(sK4)))
& leq(s(zero),sK10)
& ~ leq(host(sK4),sK10) ) ),
introduced(choice_axiom,[]) ).
fof(f176,plain,
( elem(m_Down(sK9),queue(host(sK6)))
& elem(m_Down(sK7),sK3)
& host(sK8) = host(sK9)
& host(sK6) = host(sK7)
& setIn(sK8,alive)
& setIn(sK6,alive)
& host(sK6) != host(sK8)
& host(sK4) = host(sK8)
& host(sK4) != host(sK6)
& ( elec_1 != index(status,host(sK4))
| ( host(sK5) != sK10
& ~ setIn(sK10,index(down,host(sK4)))
& leq(s(zero),sK10)
& ~ leq(host(sK4),sK10) ) )
& ( host(sK5) != host(index(elid,host(sK4)))
| wait != index(status,host(sK4)) )
& ( norm != index(status,host(sK4))
| host(sK5) != index(ldr,host(sK4)) )
& ~ leq(host(sK4),host(sK5))
& setIn(sK4,alive)
& queue(host(sK4)) = cons(m_Down(sK5),sK3)
& ! [X8,X9,X10,X11] :
( ~ elem(m_Down(X9),queue(host(X10)))
| ~ elem(m_Down(X11),queue(host(X8)))
| host(X10) != host(X11)
| host(X8) != host(X9)
| ~ setIn(X10,alive)
| ~ setIn(X8,alive)
| host(X8) = host(X10) )
& ! [X12,X13] :
( ~ setIn(X13,alive)
| ~ setIn(X12,alive)
| host(X13) != host(X12)
| X12 = X13 )
& ! [X14,X15] :
( ~ setIn(X15,alive)
| host(X14) != host(X15)
| ~ leq(X15,X14)
| setIn(X14,alive) )
& ! [X16,X17,X18] :
( ~ leq(host(X16),host(X18))
| ~ elem(m_Ack(X18,X16),queue(host(X17))) )
& ! [X19,X20] :
( ~ leq(host(X19),host(X20))
| ~ elem(m_Halt(X20),queue(host(X19))) )
& ! [X21,X22] :
( host(X21) != host(X22)
| ~ elem(m_Down(X22),queue(host(X21))) )
& ! [X23,X24] :
( ~ setIn(X24,alive)
| ~ elem(m_Down(X24),queue(host(X23))) )
& ! [X25,X26] :
( ~ elem(m_Down(X26),queue(host(X25)))
| ~ setIn(X26,alive) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6,sK7,sK8,sK9,sK10])],[f170,f175,f174,f173,f172,f171]) ).
fof(f231,plain,
! [X2,X0,X1] :
( elem(X0,cons(X1,X2))
| ~ elem(X0,X2) ),
inference(cnf_transformation,[],[f148]) ).
fof(f280,plain,
! [X10,X11,X8,X9] :
( ~ elem(m_Down(X9),queue(host(X10)))
| ~ elem(m_Down(X11),queue(host(X8)))
| host(X10) != host(X11)
| host(X8) != host(X9)
| ~ setIn(X10,alive)
| ~ setIn(X8,alive)
| host(X8) = host(X10) ),
inference(cnf_transformation,[],[f176]) ).
fof(f281,plain,
queue(host(sK4)) = cons(m_Down(sK5),sK3),
inference(cnf_transformation,[],[f176]) ).
fof(f290,plain,
host(sK4) != host(sK6),
inference(cnf_transformation,[],[f176]) ).
fof(f291,plain,
host(sK4) = host(sK8),
inference(cnf_transformation,[],[f176]) ).
fof(f293,plain,
setIn(sK6,alive),
inference(cnf_transformation,[],[f176]) ).
fof(f294,plain,
setIn(sK8,alive),
inference(cnf_transformation,[],[f176]) ).
fof(f295,plain,
host(sK6) = host(sK7),
inference(cnf_transformation,[],[f176]) ).
fof(f296,plain,
host(sK8) = host(sK9),
inference(cnf_transformation,[],[f176]) ).
fof(f297,plain,
elem(m_Down(sK7),sK3),
inference(cnf_transformation,[],[f176]) ).
fof(f298,plain,
elem(m_Down(sK9),queue(host(sK6))),
inference(cnf_transformation,[],[f176]) ).
cnf(c_95,plain,
( ~ elem(X0,X1)
| elem(X0,cons(X2,X1)) ),
inference(cnf_transformation,[],[f231]) ).
cnf(c_139,negated_conjecture,
elem(m_Down(sK9),queue(host(sK6))),
inference(cnf_transformation,[],[f298]) ).
cnf(c_140,negated_conjecture,
elem(m_Down(sK7),sK3),
inference(cnf_transformation,[],[f297]) ).
cnf(c_141,negated_conjecture,
host(sK9) = host(sK8),
inference(cnf_transformation,[],[f296]) ).
cnf(c_142,negated_conjecture,
host(sK6) = host(sK7),
inference(cnf_transformation,[],[f295]) ).
cnf(c_143,negated_conjecture,
setIn(sK8,alive),
inference(cnf_transformation,[],[f294]) ).
cnf(c_144,negated_conjecture,
setIn(sK6,alive),
inference(cnf_transformation,[],[f293]) ).
cnf(c_146,negated_conjecture,
host(sK8) = host(sK4),
inference(cnf_transformation,[],[f291]) ).
cnf(c_147,negated_conjecture,
host(sK6) != host(sK4),
inference(cnf_transformation,[],[f290]) ).
cnf(c_156,negated_conjecture,
cons(m_Down(sK5),sK3) = queue(host(sK4)),
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_916,plain,
host(sK9) = host(sK4),
inference(light_normalisation,[status(thm)],[c_141,c_146]) ).
cnf(c_4072,plain,
( host(X0) != host(X1)
| host(X2) != host(sK4)
| ~ elem(m_Down(X2),queue(host(X0)))
| ~ elem(m_Down(X1),queue(host(sK8)))
| ~ setIn(X0,alive)
| ~ setIn(sK8,alive)
| host(X0) = host(sK8) ),
inference(superposition,[status(thm)],[c_146,c_157]) ).
cnf(c_4114,plain,
( host(X0) != host(X1)
| host(X2) != host(sK4)
| ~ elem(m_Down(X2),queue(host(X0)))
| ~ elem(m_Down(X1),queue(host(sK4)))
| ~ setIn(X0,alive)
| ~ setIn(sK8,alive)
| host(X0) = host(sK4) ),
inference(light_normalisation,[status(thm)],[c_4072,c_146]) ).
cnf(c_4115,plain,
( host(X0) != host(X1)
| host(X2) != host(sK4)
| ~ elem(m_Down(X2),queue(host(X0)))
| ~ elem(m_Down(X1),queue(host(sK4)))
| ~ setIn(X0,alive)
| host(X0) = host(sK4) ),
inference(forward_subsumption_resolution,[status(thm)],[c_4114,c_143]) ).
cnf(c_4271,plain,
( host(X0) != host(sK6)
| host(X1) != host(sK4)
| ~ elem(m_Down(X1),queue(host(X0)))
| ~ elem(m_Down(sK7),queue(host(sK4)))
| ~ setIn(X0,alive)
| host(X0) = host(sK4) ),
inference(superposition,[status(thm)],[c_142,c_4115]) ).
cnf(c_4373,plain,
( host(X0) != host(sK4)
| ~ elem(m_Down(X0),queue(host(sK6)))
| ~ elem(m_Down(sK7),queue(host(sK4)))
| ~ setIn(sK6,alive)
| host(sK6) = host(sK4) ),
inference(equality_resolution,[status(thm)],[c_4271]) ).
cnf(c_4374,plain,
( host(X0) != host(sK4)
| ~ elem(m_Down(X0),queue(host(sK6)))
| ~ elem(m_Down(sK7),queue(host(sK4))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_4373,c_147,c_144]) ).
cnf(c_4387,plain,
( ~ elem(m_Down(sK9),queue(host(sK6)))
| ~ elem(m_Down(sK7),queue(host(sK4))) ),
inference(superposition,[status(thm)],[c_916,c_4374]) ).
cnf(c_4392,plain,
~ elem(m_Down(sK7),queue(host(sK4))),
inference(forward_subsumption_resolution,[status(thm)],[c_4387,c_139]) ).
cnf(c_4576,plain,
( ~ elem(X0,sK3)
| elem(X0,queue(host(sK4))) ),
inference(superposition,[status(thm)],[c_156,c_95]) ).
cnf(c_4603,plain,
~ elem(m_Down(sK7),sK3),
inference(superposition,[status(thm)],[c_4576,c_4392]) ).
cnf(c_4606,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_4603,c_140]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV455+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n004.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 29 03:47:37 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.06/1.16 % SZS status Started for theBenchmark.p
% 3.06/1.16 % SZS status Theorem for theBenchmark.p
% 3.06/1.16
% 3.06/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.06/1.16
% 3.06/1.16 ------ iProver source info
% 3.06/1.16
% 3.06/1.16 git: date: 2023-05-31 18:12:56 +0000
% 3.06/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.06/1.16 git: non_committed_changes: false
% 3.06/1.16 git: last_make_outside_of_git: false
% 3.06/1.16
% 3.06/1.16 ------ Parsing...
% 3.06/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.06/1.16
% 3.06/1.16 ------ Preprocessing... sup_sim: 4 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 3.06/1.16
% 3.06/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.06/1.16
% 3.06/1.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.06/1.16 ------ Proving...
% 3.06/1.16 ------ Problem Properties
% 3.06/1.16
% 3.06/1.16
% 3.06/1.16 clauses 110
% 3.06/1.16 conjectures 23
% 3.06/1.16 EPR 17
% 3.06/1.16 Horn 95
% 3.06/1.16 unary 56
% 3.06/1.16 binary 32
% 3.06/1.16 lits 199
% 3.06/1.16 lits eq 83
% 3.06/1.16 fd_pure 0
% 3.06/1.16 fd_pseudo 0
% 3.06/1.16 fd_cond 0
% 3.06/1.16 fd_pseudo_cond 12
% 3.06/1.16 AC symbols 0
% 3.06/1.16
% 3.06/1.16 ------ Schedule dynamic 5 is on
% 3.06/1.16
% 3.06/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.06/1.16
% 3.06/1.16
% 3.06/1.16 ------
% 3.06/1.16 Current options:
% 3.06/1.16 ------
% 3.06/1.16
% 3.06/1.16
% 3.06/1.16
% 3.06/1.16
% 3.06/1.16 ------ Proving...
% 3.06/1.16
% 3.06/1.16
% 3.06/1.16 % SZS status Theorem for theBenchmark.p
% 3.06/1.16
% 3.06/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.06/1.16
% 3.06/1.16
%------------------------------------------------------------------------------