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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SWC421+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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n027.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 : Sun May  5 09:50:59 EDT 2024

% Result   : Theorem 0.59s 0.78s
% Output   : Refutation 0.59s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   30
% Syntax   : Number of formulae    :  127 (  13 unt;   0 def)
%            Number of atoms       :  748 ( 242 equ)
%            Maximal formula atoms :   54 (   5 avg)
%            Number of connectives : 1061 ( 440   ~; 425   |; 147   &)
%                                         (  17 <=>;  32  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   24 (   6 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :   20 (  18 usr;  16 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   5 con; 0-2 aty)
%            Number of variables   :  217 ( 172   !;  45   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1016,plain,
    $false,
    inference(avatar_sat_refutation,[],[f609,f614,f624,f655,f657,f669,f693,f709,f766,f797,f966,f968,f993,f996,f1003,f1006]) ).

fof(f1006,plain,
    ( ~ spl51_15
    | ~ spl51_17
    | spl51_9
    | spl51_7 ),
    inference(avatar_split_clause,[],[f1004,f606,f616,f661,f649]) ).

fof(f649,plain,
    ( spl51_15
  <=> ssList(nil) ),
    introduced(avatar_definition,[new_symbols(naming,[spl51_15])]) ).

fof(f661,plain,
    ( spl51_17
  <=> ssList(sK49) ),
    introduced(avatar_definition,[new_symbols(naming,[spl51_17])]) ).

fof(f616,plain,
    ( spl51_9
  <=> nil = sK49 ),
    introduced(avatar_definition,[new_symbols(naming,[spl51_9])]) ).

fof(f606,plain,
    ( spl51_7
  <=> neq(nil,sK49) ),
    introduced(avatar_definition,[new_symbols(naming,[spl51_7])]) ).

fof(f1004,plain,
    ( nil = sK49
    | ~ ssList(sK49)
    | ~ ssList(nil)
    | spl51_7 ),
    inference(resolution,[],[f608,f418]) ).

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

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

fof(f119,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/tmp/tmp.iEreBnPNzU/Vampire---4.8_31310',ax15) ).

fof(f608,plain,
    ( ~ neq(nil,sK49)
    | spl51_7 ),
    inference(avatar_component_clause,[],[f606]) ).

fof(f1003,plain,
    ( ~ spl51_15
    | ~ spl51_6
    | spl51_5 ),
    inference(avatar_split_clause,[],[f1002,f598,f602,f649]) ).

fof(f602,plain,
    ( spl51_6
  <=> ssItem(hd(sK49)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl51_6])]) ).

fof(f598,plain,
    ( spl51_5
  <=> ssList(cons(hd(sK49),nil)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl51_5])]) ).

fof(f1002,plain,
    ( ~ ssItem(hd(sK49))
    | ~ ssList(nil)
    | spl51_5 ),
    inference(resolution,[],[f600,f419]) ).

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

fof(f120,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/sandbox/tmp/tmp.iEreBnPNzU/Vampire---4.8_31310',ax16) ).

fof(f600,plain,
    ( ~ ssList(cons(hd(sK49),nil))
    | spl51_5 ),
    inference(avatar_component_clause,[],[f598]) ).

fof(f996,plain,
    ( ~ spl51_23
    | spl51_38 ),
    inference(avatar_split_clause,[],[f995,f990,f697]) ).

fof(f697,plain,
    ( spl51_23
  <=> ssList(sK50) ),
    introduced(avatar_definition,[new_symbols(naming,[spl51_23])]) ).

fof(f990,plain,
    ( spl51_38
  <=> sK50 = app(sK50,nil) ),
    introduced(avatar_definition,[new_symbols(naming,[spl51_38])]) ).

fof(f995,plain,
    ( ~ ssList(sK50)
    | spl51_38 ),
    inference(trivial_inequality_removal,[],[f994]) ).

fof(f994,plain,
    ( sK50 != sK50
    | ~ ssList(sK50)
    | spl51_38 ),
    inference(superposition,[],[f992,f513]) ).

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

fof(f202,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/tmp/tmp.iEreBnPNzU/Vampire---4.8_31310',ax84) ).

fof(f992,plain,
    ( sK50 != app(sK50,nil)
    | spl51_38 ),
    inference(avatar_component_clause,[],[f990]) ).

fof(f993,plain,
    ( ~ spl51_17
    | spl51_9
    | ~ spl51_6
    | ~ spl51_4
    | ~ spl51_38
    | ~ spl51_3
    | ~ spl51_22 ),
    inference(avatar_split_clause,[],[f988,f691,f590,f990,f594,f602,f616,f661]) ).

fof(f594,plain,
    ( spl51_4
  <=> ssList(tl(sK49)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl51_4])]) ).

fof(f590,plain,
    ( spl51_3
  <=> sK50 = app(tl(sK49),cons(hd(sK49),nil)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl51_3])]) ).

