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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SWC072+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 : 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:36:01 EDT 2024

% Result   : Theorem 0.54s 0.76s
% Output   : Refutation 0.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   24
%            Number of leaves      :   33
% Syntax   : Number of formulae    :  164 (  11 unt;   0 def)
%            Number of atoms       :  903 ( 250 equ)
%            Maximal formula atoms :   52 (   5 avg)
%            Number of connectives : 1278 ( 539   ~; 542   |; 146   &)
%                                         (  13 <=>;  38  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   23 (   6 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   15 (  13 usr;  10 prp; 0-2 aty)
%            Number of functors    :   15 (  15 usr;   9 con; 0-2 aty)
%            Number of variables   :  229 ( 182   !;  47   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1465,plain,
    $false,
    inference(avatar_sat_refutation,[],[f284,f293,f294,f307,f320,f328,f330,f348,f353,f1464]) ).

fof(f1464,plain,
    ( ~ spl16_2
    | ~ spl16_3
    | ~ spl16_4
    | ~ spl16_5
    | spl16_8 ),
    inference(avatar_contradiction_clause,[],[f1463]) ).

fof(f1463,plain,
    ( $false
    | ~ spl16_2
    | ~ spl16_3
    | ~ spl16_4
    | ~ spl16_5
    | spl16_8 ),
    inference(subsumption_resolution,[],[f1462,f270]) ).

fof(f270,plain,
    ( ssList(sF13)
    | ~ spl16_4 ),
    inference(avatar_component_clause,[],[f269]) ).

fof(f269,plain,
    ( spl16_4
  <=> ssList(sF13) ),
    introduced(avatar_definition,[new_symbols(naming,[spl16_4])]) ).

fof(f1462,plain,
    ( ~ ssList(sF13)
    | ~ spl16_2
    | ~ spl16_3
    | ~ spl16_4
    | ~ spl16_5
    | spl16_8 ),
    inference(subsumption_resolution,[],[f1461,f209]) ).

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

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

fof(f1461,plain,
    ( ~ ssList(nil)
    | ~ ssList(sF13)
    | ~ spl16_2
    | ~ spl16_3
    | ~ spl16_4
    | ~ spl16_5
    | spl16_8 ),
    inference(subsumption_resolution,[],[f1450,f338]) ).

fof(f338,plain,
    ( nil != sF13
    | ~ spl16_5 ),
    inference(subsumption_resolution,[],[f337,f209]) ).

fof(f337,plain,
    ( nil != sF13
    | ~ ssList(nil)
    | ~ spl16_5 ),
    inference(subsumption_resolution,[],[f336,f274]) ).

fof(f274,plain,
    ( ssItem(sF12)
    | ~ spl16_5 ),
    inference(avatar_component_clause,[],[f273]) ).

fof(f273,plain,
    ( spl16_5
  <=> ssItem(sF12) ),
    introduced(avatar_definition,[new_symbols(naming,[spl16_5])]) ).

fof(f336,plain,
    ( nil != sF13
    | ~ ssItem(sF12)
    | ~ ssList(nil) ),
    inference(superposition,[],[f193,f248]) ).

fof(f248,plain,
    cons(sF12,nil) = sF13,
    introduced(function_definition,[new_symbols(definition,[sF13])]) ).

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

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

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

fof(f1450,plain,
    ( nil = sF13
    | ~ ssList(nil)
    | ~ ssList(sF13)
    | ~ spl16_2
    | ~ spl16_3
    | ~ spl16_4
    | ~ spl16_5
    | spl16_8 ),
    inference(resolution,[],[f1443,f206]) ).

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

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

fof(f118,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(f1443,plain,
    ( ~ neq(sF13,nil)
    | ~ spl16_2
    | ~ spl16_3
    | ~ spl16_4
    | ~ spl16_5
    | spl16_8 ),
    inference(subsumption_resolution,[],[f1442,f270]) ).

fof(f1442,plain,
    ( ~ neq(sF13,nil)
    | ~ ssList(sF13)
    | ~ spl16_2
    | ~ spl16_3
    | ~ spl16_4
    | ~ spl16_5
    | spl16_8 ),
    inference(subsumption_resolution,[],[f1439,f1174]) ).

fof(f1174,plain,
    ( segmentP(sK2,sF13)
    | ~ spl16_2
    | ~ spl16_3
    | ~ spl16_4 ),
    inference(subsumption_resolution,[],[f1173,f209]) ).

fof(f1173,plain,
    ( segmentP(sK2,sF13)
    | ~ ssList(nil)
    | ~ spl16_2
    | ~ spl16_3
    | ~ spl16_4 ),
    inference(subsumption_resolution,[],[f1166,f175]) ).

fof(f175,plain,
    ssList(sK2),
    inference(cnf_transformation,[],[f152]) ).

fof(f152,plain,
    ( ( ~ neq(sK3,nil)
      | ! [X4] :
          ( ! [X5] :
              ( ! [X6] :
                  ( ~ neq(nil,sK3)
                  | ! [X7] :
                      ( ~ neq(nil,sK3)
                      | hd(sK3) != X7
                      | cons(X7,nil) != X6
                      | ~ ssItem(X7) )
                  | app(X5,X6) != X4
                  | tl(sK3) != X5
                  | ~ ssList(X6) )
              | ~ ssList(X5) )
          | sK2 = X4
          | ~ ssList(X4) ) )
    & ( nil != sK0
      | nil != sK1 )
    & ( nil != sK3
      | nil = sK2 )
    & ! [X8] :
        ( ~ segmentP(sK0,X8)
        | ~ segmentP(sK1,X8)
        | ~ neq(X8,nil)
        | ~ ssList(X8) )
    & sK0 = sK2
    & sK1 = sK3
    & ssList(sK3)
    & ssList(sK2)
    & ssList(sK1)
    & ssList(sK0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f99,f151,f150,f149,f148]) ).

fof(f148,plain,
    ( ? [X0] :
        ( ? [X1] :
            ( ? [X2] :
                ( ? [X3] :
                    ( ( ~ neq(X3,nil)
                      | ! [X4] :
                          ( ! [X5] :
                              ( ! [X6] :
                                  ( ~ neq(nil,X3)
                                  | ! [X7] :
                                      ( ~ neq(nil,X3)
                                      | hd(X3) != X7
                                      | cons(X7,nil) != X6
                                      | ~ ssItem(X7) )
                                  | app(X5,X6) != X4
                                  | tl(X3) != X5
                                  | ~ ssList(X6) )
                              | ~ ssList(X5) )
                          | X2 = X4
                          | ~ ssList(X4) ) )
                    & ( nil != X0
                      | nil != X1 )
                    & ( nil != X3
                      | nil = X2 )
                    & ! [X8] :
                        ( ~ segmentP(X0,X8)
                        | ~ segmentP(X1,X8)
                        | ~ neq(X8,nil)
                        | ~ ssList(X8) )
                    & X0 = X2
                    & X1 = X3
                    & ssList(X3) )
                & ssList(X2) )
            & ssList(X1) )
        & ssList(X0) )
   => ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ( ~ neq(X3,nil)
                    | ! [X4] :
                        ( ! [X5] :
                            ( ! [X6] :
                                ( ~ neq(nil,X3)
                                | ! [X7] :
                                    ( ~ neq(nil,X3)
                                    | hd(X3) != X7
                                    | cons(X7,nil) != X6
                                    | ~ ssItem(X7) )
                                | app(X5,X6) != X4
                                | tl(X3) != X5
                                | ~ ssList(X6) )
                            | ~ ssList(X5) )
                        | X2 = X4
                        | ~ ssList(X4) ) )
                  & ( nil != sK0
                    | nil != X1 )
                  & ( nil != X3
                    | nil = X2 )
                  & ! [X8] :
                      ( ~ segmentP(sK0,X8)
                      | ~ segmentP(X1,X8)
                      | ~ neq(X8,nil)
                      | ~ ssList(X8) )
                  & sK0 = X2
                  & X1 = X3
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(sK0) ) ),
    introduced(choice_axiom,[]) ).

fof(f149,plain,
    ( ? [X1] :
        ( ? [X2] :
            ( ? [X3] :
                ( ( ~ neq(X3,nil)
                  | ! [X4] :
                      ( ! [X5] :
                          ( ! [X6] :
                              ( ~ neq(nil,X3)
                              | ! [X7] :
                                  ( ~ neq(nil,X3)
                                  | hd(X3) != X7
                                  | cons(X7,nil) != X6
                                  | ~ ssItem(X7) )
                              | app(X5,X6) != X4
                              | tl(X3) != X5
                              | ~ ssList(X6) )
                          | ~ ssList(X5) )
                      | X2 = X4
                      | ~ ssList(X4) ) )
                & ( nil != sK0
                  | nil != X1 )
                & ( nil != X3
                  | nil = X2 )
                & ! [X8] :
                    ( ~ segmentP(sK0,X8)
                    | ~ segmentP(X1,X8)
                    | ~ neq(X8,nil)
                    | ~ ssList(X8) )
                & sK0 = X2
                & X1 = X3
                & ssList(X3) )
            & ssList(X2) )
        & ssList(X1) )
   => ( ? [X2] :
          ( ? [X3] :
              ( ( ~ neq(X3,nil)
                | ! [X4] :
                    ( ! [X5] :
                        ( ! [X6] :
                            ( ~ neq(nil,X3)
                            | ! [X7] :
                                ( ~ neq(nil,X3)
                                | hd(X3) != X7
                                | cons(X7,nil) != X6
                                | ~ ssItem(X7) )
                            | app(X5,X6) != X4
                            | tl(X3) != X5
                            | ~ ssList(X6) )
                        | ~ ssList(X5) )
                    | X2 = X4
                    | ~ ssList(X4) ) )
              & ( nil != sK0
                | nil != sK1 )
              & ( nil != X3
                | nil = X2 )
              & ! [X8] :
                  ( ~ segmentP(sK0,X8)
                  | ~ segmentP(sK1,X8)
                  | ~ neq(X8,nil)
                  | ~ ssList(X8) )
              & sK0 = X2
              & sK1 = X3
              & ssList(X3) )
          & ssList(X2) )
      & ssList(sK1) ) ),
    introduced(choice_axiom,[]) ).

fof(f150,plain,
    ( ? [X2] :
        ( ? [X3] :
            ( ( ~ neq(X3,nil)
              | ! [X4] :
                  ( ! [X5] :
                      ( ! [X6] :
                          ( ~ neq(nil,X3)
                          | ! [X7] :
                              ( ~ neq(nil,X3)
                              | hd(X3) != X7
                              | cons(X7,nil) != X6
                              | ~ ssItem(X7) )
                          | app(X5,X6) != X4
                          | tl(X3) != X5
                          | ~ ssList(X6) )
                      | ~ ssList(X5) )
                  | X2 = X4
                  | ~ ssList(X4) ) )
            & ( nil != sK0
              | nil != sK1 )
            & ( nil != X3
              | nil = X2 )
            & ! [X8] :
                ( ~ segmentP(sK0,X8)
                | ~ segmentP(sK1,X8)
                | ~ neq(X8,nil)
                | ~ ssList(X8) )
            & sK0 = X2
            & sK1 = X3
            & ssList(X3) )
        & ssList(X2) )
   => ( ? [X3] :
          ( ( ~ neq(X3,nil)
            | ! [X4] :
                ( ! [X5] :
                    ( ! [X6] :
                        ( ~ neq(nil,X3)
                        | ! [X7] :
                            ( ~ neq(nil,X3)
                            | hd(X3) != X7
                            | cons(X7,nil) != X6
                            | ~ ssItem(X7) )
                        | app(X5,X6) != X4
                        | tl(X3) != X5
                        | ~ ssList(X6) )
                    | ~ ssList(X5) )
                | sK2 = X4
                | ~ ssList(X4) ) )
          & ( nil != sK0
            | nil != sK1 )
          & ( nil != X3
            | nil = sK2 )
          & ! [X8] :
              ( ~ segmentP(sK0,X8)
              | ~ segmentP(sK1,X8)
              | ~ neq(X8,nil)
              | ~ ssList(X8) )
          & sK0 = sK2
          & sK1 = X3
          & ssList(X3) )
      & ssList(sK2) ) ),
    introduced(choice_axiom,[]) ).

fof(f151,plain,
    ( ? [X3] :
        ( ( ~ neq(X3,nil)
          | ! [X4] :
              ( ! [X5] :
                  ( ! [X6] :
                      ( ~ neq(nil,X3)
                      | ! [X7] :
                          ( ~ neq(nil,X3)
                          | hd(X3) != X7
                          | cons(X7,nil) != X6
                          | ~ ssItem(X7) )
                      | app(X5,X6) != X4
                      | tl(X3) != X5
                      | ~ ssList(X6) )
                  | ~ ssList(X5) )
              | sK2 = X4
              | ~ ssList(X4) ) )
        & ( nil != sK0
          | nil != sK1 )
        & ( nil != X3
          | nil = sK2 )
        & ! [X8] :
            ( ~ segmentP(sK0,X8)
            | ~ segmentP(sK1,X8)
            | ~ neq(X8,nil)
            | ~ ssList(X8) )
        & sK0 = sK2
        & sK1 = X3
        & ssList(X3) )
   => ( ( ~ neq(sK3,nil)
        | ! [X4] :
            ( ! [X5] :
                ( ! [X6] :
                    ( ~ neq(nil,sK3)
                    | ! [X7] :
                        ( ~ neq(nil,sK3)
                        | hd(sK3) != X7
                        | cons(X7,nil) != X6
                        | ~ ssItem(X7) )
                    | app(X5,X6) != X4
                    | tl(sK3) != X5
                    | ~ ssList(X6) )
                | ~ ssList(X5) )
            | sK2 = X4
            | ~ ssList(X4) ) )
      & ( nil != sK0
        | nil != sK1 )
      & ( nil != sK3
        | nil = sK2 )
      & ! [X8] :
          ( ~ segmentP(sK0,X8)
          | ~ segmentP(sK1,X8)
          | ~ neq(X8,nil)
          | ~ ssList(X8) )
      & sK0 = sK2
      & sK1 = sK3
      & ssList(sK3) ) ),
    introduced(choice_axiom,[]) ).

fof(f99,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ( ~ neq(X3,nil)
                    | ! [X4] :
                        ( ! [X5] :
                            ( ! [X6] :
                                ( ~ neq(nil,X3)
                                | ! [X7] :
                                    ( ~ neq(nil,X3)
                                    | hd(X3) != X7
                                    | cons(X7,nil) != X6
                                    | ~ ssItem(X7) )
                                | app(X5,X6) != X4
                                | tl(X3) != X5
                                | ~ ssList(X6) )
                            | ~ ssList(X5) )
                        | X2 = X4
                        | ~ ssList(X4) ) )
                  & ( nil != X0
                    | nil != X1 )
                  & ( nil != X3
                    | nil = X2 )
                  & ! [X8] :
                      ( ~ segmentP(X0,X8)
                      | ~ segmentP(X1,X8)
                      | ~ neq(X8,nil)
                      | ~ ssList(X8) )
                  & 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] :
                    ( ( neq(X3,nil)
                      & ? [X4] :
                          ( ? [X5] :
                              ( ? [X6] :
                                  ( neq(nil,X3)
                                  & ? [X7] :
                                      ( neq(nil,X3)
                                      & hd(X3) = X7
                                      & cons(X7,nil) = X6
                                      & ssItem(X7) )
                                  & app(X5,X6) = X4
                                  & tl(X3) = X5
                                  & ssList(X6) )
                              & ssList(X5) )
                          & X2 != X4
                          & ssList(X4) ) )
                    | ( nil = X0
                      & nil = X1 )
                    | ( nil = X3
                      & nil != X2 )
                    | ? [X8] :
                        ( segmentP(X0,X8)
                        & segmentP(X1,X8)
                        & neq(X8,nil)
                        & ssList(X8) )
                    | X0 != X2
                    | X1 != X3
                    | ~ ssList(X3) ) ) ) ),
    inference(rectify,[],[f97]) ).

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

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

