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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SWC204+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 : n016.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:06 EDT 2024

% Result   : Theorem 0.61s 0.81s
% Output   : Refutation 0.61s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   22
% Syntax   : Number of formulae    :  105 (   9 unt;   0 def)
%            Number of atoms       :  475 ( 125 equ)
%            Maximal formula atoms :   32 (   4 avg)
%            Number of connectives :  594 ( 224   ~; 234   |; 100   &)
%                                         (  11 <=>;  25  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   14 (  12 usr;  10 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   5 con; 0-2 aty)
%            Number of variables   :   96 (  68   !;  28   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f450,plain,
    $false,
    inference(avatar_sat_refutation,[],[f235,f252,f255,f273,f283,f292,f307,f411,f422,f447]) ).

fof(f447,plain,
    ( spl10_1
    | ~ spl10_2
    | ~ spl10_9
    | ~ spl10_11 ),
    inference(avatar_contradiction_clause,[],[f446]) ).

fof(f446,plain,
    ( $false
    | spl10_1
    | ~ spl10_2
    | ~ spl10_9
    | ~ spl10_11 ),
    inference(subsumption_resolution,[],[f437,f274]) ).

fof(f274,plain,
    ( ~ neq(nil,nil)
    | spl10_1
    | ~ spl10_9 ),
    inference(superposition,[],[f230,f269]) ).

fof(f269,plain,
    ( nil = sK2
    | ~ spl10_9 ),
    inference(avatar_component_clause,[],[f267]) ).

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

fof(f230,plain,
    ( ~ neq(sK2,nil)
    | spl10_1 ),
    inference(avatar_component_clause,[],[f228]) ).

fof(f228,plain,
    ( spl10_1
  <=> neq(sK2,nil) ),
    introduced(avatar_definition,[new_symbols(naming,[spl10_1])]) ).

fof(f437,plain,
    ( neq(nil,nil)
    | ~ spl10_2
    | ~ spl10_11 ),
    inference(superposition,[],[f233,f303]) ).

fof(f303,plain,
    ( nil = sK3
    | ~ spl10_11 ),
    inference(avatar_component_clause,[],[f301]) ).

fof(f301,plain,
    ( spl10_11
  <=> nil = sK3 ),
    introduced(avatar_definition,[new_symbols(naming,[spl10_11])]) ).

fof(f233,plain,
    ( neq(sK3,nil)
    | ~ spl10_2 ),
    inference(avatar_component_clause,[],[f232]) ).

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

fof(f422,plain,
    ( spl10_11
    | spl10_13 ),
    inference(avatar_split_clause,[],[f421,f386,f301]) ).

fof(f386,plain,
    ( spl10_13
  <=> ssItem(hd(sK3)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl10_13])]) ).

fof(f421,plain,
    ( nil = sK3
    | spl10_13 ),
    inference(subsumption_resolution,[],[f417,f160]) ).

fof(f160,plain,
    ssList(sK3),
    inference(cnf_transformation,[],[f142]) ).

fof(f142,plain,
    ( ( ( ~ neq(sK3,nil)
        & neq(sK1,nil) )
      | ( ~ neq(sK0,nil)
        & ! [X4] :
            ( ! [X5] :
                ( ~ neq(nil,sK3)
                | app(sK2,X5) != X4
                | tl(sK3) != X5
                | ~ ssList(X5) )
            | sK3 = X4
            | ~ ssList(X4) )
        & 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])],[f99,f141,f140,f139,f138]) ).

