↑ Up

Vampire-SAT---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : SWC308+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n017.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Sep 29 01:05:29 PM UTC 2026

% Result   : Theorem 7.73s 1.47s
% Output   : Refutation 7.73s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :   16
% Syntax   : Number of formulae    :  112 (  17 unt;   7 def)
%            Number of atoms       :  413 ( 111 equ)
%            Maximal formula atoms :   24 (   3 avg)
%            Number of connectives :  507 ( 206   ~; 224   |;  46   &)
%                                         (   9 <=>;  22  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   24 (   5 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   12 (  10 usr;   8 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   5 con; 0-2 aty)
%            Number of variables   :   97 (   0 sgn  77   !;  20   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f15,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ( neq(X0,X1)
          <=> X0 != X1 ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).

fof(f16,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssItem(X1)
         => ssList(cons(X1,X0)) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).

fof(f17,axiom,
    ssList(nil),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).

fof(f22,axiom,
    ! [X0] :
      ( ssList(X0)
     => ( nil != X0
       => ssItem(hd(X0)) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax22) ).

fof(f24,axiom,
    ! [X0] :
      ( ssList(X0)
     => ( nil != X0
       => ssList(tl(X0)) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax24) ).

fof(f26,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ssList(app(X0,X1)) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).

fof(f78,axiom,
    ! [X0] :
      ( ssList(X0)
     => ( nil != X0
       => cons(hd(X0),tl(X0)) = X0 ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax78) ).

fof(f81,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssItem(X1)
         => cons(X1,X0) = app(cons(X1,nil),X0) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax81) ).

fof(f96,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ssList(X3)
                 => ( X1 != X3
                    | X0 != X2
                    | ~ neq(X1,nil)
                    | ? [X4] :
                        ( ssList(X4)
                        & X0 = X4
                        & ? [X5] :
                            ( ssList(X5)
                            & ? [X6] :
                                ( ssList(X6)
                                & tl(X1) = X5
                                & app(X5,X6) = X4
                                & ? [X7] :
                                    ( ssItem(X7)
                                    & cons(X7,nil) = X6
                                    & hd(X1) = X7
                                    & neq(nil,X1) )
                                & neq(nil,X1) ) ) )
                    | ? [X8] :
                        ( ssItem(X8)
                        & ? [X9] :
                            ( ssList(X9)
                            & app(X9,cons(X8,nil)) != X2
                            & app(cons(X8,nil),X9) = X3 ) )
                    | ( nil != X2
                      & nil = X3 ) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

fof(f97,negated_conjecture,
    ~ ! [X0] :
        ( ssList(X0)
       => ! [X1] :
            ( ssList(X1)
           => ! [X2] :
                ( ssList(X2)
               => ! [X3] :
                    ( ssList(X3)
                   => ( X1 != X3
                      | X0 != X2
                      | ~ neq(X1,nil)
                      | ? [X4] :
                          ( ssList(X4)
                          & X0 = X4
                          & ? [X5] :
                              ( ssList(X5)
                              & ? [X6] :
                                  ( ssList(X6)
                                  & tl(X1) = X5
                                  & app(X5,X6) = X4
                                  & ? [X7] :
                                      ( ssItem(X7)
                                      & cons(X7,nil) = X6
                                      & hd(X1) = X7
                                      & neq(nil,X1) )
                                  & neq(nil,X1) ) ) )
                      | ? [X8] :
                          ( ssItem(X8)
                          & ? [X9] :
                              ( ssList(X9)
                              & app(X9,cons(X8,nil)) != X2
                              & app(cons(X8,nil),X9) = X3 ) )
                      | ( nil != X2
                        & nil = X3 ) ) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f96]) ).

fof(f118,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( neq(X0,X1)
          <=> X0 != X1 )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f15]) ).

fof(f119,plain,
    ! [X0] :
      ( ! [X1] :
          ( ssList(cons(X1,X0))
          | ~ ssItem(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f16]) ).

fof(f126,plain,
    ! [X0] :
      ( ssItem(hd(X0))
      | nil = X0
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f22]) ).

fof(f127,plain,
    ! [X0] :
      ( ssItem(hd(X0))
      | nil = X0
      | ~ ssList(X0) ),
    inference(flattening,[],[f126]) ).

fof(f129,plain,
    ! [X0] :
      ( ssList(tl(X0))
      | nil = X0
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f24]) ).

fof(f130,plain,
    ! [X0] :
      ( ssList(tl(X0))
      | nil = X0
      | ~ ssList(X0) ),
    inference(flattening,[],[f129]) ).

fof(f132,plain,
    ! [X0] :
      ( ! [X1] :
          ( ssList(app(X0,X1))
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f26]) ).

fof(f192,plain,
    ! [X0] :
      ( cons(hd(X0),tl(X0)) = X0
      | nil = X0
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f78]) ).

fof(f193,plain,
    ! [X0] :
      ( cons(hd(X0),tl(X0)) = X0
      | nil = X0
      | ~ ssList(X0) ),
    inference(flattening,[],[f192]) ).

fof(f198,plain,
    ! [X0] :
      ( ! [X1] :
          ( cons(X1,X0) = app(cons(X1,nil),X0)
          | ~ ssItem(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f81]) ).

fof(f221,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( X1 = X3
                  & X0 = X2
                  & neq(X1,nil)
                  & ! [X4] :
                      ( ~ ssList(X4)
                      | X0 != X4
                      | ! [X5] :
                          ( ~ ssList(X5)
                          | ! [X6] :
                              ( ~ ssList(X6)
                              | tl(X1) != X5
                              | app(X5,X6) != X4
                              | ! [X7] :
                                  ( ~ ssItem(X7)
                                  | cons(X7,nil) != X6
                                  | hd(X1) != X7
                                  | ~ neq(nil,X1) )
                              | ~ neq(nil,X1) ) ) )
                  & ! [X8] :
                      ( ~ ssItem(X8)
                      | ! [X9] :
                          ( ~ ssList(X9)
                          | app(X9,cons(X8,nil)) = X2
                          | app(cons(X8,nil),X9) != X3 ) )
                  & ( nil = X2
                    | nil != X3 )
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(ennf_transformation,[],[f97]) ).

fof(f222,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( X1 = X3
                  & X0 = X2
                  & neq(X1,nil)
                  & ! [X4] :
                      ( ~ ssList(X4)
                      | X0 != X4
                      | ! [X5] :
                          ( ~ ssList(X5)
                          | ! [X6] :
                              ( ~ ssList(X6)
                              | tl(X1) != X5
                              | app(X5,X6) != X4
                              | ! [X7] :
                                  ( ~ ssItem(X7)
                                  | cons(X7,nil) != X6
                                  | hd(X1) != X7
                                  | ~ neq(nil,X1) )
                              | ~ neq(nil,X1) ) ) )
                  & ! [X8] :
                      ( ~ ssItem(X8)
                      | ! [X9] :
                          ( ~ ssList(X9)
                          | app(X9,cons(X8,nil)) = X2
                          | app(cons(X8,nil),X9) != X3 ) )
                  & ( nil = X2
                    | nil != X3 )
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(flattening,[],[f221]) ).

fof(f303,plain,
    ! [X0,X1] :
      ( neq(X0,X1)
      | ~ ssList(X1)
      | X0 = X1
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f118]) ).

fof(f304,plain,
    ! [X0,X1] :
      ( ~ ssList(X0)
      | ~ ssList(X1)
      | X0 != X1
      | ~ neq(X0,X1) ),
    inference(cnf_transformation,[],[f118]) ).

fof(f305,plain,
    ! [X0,X1] :
      ( ssList(cons(X1,X0))
      | ~ ssItem(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f119]) ).

fof(f306,plain,
    ssList(nil),
    inference(cnf_transformation,[],[f17]) ).

fof(f314,plain,
    ! [X0] :
      ( ssItem(hd(X0))
      | nil = X0
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f127]) ).

fof(f316,plain,
    ! [X0] :
      ( ssList(tl(X0))
      | nil = X0
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f130]) ).

fof(f318,plain,
    ! [X0,X1] :
      ( ssList(app(X0,X1))
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f132]) ).

fof(f389,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | nil = X0
      | cons(hd(X0),tl(X0)) = X0 ),
    inference(cnf_transformation,[],[f193]) ).

fof(f392,plain,
    ! [X0,X1] :
      ( ~ ssList(X0)
      | ~ ssItem(X1)
      | cons(X1,X0) = app(cons(X1,nil),X0) ),
    inference(cnf_transformation,[],[f198]) ).

fof(f411,plain,
    ! [X6,X7,X4,X5] :
      ( ~ neq(nil,sK48)
      | hd(sK48) != X7
      | cons(X7,nil) != X6
      | ~ ssItem(X7)
      | app(X5,X6) != X4
      | tl(sK48) != X5
      | ~ ssList(X6)
      | ~ ssList(X5)
      | sK47 != X4
      | ~ ssList(X4) ),
    inference(cnf_transformation,[],[f222]) ).

fof(f412,plain,
    ! [X8,X9] :
      ( app(cons(X8,nil),X9) != sK50
      | app(X9,cons(X8,nil)) = sK49
      | ~ ssList(X9)
      | ~ ssItem(X8) ),
    inference(cnf_transformation,[],[f222]) ).

fof(f414,plain,
    ssList(sK50),
    inference(cnf_transformation,[],[f222]) ).

fof(f415,plain,
    neq(sK48,nil),
    inference(cnf_transformation,[],[f222]) ).

fof(f416,plain,
    sK47 = sK49,
    inference(cnf_transformation,[],[f222]) ).

fof(f417,plain,
    sK48 = sK50,
    inference(cnf_transformation,[],[f222]) ).

fof(f423,plain,
    neq(sK50,nil),
    inference(definition_unfolding,[],[f415,f417]) ).

fof(f424,plain,
    ! [X6,X7,X4,X5] :
      ( ~ neq(nil,sK50)
      | hd(sK50) != X7
      | cons(X7,nil) != X6
      | ~ ssItem(X7)
      | app(X5,X6) != X4
      | tl(sK50) != X5
      | ~ ssList(X6)
      | ~ ssList(X5)
      | sK49 != X4
      | ~ ssList(X4) ),
    inference(definition_unfolding,[],[f411,f417,f417,f417,f416]) ).

fof(f439,plain,
    ! [X1] :
      ( ~ ssList(X1)
      | ~ ssList(X1)
      | ~ neq(X1,X1) ),
    inference(equality_resolution,[],[f304]) ).

fof(f450,plain,
    ! [X6,X4,X5] :
      ( ~ neq(nil,sK50)
      | cons(hd(sK50),nil) != X6
      | ~ ssItem(hd(sK50))
      | app(X5,X6) != X4
      | tl(sK50) != X5
      | ~ ssList(X6)
      | ~ ssList(X5)
      | sK49 != X4
      | ~ ssList(X4) ),
    inference(equality_resolution,[],[f424]) ).

fof(f451,plain,
    ! [X4,X5] :
      ( ~ neq(nil,sK50)
      | ~ ssItem(hd(sK50))
      | app(X5,cons(hd(sK50),nil)) != X4
      | tl(sK50) != X5
      | ~ ssList(cons(hd(sK50),nil))
      | ~ ssList(X5)
      | sK49 != X4
      | ~ ssList(X4) ),
    inference(equality_resolution,[],[f450]) ).

fof(f452,plain,
    ! [X5] :
      ( ~ neq(nil,sK50)
      | ~ ssItem(hd(sK50))
      | tl(sK50) != X5
      | ~ ssList(cons(hd(sK50),nil))
      | ~ ssList(X5)
      | sK49 != app(X5,cons(hd(sK50),nil))
      | ~ ssList(app(X5,cons(hd(sK50),nil))) ),
    inference(equality_resolution,[],[f451]) ).

fof(f453,plain,
    ( ~ neq(nil,sK50)
    | ~ ssItem(hd(sK50))
    | ~ ssList(cons(hd(sK50),nil))
    | ~ ssList(tl(sK50))
    | sK49 != app(tl(sK50),cons(hd(sK50),nil))
    | ~ ssList(app(tl(sK50),cons(hd(sK50),nil))) ),
    inference(equality_resolution,[],[f452]) ).

fof(f458,plain,
    ! [X1] :
      ( ~ neq(X1,X1)
      | ~ ssList(X1) ),
    inference(duplicate_literal_removal,[],[f439]) ).

fof(f466,definition,
    ( spl51_2
  <=> nil = sK50 ),
    introduced(definition,[new_symbols(definition,[spl51_2])],[avatar_definition]) ).

fof(f467,plain,
    ( nil = sK50
    | ~ spl51_2 ),
    inference(avatar_component_clause,[],[f466]) ).

fof(f468,plain,
    ( nil != sK50
    | spl51_2 ),
    inference(avatar_component_clause,[],[f466]) ).

fof(f471,definition,
    ( spl51_3
  <=> ssList(app(tl(sK50),cons(hd(sK50),nil))) ),
    introduced(definition,[new_symbols(definition,[spl51_3])],[avatar_definition]) ).

fof(f473,plain,
    ( ~ ssList(app(tl(sK50),cons(hd(sK50),nil)))
    | spl51_3 ),
    inference(avatar_component_clause,[],[f471]) ).

fof(f475,definition,
    ( spl51_4
  <=> sK49 = app(tl(sK50),cons(hd(sK50),nil)) ),
    introduced(definition,[new_symbols(definition,[spl51_4])],[avatar_definition]) ).

fof(f477,plain,
    ( sK49 != app(tl(sK50),cons(hd(sK50),nil))
    | spl51_4 ),
    inference(avatar_component_clause,[],[f475]) ).

fof(f479,definition,
    ( spl51_5
  <=> ssList(tl(sK50)) ),
    introduced(definition,[new_symbols(definition,[spl51_5])],[avatar_definition]) ).

fof(f480,plain,
    ( ssList(tl(sK50))
    | ~ spl51_5 ),
    inference(avatar_component_clause,[],[f479]) ).

fof(f481,plain,
    ( ~ ssList(tl(sK50))
    | spl51_5 ),
    inference(avatar_component_clause,[],[f479]) ).

fof(f483,definition,
    ( spl51_6
  <=> ssList(cons(hd(sK50),nil)) ),
    introduced(definition,[new_symbols(definition,[spl51_6])],[avatar_definition]) ).

fof(f485,plain,
    ( ~ ssList(cons(hd(sK50),nil))
    | spl51_6 ),
    inference(avatar_component_clause,[],[f483]) ).

fof(f487,definition,
    ( spl51_7
  <=> ssItem(hd(sK50)) ),
    introduced(definition,[new_symbols(definition,[spl51_7])],[avatar_definition]) ).

fof(f488,plain,
    ( ssItem(hd(sK50))
    | ~ spl51_7 ),
    inference(avatar_component_clause,[],[f487]) ).

fof(f489,plain,
    ( ~ ssItem(hd(sK50))
    | spl51_7 ),
    inference(avatar_component_clause,[],[f487]) ).

fof(f491,definition,
    ( spl51_8
  <=> neq(nil,sK50) ),
    introduced(definition,[new_symbols(definition,[spl51_8])],[avatar_definition]) ).

fof(f493,plain,
    ( ~ neq(nil,sK50)
    | spl51_8 ),
    inference(avatar_component_clause,[],[f491]) ).

fof(f494,plain,
    ( ~ spl51_3
    | ~ spl51_4
    | ~ spl51_5
    | ~ spl51_6
    | ~ spl51_7
    | ~ spl51_8 ),
    inference(avatar_split_clause,[],[f453,f491,f487,f483,f479,f475,f471]) ).

fof(f547,plain,
    ( ~ ssList(cons(hd(sK50),nil))
    | ~ ssList(tl(sK50))
    | spl51_3 ),
    inference(resolution,[],[f318,f473]) ).

fof(f560,plain,
    ( ~ spl51_5
    | ~ spl51_6
    | spl51_3 ),
    inference(avatar_split_clause,[],[f547,f471,f483,f479]) ).

fof(f561,plain,
    ( nil = sK50
    | ~ ssList(sK50)
    | spl51_5 ),
    inference(resolution,[],[f481,f316]) ).

fof(f562,plain,
    ( ~ ssList(sK50)
    | spl51_2
    | spl51_5 ),
    inference(forward_subsumption_resolution,[],[f561,f468]) ).

fof(f563,plain,
    ( $false
    | spl51_2
    | spl51_5 ),
    inference(forward_subsumption_resolution,[],[f562,f414]) ).

fof(f564,plain,
    ( spl51_2
    | spl51_5 ),
    inference(avatar_contradiction_clause,[],[f563]) ).

fof(f567,plain,
    ( ~ ssItem(hd(sK50))
    | ~ ssList(nil)
    | spl51_6 ),
    inference(resolution,[],[f485,f305]) ).

fof(f568,plain,
    ( ~ ssItem(hd(sK50))
    | spl51_6 ),
    inference(forward_subsumption_resolution,[],[f567,f306]) ).

fof(f569,plain,
    ( ~ spl51_7
    | spl51_6 ),
    inference(avatar_split_clause,[],[f568,f483,f487]) ).

fof(f570,plain,
    ( nil = sK50
    | ~ ssList(sK50)
    | spl51_7 ),
    inference(resolution,[],[f489,f314]) ).

fof(f571,plain,
    ( ~ ssList(sK50)
    | spl51_2
    | spl51_7 ),
    inference(forward_subsumption_resolution,[],[f570,f468]) ).

fof(f572,plain,
    ( $false
    | spl51_2
    | spl51_7 ),
    inference(forward_subsumption_resolution,[],[f571,f414]) ).

fof(f573,plain,
    ( spl51_2
    | spl51_7 ),
    inference(avatar_contradiction_clause,[],[f572]) ).

fof(f579,plain,
    ( neq(nil,nil)
    | ~ spl51_2 ),
    inference(superposition,[],[f423,f467]) ).

fof(f591,plain,
    ( ~ ssList(nil)
    | ~ spl51_2 ),
    inference(resolution,[],[f579,f458]) ).

fof(f592,plain,
    ( $false
    | ~ spl51_2 ),
    inference(forward_subsumption_resolution,[],[f591,f306]) ).

fof(f593,plain,
    ~ spl51_2,
    inference(avatar_contradiction_clause,[],[f592]) ).

fof(f1156,plain,
    ( nil = sK50
    | sK50 = cons(hd(sK50),tl(sK50)) ),
    inference(resolution,[],[f389,f414]) ).

fof(f1157,plain,
    ( sK50 = cons(hd(sK50),tl(sK50))
    | spl51_2 ),
    inference(forward_subsumption_resolution,[],[f1156,f468]) ).

fof(f1253,plain,
    ( ! [X0] :
        ( ~ ssItem(X0)
        | cons(X0,tl(sK50)) = app(cons(X0,nil),tl(sK50)) )
    | ~ spl51_5 ),
    inference(resolution,[],[f392,f480]) ).

fof(f3333,plain,
    ( cons(hd(sK50),tl(sK50)) = app(cons(hd(sK50),nil),tl(sK50))
    | ~ spl51_5
    | ~ spl51_7 ),
    inference(resolution,[],[f1253,f488]) ).

fof(f3355,plain,
    ( sK50 = app(cons(hd(sK50),nil),tl(sK50))
    | spl51_2
    | ~ spl51_5
    | ~ spl51_7 ),
    inference(forward_demodulation,[],[f3333,f1157]) ).

fof(f3357,plain,
    ( sK50 != sK50
    | sK49 = app(tl(sK50),cons(hd(sK50),nil))
    | ~ ssList(tl(sK50))
    | ~ ssItem(hd(sK50))
    | spl51_2
    | ~ spl51_5
    | ~ spl51_7 ),
    inference(superposition,[],[f412,f3355]) ).

fof(f3374,plain,
    ( sK49 = app(tl(sK50),cons(hd(sK50),nil))
    | ~ ssList(tl(sK50))
    | ~ ssItem(hd(sK50))
    | spl51_2
    | ~ spl51_5
    | ~ spl51_7 ),
    inference(trivial_inequality_removal,[],[f3357]) ).

fof(f3387,plain,
    ( sK49 = app(tl(sK50),cons(hd(sK50),nil))
    | ~ ssItem(hd(sK50))
    | spl51_2
    | ~ spl51_5
    | ~ spl51_7 ),
    inference(forward_subsumption_resolution,[],[f3374,f480]) ).

fof(f3400,plain,
    ( sK49 = app(tl(sK50),cons(hd(sK50),nil))
    | spl51_2
    | ~ spl51_5
    | ~ spl51_7 ),
    inference(forward_subsumption_resolution,[],[f3387,f488]) ).

fof(f5028,plain,
    ( $false
    | spl51_2
    | spl51_4
    | ~ spl51_5
    | ~ spl51_7 ),
    inference(forward_subsumption_resolution,[],[f3400,f477]) ).

fof(f5029,plain,
    ( spl51_2
    | spl51_4
    | ~ spl51_5
    | ~ spl51_7 ),
    inference(avatar_contradiction_clause,[],[f5028]) ).

fof(f5030,plain,
    ( ~ ssList(sK50)
    | nil = sK50
    | ~ ssList(nil)
    | spl51_8 ),
    inference(resolution,[],[f493,f303]) ).

fof(f5033,plain,
    ( nil = sK50
    | ~ ssList(nil)
    | spl51_8 ),
    inference(forward_subsumption_resolution,[],[f5030,f414]) ).

fof(f5034,plain,
    ( ~ ssList(nil)
    | spl51_2
    | spl51_8 ),
    inference(forward_subsumption_resolution,[],[f5033,f468]) ).

fof(f5035,plain,
    ( $false
    | spl51_2
    | spl51_8 ),
    inference(forward_subsumption_resolution,[],[f5034,f306]) ).

fof(f5036,plain,
    ( spl51_2
    | spl51_8 ),
    inference(avatar_contradiction_clause,[],[f5035]) ).

cnf(s2,plain,
    ( ~ spl51_3
    | ~ spl51_4
    | ~ spl51_5
    | ~ spl51_6
    | ~ spl51_7
    | ~ spl51_8 ),
    inference(sat_conversion,[],[f494]) ).

cnf(s3,plain,
    ( spl51_3
    | ~ spl51_5
    | ~ spl51_6 ),
    inference(sat_conversion,[],[f560]) ).

cnf(s4,plain,
    ( spl51_2
    | spl51_5 ),
    inference(sat_conversion,[],[f564]) ).

cnf(s5,plain,
    ( spl51_6
    | ~ spl51_7 ),
    inference(sat_conversion,[],[f569]) ).

cnf(s6,plain,
    ( spl51_2
    | spl51_7 ),
    inference(sat_conversion,[],[f573]) ).

cnf(s7,plain,
    ~ spl51_2,
    inference(sat_conversion,[],[f593]) ).

cnf(s18,plain,
    ( spl51_2
    | spl51_4
    | ~ spl51_5
    | ~ spl51_7 ),
    inference(sat_conversion,[],[f5029]) ).

cnf(s19,plain,
    ( spl51_2
    | spl51_8 ),
    inference(sat_conversion,[],[f5036]) ).

cnf(s20,plain,
    spl51_8,
    inference(rat,[],[s19,s7]) ).

cnf(s24,plain,
    spl51_7,
    inference(rat,[],[s6,s7]) ).

cnf(s25,plain,
    spl51_6,
    inference(rat,[],[s5,s24]) ).

cnf(s26,plain,
    spl51_5,
    inference(rat,[],[s4,s7]) ).

cnf(s27,plain,
    spl51_4,
    inference(rat,[],[s18,s24,s7,s26]) ).

cnf(s28,plain,
    spl51_3,
    inference(rat,[],[s3,s25,s26]) ).

cnf(s29,plain,
    $false,
    inference(rat,[],[s2,s20,s24,s25,s26,s27,s28]) ).

fof(f5037,plain,
    $false,
    inference(avatar_sat_refutation,[],[s29]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC308+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.17  % Computer : n017.cluster.edu
% 0.09/0.17  % Model    : x86_64 x86_64
% 0.09/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.17  % Memory   : 8046.5625MB
% 0.09/0.17  % OS       : Linux 6.8.0-71-generic
% 0.09/0.17  % CPULimit : 300
% 0.09/0.17  % WCLimit  : 300
% 0.09/0.17  % DateTime : Mon Sep 28 08:55:36 UTC 2026
% 0.09/0.17  % CPUTime  : 
% 0.09/0.17  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.20  Running first-order model finding
% 0.09/0.20  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.73/1.47  % (3412152)Will run a generic schedule for satisfiability detection.
% 7.73/1.47  % (3412163)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3465309297:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 7.73/1.47  % (3412158)% WARNING: option uhcvi not known.
% 7.73/1.47  % (3412161)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1936457154:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 7.73/1.47  % (3412157)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=781536416_2999 on theBenchmark for (2999ds/0Mi)
% 7.73/1.47  % (3412158)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=217347056:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 7.73/1.47  % (3412160)dis+10_1_sil=32000:sp=arity:random_seed=1841176396:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 7.73/1.47  % (3412162)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3149588494:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 7.73/1.47  % (3412159)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=965829466:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 7.73/1.47  % TRYING [1]
% 7.73/1.47  % TRYING [2]
% 7.73/1.47  % TRYING [3]
% 7.73/1.47  % TRYING [4]
% 7.73/1.47  % (3412163)Instruction limit reached! 
% 7.73/1.47  % (3412163)------------------------------
% 7.73/1.47  % (3412163)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.73/1.47  % (3412163)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.73/1.47  % (3412163)CaDiCaL version: 2.1.3
% 7.73/1.47  % (3412163)Termination reason: Instruction limit
% 7.73/1.47  % (3412163)Termination phase: Saturation
% 7.73/1.47  % (3412163)Time elapsed: 0.053 s
% 7.73/1.47  % (3412163)Peak memory usage: 15 MB
% 7.73/1.47  % (3412163)Instructions burned: 160 (million)
% 7.73/1.47  % (3412171)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1082848277:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 7.73/1.47  % (3412160)Instruction limit reached! 
% 7.73/1.47  % (3412160)------------------------------
% 7.73/1.47  % (3412160)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.73/1.47  % (3412160)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.73/1.47  % (3412160)CaDiCaL version: 2.1.3
% 7.73/1.47  % (3412160)Termination reason: Instruction limit
% 7.73/1.47  % (3412160)Termination phase: Saturation
% 7.73/1.47  % (3412160)Time elapsed: 0.062 s
% 7.73/1.47  % (3412160)Peak memory usage: 13 MB
% 7.73/1.47  % (3412160)Instructions burned: 104 (million)
% 7.73/1.47  % TRYING [1]
% 7.73/1.47  % TRYING [2]
% 7.73/1.47  % TRYING [3]
% 7.73/1.47  % (3412161)Instruction limit reached! 
% 7.73/1.47  % (3412161)------------------------------
% 7.73/1.47  % (3412161)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.73/1.47  % (3412161)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.73/1.47  % (3412161)CaDiCaL version: 2.1.3
% 7.73/1.47  % (3412161)Termination reason: Instruction limit
% 7.73/1.47  % (3412161)Termination phase: Saturation
% 7.73/1.47  % (3412161)Time elapsed: 0.070 s
% 7.73/1.47  % (3412161)Peak memory usage: 13 MB
% 7.73/1.47  % (3412161)Instructions burned: 116 (million)
% 7.73/1.47  % TRYING [4]
% 7.73/1.47  % (3412162)Instruction limit reached! 
% 7.73/1.47  % (3412162)------------------------------
% 7.73/1.47  % (3412162)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.73/1.47  % (3412162)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.73/1.47  % (3412162)CaDiCaL version: 2.1.3
% 7.73/1.47  % (3412162)Termination reason: Instruction limit
% 7.73/1.47  % (3412162)Termination phase: Saturation
% 7.73/1.47  % (3412162)Time elapsed: 0.079 s
% 7.73/1.47  % (3412162)Peak memory usage: 14 MB
% 7.73/1.47  % (3412162)Instructions burned: 132 (million)
% 7.73/1.47  % (3412173)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=606324516:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 7.73/1.47  % TRYING [5]
% 7.73/1.47  % (3412174)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=38965976:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 7.73/1.47  % (3412175)ott-21_1_sil=16000:fs=off:random_seed=1725812066:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 7.73/1.47  % TRYING [5]
% 7.73/1.47  % (3412173)Instruction limit reached! 
% 7.73/1.47  % (3412173)------------------------------
% 7.73/1.47  % (3412173)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.73/1.47  % (3412173)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.73/1.47  % (3412173)CaDiCaL version: 2.1.3
% 7.73/1.47  % (3412173)Termination reason: Instruction limit
% 7.73/1.47  % (3412173)Termination phase: Saturation
% 7.73/1.47  % (3412173)Time elapsed: 0.072 s
% 7.73/1.47  % (3412173)Peak memory usage: 13 MB
% 7.73/1.47  % (3412173)Instructions burned: 132 (million)
% 7.73/1.47  % (3412179)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1502976554:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 7.73/1.47  % TRYING [6]
% 7.73/1.47  % (3412175)Instruction limit reached! 
% 7.73/1.47  % (3412175)------------------------------
% 7.73/1.47  % (3412175)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.73/1.47  % (3412175)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.73/1.47  % (3412175)CaDiCaL version: 2.1.3
% 7.73/1.47  % (3412175)Termination reason: Instruction limit
% 7.73/1.47  % (3412175)Termination phase: Saturation
% 7.73/1.47  % (3412175)Time elapsed: 0.092 s
% 7.73/1.47  % (3412175)Peak memory usage: 13 MB
% 7.73/1.47  % (3412175)Instructions burned: 180 (million)
% 7.73/1.47  % (3412181)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1383004460:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 7.73/1.47  % (3412171)Instruction limit reached! 
% 7.73/1.47  % (3412171)------------------------------
% 7.73/1.47  % (3412171)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.73/1.47  % (3412171)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.73/1.47  % (3412171)CaDiCaL version: 2.1.3
% 7.73/1.47  % (3412171)Termination reason: Instruction limit
% 7.73/1.47  % (3412171)Termination phase: Finite model building constraint generation
% 7.73/1.47  % (3412171)Time elapsed: 0.155 s
% 7.73/1.47  % (3412171)Peak memory usage: 28 MB
% 7.73/1.47  % (3412171)Instructions burned: 720 (million)
% 7.73/1.47  % TRYING [6]
% 7.73/1.47  % TRYING [1]
% 7.73/1.47  % TRYING [2]
% 7.73/1.47  % (3412183)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1943111342:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 7.73/1.47  % TRYING [3]
% 7.73/1.47  % TRYING [4]
% 7.73/1.47  % TRYING [5]
% 7.73/1.47  % (3412179)Instruction limit reached! 
% 7.73/1.47  % (3412179)------------------------------
% 7.73/1.47  % (3412179)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.73/1.47  % (3412179)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.73/1.47  % (3412179)CaDiCaL version: 2.1.3
% 7.73/1.47  % (3412179)Termination reason: Instruction limit
% 7.73/1.47  % (3412179)Termination phase: Saturation
% 7.73/1.47  % (3412179)Time elapsed: 0.314 s
% 7.73/1.47  % (3412179)Peak memory usage: 14 MB
% 7.73/1.47  % (3412179)Instructions burned: 478 (million)
% 7.73/1.47  % TRYING [7]
% 7.73/1.47  % (3412174)Instruction limit reached! 
% 7.73/1.47  % (3412174)------------------------------
% 7.73/1.47  % (3412174)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.73/1.47  % (3412174)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.73/1.47  % (3412174)CaDiCaL version: 2.1.3
% 7.73/1.47  % (3412174)Termination reason: Instruction limit
% 7.73/1.47  % (3412174)Termination phase: Saturation
% 7.73/1.47  % (3412174)Time elapsed: 0.403 s
% 7.73/1.47  % (3412174)Peak memory usage: 21 MB
% 7.73/1.47  % (3412174)Instructions burned: 684 (million)
% 7.73/1.47  % (3412185)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=3783587197:i=889:ins=1_2994 on theBenchmark for (2994ds/889Mi)
% 7.73/1.47  % (3412186)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=2254459559:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2994 on theBenchmark for (2994ds/692Mi)
% 7.73/1.47  % (3412181)Instruction limit reached! 
% 7.73/1.47  % (3412181)------------------------------
% 7.73/1.47  % (3412181)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.73/1.47  % (3412181)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.73/1.47  % (3412181)CaDiCaL version: 2.1.3
% 7.73/1.47  % (3412181)Termination reason: Instruction limit
% 7.73/1.47  % (3412181)Termination phase: Finite model building SAT solving
% 7.73/1.47  % (3412181)Time elapsed: 0.350 s
% 7.73/1.47  % (3412181)Peak memory usage: 22 MB
% 7.73/1.47  % (3412181)Instructions burned: 867 (million)
% 7.73/1.47  % (3412183)Instruction limit reached! 
% 7.73/1.47  % (3412183)------------------------------
% 7.73/1.47  % (3412183)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.73/1.47  % (3412183)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.73/1.47  % (3412183)CaDiCaL version: 2.1.3
% 7.73/1.47  % (3412183)Termination reason: Instruction limit
% 7.73/1.47  % (3412183)Termination phase: Saturation
% 7.73/1.47  % (3412183)Time elapsed: 0.352 s
% 7.73/1.47  % (3412183)Peak memory usage: 27 MB
% 7.73/1.47  % (3412183)Instructions burned: 1182 (million)
% 7.73/1.47  % (3412189)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=3657670384:i=879:kws=inv_precedence:fsr=off_2994 on theBenchmark for (2994ds/879Mi)
% 7.73/1.47  % (3412190)fmb+10_1_sil=64000:random_seed=9827908:i=22061:nm=2:gsp=on_2993 on theBenchmark for (2993ds/22061Mi)
% 7.73/1.47  % TRYING [14]
% 7.73/1.47  % TRYING [1]
% 7.73/1.47  % TRYING [2]
% 7.73/1.47  % TRYING [3]
% 7.73/1.47  % TRYING [4]
% 7.73/1.47  % TRYING [5]
% 7.73/1.47  % (3412185)Instruction limit reached! 
% 7.73/1.47  % (3412185)------------------------------
% 7.73/1.47  % (3412185)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.73/1.47  % (3412185)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.73/1.47  % (3412185)CaDiCaL version: 2.1.3
% 7.73/1.47  % (3412185)Termination reason: Instruction limit
% 7.73/1.47  % (3412185)Termination phase: Finite model building constraint generation
% 7.73/1.47  % (3412185)Time elapsed: 0.315 s
% 7.73/1.47  % (3412185)Peak memory usage: 70 MB
% 7.73/1.47  % (3412185)Instructions burned: 890 (million)
% 7.73/1.47  % (3412193)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=4267961046:i=9515:nm=5_2991 on theBenchmark for (2991ds/9515Mi)
% 7.73/1.47  % TRYING [20]
% 7.73/1.47  % (3412186)Instruction limit reached! 
% 7.73/1.47  % (3412186)------------------------------
% 7.73/1.47  % (3412186)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.73/1.47  % (3412186)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.73/1.47  % (3412186)CaDiCaL version: 2.1.3
% 7.73/1.47  % (3412186)Termination reason: Instruction limit
% 7.73/1.47  % (3412186)Termination phase: Saturation
% 7.73/1.47  % (3412186)Time elapsed: 0.367 s
% 7.73/1.47  % (3412186)Peak memory usage: 22 MB
% 7.73/1.47  % (3412186)Instructions burned: 693 (million)
% 7.73/1.47  % (3412195)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=1738623779:fmbsr=1.7:i=920_2990 on theBenchmark for (2990ds/920Mi)
% 7.73/1.47  % TRYING [8]
% 7.73/1.47  % TRYING [6]
% 7.73/1.47  % (3412189)Instruction limit reached! 
% 7.73/1.47  % (3412189)------------------------------
% 7.73/1.47  % (3412189)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.73/1.47  % (3412189)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.73/1.47  % (3412189)CaDiCaL version: 2.1.3
% 7.73/1.47  % (3412189)Termination reason: Instruction limit
% 7.73/1.47  % (3412189)Termination phase: Saturation
% 7.73/1.47  % (3412189)Time elapsed: 0.479 s
% 7.73/1.47  % (3412189)Peak memory usage: 21 MB
% 7.73/1.47  % (3412189)Instructions burned: 880 (million)
% 7.73/1.47  % (3412197)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=751623377:i=5131_2989 on theBenchmark for (2989ds/5131Mi)
% 7.73/1.47  % TRYING [8]
% 7.73/1.47  % (3412197) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3412152-3412197"...
% 7.73/1.47  % (3412197)...printing done.
% 7.73/1.47  % (3412197)Refutation found. Thanks to Tanya!
% 7.73/1.47  % SZS status Theorem for theBenchmark
% 7.73/1.47  % SZS output start Proof for theBenchmark
% See solution above
% 7.73/1.47  % (3412197)------------------------------
% 7.73/1.47  % (3412197)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.73/1.47  % (3412197)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.73/1.47  % (3412197)CaDiCaL version: 2.1.3
% 7.73/1.47  % (3412197)Termination reason: Refutation
% 7.73/1.47  % (3412197)Time elapsed: 0.123 s
% 7.73/1.47  % (3412197)Peak memory usage: 15 MB
% 7.73/1.47  % (3412197)Instructions burned: 228 (million)
% 7.73/1.47  % (3412152)Success in time 1.26 s
% 7.73/1.47  % Vampire exiting
%------------------------------------------------------------------------------