↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n003.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 : Wed Sep 30 08:19:56 AM UTC 2026

% Result   : Theorem 0.22s 0.29s
% Output   : Refutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   28 (  14 unt;   0 typ;   0 def)
%            Number of atoms       :   94 (  36 equ;   0 cnn)
%            Maximal formula atoms :    2 (   3 avg)
%            Number of connectives :  348 (  14   ~;   4   |;   3   &; 320   @)
%                                         (   0 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   11 (  11   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   16 (  13 usr;   5 con; 0-4 aty)
%            Number of variables   :   65 (  13   ^;  46   !;   6   ?;  65   :)

% Comments : 
%------------------------------------------------------------------------------
thf(type_def_5,type,
    'type/nums/num': $tType ).

thf(type_def_6,type,
    sTfun: ( $tType * $tType ) > $tType ).

thf(func_def_0,type,
    'const/nums/NUMERAL': 'type/nums/num' > 'type/nums/num' ).

thf(func_def_1,type,
    'const/nums/_0': 'type/nums/num' ).

thf(func_def_2,type,
    'const/iterate/nsum': 
      !>[X0: $tType] : ( ( X0 > $o ) > ( X0 > 'type/nums/num' ) > 'type/nums/num' ) ).

thf(func_def_3,type,
    'const/iterate/..': 'type/nums/num' > 'type/nums/num' > 'type/nums/num' > $o ).

thf(func_def_4,type,
    'const/arith/+': 'type/nums/num' > 'type/nums/num' > 'type/nums/num' ).

thf(func_def_5,type,
    'const/arith/-': 'type/nums/num' > 'type/nums/num' > 'type/nums/num' ).

thf(func_def_6,type,
    'const/arith/<=': 'type/nums/num' > 'type/nums/num' > $o ).

thf(func_def_10,type,
    db0: 
      !>[X0: $tType] : X0 ).

thf(func_def_11,type,
    vLAM: 
      !>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).

thf(func_def_12,type,
    sK0: 'type/nums/num' > 'type/nums/num' ).

thf(func_def_13,type,
    sK1: 'type/nums/num' ).

thf(func_def_14,type,
    sK2: 'type/nums/num' ).

thf(f1,axiom,
    ! [X0: 'type/nums/num',X1: 'type/nums/num'] :
      ( ( 'const/arith/<=' @ X1 @ X0 )
     => ( ( 'const/arith/+' @ ( 'const/arith/-' @ X0 @ X1 ) @ X1 )
        = X0 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/arith/SUB_ADD_') ).

thf(f2,axiom,
    ! [X0: 'type/nums/num'] :
      ( ( 'const/arith/+' @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) @ X0 )
      = X0 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/arith/ADD_CLAUSES_0') ).

thf(f3,axiom,
    ! [X1: 'type/nums/num' > 'type/nums/num',X2: 'type/nums/num',X3: 'type/nums/num',X0: 'type/nums/num'] :
      ( ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X2 @ X3 )
        @ ^ [X4: 'type/nums/num'] : ( X1 @ ( 'const/arith/+' @ X4 @ X0 ) ) )
      = ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ ( 'const/arith/+' @ X2 @ X0 ) @ ( 'const/arith/+' @ X3 @ X0 ) ) @ X1 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/iterate/NSUM_OFFSET_') ).

thf(f4,conjecture,
    ! [X1: 'type/nums/num',X0: 'type/nums/num' > 'type/nums/num',X2: 'type/nums/num'] :
      ( ( 'const/arith/<=' @ X1 @ X2 )
     => ( ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) @ ( 'const/arith/-' @ X2 @ X1 ) )
          @ ^ [X3: 'type/nums/num'] : ( X0 @ ( 'const/arith/+' @ X3 @ X1 ) ) )
        = ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 ) @ X0 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/iterate/NSUM_OFFSET_0_') ).

thf(f5,negated_conjecture,
    ~ ! [X1: 'type/nums/num',X0: 'type/nums/num' > 'type/nums/num',X2: 'type/nums/num'] :
        ( ( 'const/arith/<=' @ X1 @ X2 )
       => ( ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) @ ( 'const/arith/-' @ X2 @ X1 ) )
            @ ^ [X3: 'type/nums/num'] : ( X0 @ ( 'const/arith/+' @ X3 @ X1 ) ) )
          = ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 ) @ X0 ) ) ),
    inference(negated_conjecture,[status(cth)],[f4]) ).

