TSTP Solution File: SWV455+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWV455+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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n029.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 : Wed May 1 04:08:56 EDT 2024
% Result : Theorem 0.61s 0.78s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of formulae : 58 ( 16 unt; 0 def)
% Number of atoms : 591 ( 230 equ)
% Maximal formula atoms : 92 ( 10 avg)
% Number of connectives : 865 ( 332 ~; 192 |; 277 &)
% ( 8 <=>; 56 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 7 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 11 ( 9 usr; 7 prp; 0-2 aty)
% Number of functors : 25 ( 25 usr; 17 con; 0-2 aty)
% Number of variables : 277 ( 227 !; 50 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f695,plain,
$false,
inference(avatar_sat_refutation,[],[f467,f502,f560,f562,f578,f626,f668]) ).
fof(f668,plain,
~ spl11_29,
inference(avatar_contradiction_clause,[],[f667]) ).
fof(f667,plain,
( $false
| ~ spl11_29 ),
inference(trivial_inequality_removal,[],[f627]) ).
fof(f627,plain,
( host(sK4) != host(sK4)
| ~ spl11_29 ),
inference(superposition,[],[f290,f576]) ).
fof(f576,plain,
( host(sK4) = host(sK6)
| ~ spl11_29 ),
inference(avatar_component_clause,[],[f574]) ).
fof(f574,plain,
( spl11_29
<=> host(sK4) = host(sK6) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_29])]) ).
fof(f290,plain,
host(sK4) != host(sK6),
inference(cnf_transformation,[],[f176]) ).
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(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(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(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(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(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(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(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/tmp/tmp.hCt7Dunmcj/Vampire---4.8_17222',conj) ).
fof(f626,plain,
spl11_28,
inference(avatar_split_clause,[],[f625,f570]) ).
fof(f570,plain,
( spl11_28
<=> elem(m_Down(sK7),queue(host(sK4))) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_28])]) ).
fof(f625,plain,
elem(m_Down(sK7),queue(host(sK4))),
inference(resolution,[],[f624,f297]) ).
fof(f297,plain,
elem(m_Down(sK7),sK3),
inference(cnf_transformation,[],[f176]) ).
fof(f624,plain,
! [X0] :
( ~ elem(X0,sK3)
| elem(X0,queue(host(sK4))) ),
inference(superposition,[],[f231,f281]) ).
fof(f281,plain,
queue(host(sK4)) = cons(m_Down(sK5),sK3),
inference(cnf_transformation,[],[f176]) ).
fof(f231,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/sandbox2/tmp/tmp.hCt7Dunmcj/Vampire---4.8_17222',axiom_46) ).
fof(f578,plain,
( ~ spl11_28
| ~ spl11_20
| spl11_29
| ~ spl11_27 ),
inference(avatar_split_clause,[],[f566,f558,f574,f458,f570]) ).
fof(f458,plain,
( spl11_20
<=> setIn(sK4,alive) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_20])]) ).
fof(f558,plain,
( spl11_27
<=> ! [X0] :
( ~ elem(m_Down(sK7),queue(host(X0)))
| host(X0) = host(sK6)
| ~ setIn(X0,alive)
| host(X0) != host(sK4) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_27])]) ).
fof(f566,plain,
( host(sK4) = host(sK6)
| ~ setIn(sK4,alive)
| ~ elem(m_Down(sK7),queue(host(sK4)))
| ~ spl11_27 ),
inference(equality_resolution,[],[f559]) ).
fof(f559,plain,
( ! [X0] :
( host(X0) != host(sK4)
| host(X0) = host(sK6)
| ~ setIn(X0,alive)
| ~ elem(m_Down(sK7),queue(host(X0))) )
| ~ spl11_27 ),
inference(avatar_component_clause,[],[f558]) ).
fof(f562,plain,
spl11_26,
inference(avatar_contradiction_clause,[],[f561]) ).
fof(f561,plain,
( $false
| spl11_26 ),
inference(resolution,[],[f556,f298]) ).
fof(f298,plain,
elem(m_Down(sK9),queue(host(sK6))),
inference(cnf_transformation,[],[f176]) ).
fof(f556,plain,
( ~ elem(m_Down(sK9),queue(host(sK6)))
| spl11_26 ),
inference(avatar_component_clause,[],[f554]) ).
fof(f554,plain,
( spl11_26
<=> elem(m_Down(sK9),queue(host(sK6))) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_26])]) ).
fof(f560,plain,
( ~ spl11_17
| ~ spl11_26
| spl11_27 ),
inference(avatar_split_clause,[],[f551,f558,f554,f439]) ).
fof(f439,plain,
( spl11_17
<=> setIn(sK6,alive) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_17])]) ).
fof(f551,plain,
! [X0] :
( ~ elem(m_Down(sK7),queue(host(X0)))
| ~ elem(m_Down(sK9),queue(host(sK6)))
| host(X0) != host(sK4)
| ~ setIn(sK6,alive)
| ~ setIn(X0,alive)
| host(X0) = host(sK6) ),
inference(equality_resolution,[],[f539]) ).
fof(f539,plain,
! [X0,X1] :
( host(X1) != host(sK6)
| ~ elem(m_Down(sK7),queue(host(X0)))
| ~ elem(m_Down(sK9),queue(host(X1)))
| host(X0) != host(sK4)
| ~ setIn(X1,alive)
| ~ setIn(X0,alive)
| host(X0) = host(X1) ),
inference(forward_demodulation,[],[f533,f291]) ).
fof(f291,plain,
host(sK4) = host(sK8),
inference(cnf_transformation,[],[f176]) ).
fof(f533,plain,
! [X0,X1] :
( host(X0) != host(sK8)
| ~ elem(m_Down(sK7),queue(host(X0)))
| ~ elem(m_Down(sK9),queue(host(X1)))
| host(X1) != host(sK6)
| ~ setIn(X1,alive)
| ~ setIn(X0,alive)
| host(X0) = host(X1) ),
inference(superposition,[],[f525,f296]) ).
fof(f296,plain,
host(sK8) = host(sK9),
inference(cnf_transformation,[],[f176]) ).
fof(f525,plain,
! [X2,X0,X1] :
( host(X2) != host(X1)
| ~ elem(m_Down(sK7),queue(host(X1)))
| ~ elem(m_Down(X2),queue(host(X0)))
| host(X0) != host(sK6)
| ~ setIn(X0,alive)
| ~ setIn(X1,alive)
| host(X0) = host(X1) ),
inference(superposition,[],[f280,f295]) ).
fof(f295,plain,
host(sK6) = host(sK7),
inference(cnf_transformation,[],[f176]) ).
fof(f280,plain,
! [X10,X11,X8,X9] :
( host(X10) != host(X11)
| ~ elem(m_Down(X11),queue(host(X8)))
| ~ elem(m_Down(X9),queue(host(X10)))
| host(X8) != host(X9)
| ~ setIn(X10,alive)
| ~ setIn(X8,alive)
| host(X8) = host(X10) ),
inference(cnf_transformation,[],[f176]) ).
fof(f502,plain,
spl11_17,
inference(avatar_contradiction_clause,[],[f501]) ).
fof(f501,plain,
( $false
| spl11_17 ),
inference(resolution,[],[f441,f293]) ).
fof(f293,plain,
setIn(sK6,alive),
inference(cnf_transformation,[],[f176]) ).
fof(f441,plain,
( ~ setIn(sK6,alive)
| spl11_17 ),
inference(avatar_component_clause,[],[f439]) ).
fof(f467,plain,
spl11_20,
inference(avatar_contradiction_clause,[],[f466]) ).
fof(f466,plain,
( $false
| spl11_20 ),
inference(resolution,[],[f460,f282]) ).
fof(f282,plain,
setIn(sK4,alive),
inference(cnf_transformation,[],[f176]) ).
fof(f460,plain,
( ~ setIn(sK4,alive)
| spl11_20 ),
inference(avatar_component_clause,[],[f458]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWV455+1 : TPTP v8.1.2. Released v4.0.0.
% 0.08/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.16/0.36 % Computer : n029.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Tue Apr 30 18:50:05 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.16/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.16/0.37 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.hCt7Dunmcj/Vampire---4.8_17222
% 0.56/0.76 % (17387)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.56/0.76 % (17393)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.56/0.76 % (17386)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.56/0.76 % (17390)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.56/0.76 % (17388)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.56/0.76 % (17389)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.56/0.76 % (17391)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.56/0.76 % (17392)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.61/0.77 % (17387)First to succeed.
% 0.61/0.78 % (17387)Refutation found. Thanks to Tanya!
% 0.61/0.78 % SZS status Theorem for Vampire---4
% 0.61/0.78 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.78 % (17387)------------------------------
% 0.61/0.78 % (17387)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.78 % (17387)Termination reason: Refutation
% 0.61/0.78
% 0.61/0.78 % (17387)Memory used [KB]: 1333
% 0.61/0.78 % (17387)Time elapsed: 0.017 s
% 0.61/0.78 % (17387)Instructions burned: 26 (million)
% 0.61/0.78 % (17387)------------------------------
% 0.61/0.78 % (17387)------------------------------
% 0.61/0.78 % (17369)Success in time 0.394 s
% 0.61/0.78 % Vampire---4.8 exiting
%------------------------------------------------------------------------------