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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SET720+4 : TPTP v8.1.2. Bugfixed v2.2.1.
% 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 : n015.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 03:48:43 EDT 2024

% Result   : Theorem 0.58s 0.74s
% Output   : Refutation 0.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   46 (  12 unt;   0 def)
%            Number of atoms       :  194 (  17 equ)
%            Maximal formula atoms :   12 (   4 avg)
%            Number of connectives :  203 (  55   ~;  47   |;  67   &)
%                                         (   8 <=>;  26  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   7 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-4 aty)
%            Number of functors    :    8 (   8 usr;   3 con; 0-4 aty)
%            Number of variables   :  175 ( 154   !;  21   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f82,plain,
    $false,
    inference(subsumption_resolution,[],[f80,f78]) ).

fof(f78,plain,
    apply(inverse_function(sK0,sK1,sK2),sK5(inverse_function(inverse_function(sK0,sK1,sK2),sK2,sK1),sK0,sK1,sK2),sK4(inverse_function(inverse_function(sK0,sK1,sK2),sK2,sK1),sK0,sK1,sK2)),
    inference(unit_resulting_resolution,[],[f66,f65,f71,f64]) ).

fof(f64,plain,
    ! [X2,X3,X0,X1,X4] :
      ( apply(X0,X3,X4)
      | ~ apply(inverse_function(X0,X1,X2),X4,X3)
      | ~ member(X4,X2)
      | ~ member(X3,X1) ),
    inference(cnf_transformation,[],[f51]) ).

fof(f51,plain,
    ! [X0,X1,X2,X3,X4] :
      ( ( ( apply(X0,X3,X4)
          | ~ apply(inverse_function(X0,X1,X2),X4,X3) )
        & ( apply(inverse_function(X0,X1,X2),X4,X3)
          | ~ apply(X0,X3,X4) ) )
      | ~ member(X4,X2)
      | ~ member(X3,X1) ),
    inference(nnf_transformation,[],[f44]) ).

fof(f44,plain,
    ! [X0,X1,X2,X3,X4] :
      ( ( apply(X0,X3,X4)
      <=> apply(inverse_function(X0,X1,X2),X4,X3) )
      | ~ member(X4,X2)
      | ~ member(X3,X1) ),
    inference(flattening,[],[f43]) ).

fof(f43,plain,
    ! [X0,X1,X2,X3,X4] :
      ( ( apply(X0,X3,X4)
      <=> apply(inverse_function(X0,X1,X2),X4,X3) )
      | ~ member(X4,X2)
      | ~ member(X3,X1) ),
    inference(ennf_transformation,[],[f34]) ).

fof(f34,plain,
    ! [X0,X1,X2,X3,X4] :
      ( ( member(X4,X2)
        & member(X3,X1) )
     => ( apply(X0,X3,X4)
      <=> apply(inverse_function(X0,X1,X2),X4,X3) ) ),
    inference(rectify,[],[f21]) ).

fof(f21,axiom,
    ! [X5,X0,X1,X2,X4] :
      ( ( member(X4,X1)
        & member(X2,X0) )
     => ( apply(X5,X2,X4)
      <=> apply(inverse_function(X5,X0,X1),X4,X2) ) ),
    file('/export/starexec/sandbox/tmp/tmp.yb6a87vJfh/Vampire---4.8_26528',inverse_function) ).

fof(f71,plain,
    apply(inverse_function(inverse_function(sK0,sK1,sK2),sK2,sK1),sK4(inverse_function(inverse_function(sK0,sK1,sK2),sK2,sK1),sK0,sK1,sK2),sK5(inverse_function(inverse_function(sK0,sK1,sK2),sK2,sK1),sK0,sK1,sK2)),
    inference(unit_resulting_resolution,[],[f53,f60]) ).

fof(f60,plain,
    ! [X2,X3,X0,X1] :
      ( apply(X0,sK4(X0,X1,X2,X3),sK5(X0,X1,X2,X3))
      | equal_maps(X0,X1,X2,X3) ),
    inference(cnf_transformation,[],[f50]) ).

