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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SWC198+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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n020.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:37:02 EDT 2024

% Result   : Theorem 0.57s 0.75s
% Output   : Refutation 0.57s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   19
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   59 (   6 unt;   0 def)
%            Number of atoms       :  424 ( 133 equ)
%            Maximal formula atoms :   38 (   7 avg)
%            Number of connectives :  539 ( 174   ~; 160   |; 170   &)
%                                         (   5 <=>;  30  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (   7 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    9 (   7 usr;   4 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   8 con; 0-2 aty)
%            Number of variables   :  134 (  76   !;  58   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f296,plain,
    $false,
    inference(avatar_sat_refutation,[],[f232,f237,f256,f295]) ).

fof(f295,plain,
    ( ~ spl12_4
    | ~ spl12_5 ),
    inference(avatar_contradiction_clause,[],[f294]) ).

fof(f294,plain,
    ( $false
    | ~ spl12_4
    | ~ spl12_5 ),
    inference(subsumption_resolution,[],[f293,f236]) ).

fof(f236,plain,
    ( ssItem(sK4)
    | ~ spl12_5 ),
    inference(avatar_component_clause,[],[f234]) ).

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

fof(f293,plain,
    ( ~ ssItem(sK4)
    | ~ spl12_4
    | ~ spl12_5 ),
    inference(equality_resolution,[],[f280]) ).

fof(f280,plain,
    ( ! [X0] :
        ( sK4 != X0
        | ~ ssItem(X0) )
    | ~ spl12_4
    | ~ spl12_5 ),
    inference(duplicate_literal_removal,[],[f277]) ).

fof(f277,plain,
    ( ! [X0] :
        ( sK4 != X0
        | ~ ssItem(X0)
        | ~ ssItem(X0) )
    | ~ spl12_4
    | ~ spl12_5 ),
    inference(superposition,[],[f160,f269]) ).

fof(f269,plain,
    ( ! [X0] :
        ( sK4 = sK5(X0)
        | ~ ssItem(X0) )
    | ~ spl12_4
    | ~ spl12_5 ),
    inference(subsumption_resolution,[],[f268,f158]) ).

fof(f158,plain,
    ! [X6] :
      ( ssItem(sK5(X6))
      | ~ ssItem(X6) ),
    inference(cnf_transformation,[],[f134]) ).

fof(f134,plain,
    ( ( ( nil = sK2
        & nil = sK3 )
      | ( ! [X5] :
            ( ~ leq(sK4,X5)
            | ~ memberP(sK3,X5)
            | sK4 = X5
            | ~ ssItem(X5) )
        & memberP(sK3,sK4)
        & sK2 = cons(sK4,nil)
        & ssItem(sK4) ) )
    & ! [X6] :
        ( ( sK5(X6) != X6
          & memberP(sK0,sK5(X6))
          & ssItem(sK5(X6)) )
        | ~ ssItem(X6) )
    & sK0 = sK2
    & sK1 = sK3
    & ssList(sK3)
    & ssList(sK2)
    & ssList(sK1)
    & ssList(sK0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f100,f133,f132,f131,f130,f129,f128]) ).

fof(f128,plain,
    ( ? [X0] :
        ( ? [X1] :
            ( ? [X2] :
                ( ? [X3] :
                    ( ( ( nil = X2
                        & nil = X3 )
                      | ? [X4] :
                          ( ! [X5] :
                              ( ~ leq(X4,X5)
                              | ~ memberP(X3,X5)
                              | X4 = X5
                              | ~ ssItem(X5) )
                          & memberP(X3,X4)
                          & cons(X4,nil) = X2
                          & ssItem(X4) ) )
                    & ! [X6] :
                        ( ? [X7] :
                            ( X6 != X7
                            & memberP(X0,X7)
                            & ssItem(X7) )
                        | ~ ssItem(X6) )
                    & X0 = X2
                    & X1 = X3
                    & ssList(X3) )
                & ssList(X2) )
            & ssList(X1) )
        & ssList(X0) )
   => ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ( ( nil = X2
                      & nil = X3 )
                    | ? [X4] :
                        ( ! [X5] :
                            ( ~ leq(X4,X5)
                            | ~ memberP(X3,X5)
                            | X4 = X5
                            | ~ ssItem(X5) )
                        & memberP(X3,X4)
                        & cons(X4,nil) = X2
                        & ssItem(X4) ) )
                  & ! [X6] :
                      ( ? [X7] :
                          ( X6 != X7
                          & memberP(sK0,X7)
                          & ssItem(X7) )
                      | ~ ssItem(X6) )
                  & sK0 = X2
                  & X1 = X3
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(sK0) ) ),
    introduced(choice_axiom,[]) ).

fof(f129,plain,
    ( ? [X1] :
        ( ? [X2] :
            ( ? [X3] :
                ( ( ( nil = X2
                    & nil = X3 )
                  | ? [X4] :
                      ( ! [X5] :
                          ( ~ leq(X4,X5)
                          | ~ memberP(X3,X5)
                          | X4 = X5
                          | ~ ssItem(X5) )
                      & memberP(X3,X4)
                      & cons(X4,nil) = X2
                      & ssItem(X4) ) )
                & ! [X6] :
                    ( ? [X7] :
                        ( X6 != X7
                        & memberP(sK0,X7)
                        & ssItem(X7) )
                    | ~ ssItem(X6) )
                & sK0 = X2
                & X1 = X3
                & ssList(X3) )
            & ssList(X2) )
        & ssList(X1) )
   => ( ? [X2] :
          ( ? [X3] :
              ( ( ( nil = X2
                  & nil = X3 )
                | ? [X4] :
                    ( ! [X5] :
                        ( ~ leq(X4,X5)
                        | ~ memberP(X3,X5)
                        | X4 = X5
                        | ~ ssItem(X5) )
                    & memberP(X3,X4)
                    & cons(X4,nil) = X2
                    & ssItem(X4) ) )
              & ! [X6] :
                  ( ? [X7] :
                      ( X6 != X7
                      & memberP(sK0,X7)
                      & ssItem(X7) )
                  | ~ ssItem(X6) )
              & sK0 = X2
              & sK1 = X3
              & ssList(X3) )
          & ssList(X2) )
      & ssList(sK1) ) ),
    introduced(choice_axiom,[]) ).

fof(f130,plain,
    ( ? [X2] :
        ( ? [X3] :
            ( ( ( nil = X2
                & nil = X3 )
              | ? [X4] :
                  ( ! [X5] :
                      ( ~ leq(X4,X5)
                      | ~ memberP(X3,X5)
                      | X4 = X5
                      | ~ ssItem(X5) )
                  & memberP(X3,X4)
                  & cons(X4,nil) = X2
                  & ssItem(X4) ) )
            & ! [X6] :
                ( ? [X7] :
                    ( X6 != X7
                    & memberP(sK0,X7)
                    & ssItem(X7) )
                | ~ ssItem(X6) )
            & sK0 = X2
            & sK1 = X3
            & ssList(X3) )
        & ssList(X2) )
   => ( ? [X3] :
          ( ( ( nil = sK2
              & nil = X3 )
            | ? [X4] :
                ( ! [X5] :
                    ( ~ leq(X4,X5)
                    | ~ memberP(X3,X5)
                    | X4 = X5
                    | ~ ssItem(X5) )
                & memberP(X3,X4)
                & cons(X4,nil) = sK2
                & ssItem(X4) ) )
          & ! [X6] :
              ( ? [X7] :
                  ( X6 != X7
                  & memberP(sK0,X7)
                  & ssItem(X7) )
              | ~ ssItem(X6) )
          & sK0 = sK2
          & sK1 = X3
          & ssList(X3) )
      & ssList(sK2) ) ),
    introduced(choice_axiom,[]) ).

fof(f131,plain,
    ( ? [X3] :
        ( ( ( nil = sK2
            & nil = X3 )
          | ? [X4] :
              ( ! [X5] :
                  ( ~ leq(X4,X5)
                  | ~ memberP(X3,X5)
                  | X4 = X5
                  | ~ ssItem(X5) )
              & memberP(X3,X4)
              & cons(X4,nil) = sK2
              & ssItem(X4) ) )
        & ! [X6] :
            ( ? [X7] :
                ( X6 != X7
                & memberP(sK0,X7)
                & ssItem(X7) )
            | ~ ssItem(X6) )
        & sK0 = sK2
        & sK1 = X3
        & ssList(X3) )
   => ( ( ( nil = sK2
          & nil = sK3 )
        | ? [X4] :
            ( ! [X5] :
                ( ~ leq(X4,X5)
                | ~ memberP(sK3,X5)
                | X4 = X5
                | ~ ssItem(X5) )
            & memberP(sK3,X4)
            & cons(X4,nil) = sK2
            & ssItem(X4) ) )
      & ! [X6] :
          ( ? [X7] :
              ( X6 != X7
              & memberP(sK0,X7)
              & ssItem(X7) )
          | ~ ssItem(X6) )
      & sK0 = sK2
      & sK1 = sK3
      & ssList(sK3) ) ),
    introduced(choice_axiom,[]) ).

fof(f132,plain,
    ( ? [X4] :
        ( ! [X5] :
            ( ~ leq(X4,X5)
            | ~ memberP(sK3,X5)
            | X4 = X5
            | ~ ssItem(X5) )
        & memberP(sK3,X4)
        & cons(X4,nil) = sK2
        & ssItem(X4) )
   => ( ! [X5] :
          ( ~ leq(sK4,X5)
          | ~ memberP(sK3,X5)
          | sK4 = X5
          | ~ ssItem(X5) )
      & memberP(sK3,sK4)
      & sK2 = cons(sK4,nil)
      & ssItem(sK4) ) ),
    introduced(choice_axiom,[]) ).

fof(f133,plain,
    ! [X6] :
      ( ? [X7] :
          ( X6 != X7
          & memberP(sK0,X7)
          & ssItem(X7) )
     => ( sK5(X6) != X6
        & memberP(sK0,sK5(X6))
        & ssItem(sK5(X6)) ) ),
    introduced(choice_axiom,[]) ).

fof(f100,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ( ( nil = X2
                      & nil = X3 )
                    | ? [X4] :
                        ( ! [X5] :
                            ( ~ leq(X4,X5)
                            | ~ memberP(X3,X5)
                            | X4 = X5
                            | ~ ssItem(X5) )
                        & memberP(X3,X4)
                        & cons(X4,nil) = X2
                        & ssItem(X4) ) )
                  & ! [X6] :
                      ( ? [X7] :
                          ( X6 != X7
                          & memberP(X0,X7)
                          & ssItem(X7) )
                      | ~ ssItem(X6) )
                  & X0 = X2
                  & X1 = X3
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(flattening,[],[f99]) ).

fof(f99,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ( ( nil = X2
                      & nil = X3 )
                    | ? [X4] :
                        ( ! [X5] :
                            ( ~ leq(X4,X5)
                            | ~ memberP(X3,X5)
                            | X4 = X5
                            | ~ ssItem(X5) )
                        & memberP(X3,X4)
                        & cons(X4,nil) = X2
                        & ssItem(X4) ) )
                  & ! [X6] :
                      ( ? [X7] :
                          ( X6 != X7
                          & memberP(X0,X7)
                          & ssItem(X7) )
                      | ~ ssItem(X6) )
                  & X0 = X2
                  & X1 = X3
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(ennf_transformation,[],[f98]) ).

fof(f98,plain,
    ~ ! [X0] :
        ( ssList(X0)
       => ! [X1] :
            ( ssList(X1)
           => ! [X2] :
                ( ssList(X2)
               => ! [X3] :
                    ( ssList(X3)
                   => ( ( ( nil != X2
                          | nil != X3 )
                        & ! [X4] :
                            ( ssItem(X4)
                           => ( ? [X5] :
                                  ( leq(X4,X5)
                                  & memberP(X3,X5)
                                  & X4 != X5
                                  & ssItem(X5) )
                              | ~ memberP(X3,X4)
                              | cons(X4,nil) != X2 ) ) )
                      | ? [X6] :
                          ( ! [X7] :
                              ( ssItem(X7)
                             => ( X6 = X7
                                | ~ memberP(X0,X7) ) )
                          & ssItem(X6) )
                      | X0 != X2
                      | X1 != X3 ) ) ) ) ),
    inference(rectify,[],[f97]) ).

fof(f97,negated_conjecture,
    ~ ! [X0] :
        ( ssList(X0)
       => ! [X1] :
            ( ssList(X1)
           => ! [X2] :
                ( ssList(X2)
               => ! [X3] :
                    ( ssList(X3)
                   => ( ( ( nil != X2
                          | nil != X3 )
                        & ! [X6] :
                            ( ssItem(X6)
                           => ( ? [X7] :
                                  ( leq(X6,X7)
                                  & memberP(X3,X7)
                                  & X6 != X7
                                  & ssItem(X7) )
                              | ~ memberP(X3,X6)
                              | cons(X6,nil) != X2 ) ) )
                      | ? [X4] :
                          ( ! [X5] :
                              ( ssItem(X5)
                             => ( X4 = X5
                                | ~ memberP(X0,X5) ) )
                          & ssItem(X4) )
                      | X0 != X2
                      | X1 != X3 ) ) ) ) ),
    inference(negated_conjecture,[],[f96]) ).

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

fof(f268,plain,
    ( ! [X0] :
        ( ~ ssItem(X0)
        | sK4 = sK5(X0)
        | ~ ssItem(sK5(X0)) )
    | ~ spl12_4
    | ~ spl12_5 ),
    inference(subsumption_resolution,[],[f267,f181]) ).

fof(f181,plain,
    ! [X0] :
      ( ~ memberP(nil,X0)
      | ~ ssItem(X0) ),
    inference(cnf_transformation,[],[f108]) ).

fof(f108,plain,
    ! [X0] :
      ( ~ memberP(nil,X0)
      | ~ ssItem(X0) ),
    inference(ennf_transformation,[],[f38]) ).

fof(f38,axiom,
    ! [X0] :
      ( ssItem(X0)
     => ~ memberP(nil,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax38) ).

fof(f267,plain,
    ( ! [X0] :
        ( ~ ssItem(X0)
        | sK4 = sK5(X0)
        | memberP(nil,sK5(X0))
        | ~ ssItem(sK5(X0)) )
    | ~ spl12_4
    | ~ spl12_5 ),
    inference(subsumption_resolution,[],[f266,f236]) ).

fof(f266,plain,
    ( ! [X0] :
        ( ~ ssItem(X0)
        | sK4 = sK5(X0)
        | memberP(nil,sK5(X0))
        | ~ ssItem(sK4)
        | ~ ssItem(sK5(X0)) )
    | ~ spl12_4 ),
    inference(subsumption_resolution,[],[f265,f180]) ).

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

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

fof(f265,plain,
    ( ! [X0] :
        ( ~ ssItem(X0)
        | sK4 = sK5(X0)
        | memberP(nil,sK5(X0))
        | ~ ssList(nil)
        | ~ ssItem(sK4)
        | ~ ssItem(sK5(X0)) )
    | ~ spl12_4 ),
    inference(resolution,[],[f263,f182]) ).

fof(f182,plain,
    ! [X2,X0,X1] :
      ( ~ memberP(cons(X1,X2),X0)
      | X0 = X1
      | memberP(X2,X0)
      | ~ ssList(X2)
      | ~ ssItem(X1)
      | ~ ssItem(X0) ),
    inference(cnf_transformation,[],[f142]) ).

fof(f142,plain,
    ! [X0] :
      ( ! [X1] :
          ( ! [X2] :
              ( ( ( memberP(cons(X1,X2),X0)
                  | ( ~ memberP(X2,X0)
                    & X0 != X1 ) )
                & ( memberP(X2,X0)
                  | X0 = X1
                  | ~ memberP(cons(X1,X2),X0) ) )
              | ~ ssList(X2) )
          | ~ ssItem(X1) )
      | ~ ssItem(X0) ),
    inference(flattening,[],[f141]) ).

fof(f141,plain,
    ! [X0] :
      ( ! [X1] :
          ( ! [X2] :
              ( ( ( memberP(cons(X1,X2),X0)
                  | ( ~ memberP(X2,X0)
                    & X0 != X1 ) )
                & ( memberP(X2,X0)
                  | X0 = X1
                  | ~ memberP(cons(X1,X2),X0) ) )
              | ~ ssList(X2) )
          | ~ ssItem(X1) )
      | ~ ssItem(X0) ),
    inference(nnf_transformation,[],[f109]) ).

fof(f109,plain,
    ! [X0] :
      ( ! [X1] :
          ( ! [X2] :
              ( ( memberP(cons(X1,X2),X0)
              <=> ( memberP(X2,X0)
                  | X0 = X1 ) )
              | ~ ssList(X2) )
          | ~ ssItem(X1) )
      | ~ ssItem(X0) ),
    inference(ennf_transformation,[],[f37]) ).

fof(f37,axiom,
    ! [X0] :
      ( ssItem(X0)
     => ! [X1] :
          ( ssItem(X1)
         => ! [X2] :
              ( ssList(X2)
             => ( memberP(cons(X1,X2),X0)
              <=> ( memberP(X2,X0)
                  | X0 = X1 ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax37) ).

fof(f263,plain,
    ( ! [X0] :
        ( memberP(cons(sK4,nil),sK5(X0))
        | ~ ssItem(X0) )
    | ~ spl12_4 ),
    inference(superposition,[],[f206,f231]) ).

fof(f231,plain,
    ( sK2 = cons(sK4,nil)
    | ~ spl12_4 ),
    inference(avatar_component_clause,[],[f229]) ).

fof(f229,plain,
    ( spl12_4
  <=> sK2 = cons(sK4,nil) ),
    introduced(avatar_definition,[new_symbols(naming,[spl12_4])]) ).

fof(f206,plain,
    ! [X6] :
      ( memberP(sK2,sK5(X6))
      | ~ ssItem(X6) ),
    inference(definition_unfolding,[],[f159,f157]) ).

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

fof(f159,plain,
    ! [X6] :
      ( memberP(sK0,sK5(X6))
      | ~ ssItem(X6) ),
    inference(cnf_transformation,[],[f134]) ).

fof(f160,plain,
    ! [X6] :
      ( sK5(X6) != X6
      | ~ ssItem(X6) ),
    inference(cnf_transformation,[],[f134]) ).

fof(f256,plain,
    ~ spl12_2,
    inference(avatar_contradiction_clause,[],[f252]) ).

fof(f252,plain,
    ( $false
    | ~ spl12_2 ),
    inference(resolution,[],[f250,f169]) ).

fof(f169,plain,
    ssItem(sK6),
    inference(cnf_transformation,[],[f137]) ).

fof(f137,plain,
    ( sK6 != sK7
    & ssItem(sK7)
    & ssItem(sK6) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7])],[f2,f136,f135]) ).

fof(f135,plain,
    ( ? [X0] :
        ( ? [X1] :
            ( X0 != X1
            & ssItem(X1) )
        & ssItem(X0) )
   => ( ? [X1] :
          ( sK6 != X1
          & ssItem(X1) )
      & ssItem(sK6) ) ),
    introduced(choice_axiom,[]) ).

fof(f136,plain,
    ( ? [X1] :
        ( sK6 != X1
        & ssItem(X1) )
   => ( sK6 != sK7
      & ssItem(sK7) ) ),
    introduced(choice_axiom,[]) ).

fof(f2,axiom,
    ? [X0] :
      ( ? [X1] :
          ( X0 != X1
          & ssItem(X1) )
      & ssItem(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2) ).

fof(f250,plain,
    ( ! [X0] : ~ ssItem(X0)
    | ~ spl12_2 ),
    inference(subsumption_resolution,[],[f249,f158]) ).

fof(f249,plain,
    ( ! [X0] :
        ( ~ ssItem(X0)
        | ~ ssItem(sK5(X0)) )
    | ~ spl12_2 ),
    inference(resolution,[],[f248,f181]) ).

fof(f248,plain,
    ( ! [X0] :
        ( memberP(nil,sK5(X0))
        | ~ ssItem(X0) )
    | ~ spl12_2 ),
    inference(superposition,[],[f206,f221]) ).

fof(f221,plain,
    ( nil = sK2
    | ~ spl12_2 ),
    inference(avatar_component_clause,[],[f219]) ).

fof(f219,plain,
    ( spl12_2
  <=> nil = sK2 ),
    introduced(avatar_definition,[new_symbols(naming,[spl12_2])]) ).

fof(f237,plain,
    ( spl12_5
    | spl12_2 ),
    inference(avatar_split_clause,[],[f165,f219,f234]) ).

fof(f165,plain,
    ( nil = sK2
    | ssItem(sK4) ),
    inference(cnf_transformation,[],[f134]) ).

fof(f232,plain,
    ( spl12_4
    | spl12_2 ),
    inference(avatar_split_clause,[],[f166,f219,f229]) ).

fof(f166,plain,
    ( nil = sK2
    | sK2 = cons(sK4,nil) ),
    inference(cnf_transformation,[],[f134]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SWC198+1 : TPTP v8.2.0. Released v2.4.0.
% 0.15/0.14  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.34  % Computer : n020.cluster.edu
% 0.15/0.34  % Model    : x86_64 x86_64
% 0.15/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34  % Memory   : 8042.1875MB
% 0.15/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34  % CPULimit   : 300
% 0.15/0.34  % WCLimit    : 300
% 0.15/0.34  % DateTime   : Sun May 19 03:53:08 EDT 2024
% 0.15/0.34  % CPUTime    : 
% 0.15/0.35  This is a FOF_THM_RFO_SEQ problem
% 0.15/0.35  Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.57/0.74  % (15650)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.57/0.74  % (15655)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 (2996ds/56Mi)
% 0.57/0.74  % (15652)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 (2996ds/34Mi)
% 0.57/0.74  % (15648)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 (2996ds/34Mi)
% 0.57/0.74  % (15649)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 (2996ds/51Mi)
% 0.57/0.74  % (15651)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.57/0.74  % (15653)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.57/0.74  % (15654)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 (2996ds/83Mi)
% 0.57/0.74  % (15653)First to succeed.
% 0.57/0.74  % (15653)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-15608"
% 0.57/0.75  % (15653)Refutation found. Thanks to Tanya!
% 0.57/0.75  % SZS status Theorem for theBenchmark
% 0.57/0.75  % SZS output start Proof for theBenchmark
% See solution above
% 0.57/0.75  % (15653)------------------------------
% 0.57/0.75  % (15653)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.75  % (15653)Termination reason: Refutation
% 0.57/0.75  
% 0.57/0.75  % (15653)Memory used [KB]: 1189
% 0.57/0.75  % (15653)Time elapsed: 0.007 s
% 0.57/0.75  % (15653)Instructions burned: 9 (million)
% 0.57/0.75  % (15608)Success in time 0.385 s
% 0.57/0.75  % Vampire---4.8 exiting
%------------------------------------------------------------------------------