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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SWC175+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n016.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed May  1 04:00:20 EDT 2024

% Result   : Theorem 0.91s 0.87s
% Output   : Refutation 0.91s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   19
%            Number of leaves      :   27
% Syntax   : Number of formulae    :  106 (  16 unt;   0 def)
%            Number of atoms       :  751 ( 179 equ)
%            Maximal formula atoms :   48 (   7 avg)
%            Number of connectives :  978 ( 333   ~; 290   |; 283   &)
%                                         (  11 <=>;  61  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   25 (   7 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :   12 (  10 usr;   5 prp; 0-2 aty)
%            Number of functors    :   17 (  17 usr;  10 con; 0-2 aty)
%            Number of variables   :  316 ( 178   !; 138   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1886,plain,
    $false,
    inference(avatar_sat_refutation,[],[f535,f551,f569,f1256,f1864]) ).

fof(f1864,plain,
    ( ~ spl45_7
    | spl45_57 ),
    inference(avatar_contradiction_clause,[],[f1863]) ).

fof(f1863,plain,
    ( $false
    | ~ spl45_7
    | spl45_57 ),
    inference(subsumption_resolution,[],[f1862,f251]) ).

fof(f251,plain,
    ssList(sK8),
    inference(cnf_transformation,[],[f185]) ).

fof(f185,plain,
    ( ( nil != sK8
      | nil = sK9 )
    & ~ neq(sK10,sK11)
    & sK6 = app(app(app(sK12,cons(sK10,nil)),cons(sK11,nil)),sK13)
    & ssList(sK13)
    & ssList(sK12)
    & ssItem(sK11)
    & ssItem(sK10)
    & ! [X9] :
        ( ! [X10] :
            ( ! [X11] :
                ( ! [X12] :
                    ( ~ lt(X11,X9)
                    | app(X12,cons(X11,nil)) != sK8
                    | ~ ssList(X12) )
                | ~ ssItem(X11) )
            | app(cons(X9,nil),X10) != sK14
            | ~ ssList(X10) )
        | ~ ssItem(X9) )
    & strictorderedP(sK8)
    & sK9 = app(sK8,sK14)
    & ssList(sK14)
    & sK6 = sK8
    & sK7 = sK9
    & ssList(sK9)
    & ssList(sK8)
    & ssList(sK7)
    & ssList(sK6) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8,sK9,sK10,sK11,sK12,sK13,sK14])],[f100,f184,f183,f182,f181,f180,f179,f178,f177,f176]) ).

fof(f176,plain,
    ( ? [X0] :
        ( ? [X1] :
            ( ? [X2] :
                ( ? [X3] :
                    ( ( nil != X2
                      | nil = X3 )
                    & ? [X4] :
                        ( ? [X5] :
                            ( ~ neq(X4,X5)
                            & ? [X6] :
                                ( ? [X7] :
                                    ( app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) = X0
                                    & ssList(X7) )
                                & ssList(X6) )
                            & ssItem(X5) )
                        & ssItem(X4) )
                    & ? [X8] :
                        ( ! [X9] :
                            ( ! [X10] :
                                ( ! [X11] :
                                    ( ! [X12] :
                                        ( ~ lt(X11,X9)
                                        | app(X12,cons(X11,nil)) != X2
                                        | ~ ssList(X12) )
                                    | ~ ssItem(X11) )
                                | app(cons(X9,nil),X10) != X8
                                | ~ ssList(X10) )
                            | ~ ssItem(X9) )
                        & strictorderedP(X2)
                        & app(X2,X8) = X3
                        & ssList(X8) )
                    & X0 = X2
                    & X1 = X3
                    & ssList(X3) )
                & ssList(X2) )
            & ssList(X1) )
        & ssList(X0) )
   => ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ( nil != X2
                    | nil = X3 )
                  & ? [X4] :
                      ( ? [X5] :
                          ( ~ neq(X4,X5)
                          & ? [X6] :
                              ( ? [X7] :
                                  ( app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) = sK6
                                  & ssList(X7) )
                              & ssList(X6) )
                          & ssItem(X5) )
                      & ssItem(X4) )
                  & ? [X8] :
                      ( ! [X9] :
                          ( ! [X10] :
                              ( ! [X11] :
                                  ( ! [X12] :
                                      ( ~ lt(X11,X9)
                                      | app(X12,cons(X11,nil)) != X2
                                      | ~ ssList(X12) )
                                  | ~ ssItem(X11) )
                              | app(cons(X9,nil),X10) != X8
                              | ~ ssList(X10) )
                          | ~ ssItem(X9) )
                      & strictorderedP(X2)
                      & app(X2,X8) = X3
                      & ssList(X8) )
                  & sK6 = X2
                  & X1 = X3
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(sK6) ) ),
    introduced(choice_axiom,[]) ).

fof(f177,plain,
    ( ? [X1] :
        ( ? [X2] :
            ( ? [X3] :
                ( ( nil != X2
                  | nil = X3 )
                & ? [X4] :
                    ( ? [X5] :
                        ( ~ neq(X4,X5)
                        & ? [X6] :
                            ( ? [X7] :
                                ( app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) = sK6
                                & ssList(X7) )
                            & ssList(X6) )
                        & ssItem(X5) )
                    & ssItem(X4) )
                & ? [X8] :
                    ( ! [X9] :
                        ( ! [X10] :
                            ( ! [X11] :
                                ( ! [X12] :
                                    ( ~ lt(X11,X9)
                                    | app(X12,cons(X11,nil)) != X2
                                    | ~ ssList(X12) )
                                | ~ ssItem(X11) )
                            | app(cons(X9,nil),X10) != X8
                            | ~ ssList(X10) )
                        | ~ ssItem(X9) )
                    & strictorderedP(X2)
                    & app(X2,X8) = X3
                    & ssList(X8) )
                & sK6 = X2
                & X1 = X3
                & ssList(X3) )
            & ssList(X2) )
        & ssList(X1) )
   => ( ? [X2] :
          ( ? [X3] :
              ( ( nil != X2
                | nil = X3 )
              & ? [X4] :
                  ( ? [X5] :
                      ( ~ neq(X4,X5)
                      & ? [X6] :
                          ( ? [X7] :
                              ( app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) = sK6
                              & ssList(X7) )
                          & ssList(X6) )
                      & ssItem(X5) )
                  & ssItem(X4) )
              & ? [X8] :
                  ( ! [X9] :
                      ( ! [X10] :
                          ( ! [X11] :
                              ( ! [X12] :
                                  ( ~ lt(X11,X9)
                                  | app(X12,cons(X11,nil)) != X2
                                  | ~ ssList(X12) )
                              | ~ ssItem(X11) )
                          | app(cons(X9,nil),X10) != X8
                          | ~ ssList(X10) )
                      | ~ ssItem(X9) )
                  & strictorderedP(X2)
                  & app(X2,X8) = X3
                  & ssList(X8) )
              & sK6 = X2
              & sK7 = X3
              & ssList(X3) )
          & ssList(X2) )
      & ssList(sK7) ) ),
    introduced(choice_axiom,[]) ).

