TSTP Solution File: SWV453+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWV453+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 : n022.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.59s 0.78s
% Output : Refutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 11
% Syntax : Number of formulae : 72 ( 18 unt; 0 def)
% Number of atoms : 683 ( 331 equ)
% Maximal formula atoms : 100 ( 9 avg)
% Number of connectives : 970 ( 359 ~; 239 |; 307 &)
% ( 7 <=>; 58 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 6 prp; 0-2 aty)
% Number of functors : 24 ( 24 usr; 16 con; 0-2 aty)
% Number of variables : 298 ( 250 !; 48 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f787,plain,
$false,
inference(avatar_sat_refutation,[],[f337,f434,f439,f591,f600,f783]) ).
fof(f783,plain,
( ~ spl11_13
| ~ spl11_28 ),
inference(avatar_contradiction_clause,[],[f782]) ).
fof(f782,plain,
( $false
| ~ spl11_13
| ~ spl11_28 ),
inference(subsumption_resolution,[],[f778,f202]) ).
fof(f202,plain,
host(sK4) = host(sK5),
inference(cnf_transformation,[],[f147]) ).
fof(f147,plain,
( elem(m_Down(sK7),queue(host(sK4)))
& elem(m_Down(sK5),sK0)
& host(sK6) = host(sK7)
& host(sK4) = host(sK5)
& host(sK4) != host(sK6)
& ( sK1 = sK6
| ( setIn(sK6,alive)
& sK2 != sK6 ) )
& ( sK1 = sK4
| ( setIn(sK4,alive)
& sK2 != sK4 ) )
& host(sK2) = host(sK6)
& host(sK2) != host(sK4)
& s(zero) != host(sK1)
& host(sK2) = host(sK1)
& ~ setIn(sK1,pids)
& ! [X8] :
( leq(X8,sK1)
| host(X8) != host(sK2) )
& ( ( host(sK3) = host(index(elid,host(sK2)))
& wait = index(status,host(sK2)) )
| ( norm = index(status,host(sK2))
& host(sK3) = index(ldr,host(sK2)) ) )
& ~ leq(host(sK2),host(sK3))
& setIn(sK2,alive)
& queue(host(sK2)) = cons(m_Down(sK3),sK0)
& ! [X9,X10,X11,X12] :
( ~ elem(m_Down(X10),queue(host(X11)))
| ~ elem(m_Down(X12),queue(host(X9)))
| host(X12) != host(X11)
| host(X9) != host(X10)
| ~ setIn(X11,alive)
| ~ setIn(X9,alive)
| host(X9) = host(X11) )
& ! [X13,X14] :
( ~ setIn(X14,alive)
| ~ setIn(X13,alive)
| host(X13) != host(X14)
| X13 = X14 )
& ! [X15,X16] :
( ~ setIn(X16,alive)
| host(X15) != host(X16)
| ~ leq(X16,X15)
| setIn(X15,alive) )
& ! [X17,X18,X19] :
( ~ leq(host(X17),host(X19))
| ~ elem(m_Ack(X19,X17),queue(host(X18))) )
& ! [X20,X21] :
( ~ leq(host(X20),host(X21))
| ~ elem(m_Halt(X21),queue(host(X20))) )
& ! [X22,X23] :
( host(X23) != host(X22)
| ~ elem(m_Down(X23),queue(host(X22))) )
& ! [X24,X25] :
( ~ setIn(X25,alive)
| ~ elem(m_Down(X25),queue(host(X24))) )
& ! [X26,X27] :
( ~ elem(m_Down(X27),queue(host(X26)))
| ~ setIn(X27,alive) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6,sK7])],[f142,f146,f145,f144,f143]) ).
fof(f143,plain,
( ? [X0,X1,X2,X3] :
( ? [X4] :
( ? [X5,X6] :
( ? [X7] :
( elem(m_Down(X7),queue(host(X4)))
& elem(m_Down(X5),X0)
& host(X6) = host(X7)
& host(X4) = host(X5)
& host(X4) != host(X6)
& ( X1 = X6
| ( setIn(X6,alive)
& X2 != X6 ) )
& ( X1 = X4
| ( setIn(X4,alive)
& X2 != X4 ) ) )
& host(X2) = host(X6) )
& host(X2) != host(X4) )
& s(zero) != host(X1)
& host(X2) = host(X1)
& ~ setIn(X1,pids)
& ! [X8] :
( leq(X8,X1)
| host(X2) != host(X8) )
& ( ( host(X3) = host(index(elid,host(X2)))
& wait = index(status,host(X2)) )
| ( norm = index(status,host(X2))
& host(X3) = index(ldr,host(X2)) ) )
& ~ leq(host(X2),host(X3))
& setIn(X2,alive)
& queue(host(X2)) = cons(m_Down(X3),X0)
& ! [X9,X10,X11,X12] :
( ~ elem(m_Down(X10),queue(host(X11)))
| ~ elem(m_Down(X12),queue(host(X9)))
| host(X12) != host(X11)
| host(X9) != host(X10)
| ~ setIn(X11,alive)
| ~ setIn(X9,alive)
| host(X9) = host(X11) )
& ! [X13,X14] :
( ~ setIn(X14,alive)
| ~ setIn(X13,alive)
| host(X13) != host(X14)
| X13 = X14 )
& ! [X15,X16] :
( ~ setIn(X16,alive)
| host(X15) != host(X16)
| ~ leq(X16,X15)
| setIn(X15,alive) )
& ! [X17,X18,X19] :
( ~ leq(host(X17),host(X19))
| ~ elem(m_Ack(X19,X17),queue(host(X18))) )
& ! [X20,X21] :
( ~ leq(host(X20),host(X21))
| ~ elem(m_Halt(X21),queue(host(X20))) )
& ! [X22,X23] :
( host(X23) != host(X22)
| ~ elem(m_Down(X23),queue(host(X22))) )
& ! [X24,X25] :
( ~ setIn(X25,alive)
| ~ elem(m_Down(X25),queue(host(X24))) )
& ! [X26,X27] :
( ~ elem(m_Down(X27),queue(host(X26)))
| ~ setIn(X27,alive) ) )
=> ( ? [X4] :
( ? [X6,X5] :
( ? [X7] :
( elem(m_Down(X7),queue(host(X4)))
& elem(m_Down(X5),sK0)
& host(X6) = host(X7)
& host(X4) = host(X5)
& host(X4) != host(X6)
& ( sK1 = X6
| ( setIn(X6,alive)
& sK2 != X6 ) )
& ( sK1 = X4
| ( setIn(X4,alive)
& sK2 != X4 ) ) )
& host(X6) = host(sK2) )
& host(X4) != host(sK2) )
& s(zero) != host(sK1)
& host(sK2) = host(sK1)
& ~ setIn(sK1,pids)
& ! [X8] :
( leq(X8,sK1)
| host(X8) != host(sK2) )
& ( ( host(sK3) = host(index(elid,host(sK2)))
& wait = index(status,host(sK2)) )
| ( norm = index(status,host(sK2))
& host(sK3) = index(ldr,host(sK2)) ) )
& ~ leq(host(sK2),host(sK3))
& setIn(sK2,alive)
& queue(host(sK2)) = cons(m_Down(sK3),sK0)
& ! [X9,X10,X11,X12] :
( ~ elem(m_Down(X10),queue(host(X11)))
| ~ elem(m_Down(X12),queue(host(X9)))
| host(X12) != host(X11)
| host(X9) != host(X10)
| ~ setIn(X11,alive)
| ~ setIn(X9,alive)
| host(X9) = host(X11) )
& ! [X13,X14] :
( ~ setIn(X14,alive)
| ~ setIn(X13,alive)
| host(X13) != host(X14)
| X13 = X14 )
& ! [X15,X16] :
( ~ setIn(X16,alive)
| host(X15) != host(X16)
| ~ leq(X16,X15)
| setIn(X15,alive) )
& ! [X17,X18,X19] :
( ~ leq(host(X17),host(X19))
| ~ elem(m_Ack(X19,X17),queue(host(X18))) )
& ! [X20,X21] :
( ~ leq(host(X20),host(X21))
| ~ elem(m_Halt(X21),queue(host(X20))) )
& ! [X22,X23] :
( host(X23) != host(X22)
| ~ elem(m_Down(X23),queue(host(X22))) )
& ! [X24,X25] :
( ~ setIn(X25,alive)
| ~ elem(m_Down(X25),queue(host(X24))) )
& ! [X26,X27] :
( ~ elem(m_Down(X27),queue(host(X26)))
| ~ setIn(X27,alive) ) ) ),
introduced(choice_axiom,[]) ).
fof(f144,plain,
( ? [X4] :
( ? [X6,X5] :
( ? [X7] :
( elem(m_Down(X7),queue(host(X4)))
& elem(m_Down(X5),sK0)
& host(X6) = host(X7)
& host(X4) = host(X5)
& host(X4) != host(X6)
& ( sK1 = X6
| ( setIn(X6,alive)
& sK2 != X6 ) )
& ( sK1 = X4
| ( setIn(X4,alive)
& sK2 != X4 ) ) )
& host(X6) = host(sK2) )
& host(X4) != host(sK2) )
=> ( ? [X6,X5] :
( ? [X7] :
( elem(m_Down(X7),queue(host(sK4)))
& elem(m_Down(X5),sK0)
& host(X6) = host(X7)
& host(X5) = host(sK4)
& host(X6) != host(sK4)
& ( sK1 = X6
| ( setIn(X6,alive)
& sK2 != X6 ) )
& ( sK1 = sK4
| ( setIn(sK4,alive)
& sK2 != sK4 ) ) )
& host(X6) = host(sK2) )
& host(sK2) != host(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f145,plain,
( ? [X6,X5] :
( ? [X7] :
( elem(m_Down(X7),queue(host(sK4)))
& elem(m_Down(X5),sK0)
& host(X6) = host(X7)
& host(X5) = host(sK4)
& host(X6) != host(sK4)
& ( sK1 = X6
| ( setIn(X6,alive)
& sK2 != X6 ) )
& ( sK1 = sK4
| ( setIn(sK4,alive)
& sK2 != sK4 ) ) )
& host(X6) = host(sK2) )
=> ( ? [X7] :
( elem(m_Down(X7),queue(host(sK4)))
& elem(m_Down(sK5),sK0)
& host(X7) = host(sK6)
& host(sK4) = host(sK5)
& host(sK4) != host(sK6)
& ( sK1 = sK6
| ( setIn(sK6,alive)
& sK2 != sK6 ) )
& ( sK1 = sK4
| ( setIn(sK4,alive)
& sK2 != sK4 ) ) )
& host(sK2) = host(sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f146,plain,
( ? [X7] :
( elem(m_Down(X7),queue(host(sK4)))
& elem(m_Down(sK5),sK0)
& host(X7) = host(sK6)
& host(sK4) = host(sK5)
& host(sK4) != host(sK6)
& ( sK1 = sK6
| ( setIn(sK6,alive)
& sK2 != sK6 ) )
& ( sK1 = sK4
| ( setIn(sK4,alive)
& sK2 != sK4 ) ) )
=> ( elem(m_Down(sK7),queue(host(sK4)))
& elem(m_Down(sK5),sK0)
& host(sK6) = host(sK7)
& host(sK4) = host(sK5)
& host(sK4) != host(sK6)
& ( sK1 = sK6
| ( setIn(sK6,alive)
& sK2 != sK6 ) )
& ( sK1 = sK4
| ( setIn(sK4,alive)
& sK2 != sK4 ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f142,plain,
? [X0,X1,X2,X3] :
( ? [X4] :
( ? [X5,X6] :
( ? [X7] :
( elem(m_Down(X7),queue(host(X4)))
& elem(m_Down(X5),X0)
& host(X6) = host(X7)
& host(X4) = host(X5)
& host(X4) != host(X6)
& ( X1 = X6
| ( setIn(X6,alive)
& X2 != X6 ) )
& ( X1 = X4
| ( setIn(X4,alive)
& X2 != X4 ) ) )
& host(X2) = host(X6) )
& host(X2) != host(X4) )
& s(zero) != host(X1)
& host(X2) = host(X1)
& ~ setIn(X1,pids)
& ! [X8] :
( leq(X8,X1)
| host(X2) != host(X8) )
& ( ( host(X3) = host(index(elid,host(X2)))
& wait = index(status,host(X2)) )
| ( norm = index(status,host(X2))
& host(X3) = index(ldr,host(X2)) ) )
& ~ leq(host(X2),host(X3))
& setIn(X2,alive)
& queue(host(X2)) = cons(m_Down(X3),X0)
& ! [X9,X10,X11,X12] :
( ~ elem(m_Down(X10),queue(host(X11)))
| ~ elem(m_Down(X12),queue(host(X9)))
| host(X12) != host(X11)
| host(X9) != host(X10)
| ~ setIn(X11,alive)
| ~ setIn(X9,alive)
| host(X9) = host(X11) )
& ! [X13,X14] :
( ~ setIn(X14,alive)
| ~ setIn(X13,alive)
| host(X13) != host(X14)
| X13 = X14 )
& ! [X15,X16] :
( ~ setIn(X16,alive)
| host(X15) != host(X16)
| ~ leq(X16,X15)
| setIn(X15,alive) )
& ! [X17,X18,X19] :
( ~ leq(host(X17),host(X19))
| ~ elem(m_Ack(X19,X17),queue(host(X18))) )
& ! [X20,X21] :
( ~ leq(host(X20),host(X21))
| ~ elem(m_Halt(X21),queue(host(X20))) )
& ! [X22,X23] :
( host(X23) != host(X22)
| ~ elem(m_Down(X23),queue(host(X22))) )
& ! [X24,X25] :
( ~ setIn(X25,alive)
| ~ elem(m_Down(X25),queue(host(X24))) )
& ! [X26,X27] :
( ~ elem(m_Down(X27),queue(host(X26)))
| ~ setIn(X27,alive) ) ),
inference(rectify,[],[f126]) ).
fof(f126,plain,
? [X0,X1,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)
& host(X24) != host(X26)
& ( X1 = X26
| ( setIn(X26,alive)
& X2 != X26 ) )
& ( X1 = X24
| ( setIn(X24,alive)
& X2 != X24 ) ) )
& host(X2) = host(X26) )
& host(X2) != host(X24) )
& s(zero) != host(X1)
& host(X2) = host(X1)
& ~ setIn(X1,pids)
& ! [X23] :
( leq(X23,X1)
| host(X2) != host(X23) )
& ( ( host(X3) = host(index(elid,host(X2)))
& wait = index(status,host(X2)) )
| ( norm = index(status,host(X2))
& host(X3) = index(ldr,host(X2)) ) )
& ~ leq(host(X2),host(X3))
& setIn(X2,alive)
& queue(host(X2)) = cons(m_Down(X3),X0)
& ! [X4,X5,X6,X7] :
( ~ elem(m_Down(X5),queue(host(X6)))
| ~ elem(m_Down(X7),queue(host(X4)))
| host(X6) != host(X7)
| host(X4) != host(X5)
| ~ setIn(X6,alive)
| ~ setIn(X4,alive)
| host(X4) = host(X6) )
& ! [X8,X9] :
( ~ setIn(X9,alive)
| ~ setIn(X8,alive)
| host(X8) != host(X9)
| X8 = X9 )
& ! [X10,X11] :
( ~ setIn(X11,alive)
| host(X10) != host(X11)
| ~ leq(X11,X10)
| setIn(X10,alive) )
& ! [X12,X13,X14] :
( ~ leq(host(X12),host(X14))
| ~ elem(m_Ack(X14,X12),queue(host(X13))) )
& ! [X15,X16] :
( ~ leq(host(X15),host(X16))
| ~ elem(m_Halt(X16),queue(host(X15))) )
& ! [X17,X18] :
( host(X17) != host(X18)
| ~ elem(m_Down(X18),queue(host(X17))) )
& ! [X19,X20] :
( ~ setIn(X20,alive)
| ~ elem(m_Down(X20),queue(host(X19))) )
& ! [X21,X22] :
( ~ elem(m_Down(X22),queue(host(X21)))
| ~ setIn(X22,alive) ) ),
inference(flattening,[],[f125]) ).
fof(f125,plain,
? [X0,X1,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)
& host(X24) != host(X26)
& ( X1 = X26
| ( setIn(X26,alive)
& X2 != X26 ) )
& ( X1 = X24
| ( setIn(X24,alive)
& X2 != X24 ) ) )
& host(X2) = host(X26) )
& host(X2) != host(X24) )
& s(zero) != host(X1)
& host(X2) = host(X1)
& ~ setIn(X1,pids)
& ! [X23] :
( leq(X23,X1)
| host(X2) != host(X23) )
& ( ( host(X3) = host(index(elid,host(X2)))
& wait = index(status,host(X2)) )
| ( norm = index(status,host(X2))
& host(X3) = index(ldr,host(X2)) ) )
& ~ leq(host(X2),host(X3))
& setIn(X2,alive)
& queue(host(X2)) = cons(m_Down(X3),X0)
& ! [X4,X5,X6,X7] :
( ~ elem(m_Down(X5),queue(host(X6)))
| ~ elem(m_Down(X7),queue(host(X4)))
| host(X6) != host(X7)
| host(X4) != host(X5)
| ~ setIn(X6,alive)
| ~ setIn(X4,alive)
| host(X4) = host(X6) )
& ! [X8,X9] :
( ~ setIn(X9,alive)
| ~ setIn(X8,alive)
| host(X8) != host(X9)
| X8 = X9 )
& ! [X10,X11] :
( ~ setIn(X11,alive)
| host(X10) != host(X11)
| ~ leq(X11,X10)
| setIn(X10,alive) )
& ! [X12,X13,X14] :
( ~ leq(host(X12),host(X14))
| ~ elem(m_Ack(X14,X12),queue(host(X13))) )
& ! [X15,X16] :
( ~ leq(host(X15),host(X16))
| ~ elem(m_Halt(X16),queue(host(X15))) )
& ! [X17,X18] :
( host(X17) != host(X18)
| ~ elem(m_Down(X18),queue(host(X17))) )
& ! [X19,X20] :
( ~ setIn(X20,alive)
| ~ elem(m_Down(X20),queue(host(X19))) )
& ! [X21,X22] :
( ~ elem(m_Down(X22),queue(host(X21)))
| ~ setIn(X22,alive) ) ),
inference(ennf_transformation,[],[f69]) ).
fof(f69,plain,
~ ! [X0,X1,X2,X3] :
( ( queue(host(X2)) = cons(m_Down(X3),X0)
& ! [X4,X5,X6,X7] :
( ( host(X6) = host(X7)
& host(X4) = host(X5)
& setIn(X6,alive)
& setIn(X4,alive)
& host(X4) != host(X6) )
=> ~ ( elem(m_Down(X5),queue(host(X6)))
& elem(m_Down(X7),queue(host(X4))) ) )
& ! [X8,X9] :
( ( host(X8) = host(X9)
& X8 != X9 )
=> ( ~ setIn(X9,alive)
| ~ setIn(X8,alive) ) )
& ! [X10,X11] :
( ( host(X10) = host(X11)
& leq(X11,X10)
& ~ setIn(X10,alive) )
=> ~ setIn(X11,alive) )
& ! [X12,X13,X14] :
( elem(m_Ack(X14,X12),queue(host(X13)))
=> ~ leq(host(X12),host(X14)) )
& ! [X15,X16] :
( elem(m_Halt(X16),queue(host(X15)))
=> ~ leq(host(X15),host(X16)) )
& ! [X17,X18] :
( elem(m_Down(X18),queue(host(X17)))
=> host(X17) != host(X18) )
& ! [X19,X20] :
( elem(m_Down(X20),queue(host(X19)))
=> ~ setIn(X20,alive) )
& ! [X21,X22] :
( setIn(X22,alive)
=> ~ elem(m_Down(X22),queue(host(X21))) ) )
=> ( setIn(X2,alive)
=> ( ~ leq(host(X2),host(X3))
=> ( ( ( host(X3) = host(index(elid,host(X2)))
& wait = index(status,host(X2)) )
| ( norm = index(status,host(X2))
& host(X3) = index(ldr,host(X2)) ) )
=> ( ( host(X2) = host(X1)
& ~ setIn(X1,pids)
& ! [X23] :
( host(X2) = host(X23)
=> leq(X23,X1) ) )
=> ( s(zero) != host(X1)
=> ! [X24] :
( host(X2) != host(X24)
=> ! [X25,X26] :
( host(X2) = host(X26)
=> ! [X27] :
( ( host(X26) = host(X27)
& host(X24) = host(X25)
& host(X24) != host(X26)
& ( X1 = X26
| ( setIn(X26,alive)
& X2 != X26 ) )
& ( X1 = X24
| ( setIn(X24,alive)
& X2 != X24 ) ) )
=> ~ ( elem(m_Down(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)) ) )
=> ( ( host(X4) = host(X12)
& ~ setIn(X12,pids)
& ! [X6] :
( host(X4) = host(X6)
=> leq(X6,X12) ) )
=> ( s(zero) != host(X12)
=> ! [X6] :
( host(X4) != host(X6)
=> ! [X16,X17] :
( host(X4) = host(X17)
=> ! [X18] :
( ( host(X17) = host(X18)
& host(X6) = host(X16)
& host(X6) != host(X17)
& ( X12 = X17
| ( setIn(X17,alive)
& X4 != X17 ) )
& ( X6 = X12
| ( setIn(X6,alive)
& X4 != X6 ) ) )
=> ~ ( elem(m_Down(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)) ) )
=> ( ( host(X4) = host(X12)
& ~ setIn(X12,pids)
& ! [X6] :
( host(X4) = host(X6)
=> leq(X6,X12) ) )
=> ( s(zero) != host(X12)
=> ! [X6] :
( host(X4) != host(X6)
=> ! [X16,X17] :
( host(X4) = host(X17)
=> ! [X18] :
( ( host(X17) = host(X18)
& host(X6) = host(X16)
& host(X6) != host(X17)
& ( X12 = X17
| ( setIn(X17,alive)
& X4 != X17 ) )
& ( X6 = X12
| ( setIn(X6,alive)
& X4 != X6 ) ) )
=> ~ ( elem(m_Down(X18),queue(host(X6)))
& elem(m_Down(X16),X11) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.E1vGqztCr3/Vampire---4.8_11248',conj) ).
fof(f778,plain,
( host(sK4) != host(sK5)
| ~ spl11_13
| ~ spl11_28 ),
inference(resolution,[],[f720,f630]) ).
fof(f630,plain,
( ! [X0] :
( ~ elem(m_Down(X0),queue(host(sK1)))
| host(X0) != host(sK4) )
| ~ spl11_13
| ~ spl11_28 ),
inference(subsumption_resolution,[],[f629,f444]) ).
fof(f444,plain,
( setIn(sK1,alive)
| ~ spl11_13 ),
inference(backward_demodulation,[],[f185,f433]) ).
fof(f433,plain,
( sK1 = sK2
| ~ spl11_13 ),
inference(avatar_component_clause,[],[f431]) ).
fof(f431,plain,
( spl11_13
<=> sK1 = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl11_13])]) ).
fof(f185,plain,
setIn(sK2,alive),
inference(cnf_transformation,[],[f147]) ).
fof(f629,plain,
( ! [X0] :
( ~ setIn(sK1,alive)
| host(X0) != host(sK4)
| ~ elem(m_Down(X0),queue(host(sK1))) )
| ~ spl11_28 ),
inference(subsumption_resolution,[],[f627,f346]) ).
fof(f346,plain,
host(sK1) != host(sK4),
inference(backward_demodulation,[],[f343,f193]) ).
fof(f193,plain,
host(sK2) = host(sK1),
inference(cnf_transformation,[],[f147]) ).
fof(f343,plain,
host(sK2) != host(sK4),
inference(backward_demodulation,[],[f201,f196]) ).
fof(f196,plain,
host(sK2) = host(sK6),
inference(cnf_transformation,[],[f147]) ).
fof(f201,plain,
host(sK4) != host(sK6),
inference(cnf_transformation,[],[f147]) ).
fof(f627,plain,
( ! [X0] :
( host(sK1) = host(sK4)
| ~ setIn(sK1,alive)
| host(X0) != host(sK4)
| ~ elem(m_Down(X0),queue(host(sK1))) )
| ~ spl11_28 ),
inference(equality_resolution,[],[f590]) ).
fof(f590,plain,
( ! [X0,X1] :
( host(X1) != host(sK1)
| host(X1) = host(sK4)
| ~ setIn(X1,alive)
| host(X0) != host(sK4)
| ~ elem(m_Down(X0),queue(host(X1))) )
| ~ spl11_28 ),
inference(avatar_component_clause,[],[f589]) ).
fof(f589,plain,
( spl11_28
<=> ! [X0,X1] :
( host(X1) != host(sK1)
| host(X1) = host(sK4)
| ~ setIn(X1,alive)
| host(X0) != host(sK4)
| ~ elem(m_Down(X0),queue(host(X1))) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_28])]) ).
fof(f720,plain,
elem(m_Down(sK5),queue(host(sK1))),
inference(resolution,[],[f204,f716]) ).
fof(f716,plain,
! [X0] :
( ~ elem(X0,sK0)
| elem(X0,queue(host(sK1))) ),
inference(superposition,[],[f230,f378]) ).
fof(f378,plain,
cons(m_Down(sK3),sK0) = queue(host(sK1)),
inference(forward_demodulation,[],[f184,f193]) ).
fof(f184,plain,
queue(host(sK2)) = cons(m_Down(sK3),sK0),
inference(cnf_transformation,[],[f147]) ).
fof(f230,plain,
! [X2,X0,X1] :
( elem(X0,cons(X1,X2))
| ~ elem(X0,X2) ),
inference(cnf_transformation,[],[f161]) ).
fof(f161,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,[],[f160]) ).
fof(f160,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,[],[f78]) ).
fof(f78,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.E1vGqztCr3/Vampire---4.8_11248',axiom_46) ).
fof(f204,plain,
elem(m_Down(sK5),sK0),
inference(cnf_transformation,[],[f147]) ).
fof(f600,plain,
~ spl11_5,
inference(avatar_contradiction_clause,[],[f599]) ).
fof(f599,plain,
( $false
| ~ spl11_5 ),
inference(trivial_inequality_removal,[],[f596]) ).
fof(f596,plain,
( host(sK1) != host(sK1)
| ~ spl11_5 ),
inference(backward_demodulation,[],[f346,f336]) ).
fof(f336,plain,
( sK1 = sK4
| ~ spl11_5 ),
inference(avatar_component_clause,[],[f334]) ).
fof(f334,plain,
( spl11_5
<=> sK1 = sK4 ),
introduced(avatar_definition,[new_symbols(naming,[spl11_5])]) ).
fof(f591,plain,
( ~ spl11_4
| spl11_28 ),
inference(avatar_split_clause,[],[f587,f589,f330]) ).
fof(f330,plain,
( spl11_4
<=> setIn(sK4,alive) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_4])]) ).
fof(f587,plain,
! [X0,X1] :
( host(X1) != host(sK1)
| ~ elem(m_Down(X0),queue(host(X1)))
| host(X0) != host(sK4)
| ~ setIn(sK4,alive)
| ~ setIn(X1,alive)
| host(X1) = host(sK4) ),
inference(forward_demodulation,[],[f475,f345]) ).
fof(f345,plain,
host(sK1) = host(sK7),
inference(backward_demodulation,[],[f344,f193]) ).
fof(f344,plain,
host(sK2) = host(sK7),
inference(backward_demodulation,[],[f203,f196]) ).
fof(f203,plain,
host(sK6) = host(sK7),
inference(cnf_transformation,[],[f147]) ).
fof(f475,plain,
! [X0,X1] :
( ~ elem(m_Down(X0),queue(host(X1)))
| host(X0) != host(sK4)
| host(X1) != host(sK7)
| ~ setIn(sK4,alive)
| ~ setIn(X1,alive)
| host(X1) = host(sK4) ),
inference(resolution,[],[f183,f205]) ).
fof(f205,plain,
elem(m_Down(sK7),queue(host(sK4))),
inference(cnf_transformation,[],[f147]) ).
fof(f183,plain,
! [X10,X11,X9,X12] :
( ~ elem(m_Down(X10),queue(host(X11)))
| ~ elem(m_Down(X12),queue(host(X9)))
| host(X12) != host(X11)
| host(X9) != host(X10)
| ~ setIn(X11,alive)
| ~ setIn(X9,alive)
| host(X9) = host(X11) ),
inference(cnf_transformation,[],[f147]) ).
fof(f439,plain,
~ spl11_12,
inference(avatar_contradiction_clause,[],[f438]) ).
fof(f438,plain,
( $false
| ~ spl11_12 ),
inference(subsumption_resolution,[],[f435,f193]) ).
fof(f435,plain,
( host(sK2) != host(sK1)
| ~ spl11_12 ),
inference(resolution,[],[f419,f185]) ).
fof(f419,plain,
( ! [X0] :
( ~ setIn(X0,alive)
| host(X0) != host(sK1) )
| ~ spl11_12 ),
inference(avatar_component_clause,[],[f418]) ).
fof(f418,plain,
( spl11_12
<=> ! [X0] :
( host(X0) != host(sK1)
| ~ setIn(X0,alive) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_12])]) ).
fof(f434,plain,
( spl11_12
| spl11_13 ),
inference(avatar_split_clause,[],[f429,f431,f418]) ).
fof(f429,plain,
! [X0] :
( sK1 = sK2
| host(X0) != host(sK1)
| ~ setIn(X0,alive) ),
inference(trivial_inequality_removal,[],[f428]) ).
fof(f428,plain,
! [X0] :
( sK1 = sK2
| host(X0) != host(sK1)
| host(sK1) != host(sK1)
| ~ setIn(X0,alive) ),
inference(duplicate_literal_removal,[],[f427]) ).
fof(f427,plain,
! [X0] :
( sK1 = sK2
| host(X0) != host(sK1)
| host(sK1) != host(sK1)
| ~ setIn(X0,alive)
| host(X0) != host(sK1) ),
inference(resolution,[],[f411,f348]) ).
fof(f348,plain,
! [X8] :
( leq(X8,sK1)
| host(X8) != host(sK1) ),
inference(forward_demodulation,[],[f191,f193]) ).
fof(f191,plain,
! [X8] :
( leq(X8,sK1)
| host(X8) != host(sK2) ),
inference(cnf_transformation,[],[f147]) ).
fof(f411,plain,
! [X0,X1] :
( ~ leq(X1,X0)
| sK2 = X0
| host(X0) != host(X1)
| host(X0) != host(sK1)
| ~ setIn(X1,alive) ),
inference(resolution,[],[f403,f181]) ).
fof(f181,plain,
! [X16,X15] :
( setIn(X15,alive)
| host(X15) != host(X16)
| ~ leq(X16,X15)
| ~ setIn(X16,alive) ),
inference(cnf_transformation,[],[f147]) ).
fof(f403,plain,
! [X0] :
( ~ setIn(X0,alive)
| host(X0) != host(sK1)
| sK2 = X0 ),
inference(forward_demodulation,[],[f400,f193]) ).
fof(f400,plain,
! [X0] :
( ~ setIn(X0,alive)
| host(X0) != host(sK2)
| sK2 = X0 ),
inference(resolution,[],[f182,f185]) ).
fof(f182,plain,
! [X14,X13] :
( ~ setIn(X14,alive)
| ~ setIn(X13,alive)
| host(X13) != host(X14)
| X13 = X14 ),
inference(cnf_transformation,[],[f147]) ).
fof(f337,plain,
( spl11_4
| spl11_5 ),
inference(avatar_split_clause,[],[f198,f334,f330]) ).
fof(f198,plain,
( sK1 = sK4
| setIn(sK4,alive) ),
inference(cnf_transformation,[],[f147]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWV453+1 : TPTP v8.1.2. Released v4.0.0.
% 0.15/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.16/0.36 % Computer : n022.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 : Fri May 3 21:19:08 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.16/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.16/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.E1vGqztCr3/Vampire---4.8_11248
% 0.58/0.75 % (11364)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.58/0.75 % (11357)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.58/0.75 % (11359)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.58/0.75 % (11358)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.58/0.75 % (11360)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.58/0.75 % (11361)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.58/0.75 % (11362)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.75 % (11363)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.59/0.77 % (11364)Instruction limit reached!
% 0.59/0.77 % (11364)------------------------------
% 0.59/0.77 % (11364)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.77 % (11364)Termination reason: Unknown
% 0.59/0.77 % (11364)Termination phase: Saturation
% 0.59/0.77
% 0.59/0.77 % (11364)Memory used [KB]: 1933
% 0.59/0.77 % (11364)Time elapsed: 0.021 s
% 0.59/0.77 % (11364)Instructions burned: 57 (million)
% 0.59/0.77 % (11364)------------------------------
% 0.59/0.77 % (11364)------------------------------
% 0.59/0.77 % (11360)Instruction limit reached!
% 0.59/0.77 % (11360)------------------------------
% 0.59/0.77 % (11360)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.77 % (11360)Termination reason: Unknown
% 0.59/0.77 % (11360)Termination phase: Saturation
% 0.59/0.77
% 0.59/0.77 % (11360)Memory used [KB]: 1503
% 0.59/0.77 % (11360)Time elapsed: 0.021 s
% 0.59/0.77 % (11360)Instructions burned: 33 (million)
% 0.59/0.77 % (11360)------------------------------
% 0.59/0.77 % (11360)------------------------------
% 0.59/0.77 % (11357)Instruction limit reached!
% 0.59/0.77 % (11357)------------------------------
% 0.59/0.77 % (11357)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.77 % (11357)Termination reason: Unknown
% 0.59/0.77 % (11357)Termination phase: Saturation
% 0.59/0.77
% 0.59/0.77 % (11357)Memory used [KB]: 1408
% 0.59/0.77 % (11357)Time elapsed: 0.022 s
% 0.59/0.77 % (11357)Instructions burned: 35 (million)
% 0.59/0.77 % (11357)------------------------------
% 0.59/0.77 % (11357)------------------------------
% 0.59/0.77 % (11365)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.77 % (11361)Instruction limit reached!
% 0.59/0.77 % (11361)------------------------------
% 0.59/0.77 % (11361)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.77 % (11361)Termination reason: Unknown
% 0.59/0.77 % (11361)Termination phase: Saturation
% 0.59/0.77
% 0.59/0.77 % (11361)Memory used [KB]: 1559
% 0.59/0.77 % (11361)Time elapsed: 0.023 s
% 0.59/0.77 % (11361)Instructions burned: 34 (million)
% 0.59/0.77 % (11361)------------------------------
% 0.59/0.77 % (11361)------------------------------
% 0.59/0.77 % (11366)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.77 % (11367)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/208Mi)
% 0.59/0.77 % (11368)lrs-1011_1:1_sil=4000:plsq=on:plsqr=32,1:sp=frequency:plsql=on:nwc=10.0:i=52:aac=none:afr=on:ss=axioms:er=filter:sgt=16:rawr=on:etr=on:lma=on_0 on Vampire---4 for (2996ds/52Mi)
% 0.59/0.77 % (11359)First to succeed.
% 0.59/0.77 % (11362)Instruction limit reached!
% 0.59/0.77 % (11362)------------------------------
% 0.59/0.77 % (11362)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.77 % (11362)Termination reason: Unknown
% 0.59/0.77 % (11362)Termination phase: Saturation
% 0.59/0.77
% 0.59/0.77 % (11362)Memory used [KB]: 1625
% 0.59/0.77 % (11362)Time elapsed: 0.028 s
% 0.59/0.77 % (11362)Instructions burned: 45 (million)
% 0.59/0.77 % (11362)------------------------------
% 0.59/0.77 % (11362)------------------------------
% 0.59/0.78 % (11358)Also succeeded, but the first one will report.
% 0.59/0.78 % (11359)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-11356"
% 0.59/0.78 % (11359)Refutation found. Thanks to Tanya!
% 0.59/0.78 % SZS status Theorem for Vampire---4
% 0.59/0.78 % SZS output start Proof for Vampire---4
% See solution above
% 0.59/0.78 % (11359)------------------------------
% 0.59/0.78 % (11359)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.78 % (11359)Termination reason: Refutation
% 0.59/0.78
% 0.59/0.78 % (11359)Memory used [KB]: 1408
% 0.59/0.78 % (11359)Time elapsed: 0.030 s
% 0.59/0.78 % (11359)Instructions burned: 50 (million)
% 0.59/0.78 % (11356)Success in time 0.397 s
% 0.59/0.78 % Vampire---4.8 exiting
%------------------------------------------------------------------------------