thf(f6,plain,
    ~ ! [X0: 'type/nums/num',X1: 'type/nums/num' > 'type/nums/num',X2: 'type/nums/num'] :
        ( ( 'const/arith/<=' @ X0 @ X2 )
       => ( ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) @ ( 'const/arith/-' @ X2 @ X0 ) )
            @ ^ [X3: 'type/nums/num'] : ( X1 @ ( 'const/arith/+' @ X3 @ X0 ) ) )
          = ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X0 @ X2 ) @ X1 ) ) ),
    inference(rectify,[],[f5]) ).

thf(f7,plain,
    ~ ! [X0: 'type/nums/num',X1: 'type/nums/num' > 'type/nums/num',X2: 'type/nums/num'] :
        ( ( ( 'const/arith/<=' @ X0 @ X2 )
          = $true )
       => ( ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) @ ( 'const/arith/-' @ X2 @ X0 ) )
            @ ^ [Y0: 'type/nums/num'] : ( X1 @ ( 'const/arith/+' @ Y0 @ X0 ) ) )
          = ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X0 @ X2 ) @ X1 ) ) ),
    inference(fool_elimination,[],[f6]) ).

thf(f8,plain,
    ! [X0: 'type/nums/num',X1: 'type/nums/num'] :
      ( ( 'const/arith/<=' @ X1 @ X0 )
     => ( ( 'const/arith/+' @ ( 'const/arith/-' @ X0 @ X1 ) @ X1 )
        = X0 ) ),
    inference(rectify,[],[f1]) ).

thf(f9,plain,
    ! [X0: 'type/nums/num',X1: 'type/nums/num'] :
      ( ( ( 'const/arith/<=' @ X1 @ X0 )
        = $true )
     => ( ( 'const/arith/+' @ ( 'const/arith/-' @ X0 @ X1 ) @ X1 )
        = X0 ) ),
    inference(fool_elimination,[],[f8]) ).

thf(f10,plain,
    ! [X0: 'type/nums/num' > 'type/nums/num',X1: 'type/nums/num',X2: 'type/nums/num',X3: 'type/nums/num'] :
      ( ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 )
        @ ^ [X4: 'type/nums/num'] : ( X0 @ ( 'const/arith/+' @ X4 @ X3 ) ) )
      = ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ ( 'const/arith/+' @ X1 @ X3 ) @ ( 'const/arith/+' @ X2 @ X3 ) ) @ X0 ) ),
    inference(rectify,[],[f3]) ).

thf(f11,plain,
    ! [X0: 'type/nums/num' > 'type/nums/num',X1: 'type/nums/num',X3: 'type/nums/num',X2: 'type/nums/num'] :
      ( ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 )
        @ ^ [Y0: 'type/nums/num'] : ( X0 @ ( 'const/arith/+' @ Y0 @ X3 ) ) )
      = ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ ( 'const/arith/+' @ X1 @ X3 ) @ ( 'const/arith/+' @ X2 @ X3 ) ) @ X0 ) ),
    inference(fool_elimination,[],[f10]) ).

thf(f12,plain,
    ! [X1: 'type/nums/num',X0: 'type/nums/num'] :
      ( ( ( 'const/arith/<=' @ X1 @ X0 )
       != $true )
      | ( ( 'const/arith/+' @ ( 'const/arith/-' @ X0 @ X1 ) @ X1 )
        = X0 ) ),
    inference(ennf_transformation,[],[f9]) ).

thf(f13,plain,
    ? [X1: 'type/nums/num' > 'type/nums/num',X0: 'type/nums/num',X2: 'type/nums/num'] :
      ( ( ( 'const/arith/<=' @ X0 @ X2 )
        = $true )
      & ( ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) @ ( 'const/arith/-' @ X2 @ X0 ) )
          @ ^ [Y0: 'type/nums/num'] : ( X1 @ ( 'const/arith/+' @ Y0 @ X0 ) ) )
       != ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X0 @ X2 ) @ X1 ) ) ),
    inference(ennf_transformation,[],[f7]) ).

thf(f14,plain,
    ? [X0: 'type/nums/num' > 'type/nums/num',X1: 'type/nums/num',X2: 'type/nums/num'] :
      ( ( ( 'const/arith/<=' @ X1 @ X2 )
        = $true )
      & ( ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 ) @ X0 )
       != ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) @ ( 'const/arith/-' @ X2 @ X1 ) )
          @ ^ [Y0: 'type/nums/num'] : ( X0 @ ( 'const/arith/+' @ Y0 @ X1 ) ) ) ) ),
    inference(rectify,[],[f13]) ).

