↑ Up

Vampire-SAT---5.0.1.THM-Ref.s

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

% Computer : n007.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:10:42 AM UTC 2026

% Result   : Theorem 109.45s 20.24s
% Output   : Refutation 109.45s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   53 (  28 unt;   0 typ;   1 def)
%            Number of atoms       :  169 (  92 equ;   0 cnn)
%            Maximal formula atoms :    5 (   3 avg)
%            Number of connectives :  526 (  27   ~;  29   |;  10   &; 453   @)
%                                         (   1 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :   18 (  17 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :  331 ( 328 usr;   7 con; 0-4 aty)
%            Number of variables   :   90 (   0 sgn  66   !;   0   ?;  90   :)

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

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

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

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

thf(type_def_9,type,
    list_set_list_a: $tType ).

thf(type_def_10,type,
    list_list_nat: $tType ).

thf(type_def_11,type,
    set_list_nat: $tType ).

thf(type_def_12,type,
    list_set_nat: $tType ).

thf(type_def_13,type,
    list_list_a: $tType ).

thf(type_def_14,type,
    set_list_a: $tType ).

thf(type_def_15,type,
    list_set_a: $tType ).

thf(type_def_16,type,
    list_nat: $tType ).

thf(type_def_17,type,
    set_nat: $tType ).

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

thf(type_def_19,type,
    set_a: $tType ).

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

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

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

thf(func_def_0,type,
    f_image_list_list_a: list_list_list_a > set_nat > set_list_list_a ).

thf(func_def_1,type,
    f_image_list_nat: list_list_nat > set_nat > set_list_nat ).

thf(func_def_2,type,
    f_image_list_a: list_list_a > set_nat > set_list_a ).

thf(func_def_3,type,
    f_image_nat: list_nat > set_nat > set_nat ).

thf(func_def_4,type,
    f_image_a: list_a > set_nat > set_a ).

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

thf(func_def_6,type,
    list_asc_set_list_a: list_set_list_a > $o ).

thf(func_def_7,type,
    list_asc_set_nat: list_set_nat > $o ).

thf(func_def_8,type,
    list_asc_set_a: list_set_a > $o ).

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

thf(func_def_10,type,
    list_desc_set_list_a: list_set_list_a > $o ).

thf(func_def_11,type,
    list_desc_set_nat: list_set_nat > $o ).

thf(func_def_12,type,
    list_desc_set_a: list_set_a > $o ).

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

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

thf(func_def_15,type,
    listSl769338732list_a: list_list_list_a > nat > list_l2071841302list_a ).

thf(func_def_16,type,
    listSl2099749758st_nat: list_list_nat > nat > list_list_list_nat ).

thf(func_def_17,type,
    listSl703198822list_a: list_list_a > nat > list_list_list_a ).

thf(func_def_18,type,
    listSl882585454e2_nat: list_nat > nat > list_list_nat ).

thf(func_def_19,type,
    listSl1174287072ice2_a: list_a > nat > list_list_a ).

thf(func_def_20,type,
    listSl2102238196list_a: list_list_list_a > nat > list_l2071841302list_a ).

thf(func_def_21,type,
    listSl729562870st_nat: list_list_nat > nat > list_list_list_nat ).

thf(func_def_22,type,
    listSl162220270list_a: list_list_a > nat > list_list_list_a ).

thf(func_def_23,type,
    listSl1630398182ce_nat: list_nat > nat > list_list_nat ).

thf(func_def_24,type,
    listSl97544552lice_a: list_a > nat > list_list_a ).

thf(func_def_25,type,
    listSl902632890list_a: list_list_list_a > nat > nat > list_l2071841302list_a ).

thf(func_def_26,type,
    listSl1506485424st_nat: list_list_nat > nat > nat > list_list_list_nat ).

thf(func_def_27,type,
    listSl856612276list_a: list_list_a > nat > nat > list_list_list_a ).

thf(func_def_28,type,
    listSl1794011552ux_nat: list_nat > nat > nat > list_list_nat ).

thf(func_def_29,type,
    listSl1495374126_aux_a: list_a > nat > nat > list_list_a ).

thf(func_def_30,type,
    butlast_list_list_a: list_list_list_a > list_list_list_a ).

thf(func_def_31,type,
    butlast_list_nat: list_list_nat > list_list_nat ).

thf(func_def_32,type,
    butlast_list_a: list_list_a > list_list_a ).

thf(func_def_33,type,
    butlast_nat: list_nat > list_nat ).

thf(func_def_34,type,
    butlast_a: list_a > list_a ).

thf(func_def_35,type,
    distinct_list_list_a: list_list_list_a > $o ).

thf(func_def_36,type,
    distinct_list_nat: list_list_nat > $o ).

thf(func_def_37,type,
    distinct_list_a: list_list_a > $o ).

thf(func_def_38,type,
    distinct_nat: list_nat > $o ).

thf(func_def_39,type,
    distinct_a: list_a > $o ).

thf(func_def_40,type,
    set_list_list_a2: list_list_list_a > set_list_list_a ).

thf(func_def_41,type,
    set_list_nat2: list_list_nat > set_list_nat ).

thf(func_def_42,type,
    set_list_a2: list_list_a > set_list_a ).

thf(func_def_43,type,
    set_nat2: list_nat > set_nat ).

thf(func_def_44,type,
    set_a2: list_a > set_a ).

thf(func_def_45,type,
    list_ex_list_list_a: ( list_list_a > $o ) > list_list_list_a > $o ).

thf(func_def_46,type,
    list_ex_list_nat: ( list_nat > $o ) > list_list_nat > $o ).

thf(func_def_47,type,
    list_ex_list_a: ( list_a > $o ) > list_list_a > $o ).

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

thf(func_def_49,type,
    list_ex_a: ( a > $o ) > list_a > $o ).

thf(func_def_50,type,
    list_u1330012152list_a: list_list_list_a > nat > list_list_a > list_list_list_a ).

thf(func_def_51,type,
    list_update_list_nat: list_list_nat > nat > list_nat > list_list_nat ).

thf(func_def_52,type,
    list_update_list_a: list_list_a > nat > list_a > list_list_a ).

thf(func_def_53,type,
    list_update_nat: list_nat > nat > nat > list_nat ).

thf(func_def_54,type,
    list_update_a: list_a > nat > a > list_a ).

thf(func_def_55,type,
    nth_list_list_list_a: list_l2071841302list_a > nat > list_list_list_a ).

thf(func_def_56,type,
    nth_list_list_nat: list_list_list_nat > nat > list_list_nat ).

thf(func_def_57,type,
    nth_list_list_a: list_list_list_a > nat > list_list_a ).

thf(func_def_58,type,
    nth_list_nat: list_list_nat > nat > list_nat ).

thf(func_def_59,type,
    nth_list_a: list_list_a > nat > list_a ).

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

thf(func_def_61,type,
    nth_set_list_a: list_set_list_a > nat > set_list_a ).

thf(func_def_62,type,
    nth_set_nat: list_set_nat > nat > set_nat ).

thf(func_def_63,type,
    nth_set_a: list_set_a > nat > set_a ).

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

thf(func_def_65,type,
    size_s1764310658list_a: list_l2071841302list_a > nat ).

thf(func_def_66,type,
    size_s1321307156st_nat: list_list_list_nat > nat ).

thf(func_def_67,type,
    size_s575106428list_a: list_list_list_a > nat ).

thf(func_def_68,type,
    size_s1898481668st_nat: list_list_nat > nat ).

thf(func_def_69,type,
    size_s1427607542list_a: list_list_a > nat ).

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

thf(func_def_71,type,
    size_s1635937238list_a: list_set_list_a > nat ).

thf(func_def_72,type,
    size_s577819178et_nat: list_set_nat > nat ).

thf(func_def_73,type,
    size_size_list_set_a: list_set_a > nat ).

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

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

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

thf(func_def_77,type,
    ord_le1756736906list_a: set_list_list_a > set_list_list_a > $o ).

thf(func_def_78,type,
    ord_le1747345782st_nat: set_list_nat > set_list_nat > $o ).

thf(func_def_79,type,
    ord_le1301786372list_a: set_list_a > set_list_a > $o ).

thf(func_def_80,type,
    ord_less_eq_set_nat: set_nat > set_nat > $o ).

thf(func_def_81,type,
    ord_less_eq_set_a: set_a > set_a > $o ).

thf(func_def_82,type,
    top_top_set_nat: set_nat ).

thf(func_def_83,type,
    divide_divide_nat: nat > nat > nat ).

thf(func_def_84,type,
    collect_list_a: ( list_a > $o ) > set_list_a ).

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

thf(func_def_86,type,
    collect_a: ( a > $o ) > set_a ).

thf(func_def_87,type,
    member_list_list_a: list_list_a > set_list_list_a > $o ).

thf(func_def_88,type,
    member_list_nat: list_nat > set_list_nat > $o ).

thf(func_def_89,type,
    member_list_a: list_a > set_list_a > $o ).

thf(func_def_90,type,
    member_nat: nat > set_nat > $o ).

thf(func_def_91,type,
    member_a: a > set_a > $o ).

thf(func_def_92,type,
    k: nat ).

thf(func_def_93,type,
    m: nat ).

thf(func_def_94,type,
    xs: list_a ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

thf(func_def_112,type,
    sK3: list_list_nat > list_list_nat > nat ).

thf(func_def_113,type,
    sK4: list_list_list_a > list_list_list_a > nat ).

thf(func_def_114,type,
    sK5: list_nat > list_nat > nat ).

thf(func_def_115,type,
    sK6: list_list_a > list_list_a > nat ).

thf(func_def_116,type,
    sK7: list_a > list_a > nat ).

thf(func_def_117,type,
    sK8: ( list_list_nat > $o ) > list_list_nat ).

thf(func_def_118,type,
    sK9: ( list_list_list_a > $o ) > list_list_list_a ).

thf(func_def_119,type,
    sK10: ( list_list_a > $o ) > list_list_a ).

thf(func_def_120,type,
    sK11: ( list_nat > $o ) > list_nat ).

thf(func_def_121,type,
    sK12: ( list_a > $o ) > list_a ).

thf(func_def_122,type,
    sK13: nat > list_list_nat ).

thf(func_def_123,type,
    sK14: nat > list_list_list_a ).

thf(func_def_124,type,
    sK15: nat > list_list_a ).

thf(func_def_125,type,
    sK16: nat > list_nat ).

thf(func_def_126,type,
    sK17: nat > list_a ).

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

thf(func_def_128,type,
    sK19: ( nat > $o ) > nat ).

thf(func_def_129,type,
    sK20: set_nat > list_list_nat > list_nat > nat ).

thf(func_def_130,type,
    sK21: set_nat > list_list_list_a > list_list_a > nat ).

thf(func_def_131,type,
    sK22: set_nat > list_a > a > nat ).

thf(func_def_132,type,
    sK23: set_nat > list_list_a > list_a > nat ).

thf(func_def_133,type,
    sK24: set_nat > list_nat > nat > nat ).

thf(func_def_134,type,
    sK25: list_list_nat > list_nat > nat ).

thf(func_def_135,type,
    sK26: list_list_list_a > list_list_a > nat ).

thf(func_def_136,type,
    sK27: list_a > a > nat ).

thf(func_def_137,type,
    sK28: list_list_a > list_a > nat ).

thf(func_def_138,type,
    sK29: list_nat > nat > nat ).

thf(func_def_139,type,
    sK30: set_list_nat > list_list_nat > set_nat > nat ).

thf(func_def_140,type,
    sK31: set_list_list_a > list_list_list_a > set_nat > nat ).

thf(func_def_141,type,
    sK32: set_a > list_a > set_nat > nat ).

thf(func_def_142,type,
    sK33: set_list_a > list_list_a > set_nat > nat ).

thf(func_def_143,type,
    sK34: set_nat > list_nat > set_nat > nat ).

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

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

thf(func_def_146,type,
    sK37: a > list_a > nat ).

thf(func_def_147,type,
    sK38: list_a > list_list_a > nat ).

thf(func_def_148,type,
    sK39: nat > list_nat > nat ).

thf(func_def_149,type,
    sK40: ( a > $o ) > list_a > nat ).

thf(func_def_150,type,
    sK41: ( list_a > $o ) > list_list_a > nat ).

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

thf(func_def_152,type,
    sK43: ( a > $o ) > list_a > a ).

thf(func_def_153,type,
    sK44: ( list_a > $o ) > list_list_a > list_a ).

thf(func_def_154,type,
    sK45: ( nat > $o ) > list_nat > nat ).

thf(func_def_155,type,
    sK46: set_nat > list_a > nat ).

thf(func_def_156,type,
    sK47: set_nat > list_list_a > nat ).

thf(func_def_157,type,
    sK48: set_nat > list_nat > nat ).

thf(func_def_158,type,
    sK49: ( nat > $o ) > nat ).

thf(func_def_159,type,
    sK50: nat > ( nat > $o ) > nat ).

thf(func_def_160,type,
    sK51: ( nat > nat > $o ) > nat ).

thf(func_def_161,type,
    sK52: ( nat > nat > $o ) > nat ).

thf(func_def_162,type,
    sK53: ( nat > nat > $o ) > nat ).

thf(func_def_163,type,
    sK54: ( nat > nat > $o ) > nat ).

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

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

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

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

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

thf(func_def_169,type,
    sK60: ( nat > nat ) > nat ).

thf(func_def_170,type,
    sK61: ( nat > nat ) > nat ).

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

thf(func_def_172,type,
    sK63: ( nat > nat ) > nat ).

thf(func_def_173,type,
    sK64: ( nat > nat ) > nat ).

thf(func_def_174,type,
    sK65: ( nat > nat ) > nat ).

thf(func_def_175,type,
    sK66: ( nat > nat ) > nat ).

thf(func_def_176,type,
    sK67: ( nat > nat ) > nat ).

thf(func_def_177,type,
    sK68: ( nat > nat ) > nat ).

thf(func_def_178,type,
    sK69: ( nat > nat ) > nat ).

thf(func_def_179,type,
    sK70: ( nat > nat ) > nat ).

thf(func_def_180,type,
    sK71: nat > nat ).

thf(func_def_181,type,
    sK72: ( nat > $o ) > nat ).

thf(func_def_182,type,
    sK73: ( nat > nat > $o ) > nat ).

thf(func_def_183,type,
    sK74: ( nat > nat > $o ) > nat ).

thf(func_def_184,type,
    sK75: ( nat > nat > $o ) > nat ).

thf(func_def_185,type,
    sK76: ( nat > nat > $o ) > nat ).

thf(func_def_186,type,
    sK77: ( nat > nat > $o ) > nat ).

thf(func_def_187,type,
    sK78: ( nat > nat ) > nat ).

thf(func_def_188,type,
    sK79: ( nat > nat ) > nat ).

thf(func_def_189,type,
    sK80: ( nat > nat ) > nat ).

thf(func_def_190,type,
    sK81: ( nat > nat ) > nat ).

thf(func_def_191,type,
    sK82: ( nat > nat ) > nat ).

thf(func_def_192,type,
    sK83: ( nat > nat ) > nat ).

thf(func_def_193,type,
    sK84: ( nat > nat ) > nat ).

thf(func_def_194,type,
    sK85: ( nat > nat ) > nat ).

thf(func_def_195,type,
    sK86: ( nat > $o ) > nat > nat ).

thf(func_def_196,type,
    sK87: ( nat > $o ) > nat > nat ).

thf(func_def_197,type,
    sK88: nat > nat ).

thf(func_def_198,type,
    sK89: nat > nat ).

thf(func_def_199,type,
    sK90: nat > nat ).

thf(func_def_200,type,
    sK91: nat > nat ).

thf(func_def_201,type,
    sK92: nat > nat ).

thf(func_def_202,type,
    sK93: ( nat > $o ) > ( nat > $o ) > ( nat > $o ) > ( nat > $o ) > nat ).

thf(func_def_203,type,
    sK94: nat > ( nat > $o ) > ( nat > $o ) > nat ).

thf(func_def_204,type,
    sK95: nat > ( nat > $o ) > ( nat > $o ) > nat ).

thf(func_def_205,type,
    sK96: ( nat > $o ) > ( nat > $o ) > ( nat > $o ) > ( nat > $o ) > nat ).

thf(func_def_206,type,
    sK97: nat > ( nat > $o ) > ( nat > $o ) > nat ).

thf(func_def_207,type,
    sK98: nat > ( nat > $o ) > ( nat > $o ) > nat ).

thf(func_def_208,type,
    sK99: nat > nat ).

thf(func_def_209,type,
    sK100: nat > nat ).

thf(func_def_210,type,
    sK101: nat > nat ).

thf(func_def_211,type,
    sK102: nat > nat ).

thf(func_def_212,type,
    sK103: ( nat > $o ) > ( nat > $o ) > ( nat > $o ) > ( nat > $o ) > nat ).

thf(func_def_213,type,
    sK104: nat > ( nat > $o ) > ( nat > $o ) > nat ).

thf(func_def_214,type,
    sK105: nat > ( nat > $o ) > ( nat > $o ) > nat ).

thf(func_def_215,type,
    sK106: ( nat > $o ) > ( nat > $o ) > ( nat > $o ) > ( nat > $o ) > nat ).

thf(func_def_216,type,
    sK107: nat > ( nat > $o ) > ( nat > $o ) > nat ).

thf(func_def_217,type,
    sK108: nat > ( nat > $o ) > ( nat > $o ) > nat ).

thf(func_def_218,type,
    sK109: nat > nat ).

thf(func_def_219,type,
    sK110: nat > nat ).

thf(func_def_220,type,
    sK111: nat > nat ).

thf(func_def_221,type,
    sK112: ( nat > $o ) > nat > nat > nat ).

thf(func_def_222,type,
    sK113: nat > ( nat > $o ) > nat > nat ).

thf(func_def_223,type,
    sK114: list_nat > nat > nat ).

thf(func_def_224,type,
    sK115: list_list_a > list_a > nat ).

thf(func_def_225,type,
    sK116: list_a > a > nat ).

thf(func_def_226,type,
    sK117: ( nat > $o ) > list_nat > nat ).

thf(func_def_227,type,
    sK118: ( nat > $o ) > list_nat > nat ).

thf(func_def_228,type,
    sK119: ( list_a > $o ) > list_list_a > list_a ).

thf(func_def_229,type,
    sK120: ( list_a > $o ) > list_list_a > nat ).

thf(func_def_230,type,
    sK121: ( a > $o ) > list_a > a ).

thf(func_def_231,type,
    sK122: ( a > $o ) > list_a > nat ).

thf(func_def_232,type,
    sK123: list_nat > nat ).

thf(func_def_233,type,
    sK124: list_nat > nat ).

thf(func_def_234,type,
    sK125: list_nat > nat ).

thf(func_def_235,type,
    sK126: list_nat > nat ).

thf(func_def_236,type,
    sK127: list_list_a > nat ).

thf(func_def_237,type,
    sK128: list_list_a > nat ).

thf(func_def_238,type,
    sK129: list_list_a > nat ).

thf(func_def_239,type,
    sK130: list_list_a > nat ).

thf(func_def_240,type,
    sK131: list_a > nat ).

thf(func_def_241,type,
    sK132: list_a > nat ).

thf(func_def_242,type,
    sK133: list_a > nat ).

thf(func_def_243,type,
    sK134: list_a > nat ).

thf(func_def_244,type,
    sK135: list_nat > nat ).

thf(func_def_245,type,
    sK136: list_nat > nat ).

thf(func_def_246,type,
    sK137: list_nat > nat ).

thf(func_def_247,type,
    sK138: list_nat > nat ).

thf(func_def_248,type,
    sK139: list_nat > nat ).

thf(func_def_249,type,
    sK140: list_nat > nat ).

thf(func_def_250,type,
    sK141: list_nat > nat ).

thf(func_def_251,type,
    sK142: list_nat > nat ).

thf(func_def_252,type,
    sK143: list_nat > nat ).

thf(func_def_253,type,
    sK144: list_nat > nat ).

thf(func_def_254,type,
    sK145: list_nat > nat ).

thf(func_def_255,type,
    sK146: list_nat > nat ).

thf(func_def_256,type,
    sK147: list_nat > nat ).

thf(func_def_257,type,
    sK148: list_nat > nat ).

thf(func_def_258,type,
    sK149: list_list_a > nat ).

thf(func_def_259,type,
    sK150: list_list_a > nat ).

thf(func_def_260,type,
    sK151: list_list_a > nat ).

thf(func_def_261,type,
    sK152: list_list_a > nat ).

thf(func_def_262,type,
    sK153: list_list_a > nat ).

thf(func_def_263,type,
    sK154: list_list_a > nat ).

thf(func_def_264,type,
    sK155: list_list_a > nat ).

thf(func_def_265,type,
    sK156: list_list_a > nat ).

thf(func_def_266,type,
    sK157: list_a > nat ).

thf(func_def_267,type,
    sK158: list_a > nat ).

thf(func_def_268,type,
    sK159: list_a > nat ).

thf(func_def_269,type,
    sK160: list_a > nat ).

thf(func_def_270,type,
    sK161: list_a > nat ).

thf(func_def_271,type,
    sK162: list_a > nat ).

thf(func_def_272,type,
    sK163: list_a > nat ).

thf(func_def_273,type,
    sK164: list_a > nat ).

thf(func_def_274,type,
    sK165: set_nat > list_nat > set_nat > nat ).

thf(func_def_275,type,
    sK166: set_nat > list_list_a > set_list_a > nat ).

thf(func_def_276,type,
    sK167: set_nat > list_a > set_a > nat ).

thf(func_def_277,type,
    sK168: list_nat > nat > nat > nat ).

thf(func_def_278,type,
    sK169: list_nat > nat > nat > nat ).

thf(func_def_279,type,
    sK170: list_nat > nat ).

thf(func_def_280,type,
    sK171: list_nat > nat ).

thf(func_def_281,type,
    sK172: list_list_a > nat > nat > nat ).

thf(func_def_282,type,
    sK173: list_list_a > nat > nat > nat ).

thf(func_def_283,type,
    sK174: list_list_a > nat ).

thf(func_def_284,type,
    sK175: list_list_a > nat ).

thf(func_def_285,type,
    sK176: list_a > nat > nat > nat ).

thf(func_def_286,type,
    sK177: list_a > nat > nat > nat ).

thf(func_def_287,type,
    sK178: list_a > nat ).

thf(func_def_288,type,
    sK179: list_a > nat ).

thf(func_def_289,type,
    sK180: list_nat > nat > set_nat > nat ).

thf(func_def_290,type,
    sK181: list_list_a > list_a > set_nat > nat ).

thf(func_def_291,type,
    sK182: list_a > a > set_nat > nat ).

thf(func_def_292,type,
    sK183: list_list_list_a > list_list_a > set_nat > nat ).

thf(func_def_293,type,
    sK184: list_list_nat > list_nat > set_nat > nat ).

thf(func_def_294,type,
    sK185: list_nat > nat ).

thf(func_def_295,type,
    sK186: list_nat > nat ).

thf(func_def_296,type,
    sK187: list_nat > nat ).

thf(func_def_297,type,
    sK188: list_nat > nat ).

thf(func_def_298,type,
    sK189: ( nat > a > $o ) > nat > nat ).

thf(func_def_299,type,
    sK190: ( nat > a > $o ) > nat > list_a ).

thf(func_def_300,type,
    sK191: list_a > ( nat > a > $o ) > nat > nat ).

thf(func_def_301,type,
    sK192: ( nat > a > $o ) > nat > a ).

thf(func_def_302,type,
    sK193: ( nat > list_a > $o ) > nat > nat ).

thf(func_def_303,type,
    sK194: ( nat > list_a > $o ) > nat > list_list_a ).

thf(func_def_304,type,
    sK195: list_list_a > ( nat > list_a > $o ) > nat > nat ).

thf(func_def_305,type,
    sK196: ( nat > list_a > $o ) > nat > list_a ).

thf(func_def_306,type,
    sK197: ( nat > nat > $o ) > nat > nat ).

thf(func_def_307,type,
    sK198: ( nat > nat > $o ) > nat > list_nat ).

thf(func_def_308,type,
    sK199: list_nat > ( nat > nat > $o ) > nat > nat ).

thf(func_def_309,type,
    sK200: ( nat > nat > $o ) > nat > nat ).

thf(func_def_310,type,
    sK201: ( nat > list_list_a > $o ) > nat > nat ).

thf(func_def_311,type,
    sK202: ( nat > list_list_a > $o ) > nat > list_list_list_a ).

thf(func_def_312,type,
    sK203: list_list_list_a > ( nat > list_list_a > $o ) > nat > nat ).

thf(func_def_313,type,
    sK204: ( nat > list_list_a > $o ) > nat > list_list_a ).

thf(func_def_314,type,
    sK205: ( nat > list_nat > $o ) > nat > nat ).

thf(func_def_315,type,
    sK206: ( nat > list_nat > $o ) > nat > list_list_nat ).

thf(func_def_316,type,
    sK207: list_list_nat > ( nat > list_nat > $o ) > nat > nat ).

thf(func_def_317,type,
    sK208: ( nat > list_nat > $o ) > nat > list_nat ).

thf(func_def_319,type,
    sK210: ( nat > $o ) > nat ).

thf(func_def_320,type,
    sK211: ( nat > $o ) > nat ).

thf(func_def_321,type,
    sK212: ( nat > $o ) > nat > nat ).

thf(func_def_322,type,
    sK213: list_nat > nat ).

thf(func_def_323,type,
    sK214: list_nat > nat ).

thf(func_def_324,type,
    sK215: list_nat > nat ).

thf(func_def_325,type,
    sK216: list_nat > nat ).

thf(func_def_326,type,
    sK217: list_nat > nat ).

thf(func_def_327,type,
    sK218: list_nat > nat ).

thf(func_def_328,type,
    sK219: list_nat > nat ).

thf(func_def_329,type,
    sK220: list_nat > nat ).

thf(f20,axiom,
    ! [X0: nat,X1: list_a,X2: nat] :
      ( ( ord_less_nat @ X0 @ ( divide_divide_nat @ ( size_size_list_a @ X1 ) @ X2 ) )
     => ( ( nth_list_a @ ( listSl1174287072ice2_a @ X1 @ X2 ) @ X0 )
        = ( nth_list_a @ ( listSl97544552lice_a @ X1 @ X2 ) @ X0 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_19_list__slice2__list__slice__nth) ).

thf(f31,axiom,
    ! [X0: nat,X1: list_a,X2: nat] :
      ( ( ord_less_nat @ X0 @ ( divide_divide_nat @ ( size_size_list_a @ X1 ) @ X2 ) )
     => ( ( size_size_list_a @ ( nth_list_a @ ( listSl97544552lice_a @ X1 @ X2 ) @ X0 ) )
        = X2 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_30_list__slice__nth__length) ).

thf(f65,axiom,
    ( listSl97544552lice_a
    = ( ^ [X0: list_a,X1: nat] : ( listSl1495374126_aux_a @ X0 @ X1 @ ( divide_divide_nat @ ( size_size_list_a @ X0 ) @ X1 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_64_list__slice__def) ).

thf(f197,axiom,
    ( ord_less_nat
    = ( ^ [X0: nat,X1: nat] :
          ( ( X0 != X1 )
          & ( ord_less_eq_nat @ X0 @ X1 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_196_nat__less__le) ).

thf(f349,axiom,
    ord_less_nat @ m @ ( divide_divide_nat @ ( size_size_list_a @ xs ) @ k ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).

thf(f350,conjecture,
    ( ( size_size_list_a @ ( nth_list_a @ ( listSl1174287072ice2_a @ xs @ k ) @ m ) )
    = k ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_1) ).

thf(f351,negated_conjecture,
    ( ( size_size_list_a @ ( nth_list_a @ ( listSl1174287072ice2_a @ xs @ k ) @ m ) )
   != k ),
    inference(negated_conjecture,[status(cth)],[f350]) ).

thf(f390,plain,
    ! [X0: nat,X1: list_a,X2: nat] :
      ( ( ord_less_nat @ X0 @ ( divide_divide_nat @ ( size_size_list_a @ X1 ) @ X2 ) )
     => ( ( nth_list_a @ ( listSl1174287072ice2_a @ X1 @ X2 ) @ X0 )
        = ( nth_list_a @ ( listSl97544552lice_a @ X1 @ X2 ) @ X0 ) ) ),
    inference(rectify,[],[f20]) ).

thf(f391,plain,
    ! [X0: nat,X1: list_a,X2: nat] :
      ( ( ( ord_less_nat @ X0 @ ( divide_divide_nat @ ( size_size_list_a @ X1 ) @ X2 ) )
        = $true )
     => ( ( nth_list_a @ ( listSl1174287072ice2_a @ X1 @ X2 ) @ X0 )
        = ( nth_list_a @ ( listSl97544552lice_a @ X1 @ X2 ) @ X0 ) ) ),
    inference(fool_elimination,[],[f390]) ).

thf(f412,plain,
    ! [X0: nat,X1: list_a,X2: nat] :
      ( ( ord_less_nat @ X0 @ ( divide_divide_nat @ ( size_size_list_a @ X1 ) @ X2 ) )
     => ( ( size_size_list_a @ ( nth_list_a @ ( listSl97544552lice_a @ X1 @ X2 ) @ X0 ) )
        = X2 ) ),
    inference(rectify,[],[f31]) ).

thf(f413,plain,
    ! [X0: nat,X1: list_a,X2: nat] :
      ( ( ( ord_less_nat @ X0 @ ( divide_divide_nat @ ( size_size_list_a @ X1 ) @ X2 ) )
        = $true )
     => ( ( size_size_list_a @ ( nth_list_a @ ( listSl97544552lice_a @ X1 @ X2 ) @ X0 ) )
        = X2 ) ),
    inference(fool_elimination,[],[f412]) ).

thf(f436,plain,
    ( listSl97544552lice_a
    = ( ^ [Y0: list_a,Y1: nat] : ( listSl1495374126_aux_a @ Y0 @ Y1 @ ( divide_divide_nat @ ( size_size_list_a @ Y0 ) @ Y1 ) ) ) ),
    inference(fool_elimination,[],[f65]) ).

thf(f645,plain,
    ( ord_less_nat
    = ( ^ [X0: nat,X1: nat] :
          ( ( X0 != X1 )
          & ( ord_less_eq_nat @ X0 @ X1 ) ) ) ),
    inference(rectify,[],[f197]) ).

thf(f646,plain,
    ( ord_less_nat
    = ( ^ [Y0: nat,Y1: nat] :
          ( ( ord_less_eq_nat @ Y0 @ Y1 )
          & ( Y0 != Y1 ) ) ) ),
    inference(fool_elimination,[],[f645]) ).

thf(f949,plain,
    ord_less_nat @ m @ ( divide_divide_nat @ ( size_size_list_a @ xs ) @ k ),
    inference(rectify,[],[f349]) ).

thf(f950,plain,
    ( ( ord_less_nat @ m @ ( divide_divide_nat @ ( size_size_list_a @ xs ) @ k ) )
    = $true ),
    inference(fool_elimination,[],[f949]) ).

thf(f982,plain,
    ( k
   != ( size_size_list_a @ ( nth_list_a @ ( listSl1174287072ice2_a @ xs @ k ) @ m ) ) ),
    inference(flattening,[],[f351]) ).

thf(f997,plain,
    ! [X0: nat,X1: list_a,X2: nat] :
      ( ( ( nth_list_a @ ( listSl1174287072ice2_a @ X1 @ X2 ) @ X0 )
        = ( nth_list_a @ ( listSl97544552lice_a @ X1 @ X2 ) @ X0 ) )
      | ( ( ord_less_nat @ X0 @ ( divide_divide_nat @ ( size_size_list_a @ X1 ) @ X2 ) )
       != $true ) ),
    inference(ennf_transformation,[],[f391]) ).

thf(f1007,plain,
    ! [X0: nat,X1: list_a,X2: nat] :
      ( ( ( size_size_list_a @ ( nth_list_a @ ( listSl97544552lice_a @ X1 @ X2 ) @ X0 ) )
        = X2 )
      | ( ( ord_less_nat @ X0 @ ( divide_divide_nat @ ( size_size_list_a @ X1 ) @ X2 ) )
       != $true ) ),
    inference(ennf_transformation,[],[f413]) ).

thf(f1448,plain,
    ! [X2: nat,X0: nat,X1: list_a] :
      ( ( ( nth_list_a @ ( listSl1174287072ice2_a @ X1 @ X2 ) @ X0 )
        = ( nth_list_a @ ( listSl97544552lice_a @ X1 @ X2 ) @ X0 ) )
      | ( ( ord_less_nat @ X0 @ ( divide_divide_nat @ ( size_size_list_a @ X1 ) @ X2 ) )
       != $true ) ),
    inference(cnf_transformation,[],[f997]) ).

thf(f1464,plain,
    ! [X2: nat,X0: nat,X1: list_a] :
      ( ( ( size_size_list_a @ ( nth_list_a @ ( listSl97544552lice_a @ X1 @ X2 ) @ X0 ) )
        = X2 )
      | ( ( ord_less_nat @ X0 @ ( divide_divide_nat @ ( size_size_list_a @ X1 ) @ X2 ) )
       != $true ) ),
    inference(cnf_transformation,[],[f1007]) ).

thf(f1500,plain,
    ( listSl97544552lice_a
    = ( ^ [Y0: list_a,Y1: nat] : ( listSl1495374126_aux_a @ Y0 @ Y1 @ ( divide_divide_nat @ ( size_size_list_a @ Y0 ) @ Y1 ) ) ) ),
    inference(cnf_transformation,[],[f436]) ).

thf(f1664,plain,
    ( ord_less_nat
    = ( ^ [Y0: nat,Y1: nat] :
          ( ( ord_less_eq_nat @ Y0 @ Y1 )
          & ( Y0 != Y1 ) ) ) ),
    inference(cnf_transformation,[],[f646]) ).

thf(f1888,plain,
    ( ( ord_less_nat @ m @ ( divide_divide_nat @ ( size_size_list_a @ xs ) @ k ) )
    = $true ),
    inference(cnf_transformation,[],[f950]) ).

thf(f1889,plain,
    ( k
   != ( size_size_list_a @ ( nth_list_a @ ( listSl1174287072ice2_a @ xs @ k ) @ m ) ) ),
    inference(cnf_transformation,[],[f982]) ).

thf(f1930,plain,
    ! [X2: nat,X0: nat,X1: list_a] :
      ( ( ( nth_list_a @ ( listSl1174287072ice2_a @ X1 @ X2 ) @ X0 )
        = ( nth_list_a
          @ ( ^ [Y0: list_a,Y1: nat] : ( listSl1495374126_aux_a @ Y0 @ Y1 @ ( divide_divide_nat @ ( size_size_list_a @ Y0 ) @ Y1 ) )
            @ X1
            @ X2 )
          @ X0 ) )
      | ( $true
       != ( ^ [Y0: nat,Y1: nat] :
              ( ( ord_less_eq_nat @ Y0 @ Y1 )
              & ( Y0 != Y1 ) )
          @ X0
          @ ( divide_divide_nat @ ( size_size_list_a @ X1 ) @ X2 ) ) ) ),
    inference(definition_unfolding,[],[f1448,f1500,f1664]) ).

thf(f1940,plain,
    ! [X2: nat,X0: nat,X1: list_a] :
      ( ( ( size_size_list_a
          @ ( nth_list_a
            @ ( ^ [Y0: list_a,Y1: nat] : ( listSl1495374126_aux_a @ Y0 @ Y1 @ ( divide_divide_nat @ ( size_size_list_a @ Y0 ) @ Y1 ) )
              @ X1
              @ X2 )
            @ X0 ) )
        = X2 )
      | ( $true
       != ( ^ [Y0: nat,Y1: nat] :
              ( ( ord_less_eq_nat @ Y0 @ Y1 )
              & ( Y0 != Y1 ) )
          @ X0
          @ ( divide_divide_nat @ ( size_size_list_a @ X1 ) @ X2 ) ) ) ),
    inference(definition_unfolding,[],[f1464,f1500,f1664]) ).

thf(f2199,plain,
    ( $true
    = ( ^ [Y0: nat,Y1: nat] :
          ( ( ord_less_eq_nat @ Y0 @ Y1 )
          & ( Y0 != Y1 ) )
      @ m
      @ ( divide_divide_nat @ ( size_size_list_a @ xs ) @ k ) ) ),
    inference(definition_unfolding,[],[f1888,f1664]) ).

thf(f2259,plain,
    ( $true
    = ( ( ord_less_eq_nat @ m @ ( divide_divide_nat @ ( size_size_list_a @ xs ) @ k ) )
      & ( m
       != ( divide_divide_nat @ ( size_size_list_a @ xs ) @ k ) ) ) ),
    inference(beta-eta_normalization,[],[f2199]) ).

thf(f2260,plain,
    ( $true
    = ( m
     != ( divide_divide_nat @ ( size_size_list_a @ xs ) @ k ) ) ),
    inference(and_proxy_clausification,[],[f2259]) ).

thf(f2261,plain,
    ( $true
    = ( ord_less_eq_nat @ m @ ( divide_divide_nat @ ( size_size_list_a @ xs ) @ k ) ) ),
    inference(and_proxy_clausification,[],[f2259]) ).

thf(f2262,plain,
    ( $false
    = ( m
      = ( divide_divide_nat @ ( size_size_list_a @ xs ) @ k ) ) ),
    inference(not_proxy_clausification,[],[f2260]) ).

thf(f2263,plain,
    ( m
   != ( divide_divide_nat @ ( size_size_list_a @ xs ) @ k ) ),
    inference(equality_proxy_clausification,[],[f2262]) ).

thf(f6782,plain,
    ! [X2: nat,X0: nat,X1: list_a] :
      ( ( ( size_size_list_a @ ( nth_list_a @ ( listSl1495374126_aux_a @ X1 @ X2 @ ( divide_divide_nat @ ( size_size_list_a @ X1 ) @ X2 ) ) @ X0 ) )
        = X2 )
      | ( $true
       != ( ( ord_less_eq_nat @ X0 @ ( divide_divide_nat @ ( size_size_list_a @ X1 ) @ X2 ) )
          & ( X0
           != ( divide_divide_nat @ ( size_size_list_a @ X1 ) @ X2 ) ) ) ) ),
    inference(beta-eta_normalization,[],[f1940]) ).

thf(f6783,plain,
    ! [X2: nat,X0: nat,X1: list_a] :
      ( ( ( size_size_list_a @ ( nth_list_a @ ( listSl1495374126_aux_a @ X1 @ X2 @ ( divide_divide_nat @ ( size_size_list_a @ X1 ) @ X2 ) ) @ X0 ) )
        = X2 )
      | ( $false
        = ( X0
         != ( divide_divide_nat @ ( size_size_list_a @ X1 ) @ X2 ) ) )
      | ( $false
        = ( ord_less_eq_nat @ X0 @ ( divide_divide_nat @ ( size_size_list_a @ X1 ) @ X2 ) ) ) ),
    inference(and_proxy_clausification,[],[f6782]) ).

thf(f6784,plain,
    ! [X2: nat,X0: nat,X1: list_a] :
      ( ( ( size_size_list_a @ ( nth_list_a @ ( listSl1495374126_aux_a @ X1 @ X2 @ ( divide_divide_nat @ ( size_size_list_a @ X1 ) @ X2 ) ) @ X0 ) )
        = X2 )
      | ( $true
        = ( X0
          = ( divide_divide_nat @ ( size_size_list_a @ X1 ) @ X2 ) ) )
      | ( $false
        = ( ord_less_eq_nat @ X0 @ ( divide_divide_nat @ ( size_size_list_a @ X1 ) @ X2 ) ) ) ),
    inference(not_proxy_clausification,[],[f6783]) ).

thf(f6785,plain,
    ! [X2: nat,X0: nat,X1: list_a] :
      ( ( ( size_size_list_a @ ( nth_list_a @ ( listSl1495374126_aux_a @ X1 @ X2 @ ( divide_divide_nat @ ( size_size_list_a @ X1 ) @ X2 ) ) @ X0 ) )
        = X2 )
      | ( ( divide_divide_nat @ ( size_size_list_a @ X1 ) @ X2 )
        = X0 )
      | ( $false
        = ( ord_less_eq_nat @ X0 @ ( divide_divide_nat @ ( size_size_list_a @ X1 ) @ X2 ) ) ) ),
    inference(equality_proxy_clausification,[],[f6784]) ).

thf(f6822,plain,
    ! [X2: nat,X0: nat,X1: list_a] :
      ( ( ( nth_list_a @ ( listSl1174287072ice2_a @ X1 @ X2 ) @ X0 )
        = ( nth_list_a @ ( listSl1495374126_aux_a @ X1 @ X2 @ ( divide_divide_nat @ ( size_size_list_a @ X1 ) @ X2 ) ) @ X0 ) )
      | ( $true
       != ( ( ord_less_eq_nat @ X0 @ ( divide_divide_nat @ ( size_size_list_a @ X1 ) @ X2 ) )
          & ( X0
           != ( divide_divide_nat @ ( size_size_list_a @ X1 ) @ X2 ) ) ) ) ),
    inference(beta-eta_normalization,[],[f1930]) ).

thf(f6823,plain,
    ! [X2: nat,X0: nat,X1: list_a] :
      ( ( ( nth_list_a @ ( listSl1174287072ice2_a @ X1 @ X2 ) @ X0 )
        = ( nth_list_a @ ( listSl1495374126_aux_a @ X1 @ X2 @ ( divide_divide_nat @ ( size_size_list_a @ X1 ) @ X2 ) ) @ X0 ) )
      | ( $false
        = ( X0
         != ( divide_divide_nat @ ( size_size_list_a @ X1 ) @ X2 ) ) )
      | ( $false
        = ( ord_less_eq_nat @ X0 @ ( divide_divide_nat @ ( size_size_list_a @ X1 ) @ X2 ) ) ) ),
    inference(and_proxy_clausification,[],[f6822]) ).

thf(f6824,plain,
    ! [X2: nat,X0: nat,X1: list_a] :
      ( ( ( nth_list_a @ ( listSl1174287072ice2_a @ X1 @ X2 ) @ X0 )
        = ( nth_list_a @ ( listSl1495374126_aux_a @ X1 @ X2 @ ( divide_divide_nat @ ( size_size_list_a @ X1 ) @ X2 ) ) @ X0 ) )
      | ( $true
        = ( X0
          = ( divide_divide_nat @ ( size_size_list_a @ X1 ) @ X2 ) ) )
      | ( $false
        = ( ord_less_eq_nat @ X0 @ ( divide_divide_nat @ ( size_size_list_a @ X1 ) @ X2 ) ) ) ),
    inference(not_proxy_clausification,[],[f6823]) ).

thf(f6825,plain,
    ! [X2: nat,X0: nat,X1: list_a] :
      ( ( ( nth_list_a @ ( listSl1174287072ice2_a @ X1 @ X2 ) @ X0 )
        = ( nth_list_a @ ( listSl1495374126_aux_a @ X1 @ X2 @ ( divide_divide_nat @ ( size_size_list_a @ X1 ) @ X2 ) ) @ X0 ) )
      | ( ( divide_divide_nat @ ( size_size_list_a @ X1 ) @ X2 )
        = X0 )
      | ( $false
        = ( ord_less_eq_nat @ X0 @ ( divide_divide_nat @ ( size_size_list_a @ X1 ) @ X2 ) ) ) ),
    inference(equality_proxy_clausification,[],[f6824]) ).

thf(f43152,plain,
    ! [X2: nat,X0: list_a,X1: nat] :
      ( ( ( size_size_list_a @ ( nth_list_a @ ( listSl1174287072ice2_a @ X0 @ X1 ) @ X2 ) )
        = X1 )
      | ( ( divide_divide_nat @ ( size_size_list_a @ X0 ) @ X1 )
        = X2 )
      | ( $false
        = ( ord_less_eq_nat @ X2 @ ( divide_divide_nat @ ( size_size_list_a @ X0 ) @ X1 ) ) )
      | ( ( divide_divide_nat @ ( size_size_list_a @ X0 ) @ X1 )
        = X2 )
      | ( $false
        = ( ord_less_eq_nat @ X2 @ ( divide_divide_nat @ ( size_size_list_a @ X0 ) @ X1 ) ) ) ),
    inference(constrained_superposition,[],[f6785,f6825]) ).

thf(f43157,plain,
    ! [X2: nat,X0: list_a,X1: nat] :
      ( ( $false
        = ( ord_less_eq_nat @ X2 @ ( divide_divide_nat @ ( size_size_list_a @ X0 ) @ X1 ) ) )
      | ( ( divide_divide_nat @ ( size_size_list_a @ X0 ) @ X1 )
        = X2 )
      | ( ( size_size_list_a @ ( nth_list_a @ ( listSl1174287072ice2_a @ X0 @ X1 ) @ X2 ) )
        = X1 ) ),
    inference(duplicate_literal_removal,[],[f43152]) ).

thf(f213697,plain,
    ( ( $true = $false )
    | ( m
      = ( divide_divide_nat @ ( size_size_list_a @ xs ) @ k ) )
    | ( k
      = ( size_size_list_a @ ( nth_list_a @ ( listSl1174287072ice2_a @ xs @ k ) @ m ) ) ) ),
    inference(constrained_superposition,[],[f2261,f43157]) ).

thf(f214074,plain,
    ( ( m
      = ( divide_divide_nat @ ( size_size_list_a @ xs ) @ k ) )
    | ( k
      = ( size_size_list_a @ ( nth_list_a @ ( listSl1174287072ice2_a @ xs @ k ) @ m ) ) ) ),
    inference(trivial_inequality_removal,[],[f213697]) ).

thf(f214414,plain,
    ( m
    = ( divide_divide_nat @ ( size_size_list_a @ xs ) @ k ) ),
    inference(forward_subsumption_resolution,[],[f214074,f1889]) ).

thf(f214649,definition,
    ( spl209_921
  <=> ( m
      = ( divide_divide_nat @ ( size_size_list_a @ xs ) @ k ) ) ),
    introduced(definition,[new_symbols(definition,[spl209_921])],[avatar_definition]) ).

thf(f214688,plain,
    spl209_921,
    inference(avatar_split_clause,[],[f214414,f214649]) ).

thf(f215051,plain,
    ~ spl209_921,
    inference(avatar_split_clause,[],[f2263,f214649]) ).

cnf(s3592,plain,
    spl209_921,
    inference(sat_conversion,[],[f214688]) ).

cnf(s3670,plain,
    ~ spl209_921,
    inference(sat_conversion,[],[f215051]) ).

cnf(s3671,plain,
    $false,
    inference(rat,[],[s3592,s3670]) ).

thf(f215052,plain,
    $false,
    inference(avatar_sat_refutation,[],[s3671]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ITP104^1 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22  % Computer : n007.cluster.edu
% 0.09/0.22  % Model    : x86_64 x86_64
% 0.09/0.22  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.22  % Memory   : 8046.5625MB
% 0.09/0.22  % OS       : Linux 6.8.0-71-generic
% 0.09/0.22  % CPULimit : 300
% 0.09/0.22  % WCLimit  : 300
% 0.09/0.22  % DateTime : Tue Sep 29 19:51:56 UTC 2026
% 0.09/0.22  % CPUTime  : 
% 0.09/0.22  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.26  Running first-order model finding
% 0.09/0.26  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.58/1.42  % (3843134)Will run a generic schedule for satisfiability detection.
% 6.58/1.42  % (3843145)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1602862662:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 6.58/1.42  % (3843141)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4120616470:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 6.58/1.42  % (3843144)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3142295833:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 6.58/1.42  % (3843142)dis+10_1_sil=32000:sp=arity:random_seed=4117815269:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 6.58/1.42  % (3843143)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3118735623:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 6.58/1.42  % (3843140)% WARNING: option uhcvi not known.
% 6.58/1.42  % (3843139)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1628030669_2999 on theBenchmark for (2999ds/0Mi)
% 6.58/1.42  % (3843140)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4172006568:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 6.58/1.42  % (3843143)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 6.58/1.42  % (3843140)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 6.58/1.42  % (3843145)Instruction limit reached! 
% 6.58/1.42  % (3843145)------------------------------
% 6.58/1.42  % (3843145)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.58/1.42  % (3843145)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.58/1.42  % (3843145)CaDiCaL version: 2.1.3
% 6.58/1.42  % (3843145)Termination reason: Instruction limit
% 6.58/1.42  % (3843145)Termination phase: Saturation
% 6.58/1.42  % (3843145)Time elapsed: 0.067 s
% 6.58/1.42  % (3843145)Peak memory usage: 13 MB
% 6.58/1.42  % (3843145)Instructions burned: 161 (million)
% 6.58/1.42  % (3843153)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2166120276:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 6.58/1.42  % (3843142)Instruction limit reached! 
% 6.58/1.42  % (3843142)------------------------------
% 6.58/1.42  % (3843142)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.58/1.42  % (3843142)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.58/1.42  % (3843142)CaDiCaL version: 2.1.3
% 6.58/1.42  % (3843142)Termination reason: Instruction limit
% 6.58/1.42  % (3843142)Termination phase: Property scanning
% 6.58/1.42  % (3843142)Time elapsed: 0.080 s
% 6.58/1.42  % (3843142)Peak memory usage: 12 MB
% 6.58/1.42  % (3843142)Instructions burned: 103 (million)
% 6.58/1.42  % (3843143)Instruction limit reached! 
% 6.58/1.42  % (3843143)------------------------------
% 6.58/1.42  % (3843143)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.58/1.42  % (3843143)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.58/1.42  % (3843143)CaDiCaL version: 2.1.3
% 6.58/1.42  % (3843143)Termination reason: Instruction limit
% 6.58/1.42  % (3843143)Termination phase: Property scanning
% 6.58/1.42  % (3843143)Time elapsed: 0.092 s
% 6.58/1.42  % (3843143)Peak memory usage: 11 MB
% 6.58/1.42  % (3843143)Instructions burned: 117 (million)
% 6.58/1.42  % (3843144)Instruction limit reached! 
% 6.58/1.42  % (3843144)------------------------------
% 6.58/1.42  % (3843144)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.58/1.42  % (3843144)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.58/1.42  % (3843144)CaDiCaL version: 2.1.3
% 6.58/1.42  % (3843144)Termination reason: Instruction limit
% 6.58/1.42  % (3843144)Termination phase: Property scanning
% 6.58/1.42  % (3843144)Time elapsed: 0.109 s
% 6.58/1.42  % (3843144)Peak memory usage: 11 MB
% 6.58/1.42  % (3843144)Instructions burned: 131 (million)
% 6.58/1.42  % Exception at run slice level
% 6.58/1.42  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 6.58/1.42  % (3843140)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 6.58/1.42  % (3843155)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2585235557:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 6.58/1.42  % Exception at run slice level
% 6.58/1.42  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 6.58/1.42  % (3843158)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=584967814:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 29.08/4.44  % (3843160)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=272042887:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 29.08/4.44  % (3843156)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=1776516576:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 29.08/4.44  % (3843157)ott-21_1_sil=16000:fs=off:random_seed=2759445754:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 29.08/4.44  % (3843156)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 29.08/4.44  % Exception at run slice level
% 29.08/4.44  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 29.08/4.44  % (3843165)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=267781196:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 29.08/4.44  % (3843155)Instruction limit reached! 
% 29.08/4.44  % (3843155)------------------------------
% 29.08/4.44  % (3843155)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 29.08/4.44  % (3843155)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 29.08/4.44  % (3843155)CaDiCaL version: 2.1.3
% 29.08/4.44  % (3843155)Termination reason: Instruction limit
% 29.08/4.44  % (3843155)Termination phase: Property scanning
% 29.08/4.44  % (3843155)Time elapsed: 0.116 s
% 29.08/4.44  % (3843155)Peak memory usage: 12 MB
% 29.08/4.44  % (3843155)Instructions burned: 132 (million)
% 29.08/4.44  % (3843167)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=1084403050:i=889:ins=1_2997 on theBenchmark for (2997ds/889Mi)
% 29.08/4.44  % (3843156)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 29.08/4.44  % Exception at run slice level
% 29.08/4.44  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 29.08/4.44  % (3843157)Instruction limit reached! 
% 29.08/4.44  % (3843157)------------------------------
% 29.08/4.44  % (3843157)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 29.08/4.44  % (3843157)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 29.08/4.44  % (3843157)CaDiCaL version: 2.1.3
% 29.08/4.44  % (3843157)Termination reason: Instruction limit
% 29.08/4.44  % (3843157)Termination phase: Saturation
% 29.08/4.44  % (3843157)Time elapsed: 0.142 s
% 29.08/4.44  % (3843157)Peak memory usage: 13 MB
% 29.08/4.44  % (3843157)Instructions burned: 181 (million)
% 29.08/4.44  % (3843169)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=246317306:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2996 on theBenchmark for (2996ds/692Mi)
% 29.08/4.44  % (3843170)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=329805602:i=879:kws=inv_precedence:fsr=off_2996 on theBenchmark for (2996ds/879Mi)
% 29.08/4.44  % (3843170)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 29.08/4.44  % (3843169)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 29.08/4.44  % (3843158)Instruction limit reached! 
% 29.08/4.44  % (3843158)------------------------------
% 29.08/4.44  % (3843158)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 29.08/4.44  % (3843158)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 29.08/4.44  % (3843158)CaDiCaL version: 2.1.3
% 29.08/4.44  % (3843158)Termination reason: Instruction limit
% 29.08/4.44  % (3843158)Termination phase: Saturation
% 29.08/4.44  % (3843158)Time elapsed: 0.401 s
% 29.08/4.44  % (3843158)Peak memory usage: 15 MB
% 29.08/4.44  % (3843158)Instructions burned: 477 (million)
% 29.08/4.44  % (3843173)fmb+10_1_sil=64000:random_seed=930269074:i=22061:nm=2:gsp=on_2993 on theBenchmark for (2993ds/22061Mi)
% 29.08/4.44  % (3843156)Instruction limit reached! 
% 29.08/4.44  % (3843156)------------------------------
% 29.08/4.44  % (3843156)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 29.08/4.44  % (3843156)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 29.08/4.44  % (3843156)CaDiCaL version: 2.1.3
% 29.08/4.44  % (3843156)Termination reason: Instruction limit
% 29.08/4.44  % (3843156)Termination phase: Saturation
% 29.08/4.44  % (3843156)Time elapsed: 0.457 s
% 29.08/4.44  % (3843156)Peak memory usage: 17 MB
% 64.64/9.40  % (3843156)Instructions burned: 684 (million)
% 64.64/9.40  % (3843175)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=3190519147:i=9515:nm=5_2993 on theBenchmark for (2993ds/9515Mi)
% 64.64/9.40  % (3843169)Instruction limit reached! 
% 64.64/9.40  % (3843169)------------------------------
% 64.64/9.40  % (3843169)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 64.64/9.40  % (3843169)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 64.64/9.40  % (3843169)CaDiCaL version: 2.1.3
% 64.64/9.40  % (3843169)Termination reason: Instruction limit
% 64.64/9.40  % (3843169)Termination phase: Saturation
% 64.64/9.40  % (3843169)Time elapsed: 0.319 s
% 64.64/9.40  % (3843169)Peak memory usage: 18 MB
% 64.64/9.40  % (3843169)Instructions burned: 693 (million)
% 64.64/9.40  % (3843173)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 64.64/9.40  % (3843177)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=2030211438:fmbsr=1.7:i=920_2992 on theBenchmark for (2992ds/920Mi)
% 64.64/9.40  % Exception at run slice level
% 64.64/9.40  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 64.64/9.40  % (3843179)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=2336931758:i=5131_2992 on theBenchmark for (2992ds/5131Mi)
% 64.64/9.40  % Exception at run slice level
% 64.64/9.40  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 64.64/9.40  % Exception at run slice level
% 64.64/9.40  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 64.64/9.40  % (3843181)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=541637268:i=1472:ins=7:fdi=8:gsp=on_2992 on theBenchmark for (2992ds/1472Mi)
% 64.64/9.40  % (3843179)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 64.64/9.40  % (3843182)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=656141037:i=6324_2991 on theBenchmark for (2991ds/6324Mi)
% 64.64/9.40  % (3843181)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 64.64/9.40  % (3843181)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 64.64/9.40  % Exception at run slice level
% 64.64/9.40  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 64.64/9.40  % (3843185)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=2600732877:fmbsr=2.30978:i=2174_2991 on theBenchmark for (2991ds/2174Mi)
% 64.64/9.40  % (3843165)Instruction limit reached! 
% 64.64/9.40  % (3843165)------------------------------
% 64.64/9.40  % (3843165)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 64.64/9.40  % (3843165)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 64.64/9.40  % (3843165)CaDiCaL version: 2.1.3
% 64.64/9.40  % (3843165)Termination reason: Instruction limit
% 64.64/9.40  % (3843165)Termination phase: Saturation
% 64.64/9.40  % (3843165)Time elapsed: 0.627 s
% 64.64/9.40  % (3843165)Peak memory usage: 20 MB
% 64.64/9.40  % (3843165)Instructions burned: 1180 (million)
% 64.64/9.40  % (3843170)Instruction limit reached! 
% 64.64/9.40  % (3843170)------------------------------
% 64.64/9.40  % (3843170)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 64.64/9.40  % (3843170)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 64.64/9.40  % (3843170)CaDiCaL version: 2.1.3
% 64.64/9.40  % (3843170)Termination reason: Instruction limit
% 64.64/9.40  % (3843170)Termination phase: Saturation
% 64.64/9.40  % (3843170)Time elapsed: 0.535 s
% 64.64/9.40  % (3843170)Peak memory usage: 19 MB
% 64.64/9.40  % (3843170)Instructions burned: 879 (million)
% 64.64/9.40  % (3843189)ott-2_1_sil=16000:newcnf=on:random_seed=3383316963:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2990 on theBenchmark for (2990ds/869Mi)
% 64.64/9.40  % (3843191)ott+10_1_sil=32000:tgt=ground:random_seed=4168590844:i=5114:av=off_2990 on theBenchmark for (2990ds/5114Mi)
% 64.64/9.40  % (3843189)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 64.64/9.40  % Exception at run slice level
% 64.64/9.40  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 64.64/9.40  % (3843194)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=1639423312:i=54282_2989 on theBenchmark for (2989ds/54282Mi)
% 64.64/9.40  % Exception at run slice level
% 109.45/20.24  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 109.45/20.24  % (3843196)dis-11_1_sil=16000:sp=reverse_frequency:alpa=true:random_seed=4018085969:i=3512:aac=none_2988 on theBenchmark for (2988ds/3512Mi)
% 109.45/20.24  % (3843196)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 109.45/20.24  % (3843189)Instruction limit reached! 
% 109.45/20.24  % (3843189)------------------------------
% 109.45/20.24  % (3843189)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 109.45/20.24  % (3843189)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 109.45/20.24  % (3843189)CaDiCaL version: 2.1.3
% 109.45/20.24  % (3843189)Termination reason: Instruction limit
% 109.45/20.24  % (3843189)Termination phase: Saturation
% 109.45/20.24  % (3843189)Time elapsed: 0.682 s
% 109.45/20.24  % (3843189)Peak memory usage: 18 MB
% 109.45/20.24  % (3843189)Instructions burned: 870 (million)
% 109.45/20.24  % (3843199)dis+21_1_sil=32000:sas=cadical:random_seed=3198015212:i=3773:amm=off_2983 on theBenchmark for (2983ds/3773Mi)
% 109.45/20.24  % (3843181)Instruction limit reached! 
% 109.45/20.24  % (3843181)------------------------------
% 109.45/20.24  % (3843181)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 109.45/20.24  % (3843181)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 109.45/20.24  % (3843181)CaDiCaL version: 2.1.3
% 109.45/20.24  % (3843181)Termination reason: Instruction limit
% 109.45/20.24  % (3843181)Termination phase: Saturation
% 109.45/20.24  % (3843181)Time elapsed: 1.149 s
% 109.45/20.24  % (3843181)Peak memory usage: 22 MB
% 109.45/20.24  % (3843181)Instructions burned: 1472 (million)
% 109.45/20.24  % (3843202)ott+11_1_sil=16000:gs=on:random_seed=3008706907:s2a=on:i=2251:s2at=3:kws=inv_arity_squared:nm=2:fsr=off:fsd=on_2980 on theBenchmark for (2980ds/2251Mi)
% 109.45/20.24  % (3843202)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 109.45/20.24  % (3843196)Instruction limit reached! 
% 109.45/20.24  % (3843196)------------------------------
% 109.45/20.24  % (3843196)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 109.45/20.24  % (3843196)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 109.45/20.24  % (3843196)CaDiCaL version: 2.1.3
% 109.45/20.24  % (3843196)Termination reason: Instruction limit
% 109.45/20.24  % (3843196)Termination phase: Saturation
% 109.45/20.24  % (3843196)Time elapsed: 1.803 s
% 109.45/20.24  % (3843196)Peak memory usage: 30 MB
% 109.45/20.24  % (3843196)Instructions burned: 3514 (million)
% 109.45/20.24  % (3843204)fmb+10_1_fmbas=predicate:sil=64000:tgt=ground:fmbss=7:random_seed=2994198149:fmbsr=1.6:i=67534_2970 on theBenchmark for (2970ds/67534Mi)
% 109.45/20.24  % Exception at run slice level
% 109.45/20.24  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 109.45/20.24  % (3843206)ott-22_32_sil=16000:tgt=full:fdtod=off:sp=weighted_frequency:rnwc=on:alpa=false:random_seed=813687876:avsq=on:i=4591:add=off:avsqr=1,16:kws=inv_arity:nm=10:ins=9:fdi=4_2969 on theBenchmark for (2969ds/4591Mi)
% 109.45/20.24  % (3843202)Instruction limit reached! 
% 109.45/20.24  % (3843202)------------------------------
% 109.45/20.24  % (3843202)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 109.45/20.24  % (3843202)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 109.45/20.24  % (3843202)CaDiCaL version: 2.1.3
% 109.45/20.24  % (3843202)Termination reason: Instruction limit
% 109.45/20.24  % (3843202)Termination phase: Saturation
% 109.45/20.24  % (3843202)Time elapsed: 1.349 s
% 109.45/20.24  % (3843202)Peak memory usage: 23 MB
% 109.45/20.24  % (3843202)Instructions burned: 2252 (million)
% 109.45/20.24  % (3843208)dis+10_64_to=lpo:sil=32000:spb=intro:urr=on:sac=on:random_seed=3205032062:i=29340_2966 on theBenchmark for (2966ds/29340Mi)
% 109.45/20.24  % (3843191)Instruction limit reached! 
% 109.45/20.24  % (3843191)------------------------------
% 109.45/20.24  % (3843191)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 109.45/20.24  % (3843191)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 109.45/20.24  % (3843191)CaDiCaL version: 2.1.3
% 109.45/20.24  % (3843191)Termination reason: Instruction limit
% 109.45/20.24  % (3843191)Termination phase: Saturation
% 109.45/20.24  % (3843191)Time elapsed: 3.177 s
% 109.45/20.24  % (3843191)Peak memory usage: 38 MB
% 109.45/20.24  % (3843191)Instructions burned: 5115 (million)
% 109.45/20.24  % (3843212)dis-10_1_sil=64000:sas=cadical:cn=on:random_seed=894327642:i=5211_2958 on theBenchmark for (2958ds/5211Mi)
% 109.45/20.24  % (3843199)Instruction limit reached! 
% 109.45/20.24  % (3843199)------------------------------
% 109.45/20.24  % (3843199)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 109.45/20.24  % (3843199)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 109.45/20.24  % (3843199)CaDiCaL version: 2.1.3
% 109.45/20.24  % (3843199)Termination reason: Instruction limit
% 109.45/20.24  % (3843199)Termination phase: Saturation
% 109.45/20.24  % (3843199)Time elapsed: 2.789 s
% 109.45/20.24  % (3843199)Peak memory usage: 32 MB
% 109.45/20.24  % (3843199)Instructions burned: 3774 (million)
% 109.45/20.24  % (3843214)fmb+10_1_sil=32000:sas=cadical:bce=on:fmbss=17:random_seed=3923664280:i=5497:nm=2_2955 on theBenchmark for (2955ds/5497Mi)
% 109.45/20.24  % Exception at run slice level
% 109.45/20.24  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 109.45/20.24  % (3843216)fmb+10_1_fmbas=predicate:sil=64000:tgt=full:sas=cadical:fmbss=15:random_seed=4237150301:fmbsr=2:i=46332_2954 on theBenchmark for (2954ds/46332Mi)
% 109.45/20.24  % (3843179)Instruction limit reached! 
% 109.45/20.24  % (3843179)------------------------------
% 109.45/20.24  % (3843179)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 109.45/20.24  % (3843179)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 109.45/20.24  % (3843179)CaDiCaL version: 2.1.3
% 109.45/20.24  % (3843179)Termination reason: Instruction limit
% 109.45/20.24  % (3843179)Termination phase: Saturation
% 109.45/20.24  % (3843179)Time elapsed: 3.770 s
% 109.45/20.24  % (3843179)Peak memory usage: 37 MB
% 109.45/20.24  % (3843179)Instructions burned: 5131 (million)
% 109.45/20.24  % (3843218)fmb+10_1_sil=128000:tgt=full:sas=cadical:fmbss=12:random_seed=2221769723:i=14071_2954 on theBenchmark for (2954ds/14071Mi)
% 109.45/20.24  % Exception at run slice level
% 109.45/20.24  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 109.45/20.24  % (3843220)dis+10_161_sil=128000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1907993692:i=22565:add=on:rawr=on_2954 on theBenchmark for (2954ds/22565Mi)
% 109.45/20.24  % Exception at run slice level
% 109.45/20.24  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 109.45/20.24  % (3843222)ott+4_1_sil=16000:sp=arity:gs=on:random_seed=3739867826:i=8173:av=off_2953 on theBenchmark for (2953ds/8173Mi)
% 109.45/20.24  % (3843206)Instruction limit reached! 
% 109.45/20.24  % (3843206)------------------------------
% 109.45/20.24  % (3843206)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 109.45/20.24  % (3843206)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 109.45/20.24  % (3843206)CaDiCaL version: 2.1.3
% 109.45/20.24  % (3843206)Termination reason: Instruction limit
% 109.45/20.24  % (3843206)Termination phase: Saturation
% 109.45/20.24  % (3843206)Time elapsed: 3.579 s
% 109.45/20.24  % (3843206)Peak memory usage: 35 MB
% 109.45/20.24  % (3843206)Instructions burned: 4591 (million)
% 109.45/20.24  % (3843225)dis+10_16:1_sil=16000:random_seed=112082663:i=9155:fsr=off_2933 on theBenchmark for (2933ds/9155Mi)
% 109.45/20.24  % (3843212)Instruction limit reached! 
% 109.45/20.24  % (3843212)------------------------------
% 109.45/20.24  % (3843212)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 109.45/20.24  % (3843212)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 109.45/20.24  % (3843212)CaDiCaL version: 2.1.3
% 109.45/20.24  % (3843212)Termination reason: Instruction limit
% 109.45/20.24  % (3843212)Termination phase: Saturation
% 109.45/20.24  % (3843212)Time elapsed: 2.872 s
% 109.45/20.24  % (3843212)Peak memory usage: 43 MB
% 109.45/20.24  % (3843212)Instructions burned: 5211 (million)
% 109.45/20.24  % (3843230)ott-3_8_sil=64000:random_seed=1494898048:i=20139:bs=on_2929 on theBenchmark for (2929ds/20139Mi)
% 109.45/20.24  % (3843222)Instruction limit reached! 
% 109.45/20.24  % (3843222)------------------------------
% 109.45/20.24  % (3843222)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 109.45/20.24  % (3843222)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 109.45/20.24  % (3843222)CaDiCaL version: 2.1.3
% 109.45/20.24  % (3843222)Termination reason: Instruction limit
% 109.45/20.24  % (3843222)Termination phase: Saturation
% 109.45/20.24  % (3843222)Time elapsed: 4.415 s
% 109.45/20.24  % (3843222)Peak memory usage: 61 MB
% 109.45/20.24  % (3843222)Instructions burned: 8174 (million)
% 109.45/20.24  % (3843240)fmb+10_1_sil=64000:tgt=ground:sas=cadical:bce=on:fmbss=9:random_seed=1052070924:fmbsr=2:i=32576_2909 on theBenchmark for (2909ds/32576Mi)
% 109.45/20.24  % Exception at run slice level
% 109.45/20.24  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 109.45/20.24  % (3843242)ott+10_8:1_sil=16000:sp=arity:gs=on:random_seed=341477696:i=11404_2907 on theBenchmark for (2907ds/11404Mi)
% 109.45/20.24  % (3843225)Instruction limit reached! 
% 109.45/20.24  % (3843225)------------------------------
% 109.45/20.24  % (3843225)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 109.45/20.24  % (3843225)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 109.45/20.24  % (3843225)CaDiCaL version: 2.1.3
% 109.45/20.24  % (3843225)Termination reason: Instruction limit
% 109.45/20.24  % (3843225)Termination phase: Saturation
% 109.45/20.24  % (3843225)Time elapsed: 6.174 s
% 109.45/20.24  % (3843225)Peak memory usage: 48 MB
% 109.45/20.24  % (3843225)Instructions burned: 9156 (million)
% 109.45/20.24  % (3843246)ott-11_1_sil=16000:alpa=false:sac=on:random_seed=250553560:i=14134_2871 on theBenchmark for (2871ds/14134Mi)
% 109.45/20.24  % (3843246)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 109.45/20.24  % (3843230)Instruction limit reached! 
% 109.45/20.24  % (3843230)------------------------------
% 109.45/20.24  % (3843230)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 109.45/20.24  % (3843230)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 109.45/20.24  % (3843230)CaDiCaL version: 2.1.3
% 109.45/20.24  % (3843230)Termination reason: Instruction limit
% 109.45/20.24  % (3843230)Termination phase: Saturation
% 109.45/20.24  % (3843230)Time elapsed: 8.565 s
% 109.45/20.24  % (3843230)Peak memory usage: 32 MB
% 109.45/20.24  % (3843230)Instructions burned: 20141 (million)
% 109.45/20.24  % (3843253)dis+33_16_sil=32000:sac=on:random_seed=1306698664:i=15851:nm=0_2843 on theBenchmark for (2843ds/15851Mi)
% 109.45/20.24  % (3843220)Instruction limit reached! 
% 109.45/20.24  % (3843220)------------------------------
% 109.45/20.24  % (3843220)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 109.45/20.24  % (3843220)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 109.45/20.24  % (3843220)CaDiCaL version: 2.1.3
% 109.45/20.24  % (3843220)Termination reason: Instruction limit
% 109.45/20.24  % (3843220)Termination phase: Saturation
% 109.45/20.24  % (3843220)Time elapsed: 11.083 s
% 109.45/20.24  % (3843220)Peak memory usage: 104 MB
% 109.45/20.24  % (3843220)Instructions burned: 22565 (million)
% 109.45/20.24  % (3843255)dis+4_1024_sil=32000:avsql=on:sp=occurrence:gs=on:avsqc=1:random_seed=928135096:avsq=on:i=17627:add=on:amm=off_2842 on theBenchmark for (2842ds/17627Mi)
% 109.45/20.24  % (3843242)Instruction limit reached! 
% 109.45/20.24  % (3843242)------------------------------
% 109.45/20.24  % (3843242)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 109.45/20.24  % (3843242)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 109.45/20.24  % (3843242)CaDiCaL version: 2.1.3
% 109.45/20.24  % (3843242)Termination reason: Instruction limit
% 109.45/20.24  % (3843242)Termination phase: Saturation
% 109.45/20.24  % (3843242)Time elapsed: 7.370 s
% 109.45/20.24  % (3843242)Peak memory usage: 80 MB
% 109.45/20.24  % (3843242)Instructions burned: 11405 (million)
% 109.45/20.24  % (3843257)ott+10_64_anc=all:sil=128000:sas=cadical:bsr=unit_only:nwc=1:cn=on:random_seed=4035096394:s2a=on:i=53295_2833 on theBenchmark for (2833ds/53295Mi)
% 109.45/20.24  % (3843140) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3843134-3843140"...
% 109.45/20.24  % (3843140)...printing done.
% 109.45/20.24  % (3843140)Refutation found. Thanks to Tanya!
% 109.45/20.24  % SZS status Theorem for theBenchmark
% 109.45/20.24  % SZS output start Proof for theBenchmark
% See solution above
% 109.45/20.25  % (3843140)------------------------------
% 109.45/20.25  % (3843140)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 109.45/20.25  % (3843140)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 109.45/20.25  % (3843140)CaDiCaL version: 2.1.3
% 109.45/20.25  % (3843140)Termination reason: Refutation
% 109.45/20.25  % (3843140)Time elapsed: 19.829 s
% 109.45/20.25  % (3843140)Peak memory usage: 110 MB
% 109.45/20.25  % (3843140)Instructions burned: 34988 (million)
% 109.45/20.25  % (3843134)Success in time 19.97 s
% 109.45/20.25  % Vampire exiting
%------------------------------------------------------------------------------