TSTP Solution File: SWC317+1 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : SWC317+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s

% Computer : n010.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 : Tue May 21 05:12:59 EDT 2024

% Result   : Theorem 1.32s 0.54s
% Output   : Refutation 1.32s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   23
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   55 (   9 unt;   0 def)
%            Number of atoms       :  288 (  83 equ)
%            Maximal formula atoms :   18 (   5 avg)
%            Number of connectives :  335 ( 102   ~;  87   |; 122   &)
%                                         (   0 <=>;  24  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   19 (   7 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-4 aty)
%            Number of functors    :    9 (   9 usr;   5 con; 0-2 aty)
%            Number of variables   :  135 (  87   !;  48   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f3825,plain,
    $false,
    inference(resolution,[],[f3824,f710]) ).

fof(f710,plain,
    neq(sK23,nil),
    inference(duplicate_literal_removal,[],[f708]) ).

fof(f708,plain,
    ( neq(sK23,nil)
    | neq(sK23,nil) ),
    inference(resolution,[],[f385,f657]) ).

fof(f657,plain,
    ( sP1(sK22,sK23,sK23,sK22)
    | neq(sK23,nil) ),
    inference(forward_demodulation,[],[f656,f397]) ).

fof(f397,plain,
    sK22 = sK24,
    inference(cnf_transformation,[],[f265]) ).

fof(f265,plain,
    ( ( ( ~ neq(sK25,nil)
        & neq(sK23,nil) )
      | sP1(sK24,sK25,sK23,sK22) )
    & sK22 = sK24
    & sK23 = sK25
    & ssList(sK25)
    & ssList(sK24)
    & ssList(sK23)
    & ssList(sK22) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK22,sK23,sK24,sK25])],[f226,f264,f263,f262,f261]) ).

fof(f261,plain,
    ( ? [X0] :
        ( ? [X1] :
            ( ? [X2] :
                ( ? [X3] :
                    ( ( ( ~ neq(X3,nil)
                        & neq(X1,nil) )
                      | sP1(X2,X3,X1,X0) )
                    & X0 = X2
                    & X1 = X3
                    & ssList(X3) )
                & ssList(X2) )
            & ssList(X1) )
        & ssList(X0) )
   => ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ( ( ~ neq(X3,nil)
                      & neq(X1,nil) )
                    | sP1(X2,X3,X1,sK22) )
                  & sK22 = X2
                  & X1 = X3
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(sK22) ) ),
    introduced(choice_axiom,[]) ).

fof(f262,plain,
    ( ? [X1] :
        ( ? [X2] :
            ( ? [X3] :
                ( ( ( ~ neq(X3,nil)
                    & neq(X1,nil) )
                  | sP1(X2,X3,X1,sK22) )
                & sK22 = X2
                & X1 = X3
                & ssList(X3) )
            & ssList(X2) )
        & ssList(X1) )
   => ( ? [X2] :
          ( ? [X3] :
              ( ( ( ~ neq(X3,nil)
                  & neq(sK23,nil) )
                | sP1(X2,X3,sK23,sK22) )
              & sK22 = X2
              & sK23 = X3
              & ssList(X3) )
          & ssList(X2) )
      & ssList(sK23) ) ),
    introduced(choice_axiom,[]) ).

fof(f263,plain,
    ( ? [X2] :
        ( ? [X3] :
            ( ( ( ~ neq(X3,nil)
                & neq(sK23,nil) )
              | sP1(X2,X3,sK23,sK22) )
            & sK22 = X2
            & sK23 = X3
            & ssList(X3) )
        & ssList(X2) )
   => ( ? [X3] :
          ( ( ( ~ neq(X3,nil)
              & neq(sK23,nil) )
            | sP1(sK24,X3,sK23,sK22) )
          & sK22 = sK24
          & sK23 = X3
          & ssList(X3) )
      & ssList(sK24) ) ),
    introduced(choice_axiom,[]) ).

