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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : KRS078+1 : TPTP v8.1.2. Released v3.1.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 : n014.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 07:17:47 EDT 2024

% Result   : Unsatisfiable 0.59s 0.76s
% Output   : Refutation 0.59s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   36 (   4 unt;   0 def)
%            Number of atoms       :  222 (  21 equ)
%            Maximal formula atoms :   22 (   6 avg)
%            Number of connectives :  293 ( 107   ~;  86   |;  85   &)
%                                         (   6 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   7 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   1 con; 0-1 aty)
%            Number of variables   :  124 (  86   !;  38   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f134,plain,
    $false,
    inference(resolution,[],[f133,f94]) ).

fof(f94,plain,
    cUnsatisfiable(i2003_11_14_17_19_13721),
    inference(cnf_transformation,[],[f18]) ).

fof(f18,axiom,
    cUnsatisfiable(i2003_11_14_17_19_13721),
    file('/export/starexec/sandbox/tmp/tmp.SwLaBDVQAP/Vampire---4.8_9796',axiom_4) ).

fof(f133,plain,
    ! [X0] : ~ cUnsatisfiable(X0),
    inference(duplicate_literal_removal,[],[f124]) ).

fof(f124,plain,
    ! [X0] :
      ( ~ cUnsatisfiable(X0)
      | ~ cUnsatisfiable(X0)
      | ~ cUnsatisfiable(X0) ),
    inference(superposition,[],[f115,f122]) ).

fof(f122,plain,
    ! [X0] :
      ( sK5(X0) = X0
      | ~ cUnsatisfiable(X0) ),
    inference(duplicate_literal_removal,[],[f121]) ).

fof(f121,plain,
    ! [X0] :
      ( sK5(X0) = X0
      | ~ cUnsatisfiable(X0)
      | ~ cUnsatisfiable(X0) ),
    inference(resolution,[],[f119,f80]) ).

fof(f80,plain,
    ! [X0] :
      ( rinvR(sK4(X0),sK5(X0))
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f60]) ).

fof(f60,plain,
    ! [X0] :
      ( ( cUnsatisfiable(X0)
        | ! [X1] :
            ( cp(X1)
            | cq(X1)
            | ~ rs(X0,X1) )
        | ! [X2] :
            ( ( sK0(X2) != sK1(X2)
              & rinvR(X2,sK1(X2))
              & rinvR(X2,sK0(X2)) )
            | ! [X5] :
                ( ( ~ cp(sK2(X5))
                  & rs(X5,sK2(X5)) )
                | ~ rinvR(X2,X5) )
            | ~ rr(X0,X2) ) )
      & ( ( ~ cp(sK3(X0))
          & ~ cq(sK3(X0))
          & rs(X0,sK3(X0))
          & ! [X9,X10] :
              ( X9 = X10
              | ~ rinvR(sK4(X0),X10)
              | ~ rinvR(sK4(X0),X9) )
          & ! [X12] :
              ( cp(X12)
              | ~ rs(sK5(X0),X12) )
          & rinvR(sK4(X0),sK5(X0))
          & rr(X0,sK4(X0)) )
        | ~ cUnsatisfiable(X0) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f54,f59,f58,f57,f56,f55]) ).

fof(f55,plain,
    ! [X2] :
      ( ? [X3,X4] :
          ( X3 != X4
          & rinvR(X2,X4)
          & rinvR(X2,X3) )
     => ( sK0(X2) != sK1(X2)
        & rinvR(X2,sK1(X2))
        & rinvR(X2,sK0(X2)) ) ),
    introduced(choice_axiom,[]) ).

fof(f56,plain,
    ! [X5] :
      ( ? [X6] :
          ( ~ cp(X6)
          & rs(X5,X6) )
     => ( ~ cp(sK2(X5))
        & rs(X5,sK2(X5)) ) ),
    introduced(choice_axiom,[]) ).