fof(f178,plain,
    ( ? [X2] :
        ( ? [X3] :
            ( ( nil != X2
              | nil = X3 )
            & ? [X4] :
                ( ? [X5] :
                    ( ~ neq(X4,X5)
                    & ? [X6] :
                        ( ? [X7] :
                            ( app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) = sK6
                            & ssList(X7) )
                        & ssList(X6) )
                    & ssItem(X5) )
                & ssItem(X4) )
            & ? [X8] :
                ( ! [X9] :
                    ( ! [X10] :
                        ( ! [X11] :
                            ( ! [X12] :
                                ( ~ lt(X11,X9)
                                | app(X12,cons(X11,nil)) != X2
                                | ~ ssList(X12) )
                            | ~ ssItem(X11) )
                        | app(cons(X9,nil),X10) != X8
                        | ~ ssList(X10) )
                    | ~ ssItem(X9) )
                & strictorderedP(X2)
                & app(X2,X8) = X3
                & ssList(X8) )
            & sK6 = X2
            & sK7 = X3
            & ssList(X3) )
        & ssList(X2) )
   => ( ? [X3] :
          ( ( nil != sK8
            | nil = X3 )
          & ? [X4] :
              ( ? [X5] :
                  ( ~ neq(X4,X5)
                  & ? [X6] :
                      ( ? [X7] :
                          ( app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) = sK6
                          & ssList(X7) )
                      & ssList(X6) )
                  & ssItem(X5) )
              & ssItem(X4) )
          & ? [X8] :
              ( ! [X9] :
                  ( ! [X10] :
                      ( ! [X11] :
                          ( ! [X12] :
                              ( ~ lt(X11,X9)
                              | app(X12,cons(X11,nil)) != sK8
                              | ~ ssList(X12) )
                          | ~ ssItem(X11) )
                      | app(cons(X9,nil),X10) != X8
                      | ~ ssList(X10) )
                  | ~ ssItem(X9) )
              & strictorderedP(sK8)
              & app(sK8,X8) = X3
              & ssList(X8) )
          & sK6 = sK8
          & sK7 = X3
          & ssList(X3) )
      & ssList(sK8) ) ),
    introduced(choice_axiom,[]) ).

fof(f179,plain,
    ( ? [X3] :
        ( ( nil != sK8
          | nil = X3 )
        & ? [X4] :
            ( ? [X5] :
                ( ~ neq(X4,X5)
                & ? [X6] :
                    ( ? [X7] :
                        ( app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) = sK6
                        & ssList(X7) )
                    & ssList(X6) )
                & ssItem(X5) )
            & ssItem(X4) )
        & ? [X8] :
            ( ! [X9] :
                ( ! [X10] :
                    ( ! [X11] :
                        ( ! [X12] :
                            ( ~ lt(X11,X9)
                            | app(X12,cons(X11,nil)) != sK8
                            | ~ ssList(X12) )
                        | ~ ssItem(X11) )
                    | app(cons(X9,nil),X10) != X8
                    | ~ ssList(X10) )
                | ~ ssItem(X9) )
            & strictorderedP(sK8)
            & app(sK8,X8) = X3
            & ssList(X8) )
        & sK6 = sK8
        & sK7 = X3
        & ssList(X3) )
   => ( ( nil != sK8
        | nil = sK9 )
      & ? [X4] :
          ( ? [X5] :
              ( ~ neq(X4,X5)
              & ? [X6] :
                  ( ? [X7] :
                      ( app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) = sK6
                      & ssList(X7) )
                  & ssList(X6) )
              & ssItem(X5) )
          & ssItem(X4) )
      & ? [X8] :
          ( ! [X9] :
              ( ! [X10] :
                  ( ! [X11] :
                      ( ! [X12] :
                          ( ~ lt(X11,X9)
                          | app(X12,cons(X11,nil)) != sK8
                          | ~ ssList(X12) )
                      | ~ ssItem(X11) )
                  | app(cons(X9,nil),X10) != X8
                  | ~ ssList(X10) )
              | ~ ssItem(X9) )
          & strictorderedP(sK8)
          & app(sK8,X8) = sK9
          & ssList(X8) )
      & sK6 = sK8
      & sK7 = sK9
      & ssList(sK9) ) ),
    introduced(choice_axiom,[]) ).

fof(f180,plain,
    ( ? [X4] :
        ( ? [X5] :
            ( ~ neq(X4,X5)
            & ? [X6] :
                ( ? [X7] :
                    ( app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) = sK6
                    & ssList(X7) )
                & ssList(X6) )
            & ssItem(X5) )
        & ssItem(X4) )
   => ( ? [X5] :
          ( ~ neq(sK10,X5)
          & ? [X6] :
              ( ? [X7] :
                  ( sK6 = app(app(app(X6,cons(sK10,nil)),cons(X5,nil)),X7)
                  & ssList(X7) )
              & ssList(X6) )
          & ssItem(X5) )
      & ssItem(sK10) ) ),
    introduced(choice_axiom,[]) ).

fof(f181,plain,
    ( ? [X5] :
        ( ~ neq(sK10,X5)
        & ? [X6] :
            ( ? [X7] :
                ( sK6 = app(app(app(X6,cons(sK10,nil)),cons(X5,nil)),X7)
                & ssList(X7) )
            & ssList(X6) )
        & ssItem(X5) )
   => ( ~ neq(sK10,sK11)
      & ? [X6] :
          ( ? [X7] :
              ( sK6 = app(app(app(X6,cons(sK10,nil)),cons(sK11,nil)),X7)
              & ssList(X7) )
          & ssList(X6) )
      & ssItem(sK11) ) ),
    introduced(choice_axiom,[]) ).

fof(f182,plain,
    ( ? [X6] :
        ( ? [X7] :
            ( sK6 = app(app(app(X6,cons(sK10,nil)),cons(sK11,nil)),X7)
            & ssList(X7) )
        & ssList(X6) )
   => ( ? [X7] :
          ( sK6 = app(app(app(sK12,cons(sK10,nil)),cons(sK11,nil)),X7)
          & ssList(X7) )
      & ssList(sK12) ) ),
    introduced(choice_axiom,[]) ).

