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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SWC277+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 : n005.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:01:03 EDT 2024

% Result   : Theorem 0.56s 0.75s
% Output   : Refutation 0.56s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   22
% Syntax   : Number of formulae    :   83 (  16 unt;   0 def)
%            Number of atoms       :  301 (  57 equ)
%            Maximal formula atoms :   20 (   3 avg)
%            Number of connectives :  325 ( 107   ~;  94   |;  90   &)
%                                         (  16 <=>;  18  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   18 (  16 usr;  11 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   63 (  34   !;  29   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f735,plain,
    $false,
    inference(avatar_sat_refutation,[],[f580,f628,f647,f649,f651,f653,f669,f675,f710,f732,f734]) ).

fof(f734,plain,
    ~ spl51_15,
    inference(avatar_contradiction_clause,[],[f733]) ).

fof(f733,plain,
    ( $false
    | ~ spl51_15 ),
    inference(resolution,[],[f709,f535]) ).

fof(f535,plain,
    ~ totalorderedP(sK49),
    inference(definition_unfolding,[],[f533,f531]) ).

fof(f531,plain,
    sK47 = sK49,
    inference(cnf_transformation,[],[f335]) ).

fof(f335,plain,
    ( ( ~ neq(sK50,nil)
      | singletonP(sK49) )
    & ~ totalorderedP(sK47)
    & segmentP(sK50,sK49)
    & sK47 = sK49
    & sK48 = sK50
    & ssList(sK50)
    & ssList(sK49)
    & ssList(sK48)
    & ssList(sK47) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK47,sK48,sK49,sK50])],[f222,f334,f333,f332,f331]) ).

fof(f331,plain,
    ( ? [X0] :
        ( ? [X1] :
            ( ? [X2] :
                ( ? [X3] :
                    ( ( ~ neq(X3,nil)
                      | singletonP(X2) )
                    & ~ totalorderedP(X0)
                    & segmentP(X3,X2)
                    & X0 = X2
                    & X1 = X3
                    & ssList(X3) )
                & ssList(X2) )
            & ssList(X1) )
        & ssList(X0) )
   => ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ( ~ neq(X3,nil)
                    | singletonP(X2) )
                  & ~ totalorderedP(sK47)
                  & segmentP(X3,X2)
                  & sK47 = X2
                  & X1 = X3
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(sK47) ) ),
    introduced(choice_axiom,[]) ).

fof(f332,plain,
    ( ? [X1] :
        ( ? [X2] :
            ( ? [X3] :
                ( ( ~ neq(X3,nil)
                  | singletonP(X2) )
                & ~ totalorderedP(sK47)
                & segmentP(X3,X2)
                & sK47 = X2
                & X1 = X3
                & ssList(X3) )
            & ssList(X2) )
        & ssList(X1) )
   => ( ? [X2] :
          ( ? [X3] :
              ( ( ~ neq(X3,nil)
                | singletonP(X2) )
              & ~ totalorderedP(sK47)
              & segmentP(X3,X2)
              & sK47 = X2
              & sK48 = X3
              & ssList(X3) )
          & ssList(X2) )
      & ssList(sK48) ) ),
    introduced(choice_axiom,[]) ).

fof(f333,plain,
    ( ? [X2] :
        ( ? [X3] :
            ( ( ~ neq(X3,nil)
              | singletonP(X2) )
            & ~ totalorderedP(sK47)
            & segmentP(X3,X2)
            & sK47 = X2
            & sK48 = X3
            & ssList(X3) )
        & ssList(X2) )
   => ( ? [X3] :
          ( ( ~ neq(X3,nil)
            | singletonP(sK49) )
          & ~ totalorderedP(sK47)
          & segmentP(X3,sK49)
          & sK47 = sK49
          & sK48 = X3
          & ssList(X3) )
      & ssList(sK49) ) ),
    introduced(choice_axiom,[]) ).

fof(f334,plain,
    ( ? [X3] :
        ( ( ~ neq(X3,nil)
          | singletonP(sK49) )
        & ~ totalorderedP(sK47)
        & segmentP(X3,sK49)
        & sK47 = sK49
        & sK48 = X3
        & ssList(X3) )
   => ( ( ~ neq(sK50,nil)
        | singletonP(sK49) )
      & ~ totalorderedP(sK47)
      & segmentP(sK50,sK49)
      & sK47 = sK49
      & sK48 = sK50
      & ssList(sK50) ) ),
    introduced(choice_axiom,[]) ).

