TSTP Solution File: SWC090+1 by iProver---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : SWC090+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n003.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 : Fri May  3 03:11:11 EDT 2024

% Result   : Theorem 10.28s 2.09s
% Output   : CNFRefutation 10.28s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named definition)

% Comments : 
%------------------------------------------------------------------------------
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(f15,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ( neq(X0,X1)
          <=> X0 != X1 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax15) ).

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

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

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

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

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

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

fof(f98,plain,
    ~ ! [X0] :
        ( ssList(X0)
       => ! [X1] :
            ( ssList(X1)
           => ! [X2] :
                ( ssList(X2)
               => ! [X3] :
                    ( ssList(X3)
                   => ( ! [X4] :
                          ( ssList(X4)
                         => ! [X5] :
                              ( ssList(X5)
                             => ( app(X5,X4) != X2
                                | app(X4,X5) != X3 ) ) )
                      | ? [X6] :
                          ( segmentP(X0,X6)
                          & segmentP(X1,X6)
                          & neq(X6,nil)
                          & ssList(X6) )
                      | ~ neq(X1,nil)
                      | X0 != X2
                      | X1 != X3 ) ) ) ) ),
    inference(rectify,[],[f97]) ).

fof(f104,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(f119,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( neq(X0,X1)
          <=> X0 != X1 )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f15]) ).

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

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

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

fof(f222,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ? [X4] :
                      ( ? [X5] :
                          ( app(X5,X4) = X2
                          & app(X4,X5) = X3
                          & ssList(X5) )
                      & ssList(X4) )
                  & ! [X6] :
                      ( ~ segmentP(X0,X6)
                      | ~ segmentP(X1,X6)
                      | ~ neq(X6,nil)
                      | ~ ssList(X6) )
                  & neq(X1,nil)
                  & X0 = X2
                  & X1 = X3
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(ennf_transformation,[],[f98]) ).

fof(f223,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ? [X4] :
                      ( ? [X5] :
                          ( app(X5,X4) = X2
                          & app(X4,X5) = X3
                          & ssList(X5) )
                      & ssList(X4) )
                  & ! [X6] :
                      ( ~ segmentP(X0,X6)
                      | ~ segmentP(X1,X6)
                      | ~ neq(X6,nil)
                      | ~ ssList(X6) )
                  & neq(X1,nil)
                  & X0 = X2
                  & X1 = X3
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(flattening,[],[f222]) ).

fof(f254,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,[],[f104]) ).

fof(f255,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,[],[f254]) ).

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

fof(f257,plain,
    ! [X0,X1] :
      ( ? [X5] :
          ( app(app(sK13(X0,X1),X1),X5) = X0
          & ssList(X5) )
     => ( app(app(sK13(X0,X1),X1),sK14(X0,X1)) = X0
        & ssList(sK14(X0,X1)) ) ),
    introduced(choice_axiom,[]) ).

fof(f258,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( ( segmentP(X0,X1)
              | ! [X2] :
                  ( ! [X3] :
                      ( app(app(X2,X1),X3) != X0
                      | ~ ssList(X3) )
                  | ~ ssList(X2) ) )
            & ( ( app(app(sK13(X0,X1),X1),sK14(X0,X1)) = X0
                & ssList(sK14(X0,X1))
                & ssList(sK13(X0,X1)) )
              | ~ segmentP(X0,X1) ) )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK13,sK14])],[f255,f257,f256]) ).

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