fof(f183,plain,
    ( ? [X7] :
        ( sK6 = app(app(app(sK12,cons(sK10,nil)),cons(sK11,nil)),X7)
        & ssList(X7) )
   => ( sK6 = app(app(app(sK12,cons(sK10,nil)),cons(sK11,nil)),sK13)
      & ssList(sK13) ) ),
    introduced(choice_axiom,[]) ).

fof(f184,plain,
    ( ? [X8] :
        ( ! [X9] :
            ( ! [X10] :
                ( ! [X11] :
                    ( ! [X12] :
                        ( ~ lt(X11,X9)
                        | app(X12,cons(X11,nil)) != sK8
                        | ~ ssList(X12) )
                    | ~ ssItem(X11) )
                | app(cons(X9,nil),X10) != X8
                | ~ ssList(X10) )
            | ~ ssItem(X9) )
        & strictorderedP(sK8)
        & app(sK8,X8) = sK9
        & ssList(X8) )
   => ( ! [X9] :
          ( ! [X10] :
              ( ! [X11] :
                  ( ! [X12] :
                      ( ~ lt(X11,X9)
                      | app(X12,cons(X11,nil)) != sK8
                      | ~ ssList(X12) )
                  | ~ ssItem(X11) )
              | app(cons(X9,nil),X10) != sK14
              | ~ ssList(X10) )
          | ~ ssItem(X9) )
      & strictorderedP(sK8)
      & sK9 = app(sK8,sK14)
      & ssList(sK14) ) ),
    introduced(choice_axiom,[]) ).

fof(f100,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ( nil != X2
                    | nil = X3 )
                  & ? [X4] :
                      ( ? [X5] :
                          ( ~ neq(X4,X5)
                          & ? [X6] :
                              ( ? [X7] :
                                  ( app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) = X0
                                  & ssList(X7) )
                              & ssList(X6) )
                          & ssItem(X5) )
                      & ssItem(X4) )
                  & ? [X8] :
                      ( ! [X9] :
                          ( ! [X10] :
                              ( ! [X11] :
                                  ( ! [X12] :
                                      ( ~ lt(X11,X9)
                                      | app(X12,cons(X11,nil)) != X2
                                      | ~ ssList(X12) )
                                  | ~ ssItem(X11) )
                              | app(cons(X9,nil),X10) != X8
                              | ~ ssList(X10) )
                          | ~ ssItem(X9) )
                      & strictorderedP(X2)
                      & app(X2,X8) = X3
                      & ssList(X8) )
                  & X0 = X2
                  & X1 = X3
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(flattening,[],[f99]) ).

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

fof(f97,negated_conjecture,
    ~ ! [X0] :
        ( ssList(X0)
       => ! [X1] :
            ( ssList(X1)
           => ! [X2] :
                ( ssList(X2)
               => ! [X3] :
                    ( ssList(X3)
                   => ( ( nil = X2
                        & nil != X3 )
                      | ! [X9] :
                          ( ssItem(X9)
                         => ! [X10] :
                              ( ssItem(X10)
                             => ( neq(X9,X10)
                                | ! [X11] :
                                    ( ssList(X11)
                                   => ! [X12] :
                                        ( ssList(X12)
                                       => app(app(app(X11,cons(X9,nil)),cons(X10,nil)),X12) != X0 ) ) ) ) )
                      | ! [X4] :
                          ( ssList(X4)
                         => ( ? [X5] :
                                ( ? [X6] :
                                    ( ? [X7] :
                                        ( ? [X8] :
                                            ( lt(X7,X5)
                                            & app(X8,cons(X7,nil)) = X2
                                            & ssList(X8) )
                                        & ssItem(X7) )
                                    & app(cons(X5,nil),X6) = X4
                                    & ssList(X6) )
                                & ssItem(X5) )
                            | ~ strictorderedP(X2)
                            | app(X2,X4) != X3 ) )
                      | X0 != X2
                      | X1 != X3 ) ) ) ) ),
    inference(negated_conjecture,[],[f96]) ).

