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

View Problem - Process Solution

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

% Computer : n011.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue May 21 04:36:10 EDT 2024

% Result   : Theorem 0.64s 0.84s
% Output   : Refutation 0.64s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :   20
% Syntax   : Number of formulae    :  101 (  19 unt;   0 def)
%            Number of atoms       :  472 ( 102 equ)
%            Maximal formula atoms :   30 (   4 avg)
%            Number of connectives :  570 ( 199   ~; 180   |; 148   &)
%                                         (   8 <=>;  35  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   5 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    9 (   7 usr;   5 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   7 con; 0-2 aty)
%            Number of variables   :  158 (  95   !;  63   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f742,plain,
    $false,
    inference(avatar_sat_refutation,[],[f556,f592,f676,f678,f711]) ).

fof(f711,plain,
    ~ spl12_10,
    inference(avatar_contradiction_clause,[],[f710]) ).

fof(f710,plain,
    ( $false
    | ~ spl12_10 ),
    inference(subsumption_resolution,[],[f689,f222]) ).

fof(f222,plain,
    ~ segmentP(sK2,sK3),
    inference(subsumption_resolution,[],[f221,f205]) ).

fof(f205,plain,
    neq(sK3,nil),
    inference(definition_unfolding,[],[f160,f158]) ).

fof(f158,plain,
    sK1 = sK3,
    inference(cnf_transformation,[],[f137]) ).

fof(f137,plain,
    ( sK2 = app(sK5,sK4)
    & sK3 = app(sK4,sK5)
    & ssList(sK5)
    & ssList(sK4)
    & ! [X6] :
        ( ~ segmentP(sK0,X6)
        | ~ segmentP(sK1,X6)
        | ~ neq(X6,nil)
        | ~ ssList(X6) )
    & neq(sK1,nil)
    & sK0 = sK2
    & sK1 = sK3
    & ssList(sK3)
    & ssList(sK2)
    & ssList(sK1)
    & ssList(sK0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f100,f136,f135,f134,f133,f132,f131]) ).

fof(f131,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(sK0,X6)
                      | ~ segmentP(X1,X6)
                      | ~ neq(X6,nil)
                      | ~ ssList(X6) )
                  & neq(X1,nil)
                  & sK0 = X2
                  & X1 = X3
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(sK0) ) ),
    introduced(choice_axiom,[]) ).

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

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

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

fof(f135,plain,
    ( ? [X4] :
        ( ? [X5] :
            ( app(X5,X4) = sK2
            & app(X4,X5) = sK3
            & ssList(X5) )
        & ssList(X4) )
   => ( ? [X5] :
          ( sK2 = app(X5,sK4)
          & sK3 = app(sK4,X5)
          & ssList(X5) )
      & ssList(sK4) ) ),
    introduced(choice_axiom,[]) ).

fof(f136,plain,
    ( ? [X5] :
        ( sK2 = app(X5,sK4)
        & sK3 = app(sK4,X5)
        & ssList(X5) )
   => ( sK2 = app(sK5,sK4)
      & sK3 = app(sK4,sK5)
      & ssList(sK5) ) ),
    introduced(choice_axiom,[]) ).

fof(f100,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,[],[f99]) ).

