↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : ITP099^1 : TPTP v9.3.1. Released v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/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 : Wed Sep 30 08:08:20 AM UTC 2026

% Result   : Theorem 0.70s 0.42s
% Output   : Refutation 0.70s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   58 (   4 unt;   0 typ;   3 def)
%            Number of atoms       :  213 (  74 equ;   0 cnn)
%            Maximal formula atoms :    4 (   3 avg)
%            Number of connectives :  544 (  48   ~;  38   |;   7   &; 425   @)
%                                         (   3 <=>;  23  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    5 (   4 usr)
%            Number of type conns  :   12 (  12   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :  112 ( 109 usr;   9 con; 0-4 aty)
%            Number of variables   :   58 (   0 sgn  58   !;   0   ?;  58   :)

% Comments : 
%------------------------------------------------------------------------------
thf(type_def_5,type,
    list_nat: $tType ).

thf(type_def_6,type,
    list_a: $tType ).

thf(type_def_7,type,
    nat: $tType ).

thf(type_def_8,type,
    a: $tType ).

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

thf(func_def_0,type,
    minus_minus_nat: nat > nat > nat ).

thf(func_def_1,type,
    plus_plus_nat: nat > nat > nat ).

thf(func_def_2,type,
    if_nat: $o > nat > nat > nat ).

thf(func_def_3,type,
    if_a: $o > a > a > a ).

thf(func_def_4,type,
    list_asc_nat: list_nat > $o ).

thf(func_def_5,type,
    list_desc_nat: list_nat > $o ).

thf(func_def_6,type,
    list_strict_asc_nat: list_nat > $o ).

thf(func_def_7,type,
    list_strict_desc_nat: list_nat > $o ).

thf(func_def_8,type,
    listIn923761578nd_nat: list_nat > ( nat > nat ) > nat > nat ).

thf(func_def_9,type,
    listIn1312259492pend_a: list_a > ( nat > a ) > nat > a ).

thf(func_def_10,type,
    listIn870223551op_nat: nat > ( nat > nat ) > nat > nat ).

thf(func_def_11,type,
    listIn1417627087drop_a: nat > ( nat > a ) > nat > a ).

thf(func_def_12,type,
    listIn1299132951ke_nat: nat > ( nat > nat ) > list_nat ).

thf(func_def_13,type,
    listIn84854903take_a: nat > ( nat > a ) > list_a ).

thf(func_def_14,type,
    append_nat: list_nat > list_nat > list_nat ).

thf(func_def_15,type,
    append_a: list_a > list_a > list_a ).

thf(func_def_16,type,
    drop_nat: nat > list_nat > list_nat ).

thf(func_def_17,type,
    drop_a: nat > list_a > list_a ).

thf(func_def_18,type,
    last_nat: list_nat > nat ).

thf(func_def_19,type,
    last_a: list_a > a ).

thf(func_def_20,type,
    nth_nat: list_nat > nat > nat ).

thf(func_def_21,type,
    nth_a: list_a > nat > a ).

thf(func_def_22,type,
    size_size_list_nat: list_nat > nat ).

thf(func_def_23,type,
    size_size_list_a: list_a > nat ).

thf(func_def_24,type,
    ord_less_nat: nat > nat > $o ).

thf(func_def_25,type,
    ord_less_eq_nat: nat > nat > $o ).

thf(func_def_26,type,
    f: nat > a ).

thf(func_def_27,type,
    n: nat ).

thf(func_def_28,type,
    xs: list_a ).

thf(func_def_32,type,
    vPI: 
      !>[X0: $tType] : ( ( X0 > $o ) > $o ) ).

thf(func_def_33,type,
    vIMP: $o > $o > $o ).

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

thf(func_def_35,type,
    db2: 
      !>[X0: $tType] : X0 ).

thf(func_def_36,type,
    db1: 
      !>[X0: $tType] : X0 ).

thf(func_def_37,type,
    vEQ: 
      !>[X0: $tType] : ( X0 > X0 > $o ) ).

thf(func_def_38,type,
    vNOT: $o > $o ).

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

thf(func_def_40,type,
    vOR: $o > $o > $o ).

thf(func_def_41,type,
    vAND: $o > $o > $o ).

thf(func_def_42,type,
    vSIGMA: 
      !>[X0: $tType] : ( ( X0 > $o ) > $o ) ).

thf(func_def_43,type,
    sP0: nat > nat > nat > $o ).

thf(func_def_44,type,
    sP1: nat > nat > nat > $o ).

thf(func_def_45,type,
    sP2: nat > nat > nat > $o ).

thf(func_def_46,type,
    sK3: nat > nat ).

thf(func_def_47,type,
    sK4: nat > ( nat > $o ) > nat ).

thf(func_def_48,type,
    sK5: ( nat > $o ) > nat ).

thf(func_def_49,type,
    sK6: nat > nat ).

thf(func_def_50,type,
    sK7: ( nat > nat ) > nat ).

thf(func_def_51,type,
    sK8: ( nat > nat ) > nat ).

thf(func_def_52,type,
    sK9: nat > nat ).

thf(func_def_53,type,
    sK10: ( nat > $o ) > nat ).

thf(func_def_54,type,
    sK11: ( nat > $o ) > nat ).

thf(func_def_55,type,
    sK12: nat > nat ).

thf(func_def_56,type,
    sK13: ( nat > nat ) > nat ).

thf(func_def_57,type,
    sK14: ( nat > nat ) > nat ).

thf(func_def_58,type,
    sK15: nat > nat ).

thf(func_def_59,type,
    sK16: list_a > ( nat > a ) > list_a > ( nat > a ) > list_a ).

thf(func_def_60,type,
    sK17: nat > ( nat > $o ) > nat ).

thf(func_def_61,type,
    sK18: nat > ( nat > $o ) > nat ).

thf(func_def_62,type,
    sK19: ( nat > nat ) > nat ).

thf(func_def_63,type,
    sK20: ( nat > nat ) > nat ).

thf(func_def_64,type,
    sK21: ( nat > $o ) > nat ).

thf(func_def_65,type,
    sK22: nat > nat ).

thf(func_def_66,type,
    sK23: ( nat > nat ) > nat ).

thf(func_def_67,type,
    sK24: ( nat > nat ) > nat ).

thf(func_def_68,type,
    sK25: nat > nat ).

thf(func_def_69,type,
    sK26: nat > nat ).

thf(func_def_70,type,
    sK27: nat > list_a ).

thf(func_def_71,type,
    sK28: ( nat > nat > $o ) > nat ).

thf(func_def_72,type,
    sK29: ( nat > nat > $o ) > nat ).

thf(func_def_73,type,
    sK30: ( nat > nat > $o ) > nat ).

thf(func_def_74,type,
    sK31: ( nat > nat > $o ) > nat ).

thf(func_def_75,type,
    sK32: ( list_a > $o ) > list_a ).

thf(func_def_76,type,
    sK33: ( nat > nat ) > nat ).

thf(func_def_77,type,
    sK34: ( nat > nat ) > nat ).

thf(func_def_78,type,
    sK35: ( nat > nat ) > nat ).

thf(func_def_79,type,
    sK36: ( nat > nat ) > nat ).

thf(func_def_80,type,
    sK37: ( nat > nat ) > nat ).

thf(func_def_81,type,
    sK38: ( nat > nat ) > nat ).

thf(func_def_82,type,
    sK39: ( nat > nat > $o ) > nat ).

thf(func_def_83,type,
    sK40: ( nat > nat > $o ) > nat ).

thf(func_def_84,type,
    sK41: ( nat > nat > $o ) > nat ).

thf(func_def_85,type,
    sK42: ( nat > nat > $o ) > nat ).

thf(func_def_86,type,
    sK43: ( nat > nat > $o ) > nat ).

thf(func_def_87,type,
    sK44: nat > nat ).

thf(func_def_88,type,
    sK45: ( nat > nat ) > nat ).

thf(func_def_89,type,
    sK46: ( nat > nat ) > nat ).

thf(func_def_90,type,
    sK47: nat > nat ).

thf(func_def_91,type,
    sK48: ( nat > nat ) > nat ).

thf(func_def_92,type,
    sK49: ( nat > nat ) > nat ).

thf(func_def_93,type,
    sK50: nat > nat ).

thf(func_def_94,type,
    sK51: ( nat > nat ) > nat ).

thf(func_def_95,type,
    sK52: ( nat > nat ) > nat ).

thf(func_def_96,type,
    sK53: ( nat > nat ) > nat ).

thf(func_def_97,type,
    sK54: ( nat > nat ) > nat ).

thf(func_def_98,type,
    sK55: nat > nat ).

thf(func_def_99,type,
    sK56: ( nat > nat ) > nat ).

thf(func_def_100,type,
    sK57: ( nat > nat ) > nat ).

thf(func_def_101,type,
    sK58: ( nat > nat ) > nat ).

thf(func_def_102,type,
    sK59: ( nat > nat ) > nat ).

thf(func_def_103,type,
    sK60: nat > ( nat > $o ) > nat > nat ).

thf(func_def_104,type,
    sK61: nat > nat > ( nat > $o ) > nat ).

thf(func_def_105,type,
    sK62: nat > nat ).

thf(func_def_107,type,
    sK64: nat ).

thf(func_def_108,type,
    sK65: nat ).

thf(f34,axiom,
    ! [X1: list_a,X2: nat > a,X0: nat] :
      ( ( ord_less_eq_nat @ X0 @ ( size_size_list_a @ X1 ) )
     => ( ( listIn1417627087drop_a @ X0 @ ( listIn1312259492pend_a @ X1 @ X2 ) )
        = ( listIn1312259492pend_a @ ( drop_a @ X0 @ X1 ) @ X2 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_33_i__append__i__drop__eq1) ).

thf(f36,axiom,
    ! [X1: nat,X2: nat > a,X0: list_a] :
      ( ( ord_less_eq_nat @ ( size_size_list_a @ X0 ) @ X1 )
     => ( ( listIn1417627087drop_a @ X1 @ ( listIn1312259492pend_a @ X0 @ X2 ) )
        = ( listIn1417627087drop_a @ ( minus_minus_nat @ X1 @ ( size_size_list_a @ X0 ) ) @ X2 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_35_i__append__i__drop__eq2) ).

thf(f188,axiom,
    ! [X1: nat,X0: nat] :
      ( ~ ( ord_less_eq_nat @ X0 @ X1 )
     => ( ord_less_nat @ X1 @ X0 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_187_not__le__imp__less) ).

thf(f194,axiom,
    ! [X0: nat,X1: nat] :
      ( ( ord_less_nat @ X0 @ X1 )
     => ( ord_less_eq_nat @ X0 @ X1 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_193_less__imp__le) ).

thf(f253,conjecture,
    ( ( ~ ( ord_less_nat @ n @ ( size_size_list_a @ xs ) )
     => ( ( listIn1417627087drop_a @ n @ ( listIn1312259492pend_a @ xs @ f ) )
        = ( listIn1417627087drop_a @ ( minus_minus_nat @ n @ ( size_size_list_a @ xs ) ) @ f ) ) )
    & ( ( ord_less_nat @ n @ ( size_size_list_a @ xs ) )
     => ( ( listIn1417627087drop_a @ n @ ( listIn1312259492pend_a @ xs @ f ) )
        = ( listIn1312259492pend_a @ ( drop_a @ n @ xs ) @ f ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).

thf(f254,negated_conjecture,
    ~ ( ( ~ ( ord_less_nat @ n @ ( size_size_list_a @ xs ) )
       => ( ( listIn1417627087drop_a @ n @ ( listIn1312259492pend_a @ xs @ f ) )
          = ( listIn1417627087drop_a @ ( minus_minus_nat @ n @ ( size_size_list_a @ xs ) ) @ f ) ) )
      & ( ( ord_less_nat @ n @ ( size_size_list_a @ xs ) )
       => ( ( listIn1417627087drop_a @ n @ ( listIn1312259492pend_a @ xs @ f ) )
          = ( listIn1312259492pend_a @ ( drop_a @ n @ xs ) @ f ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f253]) ).

thf(f255,plain,
    ! [X0: nat,X1: nat] :
      ( ( ord_less_nat @ X0 @ X1 )
     => ( ord_less_eq_nat @ X0 @ X1 ) ),
    inference(rectify,[],[f194]) ).

thf(f256,plain,
    ! [X1: nat,X0: nat] :
      ( ( ( ord_less_nat @ X0 @ X1 )
        = $true )
     => ( ( ord_less_eq_nat @ X0 @ X1 )
        = $true ) ),
    inference(fool_elimination,[],[f255]) ).

thf(f419,plain,
    ! [X0: list_a,X1: nat > a,X2: nat] :
      ( ( ord_less_eq_nat @ X2 @ ( size_size_list_a @ X0 ) )
     => ( ( listIn1417627087drop_a @ X2 @ ( listIn1312259492pend_a @ X0 @ X1 ) )
        = ( listIn1312259492pend_a @ ( drop_a @ X2 @ X0 ) @ X1 ) ) ),
    inference(rectify,[],[f34]) ).

thf(f420,plain,
    ! [X1: nat > a,X2: nat,X0: list_a] :
      ( ( ( ord_less_eq_nat @ X2 @ ( size_size_list_a @ X0 ) )
        = $true )
     => ( ( listIn1417627087drop_a @ X2 @ ( listIn1312259492pend_a @ X0 @ X1 ) )
        = ( listIn1312259492pend_a @ ( drop_a @ X2 @ X0 ) @ X1 ) ) ),
    inference(fool_elimination,[],[f419]) ).

thf(f427,plain,
    ! [X0: nat,X1: nat] :
      ( ~ ( ord_less_eq_nat @ X1 @ X0 )
     => ( ord_less_nat @ X0 @ X1 ) ),
    inference(rectify,[],[f188]) ).

thf(f428,plain,
    ! [X0: nat,X1: nat] :
      ( ( ( ord_less_eq_nat @ X1 @ X0 )
       != $true )
     => ( ( ord_less_nat @ X0 @ X1 )
        = $true ) ),
    inference(fool_elimination,[],[f427]) ).

thf(f437,plain,
    ~ ( ( ~ ( ord_less_nat @ n @ ( size_size_list_a @ xs ) )
       => ( ( listIn1417627087drop_a @ n @ ( listIn1312259492pend_a @ xs @ f ) )
          = ( listIn1417627087drop_a @ ( minus_minus_nat @ n @ ( size_size_list_a @ xs ) ) @ f ) ) )
      & ( ( ord_less_nat @ n @ ( size_size_list_a @ xs ) )
       => ( ( listIn1417627087drop_a @ n @ ( listIn1312259492pend_a @ xs @ f ) )
          = ( listIn1312259492pend_a @ ( drop_a @ n @ xs ) @ f ) ) ) ),
    inference(rectify,[],[f254]) ).

thf(f438,plain,
    ~ ( ( ( ( ord_less_nat @ n @ ( size_size_list_a @ xs ) )
         != $true )
       => ( ( listIn1417627087drop_a @ n @ ( listIn1312259492pend_a @ xs @ f ) )
          = ( listIn1417627087drop_a @ ( minus_minus_nat @ n @ ( size_size_list_a @ xs ) ) @ f ) ) )
      & ( ( ( ord_less_nat @ n @ ( size_size_list_a @ xs ) )
          = $true )
       => ( ( listIn1417627087drop_a @ n @ ( listIn1312259492pend_a @ xs @ f ) )
          = ( listIn1312259492pend_a @ ( drop_a @ n @ xs ) @ f ) ) ) ),
    inference(fool_elimination,[],[f437]) ).

thf(f671,plain,
    ! [X0: nat,X1: nat > a,X2: list_a] :
      ( ( ord_less_eq_nat @ ( size_size_list_a @ X2 ) @ X0 )
     => ( ( listIn1417627087drop_a @ ( minus_minus_nat @ X0 @ ( size_size_list_a @ X2 ) ) @ X1 )
        = ( listIn1417627087drop_a @ X0 @ ( listIn1312259492pend_a @ X2 @ X1 ) ) ) ),
    inference(rectify,[],[f36]) ).

thf(f672,plain,
    ! [X1: nat > a,X0: nat,X2: list_a] :
      ( ( $true
        = ( ord_less_eq_nat @ ( size_size_list_a @ X2 ) @ X0 ) )
     => ( ( listIn1417627087drop_a @ ( minus_minus_nat @ X0 @ ( size_size_list_a @ X2 ) ) @ X1 )
        = ( listIn1417627087drop_a @ X0 @ ( listIn1312259492pend_a @ X2 @ X1 ) ) ) ),
    inference(fool_elimination,[],[f671]) ).

thf(f695,plain,
    ~ ( ( ( ( ord_less_nat @ n @ ( size_size_list_a @ xs ) )
         != $true )
       => ( ( listIn1417627087drop_a @ n @ ( listIn1312259492pend_a @ xs @ f ) )
          = ( listIn1417627087drop_a @ ( minus_minus_nat @ n @ ( size_size_list_a @ xs ) ) @ f ) ) )
      & ( ( ( ord_less_nat @ n @ ( size_size_list_a @ xs ) )
          = $true )
       => ( ( listIn1417627087drop_a @ n @ ( listIn1312259492pend_a @ xs @ f ) )
          = ( listIn1312259492pend_a @ ( drop_a @ n @ xs ) @ f ) ) ) ),
    inference(flattening,[],[f438]) ).

thf(f721,plain,
    ! [X0: nat,X1: nat] :
      ( ( ( ord_less_eq_nat @ X1 @ X0 )
       != $true )
     => ( ( ord_less_nat @ X0 @ X1 )
        = $true ) ),
    inference(flattening,[],[f428]) ).

thf(f808,plain,
    ! [X0: nat,X2: list_a,X1: nat > a] :
      ( ( $true
       != ( ord_less_eq_nat @ ( size_size_list_a @ X2 ) @ X0 ) )
      | ( ( listIn1417627087drop_a @ ( minus_minus_nat @ X0 @ ( size_size_list_a @ X2 ) ) @ X1 )
        = ( listIn1417627087drop_a @ X0 @ ( listIn1312259492pend_a @ X2 @ X1 ) ) ) ),
    inference(ennf_transformation,[],[f672]) ).

thf(f841,plain,
    ( ( ( ( ord_less_nat @ n @ ( size_size_list_a @ xs ) )
        = $true )
      & ( ( listIn1417627087drop_a @ n @ ( listIn1312259492pend_a @ xs @ f ) )
       != ( listIn1312259492pend_a @ ( drop_a @ n @ xs ) @ f ) ) )
    | ( ( ( ord_less_nat @ n @ ( size_size_list_a @ xs ) )
       != $true )
      & ( ( listIn1417627087drop_a @ n @ ( listIn1312259492pend_a @ xs @ f ) )
       != ( listIn1417627087drop_a @ ( minus_minus_nat @ n @ ( size_size_list_a @ xs ) ) @ f ) ) ) ),
    inference(ennf_transformation,[],[f695]) ).

thf(f862,plain,
    ! [X0: nat,X1: nat] :
      ( ( ( ord_less_eq_nat @ X1 @ X0 )
        = $true )
      | ( ( ord_less_nat @ X0 @ X1 )
        = $true ) ),
    inference(ennf_transformation,[],[f721]) ).

thf(f897,plain,
    ! [X2: nat,X1: nat > a,X0: list_a] :
      ( ( ( listIn1417627087drop_a @ X2 @ ( listIn1312259492pend_a @ X0 @ X1 ) )
        = ( listIn1312259492pend_a @ ( drop_a @ X2 @ X0 ) @ X1 ) )
      | ( ( ord_less_eq_nat @ X2 @ ( size_size_list_a @ X0 ) )
       != $true ) ),
    inference(ennf_transformation,[],[f420]) ).

thf(f928,plain,
    ! [X0: nat,X1: nat] :
      ( ( ( ord_less_eq_nat @ X0 @ X1 )
        = $true )
      | ( ( ord_less_nat @ X0 @ X1 )
       != $true ) ),
    inference(ennf_transformation,[],[f256]) ).

thf(f1051,plain,
    ! [X0: nat,X1: list_a,X2: nat > a] :
      ( ( ( ord_less_eq_nat @ ( size_size_list_a @ X1 ) @ X0 )
       != $true )
      | ( ( listIn1417627087drop_a @ X0 @ ( listIn1312259492pend_a @ X1 @ X2 ) )
        = ( listIn1417627087drop_a @ ( minus_minus_nat @ X0 @ ( size_size_list_a @ X1 ) ) @ X2 ) ) ),
    inference(rectify,[],[f808]) ).

thf(f1061,plain,
    ! [X0: nat,X1: nat > a,X2: list_a] :
      ( ( ( listIn1312259492pend_a @ ( drop_a @ X0 @ X2 ) @ X1 )
        = ( listIn1417627087drop_a @ X0 @ ( listIn1312259492pend_a @ X2 @ X1 ) ) )
      | ( $true
       != ( ord_less_eq_nat @ X0 @ ( size_size_list_a @ X2 ) ) ) ),
    inference(rectify,[],[f897]) ).

thf(f1075,plain,
    ! [X0: nat,X1: nat] :
      ( ( ( ord_less_eq_nat @ X0 @ X1 )
        = $true )
      | ( ( ord_less_nat @ X0 @ X1 )
       != $true ) ),
    inference(cnf_transformation,[],[f928]) ).

thf(f1087,plain,
    ( ( ( listIn1417627087drop_a @ n @ ( listIn1312259492pend_a @ xs @ f ) )
     != ( listIn1312259492pend_a @ ( drop_a @ n @ xs ) @ f ) )
    | ( ( ord_less_nat @ n @ ( size_size_list_a @ xs ) )
     != $true ) ),
    inference(cnf_transformation,[],[f841]) ).

thf(f1088,plain,
    ( ( ( listIn1417627087drop_a @ n @ ( listIn1312259492pend_a @ xs @ f ) )
     != ( listIn1417627087drop_a @ ( minus_minus_nat @ n @ ( size_size_list_a @ xs ) ) @ f ) )
    | ( ( ord_less_nat @ n @ ( size_size_list_a @ xs ) )
      = $true ) ),
    inference(cnf_transformation,[],[f841]) ).

thf(f1230,plain,
    ! [X0: nat,X1: nat] :
      ( ( ( ord_less_eq_nat @ X1 @ X0 )
        = $true )
      | ( ( ord_less_nat @ X0 @ X1 )
        = $true ) ),
    inference(cnf_transformation,[],[f862]) ).

thf(f1246,plain,
    ! [X2: nat > a,X0: nat,X1: list_a] :
      ( ( ( listIn1417627087drop_a @ X0 @ ( listIn1312259492pend_a @ X1 @ X2 ) )
        = ( listIn1417627087drop_a @ ( minus_minus_nat @ X0 @ ( size_size_list_a @ X1 ) ) @ X2 ) )
      | ( ( ord_less_eq_nat @ ( size_size_list_a @ X1 ) @ X0 )
       != $true ) ),
    inference(cnf_transformation,[],[f1051]) ).

thf(f1264,plain,
    ! [X2: list_a,X0: nat,X1: nat > a] :
      ( ( ( listIn1312259492pend_a @ ( drop_a @ X0 @ X2 ) @ X1 )
        = ( listIn1417627087drop_a @ X0 @ ( listIn1312259492pend_a @ X2 @ X1 ) ) )
      | ( $true
       != ( ord_less_eq_nat @ X0 @ ( size_size_list_a @ X2 ) ) ) ),
    inference(cnf_transformation,[],[f1061]) ).

thf(f1318,definition,
    ( spl63_1
  <=> ( ( ord_less_nat @ n @ ( size_size_list_a @ xs ) )
      = $true ) ),
    introduced(definition,[new_symbols(definition,[spl63_1])],[avatar_definition]) ).

thf(f1320,plain,
    ( ( ( ord_less_nat @ n @ ( size_size_list_a @ xs ) )
     != $true )
    | spl63_1 ),
    inference(avatar_component_clause,[],[f1318]) ).

thf(f1322,definition,
    ( spl63_2
  <=> ( ( listIn1417627087drop_a @ n @ ( listIn1312259492pend_a @ xs @ f ) )
      = ( listIn1312259492pend_a @ ( drop_a @ n @ xs ) @ f ) ) ),
    introduced(definition,[new_symbols(definition,[spl63_2])],[avatar_definition]) ).

thf(f1324,plain,
    ( ( ( listIn1417627087drop_a @ n @ ( listIn1312259492pend_a @ xs @ f ) )
     != ( listIn1312259492pend_a @ ( drop_a @ n @ xs ) @ f ) )
    | spl63_2 ),
    inference(avatar_component_clause,[],[f1322]) ).

thf(f1325,plain,
    ( ~ spl63_1
    | ~ spl63_2 ),
    inference(avatar_split_clause,[],[f1087,f1322,f1318]) ).

thf(f1327,definition,
    ( spl63_3
  <=> ( ( listIn1417627087drop_a @ n @ ( listIn1312259492pend_a @ xs @ f ) )
      = ( listIn1417627087drop_a @ ( minus_minus_nat @ n @ ( size_size_list_a @ xs ) ) @ f ) ) ),
    introduced(definition,[new_symbols(definition,[spl63_3])],[avatar_definition]) ).

thf(f1329,plain,
    ( ( ( listIn1417627087drop_a @ n @ ( listIn1312259492pend_a @ xs @ f ) )
     != ( listIn1417627087drop_a @ ( minus_minus_nat @ n @ ( size_size_list_a @ xs ) ) @ f ) )
    | spl63_3 ),
    inference(avatar_component_clause,[],[f1327]) ).

thf(f1331,plain,
    ( ~ spl63_3
    | spl63_1 ),
    inference(avatar_split_clause,[],[f1088,f1318,f1327]) ).

thf(f1333,plain,
    ( ( ( listIn1417627087drop_a @ n @ ( listIn1312259492pend_a @ xs @ f ) )
     != ( listIn1417627087drop_a @ n @ ( listIn1312259492pend_a @ xs @ f ) ) )
    | ( $true
     != ( ord_less_eq_nat @ n @ ( size_size_list_a @ xs ) ) )
    | spl63_2 ),
    inference(superposition,[],[f1324,f1264]) ).

thf(f1334,plain,
    ( ( $true
     != ( ord_less_eq_nat @ n @ ( size_size_list_a @ xs ) ) )
    | spl63_2 ),
    inference(trivial_inequality_removal,[],[f1333]) ).

thf(f1336,plain,
    ( ( ( listIn1417627087drop_a @ ( minus_minus_nat @ n @ ( size_size_list_a @ xs ) ) @ f )
     != ( listIn1417627087drop_a @ ( minus_minus_nat @ n @ ( size_size_list_a @ xs ) ) @ f ) )
    | ( $true
     != ( ord_less_eq_nat @ ( size_size_list_a @ xs ) @ n ) )
    | spl63_3 ),
    inference(superposition,[],[f1329,f1246]) ).

thf(f1337,plain,
    ( ( $true
     != ( ord_less_eq_nat @ ( size_size_list_a @ xs ) @ n ) )
    | spl63_3 ),
    inference(trivial_inequality_removal,[],[f1336]) ).

thf(f1338,plain,
    ( ( ( ord_less_nat @ n @ ( size_size_list_a @ xs ) )
     != $true )
    | ( $true != $true )
    | spl63_2 ),
    inference(superposition,[],[f1334,f1075]) ).

thf(f1361,plain,
    ( ( ( ord_less_nat @ n @ ( size_size_list_a @ xs ) )
     != $true )
    | spl63_2 ),
    inference(trivial_inequality_removal,[],[f1338]) ).

thf(f1374,plain,
    ( ~ spl63_1
    | spl63_2 ),
    inference(avatar_split_clause,[],[f1361,f1322,f1318]) ).

thf(f1444,plain,
    ( ( $true != $true )
    | ( ( ord_less_nat @ n @ ( size_size_list_a @ xs ) )
      = $true )
    | spl63_3 ),
    inference(superposition,[],[f1337,f1230]) ).

thf(f1465,plain,
    ( ( ( ord_less_nat @ n @ ( size_size_list_a @ xs ) )
      = $true )
    | spl63_3 ),
    inference(trivial_inequality_removal,[],[f1444]) ).

thf(f1486,plain,
    ( $false
    | spl63_1
    | spl63_3 ),
    inference(forward_subsumption_resolution,[],[f1465,f1320]) ).

thf(f1487,plain,
    ( spl63_1
    | spl63_3 ),
    inference(avatar_contradiction_clause,[],[f1486]) ).

cnf(s1,plain,
    ( ~ spl63_1
    | ~ spl63_2 ),
    inference(sat_conversion,[],[f1325]) ).

cnf(s3,plain,
    ( spl63_1
    | ~ spl63_3 ),
    inference(sat_conversion,[],[f1331]) ).

cnf(s6,plain,
    ( ~ spl63_1
    | spl63_2 ),
    inference(sat_conversion,[],[f1374]) ).

cnf(s30,plain,
    ( spl63_1
    | spl63_3 ),
    inference(sat_conversion,[],[f1487]) ).

cnf(s31,plain,
    spl63_1,
    inference(rat,[],[s3,s30]) ).

cnf(s32,plain,
    spl63_2,
    inference(rat,[],[s6,s31]) ).

cnf(s33,plain,
    $false,
    inference(rat,[],[s1,s32,s31]) ).

thf(f1488,plain,
    $false,
    inference(avatar_sat_refutation,[],[s33]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : ITP099^1 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.17  % Computer : n009.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 19:53:30 UTC 2026
% 0.08/0.17  % CPUTime  : 
% 0.08/0.17  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.20  Running higher-order theorem proving
% 0.08/0.24  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.70/0.37  % (273378)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.70/0.37  % (273387)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=225258676:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.70/0.37  % (273389)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.70/0.37  % (273389)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.70/0.37  % (273383)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=714775727:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.70/0.37  % (273384)lrs+10_16_si=on:nwc=1.5:random_seed=3538577279:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.70/0.37  % (273387)Instruction limit reached! 
% 0.70/0.37  % (273387)------------------------------
% 0.70/0.37  % (273387)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.70/0.37  % (273387)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.70/0.37  % (273385)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=247443345:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.70/0.37  % (273387)CaDiCaL version: 2.1.3
% 0.70/0.37  % (273387)Termination reason: Instruction limit
% 0.70/0.37  % (273387)Termination phase: Preprocessing 1
% 0.70/0.37  % (273387)Time elapsed: 0.007 s
% 0.70/0.37  % (273387)Peak memory usage: 10 MB
% 0.70/0.37  % (273387)Instructions burned: 29 (million)
% 0.70/0.37  % (273388)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=576252978:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.70/0.37  % (273386)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=2016649134: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.70/0.37  % (273389)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=2269076604:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.70/0.37  % (273385)Instruction limit reached! 
% 0.70/0.37  % (273385)------------------------------
% 0.70/0.37  % (273385)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.70/0.37  % (273385)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.70/0.37  % (273385)CaDiCaL version: 2.1.3
% 0.70/0.37  % (273385)Termination reason: Instruction limit
% 0.70/0.37  % (273385)Termination phase: shuffling
% 0.70/0.37  % (273385)Time elapsed: 0.002 s
% 0.70/0.37  % (273385)Peak memory usage: 10 MB
% 0.70/0.37  % (273385)Instructions burned: 4 (million)
% 0.70/0.37  % (273384)Instruction limit reached! 
% 0.70/0.37  % (273384)------------------------------
% 0.70/0.37  % (273384)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.70/0.37  % (273384)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.70/0.37  % (273384)CaDiCaL version: 2.1.3
% 0.70/0.37  % (273384)Termination reason: Instruction limit
% 0.70/0.37  % (273384)Termination phase: Property scanning
% 0.70/0.37  % (273384)Time elapsed: 0.009 s
% 0.70/0.37  % (273384)Peak memory usage: 10 MB
% 0.70/0.37  % (273384)Instructions burned: 20 (million)
% 0.70/0.37  % (273396)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=735327057:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.70/0.37  % (273396)Instruction limit reached! 
% 0.70/0.37  % (273396)------------------------------
% 0.70/0.37  % (273396)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.70/0.37  % (273396)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.70/0.37  % (273396)CaDiCaL version: 2.1.3
% 0.70/0.37  % (273396)Termination reason: Instruction limit
% 0.70/0.37  % (273396)Termination phase: shuffling
% 0.70/0.37  % (273396)Time elapsed: 0.003 s
% 0.70/0.37  % (273396)Peak memory usage: 10 MB
% 0.70/0.37  % (273396)Instructions burned: 15 (million)
% 0.70/0.37  % (273398)lrs+1010_2:3_cha=on:si=on:uwa=off:nwc=1:random_seed=4032213872:i=5:fgj=on:av=off:rtra=on:fe=axiom:ntd=on_2999 on theBenchmark for (2999ds/5Mi)
% 0.70/0.37  % (273399)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(5) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.70/0.41  % (273398)Instruction limit reached! 
% 0.70/0.41  % (273398)------------------------------
% 0.70/0.41  % (273398)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.70/0.41  % (273398)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.70/0.41  % (273398)CaDiCaL version: 2.1.3
% 0.70/0.41  % (273398)Termination reason: Instruction limit
% 0.70/0.41  % (273398)Termination phase: shuffling
% 0.70/0.41  % (273398)Time elapsed: 0.003 s
% 0.70/0.41  % (273398)Peak memory usage: 10 MB
% 0.70/0.41  % (273398)Instructions burned: 6 (million)
% 0.70/0.41  % (273401)lrs+10_1_sil=128000:si=on:urr=on:slsqc=1:slsq=on:random_seed=2505295763:i=12:s2at=2:kws=inv_frequency:bd=all:rtra=on_2999 on theBenchmark for (2999ds/12Mi)
% 0.70/0.41  % (273399)dis+21_1_to=kbo:sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:plsqr=64,1:uwa=hol:random_seed=2372334196:uwa_fpi=on:i=7:fgj=on:hud=10:fsr=off:rtra=on:rawr=on:fsdmm=5_2999 on theBenchmark for (2999ds/7Mi)
% 0.70/0.41  % (273401)Instruction limit reached! 
% 0.70/0.41  % (273401)------------------------------
% 0.70/0.41  % (273401)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.70/0.41  % (273401)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.70/0.41  % (273401)CaDiCaL version: 2.1.3
% 0.70/0.41  % (273401)Termination reason: Instruction limit
% 0.70/0.41  % (273401)Termination phase: shuffling
% 0.70/0.41  % (273401)Time elapsed: 0.003 s
% 0.70/0.41  % (273401)Peak memory usage: 10 MB
% 0.70/0.41  % (273401)Instructions burned: 13 (million)
% 0.70/0.41  % (273399)Instruction limit reached! 
% 0.70/0.41  % (273399)------------------------------
% 0.70/0.41  % (273399)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.70/0.41  % (273399)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.70/0.41  % (273399)CaDiCaL version: 2.1.3
% 0.70/0.41  % (273399)Termination reason: Instruction limit
% 0.70/0.41  % (273399)Termination phase: shuffling
% 0.70/0.41  % (273399)Time elapsed: 0.004 s
% 0.70/0.41  % (273399)Peak memory usage: 10 MB
% 0.70/0.41  % (273399)Instructions burned: 8 (million)
% 0.70/0.41  % (273388)Instruction limit reached! 
% 0.70/0.41  % (273388)------------------------------
% 0.70/0.41  % (273388)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.70/0.41  % (273388)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.70/0.41  % (273388)CaDiCaL version: 2.1.3
% 0.70/0.41  % (273388)Termination reason: Instruction limit
% 0.70/0.41  % (273388)Termination phase: Property scanning
% 0.70/0.41  % (273388)Time elapsed: 0.034 s
% 0.70/0.41  % (273388)Peak memory usage: 12 MB
% 0.70/0.41  % (273388)Instructions burned: 77 (million)
% 0.70/0.41  % (273383)Instruction limit reached! 
% 0.70/0.41  % (273383)------------------------------
% 0.70/0.41  % (273383)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.70/0.41  % (273383)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.70/0.41  % (273383)CaDiCaL version: 2.1.3
% 0.70/0.41  % (273383)Termination reason: Instruction limit
% 0.70/0.41  % (273383)Termination phase: Property scanning
% 0.70/0.41  % (273383)Time elapsed: 0.038 s
% 0.70/0.41  % (273383)Peak memory usage: 12 MB
% 0.70/0.41  % (273383)Instructions burned: 89 (million)
% 0.70/0.41  % (273406)lrs+1002_64_sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:sp=occurrence:lma=off:plsqr=32,1:uwa=interpreted_only:random_seed=2083925334:i=86:piset=equals:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/86Mi)
% 0.70/0.41  % (273404)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.70/0.41  % (273404)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(1) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.70/0.41  % (273404)ott+1010_64_tgt=ground:cnfonf=lazy_simp:si=on:lma=off:spb=goal:lcm=predicate:random_seed=2701197807: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.70/0.41  % (273408)WARNING Broken Constraint: if positive_literal_split_queue_ratios(1,32) has been set then positive_literal_split_queue(off) is equal to on
% 0.70/0.41  % (273408)ott+1002_20_sil=128000:cnfonf=lazy_not_gen_be_off:si=on:sp=unary_frequency:plsqr=1,32:bce=on:uwa=interpreted_only:foolp=on:random_seed=455904128:i=2:add=on:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.70/0.42  % (273409)lrs+1002_3:1_sil=128000:e2e=on:si=on:urr=on:uwa=one_side_constant:nwc=1.5:random_seed=323152467:i=38:bd=all:rtra=on:amm=off:ss=axioms:ntd=on_2999 on theBenchmark for (2999ds/38Mi)
% 0.70/0.42  % (273408)Instruction limit reached! 
% 0.70/0.42  % (273408)------------------------------
% 0.70/0.42  % (273408)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.70/0.42  % (273408)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.70/0.42  % (273408)CaDiCaL version: 2.1.3
% 0.70/0.42  % (273408)Termination reason: Instruction limit
% 0.70/0.42  % (273408)Termination phase: shuffling
% 0.70/0.42  % (273408)Time elapsed: 0.003 s
% 0.70/0.42  % (273408)Peak memory usage: 10 MB
% 0.70/0.42  % (273408)Instructions burned: 6 (million)
% 0.70/0.42  % (273406)Instruction limit reached! 
% 0.70/0.42  % (273406)------------------------------
% 0.70/0.42  % (273406)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.70/0.42  % (273406)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.70/0.42  % (273406)CaDiCaL version: 2.1.3
% 0.70/0.42  % (273406)Termination reason: Instruction limit
% 0.70/0.42  % (273406)Termination phase: Function definition elimination
% 0.70/0.42  % (273406)Time elapsed: 0.020 s
% 0.70/0.42  % (273406)Peak memory usage: 11 MB
% 0.70/0.42  % (273406)Instructions burned: 90 (million)
% 0.70/0.42  % (273404)Instruction limit reached! 
% 0.70/0.42  % (273404)------------------------------
% 0.70/0.42  % (273404)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.70/0.42  % (273404)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.70/0.42  % (273404)CaDiCaL version: 2.1.3
% 0.70/0.42  % (273404)Termination reason: Instruction limit
% 0.70/0.42  % (273404)Termination phase: Property scanning
% 0.70/0.42  % (273404)Time elapsed: 0.014 s
% 0.70/0.42  % (273404)Peak memory usage: 10 MB
% 0.70/0.42  % (273404)Instructions burned: 30 (million)
% 0.70/0.42  % (273407)lrs+10_1_si=on:cs=on:random_seed=861773668:i=8:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/8Mi)
% 0.70/0.42  % (273389)Instruction limit reached! 
% 0.70/0.42  % (273389)------------------------------
% 0.70/0.42  % (273389)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.70/0.42  % (273389)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.70/0.42  % (273389)CaDiCaL version: 2.1.3
% 0.70/0.42  % (273389)Termination reason: Instruction limit
% 0.70/0.42  % (273389)Termination phase: Saturation
% 0.70/0.42  % (273389)Time elapsed: 0.072 s
% 0.70/0.42  % (273389)Peak memory usage: 14 MB
% 0.70/0.42  % (273389)Instructions burned: 158 (million)
% 0.70/0.42  % (273416)lrs+10_16:1_sil=128000:si=on:lma=off:urr=on:uwa=interpreted_only:random_seed=673997280:i=14:kws=precedence:aac=none:nm=10:rtra=on:er=filter:ntd=on_2998 on theBenchmark for (2998ds/14Mi)
% 0.70/0.42  % (273407)Instruction limit reached! 
% 0.70/0.42  % (273407)------------------------------
% 0.70/0.42  % (273407)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.70/0.42  % (273407)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.70/0.42  % (273407)CaDiCaL version: 2.1.3
% 0.70/0.42  % (273407)Termination reason: Instruction limit
% 0.70/0.42  % (273407)Termination phase: shuffling
% 0.70/0.42  % (273407)Time elapsed: 0.008 s
% 0.70/0.42  % (273407)Peak memory usage: 10 MB
% 0.70/0.42  % (273407)Instructions burned: 9 (million)
% 0.70/0.42  % (273409)Instruction limit reached! 
% 0.70/0.42  % (273409)------------------------------
% 0.70/0.42  % (273409)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.70/0.42  % (273409)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.70/0.42  % (273409)CaDiCaL version: 2.1.3
% 0.70/0.42  % (273409)Termination reason: Instruction limit
% 0.70/0.42  % (273409)Termination phase: Preprocessing 3
% 0.70/0.42  % (273409)Time elapsed: 0.019 s
% 0.70/0.42  % (273409)Peak memory usage: 11 MB
% 0.70/0.42  % (273409)Instructions burned: 41 (million)
% 0.70/0.42  % (273416)Instruction limit reached! 
% 0.70/0.42  % (273416)------------------------------
% 0.70/0.42  % (273416)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.70/0.42  % (273414)lrs+1002_1_to=lpo:sil=128000:si=on:sos=on:spb=goal_then_units:uwa=off:random_seed=3987538953:st=2:i=249:sd=1:rtra=on:ss=axioms_2999 on theBenchmark for (2999ds/249Mi)
% 0.70/0.42  % (273416)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.70/0.42  % (273416)CaDiCaL version: 2.1.3
% 0.70/0.42  % (273416)Termination reason: Instruction limit
% 0.70/0.42  % (273416)Termination phase: Property scanning
% 0.70/0.42  % (273416)Time elapsed: 0.004 s
% 0.70/0.42  % (273416)Peak memory usage: 10 MB
% 0.70/0.42  % (273416)Instructions burned: 18 (million)
% 0.70/0.42  % (273415)dis+1002_1_sil=128000:fde=unused:e2e=on:si=on:cbe=off:uwa=off:random_seed=580617462:hsq=on:st=2:i=25:kws=inv_frequency:rtra=on:ss=axioms:ntd=on_2998 on theBenchmark for (2998ds/25Mi)
% 0.70/0.42  % (273423)ott+1004_1_sil=128000:cnfonf=lazy_pi_sigma_gen:si=on:sp=unary_frequency:cbe=off:uwa=off:nwc=1:random_seed=435895201:i=26:ep=R:rtra=on:ntd=on_2998 on theBenchmark for (2998ds/26Mi)
% 0.70/0.42  % (273418)dis+1010_1_sil=128000:si=on:uwa=off:random_seed=3114663877:st=3:s2a=on:i=327:sd=3:rtra=on:ss=axioms_2998 on theBenchmark for (2998ds/327Mi)
% 0.70/0.42  % (273415)Instruction limit reached! 
% 0.70/0.42  % (273415)------------------------------
% 0.70/0.42  % (273415)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.70/0.42  % (273415)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.70/0.42  % (273415)CaDiCaL version: 2.1.3
% 0.70/0.42  % (273415)Termination reason: Instruction limit
% 0.70/0.42  % (273415)Termination phase: Property scanning
% 0.70/0.42  % (273415)Time elapsed: 0.011 s
% 0.70/0.42  % (273415)Peak memory usage: 10 MB
% 0.70/0.42  % (273415)Instructions burned: 25 (million)
% 0.70/0.42  % (273420)dis+10_1_anc=all_dependent:to=kbo:sil=128000:si=on:chr=on:random_seed=4237157279:uwa_fpi=on:i=14:aac=none:rtra=on:fe=abstraction_2998 on theBenchmark for (2998ds/14Mi)
% 0.70/0.42  % (273423)Instruction limit reached! 
% 0.70/0.42  % (273423)------------------------------
% 0.70/0.42  % (273423)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.70/0.42  % (273423)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.70/0.42  % (273423)CaDiCaL version: 2.1.3
% 0.70/0.42  % (273423)Termination reason: Instruction limit
% 0.70/0.42  % (273423)Termination phase: shuffling
% 0.70/0.42  % (273423)Time elapsed: 0.006 s
% 0.70/0.42  % (273423)Peak memory usage: 10 MB
% 0.70/0.42  % (273423)Instructions burned: 26 (million)
% 0.70/0.42  % (273421)ott+21_20_to=lpo:sil=128000:tgt=ground:si=on:sp=arity:lma=off:uwa=off:foolp=on:random_seed=1658045385:st=4:i=2:add=off:sd=3:nm=16:fsr=off:rtra=on:ss=axioms:sgt=8:ntd=on_2998 on theBenchmark for (2998ds/2Mi)
% 0.70/0.42  % (273421)Instruction limit reached! 
% 0.70/0.42  % (273421)------------------------------
% 0.70/0.42  % (273421)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.70/0.42  % (273421)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.70/0.42  % (273421)CaDiCaL version: 2.1.3
% 0.70/0.42  % (273421)Termination reason: Instruction limit
% 0.70/0.42  % (273421)Termination phase: shuffling
% 0.70/0.42  % (273421)Time elapsed: 0.003 s
% 0.70/0.42  % (273421)Peak memory usage: 10 MB
% 0.70/0.42  % (273421)Instructions burned: 7 (million)
% 0.70/0.42  % (273420)Instruction limit reached! 
% 0.70/0.42  % (273420)------------------------------
% 0.70/0.42  % (273420)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.70/0.42  % (273420)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.70/0.42  % (273420)CaDiCaL version: 2.1.3
% 0.70/0.42  % (273420)Termination reason: Instruction limit
% 0.70/0.42  % (273420)Termination phase: shuffling
% 0.70/0.42  % (273420)Time elapsed: 0.007 s
% 0.70/0.42  % (273420)Peak memory usage: 10 MB
% 0.70/0.42  % (273420)Instructions burned: 15 (million)
% 0.70/0.42  % (273429)lrs+1002_1024_sil=128000:tgt=ground:fde=none:e2e=on:si=on:uwa=off:nwc=1:random_seed=972055754:cond=on:i=60:rtra=on:ntd=on_2998 on theBenchmark for (2998ds/60Mi)
% 0.70/0.42  % (273428)dis+1002_16_sil=128000:si=on:sp=occurrence:random_seed=1863525562:cond=fast:i=23:hud=1:av=off:rtra=on:fe=abstraction:ntd=on_2998 on theBenchmark for (2998ds/23Mi)
% 0.70/0.42  % (273431)WARNING Broken Constraint: if sine_to_age_generality_threshold(10) 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.70/0.42  % (273431)WARNING Broken Constraint: if lrs_weight_limit_only(on) has been set then saturation_algorithm(otter) is equal to lrs
% 0.70/0.42  % (273432)WARNING Broken Constraint: if choice_reasoning(on) has been set then choice_ax(on) is equal to off
% 0.70/0.42  % (273414) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-273378-273414"...
% 0.70/0.42  % (273431)ott+21_1_to=kbo:sil=128000:cnfonf=lazy_gen:bsd=on:si=on:sp=const_frequency:lma=off:uwa=off:foolp=on:s2agt=10:lwlo=on:random_seed=51043301:i=14:add=off:nm=40:rtra=on:rawr=on_2998 on theBenchmark for (2998ds/14Mi)
% 0.70/0.42  % (273432)lrs+1010_4:1_slsqr=8,1:to=kbo:cha=on:drc=off:si=on:sp=arity:lcm=predicate:uwa=off:fd=preordered:gs=on:nwc=5:s2agt=32:slsqc=1:kmz=on:updr=off:chr=on:pe=on:slsq=on:random_seed=1790566088:i=8:nm=2:rtra=on:fe=abstraction:inj=on_2998 on theBenchmark for (2998ds/8Mi)
% 0.70/0.42  % (273429)Instruction limit reached! 
% 0.70/0.42  % (273429)------------------------------
% 0.70/0.42  % (273429)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.70/0.42  % (273429)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.70/0.42  % (273429)CaDiCaL version: 2.1.3
% 0.70/0.42  % (273429)Termination reason: Instruction limit
% 0.70/0.42  % (273429)Termination phase: Property scanning
% 0.70/0.42  % (273429)Time elapsed: 0.014 s
% 0.70/0.42  % (273429)Peak memory usage: 12 MB
% 0.70/0.42  % (273429)Instructions burned: 63 (million)
% 0.70/0.42  % (273414)...printing done.
% 0.70/0.42  % (273414)Refutation found. Thanks to Tanya!
% 0.70/0.42  % SZS status Theorem for theBenchmark
% 0.70/0.42  % SZS output start Proof for theBenchmark
% See solution above
% 0.70/0.42  % (273414)------------------------------
% 0.70/0.42  % (273414)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.70/0.42  % (273414)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.70/0.42  % (273414)CaDiCaL version: 2.1.3
% 0.70/0.42  % (273414)Termination reason: Refutation
% 0.70/0.42  % (273414)Time elapsed: 0.040 s
% 0.70/0.42  % (273414)Peak memory usage: 14 MB
% 0.70/0.42  % (273414)Instructions burned: 84 (million)
% 0.70/0.42  % (273378)Success in time 0.163 s
% 0.70/0.42  % Vampire exiting
%------------------------------------------------------------------------------