TSTP Solution File: SWC355+1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SWC355+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n029.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue May 21 04:38:24 EDT 2024

% Result   : Theorem 0.55s 0.77s
% Output   : Refutation 0.55s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :   19
% Syntax   : Number of formulae    :   68 (  10 unt;   0 def)
%            Number of atoms       :  323 (  65 equ)
%            Maximal formula atoms :   24 (   4 avg)
%            Number of connectives :  371 ( 116   ~; 104   |; 121   &)
%                                         (   6 <=>;  24  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   6 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   10 (   8 usr;   5 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   8 con; 0-2 aty)
%            Number of variables   :  107 (  60   !;  47   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f841,plain,
    $false,
    inference(avatar_sat_refutation,[],[f234,f239,f244,f248,f837]) ).

fof(f837,plain,
    ( spl13_1
    | ~ spl13_3
    | ~ spl13_4 ),
    inference(avatar_contradiction_clause,[],[f836]) ).

fof(f836,plain,
    ( $false
    | spl13_1
    | ~ spl13_3
    | ~ spl13_4 ),
    inference(subsumption_resolution,[],[f835,f229]) ).

fof(f229,plain,
    ( ~ segmentP(sK3,sK2)
    | spl13_1 ),
    inference(avatar_component_clause,[],[f227]) ).

fof(f227,plain,
    ( spl13_1
  <=> segmentP(sK3,sK2) ),
    introduced(avatar_definition,[new_symbols(naming,[spl13_1])]) ).

fof(f835,plain,
    ( segmentP(sK3,sK2)
    | ~ spl13_3
    | ~ spl13_4 ),
    inference(forward_demodulation,[],[f834,f238]) ).

fof(f238,plain,
    ( sK3 = sF12
    | ~ spl13_3 ),
    inference(avatar_component_clause,[],[f236]) ).

fof(f236,plain,
    ( spl13_3
  <=> sK3 = sF12 ),
    introduced(avatar_definition,[new_symbols(naming,[spl13_3])]) ).

fof(f834,plain,
    ( segmentP(sF12,sK2)
    | ~ spl13_4 ),
    inference(subsumption_resolution,[],[f833,f154]) ).

fof(f154,plain,
    ssList(sK2),
    inference(cnf_transformation,[],[f135]) ).

fof(f135,plain,
    ( ( ( ~ neq(sK3,nil)
        & neq(sK1,nil) )
      | ( ~ segmentP(sK1,sK0)
        & sK3 = app(sK2,cons(sK4,nil))
        & ssItem(sK4)
        & neq(sK1,nil) ) )
    & sK0 = sK2
    & sK1 = sK3
    & ssList(sK3)
    & ssList(sK2)
    & ssList(sK1)
    & ssList(sK0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f99,f134,f133,f132,f131,f130]) ).

fof(f130,plain,
    ( ? [X0] :
        ( ? [X1] :
            ( ? [X2] :
                ( ? [X3] :
                    ( ( ( ~ neq(X3,nil)
                        & neq(X1,nil) )
                      | ( ~ segmentP(X1,X0)
                        & ? [X4] :
                            ( app(X2,cons(X4,nil)) = X3
                            & ssItem(X4) )
                        & neq(X1,nil) ) )
                    & X0 = X2
                    & X1 = X3
                    & ssList(X3) )
                & ssList(X2) )
            & ssList(X1) )
        & ssList(X0) )
   => ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ( ( ~ neq(X3,nil)
                      & neq(X1,nil) )
                    | ( ~ segmentP(X1,sK0)
                      & ? [X4] :
                          ( app(X2,cons(X4,nil)) = X3
                          & ssItem(X4) )
                      & neq(X1,nil) ) )
                  & sK0 = X2
                  & X1 = X3
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(sK0) ) ),
    introduced(choice_axiom,[]) ).