fof(f344,plain,
    ( ? [X0] :
        ( ? [X1] :
            ( ? [X2] :
                ( ? [X3] :
                    ( ? [X4] :
                        ( ? [X5] :
                            ( app(X5,X4) = X2
                            & app(X4,X5) = X3
                            & ssList(X5) )
                        & ssList(X4) )
                    & ! [X6] :
                        ( ~ segmentP(X0,X6)
                        | ~ segmentP(X1,X6)
                        | ~ neq(X6,nil)
                        | ~ ssList(X6) )
                    & neq(X1,nil)
                    & X0 = X2
                    & X1 = X3
                    & ssList(X3) )
                & ssList(X2) )
            & ssList(X1) )
        & ssList(X0) )
   => ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ? [X4] :
                      ( ? [X5] :
                          ( app(X5,X4) = X2
                          & app(X4,X5) = X3
                          & ssList(X5) )
                      & ssList(X4) )
                  & ! [X6] :
                      ( ~ segmentP(sK53,X6)
                      | ~ segmentP(X1,X6)
                      | ~ neq(X6,nil)
                      | ~ ssList(X6) )
                  & neq(X1,nil)
                  & sK53 = X2
                  & X1 = X3
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(sK53) ) ),
    introduced(choice_axiom,[]) ).

fof(f345,plain,
    ( ? [X1] :
        ( ? [X2] :
            ( ? [X3] :
                ( ? [X4] :
                    ( ? [X5] :
                        ( app(X5,X4) = X2
                        & app(X4,X5) = X3
                        & ssList(X5) )
                    & ssList(X4) )
                & ! [X6] :
                    ( ~ segmentP(sK53,X6)
                    | ~ segmentP(X1,X6)
                    | ~ neq(X6,nil)
                    | ~ ssList(X6) )
                & neq(X1,nil)
                & sK53 = X2
                & X1 = X3
                & ssList(X3) )
            & ssList(X2) )
        & ssList(X1) )
   => ( ? [X2] :
          ( ? [X3] :
              ( ? [X4] :
                  ( ? [X5] :
                      ( app(X5,X4) = X2
                      & app(X4,X5) = X3
                      & ssList(X5) )
                  & ssList(X4) )
              & ! [X6] :
                  ( ~ segmentP(sK53,X6)
                  | ~ segmentP(sK54,X6)
                  | ~ neq(X6,nil)
                  | ~ ssList(X6) )
              & neq(sK54,nil)
              & sK53 = X2
              & sK54 = X3
              & ssList(X3) )
          & ssList(X2) )
      & ssList(sK54) ) ),
    introduced(choice_axiom,[]) ).

fof(f346,plain,
    ( ? [X2] :
        ( ? [X3] :
            ( ? [X4] :
                ( ? [X5] :
                    ( app(X5,X4) = X2
                    & app(X4,X5) = X3
                    & ssList(X5) )
                & ssList(X4) )
            & ! [X6] :
                ( ~ segmentP(sK53,X6)
                | ~ segmentP(sK54,X6)
                | ~ neq(X6,nil)
                | ~ ssList(X6) )
            & neq(sK54,nil)
            & sK53 = X2
            & sK54 = X3
            & ssList(X3) )
        & ssList(X2) )
   => ( ? [X3] :
          ( ? [X4] :
              ( ? [X5] :
                  ( app(X5,X4) = sK55
                  & app(X4,X5) = X3
                  & ssList(X5) )
              & ssList(X4) )
          & ! [X6] :
              ( ~ segmentP(sK53,X6)
              | ~ segmentP(sK54,X6)
              | ~ neq(X6,nil)
              | ~ ssList(X6) )
          & neq(sK54,nil)
          & sK53 = sK55
          & sK54 = X3
          & ssList(X3) )
      & ssList(sK55) ) ),
    introduced(choice_axiom,[]) ).

fof(f347,plain,
    ( ? [X3] :
        ( ? [X4] :
            ( ? [X5] :
                ( app(X5,X4) = sK55
                & app(X4,X5) = X3
                & ssList(X5) )
            & ssList(X4) )
        & ! [X6] :
            ( ~ segmentP(sK53,X6)
            | ~ segmentP(sK54,X6)
            | ~ neq(X6,nil)
            | ~ ssList(X6) )
        & neq(sK54,nil)
        & sK53 = sK55
        & sK54 = X3
        & ssList(X3) )
   => ( ? [X4] :
          ( ? [X5] :
              ( app(X5,X4) = sK55
              & app(X4,X5) = sK56
              & ssList(X5) )
          & ssList(X4) )
      & ! [X6] :
          ( ~ segmentP(sK53,X6)
          | ~ segmentP(sK54,X6)
          | ~ neq(X6,nil)
          | ~ ssList(X6) )
      & neq(sK54,nil)
      & sK53 = sK55
      & sK54 = sK56
      & ssList(sK56) ) ),
    introduced(choice_axiom,[]) ).

