↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n009.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 12:48:26 PM UTC 2026

% Result   : Theorem 6.10s 1.82s
% Output   : Refutation 6.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   19
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   51 (  18 unt;   2 def)
%            Number of atoms       :  193 (  10 equ)
%            Maximal formula atoms :    9 (   3 avg)
%            Number of connectives :  247 ( 105   ~;  86   |;  34   &)
%                                         (   5 <=>;  17  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   11 (   9 usr;   3 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :   64 (   0 sgn  57   !;   7   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f51,axiom,
    ! [X0] :
      ( ( ~ empty_carrier(X0)
        & topological_space(X0)
        & top_str(X0) )
     => ! [X1] :
          ( element(X1,the_carrier(X0))
         => ! [X2] :
              ( element(X2,powerset(the_carrier(X0)))
             => ( point_neighbourhood(X2,X0,X1)
              <=> in(X1,interior(X0,X2)) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_connsp_2) ).

fof(f201,axiom,
    ! [X0] :
    ? [X1] : element(X1,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',existence_m1_subset_1) ).

fof(f528,axiom,
    ! [X0] :
      ( ( topological_space(X0)
        & top_str(X0) )
     => ! [X1] :
          ( top_str(X1)
         => ! [X2] :
              ( element(X2,powerset(the_carrier(X0)))
             => ! [X3] :
                  ( element(X3,powerset(the_carrier(X1)))
                 => ( ( open_subset(X3,X1)
                     => interior(X1,X3) = X3 )
                    & ( interior(X0,X2) = X2
                     => open_subset(X2,X0) ) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t55_tops_1) ).

fof(f531,conjecture,
    ! [X0] :
      ( ( ~ empty_carrier(X0)
        & topological_space(X0)
        & top_str(X0) )
     => ! [X1] :
          ( element(X1,powerset(the_carrier(X0)))
         => ! [X2] :
              ( element(X2,the_carrier(X0))
             => ( ( open_subset(X1,X0)
                  & in(X2,X1) )
               => point_neighbourhood(X1,X0,X2) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_connsp_2) ).

fof(f532,negated_conjecture,
    ~ ! [X0] :
        ( ( ~ empty_carrier(X0)
          & topological_space(X0)
          & top_str(X0) )
       => ! [X1] :
            ( element(X1,powerset(the_carrier(X0)))
           => ! [X2] :
                ( element(X2,the_carrier(X0))
               => ( ( open_subset(X1,X0)
                    & in(X2,X1) )
                 => point_neighbourhood(X1,X0,X2) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f531]) ).

fof(f688,plain,
    ! [X0] :
      ( ! [X1] :
          ( ! [X2] :
              ( ( point_neighbourhood(X2,X0,X1)
              <=> in(X1,interior(X0,X2)) )
              | ~ element(X2,powerset(the_carrier(X0))) )
          | ~ element(X1,the_carrier(X0)) )
      | empty_carrier(X0)
      | ~ topological_space(X0)
      | ~ top_str(X0) ),
    inference(ennf_transformation,[],[f51]) ).

fof(f689,plain,
    ! [X0] :
      ( ! [X1] :
          ( ! [X2] :
              ( ( point_neighbourhood(X2,X0,X1)
              <=> in(X1,interior(X0,X2)) )
              | ~ element(X2,powerset(the_carrier(X0))) )
          | ~ element(X1,the_carrier(X0)) )
      | empty_carrier(X0)
      | ~ topological_space(X0)
      | ~ top_str(X0) ),
    inference(flattening,[],[f688]) ).

fof(f1204,plain,
    ! [X0] :
      ( ! [X1] :
          ( ! [X2] :
              ( ! [X3] :
                  ( ( ( interior(X1,X3) = X3
                      | ~ open_subset(X3,X1) )
                    & ( open_subset(X2,X0)
                      | interior(X0,X2) != X2 ) )
                  | ~ element(X3,powerset(the_carrier(X1))) )
              | ~ element(X2,powerset(the_carrier(X0))) )
          | ~ top_str(X1) )
      | ~ topological_space(X0)
      | ~ top_str(X0) ),
    inference(ennf_transformation,[],[f528]) ).

fof(f1205,plain,
    ! [X0] :
      ( ! [X1] :
          ( ! [X2] :
              ( ! [X3] :
                  ( ( ( interior(X1,X3) = X3
                      | ~ open_subset(X3,X1) )
                    & ( open_subset(X2,X0)
                      | interior(X0,X2) != X2 ) )
                  | ~ element(X3,powerset(the_carrier(X1))) )
              | ~ element(X2,powerset(the_carrier(X0))) )
          | ~ top_str(X1) )
      | ~ topological_space(X0)
      | ~ top_str(X0) ),
    inference(flattening,[],[f1204]) ).

fof(f1210,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ~ point_neighbourhood(X1,X0,X2)
              & open_subset(X1,X0)
              & in(X2,X1)
              & element(X2,the_carrier(X0)) )
          & element(X1,powerset(the_carrier(X0))) )
      & ~ empty_carrier(X0)
      & topological_space(X0)
      & top_str(X0) ),
    inference(ennf_transformation,[],[f532]) ).

fof(f1211,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ~ point_neighbourhood(X1,X0,X2)
              & open_subset(X1,X0)
              & in(X2,X1)
              & element(X2,the_carrier(X0)) )
          & element(X1,powerset(the_carrier(X0))) )
      & ~ empty_carrier(X0)
      & topological_space(X0)
      & top_str(X0) ),
    inference(flattening,[],[f1210]) ).

fof(f1379,plain,
    ! [X0] :
      ( ! [X1] :
          ( ! [X2] :
              ( ( ( point_neighbourhood(X2,X0,X1)
                  | ~ in(X1,interior(X0,X2)) )
                & ( in(X1,interior(X0,X2))
                  | ~ point_neighbourhood(X2,X0,X1) ) )
              | ~ element(X2,powerset(the_carrier(X0))) )
          | ~ element(X1,the_carrier(X0)) )
      | empty_carrier(X0)
      | ~ topological_space(X0)
      | ~ top_str(X0) ),
    inference(nnf_transformation,[],[f689]) ).

fof(f1561,plain,
    ! [X0] : element(sK167(X0),X0),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK167]),skolemize(X1,sK167(X0))],[f201]) ).

fof(f1939,plain,
    ( ~ point_neighbourhood(sK479,sK478,sK480)
    & open_subset(sK479,sK478)
    & in(sK480,sK479)
    & element(sK480,the_carrier(sK478))
    & element(sK479,powerset(the_carrier(sK478)))
    & ~ empty_carrier(sK478)
    & topological_space(sK478)
    & top_str(sK478) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK478,sK479,sK480]),skolemize(X0,sK478),skolemize(X1,sK479),skolemize(X2,sK480)],[f1211]) ).

fof(f2085,plain,
    ! [X2,X0,X1] :
      ( ~ topological_space(X0)
      | ~ in(X1,interior(X0,X2))
      | ~ element(X2,powerset(the_carrier(X0)))
      | ~ element(X1,the_carrier(X0))
      | empty_carrier(X0)
      | point_neighbourhood(X2,X0,X1)
      | ~ top_str(X0) ),
    inference(cnf_transformation,[],[f1379]) ).

fof(f2447,plain,
    ! [X0] : element(sK167(X0),X0),
    inference(cnf_transformation,[],[f1561]) ).

fof(f3480,plain,
    ! [X2,X3,X0,X1] :
      ( interior(X1,X3) = X3
      | ~ open_subset(X3,X1)
      | ~ element(X3,powerset(the_carrier(X1)))
      | ~ element(X2,powerset(the_carrier(X0)))
      | ~ top_str(X1)
      | ~ topological_space(X0)
      | ~ top_str(X0) ),
    inference(cnf_transformation,[],[f1205]) ).

fof(f3484,plain,
    top_str(sK478),
    inference(cnf_transformation,[],[f1939]) ).

fof(f3485,plain,
    topological_space(sK478),
    inference(cnf_transformation,[],[f1939]) ).

fof(f3486,plain,
    ~ empty_carrier(sK478),
    inference(cnf_transformation,[],[f1939]) ).

fof(f3487,plain,
    element(sK479,powerset(the_carrier(sK478))),
    inference(cnf_transformation,[],[f1939]) ).

fof(f3488,plain,
    element(sK480,the_carrier(sK478)),
    inference(cnf_transformation,[],[f1939]) ).

fof(f3489,plain,
    in(sK480,sK479),
    inference(cnf_transformation,[],[f1939]) ).

fof(f3490,plain,
    open_subset(sK479,sK478),
    inference(cnf_transformation,[],[f1939]) ).

fof(f3491,plain,
    ~ point_neighbourhood(sK479,sK478,sK480),
    inference(cnf_transformation,[],[f1939]) ).

fof(f3843,definition,
    ( spl485_3
  <=> ! [X2,X0] :
        ( ~ element(X2,powerset(the_carrier(X0)))
        | ~ top_str(X0)
        | ~ topological_space(X0) ) ),
    introduced(definition,[new_symbols(definition,[spl485_3])],[avatar_definition]) ).

fof(f3844,plain,
    ( ! [X2,X0] :
        ( ~ topological_space(X0)
        | ~ top_str(X0)
        | ~ element(X2,powerset(the_carrier(X0))) )
    | ~ spl485_3 ),
    inference(avatar_component_clause,[],[f3843]) ).

fof(f3846,definition,
    ( spl485_4
  <=> ! [X1,X3] :
        ( interior(X1,X3) = X3
        | ~ top_str(X1)
        | ~ element(X3,powerset(the_carrier(X1)))
        | ~ open_subset(X3,X1) ) ),
    introduced(definition,[new_symbols(definition,[spl485_4])],[avatar_definition]) ).

fof(f3847,plain,
    ( ! [X3,X1] :
        ( ~ top_str(X1)
        | interior(X1,X3) = X3
        | ~ element(X3,powerset(the_carrier(X1)))
        | ~ open_subset(X3,X1) )
    | ~ spl485_4 ),
    inference(avatar_component_clause,[],[f3846]) ).

fof(f3848,plain,
    ( spl485_3
    | spl485_4 ),
    inference(avatar_split_clause,[],[f3480,f3846,f3843]) ).

fof(f4100,plain,
    ( ! [X0] :
        ( ~ top_str(sK478)
        | ~ element(X0,powerset(the_carrier(sK478))) )
    | ~ spl485_3 ),
    inference(resolution,[],[f3844,f3485]) ).

fof(f4101,plain,
    ( ! [X0] : ~ element(X0,powerset(the_carrier(sK478)))
    | ~ spl485_3 ),
    inference(forward_subsumption_resolution,[],[f4100,f3484]) ).

fof(f4105,plain,
    ( $false
    | ~ spl485_3 ),
    inference(resolution,[],[f4101,f2447]) ).

fof(f4108,plain,
    ~ spl485_3,
    inference(avatar_contradiction_clause,[],[f4105]) ).

fof(f4185,plain,
    ( ! [X0] :
        ( interior(sK478,X0) = X0
        | ~ element(X0,powerset(the_carrier(sK478)))
        | ~ open_subset(X0,sK478) )
    | ~ spl485_4 ),
    inference(resolution,[],[f3847,f3484]) ).

fof(f4388,plain,
    ! [X0,X1] :
      ( ~ in(X0,interior(sK478,X1))
      | ~ element(X1,powerset(the_carrier(sK478)))
      | ~ element(X0,the_carrier(sK478))
      | empty_carrier(sK478)
      | point_neighbourhood(X1,sK478,X0)
      | ~ top_str(sK478) ),
    inference(resolution,[],[f2085,f3485]) ).

fof(f4389,plain,
    ! [X0,X1] :
      ( ~ in(X0,interior(sK478,X1))
      | ~ element(X1,powerset(the_carrier(sK478)))
      | ~ element(X0,the_carrier(sK478))
      | point_neighbourhood(X1,sK478,X0)
      | ~ top_str(sK478) ),
    inference(forward_subsumption_resolution,[],[f4388,f3486]) ).

fof(f4390,plain,
    ! [X0,X1] :
      ( point_neighbourhood(X1,sK478,X0)
      | ~ element(X1,powerset(the_carrier(sK478)))
      | ~ element(X0,the_carrier(sK478))
      | ~ in(X0,interior(sK478,X1)) ),
    inference(forward_subsumption_resolution,[],[f4389,f3484]) ).

fof(f4647,plain,
    ( ~ element(sK479,powerset(the_carrier(sK478)))
    | ~ element(sK480,the_carrier(sK478))
    | ~ in(sK480,interior(sK478,sK479)) ),
    inference(resolution,[],[f4390,f3491]) ).

fof(f4652,plain,
    ( ~ element(sK480,the_carrier(sK478))
    | ~ in(sK480,interior(sK478,sK479)) ),
    inference(forward_subsumption_resolution,[],[f4647,f3487]) ).

fof(f4653,plain,
    ~ in(sK480,interior(sK478,sK479)),
    inference(forward_subsumption_resolution,[],[f4652,f3488]) ).

fof(f4655,plain,
    ( ~ in(sK480,sK479)
    | ~ element(sK479,powerset(the_carrier(sK478)))
    | ~ open_subset(sK479,sK478)
    | ~ spl485_4 ),
    inference(superposition,[],[f4653,f4185]) ).

fof(f4656,plain,
    ( ~ element(sK479,powerset(the_carrier(sK478)))
    | ~ open_subset(sK479,sK478)
    | ~ spl485_4 ),
    inference(forward_subsumption_resolution,[],[f4655,f3489]) ).

fof(f4657,plain,
    ( ~ open_subset(sK479,sK478)
    | ~ spl485_4 ),
    inference(forward_subsumption_resolution,[],[f4656,f3487]) ).

fof(f4658,plain,
    ( $false
    | ~ spl485_4 ),
    inference(forward_subsumption_resolution,[],[f4657,f3490]) ).

fof(f4659,plain,
    ~ spl485_4,
    inference(avatar_contradiction_clause,[],[f4658]) ).

cnf(s2,plain,
    ( spl485_3
    | spl485_4 ),
    inference(sat_conversion,[],[f3848]) ).

cnf(s50,plain,
    ~ spl485_3,
    inference(sat_conversion,[],[f4108]) ).

cnf(s66,plain,
    ~ spl485_4,
    inference(sat_conversion,[],[f4659]) ).

cnf(s69,plain,
    $false,
    inference(rat,[],[s2,s66,s50]) ).

fof(f4660,plain,
    $false,
    inference(avatar_sat_refutation,[],[s69]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SEU341+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.08  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.43  % Computer : n009.cluster.edu
% 0.16/0.43  % Model    : x86_64 x86_64
% 0.16/0.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.43  % Memory   : 8046.5625MB
% 0.16/0.43  % OS       : Linux 6.8.0-71-generic
% 0.16/0.43  % CPULimit : 300
% 0.16/0.43  % WCLimit  : 300
% 0.16/0.43  % DateTime : Mon Sep 28 04:48:45 UTC 2026
% 0.16/0.43  % CPUTime  : 
% 0.16/0.43  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/0.48  Running first-order theorem proving
% 0.21/0.48  Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.31/1.63  % (2666925)Detected formulas, will run a generic FOF schedule.
% 5.31/1.63  % (2666936)dis-21_1_sil=8000:lcm=predicate:random_seed=4097589646: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)
% 5.31/1.63  % (2666935)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1746686561:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 5.31/1.63  % (2666931)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=3194684298:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 5.31/1.63  % (2666932)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=47187396:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 5.31/1.63  % (2666934)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2361594301:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 5.31/1.63  % (2666930)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=73258417:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 5.31/1.63  % (2666933)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2419907233:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 5.31/1.63  % (2666936)Instruction limit reached! 
% 5.31/1.63  % (2666936)------------------------------
% 5.31/1.63  % (2666936)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.31/1.63  % (2666936)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.31/1.63  % (2666936)CaDiCaL version: 2.1.3
% 5.31/1.63  % (2666936)Termination reason: Instruction limit
% 5.31/1.63  % (2666936)Termination phase: Saturation
% 5.31/1.63  % (2666936)Time elapsed: 0.059 s
% 5.31/1.63  % (2666936)Peak memory usage: 91 MB
% 5.31/1.63  % (2666936)Instructions burned: 130 (million)
% 5.31/1.63  % (2666933)Instruction limit reached! 
% 5.31/1.63  % (2666933)------------------------------
% 5.31/1.63  % (2666933)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.31/1.63  % (2666933)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.31/1.63  % (2666933)CaDiCaL version: 2.1.3
% 5.31/1.63  % (2666933)Termination reason: Instruction limit
% 5.31/1.63  % (2666933)Termination phase: Saturation
% 5.31/1.63  % (2666933)Time elapsed: 0.100 s
% 5.31/1.63  % (2666933)Peak memory usage: 91 MB
% 5.31/1.63  % (2666933)Instructions burned: 109 (million)
% 5.31/1.63  % (2666935)First to succeed.
% 5.31/1.63  % (2666935)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2666925"
% 5.31/1.63  % (2666934)Instruction limit reached! 
% 5.31/1.63  % (2666934)------------------------------
% 5.31/1.63  % (2666934)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.31/1.63  % (2666934)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.31/1.63  % (2666934)CaDiCaL version: 2.1.3
% 5.31/1.63  % (2666934)Termination reason: Instruction limit
% 5.31/1.63  % (2666934)Termination phase: Saturation
% 5.31/1.63  % (2666934)Time elapsed: 0.122 s
% 5.31/1.63  % (2666934)Peak memory usage: 91 MB
% 5.31/1.63  % (2666934)Instructions burned: 120 (million)
% 5.31/1.63  % (2666944)lrs+10_1_sil=8000:sp=occurrence:random_seed=926618882:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 5.31/1.63  % (2666946)lrs+1011_1_sil=32000:sp=occurrence:random_seed=486738937:i=325:sd=1:ss=axioms:sgt=32_2995 on theBenchmark for (2995ds/325Mi)
% 5.31/1.63  % (2666945)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3489446677:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2996 on theBenchmark for (2996ds/157Mi)
% 5.31/1.63  % (2666944)Instruction limit reached! 
% 5.31/1.63  % (2666944)------------------------------
% 5.31/1.63  % (2666944)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.31/1.63  % (2666944)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.31/1.63  % (2666944)CaDiCaL version: 2.1.3
% 5.31/1.63  % (2666944)Termination reason: Instruction limit
% 5.31/1.63  % (2666944)Termination phase: Saturation
% 5.31/1.63  % (2666944)Time elapsed: 0.163 s
% 5.31/1.63  % (2666944)Peak memory usage: 95 MB
% 5.31/1.63  % (2666944)Instructions burned: 286 (million)
% 5.31/1.63  % (2666945)Instruction limit reached! 
% 5.31/1.63  % (2666945)------------------------------
% 5.31/1.63  % (2666945)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.10/1.82  % (2666945)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.10/1.82  % (2666945)CaDiCaL version: 2.1.3
% 6.10/1.82  % (2666945)Termination reason: Instruction limit
% 6.10/1.82  % (2666945)Termination phase: Saturation
% 6.10/1.82  % (2666945)Time elapsed: 0.149 s
% 6.10/1.82  % (2666945)Peak memory usage: 89 MB
% 6.10/1.82  % (2666945)Instructions burned: 157 (million)
% 6.10/1.82  % (2666935)Refutation found. Thanks to Tanya!
% 6.10/1.82  % SZS status Theorem for theBenchmark
% 6.10/1.82  % SZS output start Proof for theBenchmark
% See solution above
% 6.10/1.82  % (2666935)------------------------------
% 6.10/1.82  % (2666935)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.10/1.82  % (2666935)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.10/1.82  % (2666935)CaDiCaL version: 2.1.3
% 6.10/1.82  % (2666935)Termination reason: Refutation
% 6.10/1.82  % (2666935)Time elapsed: 0.110 s
% 6.10/1.82  % (2666935)Peak memory usage: 92 MB
% 6.10/1.82  % (2666935)Instructions burned: 111 (million)
% 6.10/1.82  % (2666935)------------------------------
% 6.10/1.82  % (2666935)------------------------------
% 6.10/1.82  % (2666925)Success in time 0.796 s
% 6.10/1.82  % Vampire exiting
%------------------------------------------------------------------------------