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

View Problem - Process Solution

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

% Computer : n028.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:12:00 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(f96,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ssList(X3)
                 => ( ( ( nil = X0
                        | nil != X1 )
                      & ! [X6] :
                          ( ssItem(X6)
                         => ! [X7] :
                              ( ssList(X7)
                             => ( app(cons(X6,nil),X7) = X0
                                | app(X7,cons(X6,nil)) != X1 ) ) ) )
                    | ( nil = X3
                      & nil != X2 )
                    | ? [X4] :
                        ( ? [X5] :
                            ( app(X5,cons(X4,nil)) = X3
                            & app(cons(X4,nil),X5) != X2
                            & ssList(X5) )
                        & ssItem(X4) )
                    | 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)
                   => ( ( ( nil = X0
                          | nil != X1 )
                        & ! [X6] :
                            ( ssItem(X6)
                           => ! [X7] :
                                ( ssList(X7)
                               => ( app(cons(X6,nil),X7) = X0
                                  | app(X7,cons(X6,nil)) != X1 ) ) ) )
                      | ( nil = X3
                        & nil != X2 )
                      | ? [X4] :
                          ( ? [X5] :
                              ( app(X5,cons(X4,nil)) = X3
                              & app(cons(X4,nil),X5) != X2
                              & ssList(X5) )
                          & ssItem(X4) )
                      | X0 != X2
                      | X1 != X3 ) ) ) ) ),
    inference(negated_conjecture,[],[f96]) ).

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

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

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

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

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

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

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

fof(f348,plain,
    ( ? [X4] :
        ( ? [X5] :
            ( app(cons(X4,nil),X5) != sK53
            & app(X5,cons(X4,nil)) = sK54
            & ssList(X5) )
        & ssItem(X4) )
   => ( ? [X5] :
          ( sK53 != app(cons(sK57,nil),X5)
          & sK54 = app(X5,cons(sK57,nil))
          & ssList(X5) )
      & ssItem(sK57) ) ),
    introduced(choice_axiom,[]) ).

fof(f349,plain,
    ( ? [X5] :
        ( sK53 != app(cons(sK57,nil),X5)
        & sK54 = app(X5,cons(sK57,nil))
        & ssList(X5) )
   => ( sK53 != app(cons(sK57,nil),sK58)
      & sK54 = app(sK58,cons(sK57,nil))
      & ssList(sK58) ) ),
    introduced(choice_axiom,[]) ).

