TSTP Solution File: SWV450+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWV450+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n013.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 : Sun May 5 10:34:39 EDT 2024
% Result : Theorem 0.59s 0.76s
% Output : Refutation 0.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 9
% Syntax : Number of formulae : 49 ( 15 unt; 0 def)
% Number of atoms : 585 ( 266 equ)
% Maximal formula atoms : 88 ( 11 avg)
% Number of connectives : 817 ( 281 ~; 176 |; 297 &)
% ( 4 <=>; 59 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 9 avg)
% Maximal term depth : 4 ( 2 avg)
% 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 : 317 ( 255 !; 62 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1075,plain,
$false,
inference(subsumption_resolution,[],[f1073,f140]) ).
fof(f140,plain,
elem(m_Down(sK8),sK0),
inference(cnf_transformation,[],[f106]) ).
fof(f106,plain,
( elem(m_Down(sK6),snoc(queue(host(sK7)),m_Ldr(sK2)))
& elem(m_Down(sK8),sK0)
& host(sK7) = host(sK8)
& host(sK5) = host(sK6)
& setIn(sK7,alive)
& setIn(sK5,alive)
& host(sK5) != host(sK7)
& host(sK2) != host(sK7)
& host(sK4) = host(sK7)
& host(sK2) = host(sK5)
& host(sK4) != host(sK5)
& ( host(sK3) = host(sK4)
| setIn(host(sK4),index(acks,host(sK2))) )
& leq(nbr_proc,index(pendack,host(sK2)))
& host(sK3) = index(pendack,host(sK2))
& elec_2 = index(status,host(sK2))
& sK1 = index(elid,host(sK2))
& setIn(sK2,alive)
& queue(host(sK2)) = cons(m_Ack(sK1,sK3),sK0)
& ! [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,[sK0,sK1,sK2,sK3,sK4,sK5,sK6,sK7,sK8])],[f100,f105,f104,f103,f102,f101]) ).
fof(f101,plain,
( ? [X0,X1,X2,X3] :
( ? [X4] :
( ? [X5] :
( ? [X6,X7] :
( ? [X8] :
( elem(m_Down(X6),snoc(queue(host(X7)),m_Ldr(X2)))
& elem(m_Down(X8),X0)
& 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(X6),snoc(queue(host(X7)),m_Ldr(sK2)))
& elem(m_Down(X8),sK0)
& host(X7) = host(X8)
& host(X5) = host(X6)
& setIn(X7,alive)
& setIn(X5,alive)
& host(X5) != host(X7) )
& host(X7) != host(sK2)
& host(X4) = host(X7) )
& host(X5) = host(sK2)
& host(X4) != host(X5) )
& ( host(X4) = host(sK3)
| setIn(host(X4),index(acks,host(sK2))) ) )
& leq(nbr_proc,index(pendack,host(sK2)))
& host(sK3) = index(pendack,host(sK2))
& elec_2 = index(status,host(sK2))
& sK1 = index(elid,host(sK2))
& setIn(sK2,alive)
& queue(host(sK2)) = cons(m_Ack(sK1,sK3),sK0)
& ! [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(f102,plain,
( ? [X4] :
( ? [X5] :
( ? [X7,X6] :
( ? [X8] :
( elem(m_Down(X6),snoc(queue(host(X7)),m_Ldr(sK2)))
& elem(m_Down(X8),sK0)
& host(X7) = host(X8)
& host(X5) = host(X6)
& setIn(X7,alive)
& setIn(X5,alive)
& host(X5) != host(X7) )
& host(X7) != host(sK2)
& host(X4) = host(X7) )
& host(X5) = host(sK2)
& host(X4) != host(X5) )
& ( host(X4) = host(sK3)
| setIn(host(X4),index(acks,host(sK2))) ) )
=> ( ? [X5] :
( ? [X7,X6] :
( ? [X8] :
( elem(m_Down(X6),snoc(queue(host(X7)),m_Ldr(sK2)))
& elem(m_Down(X8),sK0)
& host(X7) = host(X8)
& host(X5) = host(X6)
& setIn(X7,alive)
& setIn(X5,alive)
& host(X5) != host(X7) )
& host(X7) != host(sK2)
& host(X7) = host(sK4) )
& host(X5) = host(sK2)
& host(X5) != host(sK4) )
& ( host(sK3) = host(sK4)
| setIn(host(sK4),index(acks,host(sK2))) ) ) ),
introduced(choice_axiom,[]) ).
fof(f103,plain,
( ? [X5] :
( ? [X7,X6] :
( ? [X8] :
( elem(m_Down(X6),snoc(queue(host(X7)),m_Ldr(sK2)))
& elem(m_Down(X8),sK0)
& host(X7) = host(X8)
& host(X5) = host(X6)
& setIn(X7,alive)
& setIn(X5,alive)
& host(X5) != host(X7) )
& host(X7) != host(sK2)
& host(X7) = host(sK4) )
& host(X5) = host(sK2)
& host(X5) != host(sK4) )
=> ( ? [X7,X6] :
( ? [X8] :
( elem(m_Down(X6),snoc(queue(host(X7)),m_Ldr(sK2)))
& elem(m_Down(X8),sK0)
& host(X7) = host(X8)
& host(X6) = host(sK5)
& setIn(X7,alive)
& setIn(sK5,alive)
& host(X7) != host(sK5) )
& host(X7) != host(sK2)
& host(X7) = host(sK4) )
& host(sK2) = host(sK5)
& host(sK4) != host(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f104,plain,
( ? [X7,X6] :
( ? [X8] :
( elem(m_Down(X6),snoc(queue(host(X7)),m_Ldr(sK2)))
& elem(m_Down(X8),sK0)
& host(X7) = host(X8)
& host(X6) = host(sK5)
& setIn(X7,alive)
& setIn(sK5,alive)
& host(X7) != host(sK5) )
& host(X7) != host(sK2)
& host(X7) = host(sK4) )
=> ( ? [X8] :
( elem(m_Down(sK6),snoc(queue(host(sK7)),m_Ldr(sK2)))
& elem(m_Down(X8),sK0)
& host(X8) = host(sK7)
& host(sK5) = host(sK6)
& setIn(sK7,alive)
& setIn(sK5,alive)
& host(sK5) != host(sK7) )
& host(sK2) != host(sK7)
& host(sK4) = host(sK7) ) ),
introduced(choice_axiom,[]) ).
fof(f105,plain,
( ? [X8] :
( elem(m_Down(sK6),snoc(queue(host(sK7)),m_Ldr(sK2)))
& elem(m_Down(X8),sK0)
& host(X8) = host(sK7)
& host(sK5) = host(sK6)
& setIn(sK7,alive)
& setIn(sK5,alive)
& host(sK5) != host(sK7) )
=> ( elem(m_Down(sK6),snoc(queue(host(sK7)),m_Ldr(sK2)))
& elem(m_Down(sK8),sK0)
& host(sK7) = host(sK8)
& host(sK5) = host(sK6)
& setIn(sK7,alive)
& setIn(sK5,alive)
& host(sK5) != host(sK7) ) ),
introduced(choice_axiom,[]) ).
fof(f100,plain,
? [X0,X1,X2,X3] :
( ? [X4] :
( ? [X5] :
( ? [X6,X7] :
( ? [X8] :
( elem(m_Down(X6),snoc(queue(host(X7)),m_Ldr(X2)))
& elem(m_Down(X8),X0)
& 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,[],[f94]) ).
fof(f94,plain,
? [X0,X1,X2,X3] :
( ? [X23] :
( ? [X24] :
( ? [X25,X26] :
( ? [X27] :
( elem(m_Down(X25),snoc(queue(host(X26)),m_Ldr(X2)))
& elem(m_Down(X27),X0)
& 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,[],[f93]) ).
fof(f93,plain,
? [X0,X1,X2,X3] :
( ? [X23] :
( ? [X24] :
( ? [X25,X26] :
( ? [X27] :
( elem(m_Down(X25),snoc(queue(host(X26)),m_Ldr(X2)))
& elem(m_Down(X27),X0)
& 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,[],[f69]) ).
fof(f69,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(X25),snoc(queue(host(X26)),m_Ldr(X2)))
& elem(m_Down(X27),X0) ) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f68]) ).
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(X17),snoc(queue(host(X18)),m_Ldr(X4)))
& elem(m_Down(X19),X11) ) ) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[],[f67]) ).
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(X17),snoc(queue(host(X18)),m_Ldr(X4)))
& elem(m_Down(X19),X11) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Cq7QfNIFM0/Vampire---4.8_2365',conj) ).
fof(f1073,plain,
~ elem(m_Down(sK8),sK0),
inference(trivial_inequality_removal,[],[f1071]) ).
fof(f1071,plain,
( host(sK7) != host(sK7)
| ~ elem(m_Down(sK8),sK0) ),
inference(superposition,[],[f1066,f139]) ).
fof(f139,plain,
host(sK7) = host(sK8),
inference(cnf_transformation,[],[f106]) ).
fof(f1066,plain,
! [X0] :
( host(X0) != host(sK7)
| ~ elem(m_Down(X0),sK0) ),
inference(subsumption_resolution,[],[f1065,f132]) ).
fof(f132,plain,
host(sK2) = host(sK5),
inference(cnf_transformation,[],[f106]) ).
fof(f1065,plain,
! [X0] :
( host(sK2) != host(sK5)
| host(X0) != host(sK7)
| ~ elem(m_Down(X0),sK0) ),
inference(forward_demodulation,[],[f1064,f138]) ).
fof(f138,plain,
host(sK5) = host(sK6),
inference(cnf_transformation,[],[f106]) ).
fof(f1064,plain,
! [X0] :
( host(X0) != host(sK7)
| host(sK2) != host(sK6)
| ~ elem(m_Down(X0),sK0) ),
inference(subsumption_resolution,[],[f1063,f134]) ).
fof(f134,plain,
host(sK2) != host(sK7),
inference(cnf_transformation,[],[f106]) ).
fof(f1063,plain,
! [X0] :
( host(X0) != host(sK7)
| host(sK2) != host(sK6)
| host(sK2) = host(sK7)
| ~ elem(m_Down(X0),sK0) ),
inference(subsumption_resolution,[],[f1056,f137]) ).
fof(f137,plain,
setIn(sK7,alive),
inference(cnf_transformation,[],[f106]) ).
fof(f1056,plain,
! [X0] :
( host(X0) != host(sK7)
| host(sK2) != host(sK6)
| ~ setIn(sK7,alive)
| host(sK2) = host(sK7)
| ~ elem(m_Down(X0),sK0) ),
inference(resolution,[],[f852,f227]) ).
fof(f227,plain,
elem(m_Down(sK6),queue(host(sK7))),
inference(subsumption_resolution,[],[f226,f169]) ).
fof(f169,plain,
! [X0,X1] : m_Down(X0) != m_Ldr(X1),
inference(cnf_transformation,[],[f87]) ).
fof(f87,plain,
! [X0,X1] : m_Down(X0) != m_Ldr(X1),
inference(rectify,[],[f19]) ).
fof(f19,axiom,
! [X4,X5] : m_Down(X4) != m_Ldr(X5),
file('/export/starexec/sandbox/tmp/tmp.Cq7QfNIFM0/Vampire---4.8_2365',axiom_18) ).
fof(f226,plain,
( m_Ldr(sK2) = m_Down(sK6)
| elem(m_Down(sK6),queue(host(sK7))) ),
inference(resolution,[],[f141,f146]) ).
fof(f146,plain,
! [X2,X0,X1] :
( ~ elem(X0,snoc(X2,X1))
| X0 = X1
| elem(X0,X2) ),
inference(cnf_transformation,[],[f108]) ).
fof(f108,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,[],[f107]) ).
fof(f107,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,[],[f74]) ).
fof(f74,plain,
! [X0,X1,X2] :
( elem(X0,snoc(X2,X1))
<=> ( elem(X0,X2)
| X0 = X1 ) ),
inference(rectify,[],[f48]) ).
fof(f48,axiom,
! [X4,X5,X3] :
( elem(X4,snoc(X3,X5))
<=> ( elem(X4,X3)
| X4 = X5 ) ),
file('/export/starexec/sandbox/tmp/tmp.Cq7QfNIFM0/Vampire---4.8_2365',axiom_47) ).
fof(f141,plain,
elem(m_Down(sK6),snoc(queue(host(sK7)),m_Ldr(sK2))),
inference(cnf_transformation,[],[f106]) ).
fof(f852,plain,
! [X2,X0,X1] :
( ~ elem(m_Down(X0),queue(host(X1)))
| host(X2) != host(X1)
| host(X0) != host(sK2)
| ~ setIn(X1,alive)
| host(X1) = host(sK2)
| ~ elem(m_Down(X2),sK0) ),
inference(resolution,[],[f481,f151]) ).
fof(f151,plain,
! [X2,X0,X1] :
( elem(X0,cons(X1,X2))
| ~ elem(X0,X2) ),
inference(cnf_transformation,[],[f110]) ).
fof(f110,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,[],[f109]) ).
fof(f109,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,[],[f75]) ).
fof(f75,plain,
! [X0,X1,X2] :
( elem(X0,cons(X1,X2))
<=> ( elem(X0,X2)
| X0 = X1 ) ),
inference(rectify,[],[f47]) ).
fof(f47,axiom,
! [X4,X5,X3] :
( elem(X4,cons(X5,X3))
<=> ( elem(X4,X3)
| X4 = X5 ) ),
file('/export/starexec/sandbox/tmp/tmp.Cq7QfNIFM0/Vampire---4.8_2365',axiom_46) ).
fof(f481,plain,
! [X2,X0,X1] :
( ~ elem(m_Down(X0),cons(m_Ack(sK1,sK3),sK0))
| ~ elem(m_Down(X1),queue(host(X2)))
| host(X0) != host(X2)
| host(X1) != host(sK2)
| ~ setIn(X2,alive)
| host(X2) = host(sK2) ),
inference(forward_demodulation,[],[f480,f124]) ).
fof(f124,plain,
queue(host(sK2)) = cons(m_Ack(sK1,sK3),sK0),
inference(cnf_transformation,[],[f106]) ).
fof(f480,plain,
! [X2,X0,X1] :
( ~ elem(m_Down(X0),queue(host(sK2)))
| ~ elem(m_Down(X1),queue(host(X2)))
| host(X0) != host(X2)
| host(X1) != host(sK2)
| ~ setIn(X2,alive)
| host(X2) = host(sK2) ),
inference(subsumption_resolution,[],[f473,f136]) ).
fof(f136,plain,
setIn(sK5,alive),
inference(cnf_transformation,[],[f106]) ).
fof(f473,plain,
! [X2,X0,X1] :
( ~ elem(m_Down(X0),queue(host(sK2)))
| ~ elem(m_Down(X1),queue(host(X2)))
| host(X0) != host(X2)
| host(X1) != host(sK2)
| ~ setIn(X2,alive)
| ~ setIn(sK5,alive)
| host(X2) = host(sK2) ),
inference(superposition,[],[f123,f132]) ).
fof(f123,plain,
! [X10,X11,X9,X12] :
( ~ elem(m_Down(X12),queue(host(X9)))
| ~ elem(m_Down(X10),queue(host(X11)))
| host(X11) != host(X12)
| host(X9) != host(X10)
| ~ setIn(X11,alive)
| ~ setIn(X9,alive)
| host(X9) = host(X11) ),
inference(cnf_transformation,[],[f106]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWV450+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.34 % Computer : n013.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Fri May 3 21:11:38 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.14/0.34 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.34 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.Cq7QfNIFM0/Vampire---4.8_2365
% 0.53/0.73 % (2473)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2996ds/34Mi)
% 0.53/0.73 % (2480)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2996ds/56Mi)
% 0.53/0.73 % (2477)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2996ds/34Mi)
% 0.53/0.73 % (2476)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.53/0.73 % (2475)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.53/0.73 % (2474)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2996ds/51Mi)
% 0.53/0.73 % (2478)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.53/0.73 % (2479)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2996ds/83Mi)
% 0.53/0.74 % (2473)Instruction limit reached!
% 0.53/0.74 % (2473)------------------------------
% 0.53/0.74 % (2473)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.53/0.74 % (2473)Termination reason: Unknown
% 0.53/0.74 % (2473)Termination phase: Saturation
% 0.53/0.74
% 0.53/0.74 % (2473)Memory used [KB]: 1435
% 0.53/0.74 % (2473)Time elapsed: 0.013 s
% 0.53/0.74 % (2473)Instructions burned: 34 (million)
% 0.53/0.74 % (2473)------------------------------
% 0.53/0.74 % (2473)------------------------------
% 0.59/0.74 % (2481)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on Vampire---4 for (2996ds/55Mi)
% 0.59/0.75 % (2480)Instruction limit reached!
% 0.59/0.75 % (2480)------------------------------
% 0.59/0.75 % (2480)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.75 % (2480)Termination reason: Unknown
% 0.59/0.75 % (2480)Termination phase: Saturation
% 0.59/0.75
% 0.59/0.75 % (2480)Memory used [KB]: 1971
% 0.59/0.75 % (2480)Time elapsed: 0.020 s
% 0.59/0.75 % (2480)Instructions burned: 56 (million)
% 0.59/0.75 % (2480)------------------------------
% 0.59/0.75 % (2480)------------------------------
% 0.59/0.75 % (2476)Instruction limit reached!
% 0.59/0.75 % (2476)------------------------------
% 0.59/0.75 % (2476)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.75 % (2476)Termination reason: Unknown
% 0.59/0.75 % (2476)Termination phase: Saturation
% 0.59/0.75
% 0.59/0.75 % (2476)Memory used [KB]: 1493
% 0.59/0.75 % (2476)Time elapsed: 0.021 s
% 0.59/0.75 % (2476)Instructions burned: 34 (million)
% 0.59/0.75 % (2476)------------------------------
% 0.59/0.75 % (2476)------------------------------
% 0.59/0.75 % (2478)First to succeed.
% 0.59/0.75 % (2482)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on Vampire---4 for (2996ds/50Mi)
% 0.59/0.75 % (2477)Instruction limit reached!
% 0.59/0.75 % (2477)------------------------------
% 0.59/0.75 % (2477)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.75 % (2477)Termination reason: Unknown
% 0.59/0.75 % (2477)Termination phase: Saturation
% 0.59/0.75
% 0.59/0.75 % (2477)Memory used [KB]: 1580
% 0.59/0.75 % (2477)Time elapsed: 0.023 s
% 0.59/0.75 % (2477)Instructions burned: 35 (million)
% 0.59/0.75 % (2477)------------------------------
% 0.59/0.75 % (2477)------------------------------
% 0.59/0.75 % (2478)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2472"
% 0.59/0.76 % (2478)Refutation found. Thanks to Tanya!
% 0.59/0.76 % SZS status Theorem for Vampire---4
% 0.59/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.68/0.76 % (2478)------------------------------
% 0.68/0.76 % (2478)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.68/0.76 % (2478)Termination reason: Refutation
% 0.68/0.76
% 0.68/0.76 % (2478)Memory used [KB]: 1343
% 0.68/0.76 % (2478)Time elapsed: 0.024 s
% 0.68/0.76 % (2478)Instructions burned: 40 (million)
% 0.68/0.76 % (2472)Success in time 0.393 s
% 0.68/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------