fof(f1166,plain,
    ( segmentP(sK2,sF13)
    | ~ ssList(sK2)
    | ~ ssList(nil)
    | ~ spl16_2
    | ~ spl16_3
    | ~ spl16_4 ),
    inference(superposition,[],[f1011,f1090]) ).

fof(f1090,plain,
    ( sK2 = app(sK2,nil)
    | ~ spl16_2
    | ~ spl16_3
    | ~ spl16_4 ),
    inference(forward_demodulation,[],[f1089,f263]) ).

fof(f263,plain,
    ( sK2 = sF15
    | ~ spl16_2 ),
    inference(avatar_component_clause,[],[f261]) ).

fof(f261,plain,
    ( spl16_2
  <=> sK2 = sF15 ),
    introduced(avatar_definition,[new_symbols(naming,[spl16_2])]) ).

fof(f1089,plain,
    ( sF15 = app(sK2,nil)
    | ~ spl16_2
    | ~ spl16_3
    | ~ spl16_4 ),
    inference(forward_demodulation,[],[f1088,f250]) ).

fof(f250,plain,
    app(sF14,sF13) = sF15,
    introduced(function_definition,[new_symbols(definition,[sF15])]) ).

fof(f1088,plain,
    ( app(sF14,sF13) = app(sK2,nil)
    | ~ spl16_2
    | ~ spl16_3
    | ~ spl16_4 ),
    inference(subsumption_resolution,[],[f1087,f270]) ).