fof(f264,plain,
    ( ? [X3] :
        ( ( ( ~ neq(X3,nil)
            & neq(sK23,nil) )
          | sP1(sK24,X3,sK23,sK22) )
        & sK22 = sK24
        & sK23 = X3
        & ssList(X3) )
   => ( ( ( ~ neq(sK25,nil)
          & neq(sK23,nil) )
        | sP1(sK24,sK25,sK23,sK22) )
      & sK22 = sK24
      & sK23 = sK25
      & ssList(sK25) ) ),
    introduced(choice_axiom,[]) ).

fof(f226,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ( ( ~ neq(X3,nil)
                      & neq(X1,nil) )
                    | sP1(X2,X3,X1,X0) )
                  & X0 = X2
                  & X1 = X3
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(definition_folding,[],[f100,f225,f224]) ).

fof(f224,plain,
    ! [X3,X2] :
      ( ? [X4] :
          ( ? [X5] :
              ( app(X5,cons(X4,nil)) = X3
              & app(cons(X4,nil),X5) = X2
              & ssList(X5) )
          & ssItem(X4) )
      | ~ sP0(X3,X2) ),
    introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).

fof(f225,plain,
    ! [X2,X3,X1,X0] :
      ( ( sP0(X3,X2)
        & ! [X6] :
            ( ! [X7] :
                ( app(X7,cons(X6,nil)) != X1
                | app(cons(X6,nil),X7) != X0
                | ~ ssList(X7) )
            | ~ ssItem(X6) )
        & neq(X1,nil) )
      | ~ sP1(X2,X3,X1,X0) ),
    introduced(predicate_definition_introduction,[new_symbols(naming,[sP1])]) ).

fof(f100,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ( ( ~ neq(X3,nil)
                      & neq(X1,nil) )
                    | ( ? [X4] :
                          ( ? [X5] :
                              ( app(X5,cons(X4,nil)) = X3
                              & app(cons(X4,nil),X5) = X2
                              & ssList(X5) )
                          & ssItem(X4) )
                      & ! [X6] :
                          ( ! [X7] :
                              ( app(X7,cons(X6,nil)) != X1
                              | app(cons(X6,nil),X7) != X0
                              | ~ ssList(X7) )
                          | ~ ssItem(X6) )
                      & neq(X1,nil) ) )
                  & X0 = X2
                  & X1 = X3
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(flattening,[],[f99]) ).