fof(f691,plain,
    ( spl51_22
  <=> ! [X0,X1] :
        ( ~ ssItem(X0)
        | sK50 != app(app(X1,cons(X0,nil)),nil)
        | ~ ssList(X1)
        | sK49 != app(cons(X0,nil),X1) ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl51_22])]) ).

fof(f988,plain,
    ( sK50 != app(sK50,nil)
    | ~ ssList(tl(sK49))
    | ~ ssItem(hd(sK49))
    | nil = sK49
    | ~ ssList(sK49)
    | ~ spl51_3
    | ~ spl51_22 ),
    inference(forward_demodulation,[],[f987,f592]) ).

fof(f592,plain,
    ( sK50 = app(tl(sK49),cons(hd(sK49),nil))
    | ~ spl51_3 ),
    inference(avatar_component_clause,[],[f590]) ).

fof(f987,plain,
    ( sK50 != app(app(tl(sK49),cons(hd(sK49),nil)),nil)
    | ~ ssList(tl(sK49))
    | ~ ssItem(hd(sK49))
    | nil = sK49
    | ~ ssList(sK49)
    | ~ spl51_22 ),
    inference(equality_resolution,[],[f883]) ).

fof(f883,plain,
    ( ! [X0] :
        ( sK49 != X0
        | sK50 != app(app(tl(X0),cons(hd(X0),nil)),nil)
        | ~ ssList(tl(X0))
        | ~ ssItem(hd(X0))
        | nil = X0
        | ~ ssList(X0) )
    | ~ spl51_22 ),
    inference(superposition,[],[f879,f505]) ).

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

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

fof(f193,plain,
    ! [X0] :
      ( cons(hd(X0),tl(X0)) = X0
      | nil = X0
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f78]) ).

fof(f78,axiom,
    ! [X0] :
      ( ssList(X0)
     => ( nil != X0
       => cons(hd(X0),tl(X0)) = X0 ) ),
    file('/export/starexec/sandbox/tmp/tmp.iEreBnPNzU/Vampire---4.8_31310',ax78) ).

fof(f879,plain,
    ( ! [X0,X1] :
        ( cons(X0,X1) != sK49
        | sK50 != app(app(X1,cons(X0,nil)),nil)
        | ~ ssList(X1)
        | ~ ssItem(X0) )
    | ~ spl51_22 ),
    inference(duplicate_literal_removal,[],[f869]) ).

fof(f869,plain,
    ( ! [X0,X1] :
        ( cons(X0,X1) != sK49
        | sK50 != app(app(X1,cons(X0,nil)),nil)
        | ~ ssList(X1)
        | ~ ssItem(X0)
        | ~ ssItem(X0)
        | ~ ssList(X1) )
    | ~ spl51_22 ),
    inference(superposition,[],[f692,f508]) ).

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

fof(f199,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/sandbox/tmp/tmp.iEreBnPNzU/Vampire---4.8_31310',ax81) ).

fof(f692,plain,
    ( ! [X0,X1] :
        ( sK49 != app(cons(X0,nil),X1)
        | sK50 != app(app(X1,cons(X0,nil)),nil)
        | ~ ssList(X1)
        | ~ ssItem(X0) )
    | ~ spl51_22 ),
    inference(avatar_component_clause,[],[f691]) ).

fof(f968,plain,
    ( ~ spl51_17
    | spl51_9
    | spl51_4 ),
    inference(avatar_split_clause,[],[f967,f594,f616,f661]) ).

fof(f967,plain,
    ( nil = sK49
    | ~ ssList(sK49)
    | spl51_4 ),
    inference(resolution,[],[f596,f430]) ).

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

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

fof(f130,plain,
    ! [X0] :
      ( ssList(tl(X0))
      | nil = X0
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f24]) ).

fof(f24,axiom,
    ! [X0] :
      ( ssList(X0)
     => ( nil != X0
       => ssList(tl(X0)) ) ),
    file('/export/starexec/sandbox/tmp/tmp.iEreBnPNzU/Vampire---4.8_31310',ax24) ).

fof(f596,plain,
    ( ~ ssList(tl(sK49))
    | spl51_4 ),
    inference(avatar_component_clause,[],[f594]) ).

fof(f966,plain,
    ( ~ spl51_15
    | ~ spl51_8
    | ~ spl51_9 ),
    inference(avatar_split_clause,[],[f965,f616,f611,f649]) ).

fof(f611,plain,
    ( spl51_8
  <=> neq(sK49,nil) ),
    introduced(avatar_definition,[new_symbols(naming,[spl51_8])]) ).

fof(f965,plain,
    ( ~ ssList(nil)
    | ~ spl51_8
    | ~ spl51_9 ),
    inference(resolution,[],[f904,f578]) ).