fof(f138,plain,
    ( ? [X0] :
        ( ? [X1] :
            ( ? [X2] :
                ( ? [X3] :
                    ( ( ( ~ neq(X3,nil)
                        & neq(X1,nil) )
                      | ( ~ neq(X0,nil)
                        & ! [X4] :
                            ( ! [X5] :
                                ( ~ neq(nil,X3)
                                | app(X2,X5) != X4
                                | tl(X3) != X5
                                | ~ ssList(X5) )
                            | X3 = X4
                            | ~ ssList(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) )
                    | ( ~ neq(sK0,nil)
                      & ! [X4] :
                          ( ! [X5] :
                              ( ~ neq(nil,X3)
                              | app(X2,X5) != X4
                              | tl(X3) != X5
                              | ~ ssList(X5) )
                          | X3 = X4
                          | ~ ssList(X4) )
                      & neq(X1,nil) ) )
                  & sK0 = X2
                  & X1 = X3
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(sK0) ) ),
    introduced(choice_axiom,[]) ).

fof(f139,plain,
    ( ? [X1] :
        ( ? [X2] :
            ( ? [X3] :
                ( ( ( ~ neq(X3,nil)
                    & neq(X1,nil) )
                  | ( ~ neq(sK0,nil)
                    & ! [X4] :
                        ( ! [X5] :
                            ( ~ neq(nil,X3)
                            | app(X2,X5) != X4
                            | tl(X3) != X5
                            | ~ ssList(X5) )
                        | X3 = X4
                        | ~ ssList(X4) )
                    & neq(X1,nil) ) )
                & sK0 = X2
                & X1 = X3
                & ssList(X3) )
            & ssList(X2) )
        & ssList(X1) )
   => ( ? [X2] :
          ( ? [X3] :
              ( ( ( ~ neq(X3,nil)
                  & neq(sK1,nil) )
                | ( ~ neq(sK0,nil)
                  & ! [X4] :
                      ( ! [X5] :
                          ( ~ neq(nil,X3)
                          | app(X2,X5) != X4
                          | tl(X3) != X5
                          | ~ ssList(X5) )
                      | X3 = X4
                      | ~ ssList(X4) )
                  & neq(sK1,nil) ) )
              & sK0 = X2
              & sK1 = X3
              & ssList(X3) )
          & ssList(X2) )
      & ssList(sK1) ) ),
    introduced(choice_axiom,[]) ).

fof(f140,plain,
    ( ? [X2] :
        ( ? [X3] :
            ( ( ( ~ neq(X3,nil)
                & neq(sK1,nil) )
              | ( ~ neq(sK0,nil)
                & ! [X4] :
                    ( ! [X5] :
                        ( ~ neq(nil,X3)
                        | app(X2,X5) != X4
                        | tl(X3) != X5
                        | ~ ssList(X5) )
                    | X3 = X4
                    | ~ ssList(X4) )
                & neq(sK1,nil) ) )
            & sK0 = X2
            & sK1 = X3
            & ssList(X3) )
        & ssList(X2) )
   => ( ? [X3] :
          ( ( ( ~ neq(X3,nil)
              & neq(sK1,nil) )
            | ( ~ neq(sK0,nil)
              & ! [X4] :
                  ( ! [X5] :
                      ( ~ neq(nil,X3)
                      | app(sK2,X5) != X4
                      | tl(X3) != X5
                      | ~ ssList(X5) )
                  | X3 = X4
                  | ~ ssList(X4) )
              & neq(sK1,nil) ) )
          & sK0 = sK2
          & sK1 = X3
          & ssList(X3) )
      & ssList(sK2) ) ),
    introduced(choice_axiom,[]) ).

fof(f141,plain,
    ( ? [X3] :
        ( ( ( ~ neq(X3,nil)
            & neq(sK1,nil) )
          | ( ~ neq(sK0,nil)
            & ! [X4] :
                ( ! [X5] :
                    ( ~ neq(nil,X3)
                    | app(sK2,X5) != X4
                    | tl(X3) != X5
                    | ~ ssList(X5) )
                | X3 = X4
                | ~ ssList(X4) )
            & neq(sK1,nil) ) )
        & sK0 = sK2
        & sK1 = X3
        & ssList(X3) )
   => ( ( ( ~ neq(sK3,nil)
          & neq(sK1,nil) )
        | ( ~ neq(sK0,nil)
          & ! [X4] :
              ( ! [X5] :
                  ( ~ neq(nil,sK3)
                  | app(sK2,X5) != X4
                  | tl(sK3) != X5
                  | ~ ssList(X5) )
              | sK3 = X4
              | ~ ssList(X4) )
          & neq(sK1,nil) ) )
      & sK0 = sK2
      & sK1 = sK3
      & ssList(sK3) ) ),
    introduced(choice_axiom,[]) ).

fof(f99,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ( ( ~ neq(X3,nil)
                      & neq(X1,nil) )
                    | ( ~ neq(X0,nil)
                      & ! [X4] :
                          ( ! [X5] :
                              ( ~ neq(nil,X3)
                              | app(X2,X5) != X4
                              | tl(X3) != X5
                              | ~ ssList(X5) )
                          | X3 = X4
                          | ~ ssList(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) )
                    | ( ~ neq(X0,nil)
                      & ! [X4] :
                          ( ! [X5] :
                              ( ~ neq(nil,X3)
                              | app(X2,X5) != X4
                              | tl(X3) != X5
                              | ~ ssList(X5) )
                          | X3 = X4
                          | ~ ssList(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) )
                        & ( neq(X0,nil)
                          | ? [X4] :
                              ( ? [X5] :
                                  ( neq(nil,X3)
                                  & app(X2,X5) = X4
                                  & tl(X3) = X5
                                  & ssList(X5) )
                              & X3 != X4
                              & ssList(X4) )
                          | ~ 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) )
                      & ( neq(X0,nil)
                        | ? [X4] :
                            ( ? [X5] :
                                ( neq(nil,X3)
                                & app(X2,X5) = X4
                                & tl(X3) = X5
                                & ssList(X5) )
                            & X3 != X4
                            & ssList(X4) )
                        | ~ neq(X1,nil) ) )
                    | X0 != X2
                    | X1 != X3 ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

fof(f417,plain,
    ( nil = sK3
    | ~ ssList(sK3)
    | spl10_13 ),
    inference(resolution,[],[f388,f207]) ).

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

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

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

fof(f22,axiom,
    ! [X0] :
      ( ssList(X0)
     => ( nil != X0
       => ssItem(hd(X0)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax22) ).

fof(f388,plain,
    ( ~ ssItem(hd(sK3))
    | spl10_13 ),
    inference(avatar_component_clause,[],[f386]) ).

fof(f411,plain,
    ( ~ spl10_13
    | ~ spl10_4
    | ~ spl10_5
    | ~ spl10_9
    | spl10_11 ),
    inference(avatar_split_clause,[],[f410,f301,f267,f245,f241,f386]) ).

fof(f241,plain,
    ( spl10_4
  <=> sK3 = app(sK2,tl(sK3)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl10_4])]) ).

fof(f245,plain,
    ( spl10_5
  <=> ssList(tl(sK3)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl10_5])]) ).

fof(f410,plain,
    ( ~ ssItem(hd(sK3))
    | ~ spl10_4
    | ~ spl10_5
    | ~ spl10_9
    | spl10_11 ),
    inference(subsumption_resolution,[],[f383,f160]) ).

fof(f383,plain,
    ( ~ ssItem(hd(sK3))
    | ~ ssList(sK3)
    | ~ spl10_4
    | ~ spl10_5
    | ~ spl10_9
    | spl10_11 ),
    inference(trivial_inequality_removal,[],[f381]) ).

fof(f381,plain,
    ( sK3 != sK3
    | ~ ssItem(hd(sK3))
    | ~ ssList(sK3)
    | ~ spl10_4
    | ~ spl10_5
    | ~ spl10_9
    | spl10_11 ),
    inference(superposition,[],[f198,f361]) ).

fof(f361,plain,
    ( sK3 = cons(hd(sK3),sK3)
    | ~ spl10_4
    | ~ spl10_5
    | ~ spl10_9
    | spl10_11 ),
    inference(subsumption_resolution,[],[f360,f160]) ).

fof(f360,plain,
    ( sK3 = cons(hd(sK3),sK3)
    | ~ ssList(sK3)
    | ~ spl10_4
    | ~ spl10_5
    | ~ spl10_9
    | spl10_11 ),
    inference(subsumption_resolution,[],[f356,f302]) ).

fof(f302,plain,
    ( nil != sK3
    | spl10_11 ),
    inference(avatar_component_clause,[],[f301]) ).

fof(f356,plain,
    ( sK3 = cons(hd(sK3),sK3)
    | nil = sK3
    | ~ ssList(sK3)
    | ~ spl10_4
    | ~ spl10_5
    | ~ spl10_9 ),
    inference(superposition,[],[f186,f324]) ).

fof(f324,plain,
    ( sK3 = tl(sK3)
    | ~ spl10_4
    | ~ spl10_5
    | ~ spl10_9 ),
    inference(subsumption_resolution,[],[f310,f246]) ).

fof(f246,plain,
    ( ssList(tl(sK3))
    | ~ spl10_5 ),
    inference(avatar_component_clause,[],[f245]) ).

fof(f310,plain,
    ( sK3 = tl(sK3)
    | ~ ssList(tl(sK3))
    | ~ spl10_4
    | ~ spl10_9 ),
    inference(superposition,[],[f308,f177]) ).

fof(f177,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(f308,plain,
    ( sK3 = app(nil,tl(sK3))
    | ~ spl10_4
    | ~ spl10_9 ),
    inference(forward_demodulation,[],[f243,f269]) ).

fof(f243,plain,
    ( sK3 = app(sK2,tl(sK3))
    | ~ spl10_4 ),
    inference(avatar_component_clause,[],[f241]) ).

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

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

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

fof(f78,axiom,
    ! [X0] :
      ( ssList(X0)
     => ( nil != X0
       => cons(hd(X0),tl(X0)) = X0 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax78) ).

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

fof(f129,plain,
    ! [X0] :
      ( ! [X1] :
          ( cons(X1,X0) != X0
          | ~ ssItem(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f18]) ).

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

fof(f307,plain,
    ( spl10_11
    | spl10_6 ),
    inference(avatar_split_clause,[],[f306,f249,f301]) ).

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

fof(f306,plain,
    ( nil = sK3
    | spl10_6 ),
    inference(subsumption_resolution,[],[f305,f184]) ).

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

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

fof(f305,plain,
    ( nil = sK3
    | ~ ssList(nil)
    | spl10_6 ),
    inference(subsumption_resolution,[],[f295,f160]) ).

fof(f295,plain,
    ( nil = sK3
    | ~ ssList(sK3)
    | ~ ssList(nil)
    | spl10_6 ),
    inference(resolution,[],[f251,f181]) ).

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

fof(f145,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( ( neq(X0,X1)
              | X0 = X1 )
            & ( X0 != X1
              | ~ neq(X0,X1) ) )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(nnf_transformation,[],[f111]) ).

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

fof(f15,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ( neq(X0,X1)
          <=> X0 != X1 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax15) ).

fof(f251,plain,
    ( ~ neq(nil,sK3)
    | spl10_6 ),
    inference(avatar_component_clause,[],[f249]) ).

fof(f292,plain,
    ( spl10_1
    | ~ spl10_2
    | spl10_5
    | ~ spl10_9 ),
    inference(avatar_contradiction_clause,[],[f291]) ).

fof(f291,plain,
    ( $false
    | spl10_1
    | ~ spl10_2
    | spl10_5
    | ~ spl10_9 ),
    inference(subsumption_resolution,[],[f288,f274]) ).

fof(f288,plain,
    ( neq(nil,nil)
    | ~ spl10_2
    | spl10_5 ),
    inference(superposition,[],[f233,f285]) ).

fof(f285,plain,
    ( nil = sK3
    | spl10_5 ),
    inference(subsumption_resolution,[],[f284,f160]) ).

fof(f284,plain,
    ( nil = sK3
    | ~ ssList(sK3)
    | spl10_5 ),
    inference(resolution,[],[f247,f191]) ).

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

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

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

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

fof(f247,plain,
    ( ~ ssList(tl(sK3))
    | spl10_5 ),
    inference(avatar_component_clause,[],[f245]) ).

fof(f283,plain,
    ( ~ spl10_5
    | spl10_3 ),
    inference(avatar_split_clause,[],[f282,f237,f245]) ).

fof(f237,plain,
    ( spl10_3
  <=> ssList(app(sK2,tl(sK3))) ),
    introduced(avatar_definition,[new_symbols(naming,[spl10_3])]) ).

fof(f282,plain,
    ( ~ ssList(tl(sK3))
    | spl10_3 ),
    inference(subsumption_resolution,[],[f280,f159]) ).

fof(f159,plain,
    ssList(sK2),
    inference(cnf_transformation,[],[f142]) ).

fof(f280,plain,
    ( ~ ssList(tl(sK3))
    | ~ ssList(sK2)
    | spl10_3 ),
    inference(resolution,[],[f239,f179]) ).

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

fof(f110,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(f239,plain,
    ( ~ ssList(app(sK2,tl(sK3)))
    | spl10_3 ),
    inference(avatar_component_clause,[],[f237]) ).

fof(f273,plain,
    ( spl10_9
    | spl10_1 ),
    inference(avatar_split_clause,[],[f272,f228,f267]) ).

fof(f272,plain,
    ( nil = sK2
    | spl10_1 ),
    inference(subsumption_resolution,[],[f271,f159]) ).

fof(f271,plain,
    ( nil = sK2
    | ~ ssList(sK2)
    | spl10_1 ),
    inference(subsumption_resolution,[],[f257,f184]) ).

fof(f257,plain,
    ( nil = sK2
    | ~ ssList(nil)
    | ~ ssList(sK2)
    | spl10_1 ),
    inference(resolution,[],[f230,f181]) ).

fof(f255,plain,
    spl10_2,
    inference(avatar_split_clause,[],[f226,f232]) ).

fof(f226,plain,
    neq(sK3,nil),
    inference(duplicate_literal_removal,[],[f212]) ).

fof(f212,plain,
    ( neq(sK3,nil)
    | neq(sK3,nil) ),
    inference(definition_unfolding,[],[f163,f161,f161]) ).

fof(f161,plain,
    sK1 = sK3,
    inference(cnf_transformation,[],[f142]) ).

fof(f163,plain,
    ( neq(sK1,nil)
    | neq(sK1,nil) ),
    inference(cnf_transformation,[],[f142]) ).

fof(f252,plain,
    ( ~ spl10_3
    | spl10_4
    | ~ spl10_5
    | ~ spl10_6
    | ~ spl10_2 ),
    inference(avatar_split_clause,[],[f216,f232,f249,f245,f241,f237]) ).

fof(f216,plain,
    ( ~ neq(sK3,nil)
    | ~ neq(nil,sK3)
    | ~ ssList(tl(sK3))
    | sK3 = app(sK2,tl(sK3))
    | ~ ssList(app(sK2,tl(sK3))) ),
    inference(equality_resolution,[],[f215]) ).

fof(f215,plain,
    ! [X5] :
      ( ~ neq(sK3,nil)
      | ~ neq(nil,sK3)
      | tl(sK3) != X5
      | ~ ssList(X5)
      | app(sK2,X5) = sK3
      | ~ ssList(app(sK2,X5)) ),
    inference(equality_resolution,[],[f167]) ).

fof(f167,plain,
    ! [X4,X5] :
      ( ~ neq(sK3,nil)
      | ~ neq(nil,sK3)
      | app(sK2,X5) != X4
      | tl(sK3) != X5
      | ~ ssList(X5)
      | sK3 = X4
      | ~ ssList(X4) ),
    inference(cnf_transformation,[],[f142]) ).

fof(f235,plain,
    ( ~ spl10_1
    | ~ spl10_2 ),
    inference(avatar_split_clause,[],[f208,f232,f228]) ).

fof(f208,plain,
    ( ~ neq(sK3,nil)
    | ~ neq(sK2,nil) ),
    inference(definition_unfolding,[],[f168,f162]) ).

fof(f162,plain,
    sK0 = sK2,
    inference(cnf_transformation,[],[f142]) ).

fof(f168,plain,
    ( ~ neq(sK3,nil)
    | ~ neq(sK0,nil) ),
    inference(cnf_transformation,[],[f142]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : SWC204+1 : TPTP v8.2.0. Released v2.4.0.
% 0.03/0.14  % 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.15/0.35  % Computer : n016.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Sun May 19 03:38:23 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.15/0.36  This is a FOF_THM_RFO_SEQ problem
% 0.15/0.36  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.61/0.80  % (5347)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.61/0.80  % (5344)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.61/0.80  % (5349)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.61/0.80  % (5348)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.61/0.80  % (5345)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.61/0.80  % (5346)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.61/0.80  % (5351)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.61/0.80  % (5350)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.61/0.81  % (5351)Refutation not found, incomplete strategy% (5351)------------------------------
% 0.61/0.81  % (5351)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.81  % (5351)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.81  
% 0.61/0.81  % (5351)Memory used [KB]: 1160
% 0.61/0.81  % (5351)Time elapsed: 0.005 s
% 0.61/0.81  % (5351)Instructions burned: 5 (million)
% 0.61/0.81  % (5351)------------------------------
% 0.61/0.81  % (5351)------------------------------
% 0.61/0.81  % (5349)First to succeed.
% 0.61/0.81  % (5352)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.61/0.81  % (5349)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-5313"
% 0.61/0.81  % (5346)Also succeeded, but the first one will report.
% 0.61/0.81  % (5349)Refutation found. Thanks to Tanya!
% 0.61/0.81  % SZS status Theorem for theBenchmark
% 0.61/0.81  % SZS output start Proof for theBenchmark
% See solution above
% 0.61/0.81  % (5349)------------------------------
% 0.61/0.81  % (5349)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.81  % (5349)Termination reason: Refutation
% 0.61/0.81  
% 0.61/0.81  % (5349)Memory used [KB]: 1220
% 0.61/0.81  % (5349)Time elapsed: 0.010 s
% 0.61/0.81  % (5349)Instructions burned: 13 (million)
% 0.61/0.81  % (5313)Success in time 0.447 s
% 0.61/0.81  % Vampire---4.8 exiting
%------------------------------------------------------------------------------