fof(f1087,plain,
    ( app(sF14,sF13) = app(sK2,nil)
    | ~ ssList(sF13)
    | ~ spl16_2
    | ~ spl16_3
    | ~ spl16_4 ),
    inference(subsumption_resolution,[],[f1073,f209]) ).

fof(f1073,plain,
    ( app(sF14,sF13) = app(sK2,nil)
    | ~ ssList(nil)
    | ~ ssList(sF13)
    | ~ spl16_2
    | ~ spl16_3
    | ~ spl16_4 ),
    inference(superposition,[],[f737,f183]) ).

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

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

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

fof(f737,plain,
    ( ! [X0] :
        ( app(sK2,X0) = app(sF14,app(sF13,X0))
        | ~ ssList(X0) )
    | ~ spl16_2
    | ~ spl16_3
    | ~ spl16_4 ),
    inference(forward_demodulation,[],[f736,f263]) ).

fof(f736,plain,
    ( ! [X0] :
        ( app(sF14,app(sF13,X0)) = app(sF15,X0)
        | ~ ssList(X0) )
    | ~ spl16_3
    | ~ spl16_4 ),
    inference(subsumption_resolution,[],[f735,f266]) ).

fof(f266,plain,
    ( ssList(sF14)
    | ~ spl16_3 ),
    inference(avatar_component_clause,[],[f265]) ).