fof(f348,plain,
    ( ? [X4] :
        ( ? [X5] :
            ( app(X5,X4) = sK55
            & app(X4,X5) = sK56
            & ssList(X5) )
        & ssList(X4) )
   => ( ? [X5] :
          ( sK55 = app(X5,sK57)
          & sK56 = app(sK57,X5)
          & ssList(X5) )
      & ssList(sK57) ) ),
    introduced(choice_axiom,[]) ).

fof(f349,plain,
    ( ? [X5] :
        ( sK55 = app(X5,sK57)
        & sK56 = app(sK57,X5)
        & ssList(X5) )
   => ( sK55 = app(sK58,sK57)
      & sK56 = app(sK57,sK58)
      & ssList(sK58) ) ),
    introduced(choice_axiom,[]) ).

fof(f350,plain,
    ( sK55 = app(sK58,sK57)
    & sK56 = app(sK57,sK58)
    & ssList(sK58)
    & ssList(sK57)
    & ! [X6] :
        ( ~ segmentP(sK53,X6)
        | ~ segmentP(sK54,X6)
        | ~ neq(X6,nil)
        | ~ ssList(X6) )
    & neq(sK54,nil)
    & sK53 = sK55
    & sK54 = sK56
    & ssList(sK56)
    & ssList(sK55)
    & ssList(sK54)
    & ssList(sK53) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57,sK58])],[f223,f349,f348,f347,f346,f345,f344]) ).

fof(f372,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,[],[f258]) ).

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

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

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

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

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

fof(f550,plain,
    ssList(sK53),
    inference(cnf_transformation,[],[f350]) ).

fof(f551,plain,
    ssList(sK54),
    inference(cnf_transformation,[],[f350]) ).

fof(f554,plain,
    sK54 = sK56,
    inference(cnf_transformation,[],[f350]) ).

fof(f555,plain,
    sK53 = sK55,
    inference(cnf_transformation,[],[f350]) ).

fof(f556,plain,
    neq(sK54,nil),
    inference(cnf_transformation,[],[f350]) ).

fof(f557,plain,
    ! [X6] :
      ( ~ segmentP(sK53,X6)
      | ~ segmentP(sK54,X6)
      | ~ neq(X6,nil)
      | ~ ssList(X6) ),
    inference(cnf_transformation,[],[f350]) ).

fof(f558,plain,
    ssList(sK57),
    inference(cnf_transformation,[],[f350]) ).

fof(f559,plain,
    ssList(sK58),
    inference(cnf_transformation,[],[f350]) ).

fof(f560,plain,
    sK56 = app(sK57,sK58),
    inference(cnf_transformation,[],[f350]) ).

fof(f561,plain,
    sK55 = app(sK58,sK57),
    inference(cnf_transformation,[],[f350]) ).

fof(f562,plain,
    ! [X6] :
      ( ~ segmentP(sK55,X6)
      | ~ segmentP(sK56,X6)
      | ~ neq(X6,nil)
      | ~ ssList(X6) ),
    inference(definition_unfolding,[],[f557,f555,f554]) ).

fof(f563,plain,
    neq(sK56,nil),
    inference(definition_unfolding,[],[f556,f554]) ).

fof(f564,plain,
    ssList(sK56),
    inference(definition_unfolding,[],[f551,f554]) ).

fof(f565,plain,
    ssList(sK55),
    inference(definition_unfolding,[],[f550,f555]) ).

fof(f571,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,[],[f372]) ).