fof(f131,plain,
    ( ? [X1] :
        ( ? [X2] :
            ( ? [X3] :
                ( ( ( ~ neq(X3,nil)
                    & neq(X1,nil) )
                  | ( ~ segmentP(X1,sK0)
                    & ? [X4] :
                        ( app(X2,cons(X4,nil)) = X3
                        & ssItem(X4) )
                    & neq(X1,nil) ) )
                & sK0 = X2
                & X1 = X3
                & ssList(X3) )
            & ssList(X2) )
        & ssList(X1) )
   => ( ? [X2] :
          ( ? [X3] :
              ( ( ( ~ neq(X3,nil)
                  & neq(sK1,nil) )
                | ( ~ segmentP(sK1,sK0)
                  & ? [X4] :
                      ( app(X2,cons(X4,nil)) = X3
                      & ssItem(X4) )
                  & neq(sK1,nil) ) )
              & sK0 = X2
              & sK1 = X3
              & ssList(X3) )
          & ssList(X2) )
      & ssList(sK1) ) ),
    introduced(choice_axiom,[]) ).

fof(f132,plain,
    ( ? [X2] :
        ( ? [X3] :
            ( ( ( ~ neq(X3,nil)
                & neq(sK1,nil) )
              | ( ~ segmentP(sK1,sK0)
                & ? [X4] :
                    ( app(X2,cons(X4,nil)) = X3
                    & ssItem(X4) )
                & neq(sK1,nil) ) )
            & sK0 = X2
            & sK1 = X3
            & ssList(X3) )
        & ssList(X2) )
   => ( ? [X3] :
          ( ( ( ~ neq(X3,nil)
              & neq(sK1,nil) )
            | ( ~ segmentP(sK1,sK0)
              & ? [X4] :
                  ( app(sK2,cons(X4,nil)) = X3
                  & ssItem(X4) )
              & neq(sK1,nil) ) )
          & sK0 = sK2
          & sK1 = X3
          & ssList(X3) )
      & ssList(sK2) ) ),
    introduced(choice_axiom,[]) ).

fof(f133,plain,
    ( ? [X3] :
        ( ( ( ~ neq(X3,nil)
            & neq(sK1,nil) )
          | ( ~ segmentP(sK1,sK0)
            & ? [X4] :
                ( app(sK2,cons(X4,nil)) = X3
                & ssItem(X4) )
            & neq(sK1,nil) ) )
        & sK0 = sK2
        & sK1 = X3
        & ssList(X3) )
   => ( ( ( ~ neq(sK3,nil)
          & neq(sK1,nil) )
        | ( ~ segmentP(sK1,sK0)
          & ? [X4] :
              ( app(sK2,cons(X4,nil)) = sK3
              & ssItem(X4) )
          & neq(sK1,nil) ) )
      & sK0 = sK2
      & sK1 = sK3
      & ssList(sK3) ) ),
    introduced(choice_axiom,[]) ).

fof(f134,plain,
    ( ? [X4] :
        ( app(sK2,cons(X4,nil)) = sK3
        & ssItem(X4) )
   => ( sK3 = app(sK2,cons(sK4,nil))
      & ssItem(sK4) ) ),
    introduced(choice_axiom,[]) ).

fof(f99,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ( ( ~ neq(X3,nil)
                      & neq(X1,nil) )
                    | ( ~ segmentP(X1,X0)
                      & ? [X4] :
                          ( app(X2,cons(X4,nil)) = X3
                          & ssItem(X4) )
                      & neq(X1,nil) ) )
                  & X0 = X2
                  & X1 = X3
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(flattening,[],[f98]) ).

fof(f98,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ( ( ~ neq(X3,nil)
                      & neq(X1,nil) )
                    | ( ~ segmentP(X1,X0)
                      & ? [X4] :
                          ( app(X2,cons(X4,nil)) = X3
                          & ssItem(X4) )
                      & neq(X1,nil) ) )
                  & X0 = X2
                  & X1 = X3
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(ennf_transformation,[],[f97]) ).

