TSTP Solution File: SWV456+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWV456+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 : n007.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:40 EDT 2024
% Result : Theorem 0.58s 0.78s
% Output : Refutation 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 11
% Syntax : Number of formulae : 60 ( 16 unt; 0 def)
% Number of atoms : 700 ( 341 equ)
% Maximal formula atoms : 112 ( 11 avg)
% Number of connectives : 1012 ( 372 ~; 240 |; 332 &)
% ( 7 <=>; 61 =>; 0 <=; 0 <~>)
% Maximal formula depth : 32 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 6 prp; 0-2 aty)
% Number of functors : 25 ( 25 usr; 17 con; 0-2 aty)
% Number of variables : 303 ( 255 !; 48 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f905,plain,
$false,
inference(avatar_sat_refutation,[],[f325,f690,f759,f804,f814,f895]) ).
fof(f895,plain,
~ spl11_2,
inference(avatar_contradiction_clause,[],[f894]) ).
fof(f894,plain,
( $false
| ~ spl11_2 ),
inference(trivial_inequality_removal,[],[f882]) ).
fof(f882,plain,
( host(sK4) != host(sK4)
| ~ spl11_2 ),
inference(superposition,[],[f292,f324]) ).
fof(f324,plain,
( sK4 = sK9
| ~ spl11_2 ),
inference(avatar_component_clause,[],[f322]) ).
fof(f322,plain,
( spl11_2
<=> sK4 = sK9 ),
introduced(avatar_definition,[new_symbols(naming,[spl11_2])]) ).
fof(f292,plain,
host(sK4) != host(sK9),
inference(cnf_transformation,[],[f175]) ).
fof(f175,plain,
( setIn(host(sK8),index(down,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(sK4) != 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] :
( ~ setIn(host(X10),index(down,host(X11)))
| ~ elem(m_Down(X12),queue(host(X9)))
| host(X12) != host(X11)
| host(X10) != host(X9)
| ~ setIn(X11,alive)
| ~ setIn(X9,alive)
| host(X11) = host(X9) )
& ! [X13,X14,X15,X16] :
( ~ elem(m_Down(X14),queue(host(X15)))
| ~ elem(m_Down(X16),queue(host(X13)))
| host(X15) != host(X16)
| host(X13) != host(X14)
| ~ setIn(X15,alive)
| ~ setIn(X13,alive)
| host(X13) = host(X15) )
& ! [X17,X18] :
( ~ setIn(X18,alive)
| ~ setIn(X17,alive)
| host(X17) != host(X18)
| X17 = X18 )
& ! [X19,X20] :
( ~ setIn(X20,alive)
| host(X19) != host(X20)
| ~ leq(X20,X19)
| setIn(X19,alive) )
& ! [X21,X22,X23] :
( ~ leq(host(X21),host(X23))
| ~ elem(m_Ack(X23,X21),queue(host(X22))) )
& ! [X24,X25] :
( ~ leq(host(X24),host(X25))
| ~ elem(m_Halt(X25),queue(host(X24))) )
& ! [X26,X27] :
( host(X26) != host(X27)
| ~ elem(m_Down(X27),queue(host(X26))) )
& ! [X28,X29] :
( ~ setIn(X29,alive)
| ~ elem(m_Down(X29),queue(host(X28))) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6,sK7,sK8,sK9,sK10])],[f170,f174,f173,f172,f171]) ).
fof(f171,plain,
( ? [X0,X1,X2,X3] :
( ? [X4] :
( ? [X5,X6] :
( ? [X7] :
( setIn(host(X5),index(down,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(X1) != 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] :
( ~ setIn(host(X10),index(down,host(X11)))
| ~ elem(m_Down(X12),queue(host(X9)))
| host(X12) != host(X11)
| host(X10) != host(X9)
| ~ setIn(X11,alive)
| ~ setIn(X9,alive)
| host(X11) = host(X9) )
& ! [X13,X14,X15,X16] :
( ~ elem(m_Down(X14),queue(host(X15)))
| ~ elem(m_Down(X16),queue(host(X13)))
| host(X15) != host(X16)
| host(X13) != host(X14)
| ~ setIn(X15,alive)
| ~ setIn(X13,alive)
| host(X13) = host(X15) )
& ! [X17,X18] :
( ~ setIn(X18,alive)
| ~ setIn(X17,alive)
| host(X17) != host(X18)
| X17 = X18 )
& ! [X19,X20] :
( ~ setIn(X20,alive)
| host(X19) != host(X20)
| ~ leq(X20,X19)
| setIn(X19,alive) )
& ! [X21,X22,X23] :
( ~ leq(host(X21),host(X23))
| ~ elem(m_Ack(X23,X21),queue(host(X22))) )
& ! [X24,X25] :
( ~ leq(host(X24),host(X25))
| ~ elem(m_Halt(X25),queue(host(X24))) )
& ! [X26,X27] :
( host(X26) != host(X27)
| ~ elem(m_Down(X27),queue(host(X26))) )
& ! [X28,X29] :
( ~ setIn(X29,alive)
| ~ elem(m_Down(X29),queue(host(X28))) ) )
=> ( ? [X4] :
( ? [X6,X5] :
( ? [X7] :
( setIn(host(X5),index(down,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(X6) != host(sK4) )
& 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] :
( ~ setIn(host(X10),index(down,host(X11)))
| ~ elem(m_Down(X12),queue(host(X9)))
| host(X12) != host(X11)
| host(X10) != host(X9)
| ~ setIn(X11,alive)
| ~ setIn(X9,alive)
| host(X11) = host(X9) )
& ! [X13,X14,X15,X16] :
( ~ elem(m_Down(X14),queue(host(X15)))
| ~ elem(m_Down(X16),queue(host(X13)))
| host(X15) != host(X16)
| host(X13) != host(X14)
| ~ setIn(X15,alive)
| ~ setIn(X13,alive)
| host(X13) = host(X15) )
& ! [X17,X18] :
( ~ setIn(X18,alive)
| ~ setIn(X17,alive)
| host(X17) != host(X18)
| X17 = X18 )
& ! [X19,X20] :
( ~ setIn(X20,alive)
| host(X19) != host(X20)
| ~ leq(X20,X19)
| setIn(X19,alive) )
& ! [X21,X22,X23] :
( ~ leq(host(X21),host(X23))
| ~ elem(m_Ack(X23,X21),queue(host(X22))) )
& ! [X24,X25] :
( ~ leq(host(X24),host(X25))
| ~ elem(m_Halt(X25),queue(host(X24))) )
& ! [X26,X27] :
( host(X26) != host(X27)
| ~ elem(m_Down(X27),queue(host(X26))) )
& ! [X28,X29] :
( ~ setIn(X29,alive)
| ~ elem(m_Down(X29),queue(host(X28))) ) ) ),
introduced(choice_axiom,[]) ).
fof(f172,plain,
( ? [X4] :
( ? [X6,X5] :
( ? [X7] :
( setIn(host(X5),index(down,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(X6) != host(sK4) )
& host(X4) = host(sK5) )
=> ( ? [X6,X5] :
( ? [X7] :
( setIn(host(X5),index(down,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(X6) != host(sK4) )
& host(sK5) = host(sK7) ) ),
introduced(choice_axiom,[]) ).
fof(f173,plain,
( ? [X6,X5] :
( ? [X7] :
( setIn(host(X5),index(down,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(X6) != host(sK4) )
=> ( ? [X7] :
( setIn(host(sK8),index(down,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)
& host(sK4) != host(sK9) ) ),
introduced(choice_axiom,[]) ).
fof(f174,plain,
( ? [X7] :
( setIn(host(sK8),index(down,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 ) ) )
=> ( setIn(host(sK8),index(down,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(f170,plain,
? [X0,X1,X2,X3] :
( ? [X4] :
( ? [X5,X6] :
( ? [X7] :
( setIn(host(X5),index(down,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(X1) != 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] :
( ~ setIn(host(X10),index(down,host(X11)))
| ~ elem(m_Down(X12),queue(host(X9)))
| host(X12) != host(X11)
| host(X10) != host(X9)
| ~ setIn(X11,alive)
| ~ setIn(X9,alive)
| host(X11) = host(X9) )
& ! [X13,X14,X15,X16] :
( ~ elem(m_Down(X14),queue(host(X15)))
| ~ elem(m_Down(X16),queue(host(X13)))
| host(X15) != host(X16)
| host(X13) != host(X14)
| ~ setIn(X15,alive)
| ~ setIn(X13,alive)
| host(X13) = host(X15) )
& ! [X17,X18] :
( ~ setIn(X18,alive)
| ~ setIn(X17,alive)
| host(X17) != host(X18)
| X17 = X18 )
& ! [X19,X20] :
( ~ setIn(X20,alive)
| host(X19) != host(X20)
| ~ leq(X20,X19)
| setIn(X19,alive) )
& ! [X21,X22,X23] :
( ~ leq(host(X21),host(X23))
| ~ elem(m_Ack(X23,X21),queue(host(X22))) )
& ! [X24,X25] :
( ~ leq(host(X24),host(X25))
| ~ elem(m_Halt(X25),queue(host(X24))) )
& ! [X26,X27] :
( host(X26) != host(X27)
| ~ elem(m_Down(X27),queue(host(X26))) )
& ! [X28,X29] :
( ~ setIn(X29,alive)
| ~ elem(m_Down(X29),queue(host(X28))) ) ),
inference(rectify,[],[f141]) ).
fof(f141,plain,
? [X0,X1,X2,X3] :
( ? [X26] :
( ? [X27,X28] :
( ? [X29] :
( setIn(host(X27),index(down,host(X28)))
& elem(m_Down(X29),X0)
& host(X28) = host(X29)
& host(X26) = host(X27)
& host(X26) != host(X28)
& ( X1 = X28
| ( setIn(X28,alive)
& X2 != X28 ) )
& ( X1 = X26
| ( setIn(X26,alive)
& X2 != X26 ) ) )
& host(X2) != host(X28)
& host(X1) != host(X28) )
& host(X2) = host(X26) )
& s(zero) != host(X1)
& host(X2) = host(X1)
& ~ setIn(X1,pids)
& ! [X25] :
( leq(X25,X1)
| host(X2) != host(X25) )
& ( ( 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] :
( ~ setIn(host(X5),index(down,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,X10,X11] :
( ~ elem(m_Down(X9),queue(host(X10)))
| ~ elem(m_Down(X11),queue(host(X8)))
| host(X11) != host(X10)
| host(X8) != host(X9)
| ~ setIn(X10,alive)
| ~ setIn(X8,alive)
| host(X10) = host(X8) )
& ! [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))) ) ),
inference(flattening,[],[f140]) ).
fof(f140,plain,
? [X0,X1,X2,X3] :
( ? [X26] :
( ? [X27,X28] :
( ? [X29] :
( setIn(host(X27),index(down,host(X28)))
& elem(m_Down(X29),X0)
& host(X28) = host(X29)
& host(X26) = host(X27)
& host(X26) != host(X28)
& ( X1 = X28
| ( setIn(X28,alive)
& X2 != X28 ) )
& ( X1 = X26
| ( setIn(X26,alive)
& X2 != X26 ) ) )
& host(X2) != host(X28)
& host(X1) != host(X28) )
& host(X2) = host(X26) )
& s(zero) != host(X1)
& host(X2) = host(X1)
& ~ setIn(X1,pids)
& ! [X25] :
( leq(X25,X1)
| host(X2) != host(X25) )
& ( ( 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] :
( ~ setIn(host(X5),index(down,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,X10,X11] :
( ~ elem(m_Down(X9),queue(host(X10)))
| ~ elem(m_Down(X11),queue(host(X8)))
| host(X11) != host(X10)
| host(X8) != host(X9)
| ~ setIn(X10,alive)
| ~ setIn(X8,alive)
| host(X10) = host(X8) )
& ! [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))) ) ),
inference(ennf_transformation,[],[f124]) ).
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) )
=> ~ ( setIn(host(X5),index(down,host(X6)))
& elem(m_Down(X7),queue(host(X4))) ) )
& ! [X8,X9,X10,X11] :
( ( host(X11) = host(X10)
& host(X8) = host(X9)
& setIn(X10,alive)
& setIn(X8,alive)
& host(X10) != host(X8) )
=> ~ ( elem(m_Down(X9),queue(host(X10)))
& elem(m_Down(X11),queue(host(X8))) ) )
& ! [X12,X13] :
( ( host(X13) = host(X12)
& X12 != X13 )
=> ( ~ setIn(X13,alive)
| ~ setIn(X12,alive) ) )
& ! [X14,X15] :
( ( host(X14) = host(X15)
& leq(X15,X14)
& ~ setIn(X14,alive) )
=> ~ setIn(X15,alive) )
& ! [X16,X17,X18] :
( elem(m_Ack(X18,X16),queue(host(X17)))
=> ~ leq(host(X16),host(X18)) )
& ! [X19,X20] :
( elem(m_Halt(X20),queue(host(X19)))
=> ~ leq(host(X19),host(X20)) )
& ! [X21,X22] :
( elem(m_Down(X22),queue(host(X21)))
=> host(X21) != host(X22) )
& ! [X23,X24] :
( elem(m_Down(X24),queue(host(X23)))
=> ~ setIn(X24,alive) ) )
=> ( 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)
& ! [X25] :
( host(X2) = host(X25)
=> leq(X25,X1) ) )
=> ( s(zero) != host(X1)
=> ! [X26] :
( host(X2) = host(X26)
=> ! [X27,X28] :
( host(X1) != host(X28)
=> ( host(X2) != host(X28)
=> ! [X29] :
( ( host(X28) = host(X29)
& host(X26) = host(X27)
& host(X26) != host(X28)
& ( X1 = X28
| ( setIn(X28,alive)
& X2 != X28 ) )
& ( X1 = X26
| ( setIn(X26,alive)
& X2 != X26 ) ) )
=> ~ ( setIn(host(X27),index(down,host(X28)))
& elem(m_Down(X29),X0) ) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f68]) ).
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) )
=> ~ ( setIn(host(X15),index(down,host(X14)))
& elem(m_Down(X13),queue(host(X6))) ) )
& ! [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) ) )
=> ( 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(X12) != host(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 ) ) )
=> ~ ( setIn(host(X16),index(down,host(X17)))
& elem(m_Down(X18),X11) ) ) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[],[f67]) ).
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) )
=> ~ ( setIn(host(X15),index(down,host(X14)))
& elem(m_Down(X13),queue(host(X6))) ) )
& ! [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) ) )
=> ( 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(X12) != host(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 ) ) )
=> ~ ( setIn(host(X16),index(down,host(X17)))
& elem(m_Down(X18),X11) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.E7Kgss6xPm/Vampire---4.8_16374',conj) ).
fof(f814,plain,
~ spl11_31,
inference(avatar_contradiction_clause,[],[f813]) ).
fof(f813,plain,
( $false
| ~ spl11_31 ),
inference(resolution,[],[f812,f381]) ).
fof(f381,plain,
setIn(host(sK5),index(down,host(sK9))),
inference(forward_demodulation,[],[f380,f291]) ).
fof(f291,plain,
host(sK5) = host(sK7),
inference(cnf_transformation,[],[f175]) ).
fof(f380,plain,
setIn(host(sK7),index(down,host(sK9))),
inference(superposition,[],[f302,f299]) ).
fof(f299,plain,
host(sK7) = host(sK8),
inference(cnf_transformation,[],[f175]) ).
fof(f302,plain,
setIn(host(sK8),index(down,host(sK9))),
inference(cnf_transformation,[],[f175]) ).
fof(f812,plain,
( ~ setIn(host(sK5),index(down,host(sK9)))
| ~ spl11_31 ),
inference(trivial_inequality_removal,[],[f806]) ).
fof(f806,plain,
( host(sK5) != host(sK5)
| ~ setIn(host(sK5),index(down,host(sK9)))
| ~ spl11_31 ),
inference(superposition,[],[f689,f289]) ).
fof(f289,plain,
host(sK5) = host(sK4),
inference(cnf_transformation,[],[f175]) ).
fof(f689,plain,
( ! [X0] :
( host(X0) != host(sK5)
| ~ setIn(host(X0),index(down,host(sK9))) )
| ~ spl11_31 ),
inference(avatar_component_clause,[],[f688]) ).
fof(f688,plain,
( spl11_31
<=> ! [X0] :
( ~ setIn(host(X0),index(down,host(sK9)))
| host(X0) != host(sK5) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_31])]) ).
fof(f804,plain,
spl11_30,
inference(avatar_split_clause,[],[f803,f684]) ).
fof(f684,plain,
( spl11_30
<=> elem(m_Down(sK10),queue(host(sK5))) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_30])]) ).
fof(f803,plain,
elem(m_Down(sK10),queue(host(sK5))),
inference(resolution,[],[f802,f301]) ).
fof(f301,plain,
elem(m_Down(sK10),sK3),
inference(cnf_transformation,[],[f175]) ).
fof(f802,plain,
! [X0] :
( ~ elem(X0,sK3)
| elem(X0,queue(host(sK5))) ),
inference(superposition,[],[f230,f280]) ).
fof(f280,plain,
queue(host(sK5)) = cons(m_Down(sK6),sK3),
inference(cnf_transformation,[],[f175]) ).
fof(f230,plain,
! [X2,X0,X1] :
( elem(X0,cons(X1,X2))
| ~ elem(X0,X2) ),
inference(cnf_transformation,[],[f148]) ).
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(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(f105,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.E7Kgss6xPm/Vampire---4.8_16374',axiom_46) ).
fof(f759,plain,
( ~ spl11_30
| ~ spl11_29 ),
inference(avatar_split_clause,[],[f730,f680,f684]) ).
fof(f680,plain,
( spl11_29
<=> host(sK5) = host(sK9) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_29])]) ).
fof(f730,plain,
( ~ elem(m_Down(sK10),queue(host(sK5)))
| ~ spl11_29 ),
inference(trivial_inequality_removal,[],[f715]) ).
fof(f715,plain,
( host(sK5) != host(sK5)
| ~ elem(m_Down(sK10),queue(host(sK5)))
| ~ spl11_29 ),
inference(superposition,[],[f405,f682]) ).
fof(f682,plain,
( host(sK5) = host(sK9)
| ~ spl11_29 ),
inference(avatar_component_clause,[],[f680]) ).
fof(f405,plain,
! [X0] :
( host(X0) != host(sK9)
| ~ elem(m_Down(sK10),queue(host(X0))) ),
inference(superposition,[],[f273,f300]) ).
fof(f300,plain,
host(sK9) = host(sK10),
inference(cnf_transformation,[],[f175]) ).
fof(f273,plain,
! [X26,X27] :
( host(X26) != host(X27)
| ~ elem(m_Down(X27),queue(host(X26))) ),
inference(cnf_transformation,[],[f175]) ).
fof(f690,plain,
( spl11_29
| ~ spl11_30
| spl11_31
| ~ spl11_1 ),
inference(avatar_split_clause,[],[f677,f318,f688,f684,f680]) ).
fof(f318,plain,
( spl11_1
<=> setIn(sK9,alive) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_1])]) ).
fof(f677,plain,
( ! [X0] :
( ~ setIn(host(X0),index(down,host(sK9)))
| host(X0) != host(sK5)
| ~ elem(m_Down(sK10),queue(host(sK5)))
| host(sK5) = host(sK9) )
| ~ spl11_1 ),
inference(resolution,[],[f676,f281]) ).
fof(f281,plain,
setIn(sK5,alive),
inference(cnf_transformation,[],[f175]) ).
fof(f676,plain,
( ! [X0,X1] :
( ~ setIn(X0,alive)
| ~ setIn(host(X1),index(down,host(sK9)))
| host(X0) != host(X1)
| ~ elem(m_Down(sK10),queue(host(X0)))
| host(X0) = host(sK9) )
| ~ spl11_1 ),
inference(trivial_inequality_removal,[],[f675]) ).
fof(f675,plain,
( ! [X0,X1] :
( ~ elem(m_Down(sK10),queue(host(X0)))
| ~ setIn(host(X1),index(down,host(sK9)))
| host(X0) != host(X1)
| host(sK9) != host(sK9)
| ~ setIn(X0,alive)
| host(X0) = host(sK9) )
| ~ spl11_1 ),
inference(resolution,[],[f663,f320]) ).
fof(f320,plain,
( setIn(sK9,alive)
| ~ spl11_1 ),
inference(avatar_component_clause,[],[f318]) ).
fof(f663,plain,
! [X2,X0,X1] :
( ~ setIn(X0,alive)
| ~ elem(m_Down(sK10),queue(host(X1)))
| ~ setIn(host(X2),index(down,host(X0)))
| host(X2) != host(X1)
| host(X0) != host(sK9)
| ~ setIn(X1,alive)
| host(X0) = host(X1) ),
inference(superposition,[],[f279,f300]) ).
fof(f279,plain,
! [X10,X11,X9,X12] :
( host(X12) != host(X11)
| ~ elem(m_Down(X12),queue(host(X9)))
| ~ setIn(host(X10),index(down,host(X11)))
| host(X10) != host(X9)
| ~ setIn(X11,alive)
| ~ setIn(X9,alive)
| host(X11) = host(X9) ),
inference(cnf_transformation,[],[f175]) ).
fof(f325,plain,
( spl11_1
| spl11_2 ),
inference(avatar_split_clause,[],[f297,f322,f318]) ).
fof(f297,plain,
( sK4 = sK9
| setIn(sK9,alive) ),
inference(cnf_transformation,[],[f175]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWV456+1 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.15 % 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.13/0.36 % Computer : n007.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Fri May 3 21:15:38 EDT 2024
% 0.20/0.36 % CPUTime :
% 0.20/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.20/0.36 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.E7Kgss6xPm/Vampire---4.8_16374
% 0.55/0.76 % (16482)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.55/0.76 % (16484)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.55/0.76 % (16486)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.55/0.76 % (16488)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.55/0.76 % (16489)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.55/0.76 % (16485)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.55/0.76 % (16483)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.55/0.76 % (16487)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.58/0.77 % (16482)Instruction limit reached!
% 0.58/0.77 % (16482)------------------------------
% 0.58/0.77 % (16482)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.77 % (16482)Termination reason: Unknown
% 0.58/0.77 % (16482)Termination phase: Saturation
% 0.58/0.77
% 0.58/0.77 % (16482)Memory used [KB]: 1442
% 0.58/0.77 % (16482)Time elapsed: 0.014 s
% 0.58/0.77 % (16482)Instructions burned: 35 (million)
% 0.58/0.77 % (16482)------------------------------
% 0.58/0.77 % (16482)------------------------------
% 0.58/0.77 % (16490)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 (2995ds/55Mi)
% 0.58/0.77 % (16483)First to succeed.
% 0.58/0.77 % (16485)Instruction limit reached!
% 0.58/0.77 % (16485)------------------------------
% 0.58/0.77 % (16485)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.77 % (16485)Termination reason: Unknown
% 0.58/0.77 % (16485)Termination phase: Saturation
% 0.58/0.77
% 0.58/0.77 % (16485)Memory used [KB]: 1503
% 0.58/0.77 % (16485)Time elapsed: 0.019 s
% 0.58/0.78 % (16485)Instructions burned: 34 (million)
% 0.58/0.78 % (16485)------------------------------
% 0.58/0.78 % (16485)------------------------------
% 0.58/0.78 % (16486)Instruction limit reached!
% 0.58/0.78 % (16486)------------------------------
% 0.58/0.78 % (16486)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.78 % (16486)Termination reason: Unknown
% 0.58/0.78 % (16486)Termination phase: Saturation
% 0.58/0.78
% 0.58/0.78 % (16486)Memory used [KB]: 1570
% 0.58/0.78 % (16486)Time elapsed: 0.020 s
% 0.58/0.78 % (16486)Instructions burned: 34 (million)
% 0.58/0.78 % (16486)------------------------------
% 0.58/0.78 % (16486)------------------------------
% 0.58/0.78 % (16483)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-16481"
% 0.58/0.78 % (16483)Refutation found. Thanks to Tanya!
% 0.58/0.78 % SZS status Theorem for Vampire---4
% 0.58/0.78 % SZS output start Proof for Vampire---4
% See solution above
% 0.58/0.78 % (16483)------------------------------
% 0.58/0.78 % (16483)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.78 % (16483)Termination reason: Refutation
% 0.58/0.78
% 0.58/0.78 % (16483)Memory used [KB]: 1419
% 0.58/0.78 % (16483)Time elapsed: 0.022 s
% 0.58/0.78 % (16483)Instructions burned: 38 (million)
% 0.58/0.78 % (16481)Success in time 0.408 s
% 0.58/0.78 % Vampire---4.8 exiting
%------------------------------------------------------------------------------