fof(f578,plain,
    ! [X1] :
      ( ~ neq(X1,X1)
      | ~ ssList(X1) ),
    inference(duplicate_literal_removal,[],[f556]) ).

fof(f556,plain,
    ! [X1] :
      ( ~ neq(X1,X1)
      | ~ ssList(X1)
      | ~ ssList(X1) ),
    inference(equality_resolution,[],[f417]) ).

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

fof(f904,plain,
    ( neq(nil,nil)
    | ~ spl51_8
    | ~ spl51_9 ),
    inference(superposition,[],[f613,f618]) ).

fof(f618,plain,
    ( nil = sK49
    | ~ spl51_9 ),
    inference(avatar_component_clause,[],[f616]) ).

fof(f613,plain,
    ( neq(sK49,nil)
    | ~ spl51_8 ),
    inference(avatar_component_clause,[],[f611]) ).

fof(f797,plain,
    ( ~ spl51_4
    | ~ spl51_5
    | spl51_2 ),
    inference(avatar_split_clause,[],[f787,f586,f598,f594]) ).

fof(f586,plain,
    ( spl51_2
  <=> ssList(app(tl(sK49),cons(hd(sK49),nil))) ),
    introduced(avatar_definition,[new_symbols(naming,[spl51_2])]) ).

fof(f787,plain,
    ( ~ ssList(cons(hd(sK49),nil))
    | ~ ssList(tl(sK49))
    | spl51_2 ),
    inference(resolution,[],[f432,f588]) ).

fof(f588,plain,
    ( ~ ssList(app(tl(sK49),cons(hd(sK49),nil)))
    | spl51_2 ),
    inference(avatar_component_clause,[],[f586]) ).

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

fof(f133,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/tmp/tmp.iEreBnPNzU/Vampire---4.8_31310',ax26) ).

fof(f766,plain,
    ( ~ spl51_17
    | spl51_9
    | spl51_6 ),
    inference(avatar_split_clause,[],[f765,f602,f616,f661]) ).

fof(f765,plain,
    ( nil = sK49
    | ~ ssList(sK49)
    | spl51_6 ),
    inference(resolution,[],[f428,f604]) ).

fof(f604,plain,
    ( ~ ssItem(hd(sK49))
    | spl51_6 ),
    inference(avatar_component_clause,[],[f602]) ).

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

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

fof(f127,plain,
    ! [X0] :
      ( ssItem(hd(X0))
      | nil = X0
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f22]) ).

fof(f22,axiom,
    ! [X0] :
      ( ssList(X0)
     => ( nil != X0
       => ssItem(hd(X0)) ) ),
    file('/export/starexec/sandbox/tmp/tmp.iEreBnPNzU/Vampire---4.8_31310',ax22) ).

fof(f709,plain,
    spl51_23,
    inference(avatar_contradiction_clause,[],[f708]) ).

fof(f708,plain,
    ( $false
    | spl51_23 ),
    inference(resolution,[],[f699,f530]) ).

fof(f530,plain,
    ssList(sK50),
    inference(cnf_transformation,[],[f336]) ).

fof(f336,plain,
    ( ( ( ! [X4] :
            ( ! [X5] :
                ( ! [X6] :
                    ( ~ neq(nil,sK49)
                    | ! [X7] :
                        ( ~ neq(nil,sK49)
                        | hd(sK49) != X7
                        | cons(X7,nil) != X6
                        | ~ ssItem(X7) )
                    | app(X5,X6) != X4
                    | tl(sK49) != X5
                    | ~ ssList(X6) )
                | ~ ssList(X5) )
            | sK50 = X4
            | ~ ssList(X4) )
        & neq(sK49,nil) )
      | ~ neq(sK50,nil) )
    & ( nil != sK50
      | nil = sK49 )
    & ! [X8] :
        ( ! [X9] :
            ( ! [X10] :
                ( app(app(X10,cons(X8,nil)),X9) != sK47
                | app(app(X9,cons(X8,nil)),X10) != sK48
                | ~ ssList(X10) )
            | ~ ssList(X9) )
        | ~ ssItem(X8) )
    & neq(sK48,nil)
    & sK47 = sK49
    & sK48 = sK50
    & ssList(sK50)
    & ssList(sK49)
    & ssList(sK48)
    & ssList(sK47) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK47,sK48,sK49,sK50])],[f223,f335,f334,f333,f332]) ).

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

