%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : ITP033^1 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n006.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Sep 30 08:08:02 AM UTC 2026
% Result : Theorem 0.29s 0.44s
% Output : Refutation 0.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 32 ( 17 unt; 0 typ; 2 def)
% Number of atoms : 89 ( 20 equ; 0 cnn)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 128 ( 19 ~; 12 |; 0 &; 92 @)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 6 ( 5 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 246 ( 243 usr; 10 con; 0-4 aty)
% Number of variables : 24 ( 0 sgn 24 !; 0 ?; 24 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
produc376588196ee_a_a: $tType ).
thf(type_def_6,type,
binary1439146945Tree_a: $tType ).
thf(type_def_7,type,
set_a: $tType ).
thf(type_def_8,type,
int: $tType ).
thf(type_def_9,type,
a: $tType ).
thf(type_def_10,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
binary717961607le_T_a: binary1439146945Tree_a > a > binary1439146945Tree_a > binary1439146945Tree_a ).
thf(func_def_1,type,
binary476621312_Tip_a: binary1439146945Tree_a ).
thf(func_def_2,type,
binary1226383794sert_a: ( a > int ) > a > binary1439146945Tree_a > binary1439146945Tree_a ).
thf(func_def_3,type,
binary2053421120memb_a: ( a > int ) > a > binary1439146945Tree_a > $o ).
thf(func_def_4,type,
binary1804682569move_a: ( a > int ) > a > binary1439146945Tree_a > binary1439146945Tree_a ).
thf(func_def_5,type,
binary339557810e_rm_a: ( a > int ) > binary1439146945Tree_a > a ).
thf(func_def_6,type,
binary945792244etOf_a: binary1439146945Tree_a > set_a ).
thf(func_def_7,type,
binary1721989714Tree_a: ( a > int ) > binary1439146945Tree_a > $o ).
thf(func_def_8,type,
binary670562003pred_a: ( a > int ) > a > a > binary1439146945Tree_a > $o ).
thf(func_def_9,type,
binary1217730267_wrm_a: ( a > int ) > binary1439146945Tree_a > binary1439146945Tree_a ).
thf(func_def_10,type,
binary1774981152rmrm_a: ( a > int ) > binary1439146945Tree_a > produc376588196ee_a_a ).
thf(func_def_11,type,
bot_bot_a_o: a > $o ).
thf(func_def_12,type,
bot_bot_o: $o ).
thf(func_def_13,type,
bot_bot_set_a: set_a ).
thf(func_def_14,type,
ord_less_a_o: ( a > $o ) > ( a > $o ) > $o ).
thf(func_def_15,type,
ord_less_int: int > int > $o ).
thf(func_def_16,type,
ord_less_set_a: set_a > set_a > $o ).
thf(func_def_17,type,
ord_less_eq_a_o: ( a > $o ) > ( a > $o ) > $o ).
thf(func_def_18,type,
ord_less_eq_o: $o > $o > $o ).
thf(func_def_19,type,
ord_less_eq_int: int > int > $o ).
thf(func_def_20,type,
ord_less_eq_set_a: set_a > set_a > $o ).
thf(func_def_21,type,
ordering_top_a_o: ( ( a > $o ) > ( a > $o ) > $o ) > ( ( a > $o ) > ( a > $o ) > $o ) > ( a > $o ) > $o ).
thf(func_def_22,type,
ordering_top_set_a: ( set_a > set_a > $o ) > ( set_a > set_a > $o ) > set_a > $o ).
thf(func_def_23,type,
produc374321428ee_a_a: binary1439146945Tree_a > a > produc376588196ee_a_a ).
thf(func_def_24,type,
produc1275654896Tree_a: ( binary1439146945Tree_a > a > binary1439146945Tree_a ) > produc376588196ee_a_a > binary1439146945Tree_a ).
thf(func_def_25,type,
collect_a: ( a > $o ) > set_a ).
thf(func_def_26,type,
member_a: a > set_a > $o ).
thf(func_def_27,type,
h: a > int ).
thf(func_def_28,type,
t1: binary1439146945Tree_a ).
thf(func_def_29,type,
t2: binary1439146945Tree_a ).
thf(func_def_30,type,
x: a ).
thf(func_def_34,type,
vOR: $o > $o > $o ).
thf(func_def_35,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_36,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_37,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_38,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_39,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_40,type,
vIMP: $o > $o > $o ).
thf(func_def_41,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_42,type,
vAND: $o > $o > $o ).
thf(func_def_43,type,
vNOT: $o > $o ).
thf(func_def_44,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_45,type,
sK0: ( set_a > a > $o ) > set_a ).
thf(func_def_46,type,
sK1: ( set_a > a > $o ) > set_a ).
thf(func_def_47,type,
sK2: ( int > a > $o ) > int ).
thf(func_def_48,type,
sK3: ( int > a > $o ) > int ).
thf(func_def_49,type,
sK4: ( ( a > $o ) > a > $o ) > a > $o ).
thf(func_def_50,type,
sK5: ( ( a > $o ) > a > $o ) > a > $o ).
thf(func_def_51,type,
sK6: ( ( a > $o ) > a > $o ) > a > $o ).
thf(func_def_52,type,
sK7: ( ( a > $o ) > a > $o ) > a > $o ).
thf(func_def_53,type,
sK8: ( int > int > $o ) > int ).
thf(func_def_54,type,
sK9: ( int > int > $o ) > int ).
thf(func_def_55,type,
sK10: ( int > int > $o ) > int ).
thf(func_def_56,type,
sK11: ( int > int > $o ) > int ).
thf(func_def_57,type,
sK12: ( int > int > $o ) > int ).
thf(func_def_58,type,
sK13: ( set_a > int ) > set_a ).
thf(func_def_59,type,
sK14: ( set_a > int ) > set_a ).
thf(func_def_60,type,
sK15: ( set_a > int ) > set_a ).
thf(func_def_61,type,
sK16: ( set_a > int ) > set_a ).
thf(func_def_62,type,
sK17: ( ( a > $o ) > set_a ) > a > $o ).
thf(func_def_63,type,
sK18: ( ( a > $o ) > set_a ) > a > $o ).
thf(func_def_64,type,
sK19: binary1439146945Tree_a > binary1439146945Tree_a ).
thf(func_def_65,type,
sK20: binary1439146945Tree_a > a ).
thf(func_def_66,type,
sK21: binary1439146945Tree_a > binary1439146945Tree_a ).
thf(func_def_67,type,
sK22: ( ( a > $o ) > set_a ) > a > $o ).
thf(func_def_68,type,
sK23: ( ( a > $o ) > set_a ) > a > $o ).
thf(func_def_69,type,
sK24: ( int > int ) > int ).
thf(func_def_70,type,
sK25: ( int > int ) > int ).
thf(func_def_71,type,
sK26: ( ( a > $o ) > int ) > a > $o ).
thf(func_def_72,type,
sK27: ( ( a > $o ) > int ) > a > $o ).
thf(func_def_73,type,
sK28: ( ( a > $o ) > a > $o ) > a > $o ).
thf(func_def_74,type,
sK29: ( ( a > $o ) > a > $o ) > a > $o ).
thf(func_def_75,type,
sK30: ( set_a > int ) > set_a ).
thf(func_def_76,type,
sK31: ( set_a > int ) > set_a ).
thf(func_def_77,type,
sK32: ( int > a > $o ) > int ).
thf(func_def_78,type,
sK33: ( int > a > $o ) > int ).
thf(func_def_79,type,
sK34: ( int > a > $o ) > int ).
thf(func_def_80,type,
sK35: ( int > a > $o ) > int ).
thf(func_def_81,type,
sK36: ( a > $o ) > ( a > $o ) > a ).
thf(func_def_82,type,
sK37: int > ( int > $o ) > int > int ).
thf(func_def_83,type,
sK38: int > ( int > $o ) > int > int ).
thf(func_def_84,type,
sK39: set_a > ( a > $o ) > a ).
thf(func_def_85,type,
sK40: ( set_a > set_a ) > set_a ).
thf(func_def_86,type,
sK41: ( set_a > set_a ) > set_a ).
thf(func_def_87,type,
sK42: ( ( a > $o ) > a > $o ) > a > $o ).
thf(func_def_88,type,
sK43: ( ( a > $o ) > a > $o ) > a > $o ).
thf(func_def_89,type,
sK44: int > int ).
thf(func_def_90,type,
sK45: ( ( a > $o ) > set_a ) > a > $o ).
thf(func_def_91,type,
sK46: ( ( a > $o ) > set_a ) > a > $o ).
thf(func_def_92,type,
sK47: ( ( a > $o ) > set_a ) > a > $o ).
thf(func_def_93,type,
sK48: ( ( a > $o ) > set_a ) > a > $o ).
thf(func_def_94,type,
sK49: ( int > a > $o ) > int ).
thf(func_def_95,type,
sK50: ( int > a > $o ) > int ).
thf(func_def_96,type,
sK51: ( int > set_a ) > int ).
thf(func_def_97,type,
sK52: ( int > set_a ) > int ).
thf(func_def_98,type,
sK53: ( set_a > int ) > set_a ).
thf(func_def_99,type,
sK54: ( set_a > int ) > set_a ).
thf(func_def_100,type,
sK55: ( ( a > $o ) > set_a ) > a > $o ).
thf(func_def_101,type,
sK56: ( ( a > $o ) > set_a ) > a > $o ).
thf(func_def_102,type,
sK57: ( ( a > $o ) > a > $o ) > a > $o ).
thf(func_def_103,type,
sK58: ( ( a > $o ) > a > $o ) > a > $o ).
thf(func_def_104,type,
sK59: ( set_a > a > $o ) > set_a ).
thf(func_def_105,type,
sK60: ( set_a > a > $o ) > set_a ).
thf(func_def_106,type,
sK61: ( set_a > set_a ) > set_a ).
thf(func_def_107,type,
sK62: ( set_a > set_a ) > set_a ).
thf(func_def_108,type,
sK63: ( ( a > $o ) > int ) > a > $o ).
thf(func_def_109,type,
sK64: ( ( a > $o ) > int ) > a > $o ).
thf(func_def_110,type,
sK65: ( set_a > set_a ) > set_a ).
thf(func_def_111,type,
sK66: ( set_a > set_a ) > set_a ).
thf(func_def_112,type,
sK67: ( a > $o ) > a ).
thf(func_def_113,type,
sK68: set_a > a ).
thf(func_def_114,type,
sK69: ( ( a > $o ) > a > $o ) > a > $o ).
thf(func_def_115,type,
sK70: ( ( a > $o ) > a > $o ) > a > $o ).
thf(func_def_116,type,
sK71: ( set_a > a > $o ) > set_a ).
thf(func_def_117,type,
sK72: ( set_a > a > $o ) > set_a ).
thf(func_def_118,type,
sK73: ( ( a > $o ) > int ) > a > $o ).
thf(func_def_119,type,
sK74: ( ( a > $o ) > int ) > a > $o ).
thf(func_def_120,type,
sK75: ( a > $o ) > a ).
thf(func_def_121,type,
sK76: ( set_a > int ) > set_a ).
thf(func_def_122,type,
sK77: ( set_a > int ) > set_a ).
thf(func_def_123,type,
sK78: ( set_a > int ) > set_a ).
thf(func_def_124,type,
sK79: ( set_a > int ) > set_a ).
thf(func_def_125,type,
sK80: ( a > $o ) > ( a > $o ) > a ).
thf(func_def_126,type,
sK81: ( set_a > a > $o ) > set_a ).
thf(func_def_127,type,
sK82: ( set_a > a > $o ) > set_a ).
thf(func_def_128,type,
sK83: ( set_a > int ) > set_a ).
thf(func_def_129,type,
sK84: ( set_a > int ) > set_a ).
thf(func_def_130,type,
sK85: ( ( a > $o ) > a > $o ) > a > $o ).
thf(func_def_131,type,
sK86: ( ( a > $o ) > a > $o ) > a > $o ).
thf(func_def_132,type,
sK87: ( ( a > $o ) > int ) > a > $o ).
thf(func_def_133,type,
sK88: ( ( a > $o ) > int ) > a > $o ).
thf(func_def_134,type,
sK89: ( set_a > set_a ) > set_a ).
thf(func_def_135,type,
sK90: ( set_a > set_a ) > set_a ).
thf(func_def_136,type,
sK91: ( set_a > a > $o ) > set_a ).
thf(func_def_137,type,
sK92: ( set_a > a > $o ) > set_a ).
thf(func_def_138,type,
sK93: ( ( a > $o ) > set_a ) > a > $o ).
thf(func_def_139,type,
sK94: ( ( a > $o ) > set_a ) > a > $o ).
thf(func_def_140,type,
sK95: ( set_a > set_a ) > set_a ).
thf(func_def_141,type,
sK96: ( set_a > set_a ) > set_a ).
thf(func_def_142,type,
sK97: ( set_a > set_a ) > set_a ).
thf(func_def_143,type,
sK98: ( set_a > set_a ) > set_a ).
thf(func_def_144,type,
sK99: int > int ).
thf(func_def_145,type,
sK100: ( int > int ) > int ).
thf(func_def_146,type,
sK101: ( int > int ) > int ).
thf(func_def_147,type,
sK102: ( int > a > $o ) > int ).
thf(func_def_148,type,
sK103: ( int > a > $o ) > int ).
thf(func_def_149,type,
sK104: ( ( a > $o ) > set_a ) > a > $o ).
thf(func_def_150,type,
sK105: ( ( a > $o ) > set_a ) > a > $o ).
thf(func_def_151,type,
sK106: set_a > a ).
thf(func_def_152,type,
sK107: ( ( a > $o ) > a > $o ) > a > $o ).
thf(func_def_153,type,
sK108: ( ( a > $o ) > a > $o ) > a > $o ).
thf(func_def_154,type,
sK109: ( ( a > $o ) > a > $o ) > a > $o ).
thf(func_def_155,type,
sK110: ( ( a > $o ) > a > $o ) > a > $o ).
thf(func_def_156,type,
sK111: ( set_a > a > $o ) > set_a ).
thf(func_def_157,type,
sK112: ( set_a > a > $o ) > set_a ).
thf(func_def_158,type,
sK113: ( set_a > a > $o ) > set_a ).
thf(func_def_159,type,
sK114: ( set_a > a > $o ) > set_a ).
thf(func_def_160,type,
sK115: ( ( a > $o ) > set_a ) > a > $o ).
thf(func_def_161,type,
sK116: ( ( a > $o ) > set_a ) > a > $o ).
thf(func_def_162,type,
sK117: ( ( a > $o ) > int ) > a > $o ).
thf(func_def_163,type,
sK118: ( ( a > $o ) > int ) > a > $o ).
thf(func_def_164,type,
sK119: ( int > set_a ) > int ).
thf(func_def_165,type,
sK120: ( int > set_a ) > int ).
thf(func_def_166,type,
sK121: int > int ).
thf(func_def_167,type,
sK122: set_a > set_a > a ).
thf(func_def_168,type,
sK123: ( ( a > $o ) > a > $o ) > a > $o ).
thf(func_def_169,type,
sK124: ( ( a > $o ) > a > $o ) > a > $o ).
thf(func_def_170,type,
sK125: set_a > a ).
thf(func_def_171,type,
sK126: ( ( a > $o ) > set_a ) > a > $o ).
thf(func_def_172,type,
sK127: ( ( a > $o ) > set_a ) > a > $o ).
thf(func_def_173,type,
sK128: ( int > int ) > int ).
thf(func_def_174,type,
sK129: ( int > int ) > int ).
thf(func_def_175,type,
sK130: ( ( a > $o ) > a > $o ) > a > $o ).
thf(func_def_176,type,
sK131: ( ( a > $o ) > a > $o ) > a > $o ).
thf(func_def_177,type,
sK132: ( set_a > a > $o ) > set_a ).
thf(func_def_178,type,
sK133: ( set_a > a > $o ) > set_a ).
thf(func_def_179,type,
sK134: ( ( a > $o ) > int ) > a > $o ).
thf(func_def_180,type,
sK135: ( ( a > $o ) > int ) > a > $o ).
thf(func_def_181,type,
sK136: ( ( a > $o ) > int ) > a > $o ).
thf(func_def_182,type,
sK137: ( ( a > $o ) > int ) > a > $o ).
thf(func_def_183,type,
sK138: ( int > int ) > int ).
thf(func_def_184,type,
sK139: ( int > int ) > int ).
thf(func_def_185,type,
sK140: ( a > $o ) > ( a > $o ) > a ).
thf(func_def_186,type,
sK141: ( set_a > set_a ) > set_a ).
thf(func_def_187,type,
sK142: ( set_a > set_a ) > set_a ).
thf(func_def_188,type,
sK143: int > int ).
thf(func_def_189,type,
sK144: ( binary1439146945Tree_a > $o ) > a ).
thf(func_def_190,type,
sK145: ( binary1439146945Tree_a > $o ) > binary1439146945Tree_a ).
thf(func_def_191,type,
sK146: ( binary1439146945Tree_a > $o ) > binary1439146945Tree_a ).
thf(func_def_192,type,
sK147: ( int > int ) > int ).
thf(func_def_193,type,
sK148: ( int > int ) > int ).
thf(func_def_194,type,
sK149: ( set_a > a > $o ) > set_a ).
thf(func_def_195,type,
sK150: ( set_a > a > $o ) > set_a ).
thf(func_def_196,type,
sK151: ( a > $o ) > set_a > ( a > $o ) > a ).
thf(func_def_197,type,
sK152: int > int ).
thf(func_def_198,type,
sK153: ( a > $o ) > ( a > $o ) > a ).
thf(func_def_199,type,
sK154: ( set_a > a > $o ) > set_a ).
thf(func_def_200,type,
sK155: ( set_a > a > $o ) > set_a ).
thf(func_def_201,type,
sK156: ( int > set_a ) > int ).
thf(func_def_202,type,
sK157: ( int > set_a ) > int ).
thf(func_def_203,type,
sK158: ( ( a > $o ) > a > $o ) > a > $o ).
thf(func_def_204,type,
sK159: ( ( a > $o ) > a > $o ) > a > $o ).
thf(func_def_205,type,
sK160: ( int > set_a ) > int ).
thf(func_def_206,type,
sK161: ( int > set_a ) > int ).
thf(func_def_207,type,
sK162: ( set_a > set_a ) > set_a ).
thf(func_def_208,type,
sK163: ( set_a > set_a ) > set_a ).
thf(func_def_209,type,
sK164: ( set_a > set_a ) > set_a ).
thf(func_def_210,type,
sK165: ( set_a > set_a ) > set_a ).
thf(func_def_211,type,
sK166: ( set_a > set_a ) > set_a ).
thf(func_def_212,type,
sK167: ( set_a > set_a ) > set_a ).
thf(func_def_213,type,
sK168: ( ( a > $o ) > set_a ) > a > $o ).
thf(func_def_214,type,
sK169: ( ( a > $o ) > set_a ) > a > $o ).
thf(func_def_215,type,
sK170: a > ( a > int ) > binary1439146945Tree_a > a ).
thf(func_def_216,type,
sK171: a > ( a > int ) > binary1439146945Tree_a > a ).
thf(func_def_217,type,
sK172: ( ( a > $o ) > set_a ) > a > $o ).
thf(func_def_218,type,
sK173: ( ( a > $o ) > set_a ) > a > $o ).
thf(func_def_219,type,
sK174: ( set_a > set_a ) > set_a ).
thf(func_def_220,type,
sK175: ( set_a > set_a ) > set_a ).
thf(func_def_221,type,
sK176: ( int > a > $o ) > int ).
thf(func_def_222,type,
sK177: ( int > a > $o ) > int ).
thf(func_def_223,type,
sK178: ( set_a > a > $o ) > set_a ).
thf(func_def_224,type,
sK179: ( set_a > a > $o ) > set_a ).
thf(func_def_225,type,
sK180: ( set_a > a > $o ) > set_a ).
thf(func_def_226,type,
sK181: ( set_a > a > $o ) > set_a ).
thf(func_def_227,type,
sK182: ( set_a > set_a ) > set_a ).
thf(func_def_228,type,
sK183: ( set_a > set_a ) > set_a ).
thf(func_def_229,type,
sK184: ( int > set_a ) > int ).
thf(func_def_230,type,
sK185: ( int > set_a ) > int ).
thf(func_def_231,type,
sK186: ( int > int ) > int ).
thf(func_def_232,type,
sK187: ( int > int ) > int ).
thf(func_def_233,type,
sK188: ( set_a > int ) > set_a ).
thf(func_def_234,type,
sK189: ( set_a > int ) > set_a ).
thf(func_def_235,type,
sK190: ( int > set_a ) > int ).
thf(func_def_236,type,
sK191: ( int > set_a ) > int ).
thf(func_def_237,type,
sK192: set_a > a ).
thf(func_def_238,type,
sK193: ( ( a > $o ) > set_a ) > a > $o ).
thf(func_def_239,type,
sK194: ( ( a > $o ) > set_a ) > a > $o ).
thf(func_def_240,type,
sK195: int > int ).
thf(func_def_241,type,
sK196: ( ( a > $o ) > int ) > a > $o ).
thf(func_def_242,type,
sK197: ( ( a > $o ) > int ) > a > $o ).
thf(f2,axiom,
binary1721989714Tree_a @ h @ ( binary717961607le_T_a @ t1 @ x @ t2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1_s) ).
thf(f4,axiom,
! [X1: binary1439146945Tree_a,X0: a > int,X3: binary1439146945Tree_a,X2: a] :
( ( binary1721989714Tree_a @ X0 @ ( binary717961607le_T_a @ X1 @ X2 @ X3 ) )
=> ( binary1721989714Tree_a @ X0 @ X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_3_sortLemmaL) ).
thf(f354,conjecture,
binary1721989714Tree_a @ h @ t1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
thf(f355,negated_conjecture,
~ ( binary1721989714Tree_a @ h @ t1 ),
inference(negated_conjecture,[status(cth)],[f354]) ).
thf(f501,plain,
! [X0: binary1439146945Tree_a,X1: a > int,X2: binary1439146945Tree_a,X3: a] :
( ( binary1721989714Tree_a @ X1 @ ( binary717961607le_T_a @ X0 @ X3 @ X2 ) )
=> ( binary1721989714Tree_a @ X1 @ X0 ) ),
inference(rectify,[],[f4]) ).
thf(f502,plain,
! [X2: binary1439146945Tree_a,X0: binary1439146945Tree_a,X3: a,X1: a > int] :
( ( $true
= ( binary1721989714Tree_a @ X1 @ ( binary717961607le_T_a @ X0 @ X3 @ X2 ) ) )
=> ( ( binary1721989714Tree_a @ X1 @ X0 )
= $true ) ),
inference(fool_elimination,[],[f501]) ).
thf(f580,plain,
binary1721989714Tree_a @ h @ ( binary717961607le_T_a @ t1 @ x @ t2 ),
inference(rectify,[],[f2]) ).
thf(f581,plain,
( ( binary1721989714Tree_a @ h @ ( binary717961607le_T_a @ t1 @ x @ t2 ) )
= $true ),
inference(fool_elimination,[],[f580]) ).
thf(f912,plain,
~ ( binary1721989714Tree_a @ h @ t1 ),
inference(rectify,[],[f355]) ).
thf(f913,plain,
( ( binary1721989714Tree_a @ h @ t1 )
!= $true ),
inference(fool_elimination,[],[f912]) ).
thf(f1089,plain,
( ( binary1721989714Tree_a @ h @ t1 )
!= $true ),
inference(flattening,[],[f913]) ).
thf(f1113,plain,
! [X2: binary1439146945Tree_a,X3: a,X0: binary1439146945Tree_a,X1: a > int] :
( ( $true
!= ( binary1721989714Tree_a @ X1 @ ( binary717961607le_T_a @ X0 @ X3 @ X2 ) ) )
| ( ( binary1721989714Tree_a @ X1 @ X0 )
= $true ) ),
inference(ennf_transformation,[],[f502]) ).
thf(f1788,plain,
! [X0: binary1439146945Tree_a,X1: a,X2: binary1439146945Tree_a,X3: a > int] :
( ( $true
!= ( binary1721989714Tree_a @ X3 @ ( binary717961607le_T_a @ X2 @ X1 @ X0 ) ) )
| ( ( binary1721989714Tree_a @ X3 @ X2 )
= $true ) ),
inference(rectify,[],[f1113]) ).
thf(f1856,plain,
( ( binary1721989714Tree_a @ h @ t1 )
!= $true ),
inference(cnf_transformation,[],[f1089]) ).
thf(f1878,plain,
( ( binary1721989714Tree_a @ h @ ( binary717961607le_T_a @ t1 @ x @ t2 ) )
= $true ),
inference(cnf_transformation,[],[f581]) ).
thf(f2257,plain,
! [X2: binary1439146945Tree_a,X3: a > int,X0: binary1439146945Tree_a,X1: a] :
( ( $true
!= ( binary1721989714Tree_a @ X3 @ ( binary717961607le_T_a @ X2 @ X1 @ X0 ) ) )
| ( ( binary1721989714Tree_a @ X3 @ X2 )
= $true ) ),
inference(cnf_transformation,[],[f1788]) ).
thf(f2473,definition,
( spl198_3
<=> ( ( binary1721989714Tree_a @ h @ t1 )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl198_3])],[avatar_definition]) ).
thf(f2475,plain,
( ( ( binary1721989714Tree_a @ h @ t1 )
!= $true )
| spl198_3 ),
inference(avatar_component_clause,[],[f2473]) ).
thf(f2498,definition,
( spl198_8
<=> ( ( binary1721989714Tree_a @ h @ ( binary717961607le_T_a @ t1 @ x @ t2 ) )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl198_8])],[avatar_definition]) ).
thf(f2500,plain,
( ( ( binary1721989714Tree_a @ h @ ( binary717961607le_T_a @ t1 @ x @ t2 ) )
= $true )
| ~ spl198_8 ),
inference(avatar_component_clause,[],[f2498]) ).
thf(f2501,plain,
spl198_8,
inference(avatar_split_clause,[],[f1878,f2498]) ).
thf(f2683,plain,
~ spl198_3,
inference(avatar_split_clause,[],[f1856,f2473]) ).
thf(f2746,plain,
( ( $true != $true )
| ( ( binary1721989714Tree_a @ h @ t1 )
= $true )
| ~ spl198_8 ),
inference(superposition,[],[f2257,f2500]) ).
thf(f2747,plain,
( ( ( binary1721989714Tree_a @ h @ t1 )
= $true )
| ~ spl198_8 ),
inference(trivial_inequality_removal,[],[f2746]) ).
thf(f2748,plain,
( $false
| spl198_3
| ~ spl198_8 ),
inference(forward_subsumption_resolution,[],[f2747,f2475]) ).
thf(f2749,plain,
( spl198_3
| ~ spl198_8 ),
inference(avatar_contradiction_clause,[],[f2748]) ).
cnf(s6,plain,
spl198_8,
inference(sat_conversion,[],[f2501]) ).
cnf(s57,plain,
~ spl198_3,
inference(sat_conversion,[],[f2683]) ).
cnf(s73,plain,
( spl198_3
| ~ spl198_8 ),
inference(sat_conversion,[],[f2749]) ).
cnf(s74,plain,
~ spl198_8,
inference(rat,[],[s73,s57]) ).
cnf(s75,plain,
$false,
inference(rat,[],[s6,s74]) ).
thf(f2750,plain,
$false,
inference(avatar_sat_refutation,[],[s75]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ITP033^1 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.20 % Computer : n006.cluster.edu
% 0.09/0.20 % Model : x86_64 x86_64
% 0.09/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20 % Memory : 8046.5625MB
% 0.09/0.20 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Tue Sep 29 19:38:46 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.24 Running higher-order theorem proving
% 0.24/0.29 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.29/0.43 % (1211435)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.29/0.43 % (1211446)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.29/0.43 % (1211446)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.29/0.43 % (1211440)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=685572662:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.29/0.43 % (1211443)dis+1002_4:1_sfv=off:to=lpo:plsq=on:fde=none:e2e=on:si=on:spb=non_intro:acc=on:uwa=off:fd=preordered:foolp=on:s2agt=32:slsqc=1:slsq=on:random_seed=574274643:hsq=on:hsqr=16,1:s2a=on:i=634:add=on:nm=16:nicw=on:rtra=on:gtg=position:ss=included:ixr=off:c=on:inj=on:ntd=on:rawr=on_2999 on theBenchmark for (2999ds/634Mi)
% 0.29/0.43 % (1211444)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=2669754789:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.29/0.43 % (1211446)dis+1002_8_to=kbo:sil=128000:tgt=full:drc=off:si=on:sp=const_max:lma=off:spb=non_intro:cbe=off:uwa=interpreted_only:random_seed=2482790442:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.29/0.43 % (1211442)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=4259822558:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.29/0.43 % (1211441)lrs+10_16_si=on:nwc=1.5:random_seed=1911272458:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.29/0.43 % (1211445)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=3356187973:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.29/0.43 % (1211442)Instruction limit reached!
% 0.29/0.43 % (1211442)------------------------------
% 0.29/0.43 % (1211442)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.29/0.43 % (1211442)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.29/0.43 % (1211442)CaDiCaL version: 2.1.3
% 0.29/0.43 % (1211442)Termination reason: Instruction limit
% 0.29/0.43 % (1211442)Termination phase: shuffling
% 0.29/0.43 % (1211442)Time elapsed: 0.002 s
% 0.29/0.43 % (1211442)Peak memory usage: 10 MB
% 0.29/0.43 % (1211442)Instructions burned: 4 (million)
% 0.29/0.43 % (1211444)Instruction limit reached!
% 0.29/0.43 % (1211444)------------------------------
% 0.29/0.43 % (1211444)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.29/0.43 % (1211444)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.29/0.43 % (1211444)CaDiCaL version: 2.1.3
% 0.29/0.43 % (1211444)Termination reason: Instruction limit
% 0.29/0.43 % (1211444)Termination phase: Property scanning
% 0.29/0.43 % (1211444)Time elapsed: 0.012 s
% 0.29/0.43 % (1211444)Peak memory usage: 10 MB
% 0.29/0.43 % (1211444)Instructions burned: 26 (million)
% 0.29/0.43 % (1211441)Instruction limit reached!
% 0.29/0.43 % (1211441)------------------------------
% 0.29/0.43 % (1211441)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.29/0.43 % (1211441)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.29/0.43 % (1211441)CaDiCaL version: 2.1.3
% 0.29/0.43 % (1211441)Termination reason: Instruction limit
% 0.29/0.43 % (1211441)Termination phase: shuffling
% 0.29/0.43 % (1211441)Time elapsed: 0.011 s
% 0.29/0.43 % (1211441)Peak memory usage: 10 MB
% 0.29/0.43 % (1211441)Instructions burned: 18 (million)
% 0.29/0.43 % (1211455)lrs+1010_2:3_cha=on:si=on:uwa=off:nwc=1:random_seed=2276878589:i=5:fgj=on:av=off:rtra=on:fe=axiom:ntd=on_2999 on theBenchmark for (2999ds/5Mi)
% 0.29/0.43 % (1211456)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(5) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.29/0.43 % (1211454)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=3728524681:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.29/0.43 % (1211455)Instruction limit reached!
% 0.29/0.43 % (1211455)------------------------------
% 0.29/0.43 % (1211455)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.29/0.43 % (1211455)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.29/0.43 % (1211455)CaDiCaL version: 2.1.3
% 0.29/0.43 % (1211455)Termination reason: Instruction limit
% 0.29/0.43 % (1211455)Termination phase: shuffling
% 0.29/0.43 % (1211455)Time elapsed: 0.003 s
% 0.29/0.43 % (1211455)Peak memory usage: 10 MB
% 0.29/0.43 % (1211455)Instructions burned: 6 (million)
% 0.29/0.43 % (1211454)Instruction limit reached!
% 0.29/0.43 % (1211454)------------------------------
% 0.29/0.43 % (1211454)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.29/0.43 % (1211454)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.29/0.43 % (1211454)CaDiCaL version: 2.1.3
% 0.29/0.43 % (1211454)Termination reason: Instruction limit
% 0.29/0.43 % (1211454)Termination phase: shuffling
% 0.29/0.43 % (1211454)Time elapsed: 0.002 s
% 0.29/0.43 % (1211454)Peak memory usage: 10 MB
% 0.29/0.43 % (1211454)Instructions burned: 3 (million)
% 0.29/0.43 % (1211440)Instruction limit reached!
% 0.29/0.43 % (1211440)------------------------------
% 0.29/0.43 % (1211440)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.29/0.43 % (1211440)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.29/0.43 % (1211440)CaDiCaL version: 2.1.3
% 0.29/0.43 % (1211440)Termination reason: Instruction limit
% 0.29/0.43 % (1211440)Termination phase: Property scanning
% 0.29/0.43 % (1211440)Time elapsed: 0.039 s
% 0.29/0.43 % (1211440)Peak memory usage: 12 MB
% 0.29/0.43 % (1211440)Instructions burned: 87 (million)
% 0.29/0.43 % (1211456)dis+21_1_to=kbo:sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:plsqr=64,1:uwa=hol:random_seed=2451678911:uwa_fpi=on:i=7:fgj=on:hud=10:fsr=off:rtra=on:rawr=on:fsdmm=5_2999 on theBenchmark for (2999ds/7Mi)
% 0.29/0.43 % (1211445)Instruction limit reached!
% 0.29/0.43 % (1211445)------------------------------
% 0.29/0.43 % (1211445)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.29/0.43 % (1211445)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.29/0.43 % (1211445)CaDiCaL version: 2.1.3
% 0.29/0.43 % (1211445)Termination reason: Instruction limit
% 0.29/0.43 % (1211445)Termination phase: Property scanning
% 0.29/0.43 % (1211445)Time elapsed: 0.035 s
% 0.29/0.43 % (1211445)Peak memory usage: 12 MB
% 0.29/0.43 % (1211445)Instructions burned: 75 (million)
% 0.29/0.43 % (1211456)Instruction limit reached!
% 0.29/0.43 % (1211456)------------------------------
% 0.29/0.43 % (1211456)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.29/0.44 % (1211456)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.29/0.44 % (1211456)CaDiCaL version: 2.1.3
% 0.29/0.44 % (1211456)Termination reason: Instruction limit
% 0.29/0.44 % (1211456)Termination phase: shuffling
% 0.29/0.44 % (1211456)Time elapsed: 0.006 s
% 0.29/0.44 % (1211456)Peak memory usage: 10 MB
% 0.29/0.44 % (1211456)Instructions burned: 7 (million)
% 0.29/0.44 % (1211460)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.29/0.44 % (1211460)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(1) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.29/0.44 % (1211459)lrs+10_1_sil=128000:si=on:urr=on:slsqc=1:slsq=on:random_seed=3310535184:i=12:s2at=2:kws=inv_frequency:bd=all:rtra=on_2999 on theBenchmark for (2999ds/12Mi)
% 0.29/0.44 % (1211460)ott+1010_64_tgt=ground:cnfonf=lazy_simp:si=on:lma=off:spb=goal:lcm=predicate:random_seed=3143330285:i=28:s2at=5:piset=not:hud=10:bd=all:av=off:rtra=on:ixr=off:fsdmm=1_2999 on theBenchmark for (2999ds/28Mi)
% 0.29/0.44 % (1211462)lrs+1002_64_sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:sp=occurrence:lma=off:plsqr=32,1:uwa=interpreted_only:random_seed=3793977440:i=86:piset=equals:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/86Mi)
% 0.29/0.44 % (1211463)lrs+10_1_si=on:cs=on:random_seed=2075138361:i=8:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/8Mi)
% 0.29/0.44 % (1211459)Instruction limit reached!
% 0.29/0.44 % (1211459)------------------------------
% 0.29/0.44 % (1211459)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.29/0.44 % (1211459)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.29/0.44 % (1211459)CaDiCaL version: 2.1.3
% 0.29/0.44 % (1211459)Termination reason: Instruction limit
% 0.29/0.44 % (1211459)Termination phase: shuffling
% 0.29/0.44 % (1211459)Time elapsed: 0.006 s
% 0.29/0.44 % (1211459)Peak memory usage: 10 MB
% 0.29/0.44 % (1211459)Instructions burned: 12 (million)
% 0.29/0.44 % (1211464)WARNING Broken Constraint: if positive_literal_split_queue_ratios(1,32) has been set then positive_literal_split_queue(off) is equal to on
% 0.29/0.44 % (1211463)Instruction limit reached!
% 0.29/0.44 % (1211463)------------------------------
% 0.29/0.44 % (1211463)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.29/0.44 % (1211463)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.29/0.44 % (1211463)CaDiCaL version: 2.1.3
% 0.29/0.44 % (1211463)Termination reason: Instruction limit
% 0.29/0.44 % (1211463)Termination phase: shuffling
% 0.29/0.44 % (1211463)Time elapsed: 0.005 s
% 0.29/0.44 % (1211463)Peak memory usage: 10 MB
% 0.29/0.44 % (1211463)Instructions burned: 10 (million)
% 0.29/0.44 % (1211446)Instruction limit reached!
% 0.29/0.44 % (1211446)------------------------------
% 0.29/0.44 % (1211446)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.29/0.44 % (1211446)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.29/0.44 % (1211446)CaDiCaL version: 2.1.3
% 0.29/0.44 % (1211446)Termination reason: Instruction limit
% 0.29/0.44 % (1211446)Termination phase: Property scanning
% 0.29/0.44 % (1211446)Time elapsed: 0.065 s
% 0.29/0.44 % (1211446)Peak memory usage: 12 MB
% 0.29/0.44 % (1211446)Instructions burned: 160 (million)
% 0.29/0.44 % (1211464)ott+1002_20_sil=128000:cnfonf=lazy_not_gen_be_off:si=on:sp=unary_frequency:plsqr=1,32:bce=on:uwa=interpreted_only:foolp=on:random_seed=2553379036:i=2:add=on:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.29/0.44 % (1211464)Instruction limit reached!
% 0.29/0.44 % (1211464)------------------------------
% 0.29/0.44 % (1211464)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.29/0.44 % (1211464)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.29/0.44 % (1211464)CaDiCaL version: 2.1.3
% 0.29/0.44 % (1211464)Termination reason: Instruction limit
% 0.29/0.44 % (1211464)Termination phase: shuffling
% 0.29/0.44 % (1211464)Time elapsed: 0.003 s
% 0.29/0.44 % (1211464)Peak memory usage: 10 MB
% 0.29/0.44 % (1211464)Instructions burned: 6 (million)
% 0.29/0.44 % (1211443) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1211435-1211443"...
% 0.29/0.44 % (1211460)Instruction limit reached!
% 0.29/0.44 % (1211460)------------------------------
% 0.29/0.44 % (1211460)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.29/0.44 % (1211460)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.29/0.44 % (1211460)CaDiCaL version: 2.1.3
% 0.29/0.44 % (1211460)Termination reason: Instruction limit
% 0.29/0.44 % (1211460)Termination phase: shuffling
% 0.29/0.44 % (1211460)Time elapsed: 0.018 s
% 0.29/0.44 % (1211460)Peak memory usage: 10 MB
% 0.29/0.44 % (1211460)Instructions burned: 29 (million)
% 0.29/0.44 % (1211443)...printing done.
% 0.29/0.44 % (1211469)lrs+1002_3:1_sil=128000:e2e=on:si=on:urr=on:uwa=one_side_constant:nwc=1.5:random_seed=3908169651:i=38:bd=all:rtra=on:amm=off:ss=axioms:ntd=on_2998 on theBenchmark for (2998ds/38Mi)
% 0.29/0.44 % (1211443)Refutation found. Thanks to Tanya!
% 0.29/0.44 % SZS status Theorem for theBenchmark
% 0.29/0.44 % SZS output start Proof for theBenchmark
% See solution above
% 0.29/0.44 % (1211443)------------------------------
% 0.29/0.44 % (1211443)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.29/0.44 % (1211443)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.29/0.44 % (1211443)CaDiCaL version: 2.1.3
% 0.29/0.44 % (1211443)Termination reason: Refutation
% 0.29/0.44 % (1211443)Time elapsed: 0.077 s
% 0.29/0.44 % (1211443)Peak memory usage: 15 MB
% 0.29/0.44 % (1211443)Instructions burned: 165 (million)
% 0.29/0.44 % (1211435)Success in time 0.135 s
% 0.29/0.44 % Vampire exiting
%------------------------------------------------------------------------------