fof(f99,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(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(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(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/sandbox/benchmark/theBenchmark.p',co1) ).

fof(f160,plain,
    neq(sK1,nil),
    inference(cnf_transformation,[],[f137]) ).

fof(f221,plain,
    ( ~ segmentP(sK2,sK3)
    | ~ neq(sK3,nil) ),
    inference(subsumption_resolution,[],[f220,f157]) ).

fof(f157,plain,
    ssList(sK3),
    inference(cnf_transformation,[],[f137]) ).

fof(f220,plain,
    ( ~ ssList(sK3)
    | ~ segmentP(sK2,sK3)
    | ~ neq(sK3,nil) ),
    inference(duplicate_literal_removal,[],[f219]) ).

fof(f219,plain,
    ( ~ ssList(sK3)
    | ~ segmentP(sK2,sK3)
    | ~ neq(sK3,nil)
    | ~ ssList(sK3) ),
    inference(resolution,[],[f186,f204]) ).

fof(f204,plain,
    ! [X6] :
      ( ~ segmentP(sK3,X6)
      | ~ segmentP(sK2,X6)
      | ~ neq(X6,nil)
      | ~ ssList(X6) ),
    inference(definition_unfolding,[],[f161,f159,f158]) ).

fof(f159,plain,
    sK0 = sK2,
    inference(cnf_transformation,[],[f137]) ).

fof(f161,plain,
    ! [X6] :
      ( ~ segmentP(sK0,X6)
      | ~ segmentP(sK1,X6)
      | ~ neq(X6,nil)
      | ~ ssList(X6) ),
    inference(cnf_transformation,[],[f137]) ).

fof(f186,plain,
    ! [X0] :
      ( segmentP(X0,X0)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f118]) ).

fof(f118,plain,
    ! [X0] :
      ( segmentP(X0,X0)
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f55]) ).

fof(f55,axiom,
    ! [X0] :
      ( ssList(X0)
     => segmentP(X0,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax55) ).

fof(f689,plain,
    ( segmentP(sK2,sK3)
    | ~ spl12_10 ),
    inference(backward_demodulation,[],[f485,f363]) ).

fof(f363,plain,
    ( sK3 = sK4
    | ~ spl12_10 ),
    inference(avatar_component_clause,[],[f362]) ).

fof(f362,plain,
    ( spl12_10
  <=> sK3 = sK4 ),
    introduced(avatar_definition,[new_symbols(naming,[spl12_10])]) ).

fof(f485,plain,
    segmentP(sK2,sK4),
    inference(subsumption_resolution,[],[f484,f181]) ).

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

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

fof(f484,plain,
    ( ~ ssList(nil)
    | segmentP(sK2,sK4) ),
    inference(subsumption_resolution,[],[f481,f156]) ).

fof(f156,plain,
    ssList(sK2),
    inference(cnf_transformation,[],[f137]) ).

fof(f481,plain,
    ( ~ ssList(sK2)
    | ~ ssList(nil)
    | segmentP(sK2,sK4) ),
    inference(duplicate_literal_removal,[],[f480]) ).

fof(f480,plain,
    ( ~ ssList(sK2)
    | ~ ssList(nil)
    | segmentP(sK2,sK4)
    | ~ ssList(sK2) ),
    inference(superposition,[],[f469,f166]) ).

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

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

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

fof(f469,plain,
    ! [X0] :
      ( ~ ssList(app(sK2,X0))
      | ~ ssList(X0)
      | segmentP(app(sK2,X0),sK4) ),
    inference(subsumption_resolution,[],[f468,f162]) ).

fof(f162,plain,
    ssList(sK4),
    inference(cnf_transformation,[],[f137]) ).

fof(f468,plain,
    ! [X0] :
      ( ~ ssList(app(sK2,X0))
      | ~ ssList(X0)
      | ~ ssList(sK4)
      | segmentP(app(sK2,X0),sK4) ),
    inference(subsumption_resolution,[],[f458,f163]) ).

fof(f163,plain,
    ssList(sK5),
    inference(cnf_transformation,[],[f137]) ).

fof(f458,plain,
    ! [X0] :
      ( ~ ssList(app(sK2,X0))
      | ~ ssList(X0)
      | ~ ssList(sK5)
      | ~ ssList(sK4)
      | segmentP(app(sK2,X0),sK4) ),
    inference(superposition,[],[f213,f165]) ).

fof(f165,plain,
    sK2 = app(sK5,sK4),
    inference(cnf_transformation,[],[f137]) ).

fof(f213,plain,
    ! [X2,X3,X1] :
      ( ~ ssList(app(app(X2,X1),X3))
      | ~ ssList(X3)
      | ~ ssList(X2)
      | ~ ssList(X1)
      | segmentP(app(app(X2,X1),X3),X1) ),
    inference(equality_resolution,[],[f192]) ).

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

fof(f147,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( ( segmentP(X0,X1)
              | ! [X2] :
                  ( ! [X3] :
                      ( app(app(X2,X1),X3) != X0
                      | ~ ssList(X3) )
                  | ~ ssList(X2) ) )
            & ( ( app(app(sK6(X0,X1),X1),sK7(X0,X1)) = X0
                & ssList(sK7(X0,X1))
                & ssList(sK6(X0,X1)) )
              | ~ segmentP(X0,X1) ) )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7])],[f144,f146,f145]) ).

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