cnf(c_67,plain,
    ( ~ ssList(app(app(X0,X1),X2))
    | ~ ssList(X0)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | segmentP(app(app(X0,X1),X2),X1) ),
    inference(cnf_transformation,[],[f571]) ).

cnf(c_138,plain,
    ( ~ ssList(X0)
    | ~ ssList(X1)
    | X0 = X1
    | neq(X0,X1) ),
    inference(cnf_transformation,[],[f441]) ).

cnf(c_139,plain,
    ( ~ neq(X0,X0)
    | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f595]) ).

cnf(c_141,plain,
    ssList(nil),
    inference(cnf_transformation,[],[f443]) ).

cnf(c_153,plain,
    ( ~ ssList(X0)
    | ~ ssList(X1)
    | ssList(app(X0,X1)) ),
    inference(cnf_transformation,[],[f455]) ).

cnf(c_155,plain,
    ( ~ ssList(X0)
    | app(nil,X0) = X0 ),
    inference(cnf_transformation,[],[f457]) ).

cnf(c_232,plain,
    ( ~ ssList(X0)
    | app(X0,nil) = X0 ),
    inference(cnf_transformation,[],[f536]) ).

cnf(c_246,negated_conjecture,
    app(sK58,sK57) = sK55,
    inference(cnf_transformation,[],[f561]) ).

cnf(c_247,negated_conjecture,
    app(sK57,sK58) = sK56,
    inference(cnf_transformation,[],[f560]) ).

cnf(c_248,negated_conjecture,
    ssList(sK58),
    inference(cnf_transformation,[],[f559]) ).

cnf(c_249,negated_conjecture,
    ssList(sK57),
    inference(cnf_transformation,[],[f558]) ).

cnf(c_250,negated_conjecture,
    ( ~ neq(X0,nil)
    | ~ segmentP(sK55,X0)
    | ~ segmentP(sK56,X0)
    | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f562]) ).

cnf(c_251,negated_conjecture,
    neq(sK56,nil),
    inference(cnf_transformation,[],[f563]) ).

cnf(c_254,negated_conjecture,
    ssList(sK56),
    inference(cnf_transformation,[],[f564]) ).

cnf(c_255,negated_conjecture,
    ssList(sK55),
    inference(cnf_transformation,[],[f565]) ).

cnf(c_3221,plain,
    ( X0 != X1
    | X2 != nil
    | ~ segmentP(sK55,X1)
    | ~ segmentP(sK56,X1)
    | ~ ssList(X0)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | X0 = X2 ),
    inference(resolution_lifted,[status(thm)],[c_138,c_250]) ).

cnf(c_3222,plain,
    ( ~ segmentP(sK55,X0)
    | ~ segmentP(sK56,X0)
    | ~ ssList(X0)
    | ~ ssList(nil)
    | X0 = nil ),
    inference(unflattening,[status(thm)],[c_3221]) ).

cnf(c_3224,plain,
    ( ~ ssList(X0)
    | ~ segmentP(sK56,X0)
    | ~ segmentP(sK55,X0)
    | X0 = nil ),
    inference(global_subsumption_just,[status(thm)],[c_3222,c_141,c_3222]) ).

cnf(c_3225,plain,
    ( ~ segmentP(sK55,X0)
    | ~ segmentP(sK56,X0)
    | ~ ssList(X0)
    | X0 = nil ),
    inference(renaming,[status(thm)],[c_3224]) ).

cnf(c_3243,plain,
    ( X0 != nil
    | X0 != sK56
    | ~ ssList(X0) ),
    inference(resolution_lifted,[status(thm)],[c_139,c_251]) ).

cnf(c_3244,plain,
    ( nil != sK56
    | ~ ssList(nil) ),
    inference(unflattening,[status(thm)],[c_3243]) ).

cnf(c_3245,plain,
    nil != sK56,
    inference(global_subsumption_just,[status(thm)],[c_3244,c_141,c_3244]) ).

cnf(c_8878,plain,
    app(sK57,sK58) = sP0_iProver_def,
    definition ).

