↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : KRS078+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n015.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Sep 29 11:41:36 AM UTC 2026

% Result   : Unsatisfiable 3.67s 1.49s
% Output   : Refutation 3.67s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   48 (   8 unt;   2 def)
%            Number of atoms       :  231 (  21 equ)
%            Maximal formula atoms :   22 (   4 avg)
%            Number of connectives :  297 ( 114   ~;  97   |;  74   &)
%                                         (   8 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   10 (   8 usr;   2 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   1 con; 0-1 aty)
%            Number of variables   :  114 (   0 sgn  81   !;  33   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f16,axiom,
    ! [X0] :
      ( cUnsatisfiable(X0)
    <=> ( ? [X1] :
            ( rr(X0,X1)
            & ? [X2] :
                ( rinvR(X1,X2)
                & ! [X3] :
                    ( rs(X2,X3)
                   => cp(X3) ) )
            & ! [X4,X5] :
                ( ( rinvR(X1,X4)
                  & rinvR(X1,X5) )
               => X4 = X5 ) )
        & ? [X1] :
            ( rs(X0,X1)
            & ~ cq(X1)
            & ~ cp(X1) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).

fof(f17,axiom,
    ! [X0,X1] :
      ( rinvR(X0,X1)
    <=> rr(X1,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).

fof(f18,axiom,
    cUnsatisfiable(i2003_11_14_17_19_13721),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).

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

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

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

fof(f48,definition,
    ! [X0] :
      ( sP0(X0)
    <=> ( ? [X1] :
            ( rr(X0,X1)
            & ? [X2] :
                ( rinvR(X1,X2)
                & ! [X3] :
                    ( cp(X3)
                    | ~ rs(X2,X3) ) )
            & ! [X4,X5] :
                ( X4 = X5
                | ~ rinvR(X1,X4)
                | ~ rinvR(X1,X5) ) )
        & ? [X6] :
            ( rs(X0,X6)
            & ~ cq(X6)
            & ~ cp(X6) ) ) ),
    introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).

fof(f49,plain,
    ! [X0] :
      ( cUnsatisfiable(X0)
    <=> sP0(X0) ),
    inference(definition_folding,[],[f47,f48]) ).

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

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

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

fof(f54,plain,
    ! [X0] :
      ( ( sP0(X0)
        | ! [X1] :
            ( ~ rr(X0,X1)
            | ! [X2] :
                ( ~ rinvR(X1,X2)
                | ( ~ cp(sK1(X2))
                  & rs(X2,sK1(X2)) ) )
            | ( sK2(X1) != sK3(X1)
              & rinvR(X1,sK2(X1))
              & rinvR(X1,sK3(X1)) ) )
        | ! [X6] :
            ( ~ rs(X0,X6)
            | cq(X6)
            | cp(X6) ) )
      & ( ( rr(X0,sK4(X0))
          & rinvR(sK4(X0),sK5(X0))
          & ! [X9] :
              ( cp(X9)
              | ~ rs(sK5(X0),X9) )
          & ! [X10,X11] :
              ( X10 = X11
              | ~ rinvR(sK4(X0),X10)
              | ~ rinvR(sK4(X0),X11) )
          & rs(X0,sK6(X0))
          & ~ cq(sK6(X0))
          & ~ cp(sK6(X0)) )
        | ~ sP0(X0) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4,sK5,sK6]),skolemize(X3,sK1(X2)),skolemize(X4,sK2(X1)),skolemize(X5,sK3(X1)),skolemize(X7,sK4(X0)),skolemize(X8,sK5(X0)),skolemize(X12,sK6(X0))],[f53]) ).

fof(f55,plain,
    ! [X0] :
      ( ( cUnsatisfiable(X0)
        | ~ sP0(X0) )
      & ( sP0(X0)
        | ~ cUnsatisfiable(X0) ) ),
    inference(nnf_transformation,[],[f49]) ).

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

fof(f74,plain,
    ! [X0] :
      ( ~ cp(sK6(X0))
      | ~ sP0(X0) ),
    inference(cnf_transformation,[],[f54]) ).

fof(f76,plain,
    ! [X0] :
      ( rs(X0,sK6(X0))
      | ~ sP0(X0) ),
    inference(cnf_transformation,[],[f54]) ).

fof(f77,plain,
    ! [X10,X0,X11] :
      ( ~ sP0(X0)
      | ~ rinvR(sK4(X0),X10)
      | ~ rinvR(sK4(X0),X11)
      | X10 = X11 ),
    inference(cnf_transformation,[],[f54]) ).

fof(f78,plain,
    ! [X0,X9] :
      ( ~ sP0(X0)
      | ~ rs(sK5(X0),X9)
      | cp(X9) ),
    inference(cnf_transformation,[],[f54]) ).

fof(f79,plain,
    ! [X0] :
      ( rinvR(sK4(X0),sK5(X0))
      | ~ sP0(X0) ),
    inference(cnf_transformation,[],[f54]) ).

fof(f80,plain,
    ! [X0] :
      ( rr(X0,sK4(X0))
      | ~ sP0(X0) ),
    inference(cnf_transformation,[],[f54]) ).

fof(f87,plain,
    ! [X0] :
      ( sP0(X0)
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f55]) ).

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

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

fof(f105,plain,
    ! [X0,X1] :
      ( cp(X1)
      | ~ rs(sK5(X0),X1)
      | ~ cUnsatisfiable(X0) ),
    inference(resolution,[],[f78,f87]) ).

fof(f106,plain,
    ! [X2,X0,X1] :
      ( ~ cUnsatisfiable(X0)
      | ~ rinvR(sK4(X0),X2)
      | X1 = X2
      | ~ rinvR(sK4(X0),X1) ),
    inference(resolution,[],[f77,f87]) ).

fof(f107,plain,
    ! [X0,X1] :
      ( ~ rs(sK5(X0),sK6(X1))
      | ~ cUnsatisfiable(X0)
      | ~ sP0(X1) ),
    inference(resolution,[],[f105,f74]) ).

fof(f108,plain,
    ! [X0] :
      ( ~ cUnsatisfiable(X0)
      | ~ sP0(sK5(X0))
      | ~ sP0(sK5(X0)) ),
    inference(resolution,[],[f107,f76]) ).

fof(f109,plain,
    ! [X0] :
      ( ~ sP0(sK5(X0))
      | ~ cUnsatisfiable(X0) ),
    inference(duplicate_literal_removal,[],[f108]) ).

fof(f112,plain,
    ! [X0,X1] :
      ( ~ rinvR(sK4(i2003_11_14_17_19_13721),X0)
      | X0 = X1
      | ~ rinvR(sK4(i2003_11_14_17_19_13721),X1) ),
    inference(resolution,[],[f106,f91]) ).

fof(f115,plain,
    ! [X0,X1] :
      ( ~ rr(X0,sK4(i2003_11_14_17_19_13721))
      | ~ rinvR(sK4(i2003_11_14_17_19_13721),X1)
      | X0 = X1 ),
    inference(resolution,[],[f112,f90]) ).

fof(f134,definition,
    ( spl7_5
  <=> sP0(i2003_11_14_17_19_13721) ),
    introduced(definition,[new_symbols(definition,[spl7_5])],[avatar_definition]) ).

fof(f135,plain,
    ( sP0(i2003_11_14_17_19_13721)
    | ~ spl7_5 ),
    inference(avatar_component_clause,[],[f134]) ).

fof(f136,plain,
    ( ~ sP0(i2003_11_14_17_19_13721)
    | spl7_5 ),
    inference(avatar_component_clause,[],[f134]) ).

fof(f141,plain,
    ( ~ cUnsatisfiable(i2003_11_14_17_19_13721)
    | spl7_5 ),
    inference(resolution,[],[f136,f87]) ).

fof(f142,plain,
    ( $false
    | spl7_5 ),
    inference(forward_subsumption_resolution,[],[f141,f91]) ).

fof(f143,plain,
    spl7_5,
    inference(avatar_contradiction_clause,[],[f142]) ).

fof(f163,plain,
    ! [X0] :
      ( ~ rinvR(sK4(i2003_11_14_17_19_13721),X0)
      | i2003_11_14_17_19_13721 = X0
      | ~ sP0(i2003_11_14_17_19_13721) ),
    inference(resolution,[],[f115,f80]) ).

fof(f165,plain,
    ( ! [X0] :
        ( ~ rinvR(sK4(i2003_11_14_17_19_13721),X0)
        | i2003_11_14_17_19_13721 = X0 )
    | ~ spl7_5 ),
    inference(forward_subsumption_resolution,[],[f163,f135]) ).

fof(f170,plain,
    ( i2003_11_14_17_19_13721 = sK5(i2003_11_14_17_19_13721)
    | ~ sP0(i2003_11_14_17_19_13721)
    | ~ spl7_5 ),
    inference(resolution,[],[f165,f79]) ).

fof(f174,plain,
    ( i2003_11_14_17_19_13721 = sK5(i2003_11_14_17_19_13721)
    | ~ spl7_5 ),
    inference(forward_subsumption_resolution,[],[f170,f135]) ).

fof(f179,plain,
    ( ~ sP0(i2003_11_14_17_19_13721)
    | ~ cUnsatisfiable(i2003_11_14_17_19_13721)
    | ~ spl7_5 ),
    inference(superposition,[],[f109,f174]) ).

fof(f185,plain,
    ( ~ cUnsatisfiable(i2003_11_14_17_19_13721)
    | ~ spl7_5 ),
    inference(forward_subsumption_resolution,[],[f179,f87]) ).

fof(f192,plain,
    ( $false
    | ~ spl7_5 ),
    inference(forward_subsumption_resolution,[],[f185,f91]) ).

fof(f193,plain,
    ~ spl7_5,
    inference(avatar_contradiction_clause,[],[f192]) ).

cnf(s4,plain,
    spl7_5,
    inference(sat_conversion,[],[f143]) ).

cnf(s10,plain,
    ~ spl7_5,
    inference(sat_conversion,[],[f193]) ).

cnf(s11,plain,
    $false,
    inference(rat,[],[s4,s10]) ).

fof(f194,plain,
    $false,
    inference(avatar_sat_refutation,[],[s11]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : KRS078+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.39  % Computer : n015.cluster.edu
% 0.13/0.39  % Model    : x86_64 x86_64
% 0.13/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39  % Memory   : 8046.5625MB
% 0.13/0.39  % OS       : Linux 6.8.0-71-generic
% 0.13/0.39  % CPULimit : 300
% 0.13/0.39  % WCLimit  : 300
% 0.13/0.39  % DateTime : Sun Sep 27 13:25:01 UTC 2026
% 0.13/0.39  % CPUTime  : 
% 0.13/0.39  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.43  Running first-order theorem proving
% 0.13/0.43  Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.32/1.32  % (1675220)Detected formulas, will run a generic FOF schedule.
% 2.32/1.32  % (1675229)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=802592420:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.32/1.32  % (1675229)Refutation not found, incomplete strategy
% 2.32/1.32  % (1675229)------------------------------
% 2.32/1.32  % (1675229)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.32/1.32  % (1675229)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.32/1.32  % (1675229)CaDiCaL version: 2.1.3
% 2.32/1.32  % (1675229)Termination reason: Refutation not found, incomplete strategy
% 2.32/1.32  % (1675229)Time elapsed: 0.0000 s
% 2.32/1.32  % (1675229)Peak memory usage: 86 MB
% 2.32/1.32  % (1675225)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=15114040:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.32/1.32  % (1675227)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=1539584040:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.32/1.32  % (1675228)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=4032250459:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.32/1.32  % (1675226)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=1871869931:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.32/1.32  % (1675228)Refutation not found, incomplete strategy
% 2.32/1.32  % (1675228)------------------------------
% 2.32/1.32  % (1675228)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.32/1.32  % (1675228)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.32/1.32  % (1675228)CaDiCaL version: 2.1.3
% 2.32/1.32  % (1675228)Termination reason: Refutation not found, incomplete strategy
% 2.32/1.32  % (1675228)Time elapsed: 0.0000 s
% 2.32/1.32  % (1675228)Peak memory usage: 86 MB
% 2.32/1.32  % (1675230)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1811630749:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.32/1.32  % (1675231)dis-21_1_sil=8000:lcm=predicate:random_seed=1852883772:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 2.32/1.32  % (1675230)First to succeed.
% 2.32/1.32  % (1675230)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1675220"
% 2.32/1.32  % (1675231)Instruction limit reached! 
% 2.32/1.32  % (1675231)------------------------------
% 2.32/1.32  % (1675231)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.32/1.32  % (1675231)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.32/1.32  % (1675231)CaDiCaL version: 2.1.3
% 2.32/1.32  % (1675231)Termination reason: Instruction limit
% 2.32/1.32  % (1675231)Termination phase: Saturation
% 2.32/1.32  % (1675231)Time elapsed: 0.063 s
% 2.32/1.32  % (1675231)Peak memory usage: 88 MB
% 2.32/1.32  % (1675231)Instructions burned: 130 (million)
% 2.32/1.32  % (1675229)------------------------------
% 2.32/1.32  % (1675229)------------------------------
% 2.32/1.32  % (1675239)lrs+10_1_sil=8000:sp=occurrence:random_seed=622136718:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.32/1.32  % (1675239)Refutation not found, incomplete strategy
% 2.32/1.32  % (1675239)------------------------------
% 2.32/1.32  % (1675239)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.32/1.32  % (1675239)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.32/1.32  % (1675239)CaDiCaL version: 2.1.3
% 2.32/1.32  % (1675239)Termination reason: Refutation not found, incomplete strategy
% 2.32/1.32  % (1675239)Time elapsed: 0.001 s
% 2.32/1.32  % (1675239)Peak memory usage: 86 MB
% 2.32/1.32  % (1675240)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1447081282:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.32/1.32  % (1675240)Refutation not found, incomplete strategy
% 2.32/1.32  % (1675240)------------------------------
% 2.32/1.32  % (1675240)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.32/1.32  % (1675240)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.32/1.32  % (1675240)CaDiCaL version: 2.1.3
% 3.67/1.49  % (1675240)Termination reason: Refutation not found, incomplete strategy
% 3.67/1.49  % (1675240)Time elapsed: 0.0000 s
% 3.67/1.49  % (1675240)Peak memory usage: 87 MB
% 3.67/1.49  % (1675228)------------------------------
% 3.67/1.49  % (1675228)------------------------------
% 3.67/1.49  % (1675230)Refutation found. Thanks to Tanya!
% 3.67/1.49  % SZS status Unsatisfiable for theBenchmark
% 3.67/1.49  % SZS output start Proof for theBenchmark
% See solution above
% 3.67/1.49  % (1675230)------------------------------
% 3.67/1.49  % (1675230)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.67/1.49  % (1675230)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.67/1.49  % (1675230)CaDiCaL version: 2.1.3
% 3.67/1.49  % (1675230)Termination reason: Refutation
% 3.67/1.49  % (1675230)Time elapsed: 0.006 s
% 3.67/1.49  % (1675230)Peak memory usage: 90 MB
% 3.67/1.49  % (1675230)Instructions burned: 5 (million)
% 3.67/1.49  % (1675230)------------------------------
% 3.67/1.49  % (1675230)------------------------------
% 3.67/1.49  % (1675220)Success in time 0.447 s
% 3.67/1.49  % Vampire exiting
%------------------------------------------------------------------------------