TSTP Solution File: SWV455+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWV455+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% Computer : n019.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 Aug 31 18:59:07 EDT 2022
% Result : Theorem 2.13s 0.65s
% Output : Refutation 2.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 9
% Syntax : Number of formulae : 48 ( 12 unt; 0 def)
% Number of atoms : 569 ( 226 equ)
% Maximal formula atoms : 92 ( 11 avg)
% Number of connectives : 852 ( 331 ~; 184 |; 277 &)
% ( 4 <=>; 56 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 8 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 25 ( 25 usr; 17 con; 0-2 aty)
% Number of variables : 280 ( 230 !; 50 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f677,plain,
$false,
inference(avatar_sat_refutation,[],[f555,f569,f676]) ).
fof(f676,plain,
~ spl11_16,
inference(avatar_contradiction_clause,[],[f675]) ).
fof(f675,plain,
( $false
| ~ spl11_16 ),
inference(subsumption_resolution,[],[f674,f226]) ).
fof(f226,plain,
elem(m_Down(sK8),queue(host(sK5))),
inference(cnf_transformation,[],[f160]) ).
fof(f160,plain,
( ! [X3,X4] :
( X3 = X4
| ~ setIn(X3,alive)
| host(X3) != host(X4)
| ~ setIn(X4,alive) )
& ( elec_1 != index(status,host(sK3))
| ( sK4 != host(sK2)
& ~ setIn(sK4,index(down,host(sK3)))
& ~ leq(host(sK3),sK4)
& leq(s(zero),sK4) ) )
& ! [X6,X7,X8,X9] :
( host(X7) != host(X9)
| host(X6) != host(X8)
| ~ setIn(X6,alive)
| ~ elem(m_Down(X7),queue(host(X6)))
| ~ elem(m_Down(X8),queue(host(X9)))
| host(X6) = host(X9)
| ~ setIn(X9,alive) )
& ! [X10,X11] :
( ~ elem(m_Down(X11),queue(host(X10)))
| ~ setIn(X11,alive) )
& cons(m_Down(sK2),sK1) = queue(host(sK3))
& ! [X12,X13] :
( host(X13) != host(X12)
| ~ elem(m_Down(X13),queue(host(X12))) )
& ! [X14,X15] :
( ~ elem(m_Down(X15),queue(host(X14)))
| ~ setIn(X15,alive) )
& ! [X16,X17,X18] :
( ~ leq(host(X17),host(X16))
| ~ elem(m_Ack(X16,X17),queue(host(X18))) )
& ( index(ldr,host(sK3)) != host(sK2)
| norm != index(status,host(sK3)) )
& setIn(sK3,alive)
& ! [X19,X20] :
( host(X20) != host(X19)
| ~ setIn(X19,alive)
| setIn(X20,alive)
| ~ leq(X19,X20) )
& host(sK3) != host(sK5)
& setIn(sK5,alive)
& host(sK5) = host(sK6)
& setIn(sK7,alive)
& elem(m_Down(sK6),sK1)
& host(sK7) != host(sK5)
& host(sK7) = host(sK8)
& elem(m_Down(sK8),queue(host(sK5)))
& host(sK3) = host(sK7)
& ( host(index(elid,host(sK3))) != host(sK2)
| wait != index(status,host(sK3)) )
& ~ leq(host(sK3),host(sK2))
& ! [X25,X26] :
( ~ elem(m_Halt(X26),queue(host(X25)))
| ~ leq(host(X25),host(X26)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4,sK5,sK6,sK7,sK8])],[f154,f159,f158,f157,f156,f155]) ).
fof(f155,plain,
( ? [X0,X1,X2] :
( ! [X3,X4] :
( X3 = X4
| ~ setIn(X3,alive)
| host(X3) != host(X4)
| ~ setIn(X4,alive) )
& ( elec_1 != index(status,host(X2))
| ? [X5] :
( host(X1) != X5
& ~ setIn(X5,index(down,host(X2)))
& ~ leq(host(X2),X5)
& leq(s(zero),X5) ) )
& ! [X6,X7,X8,X9] :
( host(X7) != host(X9)
| host(X6) != host(X8)
| ~ setIn(X6,alive)
| ~ elem(m_Down(X7),queue(host(X6)))
| ~ elem(m_Down(X8),queue(host(X9)))
| host(X6) = host(X9)
| ~ setIn(X9,alive) )
& ! [X10,X11] :
( ~ elem(m_Down(X11),queue(host(X10)))
| ~ setIn(X11,alive) )
& queue(host(X2)) = cons(m_Down(X1),X0)
& ! [X12,X13] :
( host(X13) != host(X12)
| ~ elem(m_Down(X13),queue(host(X12))) )
& ! [X14,X15] :
( ~ elem(m_Down(X15),queue(host(X14)))
| ~ setIn(X15,alive) )
& ! [X16,X17,X18] :
( ~ leq(host(X17),host(X16))
| ~ elem(m_Ack(X16,X17),queue(host(X18))) )
& ( host(X1) != index(ldr,host(X2))
| norm != index(status,host(X2)) )
& setIn(X2,alive)
& ! [X19,X20] :
( host(X20) != host(X19)
| ~ setIn(X19,alive)
| setIn(X20,alive)
| ~ leq(X19,X20) )
& ? [X21] :
( host(X2) != host(X21)
& ? [X22,X23] :
( ? [X24] :
( setIn(X21,alive)
& host(X21) = host(X22)
& setIn(X23,alive)
& elem(m_Down(X22),X0)
& host(X23) != host(X21)
& host(X24) = host(X23)
& elem(m_Down(X24),queue(host(X21))) )
& host(X2) = host(X23) ) )
& ( host(X1) != host(index(elid,host(X2)))
| wait != index(status,host(X2)) )
& ~ leq(host(X2),host(X1))
& ! [X25,X26] :
( ~ elem(m_Halt(X26),queue(host(X25)))
| ~ leq(host(X25),host(X26)) ) )
=> ( ! [X3,X4] :
( X3 = X4
| ~ setIn(X3,alive)
| host(X3) != host(X4)
| ~ setIn(X4,alive) )
& ( elec_1 != index(status,host(sK3))
| ? [X5] :
( host(sK2) != X5
& ~ setIn(X5,index(down,host(sK3)))
& ~ leq(host(sK3),X5)
& leq(s(zero),X5) ) )
& ! [X6,X7,X8,X9] :
( host(X7) != host(X9)
| host(X6) != host(X8)
| ~ setIn(X6,alive)
| ~ elem(m_Down(X7),queue(host(X6)))
| ~ elem(m_Down(X8),queue(host(X9)))
| host(X6) = host(X9)
| ~ setIn(X9,alive) )
& ! [X10,X11] :
( ~ elem(m_Down(X11),queue(host(X10)))
| ~ setIn(X11,alive) )
& cons(m_Down(sK2),sK1) = queue(host(sK3))
& ! [X12,X13] :
( host(X13) != host(X12)
| ~ elem(m_Down(X13),queue(host(X12))) )
& ! [X14,X15] :
( ~ elem(m_Down(X15),queue(host(X14)))
| ~ setIn(X15,alive) )
& ! [X16,X17,X18] :
( ~ leq(host(X17),host(X16))
| ~ elem(m_Ack(X16,X17),queue(host(X18))) )
& ( index(ldr,host(sK3)) != host(sK2)
| norm != index(status,host(sK3)) )
& setIn(sK3,alive)
& ! [X19,X20] :
( host(X20) != host(X19)
| ~ setIn(X19,alive)
| setIn(X20,alive)
| ~ leq(X19,X20) )
& ? [X21] :
( host(sK3) != host(X21)
& ? [X23,X22] :
( ? [X24] :
( setIn(X21,alive)
& host(X21) = host(X22)
& setIn(X23,alive)
& elem(m_Down(X22),sK1)
& host(X23) != host(X21)
& host(X24) = host(X23)
& elem(m_Down(X24),queue(host(X21))) )
& host(sK3) = host(X23) ) )
& ( host(index(elid,host(sK3))) != host(sK2)
| wait != index(status,host(sK3)) )
& ~ leq(host(sK3),host(sK2))
& ! [X25,X26] :
( ~ elem(m_Halt(X26),queue(host(X25)))
| ~ leq(host(X25),host(X26)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f156,plain,
( ? [X5] :
( host(sK2) != X5
& ~ setIn(X5,index(down,host(sK3)))
& ~ leq(host(sK3),X5)
& leq(s(zero),X5) )
=> ( sK4 != host(sK2)
& ~ setIn(sK4,index(down,host(sK3)))
& ~ leq(host(sK3),sK4)
& leq(s(zero),sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f157,plain,
( ? [X21] :
( host(sK3) != host(X21)
& ? [X23,X22] :
( ? [X24] :
( setIn(X21,alive)
& host(X21) = host(X22)
& setIn(X23,alive)
& elem(m_Down(X22),sK1)
& host(X23) != host(X21)
& host(X24) = host(X23)
& elem(m_Down(X24),queue(host(X21))) )
& host(sK3) = host(X23) ) )
=> ( host(sK3) != host(sK5)
& ? [X23,X22] :
( ? [X24] :
( setIn(sK5,alive)
& host(sK5) = host(X22)
& setIn(X23,alive)
& elem(m_Down(X22),sK1)
& host(X23) != host(sK5)
& host(X24) = host(X23)
& elem(m_Down(X24),queue(host(sK5))) )
& host(sK3) = host(X23) ) ) ),
introduced(choice_axiom,[]) ).
fof(f158,plain,
( ? [X23,X22] :
( ? [X24] :
( setIn(sK5,alive)
& host(sK5) = host(X22)
& setIn(X23,alive)
& elem(m_Down(X22),sK1)
& host(X23) != host(sK5)
& host(X24) = host(X23)
& elem(m_Down(X24),queue(host(sK5))) )
& host(sK3) = host(X23) )
=> ( ? [X24] :
( setIn(sK5,alive)
& host(sK5) = host(sK6)
& setIn(sK7,alive)
& elem(m_Down(sK6),sK1)
& host(sK7) != host(sK5)
& host(sK7) = host(X24)
& elem(m_Down(X24),queue(host(sK5))) )
& host(sK3) = host(sK7) ) ),
introduced(choice_axiom,[]) ).
fof(f159,plain,
( ? [X24] :
( setIn(sK5,alive)
& host(sK5) = host(sK6)
& setIn(sK7,alive)
& elem(m_Down(sK6),sK1)
& host(sK7) != host(sK5)
& host(sK7) = host(X24)
& elem(m_Down(X24),queue(host(sK5))) )
=> ( setIn(sK5,alive)
& host(sK5) = host(sK6)
& setIn(sK7,alive)
& elem(m_Down(sK6),sK1)
& host(sK7) != host(sK5)
& host(sK7) = host(sK8)
& elem(m_Down(sK8),queue(host(sK5))) ) ),
introduced(choice_axiom,[]) ).
fof(f154,plain,
? [X0,X1,X2] :
( ! [X3,X4] :
( X3 = X4
| ~ setIn(X3,alive)
| host(X3) != host(X4)
| ~ setIn(X4,alive) )
& ( elec_1 != index(status,host(X2))
| ? [X5] :
( host(X1) != X5
& ~ setIn(X5,index(down,host(X2)))
& ~ leq(host(X2),X5)
& leq(s(zero),X5) ) )
& ! [X6,X7,X8,X9] :
( host(X7) != host(X9)
| host(X6) != host(X8)
| ~ setIn(X6,alive)
| ~ elem(m_Down(X7),queue(host(X6)))
| ~ elem(m_Down(X8),queue(host(X9)))
| host(X6) = host(X9)
| ~ setIn(X9,alive) )
& ! [X10,X11] :
( ~ elem(m_Down(X11),queue(host(X10)))
| ~ setIn(X11,alive) )
& queue(host(X2)) = cons(m_Down(X1),X0)
& ! [X12,X13] :
( host(X13) != host(X12)
| ~ elem(m_Down(X13),queue(host(X12))) )
& ! [X14,X15] :
( ~ elem(m_Down(X15),queue(host(X14)))
| ~ setIn(X15,alive) )
& ! [X16,X17,X18] :
( ~ leq(host(X17),host(X16))
| ~ elem(m_Ack(X16,X17),queue(host(X18))) )
& ( host(X1) != index(ldr,host(X2))
| norm != index(status,host(X2)) )
& setIn(X2,alive)
& ! [X19,X20] :
( host(X20) != host(X19)
| ~ setIn(X19,alive)
| setIn(X20,alive)
| ~ leq(X19,X20) )
& ? [X21] :
( host(X2) != host(X21)
& ? [X22,X23] :
( ? [X24] :
( setIn(X21,alive)
& host(X21) = host(X22)
& setIn(X23,alive)
& elem(m_Down(X22),X0)
& host(X23) != host(X21)
& host(X24) = host(X23)
& elem(m_Down(X24),queue(host(X21))) )
& host(X2) = host(X23) ) )
& ( host(X1) != host(index(elid,host(X2)))
| wait != index(status,host(X2)) )
& ~ leq(host(X2),host(X1))
& ! [X25,X26] :
( ~ elem(m_Halt(X26),queue(host(X25)))
| ~ leq(host(X25),host(X26)) ) ),
inference(rectify,[],[f138]) ).
fof(f138,plain,
? [X1,X2,X3] :
( ! [X10,X11] :
( X10 = X11
| ~ setIn(X10,alive)
| host(X10) != host(X11)
| ~ setIn(X11,alive) )
& ( elec_1 != index(status,host(X3))
| ? [X23] :
( host(X2) != X23
& ~ setIn(X23,index(down,host(X3)))
& ~ leq(host(X3),X23)
& leq(s(zero),X23) ) )
& ! [X6,X5,X7,X4] :
( host(X4) != host(X5)
| host(X6) != host(X7)
| ~ setIn(X6,alive)
| ~ elem(m_Down(X5),queue(host(X6)))
| ~ elem(m_Down(X7),queue(host(X4)))
| host(X4) = host(X6)
| ~ setIn(X4,alive) )
& ! [X22,X21] :
( ~ elem(m_Down(X21),queue(host(X22)))
| ~ setIn(X21,alive) )
& cons(m_Down(X2),X1) = queue(host(X3))
& ! [X20,X19] :
( host(X20) != host(X19)
| ~ elem(m_Down(X19),queue(host(X20))) )
& ! [X9,X8] :
( ~ elem(m_Down(X8),queue(host(X9)))
| ~ setIn(X8,alive) )
& ! [X15,X14,X16] :
( ~ leq(host(X14),host(X15))
| ~ elem(m_Ack(X15,X14),queue(host(X16))) )
& ( host(X2) != index(ldr,host(X3))
| norm != index(status,host(X3)) )
& setIn(X3,alive)
& ! [X13,X12] :
( host(X13) != host(X12)
| ~ setIn(X13,alive)
| setIn(X12,alive)
| ~ leq(X13,X12) )
& ? [X24] :
( host(X3) != host(X24)
& ? [X26,X25] :
( ? [X27] :
( setIn(X24,alive)
& host(X24) = host(X26)
& setIn(X25,alive)
& elem(m_Down(X26),X1)
& host(X24) != host(X25)
& host(X25) = host(X27)
& elem(m_Down(X27),queue(host(X24))) )
& host(X3) = host(X25) ) )
& ( host(X2) != host(index(elid,host(X3)))
| wait != index(status,host(X3)) )
& ~ leq(host(X3),host(X2))
& ! [X18,X17] :
( ~ elem(m_Halt(X17),queue(host(X18)))
| ~ leq(host(X18),host(X17)) ) ),
inference(flattening,[],[f137]) ).
fof(f137,plain,
? [X2,X3,X1] :
( ? [X24] :
( ? [X25,X26] :
( ? [X27] :
( elem(m_Down(X27),queue(host(X24)))
& elem(m_Down(X26),X1)
& host(X25) = host(X27)
& host(X24) = host(X26)
& setIn(X24,alive)
& host(X24) != host(X25)
& setIn(X25,alive) )
& host(X3) = host(X25) )
& host(X3) != host(X24) )
& ( elec_1 != index(status,host(X3))
| ? [X23] :
( ~ setIn(X23,index(down,host(X3)))
& host(X2) != X23
& ~ leq(host(X3),X23)
& leq(s(zero),X23) ) )
& ( host(X2) != index(ldr,host(X3))
| norm != index(status,host(X3)) )
& ( host(X2) != host(index(elid,host(X3)))
| wait != index(status,host(X3)) )
& ~ leq(host(X3),host(X2))
& setIn(X3,alive)
& ! [X20,X19] :
( host(X20) != host(X19)
| ~ elem(m_Down(X19),queue(host(X20))) )
& ! [X13,X12] :
( ~ setIn(X13,alive)
| setIn(X12,alive)
| host(X13) != host(X12)
| ~ leq(X13,X12) )
& cons(m_Down(X2),X1) = queue(host(X3))
& ! [X18,X17] :
( ~ elem(m_Halt(X17),queue(host(X18)))
| ~ leq(host(X18),host(X17)) )
& ! [X22,X21] :
( ~ elem(m_Down(X21),queue(host(X22)))
| ~ setIn(X21,alive) )
& ! [X10,X11] :
( ~ setIn(X10,alive)
| ~ setIn(X11,alive)
| X10 = X11
| host(X10) != host(X11) )
& ! [X9,X8] :
( ~ elem(m_Down(X8),queue(host(X9)))
| ~ setIn(X8,alive) )
& ! [X15,X14,X16] :
( ~ leq(host(X14),host(X15))
| ~ elem(m_Ack(X15,X14),queue(host(X16))) )
& ! [X4,X5,X6,X7] :
( ~ elem(m_Down(X7),queue(host(X4)))
| ~ elem(m_Down(X5),queue(host(X6)))
| host(X6) != host(X7)
| host(X4) = host(X6)
| ~ setIn(X6,alive)
| ~ setIn(X4,alive)
| host(X4) != host(X5) ) ),
inference(ennf_transformation,[],[f94]) ).
fof(f94,plain,
~ ! [X2,X3,X1] :
( ( ! [X20,X19] :
( elem(m_Down(X19),queue(host(X20)))
=> host(X20) != host(X19) )
& ! [X13,X12] :
( ( ~ setIn(X12,alive)
& host(X13) = host(X12)
& leq(X13,X12) )
=> ~ setIn(X13,alive) )
& cons(m_Down(X2),X1) = queue(host(X3))
& ! [X17,X18] :
( elem(m_Halt(X17),queue(host(X18)))
=> ~ leq(host(X18),host(X17)) )
& ! [X22,X21] :
( setIn(X21,alive)
=> ~ elem(m_Down(X21),queue(host(X22))) )
& ! [X10,X11] :
( ( X10 != X11
& host(X10) = host(X11) )
=> ( ~ setIn(X10,alive)
| ~ setIn(X11,alive) ) )
& ! [X8,X9] :
( elem(m_Down(X8),queue(host(X9)))
=> ~ setIn(X8,alive) )
& ! [X14,X15,X16] :
( elem(m_Ack(X15,X14),queue(host(X16)))
=> ~ leq(host(X14),host(X15)) )
& ! [X4,X5,X6,X7] :
( ( host(X6) = host(X7)
& host(X4) != host(X6)
& setIn(X6,alive)
& setIn(X4,alive)
& host(X4) = host(X5) )
=> ~ ( elem(m_Down(X7),queue(host(X4)))
& elem(m_Down(X5),queue(host(X6))) ) ) )
=> ( setIn(X3,alive)
=> ( ~ leq(host(X3),host(X2))
=> ( ~ ( ( host(X2) = index(ldr,host(X3))
& norm = index(status,host(X3)) )
| ( host(X2) = host(index(elid,host(X3)))
& wait = index(status,host(X3)) ) )
=> ( ~ ( elec_1 = index(status,host(X3))
& ! [X23] :
( ( ~ leq(host(X3),X23)
& leq(s(zero),X23) )
=> ( setIn(X23,index(down,host(X3)))
| host(X2) = X23 ) ) )
=> ! [X24] :
( host(X3) != host(X24)
=> ! [X25,X26] :
( host(X3) = host(X25)
=> ! [X27] :
( ( host(X25) = host(X27)
& host(X24) = host(X26)
& setIn(X24,alive)
& host(X24) != host(X25)
& setIn(X25,alive) )
=> ~ ( elem(m_Down(X27),queue(host(X24)))
& elem(m_Down(X26),X1) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f68]) ).
fof(f68,negated_conjecture,
~ ! [X12,X11,X5,X4] :
( ( ! [X6,X15,X14,X13] :
( ( host(X6) != host(X14)
& setIn(X14,alive)
& setIn(X6,alive)
& host(X6) = host(X15)
& host(X13) = host(X14) )
=> ~ ( elem(m_Down(X15),queue(host(X14)))
& elem(m_Down(X13),queue(host(X6))) ) )
& ! [X13,X6] :
( elem(m_Down(X13),queue(host(X6)))
=> ~ setIn(X13,alive) )
& ! [X13,X6] :
( ( host(X6) = host(X13)
& X6 != X13 )
=> ( ~ setIn(X13,alive)
| ~ setIn(X6,alive) ) )
& ! [X6,X13] :
( ( leq(X13,X6)
& host(X6) = host(X13)
& ~ setIn(X6,alive) )
=> ~ setIn(X13,alive) )
& ! [X6,X13,X14] :
( elem(m_Ack(X13,X6),queue(host(X14)))
=> ~ leq(host(X6),host(X13)) )
& ! [X13,X6] :
( elem(m_Halt(X13),queue(host(X6)))
=> ~ leq(host(X6),host(X13)) )
& ! [X13,X6] :
( elem(m_Down(X13),queue(host(X6)))
=> host(X6) != host(X13) )
& queue(host(X4)) = cons(m_Down(X5),X11)
& ! [X13,X6] :
( setIn(X13,alive)
=> ~ elem(m_Down(X13),queue(host(X6))) ) )
=> ( setIn(X4,alive)
=> ( ~ leq(host(X4),host(X5))
=> ( ~ ( ( wait = index(status,host(X4))
& host(X5) = host(index(elid,host(X4))) )
| ( host(X5) = index(ldr,host(X4))
& norm = index(status,host(X4)) ) )
=> ( ~ ( ! [X6] :
( ( ~ leq(host(X4),X6)
& leq(s(zero),X6) )
=> ( setIn(X6,index(down,host(X4)))
| host(X5) = X6 ) )
& elec_1 = index(status,host(X4)) )
=> ! [X6] :
( host(X4) != host(X6)
=> ! [X17,X16] :
( host(X4) = host(X17)
=> ! [X18] :
( ( setIn(X17,alive)
& setIn(X6,alive)
& host(X6) = host(X16)
& host(X17) = host(X18)
& host(X6) != host(X17) )
=> ~ ( elem(m_Down(X18),queue(host(X6)))
& elem(m_Down(X16),X11) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[],[f67]) ).
fof(f67,conjecture,
! [X12,X11,X5,X4] :
( ( ! [X6,X15,X14,X13] :
( ( host(X6) != host(X14)
& setIn(X14,alive)
& setIn(X6,alive)
& host(X6) = host(X15)
& host(X13) = host(X14) )
=> ~ ( elem(m_Down(X15),queue(host(X14)))
& elem(m_Down(X13),queue(host(X6))) ) )
& ! [X13,X6] :
( elem(m_Down(X13),queue(host(X6)))
=> ~ setIn(X13,alive) )
& ! [X13,X6] :
( ( host(X6) = host(X13)
& X6 != X13 )
=> ( ~ setIn(X13,alive)
| ~ setIn(X6,alive) ) )
& ! [X6,X13] :
( ( leq(X13,X6)
& host(X6) = host(X13)
& ~ setIn(X6,alive) )
=> ~ setIn(X13,alive) )
& ! [X6,X13,X14] :
( elem(m_Ack(X13,X6),queue(host(X14)))
=> ~ leq(host(X6),host(X13)) )
& ! [X13,X6] :
( elem(m_Halt(X13),queue(host(X6)))
=> ~ leq(host(X6),host(X13)) )
& ! [X13,X6] :
( elem(m_Down(X13),queue(host(X6)))
=> host(X6) != host(X13) )
& queue(host(X4)) = cons(m_Down(X5),X11)
& ! [X13,X6] :
( setIn(X13,alive)
=> ~ elem(m_Down(X13),queue(host(X6))) ) )
=> ( setIn(X4,alive)
=> ( ~ leq(host(X4),host(X5))
=> ( ~ ( ( wait = index(status,host(X4))
& host(X5) = host(index(elid,host(X4))) )
| ( host(X5) = index(ldr,host(X4))
& norm = index(status,host(X4)) ) )
=> ( ~ ( ! [X6] :
( ( ~ leq(host(X4),X6)
& leq(s(zero),X6) )
=> ( setIn(X6,index(down,host(X4)))
| host(X5) = X6 ) )
& elec_1 = index(status,host(X4)) )
=> ! [X6] :
( host(X4) != host(X6)
=> ! [X17,X16] :
( host(X4) = host(X17)
=> ! [X18] :
( ( setIn(X17,alive)
& setIn(X6,alive)
& host(X6) = host(X16)
& host(X17) = host(X18)
& host(X6) != host(X17) )
=> ~ ( elem(m_Down(X18),queue(host(X6)))
& elem(m_Down(X16),X11) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
fof(f674,plain,
( ~ elem(m_Down(sK8),queue(host(sK5)))
| ~ spl11_16 ),
inference(subsumption_resolution,[],[f672,f232]) ).
fof(f232,plain,
setIn(sK5,alive),
inference(cnf_transformation,[],[f160]) ).
fof(f672,plain,
( ~ setIn(sK5,alive)
| ~ elem(m_Down(sK8),queue(host(sK5)))
| ~ spl11_16 ),
inference(equality_resolution,[],[f554]) ).
fof(f554,plain,
( ! [X0] :
( host(X0) != host(sK5)
| ~ elem(m_Down(sK8),queue(host(X0)))
| ~ setIn(X0,alive) )
| ~ spl11_16 ),
inference(avatar_component_clause,[],[f553]) ).
fof(f553,plain,
( spl11_16
<=> ! [X0] :
( ~ setIn(X0,alive)
| host(X0) != host(sK5)
| ~ elem(m_Down(sK8),queue(host(X0))) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_16])]) ).
fof(f569,plain,
spl11_15,
inference(avatar_contradiction_clause,[],[f568]) ).
fof(f568,plain,
( $false
| spl11_15 ),
inference(subsumption_resolution,[],[f563,f229]) ).
fof(f229,plain,
elem(m_Down(sK6),sK1),
inference(cnf_transformation,[],[f160]) ).
fof(f563,plain,
( ~ elem(m_Down(sK6),sK1)
| spl11_15 ),
inference(resolution,[],[f560,f551]) ).
fof(f551,plain,
( ~ elem(m_Down(sK6),queue(host(sK3)))
| spl11_15 ),
inference(avatar_component_clause,[],[f549]) ).
fof(f549,plain,
( spl11_15
<=> elem(m_Down(sK6),queue(host(sK3))) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_15])]) ).
fof(f560,plain,
! [X0] :
( elem(X0,queue(host(sK3)))
| ~ elem(X0,sK1) ),
inference(superposition,[],[f264,f240]) ).
fof(f240,plain,
cons(m_Down(sK2),sK1) = queue(host(sK3)),
inference(cnf_transformation,[],[f160]) ).
fof(f264,plain,
! [X2,X0,X1] :
( elem(X1,cons(X2,X0))
| ~ elem(X1,X0) ),
inference(cnf_transformation,[],[f169]) ).
fof(f169,plain,
! [X0,X1,X2] :
( ( X1 = X2
| elem(X1,X0)
| ~ elem(X1,cons(X2,X0)) )
& ( elem(X1,cons(X2,X0))
| ( X1 != X2
& ~ elem(X1,X0) ) ) ),
inference(flattening,[],[f168]) ).
fof(f168,plain,
! [X0,X1,X2] :
( ( X1 = X2
| elem(X1,X0)
| ~ elem(X1,cons(X2,X0)) )
& ( elem(X1,cons(X2,X0))
| ( X1 != X2
& ~ elem(X1,X0) ) ) ),
inference(nnf_transformation,[],[f78]) ).
fof(f78,plain,
! [X0,X1,X2] :
( ( X1 = X2
| elem(X1,X0) )
<=> elem(X1,cons(X2,X0)) ),
inference(rectify,[],[f47]) ).
fof(f47,axiom,
! [X3,X4,X5] :
( ( elem(X4,X3)
| X4 = X5 )
<=> elem(X4,cons(X5,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_46) ).
fof(f555,plain,
( ~ spl11_15
| spl11_16 ),
inference(avatar_split_clause,[],[f547,f553,f549]) ).
fof(f547,plain,
! [X0] :
( ~ setIn(X0,alive)
| ~ elem(m_Down(sK8),queue(host(X0)))
| host(X0) != host(sK5)
| ~ elem(m_Down(sK6),queue(host(sK3))) ),
inference(subsumption_resolution,[],[f546,f388]) ).
fof(f388,plain,
! [X2] :
( host(X2) != host(sK3)
| ~ elem(m_Down(sK8),queue(host(X2))) ),
inference(superposition,[],[f239,f353]) ).
fof(f353,plain,
host(sK3) = host(sK8),
inference(forward_demodulation,[],[f227,f225]) ).
fof(f225,plain,
host(sK3) = host(sK7),
inference(cnf_transformation,[],[f160]) ).
fof(f227,plain,
host(sK7) = host(sK8),
inference(cnf_transformation,[],[f160]) ).
fof(f239,plain,
! [X12,X13] :
( host(X13) != host(X12)
| ~ elem(m_Down(X13),queue(host(X12))) ),
inference(cnf_transformation,[],[f160]) ).
fof(f546,plain,
! [X0] :
( host(X0) != host(sK5)
| ~ elem(m_Down(sK8),queue(host(X0)))
| ~ setIn(X0,alive)
| ~ elem(m_Down(sK6),queue(host(sK3)))
| host(X0) = host(sK3) ),
inference(subsumption_resolution,[],[f544,f235]) ).
fof(f235,plain,
setIn(sK3,alive),
inference(cnf_transformation,[],[f160]) ).
fof(f544,plain,
! [X0] :
( ~ elem(m_Down(sK8),queue(host(X0)))
| ~ setIn(X0,alive)
| ~ elem(m_Down(sK6),queue(host(sK3)))
| host(X0) = host(sK3)
| host(X0) != host(sK5)
| ~ setIn(sK3,alive) ),
inference(equality_resolution,[],[f510]) ).
fof(f510,plain,
! [X2,X3] :
( host(X3) != host(sK3)
| ~ setIn(X3,alive)
| host(X2) = host(X3)
| ~ elem(m_Down(sK6),queue(host(X3)))
| ~ elem(m_Down(sK8),queue(host(X2)))
| ~ setIn(X2,alive)
| host(X2) != host(sK5) ),
inference(superposition,[],[f489,f231]) ).
fof(f231,plain,
host(sK5) = host(sK6),
inference(cnf_transformation,[],[f160]) ).
fof(f489,plain,
! [X2,X0,X1] :
( host(X2) != host(X1)
| host(X0) != host(sK3)
| host(X0) = host(X1)
| ~ setIn(X0,alive)
| ~ elem(m_Down(X2),queue(host(X0)))
| ~ setIn(X1,alive)
| ~ elem(m_Down(sK8),queue(host(X1))) ),
inference(superposition,[],[f242,f353]) ).
fof(f242,plain,
! [X8,X6,X9,X7] :
( host(X7) != host(X9)
| ~ setIn(X6,alive)
| ~ elem(m_Down(X8),queue(host(X9)))
| ~ elem(m_Down(X7),queue(host(X6)))
| ~ setIn(X9,alive)
| host(X6) = host(X9)
| host(X6) != host(X8) ),
inference(cnf_transformation,[],[f160]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV455+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.14/0.35 % Computer : n019.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Aug 30 19:33:35 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.20/0.49 % (9078)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.20/0.50 % (9070)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.51 % (9087)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.20/0.51 % (9079)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.20/0.51 % (9071)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.51 TRYING [4]
% 0.20/0.52 % (9086)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.20/0.52 % (9071)Instruction limit reached!
% 0.20/0.52 % (9071)------------------------------
% 0.20/0.52 % (9071)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (9071)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (9071)Termination reason: Unknown
% 0.20/0.52 % (9071)Termination phase: Saturation
% 0.20/0.52
% 0.20/0.52 % (9071)Memory used [KB]: 5628
% 0.20/0.52 % (9071)Time elapsed: 0.072 s
% 0.20/0.52 % (9071)Instructions burned: 7 (million)
% 0.20/0.52 % (9071)------------------------------
% 0.20/0.52 % (9071)------------------------------
% 1.31/0.53 % (9066)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 1.31/0.54 % (9069)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 1.31/0.54 % (9067)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.31/0.54 % (9077)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.31/0.54 % (9083)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 1.31/0.55 % (9065)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 1.31/0.55 % (9093)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 1.31/0.55 % (9074)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 1.50/0.55 % (9064)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 1.50/0.55 % (9075)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 1.50/0.55 % (9089)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 1.50/0.55 % (9091)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 1.50/0.56 % (9068)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.50/0.56 % (9085)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 1.50/0.56 % (9081)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 1.50/0.57 % (9073)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.50/0.57 % (9080)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.50/0.57 % (9070)Instruction limit reached!
% 1.50/0.57 % (9070)------------------------------
% 1.50/0.57 % (9070)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.50/0.57 % (9070)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.50/0.57 % (9070)Termination reason: Unknown
% 1.50/0.57 % (9070)Termination phase: Finite model building SAT solving
% 1.50/0.57
% 1.50/0.57 % (9070)Memory used [KB]: 8827
% 1.50/0.57 % (9070)Time elapsed: 0.141 s
% 1.50/0.57 % (9070)Instructions burned: 52 (million)
% 1.50/0.57 % (9070)------------------------------
% 1.50/0.57 % (9070)------------------------------
% 1.50/0.57 % (9076)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 1.50/0.57 % (9090)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 1.50/0.57 % (9072)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 1.50/0.57 % (9088)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 1.50/0.58 % (9092)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 1.50/0.58 % (9072)Instruction limit reached!
% 1.50/0.58 % (9072)------------------------------
% 1.50/0.58 % (9072)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.50/0.58 % (9072)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.50/0.58 % (9072)Termination reason: Unknown
% 1.50/0.58 % (9072)Termination phase: Preprocessing 1
% 1.50/0.58
% 1.50/0.58 % (9072)Memory used [KB]: 895
% 1.50/0.58 % (9072)Time elapsed: 0.003 s
% 1.50/0.58 % (9072)Instructions burned: 2 (million)
% 1.50/0.58 % (9072)------------------------------
% 1.50/0.58 % (9072)------------------------------
% 1.50/0.58 % (9082)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 1.50/0.58 % (9084)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 1.50/0.58 % (9078)Instruction limit reached!
% 1.50/0.58 % (9078)------------------------------
% 1.50/0.58 % (9078)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.50/0.58 % (9078)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.50/0.58 % (9078)Termination reason: Unknown
% 1.50/0.58 % (9078)Termination phase: Saturation
% 1.50/0.58
% 1.50/0.58 % (9078)Memory used [KB]: 6652
% 1.50/0.58 % (9078)Time elapsed: 0.042 s
% 1.50/0.58 % (9078)Instructions burned: 68 (million)
% 1.50/0.58 % (9078)------------------------------
% 1.50/0.58 % (9078)------------------------------
% 1.50/0.59 TRYING [4]
% 1.50/0.60 TRYING [4]
% 1.50/0.61 % (9066)Instruction limit reached!
% 1.50/0.61 % (9066)------------------------------
% 1.50/0.61 % (9066)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.50/0.61 % (9066)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.50/0.61 % (9066)Termination reason: Unknown
% 1.50/0.61 % (9066)Termination phase: Saturation
% 1.50/0.61
% 1.50/0.61 % (9066)Memory used [KB]: 1535
% 1.50/0.61 % (9066)Time elapsed: 0.189 s
% 1.50/0.61 % (9066)Instructions burned: 37 (million)
% 1.50/0.61 % (9066)------------------------------
% 1.50/0.61 % (9066)------------------------------
% 1.50/0.62 % (9067)Instruction limit reached!
% 1.50/0.62 % (9067)------------------------------
% 1.50/0.62 % (9067)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.50/0.62 % (9067)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.50/0.62 % (9067)Termination reason: Unknown
% 1.50/0.62 % (9067)Termination phase: Saturation
% 1.50/0.62
% 1.50/0.62 % (9067)Memory used [KB]: 6396
% 1.50/0.62 % (9067)Time elapsed: 0.219 s
% 1.50/0.62 % (9067)Instructions burned: 51 (million)
% 1.50/0.62 % (9067)------------------------------
% 1.50/0.62 % (9067)------------------------------
% 2.13/0.64 % (9069)Instruction limit reached!
% 2.13/0.64 % (9069)------------------------------
% 2.13/0.64 % (9069)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.13/0.64 % (9069)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.13/0.64 % (9069)Termination reason: Unknown
% 2.13/0.64 % (9069)Termination phase: Saturation
% 2.13/0.64
% 2.13/0.64 % (9069)Memory used [KB]: 6012
% 2.13/0.64 % (9069)Time elapsed: 0.212 s
% 2.13/0.64 % (9069)Instructions burned: 49 (million)
% 2.13/0.64 % (9069)------------------------------
% 2.13/0.64 % (9069)------------------------------
% 2.13/0.64 % (9065)Instruction limit reached!
% 2.13/0.64 % (9065)------------------------------
% 2.13/0.64 % (9065)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.13/0.64 % (9065)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.13/0.64 % (9065)Termination reason: Unknown
% 2.13/0.64 % (9065)Termination phase: Saturation
% 2.13/0.64
% 2.13/0.64 % (9065)Memory used [KB]: 6524
% 2.13/0.64 % (9065)Time elapsed: 0.228 s
% 2.13/0.64 % (9065)Instructions burned: 50 (million)
% 2.13/0.64 % (9065)------------------------------
% 2.13/0.64 % (9065)------------------------------
% 2.13/0.64 % (9079)Instruction limit reached!
% 2.13/0.64 % (9079)------------------------------
% 2.13/0.64 % (9079)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.13/0.64 % (9079)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.13/0.64 % (9079)Termination reason: Unknown
% 2.13/0.64 % (9079)Termination phase: Saturation
% 2.13/0.64
% 2.13/0.64 % (9079)Memory used [KB]: 1918
% 2.13/0.64 % (9079)Time elapsed: 0.149 s
% 2.13/0.64 % (9079)Instructions burned: 75 (million)
% 2.13/0.64 % (9079)------------------------------
% 2.13/0.64 % (9079)------------------------------
% 2.13/0.64 % (9084)First to succeed.
% 2.13/0.64 % (9081)Instruction limit reached!
% 2.13/0.64 % (9081)------------------------------
% 2.13/0.64 % (9081)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.13/0.64 % (9081)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.13/0.64 % (9081)Termination reason: Unknown
% 2.13/0.64 % (9081)Termination phase: Finite model building SAT solving
% 2.13/0.64
% 2.13/0.64 % (9081)Memory used [KB]: 8955
% 2.13/0.64 % (9081)Time elapsed: 0.201 s
% 2.13/0.64 % (9081)Instructions burned: 59 (million)
% 2.13/0.64 % (9081)------------------------------
% 2.13/0.64 % (9081)------------------------------
% 2.13/0.65 % (9084)Refutation found. Thanks to Tanya!
% 2.13/0.65 % SZS status Theorem for theBenchmark
% 2.13/0.65 % SZS output start Proof for theBenchmark
% See solution above
% 2.13/0.65 % (9084)------------------------------
% 2.13/0.65 % (9084)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.13/0.65 % (9084)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.13/0.65 % (9084)Termination reason: Refutation
% 2.13/0.65
% 2.13/0.65 % (9084)Memory used [KB]: 6012
% 2.13/0.65 % (9084)Time elapsed: 0.239 s
% 2.13/0.65 % (9084)Instructions burned: 22 (million)
% 2.13/0.65 % (9084)------------------------------
% 2.13/0.65 % (9084)------------------------------
% 2.13/0.65 % (9063)Success in time 0.285 s
%------------------------------------------------------------------------------