%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : ITP051^1 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/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:31 AM UTC 2026
% Result : ContradictoryAxioms 3.01s 0.72s
% Output : Refutation 3.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 55 ( 42 unt; 0 typ; 0 def)
% Number of atoms : 175 ( 79 equ; 0 cnn)
% Maximal formula atoms : 3 ( 3 avg)
% Number of connectives : 354 ( 26 ~; 9 |; 16 &; 294 @)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Number of types : 11 ( 10 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 206 ( 203 usr; 14 con; 0-4 aty)
% Number of variables : 48 ( 32 ^; 15 !; 1 ?; 48 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
set_li664300135at_nat: $tType ).
thf(type_def_6,type,
set_se1612935105at_nat: $tType ).
thf(type_def_7,type,
list_P559422087at_nat: $tType ).
thf(type_def_8,type,
set_Pr1986765409at_nat: $tType ).
thf(type_def_9,type,
product_prod_nat_nat: $tType ).
thf(type_def_10,type,
set_set_nat: $tType ).
thf(type_def_11,type,
set_nat: $tType ).
thf(type_def_12,type,
nat: $tType ).
thf(type_def_13,type,
b: $tType ).
thf(type_def_14,type,
a: $tType ).
thf(type_def_15,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
edmond1517640972ysis_a: ( product_prod_nat_nat > a ) > $o ).
thf(func_def_1,type,
edmond1517640973ysis_b: ( product_prod_nat_nat > b ) > $o ).
thf(func_def_2,type,
edmond1022345716sure_a: ( product_prod_nat_nat > a ) > nat > nat > nat ).
thf(func_def_3,type,
edmond1022345717sure_b: ( product_prod_nat_nat > b ) > nat > nat > nat ).
thf(func_def_4,type,
edmond475474835dges_a: ( product_prod_nat_nat > a ) > nat > nat > set_Pr1986765409at_nat ).
thf(func_def_5,type,
edmond475474836dges_b: ( product_prod_nat_nat > b ) > nat > nat > set_Pr1986765409at_nat ).
thf(func_def_6,type,
edmond771116670s_uE_a: ( product_prod_nat_nat > a ) > set_Pr1986765409at_nat ).
thf(func_def_7,type,
edmond771116671s_uE_b: ( product_prod_nat_nat > b ) > set_Pr1986765409at_nat ).
thf(func_def_8,type,
finite83082927at_nat: set_li664300135at_nat > nat ).
thf(func_def_9,type,
finite_card_nat: set_nat > nat ).
thf(func_def_10,type,
finite447719721at_nat: set_Pr1986765409at_nat > nat ).
thf(func_def_11,type,
finite_card_set_nat: set_set_nat > nat ).
thf(func_def_12,type,
finite1701894793at_nat: set_se1612935105at_nat > nat ).
thf(func_def_13,type,
finite1299096496at_nat: set_li664300135at_nat > $o ).
thf(func_def_14,type,
finite_finite_nat: set_nat > $o ).
thf(func_def_15,type,
finite772653738at_nat: set_Pr1986765409at_nat > $o ).
thf(func_def_16,type,
finite2012248349et_nat: set_set_nat > $o ).
thf(func_def_17,type,
finite1457549322at_nat: set_se1612935105at_nat > $o ).
thf(func_def_18,type,
finite_Graph_a: ( product_prod_nat_nat > a ) > $o ).
thf(func_def_19,type,
finite_Graph_b: ( product_prod_nat_nat > b ) > $o ).
thf(func_def_20,type,
e_a: ( product_prod_nat_nat > a ) > set_Pr1986765409at_nat ).
thf(func_def_21,type,
e_b: ( product_prod_nat_nat > b ) > set_Pr1986765409at_nat ).
thf(func_def_22,type,
v_a: ( product_prod_nat_nat > a ) > set_nat ).
thf(func_def_23,type,
v_b: ( product_prod_nat_nat > b ) > set_nat ).
thf(func_def_24,type,
adjacent_nodes_a: ( product_prod_nat_nat > a ) > nat > set_nat ).
thf(func_def_25,type,
adjacent_nodes_b: ( product_prod_nat_nat > b ) > nat > set_nat ).
thf(func_def_26,type,
connected_a: ( product_prod_nat_nat > a ) > nat > nat > $o ).
thf(func_def_27,type,
connected_b: ( product_prod_nat_nat > b ) > nat > nat > $o ).
thf(func_def_28,type,
dist_a: ( product_prod_nat_nat > a ) > nat > nat > nat > $o ).
thf(func_def_29,type,
dist_b: ( product_prod_nat_nat > b ) > nat > nat > nat > $o ).
thf(func_def_30,type,
incoming_a: ( product_prod_nat_nat > a ) > set_nat > set_Pr1986765409at_nat ).
thf(func_def_31,type,
incoming_b: ( product_prod_nat_nat > b ) > set_nat > set_Pr1986765409at_nat ).
thf(func_def_32,type,
isPath_a: ( product_prod_nat_nat > a ) > nat > list_P559422087at_nat > nat > $o ).
thf(func_def_33,type,
isPath_b: ( product_prod_nat_nat > b ) > nat > list_P559422087at_nat > nat > $o ).
thf(func_def_34,type,
isShortestPath_a: ( product_prod_nat_nat > a ) > nat > list_P559422087at_nat > nat > $o ).
thf(func_def_35,type,
isShortestPath_b: ( product_prod_nat_nat > b ) > nat > list_P559422087at_nat > nat > $o ).
thf(func_def_36,type,
isSimplePath_a: ( product_prod_nat_nat > a ) > nat > list_P559422087at_nat > nat > $o ).
thf(func_def_37,type,
isSimplePath_b: ( product_prod_nat_nat > b ) > nat > list_P559422087at_nat > nat > $o ).
thf(func_def_38,type,
min_dist_a: ( product_prod_nat_nat > a ) > nat > nat > nat ).
thf(func_def_39,type,
min_dist_b: ( product_prod_nat_nat > b ) > nat > nat > nat ).
thf(func_def_40,type,
outgoing_a: ( product_prod_nat_nat > a ) > set_nat > set_Pr1986765409at_nat ).
thf(func_def_41,type,
outgoing_b: ( product_prod_nat_nat > b ) > set_nat > set_Pr1986765409at_nat ).
thf(func_def_42,type,
reachableNodes_a: ( product_prod_nat_nat > a ) > nat > set_nat ).
thf(func_def_43,type,
reachableNodes_b: ( product_prod_nat_nat > b ) > nat > set_nat ).
thf(func_def_44,type,
zero_zero_nat: nat ).
thf(func_def_45,type,
set_Pr2131844118at_nat: list_P559422087at_nat > set_Pr1986765409at_nat ).
thf(func_def_46,type,
size_s1990949619at_nat: list_P559422087at_nat > nat ).
thf(func_def_47,type,
ord_less_nat: nat > nat > $o ).
thf(func_def_48,type,
ord_less_set_nat: set_nat > set_nat > $o ).
thf(func_def_49,type,
ord_le116442893at_nat: set_Pr1986765409at_nat > set_Pr1986765409at_nat > $o ).
thf(func_def_50,type,
ord_less_eq_nat: nat > nat > $o ).
thf(func_def_51,type,
ord_less_eq_set_nat: set_nat > set_nat > $o ).
thf(func_def_52,type,
ord_le841296385at_nat: set_Pr1986765409at_nat > set_Pr1986765409at_nat > $o ).
thf(func_def_53,type,
ord_le1613022364et_nat: set_set_nat > set_set_nat > $o ).
thf(func_def_54,type,
ord_le2096002913at_nat: set_se1612935105at_nat > set_se1612935105at_nat > $o ).
thf(func_def_55,type,
collect_nat: ( nat > $o ) > set_nat ).
thf(func_def_56,type,
collec7649004at_nat: ( product_prod_nat_nat > $o ) > set_Pr1986765409at_nat ).
thf(func_def_57,type,
collect_set_nat: ( set_nat > $o ) > set_set_nat ).
thf(func_def_58,type,
collec1606769740at_nat: ( set_Pr1986765409at_nat > $o ) > set_se1612935105at_nat ).
thf(func_def_59,type,
member1608759472at_nat: list_P559422087at_nat > set_li664300135at_nat > $o ).
thf(func_def_60,type,
member_nat: nat > set_nat > $o ).
thf(func_def_61,type,
member701585322at_nat: product_prod_nat_nat > set_Pr1986765409at_nat > $o ).
thf(func_def_62,type,
member_set_nat: set_nat > set_set_nat > $o ).
thf(func_def_63,type,
member298845450at_nat: set_Pr1986765409at_nat > set_se1612935105at_nat > $o ).
thf(func_def_64,type,
c: product_prod_nat_nat > a ).
thf(func_def_65,type,
c2: product_prod_nat_nat > b ).
thf(func_def_66,type,
edges: set_Pr1986765409at_nat ).
thf(func_def_67,type,
p: list_P559422087at_nat ).
thf(func_def_68,type,
p2: list_P559422087at_nat ).
thf(func_def_69,type,
s: nat ).
thf(func_def_70,type,
t: nat ).
thf(func_def_74,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_75,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_76,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_77,type,
vAND: $o > $o > $o ).
thf(func_def_78,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_79,type,
vNOT: $o > $o ).
thf(func_def_80,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_81,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_82,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_83,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_84,type,
vIMP: $o > $o > $o ).
thf(func_def_85,type,
vOR: $o > $o > $o ).
thf(func_def_86,type,
db4:
!>[X0: $tType] : X0 ).
thf(func_def_87,type,
sK0: list_P559422087at_nat ).
thf(func_def_88,type,
sK1: nat > nat > nat ).
thf(func_def_89,type,
sK2: nat > nat > nat ).
thf(func_def_90,type,
sK3: ( list_P559422087at_nat > $o ) > list_P559422087at_nat ).
thf(func_def_91,type,
sK4: nat > nat > list_P559422087at_nat ).
thf(func_def_92,type,
sK5: ( nat > $o ) > ( nat > $o ) > nat ).
thf(func_def_93,type,
sK6: ( product_prod_nat_nat > $o ) > ( product_prod_nat_nat > $o ) > product_prod_nat_nat ).
thf(func_def_94,type,
sK7: nat > list_P559422087at_nat ).
thf(func_def_95,type,
sK8: ( nat > $o ) > nat > nat > nat ).
thf(func_def_96,type,
sK9: nat > nat > list_P559422087at_nat ).
thf(func_def_97,type,
sK10: nat > nat > nat ).
thf(func_def_98,type,
sK11: nat > nat > nat > nat ).
thf(func_def_99,type,
sK12: nat > nat > nat ).
thf(func_def_100,type,
sK13: ( nat > $o ) > nat ).
thf(func_def_101,type,
sK14: nat > ( nat > $o ) > nat ).
thf(func_def_102,type,
sK15: ( nat > nat ) > nat ).
thf(func_def_103,type,
sK16: ( nat > nat ) > nat ).
thf(func_def_104,type,
sK17: nat > ( nat > $o ) > nat ).
thf(func_def_105,type,
sK18: nat > nat > ( product_prod_nat_nat > b ) > nat ).
thf(func_def_106,type,
sK19: nat > nat > ( product_prod_nat_nat > a ) > nat ).
thf(func_def_107,type,
sK20: nat > nat > nat > ( product_prod_nat_nat > a ) > nat ).
thf(func_def_108,type,
sK21: nat > nat > nat > ( product_prod_nat_nat > b ) > nat ).
thf(func_def_109,type,
sK22: ( nat > $o ) > nat > nat > ( product_prod_nat_nat > b ) > nat ).
thf(func_def_110,type,
sK23: ( nat > $o ) > nat > nat > ( product_prod_nat_nat > a ) > nat ).
thf(func_def_111,type,
sK24: ( nat > $o ) > nat ).
thf(func_def_112,type,
sK25: ( nat > $o ) > nat ).
thf(func_def_113,type,
sK26: ( nat > $o ) > nat ).
thf(func_def_114,type,
sK27: nat > nat > ( product_prod_nat_nat > a ) > list_P559422087at_nat ).
thf(func_def_115,type,
sK28: nat > nat > ( product_prod_nat_nat > b ) > list_P559422087at_nat ).
thf(func_def_116,type,
sK29: nat > nat > ( product_prod_nat_nat > b ) > nat ).
thf(func_def_117,type,
sK30: nat > nat > ( product_prod_nat_nat > a ) > nat ).
thf(func_def_118,type,
sK31: ( nat > $o ) > nat > nat > nat ).
thf(func_def_119,type,
sK32: nat > nat > list_P559422087at_nat ).
thf(func_def_120,type,
sK33: nat > nat > list_P559422087at_nat ).
thf(func_def_121,type,
sK34: nat > nat > nat > nat ).
thf(func_def_122,type,
sK35: nat > set_nat > set_nat ).
thf(func_def_123,type,
sK36: nat > set_Pr1986765409at_nat > set_Pr1986765409at_nat ).
thf(func_def_124,type,
sK37: nat > nat > ( product_prod_nat_nat > a ) > list_P559422087at_nat ).
thf(func_def_125,type,
sK38: nat > nat > ( product_prod_nat_nat > b ) > list_P559422087at_nat ).
thf(func_def_126,type,
sK39: set_li664300135at_nat > nat ).
thf(func_def_127,type,
sK40: nat > set_nat > set_nat ).
thf(func_def_128,type,
sK41: nat > set_Pr1986765409at_nat > set_Pr1986765409at_nat ).
thf(func_def_129,type,
sK42: ( set_Pr1986765409at_nat > $o ) > set_Pr1986765409at_nat ).
thf(func_def_130,type,
sK43: ( set_nat > $o ) > set_nat ).
thf(func_def_131,type,
sK44: nat > set_nat > nat ).
thf(func_def_132,type,
sK45: set_nat > set_set_nat > set_nat ).
thf(func_def_133,type,
sK46: set_Pr1986765409at_nat > set_se1612935105at_nat > set_Pr1986765409at_nat ).
thf(func_def_134,type,
sK47: nat > set_nat > nat ).
thf(func_def_135,type,
sK48: set_nat > set_set_nat > set_nat ).
thf(func_def_136,type,
sK49: set_Pr1986765409at_nat > set_se1612935105at_nat > set_Pr1986765409at_nat ).
thf(func_def_137,type,
sK50: set_nat > set_nat > nat ).
thf(func_def_138,type,
sK51: set_Pr1986765409at_nat > set_Pr1986765409at_nat > product_prod_nat_nat ).
thf(func_def_139,type,
sK52: ( product_prod_nat_nat > $o ) > ( product_prod_nat_nat > $o ) > product_prod_nat_nat ).
thf(func_def_140,type,
sK53: ( nat > $o ) > ( nat > $o ) > nat ).
thf(func_def_141,type,
sK54: nat > nat > list_P559422087at_nat ).
thf(func_def_142,type,
sK55: nat > list_P559422087at_nat ).
thf(func_def_143,type,
sK56: nat > nat > list_P559422087at_nat ).
thf(func_def_144,type,
sK57: nat > nat > list_P559422087at_nat ).
thf(func_def_145,type,
sK58: nat > nat > nat > list_P559422087at_nat ).
thf(func_def_146,type,
sK59: nat > nat > nat > list_P559422087at_nat ).
thf(func_def_147,type,
sK60: list_P559422087at_nat > nat > nat > list_P559422087at_nat ).
thf(func_def_148,type,
sK61: nat > nat > nat > list_P559422087at_nat ).
thf(func_def_149,type,
sK62: nat > nat > nat ).
thf(func_def_150,type,
sK63: nat > nat > list_P559422087at_nat ).
thf(func_def_151,type,
sK64: nat > nat > list_P559422087at_nat ).
thf(func_def_152,type,
sK65: nat > nat > ( nat > $o ) > list_P559422087at_nat ).
thf(func_def_153,type,
sK66: nat > nat > ( product_prod_nat_nat > a ) > list_P559422087at_nat > list_P559422087at_nat ).
thf(func_def_154,type,
sK67: nat > nat > ( product_prod_nat_nat > b ) > list_P559422087at_nat > list_P559422087at_nat ).
thf(func_def_155,type,
sK68: nat > ( product_prod_nat_nat > a ) > nat > list_P559422087at_nat ).
thf(func_def_156,type,
sK69: nat > ( product_prod_nat_nat > b ) > nat > list_P559422087at_nat ).
thf(func_def_157,type,
sK70: nat > ( product_prod_nat_nat > a ) > nat > list_P559422087at_nat ).
thf(func_def_158,type,
sK71: nat > ( product_prod_nat_nat > b ) > nat > list_P559422087at_nat ).
thf(func_def_159,type,
db7:
!>[X0: $tType] : X0 ).
thf(func_def_160,type,
db6:
!>[X0: $tType] : X0 ).
thf(func_def_161,type,
db5:
!>[X0: $tType] : X0 ).
thf(func_def_162,type,
sK72: nat > nat > ( product_prod_nat_nat > a ) > list_P559422087at_nat ).
thf(func_def_163,type,
sK73: nat > nat > ( product_prod_nat_nat > b ) > list_P559422087at_nat ).
thf(func_def_164,type,
sK74: nat > ( product_prod_nat_nat > a ) > nat > list_P559422087at_nat ).
thf(func_def_165,type,
sK75: nat > ( product_prod_nat_nat > b ) > nat > list_P559422087at_nat ).
thf(func_def_166,type,
sK76: nat > ( product_prod_nat_nat > a ) > list_P559422087at_nat ).
thf(func_def_167,type,
sK77: nat > ( product_prod_nat_nat > b ) > list_P559422087at_nat ).
thf(func_def_168,type,
sK78: nat > ( product_prod_nat_nat > a ) > list_P559422087at_nat ).
thf(func_def_169,type,
sK79: nat > ( product_prod_nat_nat > b ) > list_P559422087at_nat ).
thf(func_def_170,type,
sK80: nat > nat > ( nat > $o ) > ( product_prod_nat_nat > a ) > list_P559422087at_nat ).
thf(func_def_171,type,
sK81: nat > ( nat > $o ) > ( product_prod_nat_nat > b ) > nat > list_P559422087at_nat ).
thf(func_def_172,type,
sK82: nat > nat > ( product_prod_nat_nat > b ) > nat > list_P559422087at_nat ).
thf(func_def_173,type,
sK83: nat > nat > ( product_prod_nat_nat > a ) > nat > list_P559422087at_nat ).
thf(func_def_174,type,
sK84: nat > nat > ( product_prod_nat_nat > a ) > list_P559422087at_nat ).
thf(func_def_175,type,
sK85: nat > nat > ( product_prod_nat_nat > b ) > list_P559422087at_nat ).
thf(func_def_176,type,
sK86: list_P559422087at_nat > nat > nat > list_P559422087at_nat ).
thf(func_def_177,type,
sK87: list_P559422087at_nat > nat > nat > list_P559422087at_nat ).
thf(func_def_178,type,
sK88: nat > nat > list_P559422087at_nat ).
thf(func_def_179,type,
sK89: nat > nat > nat > list_P559422087at_nat ).
thf(func_def_180,type,
sK90: nat > nat > list_P559422087at_nat ).
thf(func_def_181,type,
sK91: nat > nat > list_P559422087at_nat ).
thf(func_def_182,type,
sK92: nat > nat > list_P559422087at_nat ).
thf(func_def_183,type,
sK93: nat > nat > ( nat > $o ) > list_P559422087at_nat ).
thf(func_def_184,type,
sK94: nat > nat > list_P559422087at_nat ).
thf(func_def_185,type,
sK95: nat > list_P559422087at_nat ).
thf(func_def_186,type,
sK96: nat > nat > list_P559422087at_nat ).
thf(func_def_187,type,
sK97: nat > list_P559422087at_nat ).
thf(func_def_188,type,
sK98: nat > list_P559422087at_nat ).
thf(func_def_189,type,
sK99: nat > nat > list_P559422087at_nat ).
thf(func_def_190,type,
sK100: nat > nat > nat > list_P559422087at_nat ).
thf(func_def_191,type,
sK101: nat > nat > nat > list_P559422087at_nat ).
thf(func_def_192,type,
sK102: list_P559422087at_nat > nat > nat > list_P559422087at_nat ).
thf(func_def_193,type,
sK103: nat > nat > nat ).
thf(func_def_194,type,
sK104: nat > nat > list_P559422087at_nat ).
thf(func_def_195,type,
sK105: nat > nat > list_P559422087at_nat ).
thf(func_def_196,type,
sK106: nat > nat > list_P559422087at_nat ).
thf(func_def_197,type,
sK107: nat > nat > list_P559422087at_nat ).
thf(func_def_198,type,
sK108: nat > nat > list_P559422087at_nat ).
thf(func_def_199,type,
sK109: nat > nat > list_P559422087at_nat ).
thf(func_def_200,type,
sK110: list_P559422087at_nat ).
thf(func_def_201,type,
sK111: list_P559422087at_nat ).
thf(func_def_202,type,
sK112: list_P559422087at_nat ).
thf(func_def_203,type,
sK113: list_P559422087at_nat ).
thf(func_def_204,type,
sK114: list_P559422087at_nat ).
thf(f3,axiom,
( ( size_s1990949619at_nat @ p2 )
= ( min_dist_b @ c2 @ s @ t ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_2_LENP_H) ).
thf(f7,axiom,
ord_less_nat @ ( min_dist_b @ c2 @ s @ t ) @ ( min_dist_a @ c @ s @ t ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_6_SHORTER) ).
thf(f14,axiom,
ord_less_nat @ ( size_s1990949619at_nat @ p ) @ ( size_s1990949619at_nat @ p2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_13__092_060open_062length_Ap_A_060_Alength_Ap_H_092_060close_062) ).
thf(f16,axiom,
isShortestPath_a @ c @ s @ p @ t,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_15_SP) ).
thf(f28,axiom,
~ ! [X0: list_P559422087at_nat] :
( ( isPath_b @ c2 @ s @ X0 @ t )
=> ( ( size_s1990949619at_nat @ X0 )
!= ( min_dist_b @ c2 @ s @ t ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_27__092_060open_062_092_060And_062thesis_O_A_I_092_060And_062p_H_O_A_092_060lbrakk_062g_H_OisPath_As_Ap_H_At_059_Alength_Ap_H_A_061_Ag_H_Omin__dist_As_At_092_060rbrakk_062_A_092_060Longrightarrow_062_Athesis_J_A_092_060Longrightarrow_062_Athesis_092_060close_062) ).
thf(f73,axiom,
( isShortestPath_a
= ( ^ [X0: product_prod_nat_nat > a,X1: nat,X2: list_P559422087at_nat,X3: nat] :
( ( ( size_s1990949619at_nat @ X2 )
= ( min_dist_a @ X0 @ X1 @ X3 ) )
& ( isPath_a @ X0 @ X1 @ X2 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_72_Graph_OisShortestPath__min__dist__def) ).
thf(f97,axiom,
! [X0: nat,X1: nat] :
( ( ord_less_eq_nat @ X0 @ X1 )
=> ( ( ord_less_eq_nat @ X1 @ X0 )
=> ( X0 = X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_96_le__antisym) ).
thf(f104,axiom,
( ord_less_nat
= ( ^ [X0: nat,X1: nat] :
( ( X0 != X1 )
& ( ord_less_eq_nat @ X0 @ X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_103_nat__less__le) ).
thf(f355,plain,
ord_less_nat @ ( min_dist_b @ c2 @ s @ t ) @ ( min_dist_a @ c @ s @ t ),
inference(rectify,[],[f7]) ).
thf(f356,plain,
( ( ord_less_nat @ ( min_dist_b @ c2 @ s @ t ) @ ( min_dist_a @ c @ s @ t ) )
= $true ),
inference(fool_elimination,[],[f355]) ).
thf(f361,plain,
ord_less_nat @ ( size_s1990949619at_nat @ p ) @ ( size_s1990949619at_nat @ p2 ),
inference(rectify,[],[f14]) ).
thf(f362,plain,
( ( ord_less_nat @ ( size_s1990949619at_nat @ p ) @ ( size_s1990949619at_nat @ p2 ) )
= $true ),
inference(fool_elimination,[],[f361]) ).
thf(f363,plain,
isShortestPath_a @ c @ s @ p @ t,
inference(rectify,[],[f16]) ).
thf(f364,plain,
( ( isShortestPath_a @ c @ s @ p @ t )
= $true ),
inference(fool_elimination,[],[f363]) ).
thf(f383,plain,
~ ! [X0: list_P559422087at_nat] :
( ( isPath_b @ c2 @ s @ X0 @ t )
=> ( ( size_s1990949619at_nat @ X0 )
!= ( min_dist_b @ c2 @ s @ t ) ) ),
inference(rectify,[],[f28]) ).
thf(f384,plain,
~ ! [X0: list_P559422087at_nat] :
( ( ( isPath_b @ c2 @ s @ X0 @ t )
= $true )
=> ( ( min_dist_b @ c2 @ s @ t )
!= ( size_s1990949619at_nat @ X0 ) ) ),
inference(fool_elimination,[],[f383]) ).
thf(f450,plain,
( isShortestPath_a
= ( ^ [X0: product_prod_nat_nat > a,X1: nat,X2: list_P559422087at_nat,X3: nat] :
( ( ( size_s1990949619at_nat @ X2 )
= ( min_dist_a @ X0 @ X1 @ X3 ) )
& ( isPath_a @ X0 @ X1 @ X2 @ X3 ) ) ) ),
inference(rectify,[],[f73]) ).
thf(f451,plain,
( isShortestPath_a
= ( ^ [Y0: product_prod_nat_nat > a,Y1: nat,Y2: list_P559422087at_nat,Y3: nat] :
( ( isPath_a @ Y0 @ Y1 @ Y2 @ Y3 )
& ( ( size_s1990949619at_nat @ Y2 )
= ( min_dist_a @ Y0 @ Y1 @ Y3 ) ) ) ) ),
inference(fool_elimination,[],[f450]) ).
thf(f497,plain,
! [X0: nat,X1: nat] :
( ( ord_less_eq_nat @ X0 @ X1 )
=> ( ( ord_less_eq_nat @ X1 @ X0 )
=> ( X0 = X1 ) ) ),
inference(rectify,[],[f97]) ).
thf(f498,plain,
! [X0: nat,X1: nat] :
( ( ( ord_less_eq_nat @ X0 @ X1 )
= $true )
=> ( ( ( ord_less_eq_nat @ X1 @ X0 )
= $true )
=> ( X0 = X1 ) ) ),
inference(fool_elimination,[],[f497]) ).
thf(f509,plain,
( ord_less_nat
= ( ^ [X0: nat,X1: nat] :
( ( X0 != X1 )
& ( ord_less_eq_nat @ X0 @ X1 ) ) ) ),
inference(rectify,[],[f104]) ).
thf(f510,plain,
( ord_less_nat
= ( ^ [Y0: nat,Y1: nat] :
( ( ord_less_eq_nat @ Y0 @ Y1 )
& ( Y0 != Y1 ) ) ) ),
inference(fool_elimination,[],[f509]) ).
thf(f967,plain,
? [X0: list_P559422087at_nat] :
( ( ( min_dist_b @ c2 @ s @ t )
= ( size_s1990949619at_nat @ X0 ) )
& ( ( isPath_b @ c2 @ s @ X0 @ t )
= $true ) ),
inference(ennf_transformation,[],[f384]) ).
thf(f1006,plain,
! [X0: nat,X1: nat] :
( ( X0 = X1 )
| ( ( ord_less_eq_nat @ X1 @ X0 )
!= $true )
| ( ( ord_less_eq_nat @ X0 @ X1 )
!= $true ) ),
inference(ennf_transformation,[],[f498]) ).
thf(f1007,plain,
! [X0: nat,X1: nat] :
( ( X0 = X1 )
| ( ( ord_less_eq_nat @ X1 @ X0 )
!= $true )
| ( ( ord_less_eq_nat @ X0 @ X1 )
!= $true ) ),
inference(flattening,[],[f1006]) ).
thf(f1222,plain,
( ( ( min_dist_b @ c2 @ s @ t )
= ( size_s1990949619at_nat @ sK0 ) )
& ( $true
= ( isPath_b @ c2 @ s @ sK0 @ t ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f967]) ).
thf(f1275,plain,
( ( size_s1990949619at_nat @ p2 )
= ( min_dist_b @ c2 @ s @ t ) ),
inference(cnf_transformation,[],[f3]) ).
thf(f1279,plain,
( ( ord_less_nat @ ( min_dist_b @ c2 @ s @ t ) @ ( min_dist_a @ c @ s @ t ) )
= $true ),
inference(cnf_transformation,[],[f356]) ).
thf(f1286,plain,
( ( ord_less_nat @ ( size_s1990949619at_nat @ p ) @ ( size_s1990949619at_nat @ p2 ) )
= $true ),
inference(cnf_transformation,[],[f362]) ).
thf(f1288,plain,
( ( isShortestPath_a @ c @ s @ p @ t )
= $true ),
inference(cnf_transformation,[],[f364]) ).
thf(f1301,plain,
( ( min_dist_b @ c2 @ s @ t )
= ( size_s1990949619at_nat @ sK0 ) ),
inference(cnf_transformation,[],[f1222]) ).
thf(f1349,plain,
( isShortestPath_a
= ( ^ [Y0: product_prod_nat_nat > a,Y1: nat,Y2: list_P559422087at_nat,Y3: nat] :
( ( isPath_a @ Y0 @ Y1 @ Y2 @ Y3 )
& ( ( size_s1990949619at_nat @ Y2 )
= ( min_dist_a @ Y0 @ Y1 @ Y3 ) ) ) ) ),
inference(cnf_transformation,[],[f451]) ).
thf(f1378,plain,
! [X0: nat,X1: nat] :
( ( ( ord_less_eq_nat @ X1 @ X0 )
!= $true )
| ( X0 = X1 )
| ( ( ord_less_eq_nat @ X0 @ X1 )
!= $true ) ),
inference(cnf_transformation,[],[f1007]) ).
thf(f1388,plain,
( ord_less_nat
= ( ^ [Y0: nat,Y1: nat] :
( ( ord_less_eq_nat @ Y0 @ Y1 )
& ( Y0 != Y1 ) ) ) ),
inference(cnf_transformation,[],[f510]) ).
thf(f1693,plain,
( $true
= ( ^ [Y0: nat,Y1: nat] :
( ( ord_less_eq_nat @ Y0 @ Y1 )
& ( Y0 != Y1 ) )
@ ( min_dist_b @ c2 @ s @ t )
@ ( min_dist_a @ c @ s @ t ) ) ),
inference(definition_unfolding,[],[f1279,f1388]) ).
thf(f1696,plain,
( $true
= ( ^ [Y0: nat,Y1: nat] :
( ( ord_less_eq_nat @ Y0 @ Y1 )
& ( Y0 != Y1 ) )
@ ( size_s1990949619at_nat @ p )
@ ( size_s1990949619at_nat @ p2 ) ) ),
inference(definition_unfolding,[],[f1286,f1388]) ).
thf(f1697,plain,
( $true
= ( ^ [Y0: product_prod_nat_nat > a,Y1: nat,Y2: list_P559422087at_nat,Y3: nat] :
( ( isPath_a @ Y0 @ Y1 @ Y2 @ Y3 )
& ( ( size_s1990949619at_nat @ Y2 )
= ( min_dist_a @ Y0 @ Y1 @ Y3 ) ) )
@ c
@ s
@ p
@ t ) ),
inference(definition_unfolding,[],[f1288,f1349]) ).
thf(f3108,plain,
( $true
= ( ( isPath_a @ c @ s @ p @ t )
& ( ( size_s1990949619at_nat @ p )
= ( min_dist_a @ c @ s @ t ) ) ) ),
inference(beta-eta_normalization,[],[f1697]) ).
thf(f3109,plain,
( $true
= ( ( size_s1990949619at_nat @ p )
= ( min_dist_a @ c @ s @ t ) ) ),
inference(and_proxy_clausification,[],[f3108]) ).
thf(f3111,plain,
( ( size_s1990949619at_nat @ p )
= ( min_dist_a @ c @ s @ t ) ),
inference(equality_proxy_clausification,[],[f3109]) ).
thf(f3112,plain,
( $true
= ( ( ord_less_eq_nat @ ( size_s1990949619at_nat @ p ) @ ( size_s1990949619at_nat @ p2 ) )
& ( ( size_s1990949619at_nat @ p )
!= ( size_s1990949619at_nat @ p2 ) ) ) ),
inference(beta-eta_normalization,[],[f1696]) ).
thf(f3113,plain,
( $true
= ( ( size_s1990949619at_nat @ p )
!= ( size_s1990949619at_nat @ p2 ) ) ),
inference(and_proxy_clausification,[],[f3112]) ).
thf(f3114,plain,
( $true
= ( ord_less_eq_nat @ ( size_s1990949619at_nat @ p ) @ ( size_s1990949619at_nat @ p2 ) ) ),
inference(and_proxy_clausification,[],[f3112]) ).
thf(f3115,plain,
( $false
= ( ( size_s1990949619at_nat @ p )
= ( size_s1990949619at_nat @ p2 ) ) ),
inference(not_proxy_clausification,[],[f3113]) ).
thf(f3116,plain,
( ( size_s1990949619at_nat @ p )
!= ( size_s1990949619at_nat @ p2 ) ),
inference(equality_proxy_clausification,[],[f3115]) ).
thf(f3119,plain,
( $true
= ( ( ord_less_eq_nat @ ( min_dist_b @ c2 @ s @ t ) @ ( min_dist_a @ c @ s @ t ) )
& ( ( min_dist_b @ c2 @ s @ t )
!= ( min_dist_a @ c @ s @ t ) ) ) ),
inference(beta-eta_normalization,[],[f1693]) ).
thf(f3121,plain,
( $true
= ( ord_less_eq_nat @ ( min_dist_b @ c2 @ s @ t ) @ ( min_dist_a @ c @ s @ t ) ) ),
inference(and_proxy_clausification,[],[f3119]) ).
thf(f3176,plain,
( $true
= ( ord_less_eq_nat @ ( size_s1990949619at_nat @ sK0 ) @ ( min_dist_a @ c @ s @ t ) ) ),
inference(forward_demodulation,[],[f3121,f1301]) ).
thf(f3185,plain,
( $true
= ( ord_less_eq_nat @ ( size_s1990949619at_nat @ sK0 ) @ ( size_s1990949619at_nat @ p ) ) ),
inference(forward_demodulation,[],[f3176,f3111]) ).
thf(f5122,plain,
( ( size_s1990949619at_nat @ p2 )
= ( size_s1990949619at_nat @ sK0 ) ),
inference(constrained_superposition,[],[f1275,f1301]) ).
thf(f5123,plain,
( $true
= ( ord_less_eq_nat @ ( size_s1990949619at_nat @ p2 ) @ ( size_s1990949619at_nat @ p ) ) ),
inference(constrained_superposition,[],[f3185,f5122]) ).
thf(f7423,plain,
( ( $true != $true )
| ( ( size_s1990949619at_nat @ p )
= ( size_s1990949619at_nat @ p2 ) )
| ( $true
!= ( ord_less_eq_nat @ ( size_s1990949619at_nat @ p ) @ ( size_s1990949619at_nat @ p2 ) ) ) ),
inference(constrained_superposition,[],[f1378,f5123]) ).
thf(f7430,plain,
( ( ( size_s1990949619at_nat @ p )
= ( size_s1990949619at_nat @ p2 ) )
| ( $true
!= ( ord_less_eq_nat @ ( size_s1990949619at_nat @ p ) @ ( size_s1990949619at_nat @ p2 ) ) ) ),
inference(trivial_inequality_removal,[],[f7423]) ).
thf(f7446,plain,
( $true
!= ( ord_less_eq_nat @ ( size_s1990949619at_nat @ p ) @ ( size_s1990949619at_nat @ p2 ) ) ),
inference(forward_subsumption_resolution,[],[f7430,f3116]) ).
thf(f7449,plain,
$false,
inference(forward_subsumption_resolution,[],[f7446,f3114]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ITP051^1 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19 % Computer : n019.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Tue Sep 29 19:43:48 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22 Running first-order model finding
% 0.09/0.22 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.01/0.72 % (1255733)Will run a generic schedule for satisfiability detection.
% 3.01/0.72 % (1255741)dis+10_1_sil=32000:sp=arity:random_seed=375096061:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 3.01/0.72 % (1255739)% WARNING: option uhcvi not known.
% 3.01/0.72 % (1255738)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2996265855_2999 on theBenchmark for (2999ds/0Mi)
% 3.01/0.72 % (1255740)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1407416855:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 3.01/0.72 % (1255742)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1180917780:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 3.01/0.72 % (1255739)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3607845747:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 3.01/0.72 % (1255743)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1804020251:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 3.01/0.72 % (1255744)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3683614484:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 3.01/0.72 % (1255742)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 3.01/0.72 % (1255739)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 3.01/0.72 % (1255741)Instruction limit reached!
% 3.01/0.72 % (1255741)------------------------------
% 3.01/0.72 % (1255741)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.01/0.72 % (1255741)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.01/0.72 % (1255741)CaDiCaL version: 2.1.3
% 3.01/0.72 % (1255741)Termination reason: Instruction limit
% 3.01/0.72 % (1255741)Termination phase: Saturation
% 3.01/0.72 % (1255741)Time elapsed: 0.024 s
% 3.01/0.72 % (1255741)Peak memory usage: 12 MB
% 3.01/0.72 % (1255741)Instructions burned: 107 (million)
% 3.01/0.72 % (1255752)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=92504709:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 3.01/0.72 % Exception at run slice level
% 3.01/0.72 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 3.01/0.72 % (1255739)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 3.01/0.72 % Exception at run slice level
% 3.01/0.72 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 3.01/0.72 % (1255742)Instruction limit reached!
% 3.01/0.72 % (1255742)------------------------------
% 3.01/0.72 % (1255742)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.01/0.72 % (1255742)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.01/0.72 % (1255742)CaDiCaL version: 2.1.3
% 3.01/0.72 % (1255742)Termination reason: Instruction limit
% 3.01/0.72 % (1255742)Termination phase: Saturation
% 3.01/0.72 % (1255742)Time elapsed: 0.049 s
% 3.01/0.72 % (1255742)Peak memory usage: 12 MB
% 3.01/0.72 % (1255742)Instructions burned: 116 (million)
% 3.01/0.72 % (1255754)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3353574823:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 3.01/0.72 % (1255743)Instruction limit reached!
% 3.01/0.72 % (1255743)------------------------------
% 3.01/0.72 % (1255743)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.01/0.72 % (1255743)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.01/0.72 % (1255743)CaDiCaL version: 2.1.3
% 3.01/0.72 % (1255743)Termination reason: Instruction limit
% 3.01/0.72 % (1255743)Termination phase: Saturation
% 3.01/0.72 % (1255743)Time elapsed: 0.056 s
% 3.01/0.72 % (1255743)Peak memory usage: 13 MB
% 3.01/0.72 % (1255743)Instructions burned: 131 (million)
% 3.01/0.72 % (1255755)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=2884685418:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 3.01/0.72 % (1255756)ott-21_1_sil=16000:fs=off:random_seed=1305482903:i=180:av=off:fsr=off_2999 on theBenchmark for (2999ds/180Mi)
% 3.01/0.72 % (1255755)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 3.01/0.72 % (1255744)Instruction limit reached!
% 3.01/0.72 % (1255744)------------------------------
% 3.01/0.72 % (1255744)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.01/0.72 % (1255744)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.01/0.72 % (1255744)CaDiCaL version: 2.1.3
% 3.01/0.72 % (1255744)Termination reason: Instruction limit
% 3.01/0.72 % (1255744)Termination phase: Saturation
% 3.01/0.72 % (1255744)Time elapsed: 0.072 s
% 3.01/0.72 % (1255744)Peak memory usage: 14 MB
% 3.01/0.72 % (1255744)Instructions burned: 160 (million)
% 3.01/0.72 % (1255758)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=436772212:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 3.01/0.72 % (1255755)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 3.01/0.72 % (1255761)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3960204194:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 3.01/0.72 % (1255754)Instruction limit reached!
% 3.01/0.72 % (1255754)------------------------------
% 3.01/0.72 % (1255754)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.01/0.72 % (1255754)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.01/0.72 % (1255754)CaDiCaL version: 2.1.3
% 3.01/0.72 % (1255754)Termination reason: Instruction limit
% 3.01/0.72 % (1255754)Termination phase: Saturation
% 3.01/0.72 % (1255754)Time elapsed: 0.058 s
% 3.01/0.72 % (1255754)Peak memory usage: 13 MB
% 3.01/0.72 % (1255754)Instructions burned: 131 (million)
% 3.01/0.72 % Exception at run slice level
% 3.01/0.72 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 3.01/0.72 % (1255764)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=4262325467:i=1179_2998 on theBenchmark for (2998ds/1179Mi)
% 3.01/0.72 % (1255756)Instruction limit reached!
% 3.01/0.72 % (1255756)------------------------------
% 3.01/0.72 % (1255756)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.01/0.72 % (1255756)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.01/0.72 % (1255756)CaDiCaL version: 2.1.3
% 3.01/0.72 % (1255756)Termination reason: Instruction limit
% 3.01/0.72 % (1255756)Termination phase: Saturation
% 3.01/0.72 % (1255756)Time elapsed: 0.080 s
% 3.01/0.72 % (1255756)Peak memory usage: 13 MB
% 3.01/0.72 % (1255756)Instructions burned: 181 (million)
% 3.01/0.72 % (1255765)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=1397991242:i=889:ins=1_2998 on theBenchmark for (2998ds/889Mi)
% 3.01/0.72 % (1255768)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=2948698524:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2998 on theBenchmark for (2998ds/692Mi)
% 3.01/0.72 % Exception at run slice level
% 3.01/0.72 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 3.01/0.72 % (1255768)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 3.01/0.72 % (1255770)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=466792279:i=879:kws=inv_precedence:fsr=off_2997 on theBenchmark for (2997ds/879Mi)
% 3.01/0.72 % (1255770)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 3.01/0.72 % (1255755)Instruction limit reached!
% 3.01/0.72 % (1255755)------------------------------
% 3.01/0.72 % (1255755)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.01/0.72 % (1255755)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.01/0.72 % (1255755)CaDiCaL version: 2.1.3
% 3.01/0.72 % (1255755)Termination reason: Instruction limit
% 3.01/0.72 % (1255755)Termination phase: Saturation
% 3.01/0.72 % (1255755)Time elapsed: 0.173 s
% 3.01/0.72 % (1255755)Peak memory usage: 17 MB
% 3.01/0.72 % (1255755)Instructions burned: 686 (million)
% 3.01/0.72 % (1255772)fmb+10_1_sil=64000:random_seed=519994882:i=22061:nm=2:gsp=on_2997 on theBenchmark for (2997ds/22061Mi)
% 3.01/0.72 % (1255772)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 3.01/0.72 % Exception at run slice level
% 3.01/0.72 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 3.01/0.72 % (1255774)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=711003152:i=9515:nm=5_2996 on theBenchmark for (2996ds/9515Mi)
% 3.01/0.72 % Exception at run slice level
% 3.01/0.72 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 3.01/0.72 % (1255776)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=2928993924:fmbsr=1.7:i=920_2996 on theBenchmark for (2996ds/920Mi)
% 3.01/0.72 % (1255758)Instruction limit reached!
% 3.01/0.72 % (1255758)------------------------------
% 3.01/0.72 % (1255758)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.01/0.72 % (1255758)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.01/0.72 % (1255758)CaDiCaL version: 2.1.3
% 3.01/0.72 % (1255758)Termination reason: Instruction limit
% 3.01/0.72 % (1255758)Termination phase: Saturation
% 3.01/0.72 % (1255758)Time elapsed: 0.236 s
% 3.01/0.72 % (1255758)Peak memory usage: 14 MB
% 3.01/0.72 % (1255758)Instructions burned: 479 (million)
% 3.01/0.72 % Exception at run slice level
% 3.01/0.72 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 3.01/0.72 % (1255778)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=982340315:i=5131_2996 on theBenchmark for (2996ds/5131Mi)
% 3.01/0.72 % (1255779)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=2271453145:i=1472:ins=7:fdi=8:gsp=on_2996 on theBenchmark for (2996ds/1472Mi)
% 3.01/0.72 % (1255778)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 3.01/0.72 % (1255779)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 3.01/0.72 % (1255779)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 3.01/0.72 % (1255764) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1255733-1255764"...
% 3.01/0.72 % (1255764)...printing done.
% 3.01/0.72 % (1255764)Refutation found. Thanks to Tanya!
% 3.01/0.72 % SZS status ContradictoryAxioms for theBenchmark
% 3.01/0.72 % SZS output start Proof for theBenchmark
% See solution above
% 3.01/0.72 % (1255764)------------------------------
% 3.01/0.72 % (1255764)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.01/0.72 % (1255764)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.01/0.72 % (1255764)CaDiCaL version: 2.1.3
% 3.01/0.72 % (1255764)Termination reason: Refutation
% 3.01/0.72 % (1255764)Time elapsed: 0.299 s
% 3.01/0.72 % (1255764)Peak memory usage: 17 MB
% 3.01/0.72 % (1255764)Instructions burned: 632 (million)
% 3.01/0.72 % (1255733)Success in time 0.487 s
% 3.01/0.72 % Vampire exiting
%------------------------------------------------------------------------------