fof(f57,plain,
    ! [X0] :
      ( ? [X7] :
          ( ~ cp(X7)
          & ~ cq(X7)
          & rs(X0,X7) )
     => ( ~ cp(sK3(X0))
        & ~ cq(sK3(X0))
        & rs(X0,sK3(X0)) ) ),
    introduced(choice_axiom,[]) ).

fof(f58,plain,
    ! [X0] :
      ( ? [X8] :
          ( ! [X9,X10] :
              ( X9 = X10
              | ~ rinvR(X8,X10)
              | ~ rinvR(X8,X9) )
          & ? [X11] :
              ( ! [X12] :
                  ( cp(X12)
                  | ~ rs(X11,X12) )
              & rinvR(X8,X11) )
          & rr(X0,X8) )
     => ( ! [X10,X9] :
            ( X9 = X10
            | ~ rinvR(sK4(X0),X10)
            | ~ rinvR(sK4(X0),X9) )
        & ? [X11] :
            ( ! [X12] :
                ( cp(X12)
                | ~ rs(X11,X12) )
            & rinvR(sK4(X0),X11) )
        & rr(X0,sK4(X0)) ) ),
    introduced(choice_axiom,[]) ).

fof(f59,plain,
    ! [X0] :
      ( ? [X11] :
          ( ! [X12] :
              ( cp(X12)
              | ~ rs(X11,X12) )
          & rinvR(sK4(X0),X11) )
     => ( ! [X12] :
            ( cp(X12)
            | ~ rs(sK5(X0),X12) )
        & rinvR(sK4(X0),sK5(X0)) ) ),
    introduced(choice_axiom,[]) ).

fof(f54,plain,
    ! [X0] :
      ( ( cUnsatisfiable(X0)
        | ! [X1] :
            ( cp(X1)
            | cq(X1)
            | ~ rs(X0,X1) )
        | ! [X2] :
            ( ? [X3,X4] :
                ( X3 != X4
                & rinvR(X2,X4)
                & rinvR(X2,X3) )
            | ! [X5] :
                ( ? [X6] :
                    ( ~ cp(X6)
                    & rs(X5,X6) )
                | ~ rinvR(X2,X5) )
            | ~ rr(X0,X2) ) )
      & ( ( ? [X7] :
              ( ~ cp(X7)
              & ~ cq(X7)
              & rs(X0,X7) )
          & ? [X8] :
              ( ! [X9,X10] :
                  ( X9 = X10
                  | ~ rinvR(X8,X10)
                  | ~ rinvR(X8,X9) )
              & ? [X11] :
                  ( ! [X12] :
                      ( cp(X12)
                      | ~ rs(X11,X12) )
                  & rinvR(X8,X11) )
              & rr(X0,X8) ) )
        | ~ cUnsatisfiable(X0) ) ),
    inference(rectify,[],[f53]) ).

fof(f53,plain,
    ! [X0] :
      ( ( cUnsatisfiable(X0)
        | ! [X1] :
            ( cp(X1)
            | cq(X1)
            | ~ rs(X0,X1) )
        | ! [X2] :
            ( ? [X3,X4] :
                ( X3 != X4
                & rinvR(X2,X4)
                & rinvR(X2,X3) )
            | ! [X5] :
                ( ? [X6] :
                    ( ~ cp(X6)
                    & rs(X5,X6) )
                | ~ rinvR(X2,X5) )
            | ~ rr(X0,X2) ) )
      & ( ( ? [X1] :
              ( ~ cp(X1)
              & ~ cq(X1)
              & rs(X0,X1) )
          & ? [X2] :
              ( ! [X3,X4] :
                  ( X3 = X4
                  | ~ rinvR(X2,X4)
                  | ~ rinvR(X2,X3) )
              & ? [X5] :
                  ( ! [X6] :
                      ( cp(X6)
                      | ~ rs(X5,X6) )
                  & rinvR(X2,X5) )
              & rr(X0,X2) ) )
        | ~ cUnsatisfiable(X0) ) ),
    inference(flattening,[],[f52]) ).