fof(f96,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ssList(X3)
                 => ( ( nil = X2
                      & nil != X3 )
                    | ! [X9] :
                        ( ssItem(X9)
                       => ! [X10] :
                            ( ssItem(X10)
                           => ( neq(X9,X10)
                              | ! [X11] :
                                  ( ssList(X11)
                                 => ! [X12] :
                                      ( ssList(X12)
                                     => app(app(app(X11,cons(X9,nil)),cons(X10,nil)),X12) != X0 ) ) ) ) )
                    | ! [X4] :
                        ( ssList(X4)
                       => ( ? [X5] :
                              ( ? [X6] :
                                  ( ? [X7] :
                                      ( ? [X8] :
                                          ( lt(X7,X5)
                                          & app(X8,cons(X7,nil)) = X2
                                          & ssList(X8) )
                                      & ssItem(X7) )
                                  & app(cons(X5,nil),X6) = X4
                                  & ssList(X6) )
                              & ssItem(X5) )
                          | ~ strictorderedP(X2)
                          | app(X2,X4) != X3 ) )
                    | X0 != X2
                    | X1 != X3 ) ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.vdMGQuDIyQ/Vampire---4.8_9163',co1) ).

fof(f1862,plain,
    ( ~ ssList(sK8)
    | ~ spl45_7
    | spl45_57 ),
    inference(subsumption_resolution,[],[f1861,f1053]) ).

fof(f1053,plain,
    ( ~ lt(sK10,sK10)
    | spl45_57 ),
    inference(avatar_component_clause,[],[f1052]) ).

fof(f1052,plain,
    ( spl45_57
  <=> lt(sK10,sK10) ),
    introduced(avatar_definition,[new_symbols(naming,[spl45_57])]) ).

fof(f1861,plain,
    ( lt(sK10,sK10)
    | ~ ssList(sK8)
    | ~ spl45_7 ),
    inference(subsumption_resolution,[],[f1860,f259]) ).

fof(f259,plain,
    ssItem(sK10),
    inference(cnf_transformation,[],[f185]) ).

fof(f1860,plain,
    ( ~ ssItem(sK10)
    | lt(sK10,sK10)
    | ~ ssList(sK8)
    | ~ spl45_7 ),
    inference(subsumption_resolution,[],[f1859,f261]) ).

fof(f261,plain,
    ssList(sK12),
    inference(cnf_transformation,[],[f185]) ).

fof(f1859,plain,
    ( ~ ssList(sK12)
    | ~ ssItem(sK10)
    | lt(sK10,sK10)
    | ~ ssList(sK8)
    | ~ spl45_7 ),
    inference(subsumption_resolution,[],[f1858,f292]) ).

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

fof(f17,axiom,
    ssList(nil),
    file('/export/starexec/sandbox2/tmp/tmp.vdMGQuDIyQ/Vampire---4.8_9163',ax17) ).

fof(f1858,plain,
    ( ~ ssList(nil)
    | ~ ssList(sK12)
    | ~ ssItem(sK10)
    | lt(sK10,sK10)
    | ~ ssList(sK8)
    | ~ spl45_7 ),
    inference(subsumption_resolution,[],[f1857,f262]) ).

fof(f262,plain,
    ssList(sK13),
    inference(cnf_transformation,[],[f185]) ).

fof(f1857,plain,
    ( ~ ssList(sK13)
    | ~ ssList(nil)
    | ~ ssList(sK12)
    | ~ ssItem(sK10)
    | lt(sK10,sK10)
    | ~ ssList(sK8)
    | ~ spl45_7 ),
    inference(subsumption_resolution,[],[f1835,f257]) ).

fof(f257,plain,
    strictorderedP(sK8),
    inference(cnf_transformation,[],[f185]) ).

fof(f1835,plain,
    ( ~ strictorderedP(sK8)
    | ~ ssList(sK13)
    | ~ ssList(nil)
    | ~ ssList(sK12)
    | ~ ssItem(sK10)
    | lt(sK10,sK10)
    | ~ ssList(sK8)
    | ~ spl45_7 ),
    inference(duplicate_literal_removal,[],[f1819]) ).

fof(f1819,plain,
    ( ~ strictorderedP(sK8)
    | ~ ssList(sK13)
    | ~ ssList(nil)
    | ~ ssList(sK12)
    | ~ ssItem(sK10)
    | ~ ssItem(sK10)
    | lt(sK10,sK10)
    | ~ ssList(sK8)
    | ~ spl45_7 ),
    inference(superposition,[],[f393,f849]) ).

fof(f849,plain,
    ( sK8 = app(app(sK12,cons(sK10,nil)),cons(sK10,sK13))
    | ~ spl45_7 ),
    inference(subsumption_resolution,[],[f848,f262]) ).

fof(f848,plain,
    ( sK8 = app(app(sK12,cons(sK10,nil)),cons(sK10,sK13))
    | ~ ssList(sK13)
    | ~ spl45_7 ),
    inference(subsumption_resolution,[],[f835,f259]) ).

fof(f835,plain,
    ( sK8 = app(app(sK12,cons(sK10,nil)),cons(sK10,sK13))
    | ~ ssItem(sK10)
    | ~ ssList(sK13)
    | ~ spl45_7 ),
    inference(superposition,[],[f484,f282]) ).

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

fof(f111,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/tmp/tmp.vdMGQuDIyQ/Vampire---4.8_9163',ax81) ).

fof(f484,plain,
    ( sK8 = app(app(sK12,cons(sK10,nil)),app(cons(sK10,nil),sK13))
    | ~ spl45_7 ),
    inference(avatar_component_clause,[],[f482]) ).

fof(f482,plain,
    ( spl45_7
  <=> sK8 = app(app(sK12,cons(sK10,nil)),app(cons(sK10,nil),sK13)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl45_7])]) ).

fof(f393,plain,
    ! [X10,X8,X6,X9,X7] :
      ( ~ strictorderedP(app(app(X8,cons(X6,X9)),cons(X7,X10)))
      | ~ ssList(X10)
      | ~ ssList(X9)
      | ~ ssList(X8)
      | ~ ssItem(X7)
      | ~ ssItem(X6)
      | lt(X6,X7)
      | ~ ssList(app(app(X8,cons(X6,X9)),cons(X7,X10))) ),
    inference(equality_resolution,[],[f308]) ).

fof(f308,plain,
    ! [X10,X0,X8,X6,X9,X7] :
      ( lt(X6,X7)
      | app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
      | ~ ssList(X10)
      | ~ ssList(X9)
      | ~ ssList(X8)
      | ~ ssItem(X7)
      | ~ ssItem(X6)
      | ~ strictorderedP(X0)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f208]) ).

fof(f208,plain,
    ! [X0] :
      ( ( ( strictorderedP(X0)
          | ( ~ lt(sK19(X0),sK20(X0))
            & app(app(sK21(X0),cons(sK19(X0),sK22(X0))),cons(sK20(X0),sK23(X0))) = X0
            & ssList(sK23(X0))
            & ssList(sK22(X0))
            & ssList(sK21(X0))
            & ssItem(sK20(X0))
            & ssItem(sK19(X0)) ) )
        & ( ! [X6] :
              ( ! [X7] :
                  ( ! [X8] :
                      ( ! [X9] :
                          ( ! [X10] :
                              ( lt(X6,X7)
                              | app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
                              | ~ ssList(X10) )
                          | ~ ssList(X9) )
                      | ~ ssList(X8) )
                  | ~ ssItem(X7) )
              | ~ ssItem(X6) )
          | ~ strictorderedP(X0) ) )
      | ~ ssList(X0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK19,sK20,sK21,sK22,sK23])],[f202,f207,f206,f205,f204,f203]) ).

fof(f203,plain,
    ! [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ? [X4] :
                      ( ? [X5] :
                          ( ~ lt(X1,X2)
                          & app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
                          & ssList(X5) )
                      & ssList(X4) )
                  & ssList(X3) )
              & ssItem(X2) )
          & ssItem(X1) )
     => ( ? [X2] :
            ( ? [X3] :
                ( ? [X4] :
                    ( ? [X5] :
                        ( ~ lt(sK19(X0),X2)
                        & app(app(X3,cons(sK19(X0),X4)),cons(X2,X5)) = X0
                        & ssList(X5) )
                    & ssList(X4) )
                & ssList(X3) )
            & ssItem(X2) )
        & ssItem(sK19(X0)) ) ),
    introduced(choice_axiom,[]) ).

fof(f204,plain,
    ! [X0] :
      ( ? [X2] :
          ( ? [X3] :
              ( ? [X4] :
                  ( ? [X5] :
                      ( ~ lt(sK19(X0),X2)
                      & app(app(X3,cons(sK19(X0),X4)),cons(X2,X5)) = X0
                      & ssList(X5) )
                  & ssList(X4) )
              & ssList(X3) )
          & ssItem(X2) )
     => ( ? [X3] :
            ( ? [X4] :
                ( ? [X5] :
                    ( ~ lt(sK19(X0),sK20(X0))
                    & app(app(X3,cons(sK19(X0),X4)),cons(sK20(X0),X5)) = X0
                    & ssList(X5) )
                & ssList(X4) )
            & ssList(X3) )
        & ssItem(sK20(X0)) ) ),
    introduced(choice_axiom,[]) ).