fof(f350,plain,
    ( ( ( nil != sK53
        & nil = sK54 )
      | ( sK53 != app(cons(sK57,nil),sK58)
        & sK54 = app(sK58,cons(sK57,nil))
        & ssList(sK58)
        & ssItem(sK57) ) )
    & ( nil != sK56
      | nil = sK55 )
    & ! [X6] :
        ( ! [X7] :
            ( app(X7,cons(X6,nil)) != sK56
            | app(cons(X6,nil),X7) = sK55
            | ~ ssList(X7) )
        | ~ ssItem(X6) )
    & 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(f554,plain,
    sK54 = sK56,
    inference(cnf_transformation,[],[f350]) ).

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

fof(f556,plain,
    ! [X6,X7] :
      ( app(X7,cons(X6,nil)) != sK56
      | app(cons(X6,nil),X7) = sK55
      | ~ ssList(X7)
      | ~ ssItem(X6) ),
    inference(cnf_transformation,[],[f350]) ).

fof(f557,plain,
    ( nil != sK56
    | nil = sK55 ),
    inference(cnf_transformation,[],[f350]) ).

fof(f558,plain,
    ( nil = sK54
    | ssItem(sK57) ),
    inference(cnf_transformation,[],[f350]) ).

fof(f559,plain,
    ( nil = sK54
    | ssList(sK58) ),
    inference(cnf_transformation,[],[f350]) ).

fof(f560,plain,
    ( nil = sK54
    | sK54 = app(sK58,cons(sK57,nil)) ),
    inference(cnf_transformation,[],[f350]) ).

fof(f561,plain,
    ( nil = sK54
    | sK53 != app(cons(sK57,nil),sK58) ),
    inference(cnf_transformation,[],[f350]) ).

fof(f562,plain,
    ( nil != sK53
    | ssItem(sK57) ),
    inference(cnf_transformation,[],[f350]) ).

fof(f563,plain,
    ( nil != sK53
    | ssList(sK58) ),
    inference(cnf_transformation,[],[f350]) ).

fof(f564,plain,
    ( nil != sK53
    | sK54 = app(sK58,cons(sK57,nil)) ),
    inference(cnf_transformation,[],[f350]) ).

fof(f565,plain,
    ( nil != sK53
    | sK53 != app(cons(sK57,nil),sK58) ),
    inference(cnf_transformation,[],[f350]) ).

fof(f566,plain,
    ( nil != sK55
    | sK55 != app(cons(sK57,nil),sK58) ),
    inference(definition_unfolding,[],[f565,f555,f555]) ).

fof(f567,plain,
    ( nil != sK55
    | sK56 = app(sK58,cons(sK57,nil)) ),
    inference(definition_unfolding,[],[f564,f555,f554]) ).

fof(f568,plain,
    ( nil != sK55
    | ssList(sK58) ),
    inference(definition_unfolding,[],[f563,f555]) ).

fof(f569,plain,
    ( nil != sK55
    | ssItem(sK57) ),
    inference(definition_unfolding,[],[f562,f555]) ).

fof(f570,plain,
    ( nil = sK56
    | sK55 != app(cons(sK57,nil),sK58) ),
    inference(definition_unfolding,[],[f561,f554,f555]) ).

fof(f571,plain,
    ( nil = sK56
    | sK56 = app(sK58,cons(sK57,nil)) ),
    inference(definition_unfolding,[],[f560,f554,f554]) ).

fof(f572,plain,
    ( nil = sK56
    | ssList(sK58) ),
    inference(definition_unfolding,[],[f559,f554]) ).

fof(f573,plain,
    ( nil = sK56
    | ssItem(sK57) ),
    inference(definition_unfolding,[],[f558,f554]) ).

cnf(c_246,negated_conjecture,
    ( app(cons(sK57,nil),sK58) != sK55
    | nil != sK55 ),
    inference(cnf_transformation,[],[f566]) ).

cnf(c_247,negated_conjecture,
    ( nil != sK55
    | app(sK58,cons(sK57,nil)) = sK56 ),
    inference(cnf_transformation,[],[f567]) ).

cnf(c_248,negated_conjecture,
    ( nil != sK55
    | ssList(sK58) ),
    inference(cnf_transformation,[],[f568]) ).

cnf(c_249,negated_conjecture,
    ( nil != sK55
    | ssItem(sK57) ),
    inference(cnf_transformation,[],[f569]) ).

cnf(c_250,negated_conjecture,
    ( app(cons(sK57,nil),sK58) != sK55
    | nil = sK56 ),
    inference(cnf_transformation,[],[f570]) ).

cnf(c_251,negated_conjecture,
    ( app(sK58,cons(sK57,nil)) = sK56
    | nil = sK56 ),
    inference(cnf_transformation,[],[f571]) ).

cnf(c_252,negated_conjecture,
    ( nil = sK56
    | ssList(sK58) ),
    inference(cnf_transformation,[],[f572]) ).

cnf(c_253,negated_conjecture,
    ( nil = sK56
    | ssItem(sK57) ),
    inference(cnf_transformation,[],[f573]) ).

cnf(c_254,negated_conjecture,
    ( nil != sK56
    | nil = sK55 ),
    inference(cnf_transformation,[],[f557]) ).

cnf(c_255,negated_conjecture,
    ( app(X0,cons(X1,nil)) != sK56
    | ~ ssItem(X1)
    | ~ ssList(X0)
    | app(cons(X1,nil),X0) = sK55 ),
    inference(cnf_transformation,[],[f556]) ).

cnf(c_367,negated_conjecture,
    ssItem(sK57),
    inference(global_subsumption_just,[status(thm)],[c_253,c_253,c_249,c_254]) ).

cnf(c_369,negated_conjecture,
    ssList(sK58),
    inference(global_subsumption_just,[status(thm)],[c_252,c_252,c_248,c_254]) ).

cnf(c_377,negated_conjecture,
    ssItem(sK57),
    inference(global_subsumption_just,[status(thm)],[c_249,c_367]) ).

cnf(c_379,negated_conjecture,
    ssList(sK58),
    inference(global_subsumption_just,[status(thm)],[c_248,c_369]) ).

cnf(c_387,negated_conjecture,
    app(sK58,cons(sK57,nil)) = sK56,
    inference(global_subsumption_just,[status(thm)],[c_251,c_254,c_251,c_247]) ).

cnf(c_389,negated_conjecture,
    app(cons(sK57,nil),sK58) != sK55,
    inference(global_subsumption_just,[status(thm)],[c_250,c_254,c_250,c_246]) ).

cnf(c_391,negated_conjecture,
    app(sK58,cons(sK57,nil)) = sK56,
    inference(global_subsumption_just,[status(thm)],[c_247,c_387]) ).

cnf(c_393,negated_conjecture,
    app(cons(sK57,nil),sK58) != sK55,
    inference(global_subsumption_just,[status(thm)],[c_246,c_389]) ).

cnf(c_8854,plain,
    cons(sK57,nil) = sP0_iProver_def,
    definition ).

cnf(c_8855,plain,
    app(sP0_iProver_def,sK58) = sP1_iProver_def,
    definition ).

cnf(c_8856,plain,
    app(sK58,sP0_iProver_def) = sP2_iProver_def,
    definition ).

cnf(c_8857,negated_conjecture,
    sP1_iProver_def != sK55,
    inference(demodulation,[status(thm)],[c_393,c_8854,c_8855]) ).

cnf(c_8858,negated_conjecture,
    sP2_iProver_def = sK56,
    inference(demodulation,[status(thm)],[c_391,c_8856]) ).

cnf(c_8859,negated_conjecture,
    ssList(sK58),
    inference(demodulation,[status(thm)],[c_379]) ).

cnf(c_8860,negated_conjecture,
    ssItem(sK57),
    inference(demodulation,[status(thm)],[c_377]) ).

cnf(c_8863,negated_conjecture,
    ( app(X0,cons(X1,nil)) != sK56
    | ~ ssItem(X1)
    | ~ ssList(X0)
    | app(cons(X1,nil),X0) = sK55 ),
    inference(demodulation,[status(thm)],[c_255]) ).

cnf(c_11700,plain,
    ( app(X0,cons(X1,nil)) != sP2_iProver_def
    | ~ ssItem(X1)
    | ~ ssList(X0)
    | app(cons(X1,nil),X0) = sK55 ),
    inference(light_normalisation,[status(thm)],[c_8863,c_8858]) ).

cnf(c_11713,plain,
    ( app(X0,sP0_iProver_def) != sP2_iProver_def
    | ~ ssList(X0)
    | ~ ssItem(sK57)
    | app(cons(sK57,nil),X0) = sK55 ),
    inference(superposition,[status(thm)],[c_8854,c_11700]) ).

cnf(c_11714,plain,
    ( app(X0,sP0_iProver_def) != sP2_iProver_def
    | ~ ssList(X0)
    | ~ ssItem(sK57)
    | app(sP0_iProver_def,X0) = sK55 ),
    inference(light_normalisation,[status(thm)],[c_11713,c_8854]) ).

cnf(c_11715,plain,
    ( app(X0,sP0_iProver_def) != sP2_iProver_def
    | ~ ssList(X0)
    | app(sP0_iProver_def,X0) = sK55 ),
    inference(forward_subsumption_resolution,[status(thm)],[c_11714,c_8860]) ).

cnf(c_11814,plain,
    ( ~ ssList(sK58)
    | app(sP0_iProver_def,sK58) = sK55 ),
    inference(superposition,[status(thm)],[c_8856,c_11715]) ).

cnf(c_11815,plain,
    ( ~ ssList(sK58)
    | sK55 = sP1_iProver_def ),
    inference(light_normalisation,[status(thm)],[c_11814,c_8855]) ).

cnf(c_11816,plain,
    sK55 = sP1_iProver_def,
    inference(forward_subsumption_resolution,[status(thm)],[c_11815,c_8859]) ).

cnf(c_11820,plain,
    sP1_iProver_def != sP1_iProver_def,
    inference(demodulation,[status(thm)],[c_8857,c_11816]) ).

cnf(c_11822,plain,
    $false,
    inference(equality_resolution_simp,[status(thm)],[c_11820]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWC322+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.13  % Command  : run_iprover %s %d THM
% 0.14/0.34  % Computer : n028.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Thu May  2 23:49:33 EDT 2024
% 0.14/0.34  % CPUTime  : 
% 0.20/0.46  Running first-order theorem proving
% 0.20/0.46  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
% 4.08/1.20  % SZS status Started for theBenchmark.p
% 4.08/1.20  % SZS status Theorem for theBenchmark.p
% 4.08/1.20  
% 4.08/1.20  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 4.08/1.20  
% 4.08/1.20  ------  iProver source info
% 4.08/1.20  
% 4.08/1.20  git: date: 2024-05-02 19:28:25 +0000
% 4.08/1.20  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 4.08/1.20  git: non_committed_changes: false
% 4.08/1.20  
% 4.08/1.20  ------ Parsing...
% 4.08/1.20  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 4.08/1.20  
% 4.08/1.20  ------ 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: 4 0s  sf_e  pe_s  pe_e 
% 4.08/1.20  
% 4.08/1.20  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 4.08/1.20  
% 4.08/1.20  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 4.08/1.20  ------ Proving...
% 4.08/1.20  ------ Problem Properties 
% 4.08/1.20  
% 4.08/1.20  
% 4.08/1.20  clauses                                 191
% 4.08/1.20  conjectures                             8
% 4.08/1.20  EPR                                     56
% 4.08/1.20  Horn                                    123
% 4.08/1.20  unary                                   25
% 4.08/1.20  binary                                  41
% 4.08/1.20  lits                                    633
% 4.08/1.20  lits eq                                 87
% 4.08/1.20  fd_pure                                 0
% 4.08/1.20  fd_pseudo                               0
% 4.08/1.20  fd_cond                                 21
% 4.08/1.20  fd_pseudo_cond                          14
% 4.08/1.20  AC symbols                              0
% 4.08/1.20  
% 4.08/1.20  ------ Schedule dynamic 5 is on 
% 4.08/1.20  
% 4.08/1.20  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.08/1.20  
% 4.08/1.20  
% 4.08/1.20  ------ 
% 4.08/1.20  Current options:
% 4.08/1.20  ------ 
% 4.08/1.20  
% 4.08/1.20  
% 4.08/1.20  
% 4.08/1.20  
% 4.08/1.20  ------ Proving...
% 4.08/1.20  
% 4.08/1.20  
% 4.08/1.20  % SZS status Theorem for theBenchmark.p
% 4.08/1.20  
% 4.08/1.20  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.08/1.20  
% 4.08/1.20  
%------------------------------------------------------------------------------