cnf(c_8879,plain,
    app(sK58,sK57) = sP1_iProver_def,
    definition ).

cnf(c_8880,negated_conjecture,
    ssList(sK55),
    inference(demodulation,[status(thm)],[c_255]) ).

cnf(c_8881,negated_conjecture,
    ssList(sK56),
    inference(demodulation,[status(thm)],[c_254]) ).

cnf(c_8882,negated_conjecture,
    ssList(sK57),
    inference(demodulation,[status(thm)],[c_249]) ).

cnf(c_8883,negated_conjecture,
    ssList(sK58),
    inference(demodulation,[status(thm)],[c_248]) ).

cnf(c_8884,negated_conjecture,
    sP0_iProver_def = sK56,
    inference(demodulation,[status(thm)],[c_247,c_8878]) ).

cnf(c_8885,negated_conjecture,
    sP1_iProver_def = sK55,
    inference(demodulation,[status(thm)],[c_246,c_8879]) ).

cnf(c_11717,plain,
    ssList(sP1_iProver_def),
    inference(light_normalisation,[status(thm)],[c_8880,c_8885]) ).

cnf(c_11718,plain,
    ssList(sP0_iProver_def),
    inference(light_normalisation,[status(thm)],[c_8881,c_8884]) ).

cnf(c_11719,plain,
    nil != sP0_iProver_def,
    inference(light_normalisation,[status(thm)],[c_3245,c_8884]) ).

cnf(c_11723,plain,
    ( ~ segmentP(sP0_iProver_def,X0)
    | ~ segmentP(sP1_iProver_def,X0)
    | ~ ssList(X0)
    | X0 = nil ),
    inference(light_normalisation,[status(thm)],[c_3225,c_8884,c_8885]) ).

cnf(c_12051,plain,
    app(nil,sK58) = sK58,
    inference(superposition,[status(thm)],[c_8883,c_155]) ).

cnf(c_12054,plain,
    app(nil,sP0_iProver_def) = sP0_iProver_def,
    inference(superposition,[status(thm)],[c_11718,c_155]) ).

cnf(c_12132,plain,
    app(sK57,nil) = sK57,
    inference(superposition,[status(thm)],[c_8882,c_232]) ).

cnf(c_12133,plain,
    app(sP1_iProver_def,nil) = sP1_iProver_def,
    inference(superposition,[status(thm)],[c_11717,c_232]) ).

cnf(c_12134,plain,
    app(sP0_iProver_def,nil) = sP0_iProver_def,
    inference(superposition,[status(thm)],[c_11718,c_232]) ).

cnf(c_12258,plain,
    ( ~ ssList(X0)
    | ~ ssList(X1)
    | app(app(X0,X1),nil) = app(X0,X1) ),
    inference(superposition,[status(thm)],[c_153,c_232]) ).

cnf(c_13784,plain,
    ( ~ ssList(X0)
    | app(app(sK58,X0),nil) = app(sK58,X0) ),
    inference(superposition,[status(thm)],[c_8883,c_12258]) ).

cnf(c_14989,plain,
    app(app(sK58,sP0_iProver_def),nil) = app(sK58,sP0_iProver_def),
    inference(superposition,[status(thm)],[c_11718,c_13784]) ).

cnf(c_27151,plain,
    ( ~ ssList(app(X0,X1))
    | ~ ssList(X2)
    | ssList(app(app(X0,X1),X2)) ),
    inference(instantiation,[status(thm)],[c_153]) ).

cnf(c_28738,plain,
    ( ~ ssList(X0)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | segmentP(app(app(X0,X1),X2),X1) ),
    inference(global_subsumption_just,[status(thm)],[c_67,c_153,c_67,c_27151]) ).

cnf(c_28751,plain,
    ( ~ ssList(nil)
    | ~ ssList(sK58)
    | ~ ssList(sP0_iProver_def)
    | segmentP(app(sK58,sP0_iProver_def),sP0_iProver_def) ),
    inference(superposition,[status(thm)],[c_14989,c_28738]) ).