fof(f205,plain,
    ! [X0] :
      ( ? [X3] :
          ( ? [X4] :
              ( ? [X5] :
                  ( ~ lt(sK19(X0),sK20(X0))
                  & app(app(X3,cons(sK19(X0),X4)),cons(sK20(X0),X5)) = X0
                  & ssList(X5) )
              & ssList(X4) )
          & ssList(X3) )
     => ( ? [X4] :
            ( ? [X5] :
                ( ~ lt(sK19(X0),sK20(X0))
                & app(app(sK21(X0),cons(sK19(X0),X4)),cons(sK20(X0),X5)) = X0
                & ssList(X5) )
            & ssList(X4) )
        & ssList(sK21(X0)) ) ),
    introduced(choice_axiom,[]) ).

fof(f206,plain,
    ! [X0] :
      ( ? [X4] :
          ( ? [X5] :
              ( ~ lt(sK19(X0),sK20(X0))
              & app(app(sK21(X0),cons(sK19(X0),X4)),cons(sK20(X0),X5)) = X0
              & ssList(X5) )
          & ssList(X4) )
     => ( ? [X5] :
            ( ~ lt(sK19(X0),sK20(X0))
            & app(app(sK21(X0),cons(sK19(X0),sK22(X0))),cons(sK20(X0),X5)) = X0
            & ssList(X5) )
        & ssList(sK22(X0)) ) ),
    introduced(choice_axiom,[]) ).

fof(f207,plain,
    ! [X0] :
      ( ? [X5] :
          ( ~ lt(sK19(X0),sK20(X0))
          & app(app(sK21(X0),cons(sK19(X0),sK22(X0))),cons(sK20(X0),X5)) = X0
          & ssList(X5) )
     => ( ~ lt(sK19(X0),sK20(X0))
        & app(app(sK21(X0),cons(sK19(X0),sK22(X0))),cons(sK20(X0),sK23(X0))) = X0
        & ssList(sK23(X0)) ) ),
    introduced(choice_axiom,[]) ).

fof(f202,plain,
    ! [X0] :
      ( ( ( strictorderedP(X0)
          | ? [X1] :
              ( ? [X2] :
                  ( ? [X3] :
                      ( ? [X4] :
                          ( ? [X5] :
                              ( ~ lt(X1,X2)
                              & app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
                              & ssList(X5) )
                          & ssList(X4) )
                      & ssList(X3) )
                  & ssItem(X2) )
              & ssItem(X1) ) )
        & ( ! [X6] :
              ( ! [X7] :
                  ( ! [X8] :
                      ( ! [X9] :
                          ( ! [X10] :
                              ( lt(X6,X7)
                              | app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
                              | ~ ssList(X10) )
                          | ~ ssList(X9) )
                      | ~ ssList(X8) )
                  | ~ ssItem(X7) )
              | ~ ssItem(X6) )
          | ~ strictorderedP(X0) ) )
      | ~ ssList(X0) ),
    inference(rectify,[],[f201]) ).

fof(f201,plain,
    ! [X0] :
      ( ( ( strictorderedP(X0)
          | ? [X1] :
              ( ? [X2] :
                  ( ? [X3] :
                      ( ? [X4] :
                          ( ? [X5] :
                              ( ~ lt(X1,X2)
                              & app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
                              & ssList(X5) )
                          & ssList(X4) )
                      & ssList(X3) )
                  & ssItem(X2) )
              & ssItem(X1) ) )
        & ( ! [X1] :
              ( ! [X2] :
                  ( ! [X3] :
                      ( ! [X4] :
                          ( ! [X5] :
                              ( lt(X1,X2)
                              | app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
                              | ~ ssList(X5) )
                          | ~ ssList(X4) )
                      | ~ ssList(X3) )
                  | ~ ssItem(X2) )
              | ~ ssItem(X1) )
          | ~ strictorderedP(X0) ) )
      | ~ ssList(X0) ),
    inference(nnf_transformation,[],[f134]) ).

fof(f134,plain,
    ! [X0] :
      ( ( strictorderedP(X0)
      <=> ! [X1] :
            ( ! [X2] :
                ( ! [X3] :
                    ( ! [X4] :
                        ( ! [X5] :
                            ( lt(X1,X2)
                            | app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
                            | ~ ssList(X5) )
                        | ~ ssList(X4) )
                    | ~ ssList(X3) )
                | ~ ssItem(X2) )
            | ~ ssItem(X1) ) )
      | ~ ssList(X0) ),
    inference(flattening,[],[f133]) ).

fof(f133,plain,
    ! [X0] :
      ( ( strictorderedP(X0)
      <=> ! [X1] :
            ( ! [X2] :
                ( ! [X3] :
                    ( ! [X4] :
                        ( ! [X5] :
                            ( lt(X1,X2)
                            | app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
                            | ~ ssList(X5) )
                        | ~ ssList(X4) )
                    | ~ ssList(X3) )
                | ~ ssItem(X2) )
            | ~ ssItem(X1) ) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f12]) ).