fof(f50,plain,
    ! [X0,X1,X2,X3] :
      ( equal_maps(X0,X1,X2,X3)
      | ( sK5(X0,X1,X2,X3) != sK6(X0,X1,X2,X3)
        & apply(X1,sK4(X0,X1,X2,X3),sK6(X0,X1,X2,X3))
        & apply(X0,sK4(X0,X1,X2,X3),sK5(X0,X1,X2,X3))
        & member(sK6(X0,X1,X2,X3),X3)
        & member(sK5(X0,X1,X2,X3),X3)
        & member(sK4(X0,X1,X2,X3),X2) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6])],[f42,f49]) ).

fof(f49,plain,
    ! [X0,X1,X2,X3] :
      ( ? [X4,X5,X6] :
          ( X5 != X6
          & apply(X1,X4,X6)
          & apply(X0,X4,X5)
          & member(X6,X3)
          & member(X5,X3)
          & member(X4,X2) )
     => ( sK5(X0,X1,X2,X3) != sK6(X0,X1,X2,X3)
        & apply(X1,sK4(X0,X1,X2,X3),sK6(X0,X1,X2,X3))
        & apply(X0,sK4(X0,X1,X2,X3),sK5(X0,X1,X2,X3))
        & member(sK6(X0,X1,X2,X3),X3)
        & member(sK5(X0,X1,X2,X3),X3)
        & member(sK4(X0,X1,X2,X3),X2) ) ),
    introduced(choice_axiom,[]) ).

fof(f42,plain,
    ! [X0,X1,X2,X3] :
      ( equal_maps(X0,X1,X2,X3)
      | ? [X4,X5,X6] :
          ( X5 != X6
          & apply(X1,X4,X6)
          & apply(X0,X4,X5)
          & member(X6,X3)
          & member(X5,X3)
          & member(X4,X2) ) ),
    inference(flattening,[],[f41]) ).

fof(f41,plain,
    ! [X0,X1,X2,X3] :
      ( equal_maps(X0,X1,X2,X3)
      | ? [X4,X5,X6] :
          ( X5 != X6
          & apply(X1,X4,X6)
          & apply(X0,X4,X5)
          & member(X6,X3)
          & member(X5,X3)
          & member(X4,X2) ) ),
    inference(ennf_transformation,[],[f35]) ).

fof(f35,plain,
    ! [X0,X1,X2,X3] :
      ( ! [X4,X5,X6] :
          ( ( member(X6,X3)
            & member(X5,X3)
            & member(X4,X2) )
         => ( ( apply(X1,X4,X6)
              & apply(X0,X4,X5) )
           => X5 = X6 ) )
     => equal_maps(X0,X1,X2,X3) ),
    inference(unused_predicate_definition_removal,[],[f33]) ).

fof(f33,plain,
    ! [X0,X1,X2,X3] :
      ( equal_maps(X0,X1,X2,X3)
    <=> ! [X4,X5,X6] :
          ( ( member(X6,X3)
            & member(X5,X3)
            & member(X4,X2) )
         => ( ( apply(X1,X4,X6)
              & apply(X0,X4,X5) )
           => X5 = X6 ) ) ),
    inference(rectify,[],[f15]) ).