fof(f222,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ( ~ neq(X3,nil)
                    | singletonP(X2) )
                  & ~ totalorderedP(X0)
                  & segmentP(X3,X2)
                  & X0 = X2
                  & X1 = X3
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(flattening,[],[f221]) ).

fof(f221,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ( ~ neq(X3,nil)
                    | singletonP(X2) )
                  & ~ totalorderedP(X0)
                  & segmentP(X3,X2)
                  & X0 = X2
                  & X1 = X3
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(ennf_transformation,[],[f97]) ).

fof(f97,negated_conjecture,
    ~ ! [X0] :
        ( ssList(X0)
       => ! [X1] :
            ( ssList(X1)
           => ! [X2] :
                ( ssList(X2)
               => ! [X3] :
                    ( ssList(X3)
                   => ( ( neq(X3,nil)
                        & ~ singletonP(X2) )
                      | totalorderedP(X0)
                      | ~ segmentP(X3,X2)
                      | X0 != X2
                      | X1 != X3 ) ) ) ) ),
    inference(negated_conjecture,[],[f96]) ).

fof(f96,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ssList(X3)
                 => ( ( neq(X3,nil)
                      & ~ singletonP(X2) )
                    | totalorderedP(X0)
                    | ~ segmentP(X3,X2)
                    | X0 != X2
                    | X1 != X3 ) ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.3bUwMN16Hs/Vampire---4.8_19299',co1) ).

fof(f533,plain,
    ~ totalorderedP(sK47),
    inference(cnf_transformation,[],[f335]) ).

fof(f709,plain,
    ( totalorderedP(sK49)
    | ~ spl51_15 ),
    inference(avatar_component_clause,[],[f707]) ).

fof(f707,plain,
    ( spl51_15
  <=> totalorderedP(sK49) ),
    introduced(avatar_definition,[new_symbols(naming,[spl51_15])]) ).

fof(f732,plain,
    ( ~ spl51_8
    | ~ spl51_1
    | spl51_11 ),
    inference(avatar_split_clause,[],[f731,f688,f573,f640]) ).

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

fof(f573,plain,
    ( spl51_1
  <=> singletonP(sK49) ),
    introduced(avatar_definition,[new_symbols(naming,[spl51_1])]) ).

fof(f688,plain,
    ( spl51_11
  <=> ssItem(sK4(sK49)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl51_11])]) ).

fof(f731,plain,
    ( ~ singletonP(sK49)
    | ~ ssList(sK49)
    | spl51_11 ),
    inference(resolution,[],[f690,f345]) ).

fof(f345,plain,
    ! [X0] :
      ( ssItem(sK4(X0))
      | ~ singletonP(X0)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f235]) ).

fof(f235,plain,
    ! [X0] :
      ( ( ( singletonP(X0)
          | ! [X1] :
              ( cons(X1,nil) != X0
              | ~ ssItem(X1) ) )
        & ( ( cons(sK4(X0),nil) = X0
            & ssItem(sK4(X0)) )
          | ~ singletonP(X0) ) )
      | ~ ssList(X0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f233,f234]) ).

fof(f234,plain,
    ! [X0] :
      ( ? [X2] :
          ( cons(X2,nil) = X0
          & ssItem(X2) )
     => ( cons(sK4(X0),nil) = X0
        & ssItem(sK4(X0)) ) ),
    introduced(choice_axiom,[]) ).

fof(f233,plain,
    ! [X0] :
      ( ( ( singletonP(X0)
          | ! [X1] :
              ( cons(X1,nil) != X0
              | ~ ssItem(X1) ) )
        & ( ? [X2] :
              ( cons(X2,nil) = X0
              & ssItem(X2) )
          | ~ singletonP(X0) ) )
      | ~ ssList(X0) ),
    inference(rectify,[],[f232]) ).

fof(f232,plain,
    ! [X0] :
      ( ( ( singletonP(X0)
          | ! [X1] :
              ( cons(X1,nil) != X0
              | ~ ssItem(X1) ) )
        & ( ? [X1] :
              ( cons(X1,nil) = X0
              & ssItem(X1) )
          | ~ singletonP(X0) ) )
      | ~ ssList(X0) ),
    inference(nnf_transformation,[],[f100]) ).

fof(f100,plain,
    ! [X0] :
      ( ( singletonP(X0)
      <=> ? [X1] :
            ( cons(X1,nil) = X0
            & ssItem(X1) ) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f4]) ).