fof(f12,axiom,
    ! [X0] :
      ( ssList(X0)
     => ( strictorderedP(X0)
      <=> ! [X1] :
            ( ssItem(X1)
           => ! [X2] :
                ( ssItem(X2)
               => ! [X3] :
                    ( ssList(X3)
                   => ! [X4] :
                        ( ssList(X4)
                       => ! [X5] :
                            ( ssList(X5)
                           => ( app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
                             => lt(X1,X2) ) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.vdMGQuDIyQ/Vampire---4.8_9163',ax12) ).

fof(f1256,plain,
    ~ spl45_57,
    inference(avatar_contradiction_clause,[],[f1255]) ).

fof(f1255,plain,
    ( $false
    | ~ spl45_57 ),
    inference(subsumption_resolution,[],[f1246,f259]) ).

fof(f1246,plain,
    ( ~ ssItem(sK10)
    | ~ spl45_57 ),
    inference(resolution,[],[f1054,f403]) ).

fof(f403,plain,
    ! [X1] :
      ( ~ lt(X1,X1)
      | ~ ssItem(X1) ),
    inference(duplicate_literal_removal,[],[f390]) ).

fof(f390,plain,
    ! [X1] :
      ( ~ lt(X1,X1)
      | ~ ssItem(X1)
      | ~ ssItem(X1) ),
    inference(equality_resolution,[],[f293]) ).

fof(f293,plain,
    ! [X0,X1] :
      ( X0 != X1
      | ~ lt(X0,X1)
      | ~ ssItem(X1)
      | ~ ssItem(X0) ),
    inference(cnf_transformation,[],[f197]) ).

fof(f197,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( ( lt(X0,X1)
              | ~ leq(X0,X1)
              | X0 = X1 )
            & ( ( leq(X0,X1)
                & X0 != X1 )
              | ~ lt(X0,X1) ) )
          | ~ ssItem(X1) )
      | ~ ssItem(X0) ),
    inference(flattening,[],[f196]) ).

fof(f196,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( ( lt(X0,X1)
              | ~ leq(X0,X1)
              | X0 = X1 )
            & ( ( leq(X0,X1)
                & X0 != X1 )
              | ~ lt(X0,X1) ) )
          | ~ ssItem(X1) )
      | ~ ssItem(X0) ),
    inference(nnf_transformation,[],[f121]) ).

fof(f121,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( lt(X0,X1)
          <=> ( leq(X0,X1)
              & X0 != X1 ) )
          | ~ ssItem(X1) )
      | ~ ssItem(X0) ),
    inference(ennf_transformation,[],[f93]) ).

fof(f93,axiom,
    ! [X0] :
      ( ssItem(X0)
     => ! [X1] :
          ( ssItem(X1)
         => ( lt(X0,X1)
          <=> ( leq(X0,X1)
              & X0 != X1 ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.vdMGQuDIyQ/Vampire---4.8_9163',ax93) ).

fof(f1054,plain,
    ( lt(sK10,sK10)
    | ~ spl45_57 ),
    inference(avatar_component_clause,[],[f1052]) ).

fof(f569,plain,
    ( ~ spl45_5
    | spl45_6 ),
    inference(avatar_contradiction_clause,[],[f568]) ).

fof(f568,plain,
    ( $false
    | ~ spl45_5
    | spl45_6 ),
    inference(subsumption_resolution,[],[f567,f261]) ).

fof(f567,plain,
    ( ~ ssList(sK12)
    | ~ spl45_5
    | spl45_6 ),
    inference(subsumption_resolution,[],[f565,f471]) ).

fof(f471,plain,
    ( ssList(cons(sK10,nil))
    | ~ spl45_5 ),
    inference(avatar_component_clause,[],[f470]) ).

fof(f470,plain,
    ( spl45_5
  <=> ssList(cons(sK10,nil)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl45_5])]) ).

fof(f565,plain,
    ( ~ ssList(cons(sK10,nil))
    | ~ ssList(sK12)
    | spl45_6 ),
    inference(resolution,[],[f480,f287]) ).

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

fof(f118,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/tmp/tmp.vdMGQuDIyQ/Vampire---4.8_9163',ax26) ).

fof(f480,plain,
    ( ~ ssList(app(sK12,cons(sK10,nil)))
    | spl45_6 ),
    inference(avatar_component_clause,[],[f478]) ).

fof(f478,plain,
    ( spl45_6
  <=> ssList(app(sK12,cons(sK10,nil))) ),
    introduced(avatar_definition,[new_symbols(naming,[spl45_6])]) ).

fof(f551,plain,
    spl45_5,
    inference(avatar_contradiction_clause,[],[f550]) ).

fof(f550,plain,
    ( $false
    | spl45_5 ),
    inference(subsumption_resolution,[],[f549,f292]) ).

fof(f549,plain,
    ( ~ ssList(nil)
    | spl45_5 ),
    inference(subsumption_resolution,[],[f547,f259]) ).

fof(f547,plain,
    ( ~ ssItem(sK10)
    | ~ ssList(nil)
    | spl45_5 ),
    inference(resolution,[],[f472,f276]) ).

fof(f276,plain,
    ! [X0,X1] :
      ( ssList(cons(X1,X0))
      | ~ ssItem(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f107]) ).

fof(f107,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/tmp/tmp.vdMGQuDIyQ/Vampire---4.8_9163',ax16) ).

fof(f472,plain,
    ( ~ ssList(cons(sK10,nil))
    | spl45_5 ),
    inference(avatar_component_clause,[],[f470]) ).

fof(f535,plain,
    ( ~ spl45_6
    | spl45_7
    | ~ spl45_5 ),
    inference(avatar_split_clause,[],[f534,f470,f482,f478]) ).

fof(f534,plain,
    ( ~ ssList(cons(sK10,nil))
    | sK8 = app(app(sK12,cons(sK10,nil)),app(cons(sK10,nil),sK13))
    | ~ ssList(app(sK12,cons(sK10,nil))) ),
    inference(forward_demodulation,[],[f533,f416]) ).

fof(f416,plain,
    sK10 = sK11,
    inference(subsumption_resolution,[],[f415,f259]) ).

fof(f415,plain,
    ( sK10 = sK11
    | ~ ssItem(sK10) ),
    inference(subsumption_resolution,[],[f413,f260]) ).

fof(f260,plain,
    ssItem(sK11),
    inference(cnf_transformation,[],[f185]) ).

fof(f413,plain,
    ( sK10 = sK11
    | ~ ssItem(sK11)
    | ~ ssItem(sK10) ),
    inference(resolution,[],[f264,f291]) ).

fof(f291,plain,
    ! [X0,X1] :
      ( neq(X0,X1)
      | X0 = X1
      | ~ ssItem(X1)
      | ~ ssItem(X0) ),
    inference(cnf_transformation,[],[f195]) ).

fof(f195,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( ( neq(X0,X1)
              | X0 = X1 )
            & ( X0 != X1
              | ~ neq(X0,X1) ) )
          | ~ ssItem(X1) )
      | ~ ssItem(X0) ),
    inference(nnf_transformation,[],[f120]) ).

fof(f120,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( neq(X0,X1)
          <=> X0 != X1 )
          | ~ ssItem(X1) )
      | ~ ssItem(X0) ),
    inference(ennf_transformation,[],[f1]) ).

fof(f1,axiom,
    ! [X0] :
      ( ssItem(X0)
     => ! [X1] :
          ( ssItem(X1)
         => ( neq(X0,X1)
          <=> X0 != X1 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.vdMGQuDIyQ/Vampire---4.8_9163',ax1) ).

fof(f264,plain,
    ~ neq(sK10,sK11),
    inference(cnf_transformation,[],[f185]) ).

fof(f533,plain,
    ( sK8 = app(app(sK12,cons(sK10,nil)),app(cons(sK10,nil),sK13))
    | ~ ssList(cons(sK11,nil))
    | ~ ssList(app(sK12,cons(sK10,nil))) ),
    inference(forward_demodulation,[],[f532,f416]) ).

fof(f532,plain,
    ( sK8 = app(app(sK12,cons(sK10,nil)),app(cons(sK11,nil),sK13))
    | ~ ssList(cons(sK11,nil))
    | ~ ssList(app(sK12,cons(sK10,nil))) ),
    inference(subsumption_resolution,[],[f460,f262]) ).

fof(f460,plain,
    ( sK8 = app(app(sK12,cons(sK10,nil)),app(cons(sK11,nil),sK13))
    | ~ ssList(sK13)
    | ~ ssList(cons(sK11,nil))
    | ~ ssList(app(sK12,cons(sK10,nil))) ),
    inference(superposition,[],[f281,f383]) ).

fof(f383,plain,
    sK8 = app(app(app(sK12,cons(sK10,nil)),cons(sK11,nil)),sK13),
    inference(definition_unfolding,[],[f263,f254]) ).

fof(f254,plain,
    sK6 = sK8,
    inference(cnf_transformation,[],[f185]) ).

fof(f263,plain,
    sK6 = app(app(app(sK12,cons(sK10,nil)),cons(sK11,nil)),sK13),
    inference(cnf_transformation,[],[f185]) ).

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

fof(f110,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/tmp/tmp.vdMGQuDIyQ/Vampire---4.8_9163',ax82) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : SWC175+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.15  % 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.14/0.35  % Computer : n016.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Tue Apr 30 18:57:12 EDT 2024
% 0.14/0.36  % CPUTime    : 
% 0.14/0.36  This is a FOF_THM_RFO_SEQ problem
% 0.14/0.36  Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.vdMGQuDIyQ/Vampire---4.8_9163
% 0.59/0.78  % (9358)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.59/0.78  % (9355)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 Vampire---4 for (2995ds/34Mi)
% 0.59/0.78  % (9357)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.59/0.78  % (9356)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 Vampire---4 for (2995ds/51Mi)
% 0.59/0.78  % (9360)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.59/0.78  % (9359)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 Vampire---4 for (2995ds/34Mi)
% 0.59/0.78  % (9362)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2995ds/56Mi)
% 0.59/0.78  % (9361)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 Vampire---4 for (2995ds/83Mi)
% 0.61/0.80  % (9358)Instruction limit reached!
% 0.61/0.80  % (9358)------------------------------
% 0.61/0.80  % (9358)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.80  % (9358)Termination reason: Unknown
% 0.61/0.80  % (9358)Termination phase: Saturation
% 0.61/0.80  
% 0.61/0.80  % (9358)Memory used [KB]: 1682
% 0.61/0.80  % (9358)Time elapsed: 0.019 s
% 0.61/0.80  % (9358)Instructions burned: 34 (million)
% 0.61/0.80  % (9358)------------------------------
% 0.61/0.80  % (9358)------------------------------
% 0.61/0.80  % (9359)Instruction limit reached!
% 0.61/0.80  % (9359)------------------------------
% 0.61/0.80  % (9359)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.80  % (9359)Termination reason: Unknown
% 0.61/0.80  % (9359)Termination phase: Saturation
% 0.61/0.80  
% 0.61/0.80  % (9359)Memory used [KB]: 2028
% 0.61/0.80  % (9359)Time elapsed: 0.021 s
% 0.61/0.80  % (9359)Instructions burned: 35 (million)
% 0.61/0.80  % (9359)------------------------------
% 0.61/0.80  % (9359)------------------------------
% 0.61/0.80  % (9355)Instruction limit reached!
% 0.61/0.80  % (9355)------------------------------
% 0.61/0.80  % (9355)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.80  % (9355)Termination reason: Unknown
% 0.61/0.80  % (9355)Termination phase: Saturation
% 0.61/0.80  
% 0.61/0.80  % (9355)Memory used [KB]: 1459
% 0.61/0.80  % (9355)Time elapsed: 0.022 s
% 0.61/0.80  % (9355)Instructions burned: 34 (million)
% 0.61/0.80  % (9355)------------------------------
% 0.61/0.80  % (9355)------------------------------
% 0.61/0.80  % (9365)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 Vampire---4 for (2995ds/55Mi)
% 0.61/0.81  % (9366)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 Vampire---4 for (2995ds/50Mi)
% 0.61/0.81  % (9368)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/208Mi)
% 0.61/0.81  % (9360)Instruction limit reached!
% 0.61/0.81  % (9360)------------------------------
% 0.61/0.81  % (9360)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.81  % (9360)Termination reason: Unknown
% 0.61/0.81  % (9360)Termination phase: Saturation
% 0.61/0.81  
% 0.61/0.81  % (9360)Memory used [KB]: 1593
% 0.61/0.81  % (9360)Time elapsed: 0.027 s
% 0.61/0.81  % (9360)Instructions burned: 45 (million)
% 0.61/0.81  % (9360)------------------------------
% 0.61/0.81  % (9360)------------------------------
% 0.61/0.81  % (9369)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 Vampire---4 for (2995ds/52Mi)
% 0.61/0.81  % (9362)Instruction limit reached!
% 0.61/0.81  % (9362)------------------------------
% 0.61/0.81  % (9362)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.81  % (9362)Termination reason: Unknown
% 0.61/0.81  % (9362)Termination phase: Saturation
% 0.61/0.81  
% 0.61/0.81  % (9362)Memory used [KB]: 1685
% 0.61/0.81  % (9362)Time elapsed: 0.031 s
% 0.61/0.81  % (9362)Instructions burned: 57 (million)
% 0.61/0.81  % (9362)------------------------------
% 0.61/0.81  % (9362)------------------------------
% 0.61/0.82  % (9356)Instruction limit reached!
% 0.61/0.82  % (9356)------------------------------
% 0.61/0.82  % (9356)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.82  % (9356)Termination reason: Unknown
% 0.61/0.82  % (9356)Termination phase: Saturation
% 0.61/0.82  
% 0.61/0.82  % (9356)Memory used [KB]: 2003
% 0.61/0.82  % (9356)Time elapsed: 0.033 s
% 0.61/0.82  % (9356)Instructions burned: 52 (million)
% 0.61/0.82  % (9356)------------------------------
% 0.61/0.82  % (9356)------------------------------
% 0.61/0.82  % (9370)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 Vampire---4 for (2995ds/518Mi)
% 0.61/0.82  % (9371)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 Vampire---4 for (2995ds/42Mi)
% 0.61/0.82  % (9361)Instruction limit reached!
% 0.61/0.82  % (9361)------------------------------
% 0.61/0.82  % (9361)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.82  % (9361)Termination reason: Unknown
% 0.61/0.82  % (9361)Termination phase: Saturation
% 0.61/0.82  
% 0.61/0.82  % (9361)Memory used [KB]: 2144
% 0.61/0.82  % (9361)Time elapsed: 0.042 s
% 0.61/0.82  % (9361)Instructions burned: 83 (million)
% 0.61/0.82  % (9361)------------------------------
% 0.61/0.82  % (9361)------------------------------
% 0.61/0.83  % (9357)Instruction limit reached!
% 0.61/0.83  % (9357)------------------------------
% 0.61/0.83  % (9357)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.83  % (9357)Termination reason: Unknown
% 0.61/0.83  % (9357)Termination phase: Saturation
% 0.61/0.83  
% 0.61/0.83  % (9357)Memory used [KB]: 1856
% 0.61/0.83  % (9357)Time elapsed: 0.046 s
% 0.61/0.83  % (9357)Instructions burned: 78 (million)
% 0.61/0.83  % (9357)------------------------------
% 0.61/0.83  % (9357)------------------------------
% 0.61/0.83  % (9373)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 Vampire---4 for (2995ds/243Mi)
% 0.61/0.83  % (9366)Instruction limit reached!
% 0.61/0.83  % (9366)------------------------------
% 0.61/0.83  % (9366)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.83  % (9376)lrs+1011_2:9_sil=2000:lsd=10:newcnf=on:i=117:sd=2:awrs=decay:ss=included:amm=off:ep=R_0 on Vampire---4 for (2995ds/117Mi)
% 0.61/0.83  % (9366)Termination reason: Unknown
% 0.61/0.83  % (9366)Termination phase: Saturation
% 0.61/0.83  
% 0.61/0.83  % (9366)Memory used [KB]: 1926
% 0.61/0.83  % (9366)Time elapsed: 0.027 s
% 0.61/0.83  % (9366)Instructions burned: 50 (million)
% 0.61/0.83  % (9366)------------------------------
% 0.61/0.83  % (9366)------------------------------
% 0.61/0.83  % (9365)Instruction limit reached!
% 0.61/0.83  % (9365)------------------------------
% 0.61/0.83  % (9365)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.83  % (9365)Termination reason: Unknown
% 0.61/0.83  % (9365)Termination phase: Saturation
% 0.61/0.83  
% 0.61/0.83  % (9365)Memory used [KB]: 2202
% 0.61/0.83  % (9365)Time elapsed: 0.030 s
% 0.61/0.83  % (9365)Instructions burned: 56 (million)
% 0.61/0.83  % (9365)------------------------------
% 0.61/0.83  % (9365)------------------------------
% 0.61/0.83  % (9377)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 Vampire---4 for (2995ds/143Mi)
% 0.61/0.84  % (9378)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 Vampire---4 for (2995ds/93Mi)
% 0.91/0.84  % (9369)Instruction limit reached!
% 0.91/0.84  % (9369)------------------------------
% 0.91/0.84  % (9369)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.91/0.84  % (9369)Termination reason: Unknown
% 0.91/0.84  % (9369)Termination phase: Saturation
% 0.91/0.84  
% 0.91/0.84  % (9369)Memory used [KB]: 1793
% 0.91/0.84  % (9369)Time elapsed: 0.030 s
% 0.91/0.84  % (9369)Instructions burned: 53 (million)
% 0.91/0.84  % (9369)------------------------------
% 0.91/0.84  % (9369)------------------------------
% 0.91/0.84  % (9371)Instruction limit reached!
% 0.91/0.84  % (9371)------------------------------
% 0.91/0.84  % (9371)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.91/0.84  % (9371)Termination reason: Unknown
% 0.91/0.84  % (9371)Termination phase: Saturation
% 0.91/0.84  
% 0.91/0.84  % (9371)Memory used [KB]: 2064
% 0.91/0.84  % (9371)Time elapsed: 0.026 s
% 0.91/0.84  % (9371)Instructions burned: 42 (million)
% 0.91/0.84  % (9371)------------------------------
% 0.91/0.84  % (9371)------------------------------
% 0.91/0.84  % (9379)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 Vampire---4 for (2995ds/62Mi)
% 0.91/0.85  % (9380)lrs+21_2461:262144_anc=none:drc=off:sil=2000:sp=occurrence:nwc=6.0:updr=off:st=3.0:i=32:sd=2:afp=4000:erml=3:nm=14:afq=2.0:uhcvi=on:ss=included:er=filter:abs=on:nicw=on:ile=on:sims=off:s2a=on:s2agt=50:s2at=-1.0:plsq=on:plsql=on:plsqc=2:plsqr=1,32:newcnf=on:bd=off:to=lpo_0 on Vampire---4 for (2995ds/32Mi)
% 0.91/0.87  % (9370)First to succeed.
% 0.91/0.87  % (9380)Instruction limit reached!
% 0.91/0.87  % (9380)------------------------------
% 0.91/0.87  % (9380)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.91/0.87  % (9380)Termination reason: Unknown
% 0.91/0.87  % (9380)Termination phase: Saturation
% 0.91/0.87  
% 0.91/0.87  % (9380)Memory used [KB]: 1453
% 0.91/0.87  % (9380)Time elapsed: 0.045 s
% 0.91/0.87  % (9380)Instructions burned: 33 (million)
% 0.91/0.87  % (9380)------------------------------
% 0.91/0.87  % (9380)------------------------------
% 0.91/0.87  % (9385)dis+1011_1:1_sil=16000:nwc=7.0:s2agt=64:s2a=on:i=1919:ss=axioms:sgt=8:lsd=50:sd=7_0 on Vampire---4 for (2995ds/1919Mi)
% 0.91/0.87  % (9370)Refutation found. Thanks to Tanya!
% 0.91/0.87  % SZS status Theorem for Vampire---4
% 0.91/0.87  % SZS output start Proof for Vampire---4
% See solution above
% 0.91/0.87  % (9370)------------------------------
% 0.91/0.87  % (9370)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.91/0.87  % (9370)Termination reason: Refutation
% 0.91/0.87  
% 0.91/0.87  % (9370)Memory used [KB]: 2110
% 0.91/0.87  % (9370)Time elapsed: 0.054 s
% 0.91/0.87  % (9370)Instructions burned: 96 (million)
% 0.91/0.87  % (9370)------------------------------
% 0.91/0.87  % (9370)------------------------------
% 0.91/0.87  % (9327)Success in time 0.488 s
% 0.91/0.87  % Vampire---4.8 exiting
%------------------------------------------------------------------------------