cnf(c_28764,plain,
    ( ~ ssList(X0)
    | ~ ssList(sK58)
    | ~ ssList(sK57)
    | segmentP(app(sP1_iProver_def,X0),sK57) ),
    inference(superposition,[status(thm)],[c_8879,c_28738]) ).

cnf(c_28765,plain,
    ( ~ ssList(X0)
    | ~ ssList(sK58)
    | ~ ssList(sK57)
    | segmentP(app(sP0_iProver_def,X0),sK58) ),
    inference(superposition,[status(thm)],[c_8878,c_28738]) ).

cnf(c_28768,plain,
    ( ~ ssList(X0)
    | ~ ssList(nil)
    | ~ ssList(sK58)
    | segmentP(app(sK58,X0),sK58) ),
    inference(superposition,[status(thm)],[c_12051,c_28738]) ).

cnf(c_28866,plain,
    ( ~ ssList(X0)
    | segmentP(app(sK58,X0),sK58) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_28768,c_8883,c_141]) ).

cnf(c_28869,plain,
    ( ~ ssList(X0)
    | segmentP(app(sP0_iProver_def,X0),sK58) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_28765,c_8882,c_8883]) ).

cnf(c_28872,plain,
    ( ~ ssList(X0)
    | segmentP(app(sP1_iProver_def,X0),sK57) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_28764,c_8882,c_8883]) ).

cnf(c_28882,plain,
    segmentP(app(sK58,sP0_iProver_def),sP0_iProver_def),
    inference(forward_subsumption_resolution,[status(thm)],[c_28751,c_11718,c_8883,c_141]) ).

cnf(c_31922,plain,
    ( ~ ssList(sK57)
    | segmentP(sP1_iProver_def,sK58) ),
    inference(superposition,[status(thm)],[c_8879,c_28866]) ).

cnf(c_31930,plain,
    segmentP(sP1_iProver_def,sK58),
    inference(forward_subsumption_resolution,[status(thm)],[c_31922,c_8882]) ).

cnf(c_31950,plain,
    ( ~ segmentP(sP0_iProver_def,sK58)
    | ~ ssList(sK58)
    | nil = sK58 ),
    inference(superposition,[status(thm)],[c_31930,c_11723]) ).

cnf(c_31951,plain,
    ( ~ segmentP(sP0_iProver_def,sK58)
    | nil = sK58 ),
    inference(forward_subsumption_resolution,[status(thm)],[c_31950,c_8883]) ).

cnf(c_32957,plain,
    ( ~ ssList(nil)
    | segmentP(sP0_iProver_def,sK58) ),
    inference(superposition,[status(thm)],[c_12134,c_28869]) ).

cnf(c_32962,plain,
    segmentP(sP0_iProver_def,sK58),
    inference(forward_subsumption_resolution,[status(thm)],[c_32957,c_141]) ).

cnf(c_32984,plain,
    ( ~ ssList(nil)
    | segmentP(sP1_iProver_def,sK57) ),
    inference(superposition,[status(thm)],[c_12133,c_28872]) ).

cnf(c_32989,plain,
    segmentP(sP1_iProver_def,sK57),
    inference(forward_subsumption_resolution,[status(thm)],[c_32984,c_141]) ).

cnf(c_33011,plain,
    nil = sK58,
    inference(global_subsumption_just,[status(thm)],[c_31951,c_31951,c_32962]) ).

cnf(c_33021,plain,
    segmentP(app(nil,sP0_iProver_def),sP0_iProver_def),
    inference(demodulation,[status(thm)],[c_28882,c_33011]) ).

cnf(c_33102,plain,
    app(sK57,nil) = sP0_iProver_def,
    inference(demodulation,[status(thm)],[c_8878,c_33011]) ).

cnf(c_33107,plain,
    segmentP(sP0_iProver_def,sP0_iProver_def),
    inference(light_normalisation,[status(thm)],[c_33021,c_12054]) ).