fof(f333,plain,
    ( ? [X1] :
        ( ? [X2] :
            ( ? [X3] :
                ( ( ( ! [X4] :
                        ( ! [X5] :
                            ( ! [X6] :
                                ( ~ neq(nil,X2)
                                | ! [X7] :
                                    ( ~ neq(nil,X2)
                                    | hd(X2) != X7
                                    | cons(X7,nil) != X6
                                    | ~ ssItem(X7) )
                                | app(X5,X6) != X4
                                | tl(X2) != X5
                                | ~ ssList(X6) )
                            | ~ ssList(X5) )
                        | X3 = X4
                        | ~ ssList(X4) )
                    & neq(X2,nil) )
                  | ~ neq(X3,nil) )
                & ( nil != X3
                  | nil = X2 )
                & ! [X8] :
                    ( ! [X9] :
                        ( ! [X10] :
                            ( app(app(X10,cons(X8,nil)),X9) != sK47
                            | app(app(X9,cons(X8,nil)),X10) != X1
                            | ~ ssList(X10) )
                        | ~ ssList(X9) )
                    | ~ ssItem(X8) )
                & neq(X1,nil)
                & sK47 = X2
                & X1 = X3
                & ssList(X3) )
            & ssList(X2) )
        & ssList(X1) )
   => ( ? [X2] :
          ( ? [X3] :
              ( ( ( ! [X4] :
                      ( ! [X5] :
                          ( ! [X6] :
                              ( ~ neq(nil,X2)
                              | ! [X7] :
                                  ( ~ neq(nil,X2)
                                  | hd(X2) != X7
                                  | cons(X7,nil) != X6
                                  | ~ ssItem(X7) )
                              | app(X5,X6) != X4
                              | tl(X2) != X5
                              | ~ ssList(X6) )
                          | ~ ssList(X5) )
                      | X3 = X4
                      | ~ ssList(X4) )
                  & neq(X2,nil) )
                | ~ neq(X3,nil) )
              & ( nil != X3
                | nil = X2 )
              & ! [X8] :
                  ( ! [X9] :
                      ( ! [X10] :
                          ( app(app(X10,cons(X8,nil)),X9) != sK47
                          | app(app(X9,cons(X8,nil)),X10) != sK48
                          | ~ ssList(X10) )
                      | ~ ssList(X9) )
                  | ~ ssItem(X8) )
              & neq(sK48,nil)
              & sK47 = X2
              & sK48 = X3
              & ssList(X3) )
          & ssList(X2) )
      & ssList(sK48) ) ),
    introduced(choice_axiom,[]) ).

fof(f334,plain,
    ( ? [X2] :
        ( ? [X3] :
            ( ( ( ! [X4] :
                    ( ! [X5] :
                        ( ! [X6] :
                            ( ~ neq(nil,X2)
                            | ! [X7] :
                                ( ~ neq(nil,X2)
                                | hd(X2) != X7
                                | cons(X7,nil) != X6
                                | ~ ssItem(X7) )
                            | app(X5,X6) != X4
                            | tl(X2) != X5
                            | ~ ssList(X6) )
                        | ~ ssList(X5) )
                    | X3 = X4
                    | ~ ssList(X4) )
                & neq(X2,nil) )
              | ~ neq(X3,nil) )
            & ( nil != X3
              | nil = X2 )
            & ! [X8] :
                ( ! [X9] :
                    ( ! [X10] :
                        ( app(app(X10,cons(X8,nil)),X9) != sK47
                        | app(app(X9,cons(X8,nil)),X10) != sK48
                        | ~ ssList(X10) )
                    | ~ ssList(X9) )
                | ~ ssItem(X8) )
            & neq(sK48,nil)
            & sK47 = X2
            & sK48 = X3
            & ssList(X3) )
        & ssList(X2) )
   => ( ? [X3] :
          ( ( ( ! [X4] :
                  ( ! [X5] :
                      ( ! [X6] :
                          ( ~ neq(nil,sK49)
                          | ! [X7] :
                              ( ~ neq(nil,sK49)
                              | hd(sK49) != X7
                              | cons(X7,nil) != X6
                              | ~ ssItem(X7) )
                          | app(X5,X6) != X4
                          | tl(sK49) != X5
                          | ~ ssList(X6) )
                      | ~ ssList(X5) )
                  | X3 = X4
                  | ~ ssList(X4) )
              & neq(sK49,nil) )
            | ~ neq(X3,nil) )
          & ( nil != X3
            | nil = sK49 )
          & ! [X8] :
              ( ! [X9] :
                  ( ! [X10] :
                      ( app(app(X10,cons(X8,nil)),X9) != sK47
                      | app(app(X9,cons(X8,nil)),X10) != sK48
                      | ~ ssList(X10) )
                  | ~ ssList(X9) )
              | ~ ssItem(X8) )
          & neq(sK48,nil)
          & sK47 = sK49
          & sK48 = X3
          & ssList(X3) )
      & ssList(sK49) ) ),
    introduced(choice_axiom,[]) ).

