↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n013.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:47:55 PM UTC 2026

% Result   : Theorem 5.41s 1.68s
% Output   : Refutation 5.41s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   69 (  23 unt;   0 def)
%            Number of atoms       :  223 (  25 equ)
%            Maximal formula atoms :    8 (   3 avg)
%            Number of connectives :  262 ( 108   ~;  87   |;  45   &)
%                                         (   7 <=>;  15  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :  112 ( 101   !;  11   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f12,axiom,
    ! [X0,X1] :
      ( ( ordinal(X0)
        & ordinal(X1) )
     => ( ordinal_subset(X0,X1)
        | ordinal_subset(X1,X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',connectedness_r1_ordinal1) ).

fof(f14,axiom,
    ! [X0,X1] :
      ( X0 = X1
    <=> ( subset(X0,X1)
        & subset(X1,X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d10_xboole_0) ).

fof(f26,axiom,
    ! [X0] :
      ( X0 = empty_set
    <=> ! [X1] : ~ in(X1,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_xboole_0) ).

fof(f36,axiom,
    ! [X0,X1] :
      ( subset(X0,X1)
    <=> ! [X2] :
          ( in(X2,X0)
         => in(X2,X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).

fof(f152,axiom,
    ! [X0,X1] :
      ( ( ordinal(X0)
        & ordinal(X1) )
     => ( ordinal_subset(X0,X1)
      <=> subset(X0,X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',redefinition_r1_ordinal1) ).

fof(f193,axiom,
    ! [X0,X1] :
      ( ordinal(X1)
     => ( in(X0,X1)
       => ordinal(X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t23_ordinal1) ).

fof(f194,axiom,
    ! [X0] :
      ( ordinal(X0)
     => ! [X1] :
          ( ordinal(X1)
         => ~ ( ~ in(X0,X1)
              & X0 != X1
              & ~ in(X1,X0) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t24_ordinal1) ).

fof(f204,conjecture,
    ! [X0,X1] :
      ( ordinal(X1)
     => ~ ( subset(X0,X1)
          & X0 != empty_set
          & ! [X2] :
              ( ordinal(X2)
             => ~ ( in(X2,X0)
                  & ! [X3] :
                      ( ordinal(X3)
                     => ( in(X3,X0)
                       => ordinal_subset(X2,X3) ) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t32_ordinal1) ).

fof(f205,negated_conjecture,
    ~ ! [X0,X1] :
        ( ordinal(X1)
       => ~ ( subset(X0,X1)
            & X0 != empty_set
            & ! [X2] :
                ( ordinal(X2)
               => ~ ( in(X2,X0)
                    & ! [X3] :
                        ( ordinal(X3)
                       => ( in(X3,X0)
                         => ordinal_subset(X2,X3) ) ) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f204]) ).

fof(f260,axiom,
    ! [X0,X1] :
      ~ ( in(X0,X1)
        & ! [X2] :
            ~ ( in(X2,X1)
              & ! [X3] :
                  ~ ( in(X3,X1)
                    & in(X3,X2) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_tarski) ).

fof(f278,plain,
    ? [X0,X1] :
      ( subset(X0,X1)
      & X0 != empty_set
      & ! [X2] :
          ( ~ in(X2,X0)
          | ? [X3] :
              ( ~ ordinal_subset(X2,X3)
              & in(X3,X0)
              & ordinal(X3) )
          | ~ ordinal(X2) )
      & ordinal(X1) ),
    inference(ennf_transformation,[],[f205]) ).

fof(f279,plain,
    ? [X0,X1] :
      ( subset(X0,X1)
      & X0 != empty_set
      & ! [X2] :
          ( ~ in(X2,X0)
          | ? [X3] :
              ( ~ ordinal_subset(X2,X3)
              & in(X3,X0)
              & ordinal(X3) )
          | ~ ordinal(X2) )
      & ordinal(X1) ),
    inference(flattening,[],[f278]) ).

fof(f280,plain,
    ! [X0,X1] :
      ( ~ in(X0,X1)
      | ? [X2] :
          ( in(X2,X1)
          & ! [X3] :
              ( ~ in(X3,X1)
              | ~ in(X3,X2) ) ) ),
    inference(ennf_transformation,[],[f260]) ).

fof(f285,plain,
    ! [X0] :
      ( ! [X1] :
          ( in(X0,X1)
          | X0 = X1
          | in(X1,X0)
          | ~ ordinal(X1) )
      | ~ ordinal(X0) ),
    inference(ennf_transformation,[],[f194]) ).

fof(f286,plain,
    ! [X0] :
      ( ! [X1] :
          ( in(X0,X1)
          | X0 = X1
          | in(X1,X0)
          | ~ ordinal(X1) )
      | ~ ordinal(X0) ),
    inference(flattening,[],[f285]) ).

fof(f287,plain,
    ! [X0,X1] :
      ( ordinal(X0)
      | ~ in(X0,X1)
      | ~ ordinal(X1) ),
    inference(ennf_transformation,[],[f193]) ).

fof(f288,plain,
    ! [X0,X1] :
      ( ordinal(X0)
      | ~ in(X0,X1)
      | ~ ordinal(X1) ),
    inference(flattening,[],[f287]) ).

fof(f291,plain,
    ! [X0,X1] :
      ( ( ordinal_subset(X0,X1)
      <=> subset(X0,X1) )
      | ~ ordinal(X0)
      | ~ ordinal(X1) ),
    inference(ennf_transformation,[],[f152]) ).

fof(f292,plain,
    ! [X0,X1] :
      ( ( ordinal_subset(X0,X1)
      <=> subset(X0,X1) )
      | ~ ordinal(X0)
      | ~ ordinal(X1) ),
    inference(flattening,[],[f291]) ).

fof(f293,plain,
    ! [X0,X1] :
      ( ordinal_subset(X0,X1)
      | ordinal_subset(X1,X0)
      | ~ ordinal(X0)
      | ~ ordinal(X1) ),
    inference(ennf_transformation,[],[f12]) ).

fof(f294,plain,
    ! [X0,X1] :
      ( ordinal_subset(X0,X1)
      | ordinal_subset(X1,X0)
      | ~ ordinal(X0)
      | ~ ordinal(X1) ),
    inference(flattening,[],[f293]) ).

fof(f297,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
    <=> ! [X2] :
          ( in(X2,X1)
          | ~ in(X2,X0) ) ),
    inference(ennf_transformation,[],[f36]) ).

fof(f300,plain,
    ( subset(sK0,sK1)
    & empty_set != sK0
    & ! [X2] :
        ( ~ in(X2,sK0)
        | ( ~ ordinal_subset(X2,sK2(X2))
          & in(sK2(X2),sK0)
          & ordinal(sK2(X2)) )
        | ~ ordinal(X2) )
    & ordinal(sK1) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X3,sK2(X2))],[f279]) ).

fof(f301,plain,
    ! [X0,X1] :
      ( ~ in(X0,X1)
      | ( in(sK3(X1),X1)
        & ! [X3] :
            ( ~ in(X3,X1)
            | ~ in(X3,sK3(X1)) ) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X2,sK3(X1))],[f280]) ).

fof(f305,plain,
    ! [X0,X1] :
      ( ( ( ordinal_subset(X0,X1)
          | ~ subset(X0,X1) )
        & ( subset(X0,X1)
          | ~ ordinal_subset(X0,X1) ) )
      | ~ ordinal(X0)
      | ~ ordinal(X1) ),
    inference(nnf_transformation,[],[f292]) ).

fof(f306,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ? [X2] :
            ( ~ in(X2,X1)
            & in(X2,X0) ) )
      & ( ! [X2] :
            ( in(X2,X1)
            | ~ in(X2,X0) )
        | ~ subset(X0,X1) ) ),
    inference(nnf_transformation,[],[f297]) ).

fof(f307,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ? [X2] :
            ( ~ in(X2,X1)
            & in(X2,X0) ) )
      & ( ! [X3] :
            ( in(X3,X1)
            | ~ in(X3,X0) )
        | ~ subset(X0,X1) ) ),
    inference(rectify,[],[f306]) ).

fof(f308,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ( ~ in(sK6(X0,X1),X1)
          & in(sK6(X0,X1),X0) ) )
      & ( ! [X3] :
            ( in(X3,X1)
            | ~ in(X3,X0) )
        | ~ subset(X0,X1) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(X2,sK6(X0,X1))],[f307]) ).

fof(f309,plain,
    ! [X0,X1] :
      ( ( X0 = X1
        | ~ subset(X0,X1)
        | ~ subset(X1,X0) )
      & ( ( subset(X0,X1)
          & subset(X1,X0) )
        | X0 != X1 ) ),
    inference(nnf_transformation,[],[f14]) ).

fof(f310,plain,
    ! [X0,X1] :
      ( ( X0 = X1
        | ~ subset(X0,X1)
        | ~ subset(X1,X0) )
      & ( ( subset(X0,X1)
          & subset(X1,X0) )
        | X0 != X1 ) ),
    inference(flattening,[],[f309]) ).

fof(f311,plain,
    ! [X0] :
      ( ( X0 = empty_set
        | ? [X1] : in(X1,X0) )
      & ( ! [X1] : ~ in(X1,X0)
        | empty_set != X0 ) ),
    inference(nnf_transformation,[],[f26]) ).

fof(f312,plain,
    ! [X0] :
      ( ( X0 = empty_set
        | ? [X1] : in(X1,X0) )
      & ( ! [X2] : ~ in(X2,X0)
        | empty_set != X0 ) ),
    inference(rectify,[],[f311]) ).

fof(f313,plain,
    ! [X0] :
      ( ( X0 = empty_set
        | in(sK7(X0),X0) )
      & ( ! [X2] : ~ in(X2,X0)
        | empty_set != X0 ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK7]),skolemize(X1,sK7(X0))],[f312]) ).

fof(f314,plain,
    ordinal(sK1),
    inference(cnf_transformation,[],[f300]) ).

fof(f315,plain,
    ! [X2] :
      ( ~ in(X2,sK0)
      | ordinal(sK2(X2))
      | ~ ordinal(X2) ),
    inference(cnf_transformation,[],[f300]) ).

fof(f316,plain,
    ! [X2] :
      ( in(sK2(X2),sK0)
      | ~ in(X2,sK0)
      | ~ ordinal(X2) ),
    inference(cnf_transformation,[],[f300]) ).

fof(f317,plain,
    ! [X2] :
      ( ~ ordinal_subset(X2,sK2(X2))
      | ~ in(X2,sK0)
      | ~ ordinal(X2) ),
    inference(cnf_transformation,[],[f300]) ).

fof(f318,plain,
    empty_set != sK0,
    inference(cnf_transformation,[],[f300]) ).

fof(f319,plain,
    subset(sK0,sK1),
    inference(cnf_transformation,[],[f300]) ).

fof(f320,plain,
    ! [X3,X0,X1] :
      ( ~ in(X3,sK3(X1))
      | ~ in(X3,X1)
      | ~ in(X0,X1) ),
    inference(cnf_transformation,[],[f301]) ).

fof(f321,plain,
    ! [X0,X1] :
      ( ~ in(X0,X1)
      | in(sK3(X1),X1) ),
    inference(cnf_transformation,[],[f301]) ).

fof(f328,plain,
    ! [X0,X1] :
      ( in(X1,X0)
      | in(X0,X1)
      | X0 = X1
      | ~ ordinal(X1)
      | ~ ordinal(X0) ),
    inference(cnf_transformation,[],[f286]) ).

fof(f329,plain,
    ! [X0,X1] :
      ( ~ in(X0,X1)
      | ordinal(X0)
      | ~ ordinal(X1) ),
    inference(cnf_transformation,[],[f288]) ).

fof(f331,plain,
    ! [X0,X1] :
      ( ~ ordinal_subset(X0,X1)
      | subset(X0,X1)
      | ~ ordinal(X0)
      | ~ ordinal(X1) ),
    inference(cnf_transformation,[],[f305]) ).

fof(f332,plain,
    ! [X0,X1] :
      ( ~ subset(X0,X1)
      | ordinal_subset(X0,X1)
      | ~ ordinal(X0)
      | ~ ordinal(X1) ),
    inference(cnf_transformation,[],[f305]) ).

fof(f333,plain,
    ! [X0,X1] :
      ( ordinal_subset(X1,X0)
      | ordinal_subset(X0,X1)
      | ~ ordinal(X0)
      | ~ ordinal(X1) ),
    inference(cnf_transformation,[],[f294]) ).

fof(f336,plain,
    ! [X3,X0,X1] :
      ( ~ subset(X0,X1)
      | ~ in(X3,X0)
      | in(X3,X1) ),
    inference(cnf_transformation,[],[f308]) ).

fof(f339,plain,
    ! [X0,X1] :
      ( subset(X1,X0)
      | X0 != X1 ),
    inference(cnf_transformation,[],[f310]) ).

fof(f348,plain,
    ! [X0] :
      ( in(sK7(X0),X0)
      | empty_set = X0 ),
    inference(cnf_transformation,[],[f313]) ).

fof(f350,plain,
    ! [X1] : subset(X1,X1),
    inference(equality_resolution,[],[f339]) ).

fof(f368,plain,
    in(sK7(sK0),sK0),
    inference(unit_resulting_resolution,[],[f348,f318]) ).

fof(f372,plain,
    in(sK3(sK0),sK0),
    inference(unit_resulting_resolution,[],[f321,f368]) ).

fof(f397,plain,
    in(sK7(sK0),sK1),
    inference(unit_resulting_resolution,[],[f336,f368,f319]) ).

fof(f398,plain,
    in(sK3(sK0),sK1),
    inference(unit_resulting_resolution,[],[f336,f372,f319]) ).

fof(f410,plain,
    ordinal(sK7(sK0)),
    inference(unit_resulting_resolution,[],[f329,f314,f397]) ).

fof(f421,plain,
    in(sK2(sK7(sK0)),sK0),
    inference(unit_resulting_resolution,[],[f316,f368,f410]) ).

fof(f424,plain,
    ~ in(sK3(sK0),sK3(sK0)),
    inference(unit_resulting_resolution,[],[f320,f368,f372]) ).

fof(f432,plain,
    ordinal(sK3(sK0)),
    inference(unit_resulting_resolution,[],[f329,f314,f398]) ).

fof(f450,plain,
    ordinal(sK2(sK3(sK0))),
    inference(unit_resulting_resolution,[],[f315,f372,f432]) ).

fof(f451,plain,
    in(sK2(sK3(sK0)),sK0),
    inference(unit_resulting_resolution,[],[f316,f372,f432]) ).

fof(f452,plain,
    ~ ordinal_subset(sK3(sK0),sK2(sK3(sK0))),
    inference(unit_resulting_resolution,[],[f317,f372,f432]) ).

fof(f732,plain,
    ~ in(sK2(sK3(sK0)),sK3(sK0)),
    inference(unit_resulting_resolution,[],[f320,f421,f451]) ).

fof(f881,plain,
    ordinal_subset(sK2(sK3(sK0)),sK3(sK0)),
    inference(unit_resulting_resolution,[],[f333,f432,f450,f452]) ).

fof(f883,plain,
    ~ subset(sK3(sK0),sK2(sK3(sK0))),
    inference(unit_resulting_resolution,[],[f332,f432,f450,f452]) ).

fof(f1168,plain,
    subset(sK2(sK3(sK0)),sK3(sK0)),
    inference(unit_resulting_resolution,[],[f331,f432,f450,f881]) ).

fof(f1513,plain,
    ~ in(sK3(sK0),sK2(sK3(sK0))),
    inference(unit_resulting_resolution,[],[f336,f424,f1168]) ).

fof(f1616,plain,
    sK3(sK0) = sK2(sK3(sK0)),
    inference(unit_resulting_resolution,[],[f328,f432,f450,f732,f1513]) ).

fof(f1674,plain,
    ~ subset(sK3(sK0),sK3(sK0)),
    inference(superposition,[],[f883,f1616]) ).

fof(f1692,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f1674,f350]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU235+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37  % Computer : n013.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Mon Sep 28 04:13:52 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41  Running first-order theorem proving
% 0.11/0.41  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
% 4.46/1.56  % (795208)Detected formulas, will run a generic FOF schedule.
% 4.46/1.56  % (795213)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=3153524147:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 4.46/1.56  % (795216)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=238320816:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 4.46/1.56  % (795214)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=2256246774:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 4.46/1.56  % (795217)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=536537726:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 4.46/1.56  % (795215)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=1224161935:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 4.46/1.56  % (795219)dis-21_1_sil=8000:lcm=predicate:random_seed=3112092257: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)
% 4.46/1.56  % (795218)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3422457607:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 4.46/1.56  % (795216)Instruction limit reached! 
% 4.46/1.56  % (795216)------------------------------
% 4.46/1.56  % (795216)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.46/1.56  % (795216)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.46/1.56  % (795216)CaDiCaL version: 2.1.3
% 4.46/1.56  % (795216)Termination reason: Instruction limit
% 4.46/1.56  % (795216)Termination phase: Saturation
% 4.46/1.56  % (795216)Time elapsed: 0.068 s
% 4.46/1.56  % (795216)Peak memory usage: 90 MB
% 4.46/1.56  % (795216)Instructions burned: 110 (million)
% 4.46/1.56  % (795219)Instruction limit reached! 
% 4.46/1.56  % (795219)------------------------------
% 4.46/1.56  % (795219)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.46/1.56  % (795219)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.46/1.56  % (795219)CaDiCaL version: 2.1.3
% 4.46/1.56  % (795219)Termination reason: Instruction limit
% 4.46/1.56  % (795219)Termination phase: Saturation
% 4.46/1.56  % (795219)Time elapsed: 0.077 s
% 4.46/1.56  % (795219)Peak memory usage: 90 MB
% 4.46/1.56  % (795219)Instructions burned: 130 (million)
% 4.46/1.56  % (795217)Instruction limit reached! 
% 4.46/1.56  % (795217)------------------------------
% 4.46/1.56  % (795217)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.46/1.56  % (795217)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.46/1.56  % (795217)CaDiCaL version: 2.1.3
% 4.46/1.56  % (795217)Termination reason: Instruction limit
% 4.46/1.56  % (795217)Termination phase: Saturation
% 4.46/1.56  % (795217)Time elapsed: 0.080 s
% 4.46/1.56  % (795217)Peak memory usage: 89 MB
% 4.46/1.56  % (795217)Instructions burned: 120 (million)
% 4.46/1.56  % (795218)Instruction limit reached! 
% 4.46/1.56  % (795218)------------------------------
% 4.46/1.56  % (795218)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.46/1.56  % (795218)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.46/1.56  % (795218)CaDiCaL version: 2.1.3
% 4.46/1.56  % (795218)Termination reason: Instruction limit
% 4.46/1.56  % (795218)Termination phase: Saturation
% 4.46/1.56  % (795218)Time elapsed: 0.101 s
% 4.46/1.56  % (795218)Peak memory usage: 90 MB
% 4.46/1.56  % (795218)Instructions burned: 139 (million)
% 4.46/1.56  % (795227)lrs+10_1_sil=8000:sp=occurrence:random_seed=112817072:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 4.46/1.56  % (795229)lrs+1011_1_sil=32000:sp=occurrence:random_seed=4040555033:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 4.46/1.56  % (795228)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1151686932:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 4.46/1.56  % (795230)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=620651446:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 4.46/1.56  % (795228)First to succeed.
% 4.46/1.56  % (795228)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-795208"
% 5.41/1.68  % (795230)Instruction limit reached! 
% 5.41/1.68  % (795230)------------------------------
% 5.41/1.68  % (795230)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.41/1.68  % (795230)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.41/1.68  % (795230)CaDiCaL version: 2.1.3
% 5.41/1.68  % (795230)Termination reason: Instruction limit
% 5.41/1.68  % (795230)Termination phase: Saturation
% 5.41/1.68  % (795230)Time elapsed: 0.137 s
% 5.41/1.68  % (795230)Peak memory usage: 91 MB
% 5.41/1.68  % (795230)Instructions burned: 250 (million)
% 5.41/1.68  % (795227)Instruction limit reached! 
% 5.41/1.68  % (795227)------------------------------
% 5.41/1.68  % (795227)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.41/1.68  % (795227)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.41/1.68  % (795227)CaDiCaL version: 2.1.3
% 5.41/1.68  % (795227)Termination reason: Instruction limit
% 5.41/1.68  % (795227)Termination phase: Saturation
% 5.41/1.68  % (795227)Time elapsed: 0.188 s
% 5.41/1.68  % (795227)Peak memory usage: 93 MB
% 5.41/1.68  % (795227)Instructions burned: 285 (million)
% 5.41/1.68  % (795229)Instruction limit reached! 
% 5.41/1.68  % (795229)------------------------------
% 5.41/1.68  % (795229)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.41/1.68  % (795229)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.41/1.68  % (795229)CaDiCaL version: 2.1.3
% 5.41/1.68  % (795229)Termination reason: Instruction limit
% 5.41/1.68  % (795229)Termination phase: Saturation
% 5.41/1.68  % (795229)Time elapsed: 0.218 s
% 5.41/1.68  % (795229)Peak memory usage: 92 MB
% 5.41/1.68  % (795229)Instructions burned: 326 (million)
% 5.41/1.68  % (795228)Refutation found. Thanks to Tanya!
% 5.41/1.68  % SZS status Theorem for theBenchmark
% 5.41/1.68  % SZS output start Proof for theBenchmark
% See solution above
% 5.41/1.68  % (795228)------------------------------
% 5.41/1.68  % (795228)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.41/1.68  % (795228)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.41/1.68  % (795228)CaDiCaL version: 2.1.3
% 5.41/1.68  % (795228)Termination reason: Refutation
% 5.41/1.68  % (795228)Time elapsed: 0.029 s
% 5.41/1.68  % (795228)Peak memory usage: 89 MB
% 5.41/1.68  % (795228)Instructions burned: 45 (million)
% 5.41/1.68  % (795228)------------------------------
% 5.41/1.68  % (795228)------------------------------
% 5.41/1.68  % (795208)Success in time 0.699 s
% 5.41/1.68  % Vampire exiting
%------------------------------------------------------------------------------