fof(f15,axiom,
    ! [X5,X9,X0,X1] :
      ( equal_maps(X5,X9,X0,X1)
    <=> ! [X2,X6,X7] :
          ( ( member(X7,X1)
            & member(X6,X1)
            & member(X2,X0) )
         => ( ( apply(X9,X2,X7)
              & apply(X5,X2,X6) )
           => X6 = X7 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.yb6a87vJfh/Vampire---4.8_26528',equal_maps) ).

fof(f53,plain,
    ~ equal_maps(inverse_function(inverse_function(sK0,sK1,sK2),sK2,sK1),sK0,sK1,sK2),
    inference(cnf_transformation,[],[f46]) ).

fof(f46,plain,
    ( ~ equal_maps(inverse_function(inverse_function(sK0,sK1,sK2),sK2,sK1),sK0,sK1,sK2)
    & maps(sK0,sK1,sK2) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f38,f45]) ).

fof(f45,plain,
    ( ? [X0,X1,X2] :
        ( ~ equal_maps(inverse_function(inverse_function(X0,X1,X2),X2,X1),X0,X1,X2)
        & maps(X0,X1,X2) )
   => ( ~ equal_maps(inverse_function(inverse_function(sK0,sK1,sK2),sK2,sK1),sK0,sK1,sK2)
      & maps(sK0,sK1,sK2) ) ),
    introduced(choice_axiom,[]) ).

fof(f38,plain,
    ? [X0,X1,X2] :
      ( ~ equal_maps(inverse_function(inverse_function(X0,X1,X2),X2,X1),X0,X1,X2)
      & maps(X0,X1,X2) ),
    inference(ennf_transformation,[],[f37]) ).

fof(f37,plain,
    ~ ! [X0,X1,X2] :
        ( maps(X0,X1,X2)
       => equal_maps(inverse_function(inverse_function(X0,X1,X2),X2,X1),X0,X1,X2) ),
    inference(pure_predicate_removal,[],[f31]) ).

fof(f31,plain,
    ~ ! [X0,X1,X2] :
        ( ( one_to_one(X0,X1,X2)
          & maps(X0,X1,X2) )
       => equal_maps(inverse_function(inverse_function(X0,X1,X2),X2,X1),X0,X1,X2) ),
    inference(rectify,[],[f30]) ).

fof(f30,negated_conjecture,
    ~ ! [X5,X0,X1] :
        ( ( one_to_one(X5,X0,X1)
          & maps(X5,X0,X1) )
       => equal_maps(inverse_function(inverse_function(X5,X0,X1),X1,X0),X5,X0,X1) ),
    inference(negated_conjecture,[],[f29]) ).

fof(f29,conjecture,
    ! [X5,X0,X1] :
      ( ( one_to_one(X5,X0,X1)
        & maps(X5,X0,X1) )
     => equal_maps(inverse_function(inverse_function(X5,X0,X1),X1,X0),X5,X0,X1) ),
    file('/export/starexec/sandbox/tmp/tmp.yb6a87vJfh/Vampire---4.8_26528',thII11) ).

fof(f65,plain,
    member(sK4(inverse_function(inverse_function(sK0,sK1,sK2),sK2,sK1),sK0,sK1,sK2),sK1),
    inference(unit_resulting_resolution,[],[f53,f57]) ).

fof(f57,plain,
    ! [X2,X3,X0,X1] :
      ( member(sK4(X0,X1,X2,X3),X2)
      | equal_maps(X0,X1,X2,X3) ),
    inference(cnf_transformation,[],[f50]) ).

fof(f66,plain,
    member(sK5(inverse_function(inverse_function(sK0,sK1,sK2),sK2,sK1),sK0,sK1,sK2),sK2),
    inference(unit_resulting_resolution,[],[f53,f58]) ).

fof(f58,plain,
    ! [X2,X3,X0,X1] :
      ( member(sK5(X0,X1,X2,X3),X3)
      | equal_maps(X0,X1,X2,X3) ),
    inference(cnf_transformation,[],[f50]) ).

fof(f80,plain,
    ~ apply(inverse_function(sK0,sK1,sK2),sK5(inverse_function(inverse_function(sK0,sK1,sK2),sK2,sK1),sK0,sK1,sK2),sK4(inverse_function(inverse_function(sK0,sK1,sK2),sK2,sK1),sK0,sK1,sK2)),
    inference(unit_resulting_resolution,[],[f65,f66,f75,f64]) ).

fof(f75,plain,
    ~ apply(sK0,sK4(inverse_function(inverse_function(sK0,sK1,sK2),sK2,sK1),sK0,sK1,sK2),sK5(inverse_function(inverse_function(sK0,sK1,sK2),sK2,sK1),sK0,sK1,sK2)),
    inference(unit_resulting_resolution,[],[f52,f65,f66,f67,f70,f72,f56]) ).

fof(f56,plain,
    ! [X2,X3,X0,X1,X4,X5] :
      ( X4 = X5
      | ~ apply(X0,X3,X5)
      | ~ apply(X0,X3,X4)
      | ~ member(X5,X2)
      | ~ member(X4,X2)
      | ~ member(X3,X1)
      | ~ maps(X0,X1,X2) ),
    inference(cnf_transformation,[],[f48]) ).

fof(f48,plain,
    ! [X0,X1,X2] :
      ( ( ! [X3,X4,X5] :
            ( X4 = X5
            | ~ apply(X0,X3,X5)
            | ~ apply(X0,X3,X4)
            | ~ member(X5,X2)
            | ~ member(X4,X2)
            | ~ member(X3,X1) )
        & ! [X6] :
            ( ( apply(X0,X6,sK3(X0,X2,X6))
              & member(sK3(X0,X2,X6),X2) )
            | ~ member(X6,X1) ) )
      | ~ maps(X0,X1,X2) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f40,f47]) ).

fof(f47,plain,
    ! [X0,X2,X6] :
      ( ? [X7] :
          ( apply(X0,X6,X7)
          & member(X7,X2) )
     => ( apply(X0,X6,sK3(X0,X2,X6))
        & member(sK3(X0,X2,X6),X2) ) ),
    introduced(choice_axiom,[]) ).

fof(f40,plain,
    ! [X0,X1,X2] :
      ( ( ! [X3,X4,X5] :
            ( X4 = X5
            | ~ apply(X0,X3,X5)
            | ~ apply(X0,X3,X4)
            | ~ member(X5,X2)
            | ~ member(X4,X2)
            | ~ member(X3,X1) )
        & ! [X6] :
            ( ? [X7] :
                ( apply(X0,X6,X7)
                & member(X7,X2) )
            | ~ member(X6,X1) ) )
      | ~ maps(X0,X1,X2) ),
    inference(flattening,[],[f39]) ).

fof(f39,plain,
    ! [X0,X1,X2] :
      ( ( ! [X3,X4,X5] :
            ( X4 = X5
            | ~ apply(X0,X3,X5)
            | ~ apply(X0,X3,X4)
            | ~ member(X5,X2)
            | ~ member(X4,X2)
            | ~ member(X3,X1) )
        & ! [X6] :
            ( ? [X7] :
                ( apply(X0,X6,X7)
                & member(X7,X2) )
            | ~ member(X6,X1) ) )
      | ~ maps(X0,X1,X2) ),
    inference(ennf_transformation,[],[f36]) ).

fof(f36,plain,
    ! [X0,X1,X2] :
      ( maps(X0,X1,X2)
     => ( ! [X3,X4,X5] :
            ( ( member(X5,X2)
              & member(X4,X2)
              & member(X3,X1) )
           => ( ( apply(X0,X3,X5)
                & apply(X0,X3,X4) )
             => X4 = X5 ) )
        & ! [X6] :
            ( member(X6,X1)
           => ? [X7] :
                ( apply(X0,X6,X7)
                & member(X7,X2) ) ) ) ),
    inference(unused_predicate_definition_removal,[],[f32]) ).

fof(f32,plain,
    ! [X0,X1,X2] :
      ( maps(X0,X1,X2)
    <=> ( ! [X3,X4,X5] :
            ( ( member(X5,X2)
              & member(X4,X2)
              & member(X3,X1) )
           => ( ( apply(X0,X3,X5)
                & apply(X0,X3,X4) )
             => X4 = X5 ) )
        & ! [X6] :
            ( member(X6,X1)
           => ? [X7] :
                ( apply(X0,X6,X7)
                & member(X7,X2) ) ) ) ),
    inference(rectify,[],[f12]) ).

fof(f12,axiom,
    ! [X5,X0,X1] :
      ( maps(X5,X0,X1)
    <=> ( ! [X2,X6,X7] :
            ( ( member(X7,X1)
              & member(X6,X1)
              & member(X2,X0) )
           => ( ( apply(X5,X2,X7)
                & apply(X5,X2,X6) )
             => X6 = X7 ) )
        & ! [X2] :
            ( member(X2,X0)
           => ? [X4] :
                ( apply(X5,X2,X4)
                & member(X4,X1) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.yb6a87vJfh/Vampire---4.8_26528',maps) ).

fof(f72,plain,
    apply(sK0,sK4(inverse_function(inverse_function(sK0,sK1,sK2),sK2,sK1),sK0,sK1,sK2),sK6(inverse_function(inverse_function(sK0,sK1,sK2),sK2,sK1),sK0,sK1,sK2)),
    inference(unit_resulting_resolution,[],[f53,f61]) ).

fof(f61,plain,
    ! [X2,X3,X0,X1] :
      ( apply(X1,sK4(X0,X1,X2,X3),sK6(X0,X1,X2,X3))
      | equal_maps(X0,X1,X2,X3) ),
    inference(cnf_transformation,[],[f50]) ).

fof(f70,plain,
    sK5(inverse_function(inverse_function(sK0,sK1,sK2),sK2,sK1),sK0,sK1,sK2) != sK6(inverse_function(inverse_function(sK0,sK1,sK2),sK2,sK1),sK0,sK1,sK2),
    inference(unit_resulting_resolution,[],[f53,f62]) ).

fof(f62,plain,
    ! [X2,X3,X0,X1] :
      ( sK5(X0,X1,X2,X3) != sK6(X0,X1,X2,X3)
      | equal_maps(X0,X1,X2,X3) ),
    inference(cnf_transformation,[],[f50]) ).

fof(f67,plain,
    member(sK6(inverse_function(inverse_function(sK0,sK1,sK2),sK2,sK1),sK0,sK1,sK2),sK2),
    inference(unit_resulting_resolution,[],[f53,f59]) ).

fof(f59,plain,
    ! [X2,X3,X0,X1] :
      ( member(sK6(X0,X1,X2,X3),X3)
      | equal_maps(X0,X1,X2,X3) ),
    inference(cnf_transformation,[],[f50]) ).

fof(f52,plain,
    maps(sK0,sK1,sK2),
    inference(cnf_transformation,[],[f46]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : SET720+4 : TPTP v8.1.2. Bugfixed v2.2.1.
% 0.13/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.15/0.36  % Computer : n015.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Tue Apr 30 17:38:33 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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.yb6a87vJfh/Vampire---4.8_26528
% 0.58/0.74  % (26774)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.58/0.74  % (26773)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.58/0.74  % (26767)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.58/0.74  % (26768)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.58/0.74  % (26770)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.58/0.74  % (26771)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.58/0.74  % (26769)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.58/0.74  % (26772)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.58/0.74  % (26774)Refutation not found, incomplete strategy% (26774)------------------------------
% 0.58/0.74  % (26774)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.58/0.74  % (26774)Termination reason: Refutation not found, incomplete strategy
% 0.58/0.74  
% 0.58/0.74  % (26774)Memory used [KB]: 1051
% 0.58/0.74  % (26774)Time elapsed: 0.002 s
% 0.58/0.74  % (26774)Instructions burned: 3 (million)
% 0.58/0.74  % (26774)------------------------------
% 0.58/0.74  % (26774)------------------------------
% 0.58/0.74  % (26772)Refutation not found, incomplete strategy% (26772)------------------------------
% 0.58/0.74  % (26772)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.58/0.74  % (26772)Termination reason: Refutation not found, incomplete strategy
% 0.58/0.74  
% 0.58/0.74  % (26772)Memory used [KB]: 1043
% 0.58/0.74  % (26772)Time elapsed: 0.003 s
% 0.58/0.74  % (26772)Instructions burned: 2 (million)
% 0.58/0.74  % (26772)------------------------------
% 0.58/0.74  % (26772)------------------------------
% 0.58/0.74  % (26770)First to succeed.
% 0.58/0.74  % (26771)Refutation not found, incomplete strategy% (26771)------------------------------
% 0.58/0.74  % (26771)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.58/0.74  % (26771)Termination reason: Refutation not found, incomplete strategy
% 0.58/0.74  
% 0.58/0.74  % (26771)Memory used [KB]: 1136
% 0.58/0.74  % (26771)Time elapsed: 0.004 s
% 0.58/0.74  % (26771)Instructions burned: 6 (million)
% 0.58/0.74  % (26771)------------------------------
% 0.58/0.74  % (26771)------------------------------
% 0.58/0.74  % (26770)Refutation found. Thanks to Tanya!
% 0.58/0.74  % SZS status Theorem for Vampire---4
% 0.58/0.74  % SZS output start Proof for Vampire---4
% See solution above
% 0.58/0.74  % (26770)------------------------------
% 0.58/0.74  % (26770)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.58/0.74  % (26770)Termination reason: Refutation
% 0.58/0.74  
% 0.58/0.74  % (26770)Memory used [KB]: 1074
% 0.58/0.74  % (26770)Time elapsed: 0.005 s
% 0.58/0.74  % (26770)Instructions burned: 7 (million)
% 0.58/0.74  % (26770)------------------------------
% 0.58/0.74  % (26770)------------------------------
% 0.58/0.74  % (26763)Success in time 0.372 s
% 0.58/0.74  % Vampire---4.8 exiting
%------------------------------------------------------------------------------