fof(f335,plain,
    ( ? [X3] :
        ( ( ( ! [X4] :
                ( ! [X5] :
                    ( ! [X6] :
                        ( ~ neq(nil,sK49)
                        | ! [X7] :
                            ( ~ neq(nil,sK49)
                            | hd(sK49) != X7
                            | cons(X7,nil) != X6
                            | ~ ssItem(X7) )
                        | app(X5,X6) != X4
                        | tl(sK49) != X5
                        | ~ ssList(X6) )
                    | ~ ssList(X5) )
                | X3 = X4
                | ~ ssList(X4) )
            & neq(sK49,nil) )
          | ~ neq(X3,nil) )
        & ( nil != X3
          | nil = sK49 )
        & ! [X8] :
            ( ! [X9] :
                ( ! [X10] :
                    ( app(app(X10,cons(X8,nil)),X9) != sK47
                    | app(app(X9,cons(X8,nil)),X10) != sK48
                    | ~ ssList(X10) )
                | ~ ssList(X9) )
            | ~ ssItem(X8) )
        & neq(sK48,nil)
        & sK47 = sK49
        & sK48 = X3
        & ssList(X3) )
   => ( ( ( ! [X4] :
              ( ! [X5] :
                  ( ! [X6] :
                      ( ~ neq(nil,sK49)
                      | ! [X7] :
                          ( ~ neq(nil,sK49)
                          | hd(sK49) != X7
                          | cons(X7,nil) != X6
                          | ~ ssItem(X7) )
                      | app(X5,X6) != X4
                      | tl(sK49) != X5
                      | ~ ssList(X6) )
                  | ~ ssList(X5) )
              | sK50 = X4
              | ~ ssList(X4) )
          & neq(sK49,nil) )
        | ~ neq(sK50,nil) )
      & ( nil != sK50
        | nil = sK49 )
      & ! [X8] :
          ( ! [X9] :
              ( ! [X10] :
                  ( app(app(X10,cons(X8,nil)),X9) != sK47
                  | app(app(X9,cons(X8,nil)),X10) != sK48
                  | ~ ssList(X10) )
              | ~ ssList(X9) )
          | ~ ssItem(X8) )
      & neq(sK48,nil)
      & sK47 = sK49
      & sK48 = sK50
      & ssList(sK50) ) ),
    introduced(choice_axiom,[]) ).

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

fof(f222,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ( ( ! [X4] :
                          ( ! [X5] :
                              ( ! [X6] :
                                  ( ~ neq(nil,X2)
                                  | ! [X7] :
                                      ( ~ neq(nil,X2)
                                      | hd(X2) != X7
                                      | cons(X7,nil) != X6
                                      | ~ ssItem(X7) )
                                  | app(X5,X6) != X4
                                  | tl(X2) != X5
                                  | ~ ssList(X6) )
                              | ~ ssList(X5) )
                          | X3 = X4
                          | ~ ssList(X4) )
                      & neq(X2,nil) )
                    | ~ neq(X3,nil) )
                  & ( nil != X3
                    | nil = X2 )
                  & ! [X8] :
                      ( ! [X9] :
                          ( ! [X10] :
                              ( app(app(X10,cons(X8,nil)),X9) != X0
                              | app(app(X9,cons(X8,nil)),X10) != X1
                              | ~ ssList(X10) )
                          | ~ ssList(X9) )
                      | ~ ssItem(X8) )
                  & 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] :
                              ( ? [X5] :
                                  ( ? [X6] :
                                      ( neq(nil,X2)
                                      & ? [X7] :
                                          ( neq(nil,X2)
                                          & hd(X2) = X7
                                          & cons(X7,nil) = X6
                                          & ssItem(X7) )
                                      & app(X5,X6) = X4
                                      & tl(X2) = X5
                                      & ssList(X6) )
                                  & ssList(X5) )
                              & X3 != X4
                              & ssList(X4) )
                          | ~ neq(X2,nil) )
                        & neq(X3,nil) )
                      | ( nil = X3
                        & nil != X2 )
                      | ? [X8] :
                          ( ? [X9] :
                              ( ? [X10] :
                                  ( app(app(X10,cons(X8,nil)),X9) = X0
                                  & app(app(X9,cons(X8,nil)),X10) = X1
                                  & ssList(X10) )
                              & ssList(X9) )
                          & ssItem(X8) )
                      | ~ 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)
                   => ( ( ( ? [X7] :
                              ( ? [X8] :
                                  ( ? [X9] :
                                      ( neq(nil,X2)
                                      & ? [X10] :
                                          ( neq(nil,X2)
                                          & hd(X2) = X10
                                          & cons(X10,nil) = X9
                                          & ssItem(X10) )
                                      & app(X8,X9) = X7
                                      & tl(X2) = X8
                                      & ssList(X9) )
                                  & ssList(X8) )
                              & X3 != X7
                              & ssList(X7) )
                          | ~ neq(X2,nil) )
                        & neq(X3,nil) )
                      | ( nil = X3
                        & nil != X2 )
                      | ? [X4] :
                          ( ? [X5] :
                              ( ? [X6] :
                                  ( app(app(X6,cons(X4,nil)),X5) = X0
                                  & app(app(X5,cons(X4,nil)),X6) = X1
                                  & ssList(X6) )
                              & ssList(X5) )
                          & ssItem(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)
                 => ( ( ( ? [X7] :
                            ( ? [X8] :
                                ( ? [X9] :
                                    ( neq(nil,X2)
                                    & ? [X10] :
                                        ( neq(nil,X2)
                                        & hd(X2) = X10
                                        & cons(X10,nil) = X9
                                        & ssItem(X10) )
                                    & app(X8,X9) = X7
                                    & tl(X2) = X8
                                    & ssList(X9) )
                                & ssList(X8) )
                            & X3 != X7
                            & ssList(X7) )
                        | ~ neq(X2,nil) )
                      & neq(X3,nil) )
                    | ( nil = X3
                      & nil != X2 )
                    | ? [X4] :
                        ( ? [X5] :
                            ( ? [X6] :
                                ( app(app(X6,cons(X4,nil)),X5) = X0
                                & app(app(X5,cons(X4,nil)),X6) = X1
                                & ssList(X6) )
                            & ssList(X5) )
                        & ssItem(X4) )
                    | ~ neq(X1,nil)
                    | X0 != X2
                    | X1 != X3 ) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.iEreBnPNzU/Vampire---4.8_31310',co1) ).

fof(f699,plain,
    ( ~ ssList(sK50)
    | spl51_23 ),
    inference(avatar_component_clause,[],[f697]) ).

fof(f693,plain,
    ( ~ spl51_15
    | spl51_22
    | ~ spl51_16 ),
    inference(avatar_split_clause,[],[f684,f653,f691,f649]) ).

fof(f653,plain,
    ( spl51_16
  <=> ! [X0,X1] :
        ( sK49 != app(cons(X0,nil),X1)
        | ~ ssList(cons(X0,nil))
        | ~ ssItem(X0)
        | ~ ssList(X1)
        | sK50 != app(app(X1,cons(X0,nil)),nil) ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl51_16])]) ).

