TSTP Solution File: PRO011+4 by Vampire---4.8

View Problem - Process Solution

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

% Computer : n016.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sun May  5 08:47:19 EDT 2024

% Result   : Theorem 0.73s 0.89s
% Output   : Refutation 0.73s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   39 (   4 unt;   1 typ;   0 def)
%            Number of atoms       :  374 (   0 equ)
%            Maximal formula atoms :   14 (   9 avg)
%            Number of connectives :  210 (  51   ~;  46   |;  95   &)
%                                         (   0 <=>;  18  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   8 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :  177 ( 177 fml;   0 var)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    2 (   1   >;   1   *;   0   +;   0  <<)
%            Number of predicates  :   20 (  19 usr;   7 prp; 0-3 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :  118 (  75   !;  42   ?;  28   :)
%                                         (   1  !>;   0  ?*;   0  @-;   0  @+)

% Comments : 
%------------------------------------------------------------------------------
tff(pred_def_19,type,
    sQ13_eqProxy: 
      !>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).

tff(f280,plain,
    $false,
    inference(subsumption_resolution,[],[f275,f120]) ).

tff(f120,plain,
    occurrence_of(sK2,tptp0),
    inference(cnf_transformation,[],[f97]) ).

tff(f97,plain,
    ( ! [X1,X2] :
        ( ( min_precedes(X1,sK3(X1),tptp0)
          & subactivity_occurrence(sK3(X1),sK2)
          & occurrence_of(sK3(X1),tptp1)
          & occurrence_of(X2,tptp2) )
        | sP0(X1,sK2,X2)
        | ~ leaf_occ(X2,sK2) )
    & occurrence_of(sK2,tptp0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f90,f96,f95]) ).

tff(f95,plain,
    ( ? [X0] :
        ( ! [X1,X2] :
            ( ( ? [X3] :
                  ( min_precedes(X1,X3,tptp0)
                  & subactivity_occurrence(X3,X0)
                  & occurrence_of(X3,tptp1) )
              & occurrence_of(X2,tptp2) )
            | sP0(X1,X0,X2)
            | ~ leaf_occ(X2,X0) )
        & occurrence_of(X0,tptp0) )
   => ( ! [X2,X1] :
          ( ( ? [X3] :
                ( min_precedes(X1,X3,tptp0)
                & subactivity_occurrence(X3,sK2)
                & occurrence_of(X3,tptp1) )
            & occurrence_of(X2,tptp2) )
          | sP0(X1,sK2,X2)
          | ~ leaf_occ(X2,sK2) )
      & occurrence_of(sK2,tptp0) ) ),
    introduced(choice_axiom,[]) ).

tff(f96,plain,
    ! [X1] :
      ( ? [X3] :
          ( min_precedes(X1,X3,tptp0)
          & subactivity_occurrence(X3,sK2)
          & occurrence_of(X3,tptp1) )
     => ( min_precedes(X1,sK3(X1),tptp0)
        & subactivity_occurrence(sK3(X1),sK2)
        & occurrence_of(sK3(X1),tptp1) ) ),
    introduced(choice_axiom,[]) ).

tff(f90,plain,
    ? [X0] :
      ( ! [X1,X2] :
          ( ( ? [X3] :
                ( min_precedes(X1,X3,tptp0)
                & subactivity_occurrence(X3,X0)
                & occurrence_of(X3,tptp1) )
            & occurrence_of(X2,tptp2) )
          | sP0(X1,X0,X2)
          | ~ leaf_occ(X2,X0) )
      & occurrence_of(X0,tptp0) ),
    inference(definition_folding,[],[f68,f89]) ).

tff(f89,plain,
    ! [X1,X0,X2] :
      ( ( ? [X4] :
            ( min_precedes(X1,X4,tptp0)
            & subactivity_occurrence(X4,X0)
            & occurrence_of(X4,tptp2) )
        & occurrence_of(X2,tptp1) )
      | ~ sP0(X1,X0,X2) ),
    introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).

tff(f68,plain,
    ? [X0] :
      ( ! [X1,X2] :
          ( ( ? [X3] :
                ( min_precedes(X1,X3,tptp0)
                & subactivity_occurrence(X3,X0)
                & occurrence_of(X3,tptp1) )
            & occurrence_of(X2,tptp2) )
          | ( ? [X4] :
                ( min_precedes(X1,X4,tptp0)
                & subactivity_occurrence(X4,X0)
                & occurrence_of(X4,tptp2) )
            & occurrence_of(X2,tptp1) )
          | ~ leaf_occ(X2,X0) )
      & occurrence_of(X0,tptp0) ),
    inference(ennf_transformation,[],[f48]) ).

tff(f48,plain,
    ~ ! [X0] :
        ( occurrence_of(X0,tptp0)
       => ? [X1,X2] :
            ( ( occurrence_of(X2,tptp2)
             => ~ ? [X3] :
                    ( min_precedes(X1,X3,tptp0)
                    & subactivity_occurrence(X3,X0)
                    & occurrence_of(X3,tptp1) ) )
            & ( occurrence_of(X2,tptp1)
             => ~ ? [X4] :
                    ( min_precedes(X1,X4,tptp0)
                    & subactivity_occurrence(X4,X0)
                    & occurrence_of(X4,tptp2) ) )
            & leaf_occ(X2,X0) ) ),
    inference(rectify,[],[f47]) ).

tff(f47,negated_conjecture,
    ~ ! [X105] :
        ( occurrence_of(X105,tptp0)
       => ? [X106,X107] :
            ( ( occurrence_of(X107,tptp2)
             => ~ ? [X109] :
                    ( min_precedes(X106,X109,tptp0)
                    & subactivity_occurrence(X109,X105)
                    & occurrence_of(X109,tptp1) ) )
            & ( occurrence_of(X107,tptp1)
             => ~ ? [X108] :
                    ( min_precedes(X106,X108,tptp0)
                    & subactivity_occurrence(X108,X105)
                    & occurrence_of(X108,tptp2) ) )
            & leaf_occ(X107,X105) ) ),
    inference(negated_conjecture,[],[f46]) ).

tff(f46,conjecture,
    ! [X105] :
      ( occurrence_of(X105,tptp0)
     => ? [X106,X107] :
          ( ( occurrence_of(X107,tptp2)
           => ~ ? [X109] :
                  ( min_precedes(X106,X109,tptp0)
                  & subactivity_occurrence(X109,X105)
                  & occurrence_of(X109,tptp1) ) )
          & ( occurrence_of(X107,tptp1)
           => ~ ? [X108] :
                  ( min_precedes(X106,X108,tptp0)
                  & subactivity_occurrence(X108,X105)
                  & occurrence_of(X108,tptp2) ) )
          & leaf_occ(X107,X105) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.MG7Qd2hBbq/Vampire---4.8_12381',goals) ).

tff(f275,plain,
    ~ occurrence_of(sK2,tptp0),
    inference(resolution,[],[f271,f268]) ).

tff(f268,plain,
    ! [X0: $i] :
      ( sP0(sK6(X0),sK2,sK6(sK2))
      | ~ occurrence_of(X0,tptp0) ),
    inference(subsumption_resolution,[],[f267,f120]) ).

tff(f267,plain,
    ! [X0: $i] :
      ( sP0(sK6(X0),sK2,sK6(sK2))
      | ~ occurrence_of(X0,tptp0)
      | ~ occurrence_of(sK2,tptp0) ),
    inference(resolution,[],[f257,f130]) ).

tff(f130,plain,
    ! [X0: $i] :
      ( leaf_occ(sK6(X0),X0)
      | ~ occurrence_of(X0,tptp0) ),
    inference(cnf_transformation,[],[f99]) ).

tff(f99,plain,
    ! [X0] :
      ( ( leaf_occ(sK6(X0),X0)
        & ( occurrence_of(sK6(X0),tptp2)
          | occurrence_of(sK6(X0),tptp1) )
        & occurrence_of(sK5(X0),tptp4)
        & root_occ(sK4(X0),X0)
        & occurrence_of(sK4(X0),tptp3) )
      | ~ occurrence_of(X0,tptp0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6])],[f69,f98]) ).

tff(f98,plain,
    ! [X0] :
      ( ? [X1,X2,X3] :
          ( leaf_occ(X3,X0)
          & ( occurrence_of(X3,tptp2)
            | occurrence_of(X3,tptp1) )
          & occurrence_of(X2,tptp4)
          & root_occ(X1,X0)
          & occurrence_of(X1,tptp3) )
     => ( leaf_occ(sK6(X0),X0)
        & ( occurrence_of(sK6(X0),tptp2)
          | occurrence_of(sK6(X0),tptp1) )
        & occurrence_of(sK5(X0),tptp4)
        & root_occ(sK4(X0),X0)
        & occurrence_of(sK4(X0),tptp3) ) ),
    introduced(choice_axiom,[]) ).

tff(f69,plain,
    ! [X0] :
      ( ? [X1,X2,X3] :
          ( leaf_occ(X3,X0)
          & ( occurrence_of(X3,tptp2)
            | occurrence_of(X3,tptp1) )
          & occurrence_of(X2,tptp4)
          & root_occ(X1,X0)
          & occurrence_of(X1,tptp3) )
      | ~ occurrence_of(X0,tptp0) ),
    inference(ennf_transformation,[],[f64]) ).

tff(f64,plain,
    ! [X0] :
      ( occurrence_of(X0,tptp0)
     => ? [X1,X2,X3] :
          ( leaf_occ(X3,X0)
          & ( occurrence_of(X3,tptp2)
            | occurrence_of(X3,tptp1) )
          & occurrence_of(X2,tptp4)
          & root_occ(X1,X0)
          & occurrence_of(X1,tptp3) ) ),
    inference(pure_predicate_removal,[],[f49]) ).

tff(f49,plain,
    ! [X0] :
      ( occurrence_of(X0,tptp0)
     => ? [X1,X2,X3] :
          ( leaf_occ(X3,X0)
          & next_subocc(X2,X3,tptp0)
          & ( occurrence_of(X3,tptp2)
            | occurrence_of(X3,tptp1) )
          & next_subocc(X1,X2,tptp0)
          & occurrence_of(X2,tptp4)
          & root_occ(X1,X0)
          & occurrence_of(X1,tptp3) ) ),
    inference(rectify,[],[f33]) ).

tff(f33,axiom,
    ! [X101] :
      ( occurrence_of(X101,tptp0)
     => ? [X102,X103,X104] :
          ( leaf_occ(X104,X101)
          & next_subocc(X103,X104,tptp0)
          & ( occurrence_of(X104,tptp2)
            | occurrence_of(X104,tptp1) )
          & next_subocc(X102,X103,tptp0)
          & occurrence_of(X103,tptp4)
          & root_occ(X102,X101)
          & occurrence_of(X102,tptp3) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.MG7Qd2hBbq/Vampire---4.8_12381',sos_32) ).

tff(f257,plain,
    ! [X0: $i,X1: $i] :
      ( ~ leaf_occ(X1,sK2)
      | sP0(sK6(X0),sK2,X1)
      | ~ occurrence_of(X0,tptp0) ),
    inference(duplicate_literal_removal,[],[f254]) ).

tff(f254,plain,
    ! [X0: $i,X1: $i] :
      ( ~ occurrence_of(X0,tptp0)
      | ~ occurrence_of(X0,tptp0)
      | sP0(sK6(X0),sK2,X1)
      | ~ leaf_occ(X1,sK2) ),
    inference(resolution,[],[f200,f124]) ).

tff(f124,plain,
    ! [X2: $i,X1: $i] :
      ( min_precedes(X1,sK3(X1),tptp0)
      | sP0(X1,sK2,X2)
      | ~ leaf_occ(X2,sK2) ),
    inference(cnf_transformation,[],[f97]) ).

tff(f200,plain,
    ! [X2: $i,X0: $i,X1: $i] :
      ( ~ min_precedes(sK6(X0),X1,X2)
      | ~ occurrence_of(X0,X2)
      | ~ occurrence_of(X0,tptp0) ),
    inference(resolution,[],[f133,f130]) ).

tff(f133,plain,
    ! [X2: $i,X3: $i,X0: $i,X1: $i] :
      ( ~ leaf_occ(X1,X0)
      | ~ min_precedes(X1,X3,X2)
      | ~ occurrence_of(X0,X2) ),
    inference(cnf_transformation,[],[f75]) ).

tff(f75,plain,
    ! [X0,X1,X2] :
      ( ! [X3] : ~ min_precedes(X1,X3,X2)
      | ~ leaf_occ(X1,X0)
      | ~ occurrence_of(X0,X2) ),
    inference(flattening,[],[f74]) ).

tff(f74,plain,
    ! [X0,X1,X2] :
      ( ! [X3] : ~ min_precedes(X1,X3,X2)
      | ~ leaf_occ(X1,X0)
      | ~ occurrence_of(X0,X2) ),
    inference(ennf_transformation,[],[f52]) ).

tff(f52,plain,
    ! [X0,X1,X2] :
      ( ( leaf_occ(X1,X0)
        & occurrence_of(X0,X2) )
     => ~ ? [X3] : min_precedes(X1,X3,X2) ),
    inference(rectify,[],[f10]) ).

tff(f10,axiom,
    ! [X31,X32,X33] :
      ( ( leaf_occ(X32,X31)
        & occurrence_of(X31,X33) )
     => ~ ? [X34] : min_precedes(X32,X34,X33) ),
    file('/export/starexec/sandbox2/tmp/tmp.MG7Qd2hBbq/Vampire---4.8_12381',sos_09) ).

tff(f271,plain,
    ! [X0: $i,X1: $i] : ~ sP0(sK6(sK2),X0,X1),
    inference(resolution,[],[f256,f120]) ).

tff(f256,plain,
    ! [X2: $i,X0: $i,X1: $i] :
      ( ~ occurrence_of(X0,tptp0)
      | ~ sP0(sK6(X0),X1,X2) ),
    inference(duplicate_literal_removal,[],[f255]) ).

tff(f255,plain,
    ! [X2: $i,X0: $i,X1: $i] :
      ( ~ occurrence_of(X0,tptp0)
      | ~ occurrence_of(X0,tptp0)
      | ~ sP0(sK6(X0),X1,X2) ),
    inference(resolution,[],[f200,f119]) ).

tff(f119,plain,
    ! [X2: $i,X0: $i,X1: $i] :
      ( min_precedes(X0,sK1(X0,X1),tptp0)
      | ~ sP0(X0,X1,X2) ),
    inference(cnf_transformation,[],[f94]) ).

tff(f94,plain,
    ! [X0,X1,X2] :
      ( ( min_precedes(X0,sK1(X0,X1),tptp0)
        & subactivity_occurrence(sK1(X0,X1),X1)
        & occurrence_of(sK1(X0,X1),tptp2)
        & occurrence_of(X2,tptp1) )
      | ~ sP0(X0,X1,X2) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f92,f93]) ).

tff(f93,plain,
    ! [X0,X1] :
      ( ? [X3] :
          ( min_precedes(X0,X3,tptp0)
          & subactivity_occurrence(X3,X1)
          & occurrence_of(X3,tptp2) )
     => ( min_precedes(X0,sK1(X0,X1),tptp0)
        & subactivity_occurrence(sK1(X0,X1),X1)
        & occurrence_of(sK1(X0,X1),tptp2) ) ),
    introduced(choice_axiom,[]) ).

tff(f92,plain,
    ! [X0,X1,X2] :
      ( ( ? [X3] :
            ( min_precedes(X0,X3,tptp0)
            & subactivity_occurrence(X3,X1)
            & occurrence_of(X3,tptp2) )
        & occurrence_of(X2,tptp1) )
      | ~ sP0(X0,X1,X2) ),
    inference(rectify,[],[f91]) ).

tff(f91,plain,
    ! [X1,X0,X2] :
      ( ( ? [X4] :
            ( min_precedes(X1,X4,tptp0)
            & subactivity_occurrence(X4,X0)
            & occurrence_of(X4,tptp2) )
        & occurrence_of(X2,tptp1) )
      | ~ sP0(X1,X0,X2) ),
    inference(nnf_transformation,[],[f89]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : PRO011+4 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.15  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.35  % Computer : n016.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Fri May  3 20:36:53 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.15/0.36  This is a FOF_THM_RFO_SEQ problem
% 0.15/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.MG7Qd2hBbq/Vampire---4.8_12381
% 0.73/0.88  % (12612)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 (2994ds/51Mi)
% 0.73/0.88  % (12611)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 (2994ds/34Mi)
% 0.73/0.88  % (12613)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2994ds/78Mi)
% 0.73/0.88  % (12614)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2994ds/33Mi)
% 0.73/0.88  % (12615)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 (2994ds/34Mi)
% 0.73/0.88  % (12616)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2994ds/45Mi)
% 0.73/0.88  % (12617)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 (2994ds/83Mi)
% 0.73/0.88  % (12618)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 (2994ds/56Mi)
% 0.73/0.88  % (12614)Refutation not found, incomplete strategy% (12614)------------------------------
% 0.73/0.88  % (12614)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.73/0.88  % (12614)Termination reason: Refutation not found, incomplete strategy
% 0.73/0.88  
% 0.73/0.88  % (12614)Memory used [KB]: 1026
% 0.73/0.88  % (12614)Time elapsed: 0.003 s
% 0.73/0.88  % (12618)Refutation not found, incomplete strategy% (12618)------------------------------
% 0.73/0.88  % (12618)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.73/0.88  % (12618)Termination reason: Refutation not found, incomplete strategy
% 0.73/0.88  
% 0.73/0.88  % (12618)Memory used [KB]: 1026
% 0.73/0.88  % (12618)Time elapsed: 0.003 s
% 0.73/0.88  % (12618)Instructions burned: 2 (million)
% 0.73/0.88  % (12614)Instructions burned: 2 (million)
% 0.73/0.88  % (12616)Refutation not found, incomplete strategy% (12616)------------------------------
% 0.73/0.88  % (12616)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.73/0.88  % (12616)Termination reason: Refutation not found, incomplete strategy
% 0.73/0.88  
% 0.73/0.88  % (12616)Memory used [KB]: 1042
% 0.73/0.88  % (12616)Time elapsed: 0.003 s
% 0.73/0.88  % (12616)Instructions burned: 2 (million)
% 0.73/0.88  % (12618)------------------------------
% 0.73/0.88  % (12618)------------------------------
% 0.73/0.88  % (12614)------------------------------
% 0.73/0.88  % (12614)------------------------------
% 0.73/0.88  % (12616)------------------------------
% 0.73/0.88  % (12616)------------------------------
% 0.73/0.88  % (12615)Refutation not found, incomplete strategy% (12615)------------------------------
% 0.73/0.88  % (12615)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.73/0.88  % (12615)Termination reason: Refutation not found, incomplete strategy
% 0.73/0.88  
% 0.73/0.88  % (12615)Memory used [KB]: 1150
% 0.73/0.88  % (12615)Time elapsed: 0.005 s
% 0.73/0.88  % (12615)Instructions burned: 6 (million)
% 0.73/0.88  % (12615)------------------------------
% 0.73/0.88  % (12615)------------------------------
% 0.73/0.88  % (12611)First to succeed.
% 0.73/0.88  % (12619)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 (2994ds/55Mi)
% 0.73/0.88  % (12620)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on Vampire---4 for (2994ds/50Mi)
% 0.73/0.88  % (12621)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on Vampire---4 for (2994ds/208Mi)
% 0.73/0.89  % (12611)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-12553"
% 0.73/0.89  % (12612)Also succeeded, but the first one will report.
% 0.73/0.89  % (12611)Refutation found. Thanks to Tanya!
% 0.73/0.89  % SZS status Theorem for Vampire---4
% 0.73/0.89  % SZS output start Proof for Vampire---4
% See solution above
% 0.73/0.89  % (12611)------------------------------
% 0.73/0.89  % (12611)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.73/0.89  % (12611)Termination reason: Refutation
% 0.73/0.89  
% 0.73/0.89  % (12611)Memory used [KB]: 1159
% 0.73/0.89  % (12611)Time elapsed: 0.008 s
% 0.73/0.89  % (12611)Instructions burned: 10 (million)
% 0.73/0.89  % (12553)Success in time 0.52 s
% 0.73/0.89  % Vampire---4.8 exiting
%------------------------------------------------------------------------------