thf(f15,plain,
    ( ( ( 'const/arith/<=' @ sK1 @ sK2 )
      = $true )
    & ( ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK1 @ sK2 ) @ sK0 )
     != ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) @ ( 'const/arith/-' @ sK2 @ sK1 ) )
        @ ^ [Y0: 'type/nums/num'] : ( sK0 @ ( 'const/arith/+' @ Y0 @ sK1 ) ) ) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f14]) ).

thf(f16,plain,
    ! [X0: 'type/nums/num' > 'type/nums/num',X1: 'type/nums/num',X2: 'type/nums/num',X3: 'type/nums/num'] :
      ( ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X3 )
        @ ^ [Y0: 'type/nums/num'] : ( X0 @ ( 'const/arith/+' @ Y0 @ X2 ) ) )
      = ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ ( 'const/arith/+' @ X1 @ X2 ) @ ( 'const/arith/+' @ X3 @ X2 ) ) @ X0 ) ),
    inference(rectify,[],[f11]) ).

thf(f17,plain,
    ! [X0: 'type/nums/num',X1: 'type/nums/num'] :
      ( ( ( 'const/arith/<=' @ X0 @ X1 )
       != $true )
      | ( ( 'const/arith/+' @ ( 'const/arith/-' @ X1 @ X0 ) @ X0 )
        = X1 ) ),
    inference(rectify,[],[f12]) ).

thf(f18,plain,
    ( ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK1 @ sK2 ) @ sK0 )
   != ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) @ ( 'const/arith/-' @ sK2 @ sK1 ) )
      @ ^ [Y0: 'type/nums/num'] : ( sK0 @ ( 'const/arith/+' @ Y0 @ sK1 ) ) ) ),
    inference(cnf_transformation,[],[f15]) ).

thf(f19,plain,
    ( ( 'const/arith/<=' @ sK1 @ sK2 )
    = $true ),
    inference(cnf_transformation,[],[f15]) ).

thf(f20,plain,
    ! [X2: 'type/nums/num',X3: 'type/nums/num',X0: 'type/nums/num' > 'type/nums/num',X1: 'type/nums/num'] :
      ( ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X3 )
        @ ^ [Y0: 'type/nums/num'] : ( X0 @ ( 'const/arith/+' @ Y0 @ X2 ) ) )
      = ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ ( 'const/arith/+' @ X1 @ X2 ) @ ( 'const/arith/+' @ X3 @ X2 ) ) @ X0 ) ),
    inference(cnf_transformation,[],[f16]) ).

thf(f21,plain,
    ! [X0: 'type/nums/num',X1: 'type/nums/num'] :
      ( ( ( 'const/arith/<=' @ X0 @ X1 )
       != $true )
      | ( ( 'const/arith/+' @ ( 'const/arith/-' @ X1 @ X0 ) @ X0 )
        = X1 ) ),
    inference(cnf_transformation,[],[f17]) ).

thf(f22,plain,
    ! [X0: 'type/nums/num'] :
      ( ( 'const/arith/+' @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) @ X0 )
      = X0 ),
    inference(cnf_transformation,[],[f2]) ).

thf(f25,plain,
    ( ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK1 @ sK2 ) @ sK0 )
   != ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ ( 'const/arith/+' @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) @ sK1 ) @ ( 'const/arith/+' @ ( 'const/arith/-' @ sK2 @ sK1 ) @ sK1 ) ) @ sK0 ) ),
    inference(backward_demodulation,[],[f18,f20]) ).

thf(f26,plain,
    ( ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK1 @ sK2 ) @ sK0 )
   != ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK1 @ ( 'const/arith/+' @ ( 'const/arith/-' @ sK2 @ sK1 ) @ sK1 ) ) @ sK0 ) ),
    inference(forward_demodulation,[],[f25,f22]) ).

thf(f37,plain,
    ( ( $true != $true )
    | ( ( 'const/arith/+' @ ( 'const/arith/-' @ sK2 @ sK1 ) @ sK1 )
      = sK2 ) ),
    inference(constrained_superposition,[],[f21,f19]) ).

thf(f40,plain,
    ( ( 'const/arith/+' @ ( 'const/arith/-' @ sK2 @ sK1 ) @ sK1 )
    = sK2 ),
    inference(trivial_inequality_removal,[],[f37]) ).

