%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : ITP029^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 : n019.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:25 AM UTC 2026
% Result : ContradictoryAxioms 0.92s 0.39s
% Output : Refutation 0.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 20 unt; 0 typ; 1 def)
% Number of atoms : 45 ( 25 equ; 0 cnn)
% Maximal formula atoms : 2 ( 2 avg)
% Number of connectives : 62 ( 9 ~; 0 |; 5 &; 47 @)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 8 ( 7 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 243 ( 240 usr; 12 con; 0-4 aty)
% Number of variables : 8 ( 0 sgn 0 !; 0 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
binary594033953_set_a: $tType ).
thf(type_def_6,type,
binary1439146945Tree_a: $tType ).
thf(type_def_7,type,
set_set_set_a: $tType ).
thf(type_def_8,type,
set_set_a: $tType ).
thf(type_def_9,type,
set_a: $tType ).
thf(type_def_10,type,
int: $tType ).
thf(type_def_11,type,
a: $tType ).
thf(type_def_12,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
binary313540327_set_a: binary594033953_set_a > set_a > binary594033953_set_a > binary594033953_set_a ).
thf(func_def_1,type,
binary717961607le_T_a: binary1439146945Tree_a > a > binary1439146945Tree_a > binary1439146945Tree_a ).
thf(func_def_2,type,
binary476621312_Tip_a: binary1439146945Tree_a ).
thf(func_def_3,type,
binary1613048283_set_a: binary594033953_set_a > set_set_a ).
thf(func_def_4,type,
binary256242811Tree_a: binary1439146945Tree_a > set_a ).
thf(func_def_5,type,
binary504661350_eqs_a: ( a > int ) > a > set_a ).
thf(func_def_6,type,
binary1001944660_set_a: binary594033953_set_a > set_set_a ).
thf(func_def_7,type,
binary945792244etOf_a: binary1439146945Tree_a > set_a ).
thf(func_def_8,type,
binary512218034_set_a: ( set_a > int ) > binary594033953_set_a > $o ).
thf(func_def_9,type,
binary1721989714Tree_a: ( a > int ) > binary1439146945Tree_a > $o ).
thf(func_def_10,type,
binary1524747315_set_a: ( set_a > int ) > set_a > set_a > binary594033953_set_a > $o ).
thf(func_def_11,type,
binary670562003pred_a: ( a > int ) > a > a > binary1439146945Tree_a > $o ).
thf(func_def_12,type,
the_a: ( a > $o ) > a ).
thf(func_def_13,type,
semila1223476304_a_a_o: ( ( a > a > $o ) > ( a > a > $o ) > a > a > $o ) > ( a > a > $o ) > $o ).
thf(func_def_14,type,
semila980155549tr_a_o: ( ( a > $o ) > ( a > $o ) > a > $o ) > ( a > $o ) > $o ).
thf(func_def_15,type,
semila1409648192_set_a: ( set_a > set_a > set_a ) > set_a > $o ).
thf(func_def_16,type,
sup_su198629954et_a_o: ( set_a > set_a > $o ) > ( set_a > set_a > $o ) > set_a > set_a > $o ).
thf(func_def_17,type,
sup_sup_set_a_o: ( set_a > $o ) > ( set_a > $o ) > set_a > $o ).
thf(func_def_18,type,
sup_sup_a_a_o: ( a > a > $o ) > ( a > a > $o ) > a > a > $o ).
thf(func_def_19,type,
sup_sup_a_o: ( a > $o ) > ( a > $o ) > a > $o ).
thf(func_def_20,type,
sup_sup_int: int > int > int ).
thf(func_def_21,type,
sup_sup_set_set_a: set_set_a > set_set_a > set_set_a ).
thf(func_def_22,type,
sup_sup_set_a: set_a > set_a > set_a ).
thf(func_def_23,type,
bot_bot_set_a_o: set_a > $o ).
thf(func_def_24,type,
bot_bot_a_a_o: a > a > $o ).
thf(func_def_25,type,
bot_bot_a_o: a > $o ).
thf(func_def_26,type,
bot_bot_o: $o ).
thf(func_def_27,type,
bot_bot_set_set_a: set_set_a ).
thf(func_def_28,type,
bot_bot_set_a: set_a ).
thf(func_def_29,type,
ord_less_set_a_o: ( set_a > $o ) > ( set_a > $o ) > $o ).
thf(func_def_30,type,
ord_less_a_a_o: ( a > a > $o ) > ( a > a > $o ) > $o ).
thf(func_def_31,type,
ord_less_a_o: ( a > $o ) > ( a > $o ) > $o ).
thf(func_def_32,type,
ord_less_int: int > int > $o ).
thf(func_def_33,type,
ord_less_set_set_a: set_set_a > set_set_a > $o ).
thf(func_def_34,type,
ord_less_set_a: set_a > set_a > $o ).
thf(func_def_35,type,
ord_less_eq_set_a: set_a > set_a > $o ).
thf(func_def_36,type,
powp_set_a: ( set_a > $o ) > set_set_a > $o ).
thf(func_def_37,type,
powp_a: ( a > $o ) > set_a > $o ).
thf(func_def_38,type,
collect_set_set_a: ( set_set_a > $o ) > set_set_set_a ).
thf(func_def_39,type,
collect_set_a: ( set_a > $o ) > set_set_a ).
thf(func_def_40,type,
collect_a: ( a > $o ) > set_a ).
thf(func_def_41,type,
pow_set_a: set_set_a > set_set_set_a ).
thf(func_def_42,type,
pow_a: set_a > set_set_a ).
thf(func_def_43,type,
insert_set_a: set_a > set_set_a > set_set_a ).
thf(func_def_44,type,
insert_a: a > set_a > set_a ).
thf(func_def_45,type,
is_empty_a: set_a > $o ).
thf(func_def_46,type,
is_singleton_set_a: set_set_a > $o ).
thf(func_def_47,type,
is_singleton_a: set_a > $o ).
thf(func_def_48,type,
the_elem_a: set_a > a ).
thf(func_def_49,type,
chains_a: set_set_a > set_set_set_a ).
thf(func_def_50,type,
pred_chain_set_a: set_set_a > ( set_a > set_a > $o ) > set_set_a > $o ).
thf(func_def_51,type,
pred_chain_a: set_a > ( a > a > $o ) > set_a > $o ).
thf(func_def_52,type,
member_set_set_a: set_set_a > set_set_set_a > $o ).
thf(func_def_53,type,
member_set_a: set_a > set_set_a > $o ).
thf(func_def_54,type,
member_a: a > set_a > $o ).
thf(func_def_55,type,
a2: a ).
thf(func_def_56,type,
b: a ).
thf(func_def_57,type,
h: a > int ).
thf(func_def_58,type,
t1: binary1439146945Tree_a ).
thf(func_def_59,type,
t2: binary1439146945Tree_a ).
thf(func_def_60,type,
x: a ).
thf(func_def_64,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_65,type,
vAND: $o > $o > $o ).
thf(func_def_66,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_67,type,
vIMP: $o > $o > $o ).
thf(func_def_68,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_69,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_70,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_71,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_72,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_73,type,
vOR: $o > $o > $o ).
thf(func_def_74,type,
vNOT: $o > $o ).
thf(func_def_75,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_76,type,
sK0: ( binary1439146945Tree_a > $o ) > binary1439146945Tree_a ).
thf(func_def_77,type,
sK1: ( binary1439146945Tree_a > $o ) > a ).
thf(func_def_78,type,
sK2: ( binary1439146945Tree_a > $o ) > binary1439146945Tree_a ).
thf(func_def_79,type,
sK3: binary1439146945Tree_a > binary1439146945Tree_a ).
thf(func_def_80,type,
sK4: binary1439146945Tree_a > a ).
thf(func_def_81,type,
sK5: binary1439146945Tree_a > binary1439146945Tree_a ).
thf(func_def_82,type,
sK6: int > int ).
thf(func_def_83,type,
sK7: int > int ).
thf(func_def_84,type,
sK8: int > int ).
thf(func_def_85,type,
sK9: int > int ).
thf(func_def_86,type,
sK10: ( int > $o ) > ( int > $o ) > ( int > $o ) > ( int > $o ) > int ).
thf(func_def_87,type,
sK11: int > ( int > $o ) > ( int > $o ) > int ).
thf(func_def_88,type,
sK12: int > ( int > $o ) > ( int > $o ) > int ).
thf(func_def_89,type,
sK13: ( int > $o ) > ( int > $o ) > ( int > $o ) > ( int > $o ) > int ).
thf(func_def_90,type,
sK14: int > ( int > $o ) > ( int > $o ) > int ).
thf(func_def_91,type,
sK15: int > ( int > $o ) > ( int > $o ) > int ).
thf(func_def_92,type,
sK16: ( int > $o ) > ( int > $o ) > ( int > $o ) > ( int > $o ) > int ).
thf(func_def_93,type,
sK17: int > ( int > $o ) > ( int > $o ) > int ).
thf(func_def_94,type,
sK18: int > ( int > $o ) > ( int > $o ) > int ).
thf(func_def_95,type,
sK19: int > int ).
thf(func_def_96,type,
sK20: int > int ).
thf(func_def_97,type,
sK21: int > int ).
thf(func_def_98,type,
sK22: int > int ).
thf(func_def_99,type,
sK23: ( int > $o ) > ( int > $o ) > ( int > $o ) > ( int > $o ) > int ).
thf(func_def_100,type,
sK24: int > ( int > $o ) > ( int > $o ) > int ).
thf(func_def_101,type,
sK25: int > ( int > $o ) > ( int > $o ) > int ).
thf(func_def_102,type,
sK26: ( a > $o ) > ( a > $o ) > a ).
thf(func_def_103,type,
sK27: ( int > set_a ) > int ).
thf(func_def_104,type,
sK28: ( int > set_a ) > int ).
thf(func_def_105,type,
sK29: ( int > a > $o ) > int ).
thf(func_def_106,type,
sK30: ( int > a > $o ) > int ).
thf(func_def_107,type,
sK31: ( set_a > int ) > set_a ).
thf(func_def_108,type,
sK32: ( set_a > int ) > set_a ).
thf(func_def_109,type,
sK33: ( set_a > set_a ) > set_a ).
thf(func_def_110,type,
sK34: ( set_a > set_a ) > set_a ).
thf(func_def_111,type,
sK35: ( set_a > a > $o ) > set_a ).
thf(func_def_112,type,
sK36: ( set_a > a > $o ) > set_a ).
thf(func_def_113,type,
sK37: ( ( a > $o ) > int ) > a > $o ).
thf(func_def_114,type,
sK38: ( ( a > $o ) > int ) > a > $o ).
thf(func_def_115,type,
sK39: ( ( a > $o ) > set_a ) > a > $o ).
thf(func_def_116,type,
sK40: ( ( a > $o ) > set_a ) > a > $o ).
thf(func_def_117,type,
sK41: ( ( a > $o ) > a > $o ) > a > $o ).
thf(func_def_118,type,
sK42: ( ( a > $o ) > a > $o ) > a > $o ).
thf(func_def_119,type,
sK43: ( int > int ) > int ).
thf(func_def_120,type,
sK44: ( int > int ) > int ).
thf(func_def_121,type,
sK45: ( int > set_a ) > int ).
thf(func_def_122,type,
sK46: ( int > set_a ) > int ).
thf(func_def_123,type,
sK47: ( int > a > $o ) > int ).
thf(func_def_124,type,
sK48: ( int > a > $o ) > int ).
thf(func_def_125,type,
sK49: ( set_a > int ) > set_a ).
thf(func_def_126,type,
sK50: ( set_a > int ) > set_a ).
thf(func_def_127,type,
sK51: ( set_a > set_a ) > set_a ).
thf(func_def_128,type,
sK52: ( set_a > set_a ) > set_a ).
thf(func_def_129,type,
sK53: ( set_a > a > $o ) > set_a ).
thf(func_def_130,type,
sK54: ( set_a > a > $o ) > set_a ).
thf(func_def_131,type,
sK55: ( ( a > $o ) > int ) > a > $o ).
thf(func_def_132,type,
sK56: ( ( a > $o ) > int ) > a > $o ).
thf(func_def_133,type,
sK57: ( ( a > $o ) > set_a ) > a > $o ).
thf(func_def_134,type,
sK58: ( ( a > $o ) > set_a ) > a > $o ).
thf(func_def_135,type,
sK59: ( ( a > $o ) > a > $o ) > a > $o ).
thf(func_def_136,type,
sK60: ( ( a > $o ) > a > $o ) > a > $o ).
thf(func_def_137,type,
sK61: ( int > int ) > int ).
thf(func_def_138,type,
sK62: ( int > int ) > int ).
thf(func_def_139,type,
sK63: ( set_a > int ) > set_a ).
thf(func_def_140,type,
sK64: ( set_a > int ) > set_a ).
thf(func_def_141,type,
sK65: ( ( a > $o ) > int ) > a > $o ).
thf(func_def_142,type,
sK66: ( ( a > $o ) > int ) > a > $o ).
thf(func_def_143,type,
sK67: ( int > set_a ) > int ).
thf(func_def_144,type,
sK68: ( int > set_a ) > int ).
thf(func_def_145,type,
sK69: ( set_a > set_a ) > set_a ).
thf(func_def_146,type,
sK70: ( set_a > set_a ) > set_a ).
thf(func_def_147,type,
sK71: ( ( a > $o ) > set_a ) > a > $o ).
thf(func_def_148,type,
sK72: ( ( a > $o ) > set_a ) > a > $o ).
thf(func_def_149,type,
sK73: ( int > a > $o ) > int ).
thf(func_def_150,type,
sK74: ( int > a > $o ) > int ).
thf(func_def_151,type,
sK75: ( set_a > a > $o ) > set_a ).
thf(func_def_152,type,
sK76: ( set_a > a > $o ) > set_a ).
thf(func_def_153,type,
sK77: ( ( a > $o ) > a > $o ) > a > $o ).
thf(func_def_154,type,
sK78: ( ( a > $o ) > a > $o ) > a > $o ).
thf(func_def_155,type,
sK79: ( int > int ) > int ).
thf(func_def_156,type,
sK80: ( int > int ) > int ).
thf(func_def_157,type,
sK81: ( int > set_a ) > int ).
thf(func_def_158,type,
sK82: ( int > set_a ) > int ).
thf(func_def_159,type,
sK83: ( int > a > $o ) > int ).
thf(func_def_160,type,
sK84: ( int > a > $o ) > int ).
thf(func_def_161,type,
sK85: ( set_a > int ) > set_a ).
thf(func_def_162,type,
sK86: ( set_a > int ) > set_a ).
thf(func_def_163,type,
sK87: ( set_a > set_a ) > set_a ).
thf(func_def_164,type,
sK88: ( set_a > set_a ) > set_a ).
thf(func_def_165,type,
sK89: ( set_a > a > $o ) > set_a ).
thf(func_def_166,type,
sK90: ( set_a > a > $o ) > set_a ).
thf(func_def_167,type,
sK91: ( ( a > $o ) > int ) > a > $o ).
thf(func_def_168,type,
sK92: ( ( a > $o ) > int ) > a > $o ).
thf(func_def_169,type,
sK93: ( ( a > $o ) > set_a ) > a > $o ).
thf(func_def_170,type,
sK94: ( ( a > $o ) > set_a ) > a > $o ).
thf(func_def_171,type,
sK95: ( ( a > $o ) > a > $o ) > a > $o ).
thf(func_def_172,type,
sK96: ( ( a > $o ) > a > $o ) > a > $o ).
thf(func_def_173,type,
sK97: ( int > int ) > int ).
thf(func_def_174,type,
sK98: ( int > int ) > int ).
thf(func_def_175,type,
sK99: int > int ).
thf(func_def_176,type,
sK100: int > int ).
thf(func_def_177,type,
sK101: ( int > int > $o ) > int ).
thf(func_def_178,type,
sK102: ( int > int > $o ) > int ).
thf(func_def_179,type,
sK103: ( int > int > $o ) > int ).
thf(func_def_180,type,
sK104: ( int > int > $o ) > int ).
thf(func_def_181,type,
sK105: ( int > int > $o ) > int ).
thf(func_def_182,type,
sK106: set_set_a > set_a ).
thf(func_def_183,type,
sK107: set_a > a ).
thf(func_def_184,type,
sK108: set_set_a > set_a ).
thf(func_def_185,type,
sK109: set_set_a > set_a ).
thf(func_def_186,type,
sK110: set_a > a ).
thf(func_def_187,type,
sK111: set_a > a ).
thf(func_def_188,type,
sK112: binary594033953_set_a > set_a > binary594033953_set_a ).
thf(func_def_189,type,
sK113: binary594033953_set_a > set_a > set_a ).
thf(func_def_190,type,
sK114: binary594033953_set_a > set_a > binary594033953_set_a ).
thf(func_def_191,type,
sK115: binary594033953_set_a > set_a > binary594033953_set_a ).
thf(func_def_192,type,
sK116: binary594033953_set_a > set_a > binary594033953_set_a ).
thf(func_def_193,type,
sK117: binary594033953_set_a > set_a > binary594033953_set_a ).
thf(func_def_194,type,
sK118: binary594033953_set_a > set_a > set_a ).
thf(func_def_195,type,
sK119: binary594033953_set_a > set_a > binary594033953_set_a ).
thf(func_def_196,type,
sK120: binary1439146945Tree_a > a > binary1439146945Tree_a ).
thf(func_def_197,type,
sK121: binary1439146945Tree_a > a > a ).
thf(func_def_198,type,
sK122: binary1439146945Tree_a > a > binary1439146945Tree_a ).
thf(func_def_199,type,
sK123: binary1439146945Tree_a > a > binary1439146945Tree_a ).
thf(func_def_200,type,
sK124: binary1439146945Tree_a > a > binary1439146945Tree_a ).
thf(func_def_201,type,
sK125: binary1439146945Tree_a > a > binary1439146945Tree_a ).
thf(func_def_202,type,
sK126: binary1439146945Tree_a > a > a ).
thf(func_def_203,type,
sK127: binary1439146945Tree_a > a > binary1439146945Tree_a ).
thf(func_def_204,type,
sK128: set_a > a ).
thf(func_def_205,type,
sK129: set_set_a > set_a > set_set_a ).
thf(func_def_206,type,
sK130: set_a > a > set_a ).
thf(func_def_207,type,
sK131: set_set_a > set_a > set_set_a ).
thf(func_def_208,type,
sK132: set_a > a > set_a ).
thf(func_def_209,type,
sK133: set_a > set_set_a > ( set_a > set_a > $o ) > set_a ).
thf(func_def_210,type,
sK134: a > set_a > ( a > a > $o ) > a ).
thf(func_def_211,type,
sK135: set_a > set_set_a > set_a ).
thf(func_def_212,type,
sK136: ( set_a > set_a > $o ) > ( set_a > set_a > $o ) > set_set_a > set_a ).
thf(func_def_213,type,
sK137: ( set_a > set_a > $o ) > ( set_a > set_a > $o ) > set_set_a > set_a ).
thf(func_def_214,type,
sK138: ( a > a > $o ) > ( a > a > $o ) > set_a > a ).
thf(func_def_215,type,
sK139: ( a > a > $o ) > ( a > a > $o ) > set_a > a ).
thf(func_def_216,type,
sK140: set_a > set_set_a > set_a ).
thf(func_def_217,type,
sK141: set_a > set_a > a ).
thf(func_def_218,type,
db4:
!>[X0: $tType] : X0 ).
thf(func_def_219,type,
sK142: set_a > ( a > $o ) > a ).
thf(func_def_220,type,
sK143: set_a > ( a > $o ) > a ).
thf(func_def_221,type,
sK144: set_a > set_a > ( a > $o ) > a ).
thf(func_def_222,type,
sK145: set_a > set_a > ( a > $o ) > a ).
thf(func_def_223,type,
sK146: set_a > set_a > ( a > $o ) > a ).
thf(func_def_224,type,
sK147: set_a > set_a > ( a > $o ) > a ).
thf(func_def_225,type,
sK148: set_a > ( a > $o ) > a ).
thf(func_def_226,type,
sK149: set_a > ( a > $o ) > a ).
thf(func_def_227,type,
sK150: set_a > a > set_a > a > set_a ).
thf(func_def_228,type,
sK151: set_set_a > set_a > set_set_a > set_a > set_set_a ).
thf(func_def_229,type,
sK152: a > a ).
thf(func_def_230,type,
sK153: set_a > a ).
thf(func_def_231,type,
sK154: set_a > a ).
thf(func_def_232,type,
sK155: set_a > a ).
thf(func_def_233,type,
sK156: set_a > a ).
thf(func_def_234,type,
sK157: set_set_a > set_a ).
thf(func_def_235,type,
sK158: set_a > a ).
thf(func_def_236,type,
sK159: set_set_a > set_a ).
thf(func_def_237,type,
sK160: ( a > $o ) > a ).
thf(func_def_238,type,
sK161: ( a > $o ) > a ).
thf(func_def_239,type,
sK162: a > binary1439146945Tree_a > ( a > int ) > a ).
thf(func_def_240,type,
sK163: binary1439146945Tree_a > ( a > int ) > a > a ).
thf(f1,axiom,
( ( h @ a2 )
= ( h @ b ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_hahb) ).
thf(f2,axiom,
ord_less_int @ ( h @ b ) @ ( h @ a2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1__092_060open_062h_Ab_A_060_Ah_Aa_092_060close_062) ).
thf(f310,axiom,
( ord_less_int
= ( ^ [X0: int,X1: int] :
( ( X1 != X0 )
& ( X1
= ( sup_sup_int @ X1 @ X0 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_309_sup_Ostrict__order__iff) ).
thf(f353,plain,
ord_less_int @ ( h @ b ) @ ( h @ a2 ),
inference(rectify,[],[f2]) ).
thf(f354,plain,
( ( ord_less_int @ ( h @ b ) @ ( h @ a2 ) )
= $true ),
inference(fool_elimination,[],[f353]) ).
thf(f863,plain,
( ord_less_int
= ( ^ [Y0: int,Y1: int] :
( ( ( sup_sup_int @ Y1 @ Y0 )
= Y1 )
& ( Y0 != Y1 ) ) ) ),
inference(fool_elimination,[],[f310]) ).
thf(f1355,plain,
( ( h @ a2 )
= ( h @ b ) ),
inference(cnf_transformation,[],[f1]) ).
thf(f1356,plain,
( ( ord_less_int @ ( h @ b ) @ ( h @ a2 ) )
= $true ),
inference(cnf_transformation,[],[f354]) ).
thf(f1737,plain,
( ord_less_int
= ( ^ [Y0: int,Y1: int] :
( ( ( sup_sup_int @ Y1 @ Y0 )
= Y1 )
& ( Y0 != Y1 ) ) ) ),
inference(cnf_transformation,[],[f863]) ).
thf(f1800,plain,
( $true
= ( ^ [Y0: int,Y1: int] :
( ( ( sup_sup_int @ Y1 @ Y0 )
= Y1 )
& ( Y0 != Y1 ) )
@ ( h @ b )
@ ( h @ a2 ) ) ),
inference(definition_unfolding,[],[f1356,f1737]) ).
thf(f8358,plain,
( $true
= ( ( ( sup_sup_int @ ( h @ a2 ) @ ( h @ b ) )
= ( h @ a2 ) )
& ( ( h @ b )
!= ( h @ a2 ) ) ) ),
inference(beta-eta_normalization,[],[f1800]) ).
thf(f8359,plain,
( $true
= ( ( h @ b )
!= ( h @ a2 ) ) ),
inference(and_proxy_clausification,[],[f8358]) ).
thf(f8362,plain,
( $false
= ( ( h @ b )
= ( h @ a2 ) ) ),
inference(not_proxy_clausification,[],[f8359]) ).
thf(f8363,plain,
( ( h @ a2 )
!= ( h @ b ) ),
inference(equality_proxy_clausification,[],[f8362]) ).
thf(f8425,definition,
( spl164_15
<=> ( ( h @ a2 )
= ( h @ b ) ) ),
introduced(definition,[new_symbols(definition,[spl164_15])],[avatar_definition]) ).
thf(f8459,plain,
~ spl164_15,
inference(avatar_split_clause,[],[f8363,f8425]) ).
thf(f8460,plain,
spl164_15,
inference(avatar_split_clause,[],[f1355,f8425]) ).
cnf(s29,plain,
~ spl164_15,
inference(sat_conversion,[],[f8459]) ).
cnf(s30,plain,
spl164_15,
inference(sat_conversion,[],[f8460]) ).
cnf(s31,plain,
$false,
inference(rat,[],[s29,s30]) ).
thf(f8461,plain,
$false,
inference(avatar_sat_refutation,[],[s31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ITP029^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.08/0.19 % Computer : n019.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 19:38:48 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22 Running first-order model finding
% 0.08/0.22 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
% 0.92/0.39 % (1251763)Will run a generic schedule for satisfiability detection.
% 0.92/0.39 % (1251773)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3355945676:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.92/0.39 % (1251769)% WARNING: option uhcvi not known.
% 0.92/0.39 % (1251768)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=12361314_2999 on theBenchmark for (2999ds/0Mi)
% 0.92/0.39 % (1251769)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3312603525:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.92/0.39 % (1251772)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2383501108:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.92/0.39 % (1251770)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1755900764:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.92/0.39 % (1251771)dis+10_1_sil=32000:sp=arity:random_seed=2423576826:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.92/0.39 % (1251774)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2104955901:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.92/0.39 % (1251769)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.92/0.39 % (1251772)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.92/0.39 % (1251773)Instruction limit reached!
% 0.92/0.39 % (1251773)------------------------------
% 0.92/0.39 % (1251773)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.92/0.39 % (1251773)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.92/0.39 % (1251773)CaDiCaL version: 2.1.3
% 0.92/0.39 % (1251773)Termination reason: Instruction limit
% 0.92/0.39 % (1251773)Termination phase: Property scanning
% 0.92/0.39 % (1251773)Time elapsed: 0.028 s
% 0.92/0.39 % (1251773)Peak memory usage: 12 MB
% 0.92/0.39 % (1251773)Instructions burned: 132 (million)
% 0.92/0.39 % (1251782)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2114430419:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.92/0.39 % (1251771)Instruction limit reached!
% 0.92/0.39 % (1251771)------------------------------
% 0.92/0.39 % (1251771)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.92/0.39 % (1251771)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.92/0.39 % (1251771)CaDiCaL version: 2.1.3
% 0.92/0.39 % (1251771)Termination reason: Instruction limit
% 0.92/0.39 % (1251771)Termination phase: Property scanning
% 0.92/0.39 % (1251771)Time elapsed: 0.043 s
% 0.92/0.39 % (1251771)Peak memory usage: 11 MB
% 0.92/0.39 % (1251771)Instructions burned: 105 (million)
% 0.92/0.39 % (1251772)Instruction limit reached!
% 0.92/0.39 % (1251772)------------------------------
% 0.92/0.39 % (1251772)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.92/0.39 % (1251772)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.92/0.39 % (1251772)CaDiCaL version: 2.1.3
% 0.92/0.39 % (1251772)Termination reason: Instruction limit
% 0.92/0.39 % (1251772)Termination phase: Property scanning
% 0.92/0.39 % (1251772)Time elapsed: 0.048 s
% 0.92/0.39 % (1251772)Peak memory usage: 11 MB
% 0.92/0.39 % (1251772)Instructions burned: 117 (million)
% 0.92/0.39 % Exception at run slice level
% 0.92/0.39 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.92/0.39 % (1251769)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.92/0.39 % (1251784)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=155134146:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.92/0.39 % Exception at run slice level
% 0.92/0.39 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.92/0.39 % (1251785)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=318650252:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 0.92/0.39 % (1251788)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1095502743:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 0.92/0.39 % (1251786)ott-21_1_sil=16000:fs=off:random_seed=3948815194:i=180:av=off:fsr=off_2999 on theBenchmark for (2999ds/180Mi)
% 0.92/0.39 % (1251785)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.92/0.39 % (1251784)Instruction limit reached!
% 0.92/0.39 % (1251784)------------------------------
% 0.92/0.39 % (1251784)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.92/0.39 % (1251784)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.92/0.39 % (1251784)CaDiCaL version: 2.1.3
% 0.92/0.39 % (1251784)Termination reason: Instruction limit
% 0.92/0.39 % (1251784)Termination phase: Property scanning
% 0.92/0.39 % (1251784)Time elapsed: 0.053 s
% 0.92/0.39 % (1251784)Peak memory usage: 11 MB
% 0.92/0.39 % (1251784)Instructions burned: 132 (million)
% 0.92/0.39 % (1251769) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1251763-1251769"...
% 0.92/0.39 % (1251769)...printing done.
% 0.92/0.39 % (1251769)Refutation found. Thanks to Tanya!
% 0.92/0.39 % SZS status ContradictoryAxioms for theBenchmark
% 0.92/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.92/0.39 % (1251769)------------------------------
% 0.92/0.39 % (1251769)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.92/0.39 % (1251769)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.92/0.39 % (1251769)CaDiCaL version: 2.1.3
% 0.92/0.39 % (1251769)Termination reason: Refutation
% 0.92/0.39 % (1251769)Time elapsed: 0.123 s
% 0.92/0.39 % (1251769)Peak memory usage: 15 MB
% 0.92/0.39 % (1251769)Instructions burned: 295 (million)
% 0.92/0.39 % (1251763)Success in time 0.165 s
% 0.92/0.39 % Vampire exiting
%------------------------------------------------------------------------------