fof(f97,negated_conjecture,
    ~ ! [X0] :
        ( ssList(X0)
       => ! [X1] :
            ( ssList(X1)
           => ! [X2] :
                ( ssList(X2)
               => ! [X3] :
                    ( ssList(X3)
                   => ( ( ( neq(X3,nil)
                          | ~ neq(X1,nil) )
                        & ( segmentP(X1,X0)
                          | ! [X4] :
                              ( ssItem(X4)
                             => app(X2,cons(X4,nil)) != X3 )
                          | ~ neq(X1,nil) ) )
                      | X0 != X2
                      | X1 != X3 ) ) ) ) ),
    inference(negated_conjecture,[],[f96]) ).

fof(f96,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ssList(X3)
                 => ( ( ( neq(X3,nil)
                        | ~ neq(X1,nil) )
                      & ( segmentP(X1,X0)
                        | ! [X4] :
                            ( ssItem(X4)
                           => app(X2,cons(X4,nil)) != X3 )
                        | ~ neq(X1,nil) ) )
                    | X0 != X2
                    | X1 != X3 ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

fof(f833,plain,
    ( segmentP(sF12,sK2)
    | ~ ssList(sK2)
    | ~ spl13_4 ),
    inference(subsumption_resolution,[],[f811,f252]) ).

fof(f252,plain,
    ( ssList(sF11)
    | ~ spl13_4 ),
    inference(subsumption_resolution,[],[f251,f192]) ).

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

fof(f17,axiom,
    ssList(nil),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).

fof(f251,plain,
    ( ssList(sF11)
    | ~ ssList(nil)
    | ~ spl13_4 ),
    inference(subsumption_resolution,[],[f250,f243]) ).

fof(f243,plain,
    ( ssItem(sK4)
    | ~ spl13_4 ),
    inference(avatar_component_clause,[],[f241]) ).

fof(f241,plain,
    ( spl13_4
  <=> ssItem(sK4) ),
    introduced(avatar_definition,[new_symbols(naming,[spl13_4])]) ).

fof(f250,plain,
    ( ssList(sF11)
    | ~ ssItem(sK4)
    | ~ ssList(nil) ),
    inference(superposition,[],[f186,f218]) ).

fof(f218,plain,
    cons(sK4,nil) = sF11,
    introduced(function_definition,[new_symbols(definition,[sF11])]) ).

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

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

fof(f16,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssItem(X1)
         => ssList(cons(X1,X0)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax16) ).

fof(f811,plain,
    ( segmentP(sF12,sK2)
    | ~ ssList(sF11)
    | ~ ssList(sK2) ),
    inference(superposition,[],[f695,f219]) ).

fof(f219,plain,
    app(sK2,sF11) = sF12,
    introduced(function_definition,[new_symbols(definition,[sF12])]) ).

fof(f695,plain,
    ! [X0,X1] :
      ( segmentP(app(X0,X1),X0)
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(subsumption_resolution,[],[f694,f187]) ).

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

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

fof(f26,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ssList(app(X0,X1)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax26) ).

fof(f694,plain,
    ! [X0,X1] :
      ( segmentP(app(X0,X1),X0)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ~ ssList(app(X0,X1)) ),
    inference(subsumption_resolution,[],[f683,f192]) ).

fof(f683,plain,
    ! [X0,X1] :
      ( segmentP(app(X0,X1),X0)
      | ~ ssList(X1)
      | ~ ssList(nil)
      | ~ ssList(X0)
      | ~ ssList(app(X0,X1)) ),
    inference(duplicate_literal_removal,[],[f671]) ).

fof(f671,plain,
    ! [X0,X1] :
      ( segmentP(app(X0,X1),X0)
      | ~ ssList(X1)
      | ~ ssList(nil)
      | ~ ssList(X0)
      | ~ ssList(app(X0,X1))
      | ~ ssList(X0) ),
    inference(superposition,[],[f217,f174]) ).

fof(f174,plain,
    ! [X0] :
      ( app(nil,X0) = X0
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f108]) ).

fof(f108,plain,
    ! [X0] :
      ( app(nil,X0) = X0
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f28]) ).

fof(f28,axiom,
    ! [X0] :
      ( ssList(X0)
     => app(nil,X0) = X0 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax28) ).

fof(f217,plain,
    ! [X2,X3,X1] :
      ( segmentP(app(app(X2,X1),X3),X1)
      | ~ ssList(X3)
      | ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssList(app(app(X2,X1),X3)) ),
    inference(equality_resolution,[],[f203]) ).

fof(f203,plain,
    ! [X2,X3,X0,X1] :
      ( segmentP(X0,X1)
      | app(app(X2,X1),X3) != X0
      | ~ ssList(X3)
      | ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f151]) ).