fof(f52,plain,
    ! [X0] :
      ( ( cUnsatisfiable(X0)
        | ! [X1] :
            ( cp(X1)
            | cq(X1)
            | ~ rs(X0,X1) )
        | ! [X2] :
            ( ? [X3,X4] :
                ( X3 != X4
                & rinvR(X2,X4)
                & rinvR(X2,X3) )
            | ! [X5] :
                ( ? [X6] :
                    ( ~ cp(X6)
                    & rs(X5,X6) )
                | ~ rinvR(X2,X5) )
            | ~ rr(X0,X2) ) )
      & ( ( ? [X1] :
              ( ~ cp(X1)
              & ~ cq(X1)
              & rs(X0,X1) )
          & ? [X2] :
              ( ! [X3,X4] :
                  ( X3 = X4
                  | ~ rinvR(X2,X4)
                  | ~ rinvR(X2,X3) )
              & ? [X5] :
                  ( ! [X6] :
                      ( cp(X6)
                      | ~ rs(X5,X6) )
                  & rinvR(X2,X5) )
              & rr(X0,X2) ) )
        | ~ cUnsatisfiable(X0) ) ),
    inference(nnf_transformation,[],[f50]) ).

fof(f50,plain,
    ! [X0] :
      ( cUnsatisfiable(X0)
    <=> ( ? [X1] :
            ( ~ cp(X1)
            & ~ cq(X1)
            & rs(X0,X1) )
        & ? [X2] :
            ( ! [X3,X4] :
                ( X3 = X4
                | ~ rinvR(X2,X4)
                | ~ rinvR(X2,X3) )
            & ? [X5] :
                ( ! [X6] :
                    ( cp(X6)
                    | ~ rs(X5,X6) )
                & rinvR(X2,X5) )
            & rr(X0,X2) ) ) ),
    inference(flattening,[],[f49]) ).

fof(f49,plain,
    ! [X0] :
      ( cUnsatisfiable(X0)
    <=> ( ? [X1] :
            ( ~ cp(X1)
            & ~ cq(X1)
            & rs(X0,X1) )
        & ? [X2] :
            ( ! [X3,X4] :
                ( X3 = X4
                | ~ rinvR(X2,X4)
                | ~ rinvR(X2,X3) )
            & ? [X5] :
                ( ! [X6] :
                    ( cp(X6)
                    | ~ rs(X5,X6) )
                & rinvR(X2,X5) )
            & rr(X0,X2) ) ) ),
    inference(ennf_transformation,[],[f21]) ).

fof(f21,plain,
    ! [X0] :
      ( cUnsatisfiable(X0)
    <=> ( ? [X1] :
            ( ~ cp(X1)
            & ~ cq(X1)
            & rs(X0,X1) )
        & ? [X2] :
            ( ! [X3,X4] :
                ( ( rinvR(X2,X4)
                  & rinvR(X2,X3) )
               => X3 = X4 )
            & ? [X5] :
                ( ! [X6] :
                    ( rs(X5,X6)
                   => cp(X6) )
                & rinvR(X2,X5) )
            & rr(X0,X2) ) ) ),
    inference(rectify,[],[f16]) ).