fof(f99,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ( ( ~ neq(X3,nil)
                      & neq(X1,nil) )
                    | ( ? [X4] :
                          ( ? [X5] :
                              ( app(X5,cons(X4,nil)) = X3
                              & app(cons(X4,nil),X5) = X2
                              & ssList(X5) )
                          & ssItem(X4) )
                      & ! [X6] :
                          ( ! [X7] :
                              ( app(X7,cons(X6,nil)) != X1
                              | app(cons(X6,nil),X7) != X0
                              | ~ ssList(X7) )
                          | ~ ssItem(X6) )
                      & 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)
                   => ( ( ( neq(X3,nil)
                          | ~ neq(X1,nil) )
                        & ( ! [X4] :
                              ( ssItem(X4)
                             => ! [X5] :
                                  ( ssList(X5)
                                 => ( app(X5,cons(X4,nil)) != X3
                                    | app(cons(X4,nil),X5) != X2 ) ) )
                          | ? [X6] :
                              ( ? [X7] :
                                  ( app(X7,cons(X6,nil)) = X1
                                  & app(cons(X6,nil),X7) = X0
                                  & ssList(X7) )
                              & ssItem(X6) )
                          | ~ 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)
                   => ( ( ( neq(X3,nil)
                          | ~ neq(X1,nil) )
                        & ( ! [X6] :
                              ( ssItem(X6)
                             => ! [X7] :
                                  ( ssList(X7)
                                 => ( app(X7,cons(X6,nil)) != X3
                                    | app(cons(X6,nil),X7) != X2 ) ) )
                          | ? [X4] :
                              ( ? [X5] :
                                  ( app(X5,cons(X4,nil)) = X1
                                  & app(cons(X4,nil),X5) = X0
                                  & 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)
                 => ( ( ( neq(X3,nil)
                        | ~ neq(X1,nil) )
                      & ( ! [X6] :
                            ( ssItem(X6)
                           => ! [X7] :
                                ( ssList(X7)
                               => ( app(X7,cons(X6,nil)) != X3
                                  | app(cons(X6,nil),X7) != X2 ) ) )
                        | ? [X4] :
                            ( ? [X5] :
                                ( app(X5,cons(X4,nil)) = X1
                                & app(cons(X4,nil),X5) = X0
                                & ssList(X5) )
                            & ssItem(X4) )
                        | ~ neq(X1,nil) ) )
                    | X0 != X2
                    | X1 != X3 ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

fof(f656,plain,
    ( sP1(sK24,sK23,sK23,sK22)
    | neq(sK23,nil) ),
    inference(forward_demodulation,[],[f398,f396]) ).

fof(f396,plain,
    sK23 = sK25,
    inference(cnf_transformation,[],[f265]) ).

fof(f398,plain,
    ( neq(sK23,nil)
    | sP1(sK24,sK25,sK23,sK22) ),
    inference(cnf_transformation,[],[f265]) ).

fof(f385,plain,
    ! [X2,X3,X0,X1] :
      ( ~ sP1(X0,X1,X2,X3)
      | neq(X2,nil) ),
    inference(cnf_transformation,[],[f255]) ).

fof(f255,plain,
    ! [X0,X1,X2,X3] :
      ( ( sP0(X1,X0)
        & ! [X4] :
            ( ! [X5] :
                ( app(X5,cons(X4,nil)) != X2
                | app(cons(X4,nil),X5) != X3
                | ~ ssList(X5) )
            | ~ ssItem(X4) )
        & neq(X2,nil) )
      | ~ sP1(X0,X1,X2,X3) ),
    inference(rectify,[],[f254]) ).

fof(f254,plain,
    ! [X2,X3,X1,X0] :
      ( ( sP0(X3,X2)
        & ! [X6] :
            ( ! [X7] :
                ( app(X7,cons(X6,nil)) != X1
                | app(cons(X6,nil),X7) != X0
                | ~ ssList(X7) )
            | ~ ssItem(X6) )
        & neq(X1,nil) )
      | ~ sP1(X2,X3,X1,X0) ),
    inference(nnf_transformation,[],[f225]) ).

fof(f3824,plain,
    ~ neq(sK23,nil),
    inference(resolution,[],[f3823,f711]) ).

fof(f711,plain,
    ( sP0(sK23,sK22)
    | ~ neq(sK23,nil) ),
    inference(resolution,[],[f387,f655]) ).

fof(f655,plain,
    ( sP1(sK22,sK23,sK23,sK22)
    | ~ neq(sK23,nil) ),
    inference(forward_demodulation,[],[f654,f397]) ).

fof(f654,plain,
    ( sP1(sK24,sK23,sK23,sK22)
    | ~ neq(sK23,nil) ),
    inference(forward_demodulation,[],[f653,f396]) ).

fof(f653,plain,
    ( ~ neq(sK23,nil)
    | sP1(sK24,sK25,sK23,sK22) ),
    inference(forward_demodulation,[],[f399,f396]) ).

fof(f399,plain,
    ( ~ neq(sK25,nil)
    | sP1(sK24,sK25,sK23,sK22) ),
    inference(cnf_transformation,[],[f265]) ).

fof(f387,plain,
    ! [X2,X3,X0,X1] :
      ( ~ sP1(X0,X1,X2,X3)
      | sP0(X1,X0) ),
    inference(cnf_transformation,[],[f255]) ).

fof(f3823,plain,
    ~ sP0(sK23,sK22),
    inference(resolution,[],[f3820,f389]) ).

fof(f389,plain,
    ! [X0,X1] :
      ( ssList(sK21(X0,X1))
      | ~ sP0(X0,X1) ),
    inference(cnf_transformation,[],[f260]) ).

fof(f260,plain,
    ! [X0,X1] :
      ( ( app(sK21(X0,X1),cons(sK20(X0,X1),nil)) = X0
        & app(cons(sK20(X0,X1),nil),sK21(X0,X1)) = X1
        & ssList(sK21(X0,X1))
        & ssItem(sK20(X0,X1)) )
      | ~ sP0(X0,X1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK20,sK21])],[f257,f259,f258]) ).

fof(f258,plain,
    ! [X0,X1] :
      ( ? [X2] :
          ( ? [X3] :
              ( app(X3,cons(X2,nil)) = X0
              & app(cons(X2,nil),X3) = X1
              & ssList(X3) )
          & ssItem(X2) )
     => ( ? [X3] :
            ( app(X3,cons(sK20(X0,X1),nil)) = X0
            & app(cons(sK20(X0,X1),nil),X3) = X1
            & ssList(X3) )
        & ssItem(sK20(X0,X1)) ) ),
    introduced(choice_axiom,[]) ).

fof(f259,plain,
    ! [X0,X1] :
      ( ? [X3] :
          ( app(X3,cons(sK20(X0,X1),nil)) = X0
          & app(cons(sK20(X0,X1),nil),X3) = X1
          & ssList(X3) )
     => ( app(sK21(X0,X1),cons(sK20(X0,X1),nil)) = X0
        & app(cons(sK20(X0,X1),nil),sK21(X0,X1)) = X1
        & ssList(sK21(X0,X1)) ) ),
    introduced(choice_axiom,[]) ).

fof(f257,plain,
    ! [X0,X1] :
      ( ? [X2] :
          ( ? [X3] :
              ( app(X3,cons(X2,nil)) = X0
              & app(cons(X2,nil),X3) = X1
              & ssList(X3) )
          & ssItem(X2) )
      | ~ sP0(X0,X1) ),
    inference(rectify,[],[f256]) ).

fof(f256,plain,
    ! [X3,X2] :
      ( ? [X4] :
          ( ? [X5] :
              ( app(X5,cons(X4,nil)) = X3
              & app(cons(X4,nil),X5) = X2
              & ssList(X5) )
          & ssItem(X4) )
      | ~ sP0(X3,X2) ),
    inference(nnf_transformation,[],[f224]) ).

fof(f3820,plain,
    ~ ssList(sK21(sK23,sK22)),
    inference(resolution,[],[f3819,f710]) ).

fof(f3819,plain,
    ( ~ neq(sK23,nil)
    | ~ ssList(sK21(sK23,sK22)) ),
    inference(resolution,[],[f3818,f711]) ).

fof(f3818,plain,
    ( ~ sP0(sK23,sK22)
    | ~ ssList(sK21(sK23,sK22)) ),
    inference(resolution,[],[f3815,f388]) ).

fof(f388,plain,
    ! [X0,X1] :
      ( ssItem(sK20(X0,X1))
      | ~ sP0(X0,X1) ),
    inference(cnf_transformation,[],[f260]) ).

fof(f3815,plain,
    ( ~ ssItem(sK20(sK23,sK22))
    | ~ ssList(sK21(sK23,sK22)) ),
    inference(resolution,[],[f3814,f710]) ).

fof(f3814,plain,
    ( ~ neq(sK23,nil)
    | ~ ssList(sK21(sK23,sK22))
    | ~ ssItem(sK20(sK23,sK22)) ),
    inference(resolution,[],[f3362,f655]) ).

fof(f3362,plain,
    ! [X0,X1] :
      ( ~ sP1(X0,X1,sK23,sK22)
      | ~ ssItem(sK20(sK23,sK22))
      | ~ ssList(sK21(sK23,sK22)) ),
    inference(forward_demodulation,[],[f3354,f1504]) ).

fof(f1504,plain,
    sK22 = app(cons(sK20(sK23,sK22),nil),sK21(sK23,sK22)),
    inference(resolution,[],[f1500,f710]) ).

fof(f1500,plain,
    ( ~ neq(sK23,nil)
    | sK22 = app(cons(sK20(sK23,sK22),nil),sK21(sK23,sK22)) ),
    inference(resolution,[],[f390,f711]) ).

fof(f390,plain,
    ! [X0,X1] :
      ( ~ sP0(X0,X1)
      | app(cons(sK20(X0,X1),nil),sK21(X0,X1)) = X1 ),
    inference(cnf_transformation,[],[f260]) ).

fof(f3354,plain,
    ! [X0,X1] :
      ( ~ sP1(X0,X1,sK23,app(cons(sK20(sK23,sK22),nil),sK21(sK23,sK22)))
      | ~ ssItem(sK20(sK23,sK22))
      | ~ ssList(sK21(sK23,sK22)) ),
    inference(superposition,[],[f618,f1522]) ).

fof(f1522,plain,
    sK23 = app(sK21(sK23,sK22),cons(sK20(sK23,sK22),nil)),
    inference(resolution,[],[f1519,f710]) ).

fof(f1519,plain,
    ( ~ neq(sK23,nil)
    | sK23 = app(sK21(sK23,sK22),cons(sK20(sK23,sK22),nil)) ),
    inference(resolution,[],[f391,f711]) ).

fof(f391,plain,
    ! [X0,X1] :
      ( ~ sP0(X0,X1)
      | app(sK21(X0,X1),cons(sK20(X0,X1),nil)) = X0 ),
    inference(cnf_transformation,[],[f260]) ).

fof(f618,plain,
    ! [X0,X1,X4,X5] :
      ( ~ sP1(X0,X1,app(X5,cons(X4,nil)),app(cons(X4,nil),X5))
      | ~ ssItem(X4)
      | ~ ssList(X5) ),
    inference(equality_resolution,[],[f617]) ).

fof(f617,plain,
    ! [X3,X0,X1,X4,X5] :
      ( app(cons(X4,nil),X5) != X3
      | ~ ssList(X5)
      | ~ ssItem(X4)
      | ~ sP1(X0,X1,app(X5,cons(X4,nil)),X3) ),
    inference(equality_resolution,[],[f386]) ).

fof(f386,plain,
    ! [X2,X3,X0,X1,X4,X5] :
      ( app(X5,cons(X4,nil)) != X2
      | app(cons(X4,nil),X5) != X3
      | ~ ssList(X5)
      | ~ ssItem(X4)
      | ~ sP1(X0,X1,X2,X3) ),
    inference(cnf_transformation,[],[f255]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SWC317+1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35  % Computer : n010.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Sun May 19 02:47:23 EDT 2024
% 0.14/0.36  % CPUTime    : 
% 0.14/0.36  % (27027)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.38  % (27030)WARNING: value z3 for option sas not known
% 0.14/0.38  % (27028)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.38  % (27029)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.38  % (27031)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.38  % (27030)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.14/0.38  % (27032)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.14/0.38  % (27033)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.14/0.38  % (27034)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.22/0.40  TRYING [1]
% 0.22/0.40  TRYING [1]
% 0.22/0.40  TRYING [2]
% 0.22/0.40  TRYING [2]
% 0.22/0.41  TRYING [3]
% 0.22/0.41  TRYING [3]
% 0.22/0.45  TRYING [1]
% 0.22/0.45  TRYING [2]
% 0.22/0.46  TRYING [4]
% 0.22/0.46  TRYING [3]
% 0.22/0.47  TRYING [4]
% 1.18/0.51  TRYING [4]
% 1.32/0.54  % (27033)First to succeed.
% 1.32/0.54  % (27033)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-27027"
% 1.32/0.54  % (27033)Refutation found. Thanks to Tanya!
% 1.32/0.54  % SZS status Theorem for theBenchmark
% 1.32/0.54  % SZS output start Proof for theBenchmark
% See solution above
% 1.32/0.54  % (27033)------------------------------
% 1.32/0.54  % (27033)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 1.32/0.54  % (27033)Termination reason: Refutation
% 1.32/0.54  
% 1.32/0.54  % (27033)Memory used [KB]: 4554
% 1.32/0.54  % (27033)Time elapsed: 0.160 s
% 1.32/0.54  % (27033)Instructions burned: 333 (million)
% 1.32/0.54  % (27027)Success in time 0.169 s
%------------------------------------------------------------------------------