fof(f151,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( ( segmentP(X0,X1)
              | ! [X2] :
                  ( ! [X3] :
                      ( app(app(X2,X1),X3) != X0
                      | ~ ssList(X3) )
                  | ~ ssList(X2) ) )
            & ( ( app(app(sK9(X0,X1),X1),sK10(X0,X1)) = X0
                & ssList(sK10(X0,X1))
                & ssList(sK9(X0,X1)) )
              | ~ segmentP(X0,X1) ) )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK9,sK10])],[f148,f150,f149]) ).

fof(f149,plain,
    ! [X0,X1] :
      ( ? [X4] :
          ( ? [X5] :
              ( app(app(X4,X1),X5) = X0
              & ssList(X5) )
          & ssList(X4) )
     => ( ? [X5] :
            ( app(app(sK9(X0,X1),X1),X5) = X0
            & ssList(X5) )
        & ssList(sK9(X0,X1)) ) ),
    introduced(choice_axiom,[]) ).

fof(f150,plain,
    ! [X0,X1] :
      ( ? [X5] :
          ( app(app(sK9(X0,X1),X1),X5) = X0
          & ssList(X5) )
     => ( app(app(sK9(X0,X1),X1),sK10(X0,X1)) = X0
        & ssList(sK10(X0,X1)) ) ),
    introduced(choice_axiom,[]) ).

fof(f148,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( ( segmentP(X0,X1)
              | ! [X2] :
                  ( ! [X3] :
                      ( app(app(X2,X1),X3) != X0
                      | ~ ssList(X3) )
                  | ~ ssList(X2) ) )
            & ( ? [X4] :
                  ( ? [X5] :
                      ( app(app(X4,X1),X5) = X0
                      & ssList(X5) )
                  & ssList(X4) )
              | ~ segmentP(X0,X1) ) )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(rectify,[],[f147]) ).

fof(f147,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( ( segmentP(X0,X1)
              | ! [X2] :
                  ( ! [X3] :
                      ( app(app(X2,X1),X3) != X0
                      | ~ ssList(X3) )
                  | ~ ssList(X2) ) )
            & ( ? [X2] :
                  ( ? [X3] :
                      ( app(app(X2,X1),X3) = X0
                      & ssList(X3) )
                  & ssList(X2) )
              | ~ segmentP(X0,X1) ) )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(nnf_transformation,[],[f129]) ).

fof(f129,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( segmentP(X0,X1)
          <=> ? [X2] :
                ( ? [X3] :
                    ( app(app(X2,X1),X3) = X0
                    & ssList(X3) )
                & ssList(X2) ) )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f7]) ).