fof(f4,axiom,
    ! [X0] :
      ( ssList(X0)
     => ( singletonP(X0)
      <=> ? [X1] :
            ( cons(X1,nil) = X0
            & ssItem(X1) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.3bUwMN16Hs/Vampire---4.8_19299',ax4) ).

fof(f690,plain,
    ( ~ ssItem(sK4(sK49))
    | spl51_11 ),
    inference(avatar_component_clause,[],[f688]) ).

fof(f710,plain,
    ( ~ spl51_11
    | spl51_15
    | ~ spl51_10 ),
    inference(avatar_split_clause,[],[f679,f672,f707,f688]) ).

fof(f672,plain,
    ( spl51_10
  <=> sK49 = cons(sK4(sK49),nil) ),
    introduced(avatar_definition,[new_symbols(naming,[spl51_10])]) ).

fof(f679,plain,
    ( totalorderedP(sK49)
    | ~ ssItem(sK4(sK49))
    | ~ spl51_10 ),
    inference(superposition,[],[f481,f674]) ).

fof(f674,plain,
    ( sK49 = cons(sK4(sK49),nil)
    | ~ spl51_10 ),
    inference(avatar_component_clause,[],[f672]) ).

fof(f481,plain,
    ! [X0] :
      ( totalorderedP(cons(X0,nil))
      | ~ ssItem(X0) ),
    inference(cnf_transformation,[],[f180]) ).

fof(f180,plain,
    ! [X0] :
      ( totalorderedP(cons(X0,nil))
      | ~ ssItem(X0) ),
    inference(ennf_transformation,[],[f65]) ).

fof(f65,axiom,
    ! [X0] :
      ( ssItem(X0)
     => totalorderedP(cons(X0,nil)) ),
    file('/export/starexec/sandbox2/tmp/tmp.3bUwMN16Hs/Vampire---4.8_19299',ax65) ).

fof(f675,plain,
    ( ~ spl51_8
    | spl51_10
    | ~ spl51_1 ),
    inference(avatar_split_clause,[],[f670,f573,f672,f640]) ).

fof(f670,plain,
    ( sK49 = cons(sK4(sK49),nil)
    | ~ ssList(sK49)
    | ~ spl51_1 ),
    inference(resolution,[],[f575,f346]) ).

fof(f346,plain,
    ! [X0] :
      ( ~ singletonP(X0)
      | cons(sK4(X0),nil) = X0
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f235]) ).

fof(f575,plain,
    ( singletonP(sK49)
    | ~ spl51_1 ),
    inference(avatar_component_clause,[],[f573]) ).

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

fof(f668,plain,
    ( $false
    | ~ spl51_9 ),
    inference(resolution,[],[f665,f482]) ).

fof(f482,plain,
    totalorderedP(nil),
    inference(cnf_transformation,[],[f66]) ).

fof(f66,axiom,
    totalorderedP(nil),
    file('/export/starexec/sandbox2/tmp/tmp.3bUwMN16Hs/Vampire---4.8_19299',ax66) ).

fof(f665,plain,
    ( ~ totalorderedP(nil)
    | ~ spl51_9 ),
    inference(superposition,[],[f535,f646]) ).

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

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

fof(f653,plain,
    spl51_8,
    inference(avatar_contradiction_clause,[],[f652]) ).

fof(f652,plain,
    ( $false
    | spl51_8 ),
    inference(resolution,[],[f642,f528]) ).

fof(f528,plain,
    ssList(sK49),
    inference(cnf_transformation,[],[f335]) ).

fof(f642,plain,
    ( ~ ssList(sK49)
    | spl51_8 ),
    inference(avatar_component_clause,[],[f640]) ).

fof(f651,plain,
    spl51_7,
    inference(avatar_contradiction_clause,[],[f650]) ).

fof(f650,plain,
    ( $false
    | spl51_7 ),
    inference(resolution,[],[f627,f419]) ).

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

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

fof(f627,plain,
    ( ~ ssList(nil)
    | spl51_7 ),
    inference(avatar_component_clause,[],[f625]) ).

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

fof(f649,plain,
    spl51_6,
    inference(avatar_contradiction_clause,[],[f648]) ).

fof(f648,plain,
    ( $false
    | spl51_6 ),
    inference(resolution,[],[f623,f529]) ).

fof(f529,plain,
    ssList(sK50),
    inference(cnf_transformation,[],[f335]) ).

fof(f623,plain,
    ( ~ ssList(sK50)
    | spl51_6 ),
    inference(avatar_component_clause,[],[f621]) ).

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

fof(f647,plain,
    ( ~ spl51_8
    | spl51_9
    | ~ spl51_5 ),
    inference(avatar_split_clause,[],[f638,f611,f644,f640]) ).

fof(f611,plain,
    ( spl51_5
  <=> nil = sK50 ),
    introduced(avatar_definition,[new_symbols(naming,[spl51_5])]) ).

fof(f638,plain,
    ( nil = sK49
    | ~ ssList(sK49)
    | ~ spl51_5 ),
    inference(resolution,[],[f631,f473]) ).

fof(f473,plain,
    ! [X0] :
      ( ~ segmentP(nil,X0)
      | nil = X0
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f318]) ).

fof(f318,plain,
    ! [X0] :
      ( ( ( segmentP(nil,X0)
          | nil != X0 )
        & ( nil = X0
          | ~ segmentP(nil,X0) ) )
      | ~ ssList(X0) ),
    inference(nnf_transformation,[],[f176]) ).

fof(f176,plain,
    ! [X0] :
      ( ( segmentP(nil,X0)
      <=> nil = X0 )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f58]) ).

fof(f58,axiom,
    ! [X0] :
      ( ssList(X0)
     => ( segmentP(nil,X0)
      <=> nil = X0 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.3bUwMN16Hs/Vampire---4.8_19299',ax58) ).

fof(f631,plain,
    ( segmentP(nil,sK49)
    | ~ spl51_5 ),
    inference(superposition,[],[f532,f613]) ).

fof(f613,plain,
    ( nil = sK50
    | ~ spl51_5 ),
    inference(avatar_component_clause,[],[f611]) ).

fof(f532,plain,
    segmentP(sK50,sK49),
    inference(cnf_transformation,[],[f335]) ).

fof(f628,plain,
    ( ~ spl51_6
    | ~ spl51_7
    | spl51_5
    | spl51_2 ),
    inference(avatar_split_clause,[],[f615,f577,f611,f625,f621]) ).

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

fof(f615,plain,
    ( nil = sK50
    | ~ ssList(nil)
    | ~ ssList(sK50)
    | spl51_2 ),
    inference(resolution,[],[f417,f579]) ).

fof(f579,plain,
    ( ~ neq(sK50,nil)
    | spl51_2 ),
    inference(avatar_component_clause,[],[f577]) ).

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

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

fof(f118,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/sandbox2/tmp/tmp.3bUwMN16Hs/Vampire---4.8_19299',ax15) ).

fof(f580,plain,
    ( spl51_1
    | ~ spl51_2 ),
    inference(avatar_split_clause,[],[f534,f577,f573]) ).

fof(f534,plain,
    ( ~ neq(sK50,nil)
    | singletonP(sK49) ),
    inference(cnf_transformation,[],[f335]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13  % Problem    : SWC277+1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/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.36  % Computer : n005.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   : Tue Apr 30 18:16:26 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.3bUwMN16Hs/Vampire---4.8_19299
% 0.56/0.74  % (19493)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.56/0.74  % (19499)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.56/0.74  % (19492)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.56/0.74  % (19494)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.56/0.74  % (19495)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.56/0.74  % (19496)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.56/0.74  % (19497)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.56/0.74  % (19498)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.56/0.74  % (19499)Refutation not found, incomplete strategy% (19499)------------------------------
% 0.56/0.74  % (19499)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.56/0.74  % (19499)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.74  
% 0.56/0.74  % (19499)Memory used [KB]: 1147
% 0.56/0.74  % (19499)Time elapsed: 0.003 s
% 0.56/0.74  % (19499)Instructions burned: 6 (million)
% 0.56/0.74  % (19499)------------------------------
% 0.56/0.74  % (19499)------------------------------
% 0.56/0.74  % (19502)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 (2996ds/55Mi)
% 0.56/0.74  % (19493)First to succeed.
% 0.56/0.75  % (19493)Refutation found. Thanks to Tanya!
% 0.56/0.75  % SZS status Theorem for Vampire---4
% 0.56/0.75  % SZS output start Proof for Vampire---4
% See solution above
% 0.56/0.75  % (19493)------------------------------
% 0.56/0.75  % (19493)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.56/0.75  % (19493)Termination reason: Refutation
% 0.56/0.75  
% 0.56/0.75  % (19493)Memory used [KB]: 1449
% 0.56/0.75  % (19493)Time elapsed: 0.008 s
% 0.56/0.75  % (19493)Instructions burned: 20 (million)
% 0.56/0.75  % (19493)------------------------------
% 0.56/0.75  % (19493)------------------------------
% 0.56/0.75  % (19465)Success in time 0.378 s
% 0.56/0.75  % Vampire---4.8 exiting
%------------------------------------------------------------------------------