%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWW816_1 : TPTP v9.3.1. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n011.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 : Tue Sep 29 01:37:52 PM UTC 2026
% Result : Unsatisfiable 2.90s 1.12s
% Output : Refutation 3.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 5 unt; 0 typ; 2 def)
% Number of atoms : 298 ( 204 equ)
% Maximal formula atoms : 41 ( 19 avg)
% Number of connectives : 372 ( 89 ~; 13 |; 184 &)
% ( 2 <=>; 84 =>; 0 <=; 0 <~>)
% Maximal formula depth : 66 ( 28 avg)
% Maximal term depth : 8 ( 2 avg)
% Number arithmetic : 477 ( 68 atm; 87 fun; 201 num; 121 var)
% Number of types : 7 ( 4 usr; 2 ari; 0 dat; 0 cdt)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 27 ( 23 usr; 3 prp; 0-4 aty)
% Number of functors : 272 ( 261 usr; 32 con; 0-9 aty)
% Number of variables : 183 ( 93 !; 90 ?; 183 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
c_ssorted: $tType ).
tff(type_def_6,type,
c_Boolean: $tType ).
tff(type_def_7,type,
c_type: $tType ).
tff(type_def_8,type,
c_unique: $tType ).
tff(func_def_0,type,
pset_acc_range_left: ( c_ssorted * c_ssorted * $int ) > c_unique ).
tff(func_def_1,type,
c_Boolean_true: c_Boolean ).
tff(func_def_2,type,
ss2Real: c_ssorted > $real ).
tff(func_def_3,type,
base_addr: c_ssorted > c_unique ).
tff(func_def_4,type,
pset_acc_range: ( c_ssorted * c_ssorted * $int * $int ) > c_unique ).
tff(func_def_5,type,
type_pset: c_type > c_type ).
tff(func_def_6,type,
'%': ( $int * $int ) > $int ).
tff(func_def_7,type,
neq_int_bool: ( $int * $int ) > c_Boolean ).
tff(func_def_8,type,
whydivide: ( $int * $int ) > $int ).
tff(func_def_9,type,
c_Boolean_false: c_Boolean ).
tff(func_def_10,type,
pset_singleton: c_ssorted > c_unique ).
tff(func_def_11,type,
bool2U: c_Boolean > c_unique ).
tff(func_def_12,type,
type_alloc_table: c_type ).
tff(func_def_13,type,
gt_int_bool: ( $int * $int ) > c_Boolean ).
tff(func_def_14,type,
pset_acc_range_right: ( c_ssorted * c_ssorted * $int ) > c_unique ).
tff(func_def_15,type,
type_pointer: c_type > c_type ).
tff(func_def_16,type,
shift: ( c_ssorted * $int ) > c_unique ).
tff(func_def_17,type,
upd: ( c_ssorted * c_ssorted * c_ssorted ) > c_unique ).
tff(func_def_18,type,
pset_all: c_ssorted > c_unique ).
tff(func_def_19,type,
int2U: $int > c_unique ).
tff(func_def_20,type,
c_real: c_type ).
tff(func_def_21,type,
lt_int_bool: ( $int * $int ) > c_Boolean ).
tff(func_def_22,type,
pset_range: ( c_ssorted * $int * $int ) > c_unique ).
tff(func_def_23,type,
ss2Int: c_ssorted > $int ).
tff(func_def_24,type,
pset_union: ( c_ssorted * c_ssorted ) > c_unique ).
tff(func_def_25,type,
le_int_bool: ( $int * $int ) > c_Boolean ).
tff(func_def_26,type,
null: c_unique ).
tff(func_def_27,type,
real2U: $real > c_unique ).
tff(func_def_28,type,
smtlib__ite: ( c_Boolean * c_ssorted * c_ssorted ) > c_unique ).
tff(func_def_29,type,
pset_range_left: ( c_ssorted * $int ) > c_unique ).
tff(func_def_30,type,
block_length: ( c_ssorted * c_ssorted ) > $int ).
tff(func_def_31,type,
c_sort: ( c_type * c_unique ) > c_ssorted ).
tff(func_def_32,type,
eq_int_bool: ( $int * $int ) > c_Boolean ).
tff(func_def_33,type,
sub_pointer: ( c_ssorted * c_ssorted ) > $int ).
tff(func_def_34,type,
pset_empty: c_unique ).
tff(func_def_35,type,
c_bool: c_type ).
tff(func_def_36,type,
ss2Bool: c_ssorted > c_Boolean ).
tff(func_def_37,type,
type_memory: ( c_type * c_type ) > c_type ).
tff(func_def_38,type,
acc: ( c_ssorted * c_ssorted ) > c_unique ).
tff(func_def_39,type,
c_int: c_type ).
tff(func_def_40,type,
type_global: c_type ).
tff(func_def_41,type,
pset_range_right: ( c_ssorted * $int ) > c_unique ).
tff(func_def_42,type,
pset_acc_all: ( c_ssorted * c_ssorted ) > c_unique ).
tff(func_def_43,type,
pset_star: ( c_ssorted * c_ssorted ) > c_unique ).
tff(func_def_44,type,
ge_int_bool: ( $int * $int ) > c_Boolean ).
tff(func_def_45,type,
offset: c_ssorted > $int ).
tff(func_def_58,type,
sK0: ( c_type * c_unique * c_unique ) > c_type ).
tff(func_def_59,type,
sK1: ( c_type * c_unique * c_unique ) > c_unique ).
tff(func_def_60,type,
sK2: ( c_type * c_unique * $int * c_unique ) > c_type ).
tff(func_def_61,type,
sK3: ( c_unique * $int * c_unique * c_type ) > c_ssorted ).
tff(func_def_62,type,
sK4: ( c_unique * $int * c_unique * c_type ) > c_type ).
tff(func_def_63,type,
sK5: ( c_unique * $int * c_unique * c_type ) > c_ssorted ).
tff(func_def_64,type,
sK6: ( c_unique * c_unique * c_type * $int * c_unique * $int ) > c_ssorted ).
tff(func_def_65,type,
sK7: ( c_unique * c_type * c_unique * c_unique * $int ) > c_ssorted ).
tff(func_def_66,type,
sK8: ( c_unique * c_type * c_unique ) > c_type ).
tff(func_def_67,type,
sK9: ( c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_68,type,
sK10: ( c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_69,type,
sK11: ( c_unique * c_unique * c_type ) > c_type ).
tff(func_def_70,type,
sK12: ( c_type * c_unique * c_unique * c_unique * c_type ) > c_type ).
tff(func_def_71,type,
sK13: ( c_type * c_unique * c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_72,type,
sK14: ( c_unique * c_type * c_unique ) > c_type ).
tff(func_def_73,type,
sK15: ( c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_74,type,
sK16: ( c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_75,type,
sK17: ( c_unique * c_type * c_unique ) > c_type ).
tff(func_def_76,type,
sK18: ( c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_77,type,
sK19: ( c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_78,type,
sK20: ( c_type * c_unique * c_unique ) > c_type ).
tff(func_def_79,type,
sK21: ( c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_80,type,
sK22: ( c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_81,type,
sK23: $int ).
tff(func_def_82,type,
sK24: $int ).
tff(func_def_83,type,
sK25: c_unique ).
tff(func_def_84,type,
sK26: $int ).
tff(func_def_85,type,
sK27: c_unique ).
tff(func_def_86,type,
sK28: c_unique ).
tff(func_def_87,type,
sK29: $int ).
tff(func_def_88,type,
sK30: $int ).
tff(func_def_89,type,
sK31: $int ).
tff(func_def_90,type,
sK32: $int ).
tff(func_def_91,type,
sK33: $int ).
tff(func_def_92,type,
sK34: $int ).
tff(func_def_93,type,
sK35: $int ).
tff(func_def_94,type,
sK36: $int ).
tff(func_def_95,type,
sK37: c_unique ).
tff(func_def_96,type,
sK38: c_unique ).
tff(func_def_97,type,
sK39: c_type > c_unique ).
tff(func_def_98,type,
sK40: c_type > $int ).
tff(func_def_99,type,
sK41: c_type > c_unique ).
tff(func_def_100,type,
sK42: c_type > $int ).
tff(func_def_101,type,
sK43: c_type > $int ).
tff(func_def_102,type,
sK44: c_type > c_unique ).
tff(func_def_103,type,
sK45: c_type > $int ).
tff(func_def_104,type,
sK46: c_type > $int ).
tff(func_def_105,type,
sK47: c_type > $int ).
tff(func_def_106,type,
sK48: c_type > $int ).
tff(func_def_107,type,
sK49: c_type > $int ).
tff(func_def_108,type,
sK50: $int > c_type ).
tff(func_def_109,type,
sK51: ( c_type * $int * c_unique * c_unique ) > c_type ).
tff(func_def_110,type,
sK52: ( c_type * $int * c_unique * c_unique ) > c_unique ).
tff(func_def_111,type,
sK53: ( c_type * $int * c_unique * c_unique ) > $int ).
tff(func_def_112,type,
sK54: ( c_type * c_unique * c_unique ) > c_type ).
tff(func_def_113,type,
sK55: ( c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_114,type,
sK56: ( c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_115,type,
sK57: ( c_type * c_unique * $int * c_unique ) > c_type ).
tff(func_def_116,type,
sK58: ( c_type * c_unique * $int * c_unique ) > c_unique ).
tff(func_def_117,type,
sK59: ( c_type * c_unique * $int * c_unique ) > $int ).
tff(func_def_118,type,
sK60: ( c_type * $int * c_unique * c_unique * $int ) > c_ssorted ).
tff(func_def_119,type,
sK61: ( c_type * $int * c_unique * c_unique * $int ) > c_ssorted ).
tff(func_def_120,type,
sK62: ( c_type * $int * c_unique * c_unique * $int ) > $int ).
tff(func_def_121,type,
sK63: ( c_type * c_unique * c_unique * c_unique ) > c_type ).
tff(func_def_122,type,
sK64: ( c_type * c_unique * c_unique * c_unique ) > c_ssorted ).
tff(func_def_123,type,
sK65: ( c_type * c_unique * c_unique * c_unique ) > c_ssorted ).
tff(func_def_124,type,
sK66: ( c_type * c_unique * c_unique * c_unique ) > c_ssorted ).
tff(func_def_125,type,
sK67: ( c_type * c_unique * $int * c_type * c_unique ) > c_type ).
tff(func_def_126,type,
sK68: ( c_type * c_unique * $int * c_type * c_unique ) > c_unique ).
tff(func_def_127,type,
sK69: ( c_type * c_unique * $int * c_type * c_unique ) > c_unique ).
tff(func_def_128,type,
sK70: ( c_type * c_unique * $int * c_type * c_unique ) > $int ).
tff(func_def_129,type,
sK71: ( c_type * c_unique * $int * c_type * c_unique * c_unique * $int ) > c_type ).
tff(func_def_130,type,
sK72: ( c_type * c_unique * $int * c_type * c_unique * c_unique * $int ) > c_type ).
tff(func_def_131,type,
sK73: ( c_type * c_unique * $int * c_type * c_unique * c_unique * $int ) > c_ssorted ).
tff(func_def_132,type,
sK74: ( c_unique * c_type * $int * c_unique ) > c_type ).
tff(func_def_133,type,
sK75: ( c_type * c_unique * c_unique ) > c_type ).
tff(func_def_134,type,
sK76: ( c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_135,type,
sK77: ( c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_136,type,
sK78: ( c_unique * $int * c_type * $int * c_unique ) > c_ssorted ).
tff(func_def_137,type,
sK79: ( c_unique * $int * c_type * $int * c_unique ) > c_ssorted ).
tff(func_def_138,type,
sK80: ( c_unique * $int * c_type * $int * c_unique ) > c_type ).
tff(func_def_139,type,
sK81: ( c_unique * $int * c_type * $int * c_unique ) > c_unique ).
tff(func_def_140,type,
sK82: ( c_unique * $int * c_type * $int * c_unique ) > $int ).
tff(func_def_141,type,
sK83: ( c_unique * $int * c_type * c_type * c_unique * c_unique ) > c_type ).
tff(func_def_142,type,
sK84: ( c_unique * $int * c_type * c_type * c_unique * c_unique ) > c_unique ).
tff(func_def_143,type,
sK85: ( c_unique * $int * c_type * c_type * c_unique * c_unique ) > $int ).
tff(func_def_144,type,
sK86: ( c_type * c_unique * $int * c_type ) > c_unique ).
tff(func_def_145,type,
sK87: ( c_type * c_unique * $int * c_type ) > c_unique ).
tff(func_def_146,type,
sK88: ( c_type * c_unique * $int * c_type * c_unique * c_unique ) > c_type ).
tff(func_def_147,type,
sK89: ( c_type * c_unique * $int * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_148,type,
sK90: ( c_type * c_unique * $int * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_149,type,
sK91: ( c_unique * c_unique * c_type * c_type * c_unique ) > c_type ).
tff(func_def_150,type,
sK92: ( c_unique * c_unique * c_type * c_type * c_unique ) > c_unique ).
tff(func_def_151,type,
sK93: ( c_unique * c_unique * c_type * c_type * c_unique ) > $int ).
tff(func_def_152,type,
sK94: ( c_unique * c_type * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_153,type,
sK95: ( c_unique * c_unique * $int * $int * c_type ) > c_type ).
tff(func_def_154,type,
sK96: ( c_unique * c_unique * $int * $int * c_type ) > c_ssorted ).
tff(func_def_155,type,
sK97: ( c_unique * c_unique * $int * $int * c_type ) > c_ssorted ).
tff(func_def_156,type,
sK98: ( c_unique * c_unique * c_unique * c_type * c_type ) > c_type ).
tff(func_def_157,type,
sK99: ( c_unique * c_unique * c_unique * c_type * c_type * c_unique * $int ) > c_type ).
tff(func_def_158,type,
sK100: c_unique > c_ssorted ).
tff(func_def_159,type,
sK101: ( c_type * c_unique * c_unique * c_unique * c_unique * c_type ) > c_type ).
tff(func_def_160,type,
sK102: ( c_type * c_unique * c_unique * c_unique * c_unique * c_type ) > c_type ).
tff(func_def_161,type,
sK103: ( c_type * c_unique * c_unique * c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_162,type,
sK104: ( c_type * c_unique * c_unique * c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_163,type,
sK105: ( $int * c_unique * $int * c_unique * c_type ) > c_type ).
tff(func_def_164,type,
sK106: ( $int * c_unique * $int * c_unique * c_type ) > c_ssorted ).
tff(func_def_165,type,
sK107: ( $int * c_unique * $int * c_unique * c_type ) > c_ssorted ).
tff(func_def_166,type,
sK108: ( c_type * c_unique * $int * c_unique ) > c_ssorted ).
tff(func_def_167,type,
sK109: ( c_type * c_unique * $int * c_unique ) > c_ssorted ).
tff(func_def_168,type,
sK110: ( c_type * c_unique * $int * c_unique ) > $int ).
tff(func_def_169,type,
sK111: ( c_unique * c_type * c_type * c_unique * c_unique ) > c_type ).
tff(func_def_170,type,
sK112: ( c_unique * c_type * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_171,type,
sK113: ( c_unique * c_type * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_172,type,
sK114: ( c_unique * c_type * c_type ) > c_unique ).
tff(func_def_173,type,
sK115: ( c_unique * c_type * c_type ) > c_unique ).
tff(func_def_174,type,
sK116: ( c_unique * c_unique * c_type * $int * c_type ) > c_type ).
tff(func_def_175,type,
sK117: ( c_unique * c_unique * c_type * $int * c_type * $int * c_unique * c_unique ) > c_type ).
tff(func_def_176,type,
sK118: ( c_unique * c_unique * c_type * $int * c_type * $int * c_unique * c_unique ) > c_type ).
tff(func_def_177,type,
sK119: ( c_unique * c_unique * c_type * $int * c_type ) > $int ).
tff(func_def_178,type,
sK120: ( c_unique * c_unique * c_type * $int * c_type ) > c_unique ).
tff(func_def_179,type,
sK121: ( c_unique * c_unique * c_type * $int * c_type ) > c_unique ).
tff(func_def_180,type,
sK122: ( c_type * c_type * c_unique * $int * c_unique * c_unique ) > c_type ).
tff(func_def_181,type,
sK123: ( c_type * c_type * c_unique * $int * c_unique * c_unique ) > c_unique ).
tff(func_def_182,type,
sK124: ( c_type * c_type * c_unique * $int * c_unique * c_unique ) > $int ).
tff(func_def_183,type,
sK125: ( c_unique * c_unique * $int * c_type ) > c_type ).
tff(func_def_184,type,
sK126: ( c_unique * c_unique * $int * c_type ) > c_ssorted ).
tff(func_def_185,type,
sK127: ( c_unique * c_unique * $int * c_type ) > c_ssorted ).
tff(func_def_186,type,
sK128: ( c_unique * c_unique * c_type * c_unique * $int * c_type ) > c_type ).
tff(func_def_187,type,
sK129: ( c_unique * c_unique * c_type * c_unique * $int * c_type * c_unique * $int ) > c_type ).
tff(func_def_188,type,
sK130: ( c_unique * c_unique * c_unique * c_type ) > c_type ).
tff(func_def_189,type,
sK131: ( c_unique * c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_190,type,
sK132: ( c_unique * c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_191,type,
sK133: ( c_type * $int * c_unique ) > c_type ).
tff(func_def_192,type,
sK134: ( c_type * $int * c_unique ) > c_ssorted ).
tff(func_def_193,type,
sK135: ( c_unique * c_unique * $int * c_type * $int * c_unique * c_type ) > c_type ).
tff(func_def_194,type,
sK136: ( c_unique * c_unique * $int * c_type * $int * c_unique * c_type * c_unique * $int ) > c_type ).
tff(func_def_195,type,
sK137: ( c_unique * c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_196,type,
sK138: ( c_type * $int * c_unique * c_type * c_unique * $int * $int ) > c_type ).
tff(func_def_197,type,
sK139: ( c_type * $int * c_unique * c_type * c_unique * $int * $int ) > c_ssorted ).
tff(func_def_198,type,
sK140: ( c_type * $int * c_unique * c_type * c_unique * $int * $int ) > c_type ).
tff(func_def_199,type,
sK141: ( c_type * $int * c_unique * c_type * c_unique * $int * $int ) > c_ssorted ).
tff(func_def_200,type,
sK142: ( c_type * $int * c_unique * c_type ) > c_unique ).
tff(func_def_201,type,
sK143: ( c_type * $int * c_unique * c_type ) > c_unique ).
tff(func_def_202,type,
sK144: ( c_type * $int * c_unique * c_type ) > $int ).
tff(func_def_203,type,
sK145: ( c_type * $int * c_unique * c_type ) > $int ).
tff(func_def_204,type,
sK146: ( c_unique * c_type * c_unique * c_unique ) > c_type ).
tff(func_def_205,type,
sK147: ( c_unique * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_206,type,
sK148: ( c_unique * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_207,type,
sK149: ( c_unique * c_type * c_unique * c_unique * c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_208,type,
sK150: ( c_unique * c_type * c_unique * c_unique * c_unique * c_type * c_unique ) > c_type ).
tff(func_def_209,type,
sK151: ( c_unique * c_type * c_unique * c_unique * c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_210,type,
sK152: ( c_unique * c_type * c_unique * c_unique * c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_211,type,
sK153: ( c_unique * c_type * c_unique * c_unique * c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_212,type,
sK154: ( c_unique * c_type * c_unique * c_unique * c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_213,type,
sK155: ( c_type * c_unique * $int * c_type * c_unique * c_unique ) > c_type ).
tff(func_def_214,type,
sK156: ( c_type * c_unique * $int * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_215,type,
sK157: ( c_type * c_unique * $int * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_216,type,
sK158: ( c_type * c_unique * $int * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_217,type,
sK159: ( c_unique * c_type ) > c_ssorted ).
tff(func_def_218,type,
sK160: ( $int * $int * c_unique * c_type ) > c_type ).
tff(func_def_219,type,
sK161: ( $int * $int * c_unique * c_type ) > c_ssorted ).
tff(func_def_220,type,
sK162: ( c_type * c_unique * c_type * c_unique ) > c_type ).
tff(func_def_221,type,
sK163: ( c_type * c_unique * c_type * c_unique * c_unique * c_unique ) > c_type ).
tff(func_def_222,type,
sK164: ( c_type * c_unique * c_type * c_unique * c_unique * c_unique ) > c_type ).
tff(func_def_223,type,
sK165: ( c_type * c_unique * c_type * c_unique ) > c_unique ).
tff(func_def_224,type,
sK166: ( c_type * c_unique * c_type * c_unique ) > c_unique ).
tff(func_def_225,type,
sK167: ( c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_226,type,
sK168: ( c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_227,type,
sK169: ( c_unique * c_unique * c_type ) > $int ).
tff(func_def_228,type,
sK170: ( c_unique * c_type * $int * c_type * c_unique * $int * c_unique ) > c_type ).
tff(func_def_229,type,
sK171: ( c_unique * c_type * $int * c_type * c_unique * $int * c_unique ) > c_unique ).
tff(func_def_230,type,
sK172: ( c_unique * c_type * $int * c_type * c_unique * $int * c_unique ) > $int ).
tff(func_def_231,type,
sK173: ( c_type * c_unique * c_unique * c_unique * c_type ) > c_type ).
tff(func_def_232,type,
sK174: ( c_type * c_unique * c_unique * c_unique * c_type ) > c_unique ).
tff(func_def_233,type,
sK175: ( c_unique * c_unique * c_type ) > c_type ).
tff(func_def_234,type,
sK176: ( c_unique * c_unique * c_type * c_unique ) > c_type ).
tff(func_def_235,type,
sK177: ( c_unique * c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_236,type,
sK178: ( c_unique * c_unique * c_type ) > c_type ).
tff(func_def_237,type,
sK179: ( c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_238,type,
sK180: ( c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_239,type,
sK181: $int > $int ).
tff(func_def_240,type,
sK182: ( c_unique * c_type * c_unique * c_type * c_unique * c_unique ) > c_type ).
tff(func_def_241,type,
sK183: ( c_unique * c_type * c_unique * c_type * c_unique * c_unique ) > c_unique ).
tff(func_def_242,type,
sK184: ( c_unique * c_type * c_unique * c_type * c_unique * c_unique * c_unique ) > c_ssorted ).
tff(func_def_243,type,
sK185: ( c_unique * c_unique * c_type ) > c_type ).
tff(func_def_244,type,
sK186: ( c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_245,type,
sK187: ( c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_246,type,
sK188: ( c_unique * c_unique * c_type * c_type ) > c_type ).
tff(func_def_247,type,
sK189: ( c_unique * c_unique * c_type * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_248,type,
sK190: ( c_unique * c_unique * c_type * c_type * c_unique * c_unique ) > c_type ).
tff(func_def_249,type,
sK191: ( c_unique * c_unique * c_type * c_type ) > c_unique ).
tff(func_def_250,type,
sK192: ( c_unique * c_unique * c_type * c_type ) > c_unique ).
tff(func_def_251,type,
sK193: ( c_type * c_type * c_unique * c_unique * $int * c_unique ) > c_type ).
tff(func_def_252,type,
sK194: ( c_type * c_type * c_unique * c_unique * $int * c_unique * c_unique * $int ) > c_type ).
tff(func_def_253,type,
sK195: ( c_type * c_unique * $int ) > c_type ).
tff(func_def_254,type,
sK196: ( c_type * c_unique * $int ) > c_ssorted ).
tff(func_def_255,type,
sK197: ( c_unique * c_type * c_unique * c_type * c_unique ) > c_type ).
tff(func_def_256,type,
sK198: ( c_unique * c_type * c_unique * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_257,type,
sK199: ( $int * $int * $int * c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_258,type,
sK200: ( $int * $int * $int * c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_259,type,
sK201: ( c_type * c_unique * $int * $int * $int * c_unique ) > c_ssorted ).
tff(func_def_260,type,
sK202: ( c_type * c_unique * $int * $int * $int * c_unique ) > c_type ).
tff(func_def_261,type,
sK203: ( c_type * c_unique * $int * $int * $int * c_unique ) > c_ssorted ).
tff(func_def_262,type,
sK204: ( c_unique * c_unique * c_type * $int * $int ) > c_type ).
tff(func_def_263,type,
sK205: ( c_unique * c_unique * c_type * $int * $int ) > c_ssorted ).
tff(func_def_264,type,
sK206: ( c_unique * c_unique * c_type * $int * $int ) > c_ssorted ).
tff(func_def_265,type,
sK207: ( c_unique * $int * c_type * c_unique * $int ) > c_type ).
tff(func_def_266,type,
sK208: ( c_unique * c_unique * c_unique * c_type ) > c_type ).
tff(func_def_267,type,
sK209: ( c_unique * c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_268,type,
sK210: ( c_unique * c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_269,type,
sK211: ( c_unique * c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_270,type,
sK212: ( c_unique * c_unique * c_unique ) > c_ssorted ).
tff(func_def_271,type,
sK213: ( c_unique * c_unique * c_unique ) > c_ssorted ).
tff(func_def_272,type,
sK214: ( c_unique * c_unique * c_unique ) > c_ssorted ).
tff(pred_def_1,type,
fresh: ( c_ssorted * c_ssorted ) > $o ).
tff(pred_def_2,type,
gt_pointer: ( c_ssorted * c_ssorted ) > $o ).
tff(pred_def_3,type,
valid_acc_range: ( c_ssorted * $int ) > $o ).
tff(pred_def_4,type,
on_stack: ( c_ssorted * c_ssorted ) > $o ).
tff(pred_def_5,type,
valid_acc: c_ssorted > $o ).
tff(pred_def_6,type,
le_pointer: ( c_ssorted * c_ssorted ) > $o ).
tff(pred_def_7,type,
not_assigns: ( c_ssorted * c_ssorted * c_ssorted * c_ssorted ) > $o ).
tff(pred_def_8,type,
valid_range: ( c_ssorted * c_ssorted * $int * $int ) > $o ).
tff(pred_def_9,type,
valid_index: ( c_ssorted * c_ssorted * $int ) > $o ).
tff(pred_def_10,type,
not_in_pset: ( c_ssorted * c_ssorted ) > $o ).
tff(pred_def_11,type,
ge_pointer: ( c_ssorted * c_ssorted ) > $o ).
tff(pred_def_12,type,
free_stack: ( c_ssorted * c_ssorted * c_ssorted ) > $o ).
tff(pred_def_13,type,
valid: ( c_ssorted * c_ssorted ) > $o ).
tff(pred_def_14,type,
separation1: ( c_ssorted * c_ssorted ) > $o ).
tff(pred_def_15,type,
alloc_extends: ( c_ssorted * c_ssorted ) > $o ).
tff(pred_def_16,type,
separation1_range: ( c_ssorted * $int ) > $o ).
tff(pred_def_17,type,
lt_pointer: ( c_ssorted * c_ssorted ) > $o ).
tff(pred_def_18,type,
on_heap: ( c_ssorted * c_ssorted ) > $o ).
tff(pred_def_19,type,
separation1_range1: ( c_ssorted * c_ssorted * $int ) > $o ).
tff(pred_def_20,type,
separation2_range1: ( c_ssorted * c_ssorted * $int ) > $o ).
tff(pred_def_21,type,
separation2: ( c_ssorted * c_ssorted ) > $o ).
tff(f101,axiom,
~ ! [X4: c_unique,X0: $int,X3: $int,X2: $int,X1: c_unique] :
( ( ( X3 = 2800 )
& ( X0 = 10000 )
& valid_range(c_sort(type_alloc_table,X1),c_sort(type_pointer(type_global),X4),0,2800)
& ( X2 = 0 ) )
=> ! [X6: c_unique,X5: $int] :
( ( ! [X7: $int] :
? [X8: c_type] :
( ( ( $less(X7,X5)
& $lesseq(0,X7) )
=> ( ss2Int(c_sort(c_int,acc(c_sort(type_memory(c_int,type_global),X6),c_sort(X8,shift(c_sort(X8,X4),X7))))) = 2000 ) )
& ( X8 = type_pointer(type_global) ) )
& $lesseq(0,X5)
& $lesseq(X5,2800) )
=> ( ( $difference(X5,X3) = 0 )
=> ! [X9: $int] :
( ( ( '%'(X9,14) = 0 )
& $lesseq(X9,2800)
& $lesseq(0,X9) )
=> ! [X10: $int] :
( ( X10 = 0 )
=> ! [X11: $int] :
( ( X11 = $product(X9,2) )
=> ( ( X11 != 0 )
=> ! [X12: $int] :
( ( X12 = X9 )
=> ! [X15: $int,X16: c_unique,X14: $int,X13: $int] :
( ( $lesseq(1,X13)
& ( X15 = $product(X13,2) )
& $lesseq(X13,X9) )
=> ( ( 1 != 0 )
=> ! [X17: c_unique] :
? [X18: c_type] :
( ( X18 = type_pointer(type_global) )
& ( ( X17 = shift(c_sort(X18,X4),X13) )
=> ( valid(c_sort(type_alloc_table,X1),c_sort(X18,X17))
=> ! [X19: c_unique] :
( ( X19 = acc(c_sort(type_memory(c_int,type_global),X16),c_sort(X18,X17)) )
=> ! [X20: $int] :
( ( X20 = $sum(X14,$product(ss2Int(c_sort(c_int,X19)),X0)) )
=> ! [X21: c_unique] :
( ( X21 = shift(c_sort(X18,X4),X13) )
=> ! [X22: $int] :
( ( X22 = $difference(X15,1) )
=> ( ( X22 != 0 )
=> ! [X23: $int] :
( ( X23 = '%'(X20,X22) )
=> ( valid(c_sort(type_alloc_table,X1),c_sort(X18,X21))
=> ! [X24: c_unique] :
( ( X24 = upd(c_sort(type_memory(c_int,type_global),X16),c_sort(X18,X21),c_sort(c_int,int2U(X23))) )
=> ! [X25: $int] :
( ( X25 = $difference(X22,1) )
=> ( ( X22 != 0 )
=> ! [X26: $int] :
( ( X26 = whydivide(X20,X22) )
=> ! [X27: $int] :
( ( X27 = X26 )
=> ! [X28: $int] :
( ( X28 = $difference(X13,1) )
=> ( ( X28 != 0 )
=> ! [X29: $int] :
( ( X29 = $product(X27,X28) )
=> $lesseq(0,X13) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',formula_101) ).
tff(f130,plain,
~ ! [X4: c_unique,X0: $int,X3: $int,X2: $int,X1: c_unique] :
( ( ( X3 = 2800 )
& ( X0 = 10000 )
& valid_range(c_sort(type_alloc_table,X1),c_sort(type_pointer(type_global),X4),0,2800)
& ( X2 = 0 ) )
=> ! [X6: c_unique,X5: $int] :
( ( ! [X7: $int] :
? [X8: c_type] :
( ( ( $less(X7,X5)
& ~ $less(X7,0) )
=> ( ss2Int(c_sort(c_int,acc(c_sort(type_memory(c_int,type_global),X6),c_sort(X8,shift(c_sort(X8,X4),X7))))) = 2000 ) )
& ( X8 = type_pointer(type_global) ) )
& ~ $less(X5,0)
& ~ $less(2800,X5) )
=> ( ( 0 = $sum(X5,$uminus(X3)) )
=> ! [X9: $int] :
( ( ~ $less(2800,X9)
& ~ $less(X9,0)
& ( '%'(X9,14) = 0 ) )
=> ! [X10: $int] :
( ( X10 = 0 )
=> ! [X11: $int] :
( ( X11 = $product(X9,2) )
=> ( ( X11 != 0 )
=> ! [X12: $int] :
( ( X12 = X9 )
=> ! [X15: $int,X16: c_unique,X14: $int,X13: $int] :
( ( ~ $less(X13,1)
& ( X15 = $product(X13,2) )
& ~ $less(X9,X13) )
=> ( ( 1 != 0 )
=> ! [X17: c_unique] :
? [X18: c_type] :
( ( X18 = type_pointer(type_global) )
& ( ( X17 = shift(c_sort(X18,X4),X13) )
=> ( valid(c_sort(type_alloc_table,X1),c_sort(X18,X17))
=> ! [X19: c_unique] :
( ( X19 = acc(c_sort(type_memory(c_int,type_global),X16),c_sort(X18,X17)) )
=> ! [X20: $int] :
( ( X20 = $sum(X14,$product(ss2Int(c_sort(c_int,X19)),X0)) )
=> ! [X21: c_unique] :
( ( X21 = shift(c_sort(X18,X4),X13) )
=> ! [X22: $int] :
( ( $sum(X15,$uminus(1)) = X22 )
=> ( ( X22 != 0 )
=> ! [X23: $int] :
( ( X23 = '%'(X20,X22) )
=> ( valid(c_sort(type_alloc_table,X1),c_sort(X18,X21))
=> ! [X24: c_unique] :
( ( X24 = upd(c_sort(type_memory(c_int,type_global),X16),c_sort(X18,X21),c_sort(c_int,int2U(X23))) )
=> ! [X25: $int] :
( ( $sum(X22,$uminus(1)) = X25 )
=> ( ( X22 != 0 )
=> ! [X26: $int] :
( ( X26 = whydivide(X20,X22) )
=> ! [X27: $int] :
( ( X27 = X26 )
=> ! [X28: $int] :
( ( $sum(X13,$uminus(1)) = X28 )
=> ( ( X28 != 0 )
=> ! [X29: $int] :
( ( X29 = $product(X27,X28) )
=> ~ $less(X13,0) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(theory_normalization,[],[f101]) ).
tff(f201,plain,
~ ! [X0: c_unique,X2: $int,X3: $int,X1: $int,X4: c_unique] :
( ( ( 2800 = X2 )
& ( 10000 = X1 )
& valid_range(c_sort(type_alloc_table,X4),c_sort(type_pointer(type_global),X0),0,2800)
& ( 0 = X3 ) )
=> ! [X6: $int,X5: c_unique] :
( ( ! [X7: $int] :
? [X8: c_type] :
( ( X8 = type_pointer(type_global) )
& ( ( ~ $less(X7,0)
& $less(X7,X6) )
=> ( 2000 = ss2Int(c_sort(c_int,acc(c_sort(type_memory(c_int,type_global),X5),c_sort(X8,shift(c_sort(X8,X0),X7))))) ) ) )
& ~ $less(X6,0)
& ~ $less(2800,X6) )
=> ( ( 0 = $sum(X6,$uminus(X2)) )
=> ! [X9: $int] :
( ( ~ $less(2800,X9)
& ~ $less(X9,0)
& ( '%'(X9,14) = 0 ) )
=> ! [X10: $int] :
( ( X10 = 0 )
=> ! [X11: $int] :
( ( X11 = $product(X9,2) )
=> ( ( X11 != 0 )
=> ! [X12: $int] :
( ( X12 = X9 )
=> ! [X15: $int,X13: $int,X16: $int,X14: c_unique] :
( ( ~ $less(X9,X16)
& ~ $less(X16,1)
& ( $product(X16,2) = X13 ) )
=> ( ( 1 != 0 )
=> ! [X17: c_unique] :
? [X18: c_type] :
( ( ( shift(c_sort(X18,X0),X16) = X17 )
=> ( valid(c_sort(type_alloc_table,X4),c_sort(X18,X17))
=> ! [X19: c_unique] :
( ( acc(c_sort(type_memory(c_int,type_global),X14),c_sort(X18,X17)) = X19 )
=> ! [X20: $int] :
( ( $sum(X15,$product(ss2Int(c_sort(c_int,X19)),X1)) = X20 )
=> ! [X21: c_unique] :
( ( shift(c_sort(X18,X0),X16) = X21 )
=> ! [X22: $int] :
( ( $sum(X13,$uminus(1)) = X22 )
=> ( ( X22 != 0 )
=> ! [X23: $int] :
( ( X23 = '%'(X20,X22) )
=> ( valid(c_sort(type_alloc_table,X4),c_sort(X18,X21))
=> ! [X24: c_unique] :
( ( upd(c_sort(type_memory(c_int,type_global),X14),c_sort(X18,X21),c_sort(c_int,int2U(X23))) = X24 )
=> ! [X25: $int] :
( ( $sum(X22,$uminus(1)) = X25 )
=> ( ( X22 != 0 )
=> ! [X26: $int] :
( ( X26 = whydivide(X20,X22) )
=> ! [X27: $int] :
( ( X27 = X26 )
=> ! [X28: $int] :
( ( $sum(X16,$uminus(1)) = X28 )
=> ( ( X28 != 0 )
=> ! [X29: $int] :
( ( X29 = $product(X27,X28) )
=> ~ $less(X16,0) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) )
& ( X18 = type_pointer(type_global) ) ) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f130]) ).
tff(f240,plain,
? [X0: c_unique,X2: $int,X3: $int,X1: $int,X4: c_unique] :
( ? [X6: $int,X5: c_unique] :
( ? [X9: $int] :
( ? [X10: $int] :
( ? [X11: $int] :
( ? [X12: $int] :
( ? [X15: $int,X13: $int,X16: $int,X14: c_unique] :
( ? [X17: c_unique] :
! [X18: c_type] :
( ( ? [X19: c_unique] :
( ? [X20: $int] :
( ? [X21: c_unique] :
( ? [X22: $int] :
( ? [X23: $int] :
( ? [X24: c_unique] :
( ? [X25: $int] :
( ? [X26: $int] :
( ? [X27: $int] :
( ? [X28: $int] :
( ? [X29: $int] :
( ( X29 = $product(X27,X28) )
& $less(X16,0) )
& ( X28 != 0 )
& ( $sum(X16,$uminus(1)) = X28 ) )
& ( X27 = X26 ) )
& ( X26 = whydivide(X20,X22) ) )
& ( X22 != 0 )
& ( $sum(X22,$uminus(1)) = X25 ) )
& ( upd(c_sort(type_memory(c_int,type_global),X14),c_sort(X18,X21),c_sort(c_int,int2U(X23))) = X24 ) )
& valid(c_sort(type_alloc_table,X4),c_sort(X18,X21))
& ( X23 = '%'(X20,X22) ) )
& ( X22 != 0 )
& ( $sum(X13,$uminus(1)) = X22 ) )
& ( shift(c_sort(X18,X0),X16) = X21 ) )
& ( $sum(X15,$product(ss2Int(c_sort(c_int,X19)),X1)) = X20 ) )
& ( acc(c_sort(type_memory(c_int,type_global),X14),c_sort(X18,X17)) = X19 ) )
& valid(c_sort(type_alloc_table,X4),c_sort(X18,X17))
& ( shift(c_sort(X18,X0),X16) = X17 ) )
| ( type_pointer(type_global) != X18 ) )
& ( 1 != 0 )
& ~ $less(X9,X16)
& ~ $less(X16,1)
& ( $product(X16,2) = X13 ) )
& ( X12 = X9 ) )
& ( X11 != 0 )
& ( X11 = $product(X9,2) ) )
& ( X10 = 0 ) )
& ~ $less(2800,X9)
& ~ $less(X9,0)
& ( '%'(X9,14) = 0 ) )
& ( 0 = $sum(X6,$uminus(X2)) )
& ! [X7: $int] :
? [X8: c_type] :
( ( X8 = type_pointer(type_global) )
& ( ( 2000 = ss2Int(c_sort(c_int,acc(c_sort(type_memory(c_int,type_global),X5),c_sort(X8,shift(c_sort(X8,X0),X7))))) )
| $less(X7,0)
| ~ $less(X7,X6) ) )
& ~ $less(X6,0)
& ~ $less(2800,X6) )
& ( 2800 = X2 )
& ( 10000 = X1 )
& valid_range(c_sort(type_alloc_table,X4),c_sort(type_pointer(type_global),X0),0,2800)
& ( 0 = X3 ) ),
inference(ennf_transformation,[],[f201]) ).
tff(f241,plain,
? [X3: $int,X2: $int,X4: c_unique,X1: $int,X0: c_unique] :
( ? [X5: c_unique,X6: $int] :
( ~ $less(X6,0)
& ~ $less(2800,X6)
& ? [X9: $int] :
( ~ $less(X9,0)
& ? [X10: $int] :
( ? [X11: $int] :
( ( X11 != 0 )
& ? [X12: $int] :
( ? [X13: $int,X15: $int,X16: $int,X14: c_unique] :
( ~ $less(X9,X16)
& ~ $less(X16,1)
& ( $product(X16,2) = X13 )
& ? [X17: c_unique] :
! [X18: c_type] :
( ( type_pointer(type_global) != X18 )
| ( valid(c_sort(type_alloc_table,X4),c_sort(X18,X17))
& ? [X19: c_unique] :
( ( acc(c_sort(type_memory(c_int,type_global),X14),c_sort(X18,X17)) = X19 )
& ? [X20: $int] :
( ( $sum(X15,$product(ss2Int(c_sort(c_int,X19)),X1)) = X20 )
& ? [X21: c_unique] :
( ( shift(c_sort(X18,X0),X16) = X21 )
& ? [X22: $int] :
( ( X22 != 0 )
& ? [X23: $int] :
( ( X23 = '%'(X20,X22) )
& valid(c_sort(type_alloc_table,X4),c_sort(X18,X21))
& ? [X24: c_unique] :
( ( upd(c_sort(type_memory(c_int,type_global),X14),c_sort(X18,X21),c_sort(c_int,int2U(X23))) = X24 )
& ? [X25: $int] :
( ( $sum(X22,$uminus(1)) = X25 )
& ? [X26: $int] :
( ? [X27: $int] :
( ? [X28: $int] :
( ? [X29: $int] :
( ( X29 = $product(X27,X28) )
& $less(X16,0) )
& ( X28 != 0 )
& ( $sum(X16,$uminus(1)) = X28 ) )
& ( X27 = X26 ) )
& ( X26 = whydivide(X20,X22) ) )
& ( X22 != 0 ) ) ) )
& ( $sum(X13,$uminus(1)) = X22 ) ) ) ) )
& ( shift(c_sort(X18,X0),X16) = X17 ) ) )
& ( 1 != 0 ) )
& ( X12 = X9 ) )
& ( X11 = $product(X9,2) ) )
& ( X10 = 0 ) )
& ( '%'(X9,14) = 0 )
& ~ $less(2800,X9) )
& ! [X7: $int] :
? [X8: c_type] :
( ( ( 2000 = ss2Int(c_sort(c_int,acc(c_sort(type_memory(c_int,type_global),X5),c_sort(X8,shift(c_sort(X8,X0),X7))))) )
| ~ $less(X7,X6)
| $less(X7,0) )
& ( X8 = type_pointer(type_global) ) )
& ( 0 = $sum(X6,$uminus(X2)) ) )
& ( 0 = X3 )
& valid_range(c_sort(type_alloc_table,X4),c_sort(type_pointer(type_global),X0),0,2800)
& ( 2800 = X2 )
& ( 10000 = X1 ) ),
inference(flattening,[],[f240]) ).
tff(f326,plain,
? [X0: $int,X1: $int,X2: c_unique,X3: $int,X4: c_unique] :
( ? [X5: c_unique,X6: $int] :
( ~ $less(X6,0)
& ~ $less(2800,X6)
& ? [X7: $int] :
( ~ $less(X7,0)
& ? [X8: $int] :
( ? [X9: $int] :
( ( 0 != X9 )
& ? [X10: $int] :
( ? [X11: $int,X12: $int,X13: $int,X14: c_unique] :
( ~ $less(X7,X13)
& ~ $less(X13,1)
& ( $product(X13,2) = X11 )
& ? [X15: c_unique] :
! [X16: c_type] :
( ( type_pointer(type_global) != X16 )
| ( valid(c_sort(type_alloc_table,X2),c_sort(X16,X15))
& ? [X17: c_unique] :
( ( acc(c_sort(type_memory(c_int,type_global),X14),c_sort(X16,X15)) = X17 )
& ? [X18: $int] :
( ( $sum(X12,$product(ss2Int(c_sort(c_int,X17)),X3)) = X18 )
& ? [X19: c_unique] :
( ( shift(c_sort(X16,X4),X13) = X19 )
& ? [X20: $int] :
( ( 0 != X20 )
& ? [X21: $int] :
( ( '%'(X18,X20) = X21 )
& valid(c_sort(type_alloc_table,X2),c_sort(X16,X19))
& ? [X22: c_unique] :
( ( upd(c_sort(type_memory(c_int,type_global),X14),c_sort(X16,X19),c_sort(c_int,int2U(X21))) = X22 )
& ? [X23: $int] :
( ( $sum(X20,$uminus(1)) = X23 )
& ? [X24: $int] :
( ? [X25: $int] :
( ? [X26: $int] :
( ? [X27: $int] :
( ( $product(X25,X26) = X27 )
& $less(X13,0) )
& ( 0 != X26 )
& ( $sum(X13,$uminus(1)) = X26 ) )
& ( X24 = X25 ) )
& ( whydivide(X18,X20) = X24 ) )
& ( 0 != X20 ) ) ) )
& ( $sum(X11,$uminus(1)) = X20 ) ) ) ) )
& ( shift(c_sort(X16,X4),X13) = X15 ) ) )
& ( 1 != 0 ) )
& ( X7 = X10 ) )
& ( $product(X7,2) = X9 ) )
& ( 0 = X8 ) )
& ( 0 = '%'(X7,14) )
& ~ $less(2800,X7) )
& ! [X28: $int] :
? [X29: c_type] :
( ( ( 2000 = ss2Int(c_sort(c_int,acc(c_sort(type_memory(c_int,type_global),X5),c_sort(X29,shift(c_sort(X29,X4),X28))))) )
| ~ $less(X28,X6)
| $less(X28,0) )
& ( type_pointer(type_global) = X29 ) )
& ( 0 = $sum(X6,$uminus(X1)) ) )
& ( 0 = X0 )
& valid_range(c_sort(type_alloc_table,X2),c_sort(type_pointer(type_global),X4),0,2800)
& ( 2800 = X1 )
& ( 10000 = X3 ) ),
inference(rectify,[],[f241]) ).
tff(f327,plain,
( ~ $less(sK29,0)
& ~ $less(2800,sK29)
& ~ $less(sK30,0)
& ( 0 != sK32 )
& ~ $less(sK30,sK36)
& ~ $less(sK36,1)
& ( sK34 = $product(sK36,2) )
& ! [X16: c_type] :
( ( type_pointer(type_global) != X16 )
| ( valid(c_sort(type_alloc_table,sK25),c_sort(X16,sK38))
& ( acc(c_sort(type_memory(c_int,type_global),sK37),c_sort(X16,sK38)) = sK39(X16) )
& ( sK40(X16) = $sum(sK35,$product(ss2Int(c_sort(c_int,sK39(X16))),sK26)) )
& ( sK41(X16) = shift(c_sort(X16,sK27),sK36) )
& ( 0 != sK42(X16) )
& ( sK43(X16) = '%'(sK40(X16),sK42(X16)) )
& valid(c_sort(type_alloc_table,sK25),c_sort(X16,sK41(X16)))
& ( sK44(X16) = upd(c_sort(type_memory(c_int,type_global),sK37),c_sort(X16,sK41(X16)),c_sort(c_int,int2U(sK43(X16)))) )
& ( $sum(sK42(X16),$uminus(1)) = sK45(X16) )
& ( sK49(X16) = $product(sK47(X16),sK48(X16)) )
& $less(sK36,0)
& ( 0 != sK48(X16) )
& ( $sum(sK36,$uminus(1)) = sK48(X16) )
& ( sK46(X16) = sK47(X16) )
& ( sK46(X16) = whydivide(sK40(X16),sK42(X16)) )
& ( 0 != sK42(X16) )
& ( sK42(X16) = $sum(sK34,$uminus(1)) )
& ( sK38 = shift(c_sort(X16,sK27),sK36) ) ) )
& ( 1 != 0 )
& ( sK33 = sK30 )
& ( sK32 = $product(sK30,2) )
& ( 0 = sK31 )
& ( 0 = '%'(sK30,14) )
& ~ $less(2800,sK30)
& ! [X28: $int] :
( ( ( 2000 = ss2Int(c_sort(c_int,acc(c_sort(type_memory(c_int,type_global),sK28),c_sort(sK50(X28),shift(c_sort(sK50(X28),sK27),X28))))) )
| ~ $less(X28,sK29)
| $less(X28,0) )
& ( type_pointer(type_global) = sK50(X28) ) )
& ( 0 = $sum(sK29,$uminus(sK24)) )
& ( 0 = sK23 )
& valid_range(c_sort(type_alloc_table,sK25),c_sort(type_pointer(type_global),sK27),0,2800)
& ( 2800 = sK24 )
& ( 10000 = sK26 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK23,sK24,sK25,sK26,sK27,sK28,sK29,sK30,sK31,sK32,sK33,sK34,sK35,sK36,sK37,sK38,sK39,sK40,sK41,sK42,sK43,sK44,sK45,sK46,sK47,sK48,sK49,sK50]),skolemize(X0,sK23),skolemize(X1,sK24),skolemize(X2,sK25),skolemize(X3,sK26),skolemize(X4,sK27),skolemize(X5,sK28),skolemize(X6,sK29),skolemize(X7,sK30),skolemize(X8,sK31),skolemize(X9,sK32),skolemize(X10,sK33),skolemize(X11,sK34),skolemize(X12,sK35),skolemize(X13,sK36),skolemize(X14,sK37),skolemize(X15,sK38),skolemize(X17,sK39(X16)),skolemize(X18,sK40(X16)),skolemize(X19,sK41(X16)),skolemize(X20,sK42(X16)),skolemize(X21,sK43(X16)),skolemize(X22,sK44(X16)),skolemize(X23,sK45(X16)),skolemize(X24,sK46(X16)),skolemize(X25,sK47(X16)),skolemize(X26,sK48(X16)),skolemize(X27,sK49(X16)),skolemize(X29,sK50(X28))],[f326]) ).
tff(f535,plain,
! [X16: c_type] :
( ( type_pointer(type_global) != X16 )
| $less(sK36,0) ),
inference(cnf_transformation,[],[f327]) ).
tff(f547,plain,
~ $less(sK36,1),
inference(cnf_transformation,[],[f327]) ).
tff(f998,plain,
$less(sK36,0),
inference(equality_resolution,[],[f535]) ).
tff(f1205,definition,
( spl215_24
<=> $less(sK36,0) ),
introduced(definition,[new_symbols(definition,[spl215_24])],[avatar_definition]) ).
tff(f1208,plain,
spl215_24,
inference(avatar_split_clause,[],[f998,f1205]) ).
tff(f1245,definition,
( spl215_32
<=> $less(sK36,1) ),
introduced(definition,[new_symbols(definition,[spl215_32])],[avatar_definition]) ).
tff(f1248,plain,
~ spl215_32,
inference(avatar_split_clause,[],[f547,f1245]) ).
tff(f1249,plain,
$false,
inference(avatar_smt_refutation,[],[f1248,f1208]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW816_1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.19 % Computer : n011.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 : Mon Sep 28 14:30:53 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.22 Running first-order theorem proving
% 0.09/0.22 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.90/1.12 % (3428035)Detected arithmetic, will pick strategies from an ALASCA-aware ARI schedule.
% 2.90/1.12 % (3428083)dis+21_64_to=kbo:sil=128000:si=on:sp=weighted_frequency:uwa=alasca_can_abstract:random_seed=870905944:i=4:rtra=on_2999 on theBenchmark for (2999ds/4Mi)
% 2.90/1.12 % (3428083)Instruction limit reached!
% 2.90/1.12 % (3428083)------------------------------
% 2.90/1.12 % (3428083)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.90/1.12 % (3428083)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.90/1.12 % (3428083)CaDiCaL version: 2.1.3
% 2.90/1.12 % (3428083)Termination reason: Instruction limit
% 2.90/1.12 % (3428083)Termination phase: shuffling
% 2.90/1.12 % (3428083)Time elapsed: 0.002 s
% 2.90/1.12 % (3428083)Peak memory usage: 86 MB
% 2.90/1.12 % (3428083)Instructions burned: 7 (million)
% 2.90/1.12 % (3428082)lrs+1002_4:1_to=lpo:sil=64000:si=on:br=off:random_seed=442752656:s2a=on:i=7:rtra=on:inst=on_2999 on theBenchmark for (2999ds/7Mi)
% 2.90/1.12 % (3428082)Instruction limit reached!
% 2.90/1.12 % (3428082)------------------------------
% 2.90/1.12 % (3428082)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.90/1.12 % (3428082)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.90/1.12 % (3428082)CaDiCaL version: 2.1.3
% 2.90/1.12 % (3428082)Termination reason: Instruction limit
% 2.90/1.12 % (3428082)Termination phase: Preprocessing 1
% 2.90/1.12 % (3428082)Time elapsed: 0.004 s
% 2.90/1.12 % (3428082)Peak memory usage: 86 MB
% 2.90/1.12 % (3428082)Instructions burned: 7 (million)
% 2.90/1.12 % (3428080)dis+1002_1_to=kbo:sil=128000:tgt=ground:sas=z3:si=on:spb=units:tha=off:random_seed=4212474051:i=307:kws=precedence:nm=0:rtra=on_2999 on theBenchmark for (2999ds/307Mi)
% 2.90/1.12 % (3428081)dis+10_3_slsqr=1,4:to=lpo:sil=128000:thi=strong:si=on:uwa=off:s2agt=20:slsqc=1:slsq=on:random_seed=2617096363:i=201:slsql=off:asg=cautious:rtra=on:gtg=all:ss=axioms:sgt=16_2999 on theBenchmark for (2999ds/201Mi)
% 2.90/1.12 % (3428079)dis+1002_16:1_to=lpo:sil=64000:sas=z3:si=on:norm_ineq=on:gve=force:uwa=one_side_constant:random_seed=3945325310:i=12:doe=on:rtra=on:gtg=exists_top:ss=axioms_2999 on theBenchmark for (2999ds/12Mi)
% 2.90/1.12 % (3428079)Instruction limit reached!
% 2.90/1.12 % (3428079)------------------------------
% 2.90/1.12 % (3428079)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.90/1.12 % (3428079)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.90/1.12 % (3428079)CaDiCaL version: 2.1.3
% 2.90/1.12 % (3428079)Termination reason: Instruction limit
% 2.90/1.12 % (3428079)Termination phase: Saturation
% 2.90/1.12 % (3428079)Time elapsed: 0.007 s
% 2.90/1.12 % (3428079)Peak memory usage: 87 MB
% 2.90/1.12 % (3428079)Instructions burned: 13 (million)
% 2.90/1.12 % (3428085)lrs+10_1_tgt=ground:sas=z3:si=on:random_seed=259104940:i=33:rtra=on_2999 on theBenchmark for (2999ds/33Mi)
% 2.90/1.12 % (3428084)lrs+10_1_to=lpo:sas=z3:si=on:tha=off:random_seed=3781461540:i=46:rtra=on_2999 on theBenchmark for (2999ds/46Mi)
% 2.90/1.12 % (3428085)Instruction limit reached!
% 2.90/1.12 % (3428085)------------------------------
% 2.90/1.12 % (3428085)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.90/1.12 % (3428085)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.90/1.12 % (3428085)CaDiCaL version: 2.1.3
% 2.90/1.12 % (3428085)Termination reason: Instruction limit
% 2.90/1.12 % (3428085)Termination phase: Saturation
% 2.90/1.12 % (3428085)Time elapsed: 0.031 s
% 2.90/1.12 % (3428085)Peak memory usage: 101 MB
% 2.90/1.12 % (3428085)Instructions burned: 33 (million)
% 2.90/1.12 % (3428123)dis+11_3_anc=none:drc=ordering:si=on:urr=ec_only:bce=on:tha=off:sac=on:random_seed=3815103341:st=5:i=14:sd=10:rtra=on:ss=axioms:rawr=on_2998 on theBenchmark for (2998ds/14Mi)
% 2.90/1.12 % (3428123)Refutation not found, incomplete strategy
% 2.90/1.12 % (3428123)------------------------------
% 2.90/1.12 % (3428123)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.90/1.12 % (3428123)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.90/1.12 % (3428123)CaDiCaL version: 2.1.3
% 2.90/1.12 % (3428123)Termination reason: Refutation not found, incomplete strategy
% 2.90/1.12 % (3428123)Time elapsed: 0.001 s
% 2.90/1.12 % (3428123)Peak memory usage: 88 MB
% 2.90/1.12 % (3428123)Instructions burned: 4 (million)
% 2.90/1.12 % (3428080)First to succeed.
% 2.90/1.12 % (3428080)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3428035"
% 2.90/1.12 % (3428084)Instruction limit reached!
% 2.90/1.12 % (3428084)------------------------------
% 2.90/1.12 % (3428084)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.90/1.12 % (3428084)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.90/1.12 % (3428084)CaDiCaL version: 2.1.3
% 2.90/1.12 % (3428084)Termination reason: Instruction limit
% 2.90/1.12 % (3428084)Termination phase: Saturation
% 2.90/1.12 % (3428084)Time elapsed: 0.049 s
% 2.90/1.12 % (3428084)Peak memory usage: 115 MB
% 2.90/1.12 % (3428084)Instructions burned: 46 (million)
% 2.90/1.12 % (3428141)dis+1011_2:1_to=kbo:sil=128000:tgt=full:fde=none:si=on:norm_ineq=on:spb=goal_then_units:tha=some:nwc=2:sac=on:random_seed=3510294921:i=29:thsqd=64:nm=0:thsqc=8:rtra=on:thsq=on:ev=off_2998 on theBenchmark for (2998ds/29Mi)
% 2.90/1.12 % (3428141)Instruction limit reached!
% 2.90/1.12 % (3428141)------------------------------
% 2.90/1.12 % (3428141)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.90/1.12 % (3428141)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.90/1.12 % (3428141)CaDiCaL version: 2.1.3
% 2.90/1.12 % (3428141)Termination reason: Instruction limit
% 2.90/1.12 % (3428141)Termination phase: Saturation
% 2.90/1.12 % (3428141)Time elapsed: 0.015 s
% 2.90/1.12 % (3428141)Peak memory usage: 88 MB
% 2.90/1.12 % (3428141)Instructions burned: 29 (million)
% 2.90/1.12 % (3428150)ott+21_1024_to=lakbo:sil=128000:bsd=on:si=on:alasca=on:uwa=alasca_main:nwc=0.5:random_seed=3553506047:cond=on:i=16:fgj=on:ep=RS:asg=force:nm=10:rtra=on:rawr=on_2998 on theBenchmark for (2998ds/16Mi)
% 2.90/1.12 % (3428150)Instruction limit reached!
% 2.90/1.12 % (3428150)------------------------------
% 2.90/1.12 % (3428150)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.90/1.12 % (3428150)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.90/1.12 % (3428150)CaDiCaL version: 2.1.3
% 2.90/1.12 % (3428150)Termination reason: Instruction limit
% 2.90/1.12 % (3428150)Termination phase: Property scanning
% 2.90/1.12 % (3428150)Time elapsed: 0.011 s
% 2.90/1.12 % (3428150)Peak memory usage: 87 MB
% 2.90/1.12 % (3428150)Instructions burned: 18 (million)
% 2.90/1.12 % (3428081)Instruction limit reached!
% 2.90/1.12 % (3428081)------------------------------
% 2.90/1.12 % (3428081)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.90/1.12 % (3428081)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.90/1.12 % (3428081)CaDiCaL version: 2.1.3
% 2.90/1.12 % (3428081)Termination reason: Instruction limit
% 2.90/1.12 % (3428081)Termination phase: Saturation
% 2.90/1.12 % (3428081)Time elapsed: 0.164 s
% 2.90/1.12 % (3428081)Peak memory usage: 119 MB
% 2.90/1.12 % (3428081)Instructions burned: 201 (million)
% 2.90/1.12 % (3428161)dis+1011_1_prc=on:drc=off:si=on:sac=on:random_seed=3735983577:i=24:canc=force:rtra=on_2998 on theBenchmark for (2998ds/24Mi)
% 2.90/1.12 % (3428161)Instruction limit reached!
% 2.90/1.12 % (3428161)------------------------------
% 2.90/1.12 % (3428161)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.90/1.12 % (3428161)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.90/1.12 % (3428161)CaDiCaL version: 2.1.3
% 2.90/1.12 % (3428161)Termination reason: Instruction limit
% 2.90/1.12 % (3428161)Termination phase: Equality resolution with deletion
% 2.90/1.12 % (3428161)Time elapsed: 0.014 s
% 2.90/1.12 % (3428161)Peak memory usage: 87 MB
% 2.90/1.12 % (3428161)Instructions burned: 25 (million)
% 2.90/1.12 % (3428123)------------------------------
% 2.90/1.12 % (3428123)------------------------------
% 2.90/1.12 % (3428171)ott+1010_8_to=lpo:sil=128000:si=on:norm_ineq=on:sp=unary_frequency:sos=on:gve=cautious:spb=goal_then_units:uwa=alasca_main_floor:tha=some:random_seed=3217696931:i=27:canc=cautious:fsr=off:rtra=on_2997 on theBenchmark for (2997ds/27Mi)
% 2.90/1.12 % (3428171)Instruction limit reached!
% 2.90/1.12 % (3428171)------------------------------
% 2.90/1.12 % (3428171)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.90/1.12 % (3428171)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.90/1.12 % (3428171)CaDiCaL version: 2.1.3
% 2.90/1.12 % (3428171)Termination reason: Instruction limit
% 2.90/1.12 % (3428171)Termination phase: Property scanning
% 2.90/1.12 % (3428171)Time elapsed: 0.015 s
% 2.90/1.12 % (3428171)Peak memory usage: 88 MB
% 2.90/1.12 % (3428171)Instructions burned: 27 (million)
% 2.90/1.12 % (3428188)dis+1002_24_to=kbo:sil=128000:si=on:random_seed=3979977810:i=85:gtgl=4:rtra=on:gtg=exists_sym_2997 on theBenchmark for (2997ds/85Mi)
% 2.90/1.12 % (3428193)dis+1010_128_isp=bottom:to=lpo:thi=overlap:prc=on:sas=z3:si=on:fd=preordered:random_seed=1644494032:i=66:thsqd=64:thsqc=16:rtra=on:thsq=on:ev=force_2996 on theBenchmark for (2996ds/66Mi)
% 2.90/1.12 % (3428189)ott+1002_1_si=on:sp=occurrence:spb=goal:lcm=predicate:random_seed=4190478409:i=2:bd=preordered:nm=2:ins=3:rtra=on:inst=on:tar=off_2996 on theBenchmark for (2996ds/2Mi)
% 2.90/1.12 % (3428189)Instruction limit reached!
% 2.90/1.12 % (3428189)------------------------------
% 2.90/1.12 % (3428189)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.90/1.12 % (3428189)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.90/1.12 % (3428189)CaDiCaL version: 2.1.3
% 2.90/1.12 % (3428189)Termination reason: Instruction limit
% 2.90/1.12 % (3428189)Termination phase: Property scanning
% 2.90/1.12 % (3428189)Time elapsed: 0.002 s
% 2.90/1.12 % (3428189)Peak memory usage: 85 MB
% 2.90/1.12 % (3428189)Instructions burned: 3 (million)
% 2.90/1.12 % (3428190)dis+1010_1_to=kbo:sil=128000:tgt=full:si=on:tha=off:random_seed=3606631890:i=181:rtra=on:ss=axioms:ev=cautious_2996 on theBenchmark for (2996ds/181Mi)
% 2.90/1.12 % (3428190)Refutation not found, incomplete strategy
% 2.90/1.12 % (3428190)------------------------------
% 2.90/1.12 % (3428190)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.90/1.12 % (3428190)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.90/1.12 % (3428190)CaDiCaL version: 2.1.3
% 2.90/1.12 % (3428190)Termination reason: Refutation not found, incomplete strategy
% 2.90/1.12 % (3428190)Time elapsed: 0.003 s
% 2.90/1.12 % (3428190)Peak memory usage: 88 MB
% 2.90/1.12 % (3428190)Instructions burned: 4 (million)
% 2.90/1.12 % (3428192)lrs+10_2_to=lpo:sil=64000:si=on:sos=on:gve=force:lcm=reverse:uwa=one_side_interpreted:random_seed=3162763574:i=4:ep=RST:ins=2:rtra=on_2996 on theBenchmark for (2996ds/4Mi)
% 2.90/1.12 % (3428192)Instruction limit reached!
% 2.90/1.12 % (3428192)------------------------------
% 2.90/1.12 % (3428192)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.90/1.12 % (3428192)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.90/1.12 % (3428192)CaDiCaL version: 2.1.3
% 2.90/1.12 % (3428192)Termination reason: Instruction limit
% 2.90/1.12 % (3428192)Termination phase: Preprocessing 1
% 2.90/1.12 % (3428192)Time elapsed: 0.003 s
% 2.90/1.12 % (3428192)Peak memory usage: 86 MB
% 2.90/1.12 % (3428192)Instructions burned: 6 (million)
% 2.90/1.12 % (3428080)Refutation found. Thanks to Tanya!
% 2.90/1.12 % SZS status Unsatisfiable for theBenchmark
% 2.90/1.12 % SZS output start Proof for theBenchmark
% See solution above
% 3.98/1.31 % (3428080)------------------------------
% 3.98/1.31 % (3428080)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.98/1.31 % (3428080)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.98/1.31 % (3428080)CaDiCaL version: 2.1.3
% 3.98/1.31 % (3428080)Termination reason: Refutation
% 3.98/1.31 % (3428080)Time elapsed: 0.058 s
% 3.98/1.31 % (3428080)Peak memory usage: 118 MB
% 3.98/1.31 % (3428080)Instructions burned: 55 (million)
% 3.98/1.31 % (3428080)------------------------------
% 3.98/1.31 % (3428080)------------------------------
% 3.98/1.31 % (3428035)Success in time 0.472 s
% 3.98/1.31 % Vampire exiting
%------------------------------------------------------------------------------