fof(f684,plain,
    ( ! [X0,X1] :
        ( ~ ssItem(X0)
        | ~ ssList(nil)
        | sK49 != app(cons(X0,nil),X1)
        | ~ ssList(X1)
        | sK50 != app(app(X1,cons(X0,nil)),nil) )
    | ~ spl51_16 ),
    inference(duplicate_literal_removal,[],[f683]) ).

fof(f683,plain,
    ( ! [X0,X1] :
        ( ~ ssItem(X0)
        | ~ ssList(nil)
        | sK49 != app(cons(X0,nil),X1)
        | ~ ssItem(X0)
        | ~ ssList(X1)
        | sK50 != app(app(X1,cons(X0,nil)),nil) )
    | ~ spl51_16 ),
    inference(resolution,[],[f419,f654]) ).

fof(f654,plain,
    ( ! [X0,X1] :
        ( ~ ssList(cons(X0,nil))
        | sK49 != app(cons(X0,nil),X1)
        | ~ ssItem(X0)
        | ~ ssList(X1)
        | sK50 != app(app(X1,cons(X0,nil)),nil) )
    | ~ spl51_16 ),
    inference(avatar_component_clause,[],[f653]) ).

fof(f669,plain,
    spl51_17,
    inference(avatar_contradiction_clause,[],[f668]) ).

fof(f668,plain,
    ( $false
    | spl51_17 ),
    inference(resolution,[],[f663,f529]) ).

fof(f529,plain,
    ssList(sK49),
    inference(cnf_transformation,[],[f336]) ).

fof(f663,plain,
    ( ~ ssList(sK49)
    | spl51_17 ),
    inference(avatar_component_clause,[],[f661]) ).

fof(f657,plain,
    spl51_15,
    inference(avatar_contradiction_clause,[],[f656]) ).

fof(f656,plain,
    ( $false
    | spl51_15 ),
    inference(resolution,[],[f651,f420]) ).

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

fof(f17,axiom,
    ssList(nil),
    file('/export/starexec/sandbox/tmp/tmp.iEreBnPNzU/Vampire---4.8_31310',ax17) ).

fof(f651,plain,
    ( ~ ssList(nil)
    | spl51_15 ),
    inference(avatar_component_clause,[],[f649]) ).

fof(f655,plain,
    ( ~ spl51_15
    | spl51_16 ),
    inference(avatar_split_clause,[],[f647,f653,f649]) ).

fof(f647,plain,
    ! [X0,X1] :
      ( sK49 != app(cons(X0,nil),X1)
      | sK50 != app(app(X1,cons(X0,nil)),nil)
      | ~ ssList(nil)
      | ~ ssList(X1)
      | ~ ssItem(X0)
      | ~ ssList(cons(X0,nil)) ),
    inference(superposition,[],[f538,f434]) ).

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