fof(f265,plain,
    ( spl16_3
  <=> ssList(sF14) ),
    introduced(avatar_definition,[new_symbols(naming,[spl16_3])]) ).

fof(f735,plain,
    ( ! [X0] :
        ( app(sF14,app(sF13,X0)) = app(sF15,X0)
        | ~ ssList(X0)
        | ~ ssList(sF14) )
    | ~ spl16_4 ),
    inference(subsumption_resolution,[],[f699,f270]) ).

fof(f699,plain,
    ! [X0] :
      ( app(sF14,app(sF13,X0)) = app(sF15,X0)
      | ~ ssList(X0)
      | ~ ssList(sF13)
      | ~ ssList(sF14) ),
    inference(superposition,[],[f187,f250]) ).

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

fof(f102,plain,
    ! [X0] :
      ( ! [X1] :
          ( ! [X2] :
              ( app(app(X0,X1),X2) = app(X0,app(X1,X2))
              | ~ ssList(X2) )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f82]) ).

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

fof(f1011,plain,
    ( ! [X0] :
        ( segmentP(app(sK2,X0),sF13)
        | ~ ssList(app(sK2,X0))
        | ~ ssList(X0) )
    | ~ spl16_2
    | ~ spl16_3
    | ~ spl16_4 ),
    inference(forward_demodulation,[],[f1010,f263]) ).

fof(f1010,plain,
    ( ! [X0] :
        ( segmentP(app(sK2,X0),sF13)
        | ~ ssList(X0)
        | ~ ssList(app(sF15,X0)) )
    | ~ spl16_2
    | ~ spl16_3
    | ~ spl16_4 ),
    inference(forward_demodulation,[],[f1009,f263]) ).

fof(f1009,plain,
    ( ! [X0] :
        ( segmentP(app(sF15,X0),sF13)
        | ~ ssList(X0)
        | ~ ssList(app(sF15,X0)) )
    | ~ spl16_3
    | ~ spl16_4 ),
    inference(subsumption_resolution,[],[f1008,f270]) ).

fof(f1008,plain,
    ( ! [X0] :
        ( segmentP(app(sF15,X0),sF13)
        | ~ ssList(X0)
        | ~ ssList(sF13)
        | ~ ssList(app(sF15,X0)) )
    | ~ spl16_3 ),
    inference(subsumption_resolution,[],[f983,f266]) ).

fof(f983,plain,
    ! [X0] :
      ( segmentP(app(sF15,X0),sF13)
      | ~ ssList(X0)
      | ~ ssList(sF14)
      | ~ ssList(sF13)
      | ~ ssList(app(sF15,X0)) ),
    inference(superposition,[],[f246,f250]) ).

fof(f246,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,[],[f232]) ).

fof(f232,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,[],[f172]) ).

fof(f172,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( ( segmentP(X0,X1)
              | ! [X2] :
                  ( ! [X3] :
                      ( app(app(X2,X1),X3) != X0
                      | ~ ssList(X3) )
                  | ~ ssList(X2) ) )
            & ( ( app(app(sK10(X0,X1),X1),sK11(X0,X1)) = X0
                & ssList(sK11(X0,X1))
                & ssList(sK10(X0,X1)) )
              | ~ segmentP(X0,X1) ) )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK10,sK11])],[f169,f171,f170]) ).

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

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

fof(f169,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,[],[f168]) ).

fof(f168,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,[],[f147]) ).