thf(f41,plain,
    ( ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK1 @ sK2 ) @ sK0 )
   != ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK1 @ sK2 ) @ sK0 ) ),
    inference(backward_demodulation,[],[f26,f40]) ).

thf(f42,plain,
    $false,
    inference(trivial_inequality_removal,[],[f41]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : NUN051^1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.17  % Computer : n003.cluster.edu
% 0.08/0.17  % Model    : x86_64 x86_64
% 0.08/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17  % Memory   : 8046.5625MB
% 0.08/0.17  % OS       : Linux 6.8.0-71-generic
% 0.08/0.17  % CPULimit : 300
% 0.08/0.17  % WCLimit  : 300
% 0.08/0.17  % DateTime : Tue Sep 29 13:09:14 UTC 2026
% 0.08/0.18  % CPUTime  : 
% 0.08/0.18  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.21  Running higher-order theorem proving
% 0.08/0.22  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.29  % (2472921)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.22/0.29  % (2472928)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=2064939685:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.22/0.29  % (2472928)Instruction limit reached! 
% 0.22/0.29  % (2472928)------------------------------
% 0.22/0.29  % (2472928)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.29  % (2472928)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.29  % (2472928)CaDiCaL version: 2.1.3
% 0.22/0.29  % (2472928)Termination reason: Instruction limit
% 0.22/0.29  % (2472928)Termination phase: Saturation
% 0.22/0.29  % (2472928)Time elapsed: 0.001 s
% 0.22/0.29  % (2472928)Peak memory usage: 12 MB
% 0.22/0.29  % (2472928)Instructions burned: 3 (million)
% 0.22/0.29  % (2472932)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.22/0.29  % (2472932)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.22/0.29  % (2472927)lrs+10_16_si=on:nwc=1.5:random_seed=4114781875:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.22/0.29  % (2472926)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=1646650806:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.22/0.29  % (2472929)dis+1002_4:1_sfv=off:to=lpo:plsq=on:fde=none:e2e=on:si=on:spb=non_intro:acc=on:uwa=off:fd=preordered:foolp=on:s2agt=32:slsqc=1:slsq=on:random_seed=1005384997:hsq=on:hsqr=16,1:s2a=on:i=634:add=on:nm=16:nicw=on:rtra=on:gtg=position:ss=included:ixr=off:c=on:inj=on:ntd=on:rawr=on_2999 on theBenchmark for (2999ds/634Mi)
% 0.22/0.29  % (2472930)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=2139381664:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.22/0.29  % (2472931)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=3872880445:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.22/0.29  % (2472932)dis+1002_8_to=kbo:sil=128000:tgt=full:drc=off:si=on:sp=const_max:lma=off:spb=non_intro:cbe=off:uwa=interpreted_only:random_seed=4030767665:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.22/0.29  % (2472934)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=272511231:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.22/0.29  % (2472934)Instruction limit reached! 
% 0.22/0.29  % (2472934)------------------------------
% 0.22/0.29  % (2472934)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.29  % (2472934)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.29  % (2472934)CaDiCaL version: 2.1.3
% 0.22/0.29  % (2472934)Termination reason: Instruction limit
% 0.22/0.29  % (2472934)Termination phase: Saturation
% 0.22/0.29  % (2472934)Time elapsed: 0.001 s
% 0.22/0.29  % (2472934)Peak memory usage: 12 MB
% 0.22/0.29  % (2472934)Instructions burned: 4 (million)
% 0.22/0.29  % (2472927)Instruction limit reached! 
% 0.22/0.29  % (2472927)------------------------------
% 0.22/0.29  % (2472927)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.29  % (2472927)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.29  % (2472927)CaDiCaL version: 2.1.3
% 0.22/0.29  % (2472927)Termination reason: Instruction limit
% 0.22/0.29  % (2472927)Termination phase: Saturation
% 0.22/0.29  % (2472927)Time elapsed: 0.011 s
% 0.22/0.29  % (2472927)Peak memory usage: 12 MB
% 0.22/0.29  % (2472927)Instructions burned: 18 (million)
% 0.22/0.29  % (2472930)Instruction limit reached! 
% 0.22/0.29  % (2472930)------------------------------
% 0.22/0.29  % (2472930)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.29  % (2472930)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.29  % (2472930)CaDiCaL version: 2.1.3
% 0.22/0.29  % (2472930)Termination reason: Instruction limit
% 0.22/0.29  % (2472930)Termination phase: Saturation
% 0.22/0.29  % (2472930)Time elapsed: 0.014 s
% 0.22/0.29  % (2472930)Peak memory usage: 12 MB
% 0.22/0.29  % (2472930)Instructions burned: 25 (million)
% 0.22/0.29  % (2472942)lrs+1010_2:3_cha=on:si=on:uwa=off:nwc=1:random_seed=4143253197:i=5:fgj=on:av=off:rtra=on:fe=axiom:ntd=on_2999 on theBenchmark for (2999ds/5Mi)
% 0.22/0.29  % (2472943)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(5) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.22/0.29  % (2472942)Instruction limit reached! 
% 0.22/0.29  % (2472942)------------------------------
% 0.22/0.29  % (2472942)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.29  % (2472942)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.29  % (2472942)CaDiCaL version: 2.1.3
% 0.22/0.29  % (2472942)Termination reason: Instruction limit
% 0.22/0.29  % (2472942)Termination phase: Saturation
% 0.22/0.29  % (2472942)Time elapsed: 0.004 s
% 0.22/0.29  % (2472942)Peak memory usage: 12 MB
% 0.22/0.29  % (2472942)Instructions burned: 6 (million)
% 0.22/0.29  % (2472943)dis+21_1_to=kbo:sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:plsqr=64,1:uwa=hol:random_seed=3755192810:uwa_fpi=on:i=7:fgj=on:hud=10:fsr=off:rtra=on:rawr=on:fsdmm=5_2999 on theBenchmark for (2999ds/7Mi)
% 0.22/0.29  % (2472944)lrs+10_1_sil=128000:si=on:urr=on:slsqc=1:slsq=on:random_seed=1902881202:i=12:s2at=2:kws=inv_frequency:bd=all:rtra=on_2999 on theBenchmark for (2999ds/12Mi)
% 0.22/0.29  % (2472943)Instruction limit reached! 
% 0.22/0.29  % (2472943)------------------------------
% 0.22/0.29  % (2472943)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.29  % (2472943)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.29  % (2472943)CaDiCaL version: 2.1.3
% 0.22/0.29  % (2472943)Termination reason: Instruction limit
% 0.22/0.29  % (2472943)Termination phase: Saturation
% 0.22/0.29  % (2472943)Time elapsed: 0.004 s
% 0.22/0.29  % (2472943)Peak memory usage: 12 MB
% 0.22/0.29  % (2472943)Instructions burned: 7 (million)
% 0.22/0.29  % (2472944) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2472921-2472944"...
% 0.22/0.29  % (2472947)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.22/0.29  % (2472947)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(1) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.22/0.29  % (2472944)...printing done.
% 0.22/0.29  % (2472931)Instruction limit reached! 
% 0.22/0.29  % (2472931)------------------------------
% 0.22/0.29  % (2472931)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.29  % (2472931)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.29  % (2472931)CaDiCaL version: 2.1.3
% 0.22/0.29  % (2472931)Termination reason: Instruction limit
% 0.22/0.29  % (2472931)Termination phase: Saturation
% 0.22/0.29  % (2472931)Time elapsed: 0.039 s
% 0.22/0.29  % (2472931)Peak memory usage: 12 MB
% 0.22/0.29  % (2472931)Instructions burned: 76 (million)
% 0.22/0.29  % (2472947)ott+1010_64_tgt=ground:cnfonf=lazy_simp:si=on:lma=off:spb=goal:lcm=predicate:random_seed=4007144683:i=28:s2at=5:piset=not:hud=10:bd=all:av=off:rtra=on:ixr=off:fsdmm=1_2999 on theBenchmark for (2999ds/28Mi)
% 0.22/0.29  % (2472944)Refutation found. Thanks to Tanya!
% 0.22/0.29  % SZS status Theorem for theBenchmark
% 0.22/0.29  % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.29  % (2472944)------------------------------
% 0.22/0.29  % (2472944)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.29  % (2472944)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.29  % (2472944)CaDiCaL version: 2.1.3
% 0.22/0.29  % (2472944)Termination reason: Refutation
% 0.22/0.29  % (2472944)Time elapsed: 0.004 s
% 0.22/0.29  % (2472944)Peak memory usage: 12 MB
% 0.22/0.29  % (2472944)Instructions burned: 5 (million)
% 0.22/0.29  % (2472921)Success in time 0.061 s
% 0.22/0.29  % Vampire exiting
%------------------------------------------------------------------------------