fof(f146,plain,
    ! [X0,X1] :
      ( ? [X5] :
          ( app(app(sK6(X0,X1),X1),X5) = X0
          & ssList(X5) )
     => ( app(app(sK6(X0,X1),X1),sK7(X0,X1)) = X0
        & ssList(sK7(X0,X1)) ) ),
    introduced(choice_axiom,[]) ).

fof(f144,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,[],[f143]) ).

fof(f143,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,[],[f123]) ).

fof(f123,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( segmentP(X0,X1)
          <=> ? [X2] :
                ( ? [X3] :
                    ( app(app(X2,X1),X3) = X0
                    & ssList(X3) )
                & ssList(X2) ) )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f7]) ).

fof(f7,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ( segmentP(X0,X1)
          <=> ? [X2] :
                ( ? [X3] :
                    ( app(app(X2,X1),X3) = X0
                    & ssList(X3) )
                & ssList(X2) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax7) ).

fof(f678,plain,
    ( ~ spl12_14
    | ~ spl12_15 ),
    inference(avatar_split_clause,[],[f677,f497,f493]) ).

fof(f493,plain,
    ( spl12_14
  <=> neq(sK5,nil) ),
    introduced(avatar_definition,[new_symbols(naming,[spl12_14])]) ).

fof(f497,plain,
    ( spl12_15
  <=> segmentP(sK2,sK5) ),
    introduced(avatar_definition,[new_symbols(naming,[spl12_15])]) ).

fof(f677,plain,
    ( ~ segmentP(sK2,sK5)
    | ~ neq(sK5,nil) ),
    inference(subsumption_resolution,[],[f616,f163]) ).

fof(f616,plain,
    ( ~ segmentP(sK2,sK5)
    | ~ neq(sK5,nil)
    | ~ ssList(sK5) ),
    inference(resolution,[],[f478,f204]) ).

fof(f478,plain,
    segmentP(sK3,sK5),
    inference(subsumption_resolution,[],[f477,f181]) ).

fof(f477,plain,
    ( ~ ssList(nil)
    | segmentP(sK3,sK5) ),
    inference(subsumption_resolution,[],[f474,f157]) ).

fof(f474,plain,
    ( ~ ssList(sK3)
    | ~ ssList(nil)
    | segmentP(sK3,sK5) ),
    inference(duplicate_literal_removal,[],[f473]) ).

fof(f473,plain,
    ( ~ ssList(sK3)
    | ~ ssList(nil)
    | segmentP(sK3,sK5)
    | ~ ssList(sK3) ),
    inference(superposition,[],[f467,f166]) ).

fof(f467,plain,
    ! [X0] :
      ( ~ ssList(app(sK3,X0))
      | ~ ssList(X0)
      | segmentP(app(sK3,X0),sK5) ),
    inference(subsumption_resolution,[],[f466,f163]) ).

fof(f466,plain,
    ! [X0] :
      ( ~ ssList(app(sK3,X0))
      | ~ ssList(X0)
      | ~ ssList(sK5)
      | segmentP(app(sK3,X0),sK5) ),
    inference(subsumption_resolution,[],[f457,f162]) ).

fof(f457,plain,
    ! [X0] :
      ( ~ ssList(app(sK3,X0))
      | ~ ssList(X0)
      | ~ ssList(sK4)
      | ~ ssList(sK5)
      | segmentP(app(sK3,X0),sK5) ),
    inference(superposition,[],[f213,f164]) ).

fof(f164,plain,
    sK3 = app(sK4,sK5),
    inference(cnf_transformation,[],[f137]) ).

fof(f676,plain,
    spl12_15,
    inference(avatar_split_clause,[],[f675,f497]) ).

fof(f675,plain,
    segmentP(sK2,sK5),
    inference(subsumption_resolution,[],[f674,f162]) ).

fof(f674,plain,
    ( segmentP(sK2,sK5)
    | ~ ssList(sK4) ),
    inference(subsumption_resolution,[],[f654,f163]) ).

fof(f654,plain,
    ( segmentP(sK2,sK5)
    | ~ ssList(sK5)
    | ~ ssList(sK4) ),
    inference(superposition,[],[f465,f165]) ).

fof(f465,plain,
    ! [X0,X1] :
      ( segmentP(app(X0,X1),X0)
      | ~ ssList(X0)
      | ~ ssList(X1) ),
    inference(subsumption_resolution,[],[f464,f176]) ).

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

fof(f111,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/sandbox/benchmark/theBenchmark.p',ax26) ).

fof(f464,plain,
    ! [X0,X1] :
      ( ~ ssList(app(X0,X1))
      | ~ ssList(X1)
      | ~ ssList(X0)
      | segmentP(app(X0,X1),X0) ),
    inference(subsumption_resolution,[],[f461,f181]) ).

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

fof(f456,plain,
    ! [X0,X1] :
      ( ~ ssList(app(X0,X1))
      | ~ ssList(X1)
      | ~ ssList(nil)
      | ~ ssList(X0)
      | segmentP(app(X0,X1),X0)
      | ~ ssList(X0) ),
    inference(superposition,[],[f213,f174]) ).

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

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

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

fof(f592,plain,
    ( ~ spl12_1
    | spl12_10 ),
    inference(avatar_contradiction_clause,[],[f591]) ).

fof(f591,plain,
    ( $false
    | ~ spl12_1
    | spl12_10 ),
    inference(subsumption_resolution,[],[f590,f162]) ).

fof(f590,plain,
    ( ~ ssList(sK4)
    | ~ spl12_1
    | spl12_10 ),
    inference(subsumption_resolution,[],[f578,f364]) ).

fof(f364,plain,
    ( sK3 != sK4
    | spl12_10 ),
    inference(avatar_component_clause,[],[f362]) ).

fof(f578,plain,
    ( sK3 = sK4
    | ~ ssList(sK4)
    | ~ spl12_1 ),
    inference(superposition,[],[f166,f558]) ).

fof(f558,plain,
    ( sK3 = app(sK4,nil)
    | ~ spl12_1 ),
    inference(backward_demodulation,[],[f164,f252]) ).

fof(f252,plain,
    ( nil = sK5
    | ~ spl12_1 ),
    inference(avatar_component_clause,[],[f250]) ).

fof(f250,plain,
    ( spl12_1
  <=> nil = sK5 ),
    introduced(avatar_definition,[new_symbols(naming,[spl12_1])]) ).

fof(f556,plain,
    ( spl12_1
    | spl12_14 ),
    inference(avatar_split_clause,[],[f555,f493,f250]) ).

fof(f555,plain,
    ( nil = sK5
    | spl12_14 ),
    inference(subsumption_resolution,[],[f554,f163]) ).

fof(f554,plain,
    ( nil = sK5
    | ~ ssList(sK5)
    | spl12_14 ),
    inference(subsumption_resolution,[],[f544,f181]) ).

fof(f544,plain,
    ( nil = sK5
    | ~ ssList(nil)
    | ~ ssList(sK5)
    | spl12_14 ),
    inference(resolution,[],[f495,f178]) ).

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

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

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

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

fof(f495,plain,
    ( ~ neq(sK5,nil)
    | spl12_14 ),
    inference(avatar_component_clause,[],[f493]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.10  % Problem    : SWC090+1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.11  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.11/0.32  % Computer : n011.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit   : 300
% 0.11/0.32  % WCLimit    : 300
% 0.11/0.32  % DateTime   : Sun May 19 02:44:22 EDT 2024
% 0.11/0.32  % CPUTime    : 
% 0.11/0.32  This is a FOF_THM_RFO_SEQ problem
% 0.11/0.32  Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.64/0.82  % (7762)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.64/0.82  % (7760)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2995ds/34Mi)
% 0.64/0.82  % (7761)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2995ds/51Mi)
% 0.64/0.82  % (7763)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.64/0.82  % (7764)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2995ds/34Mi)
% 0.64/0.82  % (7765)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.64/0.82  % (7766)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2995ds/83Mi)
% 0.64/0.82  % (7767)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2995ds/56Mi)
% 0.64/0.83  % (7763)Instruction limit reached!
% 0.64/0.83  % (7763)------------------------------
% 0.64/0.83  % (7763)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.64/0.83  % (7764)Instruction limit reached!
% 0.64/0.83  % (7764)------------------------------
% 0.64/0.83  % (7764)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.64/0.83  % (7764)Termination reason: Unknown
% 0.64/0.83  % (7764)Termination phase: Saturation
% 0.64/0.83  
% 0.64/0.83  % (7764)Memory used [KB]: 2028
% 0.64/0.83  % (7764)Time elapsed: 0.019 s
% 0.64/0.83  % (7764)Instructions burned: 35 (million)
% 0.64/0.83  % (7764)------------------------------
% 0.64/0.83  % (7764)------------------------------
% 0.64/0.83  % (7763)Termination reason: Unknown
% 0.64/0.83  % (7763)Termination phase: Saturation
% 0.64/0.83  
% 0.64/0.83  % (7763)Memory used [KB]: 1640
% 0.64/0.83  % (7763)Time elapsed: 0.019 s
% 0.64/0.83  % (7763)Instructions burned: 34 (million)
% 0.64/0.83  % (7763)------------------------------
% 0.64/0.83  % (7763)------------------------------
% 0.64/0.83  % (7760)Instruction limit reached!
% 0.64/0.83  % (7760)------------------------------
% 0.64/0.83  % (7760)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.64/0.83  % (7760)Termination reason: Unknown
% 0.64/0.83  % (7760)Termination phase: Saturation
% 0.64/0.83  
% 0.64/0.83  % (7760)Memory used [KB]: 1402
% 0.64/0.83  % (7760)Time elapsed: 0.020 s
% 0.64/0.83  % (7760)Instructions burned: 34 (million)
% 0.64/0.83  % (7760)------------------------------
% 0.64/0.83  % (7760)------------------------------
% 0.64/0.84  % (7762)First to succeed.
% 0.64/0.84  % (7762)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-7759"
% 0.64/0.84  % (7762)Refutation found. Thanks to Tanya!
% 0.64/0.84  % SZS status Theorem for theBenchmark
% 0.64/0.84  % SZS output start Proof for theBenchmark
% See solution above
% 0.64/0.84  % (7762)------------------------------
% 0.64/0.84  % (7762)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.64/0.84  % (7762)Termination reason: Refutation
% 0.64/0.84  
% 0.64/0.84  % (7762)Memory used [KB]: 1389
% 0.64/0.84  % (7762)Time elapsed: 0.022 s
% 0.64/0.84  % (7762)Instructions burned: 34 (million)
% 0.64/0.84  % (7759)Success in time 0.503 s
% 0.64/0.84  % Vampire---4.8 exiting
%------------------------------------------------------------------------------