fof(f16,axiom,
    ! [X3] :
      ( cUnsatisfiable(X3)
    <=> ( ? [X4] :
            ( ~ cp(X4)
            & ~ cq(X4)
            & rs(X3,X4) )
        & ? [X4] :
            ( ! [X7,X8] :
                ( ( rinvR(X4,X8)
                  & rinvR(X4,X7) )
               => X7 = X8 )
            & ? [X5] :
                ( ! [X6] :
                    ( rs(X5,X6)
                   => cp(X6) )
                & rinvR(X4,X5) )
            & rr(X3,X4) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.SwLaBDVQAP/Vampire---4.8_9796',axiom_2) ).

fof(f119,plain,
    ! [X0,X1] :
      ( ~ rinvR(sK4(X1),X0)
      | X0 = X1
      | ~ cUnsatisfiable(X1) ),
    inference(duplicate_literal_removal,[],[f116]) ).

fof(f116,plain,
    ! [X0,X1] :
      ( X0 = X1
      | ~ rinvR(sK4(X1),X0)
      | ~ cUnsatisfiable(X1)
      | ~ cUnsatisfiable(X1) ),
    inference(resolution,[],[f82,f109]) ).

fof(f109,plain,
    ! [X0] :
      ( rinvR(sK4(X0),X0)
      | ~ cUnsatisfiable(X0) ),
    inference(resolution,[],[f93,f79]) ).

fof(f79,plain,
    ! [X0] :
      ( rr(X0,sK4(X0))
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f60]) ).

fof(f93,plain,
    ! [X0,X1] :
      ( ~ rr(X1,X0)
      | rinvR(X0,X1) ),
    inference(cnf_transformation,[],[f61]) ).

fof(f61,plain,
    ! [X0,X1] :
      ( ( rinvR(X0,X1)
        | ~ rr(X1,X0) )
      & ( rr(X1,X0)
        | ~ rinvR(X0,X1) ) ),
    inference(nnf_transformation,[],[f22]) ).

fof(f22,plain,
    ! [X0,X1] :
      ( rinvR(X0,X1)
    <=> rr(X1,X0) ),
    inference(rectify,[],[f17]) ).

fof(f17,axiom,
    ! [X3,X4] :
      ( rinvR(X3,X4)
    <=> rr(X4,X3) ),
    file('/export/starexec/sandbox/tmp/tmp.SwLaBDVQAP/Vampire---4.8_9796',axiom_3) ).

fof(f82,plain,
    ! [X10,X0,X9] :
      ( ~ rinvR(sK4(X0),X10)
      | X9 = X10
      | ~ rinvR(sK4(X0),X9)
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f60]) ).

fof(f115,plain,
    ! [X0] :
      ( ~ cUnsatisfiable(sK5(X0))
      | ~ cUnsatisfiable(X0) ),
    inference(duplicate_literal_removal,[],[f114]) ).

fof(f114,plain,
    ! [X0] :
      ( ~ cUnsatisfiable(X0)
      | ~ cUnsatisfiable(sK5(X0))
      | ~ cUnsatisfiable(sK5(X0)) ),
    inference(resolution,[],[f113,f85]) ).

fof(f85,plain,
    ! [X0] :
      ( ~ cp(sK3(X0))
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f60]) ).

fof(f113,plain,
    ! [X0] :
      ( cp(sK3(sK5(X0)))
      | ~ cUnsatisfiable(X0)
      | ~ cUnsatisfiable(sK5(X0)) ),
    inference(resolution,[],[f81,f83]) ).

fof(f83,plain,
    ! [X0] :
      ( rs(X0,sK3(X0))
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f60]) ).