fof(f147,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(f1439,plain,
    ( ~ segmentP(sK2,sF13)
    | ~ neq(sF13,nil)
    | ~ ssList(sF13)
    | ~ spl16_3
    | ~ spl16_4
    | ~ spl16_5
    | spl16_8 ),
    inference(resolution,[],[f1428,f234]) ).

fof(f234,plain,
    ! [X8] :
      ( ~ segmentP(sK3,X8)
      | ~ segmentP(sK2,X8)
      | ~ neq(X8,nil)
      | ~ ssList(X8) ),
    inference(definition_unfolding,[],[f179,f178,f177]) ).

fof(f177,plain,
    sK1 = sK3,
    inference(cnf_transformation,[],[f152]) ).

fof(f178,plain,
    sK0 = sK2,
    inference(cnf_transformation,[],[f152]) ).

fof(f179,plain,
    ! [X8] :
      ( ~ segmentP(sK0,X8)
      | ~ segmentP(sK1,X8)
      | ~ neq(X8,nil)
      | ~ ssList(X8) ),
    inference(cnf_transformation,[],[f152]) ).

fof(f1428,plain,
    ( segmentP(sK3,sF13)
    | ~ spl16_3
    | ~ spl16_4
    | ~ spl16_5
    | spl16_8 ),
    inference(subsumption_resolution,[],[f1421,f266]) ).

fof(f1421,plain,
    ( segmentP(sK3,sF13)
    | ~ ssList(sF14)
    | ~ spl16_4
    | ~ spl16_5
    | spl16_8 ),
    inference(superposition,[],[f1336,f408]) ).

fof(f408,plain,
    ( sK3 = cons(sF12,sF14)
    | spl16_8 ),
    inference(forward_demodulation,[],[f407,f249]) ).

fof(f249,plain,
    tl(sK3) = sF14,
    introduced(function_definition,[new_symbols(definition,[sF14])]) ).

fof(f407,plain,
    ( sK3 = cons(sF12,tl(sK3))
    | spl16_8 ),
    inference(subsumption_resolution,[],[f406,f176]) ).

fof(f176,plain,
    ssList(sK3),
    inference(cnf_transformation,[],[f152]) ).

fof(f406,plain,
    ( sK3 = cons(sF12,tl(sK3))
    | ~ ssList(sK3)
    | spl16_8 ),
    inference(subsumption_resolution,[],[f397,f288]) ).

fof(f288,plain,
    ( nil != sK3
    | spl16_8 ),
    inference(avatar_component_clause,[],[f286]) ).

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

fof(f397,plain,
    ( sK3 = cons(sF12,tl(sK3))
    | nil = sK3
    | ~ ssList(sK3) ),
    inference(superposition,[],[f211,f247]) ).

fof(f247,plain,
    hd(sK3) = sF12,
    introduced(function_definition,[new_symbols(definition,[sF12])]) ).

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

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

fof(f122,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(f1336,plain,
    ( ! [X0] :
        ( segmentP(cons(sF12,X0),sF13)
        | ~ ssList(X0) )
    | ~ spl16_4
    | ~ spl16_5 ),
    inference(subsumption_resolution,[],[f1320,f270]) ).

fof(f1320,plain,
    ( ! [X0] :
        ( segmentP(cons(sF12,X0),sF13)
        | ~ ssList(X0)
        | ~ ssList(sF13) )
    | ~ spl16_5 ),
    inference(duplicate_literal_removal,[],[f1316]) ).

fof(f1316,plain,
    ( ! [X0] :
        ( segmentP(cons(sF12,X0),sF13)
        | ~ ssList(X0)
        | ~ ssList(sF13)
        | ~ ssList(X0) )
    | ~ spl16_5 ),
    inference(superposition,[],[f1005,f438]) ).

fof(f438,plain,
    ( ! [X0] :
        ( cons(sF12,X0) = app(sF13,X0)
        | ~ ssList(X0) )
    | ~ spl16_5 ),
    inference(subsumption_resolution,[],[f431,f274]) ).

fof(f431,plain,
    ! [X0] :
      ( cons(sF12,X0) = app(sF13,X0)
      | ~ ssItem(sF12)
      | ~ ssList(X0) ),
    inference(superposition,[],[f188,f248]) ).

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

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

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

fof(f1005,plain,
    ! [X0,X1] :
      ( segmentP(app(X0,X1),X0)
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(subsumption_resolution,[],[f1004,f204]) ).

fof(f204,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(f1004,plain,
    ! [X0,X1] :
      ( segmentP(app(X0,X1),X0)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ~ ssList(app(X0,X1)) ),
    inference(subsumption_resolution,[],[f993,f209]) ).

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

fof(f980,plain,
    ! [X0,X1] :
      ( segmentP(app(X0,X1),X0)
      | ~ ssList(X1)
      | ~ ssList(nil)
      | ~ ssList(X0)
      | ~ ssList(app(X0,X1))
      | ~ ssList(X0) ),
    inference(superposition,[],[f246,f191]) ).

fof(f191,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(f353,plain,
    ( spl16_6
    | spl16_8 ),
    inference(avatar_contradiction_clause,[],[f352]) ).

fof(f352,plain,
    ( $false
    | spl16_6
    | spl16_8 ),
    inference(subsumption_resolution,[],[f351,f209]) ).

fof(f351,plain,
    ( ~ ssList(nil)
    | spl16_6
    | spl16_8 ),
    inference(subsumption_resolution,[],[f350,f176]) ).

fof(f350,plain,
    ( ~ ssList(sK3)
    | ~ ssList(nil)
    | spl16_6
    | spl16_8 ),
    inference(subsumption_resolution,[],[f349,f288]) ).

fof(f349,plain,
    ( nil = sK3
    | ~ ssList(sK3)
    | ~ ssList(nil)
    | spl16_6 ),
    inference(resolution,[],[f279,f206]) ).

fof(f279,plain,
    ( ~ neq(nil,sK3)
    | spl16_6 ),
    inference(avatar_component_clause,[],[f277]) ).

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

fof(f348,plain,
    ( spl16_7
    | spl16_8 ),
    inference(avatar_contradiction_clause,[],[f347]) ).

fof(f347,plain,
    ( $false
    | spl16_7
    | spl16_8 ),
    inference(subsumption_resolution,[],[f346,f176]) ).

fof(f346,plain,
    ( ~ ssList(sK3)
    | spl16_7
    | spl16_8 ),
    inference(subsumption_resolution,[],[f345,f209]) ).

fof(f345,plain,
    ( ~ ssList(nil)
    | ~ ssList(sK3)
    | spl16_7
    | spl16_8 ),
    inference(subsumption_resolution,[],[f340,f288]) ).

fof(f340,plain,
    ( nil = sK3
    | ~ ssList(nil)
    | ~ ssList(sK3)
    | spl16_7 ),
    inference(resolution,[],[f206,f283]) ).

fof(f283,plain,
    ( ~ neq(sK3,nil)
    | spl16_7 ),
    inference(avatar_component_clause,[],[f281]) ).

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

fof(f330,plain,
    ( ~ spl16_3
    | spl16_1
    | ~ spl16_4 ),
    inference(avatar_split_clause,[],[f329,f269,f257,f265]) ).

fof(f257,plain,
    ( spl16_1
  <=> ssList(sF15) ),
    introduced(avatar_definition,[new_symbols(naming,[spl16_1])]) ).

fof(f329,plain,
    ( ssList(sF15)
    | ~ ssList(sF14)
    | ~ spl16_4 ),
    inference(subsumption_resolution,[],[f308,f270]) ).

fof(f308,plain,
    ( ssList(sF15)
    | ~ ssList(sF13)
    | ~ ssList(sF14) ),
    inference(superposition,[],[f204,f250]) ).

fof(f328,plain,
    ( spl16_3
    | spl16_8 ),
    inference(avatar_split_clause,[],[f327,f286,f265]) ).

fof(f327,plain,
    ( ssList(sF14)
    | spl16_8 ),
    inference(subsumption_resolution,[],[f326,f176]) ).

fof(f326,plain,
    ( ssList(sF14)
    | ~ ssList(sK3)
    | spl16_8 ),
    inference(subsumption_resolution,[],[f321,f288]) ).

fof(f321,plain,
    ( ssList(sF14)
    | nil = sK3
    | ~ ssList(sK3) ),
    inference(superposition,[],[f221,f249]) ).

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

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

fof(f136,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(f320,plain,
    ( spl16_5
    | spl16_8 ),
    inference(avatar_split_clause,[],[f319,f286,f273]) ).

fof(f319,plain,
    ( ssItem(sF12)
    | spl16_8 ),
    inference(subsumption_resolution,[],[f318,f176]) ).

fof(f318,plain,
    ( ssItem(sF12)
    | ~ ssList(sK3)
    | spl16_8 ),
    inference(subsumption_resolution,[],[f313,f288]) ).

fof(f313,plain,
    ( ssItem(sF12)
    | nil = sK3
    | ~ ssList(sK3) ),
    inference(superposition,[],[f216,f247]) ).

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

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

fof(f129,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(f307,plain,
    ( ~ spl16_5
    | spl16_4 ),
    inference(avatar_split_clause,[],[f306,f269,f273]) ).

fof(f306,plain,
    ( ssList(sF13)
    | ~ ssItem(sF12) ),
    inference(subsumption_resolution,[],[f305,f209]) ).

fof(f305,plain,
    ( ssList(sF13)
    | ~ ssItem(sF12)
    | ~ ssList(nil) ),
    inference(superposition,[],[f203,f248]) ).

fof(f203,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(f294,plain,
    ( spl16_9
    | ~ spl16_8 ),
    inference(avatar_split_clause,[],[f180,f286,f290]) ).

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

fof(f180,plain,
    ( nil != sK3
    | nil = sK2 ),
    inference(cnf_transformation,[],[f152]) ).

fof(f293,plain,
    ( ~ spl16_8
    | ~ spl16_9 ),
    inference(avatar_split_clause,[],[f233,f290,f286]) ).

fof(f233,plain,
    ( nil != sK2
    | nil != sK3 ),
    inference(definition_unfolding,[],[f181,f178,f177]) ).

fof(f181,plain,
    ( nil != sK0
    | nil != sK1 ),
    inference(cnf_transformation,[],[f152]) ).

fof(f284,plain,
    ( ~ spl16_1
    | spl16_2
    | ~ spl16_3
    | ~ spl16_4
    | ~ spl16_5
    | ~ spl16_6
    | ~ spl16_7 ),
    inference(avatar_split_clause,[],[f255,f281,f277,f273,f269,f265,f261,f257]) ).

fof(f255,plain,
    ( ~ neq(sK3,nil)
    | ~ neq(nil,sK3)
    | ~ ssItem(sF12)
    | ~ ssList(sF13)
    | ~ ssList(sF14)
    | sK2 = sF15
    | ~ ssList(sF15) ),
    inference(duplicate_literal_removal,[],[f251]) ).

fof(f251,plain,
    ( ~ neq(sK3,nil)
    | ~ neq(nil,sK3)
    | ~ neq(nil,sK3)
    | ~ ssItem(sF12)
    | ~ ssList(sF13)
    | ~ ssList(sF14)
    | sK2 = sF15
    | ~ ssList(sF15) ),
    inference(definition_folding,[],[f240,f250,f248,f247,f249,f250,f248,f247,f249,f249,f248,f247,f247]) ).

fof(f240,plain,
    ( ~ neq(sK3,nil)
    | ~ neq(nil,sK3)
    | ~ neq(nil,sK3)
    | ~ ssItem(hd(sK3))
    | ~ ssList(cons(hd(sK3),nil))
    | ~ ssList(tl(sK3))
    | sK2 = app(tl(sK3),cons(hd(sK3),nil))
    | ~ ssList(app(tl(sK3),cons(hd(sK3),nil))) ),
    inference(equality_resolution,[],[f239]) ).

fof(f239,plain,
    ! [X5] :
      ( ~ neq(sK3,nil)
      | ~ neq(nil,sK3)
      | ~ neq(nil,sK3)
      | ~ ssItem(hd(sK3))
      | tl(sK3) != X5
      | ~ ssList(cons(hd(sK3),nil))
      | ~ ssList(X5)
      | sK2 = app(X5,cons(hd(sK3),nil))
      | ~ ssList(app(X5,cons(hd(sK3),nil))) ),
    inference(equality_resolution,[],[f238]) ).

fof(f238,plain,
    ! [X4,X5] :
      ( ~ neq(sK3,nil)
      | ~ neq(nil,sK3)
      | ~ neq(nil,sK3)
      | ~ ssItem(hd(sK3))
      | app(X5,cons(hd(sK3),nil)) != X4
      | tl(sK3) != X5
      | ~ ssList(cons(hd(sK3),nil))
      | ~ ssList(X5)
      | sK2 = X4
      | ~ ssList(X4) ),
    inference(equality_resolution,[],[f237]) ).

fof(f237,plain,
    ! [X6,X4,X5] :
      ( ~ neq(sK3,nil)
      | ~ neq(nil,sK3)
      | ~ neq(nil,sK3)
      | cons(hd(sK3),nil) != X6
      | ~ ssItem(hd(sK3))
      | app(X5,X6) != X4
      | tl(sK3) != X5
      | ~ ssList(X6)
      | ~ ssList(X5)
      | sK2 = X4
      | ~ ssList(X4) ),
    inference(equality_resolution,[],[f182]) ).

fof(f182,plain,
    ! [X6,X7,X4,X5] :
      ( ~ neq(sK3,nil)
      | ~ neq(nil,sK3)
      | ~ neq(nil,sK3)
      | hd(sK3) != X7
      | cons(X7,nil) != X6
      | ~ ssItem(X7)
      | app(X5,X6) != X4
      | tl(sK3) != X5
      | ~ ssList(X6)
      | ~ ssList(X5)
      | sK2 = X4
      | ~ ssList(X4) ),
    inference(cnf_transformation,[],[f152]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11  % Problem    : SWC072+1 : TPTP v8.2.0. Released v2.4.0.
% 0.09/0.12  % 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.12/0.33  % Computer : n020.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Sun May 19 03:55:38 EDT 2024
% 0.12/0.33  % CPUTime    : 
% 0.12/0.33  This is a FOF_THM_RFO_SEQ problem
% 0.12/0.34  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.54/0.70  % (25867)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.54/0.70  % (25870)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.54/0.70  % (25869)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.54/0.70  % (25868)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.54/0.70  % (25871)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.54/0.70  % (25872)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.54/0.70  % (25873)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.54/0.70  % (25874)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.54/0.72  % (25867)Instruction limit reached!
% 0.54/0.72  % (25867)------------------------------
% 0.54/0.72  % (25867)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.72  % (25867)Termination reason: Unknown
% 0.54/0.72  % (25867)Termination phase: Saturation
% 0.54/0.72  
% 0.54/0.72  % (25867)Memory used [KB]: 1611
% 0.54/0.72  % (25867)Time elapsed: 0.013 s
% 0.54/0.72  % (25867)Instructions burned: 36 (million)
% 0.54/0.72  % (25867)------------------------------
% 0.54/0.72  % (25867)------------------------------
% 0.54/0.72  % (25875)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 (2996ds/55Mi)
% 0.54/0.72  % (25870)Instruction limit reached!
% 0.54/0.72  % (25870)------------------------------
% 0.54/0.72  % (25870)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.72  % (25870)Termination reason: Unknown
% 0.54/0.72  % (25871)Instruction limit reached!
% 0.54/0.72  % (25871)------------------------------
% 0.54/0.72  % (25871)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.72  % (25871)Termination reason: Unknown
% 0.54/0.72  % (25871)Termination phase: Saturation
% 0.54/0.72  
% 0.54/0.72  % (25871)Memory used [KB]: 2063
% 0.54/0.72  % (25871)Time elapsed: 0.017 s
% 0.54/0.72  % (25871)Instructions burned: 34 (million)
% 0.54/0.72  % (25871)------------------------------
% 0.54/0.72  % (25871)------------------------------
% 0.54/0.72  % (25870)Termination phase: Saturation
% 0.54/0.72  
% 0.54/0.72  % (25870)Memory used [KB]: 1694
% 0.54/0.72  % (25870)Time elapsed: 0.017 s
% 0.54/0.72  % (25870)Instructions burned: 34 (million)
% 0.54/0.72  % (25870)------------------------------
% 0.54/0.72  % (25870)------------------------------
% 0.54/0.72  % (25876)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 (2996ds/50Mi)
% 0.54/0.72  % (25877)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 (2996ds/208Mi)
% 0.54/0.73  % (25872)Instruction limit reached!
% 0.54/0.73  % (25872)------------------------------
% 0.54/0.73  % (25872)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.73  % (25872)Termination reason: Unknown
% 0.54/0.73  % (25872)Termination phase: Saturation
% 0.54/0.73  
% 0.54/0.73  % (25872)Memory used [KB]: 1622
% 0.54/0.73  % (25872)Time elapsed: 0.024 s
% 0.54/0.73  % (25872)Instructions burned: 45 (million)
% 0.54/0.73  % (25872)------------------------------
% 0.54/0.73  % (25872)------------------------------
% 0.54/0.73  % (25868)Instruction limit reached!
% 0.54/0.73  % (25868)------------------------------
% 0.54/0.73  % (25868)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.73  % (25868)Termination reason: Unknown
% 0.54/0.73  % (25868)Termination phase: Saturation
% 0.54/0.73  
% 0.54/0.73  % (25868)Memory used [KB]: 2030
% 0.54/0.73  % (25868)Time elapsed: 0.026 s
% 0.54/0.73  % (25868)Instructions burned: 52 (million)
% 0.54/0.73  % (25868)------------------------------
% 0.54/0.73  % (25868)------------------------------
% 0.54/0.73  % (25879)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 (2996ds/518Mi)
% 0.54/0.73  % (25874)Instruction limit reached!
% 0.54/0.73  % (25874)------------------------------
% 0.54/0.73  % (25874)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.73  % (25874)Termination reason: Unknown
% 0.54/0.73  % (25874)Termination phase: Saturation
% 0.54/0.73  
% 0.54/0.73  % (25874)Memory used [KB]: 1660
% 0.54/0.73  % (25874)Time elapsed: 0.030 s
% 0.54/0.73  % (25874)Instructions burned: 56 (million)
% 0.54/0.73  % (25874)------------------------------
% 0.54/0.73  % (25874)------------------------------
% 0.54/0.73  % (25878)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 (2996ds/52Mi)
% 0.54/0.73  % (25875)Instruction limit reached!
% 0.54/0.73  % (25875)------------------------------
% 0.54/0.73  % (25875)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.73  % (25875)Termination reason: Unknown
% 0.54/0.73  % (25875)Termination phase: Saturation
% 0.54/0.73  
% 0.54/0.73  % (25875)Memory used [KB]: 2135
% 0.54/0.73  % (25875)Time elapsed: 0.017 s
% 0.54/0.73  % (25875)Instructions burned: 55 (million)
% 0.54/0.73  % (25875)------------------------------
% 0.54/0.73  % (25875)------------------------------
% 0.54/0.74  % (25880)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 (2996ds/42Mi)
% 0.54/0.74  % (25881)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 (2996ds/243Mi)
% 0.54/0.74  % (25873)Instruction limit reached!
% 0.54/0.74  % (25873)------------------------------
% 0.54/0.74  % (25873)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.74  % (25873)Termination reason: Unknown
% 0.54/0.74  % (25873)Termination phase: Saturation
% 0.54/0.74  
% 0.54/0.74  % (25873)Memory used [KB]: 2118
% 0.54/0.74  % (25873)Time elapsed: 0.038 s
% 0.54/0.74  % (25873)Instructions burned: 83 (million)
% 0.54/0.74  % (25873)------------------------------
% 0.54/0.74  % (25873)------------------------------
% 0.54/0.74  % (25876)Instruction limit reached!
% 0.54/0.74  % (25876)------------------------------
% 0.54/0.74  % (25876)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.74  % (25876)Termination reason: Unknown
% 0.54/0.74  % (25876)Termination phase: Saturation
% 0.54/0.74  
% 0.54/0.74  % (25876)Memory used [KB]: 1856
% 0.54/0.74  % (25876)Time elapsed: 0.023 s
% 0.54/0.74  % (25876)Instructions burned: 50 (million)
% 0.54/0.74  % (25876)------------------------------
% 0.54/0.74  % (25876)------------------------------
% 0.54/0.74  % (25882)lrs+1011_2:9_sil=2000:lsd=10:newcnf=on:i=117:sd=2:awrs=decay:ss=included:amm=off:ep=R_0 on theBenchmark for (2996ds/117Mi)
% 0.54/0.75  % (25869)Instruction limit reached!
% 0.54/0.75  % (25869)------------------------------
% 0.54/0.75  % (25869)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.75  % (25869)Termination reason: Unknown
% 0.54/0.75  % (25869)Termination phase: Saturation
% 0.54/0.75  
% 0.54/0.75  % (25869)Memory used [KB]: 1893
% 0.54/0.75  % (25869)Time elapsed: 0.043 s
% 0.54/0.75  % (25869)Instructions burned: 79 (million)
% 0.54/0.75  % (25869)------------------------------
% 0.54/0.75  % (25869)------------------------------
% 0.54/0.75  % (25884)lrs+1011_1:2_to=lpo:sil=8000:plsqc=1:plsq=on:plsqr=326,59:sp=weighted_frequency:plsql=on:nwc=10.0:newcnf=on:i=93:awrs=converge:awrsf=200:bd=off:ins=1:rawr=on:alpa=false:avsq=on:avsqr=1,16_0 on theBenchmark for (2996ds/93Mi)
% 0.54/0.75  % (25883)dis+1011_11:1_sil=2000:avsq=on:i=143:avsqr=1,16:ep=RS:rawr=on:aac=none:lsd=100:mep=off:fde=none:newcnf=on:bsr=unit_only_0 on theBenchmark for (2996ds/143Mi)
% 0.54/0.75  % (25880)Instruction limit reached!
% 0.54/0.75  % (25880)------------------------------
% 0.54/0.75  % (25880)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.75  % (25880)Termination reason: Unknown
% 0.54/0.75  % (25880)Termination phase: Saturation
% 0.54/0.75  
% 0.54/0.75  % (25880)Memory used [KB]: 2139
% 0.54/0.75  % (25880)Time elapsed: 0.015 s
% 0.54/0.75  % (25880)Instructions burned: 44 (million)
% 0.54/0.75  % (25880)------------------------------
% 0.54/0.75  % (25880)------------------------------
% 0.54/0.75  % (25877)First to succeed.
% 0.54/0.75  % (25885)lrs+1666_1:1_sil=4000:sp=occurrence:sos=on:urr=on:newcnf=on:i=62:amm=off:ep=R:erd=off:nm=0:plsq=on:plsqr=14,1_0 on theBenchmark for (2995ds/62Mi)
% 0.54/0.76  % (25877)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-25866"
% 0.54/0.76  % (25877)Refutation found. Thanks to Tanya!
% 0.54/0.76  % SZS status Theorem for theBenchmark
% 0.54/0.76  % SZS output start Proof for theBenchmark
% See solution above
% 0.54/0.76  % (25877)------------------------------
% 0.54/0.76  % (25877)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.76  % (25877)Termination reason: Refutation
% 0.54/0.76  
% 0.54/0.76  % (25877)Memory used [KB]: 1557
% 0.54/0.76  % (25877)Time elapsed: 0.033 s
% 0.54/0.76  % (25877)Instructions burned: 65 (million)
% 0.54/0.76  % (25866)Success in time 0.41 s
% 0.54/0.76  % Vampire---4.8 exiting
%------------------------------------------------------------------------------