cnf(c_33109,plain,
    sK57 = sP0_iProver_def,
    inference(light_normalisation,[status(thm)],[c_33102,c_12132]) ).

cnf(c_33449,plain,
    segmentP(sP1_iProver_def,sP0_iProver_def),
    inference(light_normalisation,[status(thm)],[c_32989,c_33109]) ).

cnf(c_33453,plain,
    ( ~ segmentP(sP0_iProver_def,sP0_iProver_def)
    | ~ ssList(sP0_iProver_def)
    | nil = sP0_iProver_def ),
    inference(superposition,[status(thm)],[c_33449,c_11723]) ).

cnf(c_33454,plain,
    ~ segmentP(sP0_iProver_def,sP0_iProver_def),
    inference(forward_subsumption_resolution,[status(thm)],[c_33453,c_11719,c_11718]) ).

cnf(c_33460,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_33454,c_33107]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.09  % Problem  : SWC090+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.10  % Command  : run_iprover %s %d THM
% 0.09/0.30  % Computer : n003.cluster.edu
% 0.09/0.30  % Model    : x86_64 x86_64
% 0.09/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30  % Memory   : 8042.1875MB
% 0.09/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30  % CPULimit : 300
% 0.09/0.30  % WCLimit  : 300
% 0.09/0.30  % DateTime : Thu May  2 23:28:20 EDT 2024
% 0.09/0.30  % CPUTime  : 
% 0.15/0.41  Running first-order theorem proving
% 0.15/0.41  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 10.28/2.09  % SZS status Started for theBenchmark.p
% 10.28/2.09  % SZS status Theorem for theBenchmark.p
% 10.28/2.09  
% 10.28/2.09  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 10.28/2.09  
% 10.28/2.09  ------  iProver source info
% 10.28/2.09  
% 10.28/2.09  git: date: 2024-05-02 19:28:25 +0000
% 10.28/2.09  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 10.28/2.09  git: non_committed_changes: false
% 10.28/2.09  
% 10.28/2.09  ------ Parsing...
% 10.28/2.09  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 10.28/2.09  
% 10.28/2.09  ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe:1:0s pe:2:0s pe:4:0s pe_e  sup_sim: 0  sf_s  rm: 5 0s  sf_e  pe_s  pe_e 
% 10.28/2.09  
% 10.28/2.09  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 10.28/2.09  
% 10.28/2.09  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 10.28/2.09  ------ Proving...
% 10.28/2.09  ------ Problem Properties 
% 10.28/2.09  
% 10.28/2.09  
% 10.28/2.09  clauses                                 191
% 10.28/2.09  conjectures                             6
% 10.28/2.09  EPR                                     58
% 10.28/2.09  Horn                                    123
% 10.28/2.09  unary                                   25
% 10.28/2.09  binary                                  41
% 10.28/2.09  lits                                    633
% 10.28/2.09  lits eq                                 84
% 10.28/2.09  fd_pure                                 0
% 10.28/2.09  fd_pseudo                               0
% 10.28/2.09  fd_cond                                 22
% 10.28/2.09  fd_pseudo_cond                          14
% 10.28/2.09  AC symbols                              0
% 10.28/2.09  
% 10.28/2.09  ------ Schedule dynamic 5 is on 
% 10.28/2.09  
% 10.28/2.09  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 10.28/2.09  
% 10.28/2.09  
% 10.28/2.09  ------ 
% 10.28/2.09  Current options:
% 10.28/2.09  ------ 
% 10.28/2.09  
% 10.28/2.09  
% 10.28/2.09  
% 10.28/2.09  
% 10.28/2.09  ------ Proving...
% 10.28/2.09  
% 10.28/2.09  
% 10.28/2.09  % SZS status Theorem for theBenchmark.p
% 10.28/2.09  
% 10.28/2.09  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 10.28/2.10  
% 10.28/2.10  
%------------------------------------------------------------------------------