fof(f81,plain,
    ! [X0,X12] :
      ( ~ rs(sK5(X0),X12)
      | cp(X12)
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f60]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13  % Problem    : KRS078+1 : TPTP v8.1.2. Released v3.1.0.
% 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.14/0.36  % Computer : n014.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 19:52:38 EDT 2024
% 0.14/0.36  % CPUTime    : 
% 0.14/0.36  This is a FOF_UNS_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.SwLaBDVQAP/Vampire---4.8_9796
% 0.55/0.76  % (10064)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.55/0.76  % (10064)Refutation not found, incomplete strategy% (10064)------------------------------
% 0.55/0.76  % (10064)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.76  % (10064)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.76  
% 0.55/0.76  % (10064)Memory used [KB]: 945
% 0.55/0.76  % (10064)Time elapsed: 0.001 s
% 0.55/0.76  % (10064)Instructions burned: 2 (million)
% 0.55/0.76  % (10064)------------------------------
% 0.55/0.76  % (10064)------------------------------
% 0.55/0.76  % (10058)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.55/0.76  % (10061)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.55/0.76  % (10059)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.55/0.76  % (10062)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.55/0.76  % (10063)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.55/0.76  % (10060)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.55/0.76  % (10058)Refutation not found, incomplete strategy% (10058)------------------------------
% 0.55/0.76  % (10058)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.76  % (10058)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.76  
% 0.55/0.76  % (10058)Memory used [KB]: 945
% 0.55/0.76  % (10058)Time elapsed: 0.002 s
% 0.55/0.76  % (10058)Instructions burned: 2 (million)
% 0.55/0.76  % (10061)Refutation not found, incomplete strategy% (10061)------------------------------
% 0.55/0.76  % (10061)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.76  % (10061)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.76  
% 0.55/0.76  % (10063)Refutation not found, incomplete strategy% (10063)------------------------------
% 0.55/0.76  % (10063)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.76  % (10061)Memory used [KB]: 945
% 0.55/0.76  % (10061)Time elapsed: 0.002 s
% 0.55/0.76  % (10061)Instructions burned: 2 (million)
% 0.55/0.76  % (10060)Refutation not found, incomplete strategy% (10060)------------------------------
% 0.55/0.76  % (10060)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.76  % (10063)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.76  
% 0.55/0.76  % (10063)Memory used [KB]: 945
% 0.55/0.76  % (10063)Time elapsed: 0.002 s
% 0.55/0.76  % (10063)Instructions burned: 2 (million)
% 0.55/0.76  % (10060)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.76  % (10058)------------------------------
% 0.55/0.76  % (10058)------------------------------
% 0.55/0.76  
% 0.55/0.76  % (10060)Memory used [KB]: 945
% 0.55/0.76  % (10060)Time elapsed: 0.002 s
% 0.55/0.76  % (10060)Instructions burned: 2 (million)
% 0.55/0.76  % (10061)------------------------------
% 0.55/0.76  % (10061)------------------------------
% 0.55/0.76  % (10063)------------------------------
% 0.55/0.76  % (10063)------------------------------
% 0.55/0.76  % (10060)------------------------------
% 0.55/0.76  % (10060)------------------------------
% 0.59/0.76  % (10062)Refutation not found, incomplete strategy% (10062)------------------------------
% 0.59/0.76  % (10062)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.76  % (10062)Termination reason: Refutation not found, incomplete strategy
% 0.59/0.76  
% 0.59/0.76  % (10062)Memory used [KB]: 1028
% 0.59/0.76  % (10062)Time elapsed: 0.003 s
% 0.59/0.76  % (10062)Instructions burned: 3 (million)
% 0.59/0.76  % (10065)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.76  % (10062)------------------------------
% 0.59/0.76  % (10062)------------------------------
% 0.59/0.76  % (10065)Refutation not found, incomplete strategy% (10065)------------------------------
% 0.59/0.76  % (10065)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.76  % (10065)Termination reason: Refutation not found, incomplete strategy
% 0.59/0.76  
% 0.59/0.76  % (10065)Memory used [KB]: 945
% 0.59/0.76  % (10065)Time elapsed: 0.001 s
% 0.59/0.76  % (10065)Instructions burned: 2 (million)
% 0.59/0.76  % (10065)------------------------------
% 0.59/0.76  % (10065)------------------------------
% 0.59/0.76  % (10059)First to succeed.
% 0.59/0.76  % (10059)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-10054"
% 0.59/0.76  % (10059)Refutation found. Thanks to Tanya!
% 0.59/0.76  % SZS status Unsatisfiable for Vampire---4
% 0.59/0.76  % SZS output start Proof for Vampire---4
% See solution above
% 0.59/0.76  % (10059)------------------------------
% 0.59/0.76  % (10059)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.76  % (10059)Termination reason: Refutation
% 0.59/0.76  
% 0.59/0.76  % (10059)Memory used [KB]: 1056
% 0.59/0.76  % (10059)Time elapsed: 0.005 s
% 0.59/0.76  % (10059)Instructions burned: 5 (million)
% 0.59/0.76  % (10054)Success in time 0.387 s
% 0.59/0.76  % Vampire---4.8 exiting
%------------------------------------------------------------------------------