fof(f7,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ( segmentP(X0,X1)
          <=> ? [X2] :
                ( ? [X3] :
                    ( app(app(X2,X1),X3) = X0
                    & ssList(X3) )
                & ssList(X2) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax7) ).

fof(f248,plain,
    spl13_2,
    inference(avatar_split_clause,[],[f225,f231]) ).

fof(f231,plain,
    ( spl13_2
  <=> neq(sK3,nil) ),
    introduced(avatar_definition,[new_symbols(naming,[spl13_2])]) ).

fof(f225,plain,
    neq(sK3,nil),
    inference(duplicate_literal_removal,[],[f209]) ).

fof(f209,plain,
    ( neq(sK3,nil)
    | neq(sK3,nil) ),
    inference(definition_unfolding,[],[f158,f156,f156]) ).

fof(f156,plain,
    sK1 = sK3,
    inference(cnf_transformation,[],[f135]) ).

fof(f158,plain,
    ( neq(sK1,nil)
    | neq(sK1,nil) ),
    inference(cnf_transformation,[],[f135]) ).

fof(f244,plain,
    ( spl13_4
    | ~ spl13_2 ),
    inference(avatar_split_clause,[],[f163,f231,f241]) ).

fof(f163,plain,
    ( ~ neq(sK3,nil)
    | ssItem(sK4) ),
    inference(cnf_transformation,[],[f135]) ).

fof(f239,plain,
    ( spl13_3
    | ~ spl13_2 ),
    inference(avatar_split_clause,[],[f220,f231,f236]) ).

fof(f220,plain,
    ( ~ neq(sK3,nil)
    | sK3 = sF12 ),
    inference(definition_folding,[],[f164,f219,f218]) ).

fof(f164,plain,
    ( ~ neq(sK3,nil)
    | sK3 = app(sK2,cons(sK4,nil)) ),
    inference(cnf_transformation,[],[f135]) ).

fof(f234,plain,
    ( ~ spl13_1
    | ~ spl13_2 ),
    inference(avatar_split_clause,[],[f204,f231,f227]) ).

fof(f204,plain,
    ( ~ neq(sK3,nil)
    | ~ segmentP(sK3,sK2) ),
    inference(definition_unfolding,[],[f165,f156,f157]) ).

fof(f157,plain,
    sK0 = sK2,
    inference(cnf_transformation,[],[f135]) ).

fof(f165,plain,
    ( ~ neq(sK3,nil)
    | ~ segmentP(sK1,sK0) ),
    inference(cnf_transformation,[],[f135]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08  % Problem    : SWC355+1 : TPTP v8.2.0. Released v2.4.0.
% 0.00/0.09  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.09/0.28  % Computer : n029.cluster.edu
% 0.09/0.28  % Model    : x86_64 x86_64
% 0.09/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28  % Memory   : 8042.1875MB
% 0.09/0.28  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28  % CPULimit   : 300
% 0.09/0.28  % WCLimit    : 300
% 0.09/0.28  % DateTime   : Sun May 19 03:07:38 EDT 2024
% 0.09/0.28  % CPUTime    : 
% 0.09/0.28  This is a FOF_THM_RFO_SEQ problem
% 0.13/0.28  Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.55/0.71  % (11818)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 theBenchmark for (2995ds/34Mi)
% 0.55/0.71  % (11819)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 theBenchmark for (2995ds/51Mi)
% 0.55/0.72  % (11822)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 theBenchmark for (2995ds/34Mi)
% 0.55/0.72  % (11824)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 theBenchmark for (2995ds/83Mi)
% 0.55/0.72  % (11825)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2995ds/56Mi)
% 0.55/0.72  % (11820)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.55/0.73  % (11821)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.55/0.73  % (11823)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.55/0.73  % (11822)Instruction limit reached!
% 0.55/0.73  % (11822)------------------------------
% 0.55/0.73  % (11822)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.73  % (11822)Termination reason: Unknown
% 0.55/0.73  % (11822)Termination phase: Saturation
% 0.55/0.73  
% 0.55/0.73  % (11822)Memory used [KB]: 2023
% 0.55/0.73  % (11822)Time elapsed: 0.020 s
% 0.55/0.73  % (11822)Instructions burned: 35 (million)
% 0.55/0.73  % (11822)------------------------------
% 0.55/0.73  % (11822)------------------------------
% 0.55/0.74  % (11826)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 theBenchmark for (2995ds/55Mi)
% 0.55/0.74  % (11825)Instruction limit reached!
% 0.55/0.74  % (11825)------------------------------
% 0.55/0.74  % (11825)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.74  % (11825)Termination reason: Unknown
% 0.55/0.74  % (11825)Termination phase: Saturation
% 0.55/0.74  
% 0.55/0.74  % (11825)Memory used [KB]: 1606
% 0.55/0.74  % (11825)Time elapsed: 0.026 s
% 0.55/0.74  % (11825)Instructions burned: 56 (million)
% 0.55/0.74  % (11825)------------------------------
% 0.55/0.74  % (11825)------------------------------
% 0.55/0.74  % (11819)Instruction limit reached!
% 0.55/0.74  % (11819)------------------------------
% 0.55/0.74  % (11819)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.74  % (11819)Termination reason: Unknown
% 0.55/0.74  % (11819)Termination phase: Saturation
% 0.55/0.74  
% 0.55/0.74  % (11819)Memory used [KB]: 1971
% 0.55/0.74  % (11819)Time elapsed: 0.028 s
% 0.55/0.74  % (11819)Instructions burned: 51 (million)
% 0.55/0.74  % (11819)------------------------------
% 0.55/0.74  % (11819)------------------------------
% 0.55/0.74  % (11827)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 theBenchmark for (2995ds/50Mi)
% 0.55/0.75  % (11818)Instruction limit reached!
% 0.55/0.75  % (11818)------------------------------
% 0.55/0.75  % (11818)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.75  % (11818)Termination reason: Unknown
% 0.55/0.75  % (11818)Termination phase: Saturation
% 0.55/0.75  
% 0.55/0.75  % (11818)Memory used [KB]: 1490
% 0.55/0.75  % (11818)Time elapsed: 0.021 s
% 0.55/0.75  % (11818)Instructions burned: 34 (million)
% 0.55/0.75  % (11818)------------------------------
% 0.55/0.75  % (11818)------------------------------
% 0.55/0.75  % (11828)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on theBenchmark for (2995ds/208Mi)
% 0.55/0.75  % (11821)Instruction limit reached!
% 0.55/0.75  % (11821)------------------------------
% 0.55/0.75  % (11821)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.75  % (11821)Termination reason: Unknown
% 0.55/0.75  % (11821)Termination phase: Saturation
% 0.55/0.75  
% 0.55/0.75  % (11821)Memory used [KB]: 1682
% 0.55/0.75  % (11821)Time elapsed: 0.020 s
% 0.55/0.75  % (11821)Instructions burned: 34 (million)
% 0.55/0.75  % (11821)------------------------------
% 0.55/0.75  % (11821)------------------------------
% 0.55/0.75  % (11830)lrs-1010_1:1_to=lpo:sil=2000:sp=reverse_arity:sos=on:urr=ec_only:i=518:sd=2:bd=off:ss=axioms:sgt=16_0 on theBenchmark for (2995ds/518Mi)
% 0.55/0.75  % (11829)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 theBenchmark for (2995ds/52Mi)
% 0.55/0.75  % (11823)Instruction limit reached!
% 0.55/0.75  % (11823)------------------------------
% 0.55/0.75  % (11823)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.75  % (11823)Termination reason: Unknown
% 0.55/0.75  % (11823)Termination phase: Saturation
% 0.55/0.75  
% 0.55/0.75  % (11823)Memory used [KB]: 1616
% 0.55/0.75  % (11823)Time elapsed: 0.026 s
% 0.55/0.75  % (11823)Instructions burned: 45 (million)
% 0.55/0.75  % (11823)------------------------------
% 0.55/0.75  % (11823)------------------------------
% 0.55/0.76  % (11831)lrs+1011_87677:1048576_sil=8000:sos=on:spb=non_intro:nwc=10.0:kmz=on:i=42:ep=RS:nm=0:ins=1:uhcvi=on:rawr=on:fde=unused:afp=2000:afq=1.444:plsq=on:nicw=on_0 on theBenchmark for (2995ds/42Mi)
% 0.55/0.76  % (11820)Instruction limit reached!
% 0.55/0.76  % (11820)------------------------------
% 0.55/0.76  % (11820)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.76  % (11820)Termination reason: Unknown
% 0.55/0.76  % (11820)Termination phase: Saturation
% 0.55/0.76  
% 0.55/0.76  % (11820)Memory used [KB]: 2039
% 0.55/0.76  % (11820)Time elapsed: 0.046 s
% 0.55/0.76  % (11820)Instructions burned: 78 (million)
% 0.55/0.76  % (11820)------------------------------
% 0.55/0.76  % (11820)------------------------------
% 0.55/0.76  % (11828)First to succeed.
% 0.55/0.76  % (11826)Instruction limit reached!
% 0.55/0.76  % (11826)------------------------------
% 0.55/0.76  % (11826)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.76  % (11826)Termination reason: Unknown
% 0.55/0.76  % (11826)Termination phase: Saturation
% 0.55/0.76  
% 0.55/0.76  % (11826)Memory used [KB]: 2133
% 0.55/0.76  % (11826)Time elapsed: 0.029 s
% 0.55/0.76  % (11826)Instructions burned: 56 (million)
% 0.55/0.76  % (11826)------------------------------
% 0.55/0.76  % (11826)------------------------------
% 0.55/0.76  % (11824)Instruction limit reached!
% 0.55/0.76  % (11824)------------------------------
% 0.55/0.76  % (11824)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.76  % (11824)Termination reason: Unknown
% 0.55/0.76  % (11824)Termination phase: Saturation
% 0.55/0.76  
% 0.55/0.76  % (11824)Memory used [KB]: 1904
% 0.55/0.76  % (11824)Time elapsed: 0.039 s
% 0.55/0.76  % (11824)Instructions burned: 85 (million)
% 0.55/0.76  % (11824)------------------------------
% 0.55/0.76  % (11824)------------------------------
% 0.55/0.77  % (11828)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-11817"
% 0.55/0.77  % (11832)dis+1011_1258907:1048576_bsr=unit_only:to=lpo:drc=off:sil=2000:tgt=full:fde=none:sp=frequency:spb=goal:rnwc=on:nwc=6.70083:sac=on:newcnf=on:st=2:i=243:bs=unit_only:sd=3:afp=300:awrs=decay:awrsf=218:nm=16:ins=3:afq=3.76821:afr=on:ss=axioms:sgt=5:rawr=on:add=off:bsd=on_0 on theBenchmark for (2995ds/243Mi)
% 0.55/0.77  % (11827)Instruction limit reached!
% 0.55/0.77  % (11827)------------------------------
% 0.55/0.77  % (11827)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.77  % (11827)Termination reason: Unknown
% 0.55/0.77  % (11827)Termination phase: Saturation
% 0.55/0.77  
% 0.55/0.77  % (11827)Memory used [KB]: 1843
% 0.55/0.77  % (11827)Time elapsed: 0.024 s
% 0.55/0.77  % (11827)Instructions burned: 51 (million)
% 0.55/0.77  % (11827)------------------------------
% 0.55/0.77  % (11827)------------------------------
% 0.55/0.77  % (11828)Refutation found. Thanks to Tanya!
% 0.55/0.77  % SZS status Theorem for theBenchmark
% 0.55/0.77  % SZS output start Proof for theBenchmark
% See solution above
% 0.55/0.77  % (11828)------------------------------
% 0.55/0.77  % (11828)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.77  % (11828)Termination reason: Refutation
% 0.55/0.77  
% 0.55/0.77  % (11828)Memory used [KB]: 1361
% 0.55/0.77  % (11828)Time elapsed: 0.020 s
% 0.55/0.77  % (11828)Instructions burned: 34 (million)
% 0.55/0.77  % (11817)Success in time 0.463 s
% 0.55/0.77  % Vampire---4.8 exiting
%------------------------------------------------------------------------------