fof(f135,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/tmp/tmp.iEreBnPNzU/Vampire---4.8_31310',ax28) ).

fof(f538,plain,
    ! [X10,X8,X9] :
      ( app(app(X10,cons(X8,nil)),X9) != sK49
      | app(app(X9,cons(X8,nil)),X10) != sK50
      | ~ ssList(X10)
      | ~ ssList(X9)
      | ~ ssItem(X8) ),
    inference(definition_unfolding,[],[f534,f532,f531]) ).

fof(f531,plain,
    sK48 = sK50,
    inference(cnf_transformation,[],[f336]) ).

fof(f532,plain,
    sK47 = sK49,
    inference(cnf_transformation,[],[f336]) ).

fof(f534,plain,
    ! [X10,X8,X9] :
      ( app(app(X10,cons(X8,nil)),X9) != sK47
      | app(app(X9,cons(X8,nil)),X10) != sK48
      | ~ ssList(X10)
      | ~ ssList(X9)
      | ~ ssItem(X8) ),
    inference(cnf_transformation,[],[f336]) ).

fof(f624,plain,
    spl51_1,
    inference(avatar_split_clause,[],[f539,f582]) ).

fof(f582,plain,
    ( spl51_1
  <=> neq(sK50,nil) ),
    introduced(avatar_definition,[new_symbols(naming,[spl51_1])]) ).

fof(f539,plain,
    neq(sK50,nil),
    inference(definition_unfolding,[],[f533,f531]) ).

fof(f533,plain,
    neq(sK48,nil),
    inference(cnf_transformation,[],[f336]) ).

fof(f614,plain,
    ( ~ spl51_1
    | spl51_8 ),
    inference(avatar_split_clause,[],[f536,f611,f582]) ).

fof(f536,plain,
    ( neq(sK49,nil)
    | ~ neq(sK50,nil) ),
    inference(cnf_transformation,[],[f336]) ).

fof(f609,plain,
    ( ~ spl51_1
    | ~ spl51_2
    | spl51_3
    | ~ spl51_4
    | ~ spl51_5
    | ~ spl51_6
    | ~ spl51_7 ),
    inference(avatar_split_clause,[],[f573,f606,f602,f598,f594,f590,f586,f582]) ).

fof(f573,plain,
    ( ~ neq(nil,sK49)
    | ~ ssItem(hd(sK49))
    | ~ ssList(cons(hd(sK49),nil))
    | ~ ssList(tl(sK49))
    | sK50 = app(tl(sK49),cons(hd(sK49),nil))
    | ~ ssList(app(tl(sK49),cons(hd(sK49),nil)))
    | ~ neq(sK50,nil) ),
    inference(duplicate_literal_removal,[],[f572]) ).

fof(f572,plain,
    ( ~ neq(nil,sK49)
    | ~ neq(nil,sK49)
    | ~ ssItem(hd(sK49))
    | ~ ssList(cons(hd(sK49),nil))
    | ~ ssList(tl(sK49))
    | sK50 = app(tl(sK49),cons(hd(sK49),nil))
    | ~ ssList(app(tl(sK49),cons(hd(sK49),nil)))
    | ~ neq(sK50,nil) ),
    inference(equality_resolution,[],[f571]) ).

fof(f571,plain,
    ! [X5] :
      ( ~ neq(nil,sK49)
      | ~ neq(nil,sK49)
      | ~ ssItem(hd(sK49))
      | tl(sK49) != X5
      | ~ ssList(cons(hd(sK49),nil))
      | ~ ssList(X5)
      | sK50 = app(X5,cons(hd(sK49),nil))
      | ~ ssList(app(X5,cons(hd(sK49),nil)))
      | ~ neq(sK50,nil) ),
    inference(equality_resolution,[],[f570]) ).

fof(f570,plain,
    ! [X4,X5] :
      ( ~ neq(nil,sK49)
      | ~ neq(nil,sK49)
      | ~ ssItem(hd(sK49))
      | app(X5,cons(hd(sK49),nil)) != X4
      | tl(sK49) != X5
      | ~ ssList(cons(hd(sK49),nil))
      | ~ ssList(X5)
      | sK50 = X4
      | ~ ssList(X4)
      | ~ neq(sK50,nil) ),
    inference(equality_resolution,[],[f569]) ).

fof(f569,plain,
    ! [X6,X4,X5] :
      ( ~ neq(nil,sK49)
      | ~ neq(nil,sK49)
      | cons(hd(sK49),nil) != X6
      | ~ ssItem(hd(sK49))
      | app(X5,X6) != X4
      | tl(sK49) != X5
      | ~ ssList(X6)
      | ~ ssList(X5)
      | sK50 = X4
      | ~ ssList(X4)
      | ~ neq(sK50,nil) ),
    inference(equality_resolution,[],[f537]) ).

fof(f537,plain,
    ! [X6,X7,X4,X5] :
      ( ~ neq(nil,sK49)
      | ~ neq(nil,sK49)
      | hd(sK49) != X7
      | cons(X7,nil) != X6
      | ~ ssItem(X7)
      | app(X5,X6) != X4
      | tl(sK49) != X5
      | ~ ssList(X6)
      | ~ ssList(X5)
      | sK50 = X4
      | ~ ssList(X4)
      | ~ neq(sK50,nil) ),
    inference(cnf_transformation,[],[f336]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : SWC421+1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.15  % 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.14/0.36  % Computer : n027.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit   : 300
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Fri May  3 20:24:23 EDT 2024
% 0.14/0.36  % CPUTime    : 
% 0.14/0.36  This is a FOF_THM_RFO_SEQ problem
% 0.14/0.37  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/tmp/tmp.iEreBnPNzU/Vampire---4.8_31310
% 0.59/0.75  % (31572)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 (2996ds/83Mi)
% 0.59/0.76  % (31566)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 (2996ds/34Mi)
% 0.59/0.76  % (31567)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 (2996ds/51Mi)
% 0.59/0.76  % (31569)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.59/0.76  % (31568)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.59/0.76  % (31570)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 (2996ds/34Mi)
% 0.59/0.76  % (31571)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.59/0.76  % (31573)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 (2996ds/56Mi)
% 0.59/0.77  % (31569)Instruction limit reached!
% 0.59/0.77  % (31569)------------------------------
% 0.59/0.77  % (31569)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.77  % (31570)Instruction limit reached!
% 0.59/0.77  % (31570)------------------------------
% 0.59/0.77  % (31570)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.77  % (31570)Termination reason: Unknown
% 0.59/0.77  % (31570)Termination phase: Saturation
% 0.59/0.77  
% 0.59/0.77  % (31570)Memory used [KB]: 2037
% 0.59/0.77  % (31570)Time elapsed: 0.020 s
% 0.59/0.77  % (31570)Instructions burned: 34 (million)
% 0.59/0.77  % (31570)------------------------------
% 0.59/0.77  % (31570)------------------------------
% 0.59/0.77  % (31569)Termination reason: Unknown
% 0.59/0.77  % (31569)Termination phase: Saturation
% 0.59/0.77  
% 0.59/0.77  % (31569)Memory used [KB]: 1626
% 0.59/0.77  % (31569)Time elapsed: 0.020 s
% 0.59/0.77  % (31569)Instructions burned: 34 (million)
% 0.59/0.77  % (31569)------------------------------
% 0.59/0.77  % (31569)------------------------------
% 0.59/0.77  % (31567)First to succeed.
% 0.59/0.77  % (31566)Instruction limit reached!
% 0.59/0.77  % (31566)------------------------------
% 0.59/0.77  % (31566)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.77  % (31566)Termination reason: Unknown
% 0.59/0.77  % (31566)Termination phase: Saturation
% 0.59/0.77  
% 0.59/0.77  % (31566)Memory used [KB]: 1532
% 0.59/0.77  % (31566)Time elapsed: 0.021 s
% 0.59/0.77  % (31566)Instructions burned: 34 (million)
% 0.59/0.77  % (31566)------------------------------
% 0.59/0.77  % (31566)------------------------------
% 0.59/0.78  % (31572)Instruction limit reached!
% 0.59/0.78  % (31572)------------------------------
% 0.59/0.78  % (31572)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.78  % (31572)Termination reason: Unknown
% 0.59/0.78  % (31572)Termination phase: Saturation
% 0.59/0.78  
% 0.59/0.78  % (31572)Memory used [KB]: 2035
% 0.59/0.78  % (31572)Time elapsed: 0.024 s
% 0.59/0.78  % (31572)Instructions burned: 83 (million)
% 0.59/0.78  % (31572)------------------------------
% 0.59/0.78  % (31572)------------------------------
% 0.59/0.78  % (31567)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-31562"
% 0.59/0.78  % (31567)Refutation found. Thanks to Tanya!
% 0.59/0.78  % SZS status Theorem for Vampire---4
% 0.59/0.78  % SZS output start Proof for Vampire---4
% See solution above
% 0.59/0.78  % (31567)------------------------------
% 0.59/0.78  % (31567)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.78  % (31567)Termination reason: Refutation
% 0.59/0.78  
% 0.59/0.78  % (31567)Memory used [KB]: 1583
% 0.59/0.78  % (31567)Time elapsed: 0.023 s
% 0.59/0.78  % (31567)Instructions burned: 37 (million)
% 0.59/0.78  % (31562)Success in time 0.393 s
% 0.59/0.78  % Vampire---4.8 exiting
%------------------------------------------------------------------------------