↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n008.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 01:45:50 PM UTC 2026

% Result   : Theorem 3.03s 1.11s
% Output   : Refutation 3.74s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   47 (   3 unt;   0 typ;   2 def)
%            Number of atoms       :  274 (  94 equ)
%            Maximal formula atoms :   14 (   5 avg)
%            Number of connectives :  356 ( 129   ~; 110   |; 105   &)
%                                         (  11 <=>;   0  =>;   0  <=;   1 <~>)
%            Maximal formula depth :   14 (   8 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number arithmetic     :  191 (  74 atm;   0 fun;  36 num;  81 var)
%            Number of types       :    4 (   2 usr;   1 ari;   0 dat;   0 cdt)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   17 (  12 usr;   4 prp; 0-2 aty)
%            Number of functors    :   26 (  25 usr;   9 con; 0-1 aty)
%            Number of variables   :  111 (  59   !;  52   ?; 111   :)

% Comments : 
%------------------------------------------------------------------------------
tff(type_def_5,type,
    general: $tType ).

tff(type_def_6,type,
    symbol: $tType ).

tff(func_def_0,type,
    f__integer__: $int > general ).

tff(func_def_1,type,
    f__symbolic__: symbol > general ).

tff(func_def_2,type,
    c__infimum__: general ).

tff(func_def_3,type,
    c__supremum__: general ).

tff(func_def_4,type,
    n_i: $int ).

tff(func_def_7,type,
    sK0: general > $int ).

tff(func_def_8,type,
    sK1: general > $int ).

tff(func_def_9,type,
    sK2: general > $int ).

tff(func_def_10,type,
    sK3: general > symbol ).

tff(func_def_11,type,
    sK4: general > general ).

tff(func_def_12,type,
    sK5: general > general ).

tff(func_def_13,type,
    sK6: general > general ).

tff(func_def_14,type,
    sK7: general > general ).

tff(func_def_15,type,
    sK8: general > general ).

tff(func_def_16,type,
    sK9: general ).

tff(func_def_17,type,
    sK10: $int ).

tff(func_def_18,type,
    sK11: $int ).

tff(func_def_19,type,
    sK12: $int ).

tff(func_def_20,type,
    sK13: general > $int ).

tff(func_def_21,type,
    sK14: general > general ).

tff(func_def_22,type,
    sK15: general > general ).

tff(func_def_23,type,
    sK16: general > general ).

tff(func_def_24,type,
    sK17: general > general ).

tff(func_def_25,type,
    sK18: general > general ).

tff(func_def_26,type,
    sF19: general ).

tff(pred_def_1,type,
    p__is_integer__: general > $o ).

tff(pred_def_2,type,
    p__is_symbolic__: general > $o ).

tff(pred_def_3,type,
    p__less_equal__: ( general * general ) > $o ).

tff(pred_def_4,type,
    p__less__: ( general * general ) > $o ).

tff(pred_def_5,type,
    p__greater_equal__: ( general * general ) > $o ).

tff(pred_def_6,type,
    p__greater__: ( general * general ) > $o ).

tff(pred_def_8,type,
    covered: general > $o ).

tff(pred_def_9,type,
    in_cover: general > $o ).

tff(pred_def_10,type,
    s: ( general * general ) > $o ).

tff(pred_def_11,type,
    covered_p: general > $o ).

tff(f21,axiom,
    ! [X0: general] :
      ( ( in_cover(X0)
        & ? [X2: $int,X1: $int,X3: $int] :
            ( ( X2 = n_i )
            & ( X0 = f__integer__(X3) )
            & $lesseq(X1,X3)
            & $lesseq(X3,X2)
            & ( X1 = 1 ) )
        & $true )
    <=> in_cover(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',formula_5_completed_definition_of_in_cover_1) ).

tff(f24,conjecture,
    ! [X0: general] :
      ( ( ? [X1: $int,X3: $int,X2: $int] :
            ( $lesseq(X1,X3)
            & ( X1 = 1 )
            & ( X2 = n_i )
            & $lesseq(X3,X2)
            & ( X0 = f__integer__(X3) ) )
        & in_cover(X0)
        & $true )
    <=> in_cover(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',formula_8_completed_definition_of_in_cover_1) ).

tff(f25,negated_conjecture,
    ~ ! [X0: general] :
        ( ( ? [X1: $int,X3: $int,X2: $int] :
              ( $lesseq(X1,X3)
              & ( X1 = 1 )
              & ( X2 = n_i )
              & $lesseq(X3,X2)
              & ( X0 = f__integer__(X3) ) )
          & in_cover(X0)
          & $true )
      <=> in_cover(X0) ),
    inference(negated_conjecture,[status(cth)],[f24]) ).

tff(f28,plain,
    ~ ! [X0: general] :
        ( ( ? [X1: $int,X3: $int,X2: $int] :
              ( ~ $less(X3,X1)
              & ( X1 = 1 )
              & ( X2 = n_i )
              & ~ $less(X2,X3)
              & ( X0 = f__integer__(X3) ) )
          & in_cover(X0)
          & $true )
      <=> in_cover(X0) ),
    inference(theory_normalization,[],[f25]) ).

tff(f29,plain,
    ! [X0: general] :
      ( ( in_cover(X0)
        & ? [X2: $int,X1: $int,X3: $int] :
            ( ( X2 = n_i )
            & ( X0 = f__integer__(X3) )
            & ~ $less(X3,X1)
            & ~ $less(X2,X3)
            & ( X1 = 1 ) )
        & $true )
    <=> in_cover(X0) ),
    inference(theory_normalization,[],[f21]) ).

tff(f36,plain,
    ~ ! [X0: general] :
        ( ( ? [X1: $int,X3: $int,X2: $int] :
              ( ~ $less(X2,X1)
              & ( f__integer__(X2) = X0 )
              & ~ $less(X3,X2)
              & ( X1 = 1 )
              & ( n_i = X3 ) )
          & in_cover(X0)
          & $true )
      <=> in_cover(X0) ),
    inference(rectify,[],[f28]) ).

tff(f37,plain,
    ~ ! [X0: general] :
        ( in_cover(X0)
      <=> ( ? [X1: $int,X3: $int,X2: $int] :
              ( ~ $less(X2,X1)
              & ( f__integer__(X2) = X0 )
              & ~ $less(X3,X2)
              & ( X1 = 1 )
              & ( n_i = X3 ) )
          & in_cover(X0) ) ),
    inference(true_and_false_elimination,[],[f36]) ).

tff(f38,plain,
    ! [X0: general] :
      ( ( in_cover(X0)
        & ? [X2: $int,X3: $int,X1: $int] :
            ( ~ $less(X3,X2)
            & ( X0 = f__integer__(X3) )
            & ( n_i = X1 )
            & ~ $less(X1,X3)
            & ( 1 = X2 ) )
        & $true )
    <=> in_cover(X0) ),
    inference(rectify,[],[f29]) ).

tff(f39,plain,
    ! [X0: general] :
      ( in_cover(X0)
    <=> ( ? [X2: $int,X3: $int,X1: $int] :
            ( ~ $less(X3,X2)
            & ( X0 = f__integer__(X3) )
            & ( n_i = X1 )
            & ~ $less(X1,X3)
            & ( 1 = X2 ) )
        & in_cover(X0) ) ),
    inference(true_and_false_elimination,[],[f38]) ).

tff(f59,plain,
    ? [X0: general] :
      ( ( ? [X1: $int,X3: $int,X2: $int] :
            ( ~ $less(X2,X1)
            & ( f__integer__(X2) = X0 )
            & ~ $less(X3,X2)
            & ( X1 = 1 )
            & ( n_i = X3 ) )
        & in_cover(X0) )
    <~> in_cover(X0) ),
    inference(ennf_transformation,[],[f37]) ).

tff(f63,plain,
    ! [X0: general] :
      ( ( in_cover(X0)
        | ! [X2: $int,X3: $int,X1: $int] :
            ( $less(X3,X2)
            | ( f__integer__(X3) != X0 )
            | ( n_i != X1 )
            | $less(X1,X3)
            | ( 1 != X2 ) )
        | ~ in_cover(X0) )
      & ( ( ? [X2: $int,X3: $int,X1: $int] :
              ( ~ $less(X3,X2)
              & ( X0 = f__integer__(X3) )
              & ( n_i = X1 )
              & ~ $less(X1,X3)
              & ( 1 = X2 ) )
          & in_cover(X0) )
        | ~ in_cover(X0) ) ),
    inference(nnf_transformation,[],[f39]) ).

tff(f64,plain,
    ! [X0: general] :
      ( ( in_cover(X0)
        | ! [X2: $int,X3: $int,X1: $int] :
            ( $less(X3,X2)
            | ( f__integer__(X3) != X0 )
            | ( n_i != X1 )
            | $less(X1,X3)
            | ( 1 != X2 ) )
        | ~ in_cover(X0) )
      & ( ( ? [X2: $int,X3: $int,X1: $int] :
              ( ~ $less(X3,X2)
              & ( X0 = f__integer__(X3) )
              & ( n_i = X1 )
              & ~ $less(X1,X3)
              & ( 1 = X2 ) )
          & in_cover(X0) )
        | ~ in_cover(X0) ) ),
    inference(flattening,[],[f63]) ).

tff(f65,plain,
    ! [X0: general] :
      ( ( in_cover(X0)
        | ! [X1: $int,X2: $int,X3: $int] :
            ( $less(X2,X1)
            | ( f__integer__(X2) != X0 )
            | ( n_i != X3 )
            | $less(X3,X2)
            | ( 1 != X1 ) )
        | ~ in_cover(X0) )
      & ( ( ? [X4: $int,X5: $int,X6: $int] :
              ( ~ $less(X5,X4)
              & ( f__integer__(X5) = X0 )
              & ( n_i = X6 )
              & ~ $less(X6,X5)
              & ( 1 = X4 ) )
          & in_cover(X0) )
        | ~ in_cover(X0) ) ),
    inference(rectify,[],[f64]) ).

tff(f66,plain,
    ! [X0: general] :
      ( ( in_cover(X0)
        | ! [X1: $int,X2: $int,X3: $int] :
            ( $less(X2,X1)
            | ( f__integer__(X2) != X0 )
            | ( n_i != X3 )
            | $less(X3,X2)
            | ( 1 != X1 ) )
        | ~ in_cover(X0) )
      & ( ( ~ $less(sK1(X0),sK0(X0))
          & ( f__integer__(sK1(X0)) = X0 )
          & ( n_i = sK2(X0) )
          & ~ $less(sK2(X0),sK1(X0))
          & ( 1 = sK0(X0) )
          & in_cover(X0) )
        | ~ in_cover(X0) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X4,sK0(X0)),skolemize(X5,sK1(X0)),skolemize(X6,sK2(X0))],[f65]) ).

tff(f82,plain,
    ? [X0: general] :
      ( ( ~ in_cover(X0)
        | ! [X1: $int,X3: $int,X2: $int] :
            ( $less(X2,X1)
            | ( f__integer__(X2) != X0 )
            | $less(X3,X2)
            | ( 1 != X1 )
            | ( n_i != X3 ) )
        | ~ in_cover(X0) )
      & ( in_cover(X0)
        | ( ? [X1: $int,X3: $int,X2: $int] :
              ( ~ $less(X2,X1)
              & ( f__integer__(X2) = X0 )
              & ~ $less(X3,X2)
              & ( X1 = 1 )
              & ( n_i = X3 ) )
          & in_cover(X0) ) ) ),
    inference(nnf_transformation,[],[f59]) ).

tff(f83,plain,
    ? [X0: general] :
      ( ( ~ in_cover(X0)
        | ! [X1: $int,X3: $int,X2: $int] :
            ( $less(X2,X1)
            | ( f__integer__(X2) != X0 )
            | $less(X3,X2)
            | ( 1 != X1 )
            | ( n_i != X3 ) )
        | ~ in_cover(X0) )
      & ( in_cover(X0)
        | ( ? [X1: $int,X3: $int,X2: $int] :
              ( ~ $less(X2,X1)
              & ( f__integer__(X2) = X0 )
              & ~ $less(X3,X2)
              & ( X1 = 1 )
              & ( n_i = X3 ) )
          & in_cover(X0) ) ) ),
    inference(flattening,[],[f82]) ).

tff(f84,plain,
    ? [X0: general] :
      ( ( ~ in_cover(X0)
        | ! [X1: $int,X2: $int,X3: $int] :
            ( $less(X3,X1)
            | ( f__integer__(X3) != X0 )
            | $less(X2,X3)
            | ( 1 != X1 )
            | ( n_i != X2 ) )
        | ~ in_cover(X0) )
      & ( in_cover(X0)
        | ( ? [X4: $int,X5: $int,X6: $int] :
              ( ~ $less(X6,X4)
              & ( f__integer__(X6) = X0 )
              & ~ $less(X5,X6)
              & ( 1 = X4 )
              & ( n_i = X5 ) )
          & in_cover(X0) ) ) ),
    inference(rectify,[],[f83]) ).

tff(f85,plain,
    ( ( ~ in_cover(sK9)
      | ! [X1: $int,X2: $int,X3: $int] :
          ( $less(X3,X1)
          | ( f__integer__(X3) != sK9 )
          | $less(X2,X3)
          | ( 1 != X1 )
          | ( n_i != X2 ) )
      | ~ in_cover(sK9) )
    & ( in_cover(sK9)
      | ( ~ $less(sK12,sK10)
        & ( sK9 = f__integer__(sK12) )
        & ~ $less(sK11,sK12)
        & ( 1 = sK10 )
        & ( n_i = sK11 )
        & in_cover(sK9) ) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK9,sK10,sK11,sK12]),skolemize(X0,sK9),skolemize(X4,sK10),skolemize(X5,sK11),skolemize(X6,sK12)],[f84]) ).

tff(f91,plain,
    ! [X0: general] :
      ( ( 1 = sK0(X0) )
      | ~ in_cover(X0) ),
    inference(cnf_transformation,[],[f66]) ).

tff(f92,plain,
    ! [X0: general] :
      ( ~ $less(sK2(X0),sK1(X0))
      | ~ in_cover(X0) ),
    inference(cnf_transformation,[],[f66]) ).

tff(f93,plain,
    ! [X0: general] :
      ( ( n_i = sK2(X0) )
      | ~ in_cover(X0) ),
    inference(cnf_transformation,[],[f66]) ).

tff(f94,plain,
    ! [X0: general] :
      ( ( f__integer__(sK1(X0)) = X0 )
      | ~ in_cover(X0) ),
    inference(cnf_transformation,[],[f66]) ).

tff(f95,plain,
    ! [X0: general] :
      ( ~ $less(sK1(X0),sK0(X0))
      | ~ in_cover(X0) ),
    inference(cnf_transformation,[],[f66]) ).

tff(f123,plain,
    ( in_cover(sK9)
    | in_cover(sK9) ),
    inference(cnf_transformation,[],[f85]) ).

tff(f129,plain,
    ! [X2: $int,X3: $int,X1: $int] :
      ( ~ in_cover(sK9)
      | $less(X3,X1)
      | ( f__integer__(X3) != sK9 )
      | $less(X2,X3)
      | ( 1 != X1 )
      | ( n_i != X2 )
      | ~ in_cover(sK9) ),
    inference(cnf_transformation,[],[f85]) ).

tff(f167,plain,
    ! [X2: $int,X3: $int] :
      ( ~ in_cover(sK9)
      | $less(X3,1)
      | ( f__integer__(X3) != sK9 )
      | $less(X2,X3)
      | ( n_i != X2 )
      | ~ in_cover(sK9) ),
    inference(equality_resolution,[],[f129]) ).

tff(f168,plain,
    ! [X3: $int] :
      ( ( f__integer__(X3) != sK9 )
      | ~ in_cover(sK9)
      | $less(n_i,X3)
      | $less(X3,1)
      | ~ in_cover(sK9) ),
    inference(equality_resolution,[],[f167]) ).

tff(f171,plain,
    ! [X3: $int] :
      ( $less(n_i,X3)
      | ( f__integer__(X3) != sK9 )
      | $less(X3,1)
      | ~ in_cover(sK9) ),
    inference(duplicate_literal_removal,[],[f168]) ).

tff(f172,plain,
    in_cover(sK9),
    inference(duplicate_literal_removal,[],[f123]) ).

tff(f179,definition,
    ( spl20_2
  <=> in_cover(sK9) ),
    introduced(definition,[new_symbols(definition,[spl20_2])],[avatar_definition]) ).

tff(f181,plain,
    ( in_cover(sK9)
    | ~ spl20_2 ),
    inference(avatar_component_clause,[],[f179]) ).

tff(f193,definition,
    ( spl20_5
  <=> ! [X3: $int] :
        ( $less(n_i,X3)
        | $less(X3,1)
        | ( f__integer__(X3) != sK9 ) ) ),
    introduced(definition,[new_symbols(definition,[spl20_5])],[avatar_definition]) ).

tff(f194,plain,
    ( ! [X3: $int] :
        ( ( f__integer__(X3) != sK9 )
        | $less(X3,1)
        | $less(n_i,X3) )
    | ~ spl20_5 ),
    inference(avatar_component_clause,[],[f193]) ).

tff(f195,plain,
    ( spl20_5
    | ~ spl20_2 ),
    inference(avatar_split_clause,[],[f171,f179,f193]) ).

tff(f216,plain,
    spl20_2,
    inference(avatar_split_clause,[],[f172,f179]) ).

tff(f247,plain,
    ! [X0: general] :
      ( ~ in_cover(X0)
      | ~ $less(n_i,sK1(X0))
      | ~ in_cover(X0) ),
    inference(superposition,[],[f92,f93]) ).

tff(f248,plain,
    ! [X0: general] :
      ( ~ $less(n_i,sK1(X0))
      | ~ in_cover(X0) ),
    inference(duplicate_literal_removal,[],[f247]) ).

tff(f251,plain,
    ( ! [X0: general] :
        ( $less(sK1(X0),1)
        | ~ in_cover(X0)
        | ( sK9 != X0 )
        | $less(n_i,sK1(X0)) )
    | ~ spl20_5 ),
    inference(superposition,[],[f194,f94]) ).

tff(f252,plain,
    ! [X0: general] :
      ( ~ in_cover(X0)
      | ~ in_cover(X0)
      | ~ $less(sK1(X0),1) ),
    inference(superposition,[],[f95,f91]) ).

tff(f253,plain,
    ! [X0: general] :
      ( ~ $less(sK1(X0),1)
      | ~ in_cover(X0) ),
    inference(duplicate_literal_removal,[],[f252]) ).

tff(f398,plain,
    ( ! [X0: general] :
        ( ~ in_cover(X0)
        | $less(n_i,sK1(X0))
        | ( sK9 != X0 )
        | ~ in_cover(X0) )
    | ~ spl20_5 ),
    inference(resolution,[],[f253,f251]) ).

tff(f399,plain,
    ( ! [X0: general] :
        ( $less(n_i,sK1(X0))
        | ~ in_cover(X0)
        | ( sK9 != X0 ) )
    | ~ spl20_5 ),
    inference(duplicate_literal_removal,[],[f398]) ).

tff(f400,plain,
    ( ! [X0: general] :
        ( ( sK9 != X0 )
        | ~ in_cover(X0) )
    | ~ spl20_5 ),
    inference(forward_subsumption_resolution,[],[f399,f248]) ).

tff(f401,plain,
    ( ~ in_cover(sK9)
    | ~ spl20_5 ),
    inference(equality_resolution,[],[f400]) ).

tff(f402,plain,
    ( $false
    | ~ spl20_2
    | ~ spl20_5 ),
    inference(forward_subsumption_resolution,[],[f401,f181]) ).

tff(f403,plain,
    ( ~ spl20_2
    | ~ spl20_5 ),
    inference(avatar_contradiction_clause,[],[f402]) ).

tff(f404,plain,
    $false,
    inference(avatar_smt_refutation,[],[f403,f216,f195]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWX078_1 : TPTP v9.3.1. Released v9.1.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.06/0.18  % Computer : n008.cluster.edu
% 0.06/0.18  % Model    : x86_64 x86_64
% 0.06/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.18  % Memory   : 8046.5625MB
% 0.06/0.18  % OS       : Linux 6.8.0-71-generic
% 0.06/0.18  % CPULimit : 300
% 0.06/0.18  % WCLimit  : 300
% 0.06/0.18  % DateTime : Mon Sep 28 15:00:55 UTC 2026
% 0.06/0.18  % CPUTime  : 
% 0.06/0.18  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.06/0.21  Running first-order theorem proving
% 0.06/0.21  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
% 3.03/1.11  % (2311986)Detected arithmetic, will pick strategies from an ALASCA-aware ARI schedule.
% 3.03/1.11  % (2311995)dis+21_64_to=kbo:sil=128000:si=on:sp=weighted_frequency:uwa=alasca_can_abstract:random_seed=4006303020:i=4:rtra=on_2999 on theBenchmark for (2999ds/4Mi)
% 3.03/1.11  % (2311995)Instruction limit reached! 
% 3.03/1.11  % (2311995)------------------------------
% 3.03/1.11  % (2311995)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.03/1.11  % (2311995)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.03/1.11  % (2311995)CaDiCaL version: 2.1.3
% 3.03/1.11  % (2311995)Termination reason: Instruction limit
% 3.03/1.11  % (2311995)Termination phase: Saturation
% 3.03/1.11  % (2311995)Time elapsed: 0.003 s
% 3.03/1.11  % (2311995)Peak memory usage: 89 MB
% 3.03/1.11  % (2311995)Instructions burned: 7 (million)
% 3.03/1.11  % (2311992)dis+1002_1_to=kbo:sil=128000:tgt=ground:sas=z3:si=on:spb=units:tha=off:random_seed=2486841398:i=307:kws=precedence:nm=0:rtra=on_2999 on theBenchmark for (2999ds/307Mi)
% 3.03/1.11  % (2311991)dis+1002_16:1_to=lpo:sil=64000:sas=z3:si=on:norm_ineq=on:gve=force:uwa=one_side_constant:random_seed=2214279744:i=12:doe=on:rtra=on:gtg=exists_top:ss=axioms_2999 on theBenchmark for (2999ds/12Mi)
% 3.03/1.11  % (2311993)dis+10_3_slsqr=1,4:to=lpo:sil=128000:thi=strong:si=on:uwa=off:s2agt=20:slsqc=1:slsq=on:random_seed=2834448439:i=201:slsql=off:asg=cautious:rtra=on:gtg=all:ss=axioms:sgt=16_2999 on theBenchmark for (2999ds/201Mi)
% 3.03/1.11  % (2311994)lrs+1002_4:1_to=lpo:sil=64000:si=on:br=off:random_seed=3156135394:s2a=on:i=7:rtra=on:inst=on_2999 on theBenchmark for (2999ds/7Mi)
% 3.03/1.11  % (2311996)lrs+10_1_to=lpo:sas=z3:si=on:tha=off:random_seed=3121714371:i=46:rtra=on_2999 on theBenchmark for (2999ds/46Mi)
% 3.03/1.11  % (2311997)lrs+10_1_tgt=ground:sas=z3:si=on:random_seed=381653445:i=33:rtra=on_2999 on theBenchmark for (2999ds/33Mi)
% 3.03/1.11  % (2311994)Instruction limit reached! 
% 3.03/1.11  % (2311994)------------------------------
% 3.03/1.11  % (2311994)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.03/1.11  % (2311994)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.03/1.11  % (2311994)CaDiCaL version: 2.1.3
% 3.03/1.11  % (2311994)Termination reason: Instruction limit
% 3.03/1.11  % (2311994)Termination phase: Saturation
% 3.03/1.11  % (2311994)Time elapsed: 0.006 s
% 3.03/1.11  % (2311994)Peak memory usage: 88 MB
% 3.03/1.11  % (2311994)Instructions burned: 8 (million)
% 3.03/1.11  % (2311991)Instruction limit reached! 
% 3.03/1.11  % (2311991)------------------------------
% 3.03/1.11  % (2311991)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.03/1.11  % (2311991)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.03/1.11  % (2311991)CaDiCaL version: 2.1.3
% 3.03/1.11  % (2311991)Termination reason: Instruction limit
% 3.03/1.11  % (2311991)Termination phase: Saturation
% 3.03/1.11  % (2311991)Time elapsed: 0.031 s
% 3.03/1.11  % (2311991)Peak memory usage: 116 MB
% 3.03/1.11  % (2311991)Instructions burned: 12 (million)
% 3.03/1.11  % (2311992)First to succeed.
% 3.03/1.11  % (2311992)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2311986"
% 3.03/1.11  % (2311996)Also succeeded, but the first one will report.
% 3.03/1.11  % (2311999)dis+11_3_anc=none:drc=ordering:si=on:urr=ec_only:bce=on:tha=off:sac=on:random_seed=2490087395:st=5:i=14:sd=10:rtra=on:ss=axioms:rawr=on_2998 on theBenchmark for (2998ds/14Mi)
% 3.03/1.11  % (2311999)Also succeeded, but the first one will report.
% 3.03/1.11  % (2311997)Also succeeded, but the first one will report.
% 3.03/1.11  % (2311993)Also succeeded, but the first one will report.
% 3.03/1.11  % (2312006)dis+1011_2:1_to=kbo:sil=128000:tgt=full:fde=none:si=on:norm_ineq=on:spb=goal_then_units:tha=some:nwc=2:sac=on:random_seed=3026156968:i=29:thsqd=64:nm=0:thsqc=8:rtra=on:thsq=on:ev=off_2998 on theBenchmark for (2998ds/29Mi)
% 3.03/1.11  % (2312006)Also succeeded, but the first one will report.
% 3.03/1.11  % (2312007)ott+21_1024_to=lakbo:sil=128000:bsd=on:si=on:alasca=on:uwa=alasca_main:nwc=0.5:random_seed=633036953:cond=on:i=16:fgj=on:ep=RS:asg=force:nm=10:rtra=on:rawr=on_2998 on theBenchmark for (2998ds/16Mi)
% 3.03/1.11  % (2312007)Instruction limit reached! 
% 3.03/1.11  % (2312007)------------------------------
% 3.03/1.11  % (2312007)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.03/1.11  % (2312007)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.03/1.11  % (2312007)CaDiCaL version: 2.1.3
% 3.03/1.11  % (2312007)Termination reason: Instruction limit
% 3.03/1.11  % (2312007)Termination phase: Saturation
% 3.03/1.11  % (2312007)Time elapsed: 0.012 s
% 3.03/1.11  % (2312007)Peak memory usage: 90 MB
% 3.03/1.11  % (2312007)Instructions burned: 17 (million)
% 3.03/1.11  % (2312012)ott+1010_8_to=lpo:sil=128000:si=on:norm_ineq=on:sp=unary_frequency:sos=on:gve=cautious:spb=goal_then_units:uwa=alasca_main_floor:tha=some:random_seed=3619376539:i=27:canc=cautious:fsr=off:rtra=on_2996 on theBenchmark for (2996ds/27Mi)
% 3.03/1.11  % (2311992)Refutation found. Thanks to Tanya!
% 3.03/1.11  % SZS status Theorem for theBenchmark
% 3.03/1.11  % SZS output start Proof for theBenchmark
% See solution above
% 3.74/1.26  % (2311992)------------------------------
% 3.74/1.26  % (2311992)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.74/1.26  % (2311992)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.74/1.26  % (2311992)CaDiCaL version: 2.1.3
% 3.74/1.26  % (2311992)Termination reason: Refutation
% 3.74/1.26  % (2311992)Time elapsed: 0.047 s
% 3.74/1.26  % (2311992)Peak memory usage: 117 MB
% 3.74/1.26  % (2311992)Instructions burned: 29 (million)
% 3.74/1.26  % (2311992)------------------------------
% 3.74/1.26  % (2311992)------------------------------
% 3.74/1.26  % (2311986)Success in time 0.454 s
% 3.74/1.26  % Vampire exiting
%------------------------------------------------------------------------------