%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWW818_1 : TPTP v9.3.1. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n013.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 3.34s 1.15s
% Output : Refutation 4.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 6 unt; 0 typ; 2 def)
% Number of atoms : 301 ( 209 equ)
% Maximal formula atoms : 41 ( 17 avg)
% Number of connectives : 377 ( 93 ~; 14 |; 184 &)
% ( 2 <=>; 84 =>; 0 <=; 0 <~>)
% Maximal formula depth : 67 ( 23 avg)
% Maximal term depth : 8 ( 2 avg)
% Number arithmetic : 473 ( 66 atm; 93 fun; 193 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 : 273 ( 261 usr; 33 con; 0-9 aty)
% Number of variables : 184 ( 94 !; 90 ?; 184 :)
% 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 * $int * c_type ) > c_type ).
tff(func_def_59,type,
sK1: ( c_type * c_unique * c_unique * $int * c_type ) > c_unique ).
tff(func_def_60,type,
sK2: ( c_type * c_unique * c_unique * $int * c_type ) > c_unique ).
tff(func_def_61,type,
sK3: ( c_type * c_unique * c_unique * $int * c_type ) > $int ).
tff(func_def_62,type,
sK4: ( c_type * c_unique * c_unique * $int * c_type * c_unique * $int ) > c_type ).
tff(func_def_63,type,
sK5: ( c_type * c_unique * c_unique * $int * c_type * c_unique * $int ) > c_type ).
tff(func_def_64,type,
sK6: ( c_type * c_unique * c_unique * $int * c_type * c_unique * $int ) > c_ssorted ).
tff(func_def_65,type,
sK7: ( c_unique * c_type * c_unique ) > c_type ).
tff(func_def_66,type,
sK8: ( c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_67,type,
sK9: ( c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_68,type,
sK10: ( c_type * c_unique * c_type * c_unique * c_unique ) > c_type ).
tff(func_def_69,type,
sK11: ( c_type * c_unique * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_70,type,
sK12: ( c_type * c_unique * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_71,type,
sK13: ( c_type * c_unique * c_type ) > c_unique ).
tff(func_def_72,type,
sK14: ( c_type * c_unique * c_type ) > c_unique ).
tff(func_def_73,type,
sK15: $int > $int ).
tff(func_def_74,type,
sK16: ( $int * $int * c_type * $int * c_unique * c_unique ) > c_ssorted ).
tff(func_def_75,type,
sK17: ( $int * $int * c_type * $int * c_unique * c_unique ) > c_ssorted ).
tff(func_def_76,type,
sK18: ( $int * c_type * c_type * c_unique * $int * c_unique * c_unique ) > c_type ).
tff(func_def_77,type,
sK19: ( $int * c_type * c_type * c_unique * $int * c_unique * c_unique ) > c_unique ).
tff(func_def_78,type,
sK20: ( $int * c_type * c_type * c_unique * $int * c_unique * c_unique ) > $int ).
tff(func_def_79,type,
sK21: ( c_type * c_unique * c_unique ) > c_type ).
tff(func_def_80,type,
sK22: ( c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_81,type,
sK23: ( c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_82,type,
sK24: ( c_type * c_unique * c_unique ) > c_type ).
tff(func_def_83,type,
sK25: ( c_unique * c_type * c_unique ) > c_type ).
tff(func_def_84,type,
sK26: ( c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_85,type,
sK27: ( c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_86,type,
sK28: ( c_unique * c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_87,type,
sK29: ( c_unique * c_type * $int * $int * c_unique * $int ) > c_type ).
tff(func_def_88,type,
sK30: ( c_unique * c_type * $int * $int * c_unique * $int ) > c_ssorted ).
tff(func_def_89,type,
sK31: ( c_unique * c_type * $int * $int * c_unique * $int ) > c_ssorted ).
tff(func_def_90,type,
sK32: ( c_type * c_unique * $int ) > c_type ).
tff(func_def_91,type,
sK33: ( c_type * c_unique * $int ) > c_ssorted ).
tff(func_def_92,type,
sK34: ( c_unique * c_type * c_type * c_unique ) > c_type ).
tff(func_def_93,type,
sK35: ( c_unique * c_type * c_type * c_unique * c_unique * c_unique ) > c_type ).
tff(func_def_94,type,
sK36: ( c_unique * c_type * c_type * c_unique * c_unique * c_unique ) > c_type ).
tff(func_def_95,type,
sK37: ( c_unique * c_type * c_type * c_unique ) > c_unique ).
tff(func_def_96,type,
sK38: ( c_unique * c_type * c_type * c_unique ) > c_unique ).
tff(func_def_97,type,
sK39: ( c_type * c_unique * c_unique ) > c_type ).
tff(func_def_98,type,
sK40: ( c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_99,type,
sK41: ( c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_100,type,
sK42: ( c_unique * c_type * c_unique * c_unique * c_type ) > c_type ).
tff(func_def_101,type,
sK43: ( c_unique * c_type * c_unique * c_unique * c_type ) > c_unique ).
tff(func_def_102,type,
sK44: ( c_type * $int * c_unique * c_type * c_unique * $int * $int ) > c_type ).
tff(func_def_103,type,
sK45: ( c_type * $int * c_unique * c_type * c_unique * $int * $int ) > c_type ).
tff(func_def_104,type,
sK46: ( c_type * $int * c_unique * c_type * c_unique * $int * $int ) > c_ssorted ).
tff(func_def_105,type,
sK47: ( c_type * $int * c_unique * c_type * c_unique * $int * $int ) > c_ssorted ).
tff(func_def_106,type,
sK48: ( c_type * $int * c_unique * c_type ) > c_unique ).
tff(func_def_107,type,
sK49: ( c_type * $int * c_unique * c_type ) > c_unique ).
tff(func_def_108,type,
sK50: ( c_type * $int * c_unique * c_type ) > $int ).
tff(func_def_109,type,
sK51: ( c_type * $int * c_unique * c_type ) > $int ).
tff(func_def_110,type,
sK52: c_unique ).
tff(func_def_111,type,
sK53: c_unique ).
tff(func_def_112,type,
sK54: $int ).
tff(func_def_113,type,
sK55: $int ).
tff(func_def_114,type,
sK56: $int ).
tff(func_def_115,type,
sK57: c_unique ).
tff(func_def_116,type,
sK58: $int ).
tff(func_def_117,type,
sK59: $int > c_type ).
tff(func_def_118,type,
sK60: $int ).
tff(func_def_119,type,
sK61: $int ).
tff(func_def_120,type,
sK62: $int ).
tff(func_def_121,type,
sK63: $int ).
tff(func_def_122,type,
sK64: $int ).
tff(func_def_123,type,
sK65: $int ).
tff(func_def_124,type,
sK66: $int ).
tff(func_def_125,type,
sK67: c_unique ).
tff(func_def_126,type,
sK68: c_unique ).
tff(func_def_127,type,
sK69: c_type > c_unique ).
tff(func_def_128,type,
sK70: c_type > $int ).
tff(func_def_129,type,
sK71: c_type > c_unique ).
tff(func_def_130,type,
sK72: c_type > $int ).
tff(func_def_131,type,
sK73: c_type > $int ).
tff(func_def_132,type,
sK74: c_type > c_unique ).
tff(func_def_133,type,
sK75: c_type > $int ).
tff(func_def_134,type,
sK76: c_type > $int ).
tff(func_def_135,type,
sK77: c_type > $int ).
tff(func_def_136,type,
sK78: c_type > $int ).
tff(func_def_137,type,
sK79: c_type > $int ).
tff(func_def_138,type,
sK80: ( c_type * c_unique * $int * c_type ) > c_unique ).
tff(func_def_139,type,
sK81: ( c_type * c_unique * $int * c_type ) > c_unique ).
tff(func_def_140,type,
sK82: ( c_type * c_unique * $int * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_141,type,
sK83: ( c_type * c_unique * $int * c_type * c_unique * c_unique ) > c_type ).
tff(func_def_142,type,
sK84: ( c_type * c_unique * $int * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_143,type,
sK85: ( c_unique * c_unique * c_type ) > c_type ).
tff(func_def_144,type,
sK86: ( c_unique * c_unique * c_type ) > c_unique ).
tff(func_def_145,type,
sK87: ( c_type * c_unique * c_unique * c_type ) > c_type ).
tff(func_def_146,type,
sK88: ( c_type * c_unique * c_unique * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_147,type,
sK89: ( c_type * c_unique * c_unique * c_type * c_unique * c_unique ) > c_type ).
tff(func_def_148,type,
sK90: ( c_type * c_unique * c_unique * c_type ) > c_unique ).
tff(func_def_149,type,
sK91: ( c_type * c_unique * c_unique * c_type ) > c_unique ).
tff(func_def_150,type,
sK92: ( c_type * c_unique ) > c_ssorted ).
tff(func_def_151,type,
sK93: ( c_type * c_unique * c_type * c_unique * c_unique ) > c_type ).
tff(func_def_152,type,
sK94: ( c_type * c_unique * c_type * c_unique * c_unique * c_unique ) > c_ssorted ).
tff(func_def_153,type,
sK95: ( c_unique * c_unique * $int * c_type * $int ) > c_type ).
tff(func_def_154,type,
sK96: ( c_unique * c_unique * $int * c_type * $int ) > c_unique ).
tff(func_def_155,type,
sK97: ( c_unique * c_unique * $int * c_type * $int ) > $int ).
tff(func_def_156,type,
sK98: ( c_unique * c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_157,type,
sK99: ( c_unique * c_unique * c_type * c_unique ) > c_type ).
tff(func_def_158,type,
sK100: ( c_unique * c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_159,type,
sK101: ( c_unique * c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_160,type,
sK102: ( c_type * c_unique * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_161,type,
sK103: ( c_type * c_unique * c_type * c_unique * c_unique ) > c_type ).
tff(func_def_162,type,
sK104: ( c_type * c_unique * c_unique ) > c_type ).
tff(func_def_163,type,
sK105: ( c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_164,type,
sK106: ( c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_165,type,
sK107: ( c_type * c_unique * c_unique * $int ) > c_type ).
tff(func_def_166,type,
sK108: ( $int * $int * c_unique * c_type * c_unique ) > c_type ).
tff(func_def_167,type,
sK109: ( c_unique * c_type * c_unique ) > c_type ).
tff(func_def_168,type,
sK110: ( c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_169,type,
sK111: ( c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_170,type,
sK112: ( c_type * c_unique * c_unique * c_unique * $int * $int ) > c_ssorted ).
tff(func_def_171,type,
sK113: ( c_unique * c_unique * c_type * c_unique * c_type * c_unique ) > c_type ).
tff(func_def_172,type,
sK114: ( c_unique * c_unique * c_type * c_unique * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_173,type,
sK115: ( c_unique * c_unique * c_type * c_unique * c_type * c_unique ) > c_unique ).
tff(func_def_174,type,
sK116: ( $int * c_unique * c_unique * c_type ) > c_type ).
tff(func_def_175,type,
sK117: ( $int * c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_176,type,
sK118: ( $int * c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_177,type,
sK119: ( c_unique * c_unique * c_type * c_unique * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_178,type,
sK120: ( c_unique * c_unique * c_type * c_unique * c_type * c_unique * c_unique ) > c_type ).
tff(func_def_179,type,
sK121: ( c_unique * c_unique * c_type * c_unique * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_180,type,
sK122: ( c_unique * c_unique * c_type * c_unique * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_181,type,
sK123: ( c_unique * c_unique * c_type * c_unique * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_182,type,
sK124: ( c_unique * c_unique * c_type * c_unique * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_183,type,
sK125: ( c_unique * c_unique * $int * c_type ) > c_ssorted ).
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 ) > $int ).
tff(func_def_186,type,
sK128: ( c_unique * c_unique * $int * c_type * $int ) > c_ssorted ).
tff(func_def_187,type,
sK129: ( c_unique * c_unique * $int * c_type * $int ) > c_ssorted ).
tff(func_def_188,type,
sK130: ( c_type * c_unique * c_unique * c_type * c_unique ) > c_type ).
tff(func_def_189,type,
sK131: ( c_type * c_unique * c_unique * c_type * c_unique * c_unique * $int ) > c_type ).
tff(func_def_190,type,
sK132: ( c_unique * c_type * c_unique * c_unique * c_type ) > c_type ).
tff(func_def_191,type,
sK133: ( c_unique * c_type * c_unique * c_unique * c_type ) > c_unique ).
tff(func_def_192,type,
sK134: ( c_unique * c_type * c_unique * c_unique * c_type ) > $int ).
tff(func_def_193,type,
sK135: ( c_unique * $int * c_unique * c_unique * c_type * c_type ) > c_type ).
tff(func_def_194,type,
sK136: ( c_unique * $int * c_unique * c_unique * c_type * c_type ) > c_unique ).
tff(func_def_195,type,
sK137: ( c_unique * $int * c_unique * c_unique * c_type * c_type ) > $int ).
tff(func_def_196,type,
sK138: ( c_unique * c_unique * c_type * c_unique ) > c_type ).
tff(func_def_197,type,
sK139: ( c_unique * c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_198,type,
sK140: ( c_unique * c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_199,type,
sK141: ( c_type * c_unique * c_unique * c_unique ) > c_type ).
tff(func_def_200,type,
sK142: ( c_type * c_unique * c_unique * c_unique ) > c_ssorted ).
tff(func_def_201,type,
sK143: ( c_type * c_unique * c_unique * c_unique ) > c_ssorted ).
tff(func_def_202,type,
sK144: ( c_unique * $int * c_type * c_unique ) > c_type ).
tff(func_def_203,type,
sK145: ( c_unique * $int * c_type * c_unique ) > c_unique ).
tff(func_def_204,type,
sK146: ( c_unique * $int * c_type * c_unique ) > $int ).
tff(func_def_205,type,
sK147: ( c_unique * c_unique * c_type * c_unique * c_unique * c_type ) > c_type ).
tff(func_def_206,type,
sK148: ( c_unique * c_unique * c_type * c_unique * c_unique * c_type ) > c_type ).
tff(func_def_207,type,
sK149: ( c_unique * c_unique * c_type * c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_208,type,
sK150: ( c_unique * c_unique * c_type * c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_209,type,
sK151: ( $int * c_type * c_unique * c_unique ) > c_type ).
tff(func_def_210,type,
sK152: ( c_type * c_unique * $int * $int ) > c_type ).
tff(func_def_211,type,
sK153: ( c_type * c_unique * $int * $int ) > c_ssorted ).
tff(func_def_212,type,
sK154: ( c_type * c_unique * c_unique * $int ) > c_ssorted ).
tff(func_def_213,type,
sK155: ( c_type * c_unique * c_unique * $int ) > c_type ).
tff(func_def_214,type,
sK156: ( c_type * c_unique * c_unique * $int ) > c_ssorted ).
tff(func_def_215,type,
sK157: ( $int * c_unique * c_type * c_unique * $int ) > c_ssorted ).
tff(func_def_216,type,
sK158: ( $int * c_unique * c_type * c_unique * $int ) > c_ssorted ).
tff(func_def_217,type,
sK159: ( $int * c_unique * c_type * c_unique * $int ) > $int ).
tff(func_def_218,type,
sK160: ( c_type * c_unique * c_unique * c_unique * c_type * $int ) > c_type ).
tff(func_def_219,type,
sK161: ( c_type * c_unique * c_unique * c_unique * c_type * $int * c_unique * $int ) > c_type ).
tff(func_def_220,type,
sK162: ( c_type * c_unique * $int * c_unique * $int ) > c_type ).
tff(func_def_221,type,
sK163: ( c_type * c_unique * $int * c_unique * $int ) > c_ssorted ).
tff(func_def_222,type,
sK164: ( c_type * c_unique * $int * c_unique * $int ) > c_ssorted ).
tff(func_def_223,type,
sK165: ( c_unique * c_unique * c_type * $int * c_unique ) > c_ssorted ).
tff(func_def_224,type,
sK166: ( c_unique * c_unique * c_type ) > c_ssorted ).
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 ) > $int ).
tff(func_def_227,type,
sK169: ( c_unique * c_type * c_unique ) > c_type ).
tff(func_def_228,type,
sK170: ( c_unique * c_type * c_unique * c_unique ) > c_type ).
tff(func_def_229,type,
sK171: ( c_unique * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_230,type,
sK172: ( $int * c_unique * c_type * c_unique * c_type ) > c_type ).
tff(func_def_231,type,
sK173: ( $int * c_unique * c_type * c_unique * c_type * $int * c_unique * c_unique ) > c_type ).
tff(func_def_232,type,
sK174: ( $int * c_unique * c_type * c_unique * c_type * $int * c_unique * c_unique ) > c_type ).
tff(func_def_233,type,
sK175: ( $int * c_unique * c_type * c_unique * c_type ) > $int ).
tff(func_def_234,type,
sK176: ( $int * c_unique * c_type * c_unique * c_type ) > c_unique ).
tff(func_def_235,type,
sK177: ( $int * c_unique * c_type * c_unique * c_type ) > c_unique ).
tff(func_def_236,type,
sK178: ( c_type * $int * c_unique * c_unique * $int ) > c_type ).
tff(func_def_237,type,
sK179: ( c_type * $int * c_unique * c_unique * $int ) > c_ssorted ).
tff(func_def_238,type,
sK180: ( c_type * $int * c_unique * c_unique * $int ) > c_ssorted ).
tff(func_def_239,type,
sK181: ( c_type * c_unique * c_unique ) > c_type ).
tff(func_def_240,type,
sK182: ( c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_241,type,
sK183: ( c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_242,type,
sK184: ( c_unique * c_unique * c_type ) > c_type ).
tff(func_def_243,type,
sK185: ( c_unique * $int * c_unique * c_unique * c_type * c_type ) > c_type ).
tff(func_def_244,type,
sK186: ( c_unique * $int * c_unique * c_unique * c_type * c_type ) > c_ssorted ).
tff(func_def_245,type,
sK187: ( c_unique * $int * c_unique * c_unique * c_type * c_type ) > c_ssorted ).
tff(func_def_246,type,
sK188: ( c_unique * $int * c_unique * c_unique * c_type * c_type ) > c_ssorted ).
tff(func_def_247,type,
sK189: ( $int * c_unique * $int * c_type * c_unique * c_unique * c_type ) > c_type ).
tff(func_def_248,type,
sK190: ( $int * c_unique * $int * c_type * c_unique * c_unique * c_type * c_unique * $int ) > c_type ).
tff(func_def_249,type,
sK191: ( c_unique * $int * $int * c_type * c_unique ) > c_type ).
tff(func_def_250,type,
sK192: ( c_unique * $int * $int * c_type * c_unique ) > c_ssorted ).
tff(func_def_251,type,
sK193: ( c_unique * $int * $int * c_type * c_unique ) > c_ssorted ).
tff(func_def_252,type,
sK194: ( c_unique * $int * c_type * c_type * c_unique * c_unique ) > c_type ).
tff(func_def_253,type,
sK195: ( c_unique * $int * c_type * c_type * c_unique * c_unique * c_unique * $int ) > c_type ).
tff(func_def_254,type,
sK196: ( c_unique * c_unique * c_unique ) > c_ssorted ).
tff(func_def_255,type,
sK197: ( c_unique * c_unique * c_unique ) > c_ssorted ).
tff(func_def_256,type,
sK198: ( c_unique * c_unique * c_unique ) > c_ssorted ).
tff(func_def_257,type,
sK199: ( c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_258,type,
sK200: ( c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_259,type,
sK201: ( c_unique * c_type * $int ) > c_type ).
tff(func_def_260,type,
sK202: ( c_unique * c_type * $int ) > c_ssorted ).
tff(func_def_261,type,
sK203: ( c_unique * c_type * c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_262,type,
sK204: ( c_unique * c_unique * c_type * c_unique ) > c_type ).
tff(func_def_263,type,
sK205: ( c_unique * c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_264,type,
sK206: ( c_unique * c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_265,type,
sK207: ( c_unique * c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_266,type,
sK208: ( c_unique * c_unique * c_type * c_unique * c_type * $int ) > c_type ).
tff(func_def_267,type,
sK209: ( c_unique * c_unique * c_type * c_unique * c_type * $int ) > c_unique ).
tff(func_def_268,type,
sK210: ( c_unique * c_unique * c_type * c_unique * c_type * $int ) > $int ).
tff(func_def_269,type,
sK211: ( c_unique * c_unique * c_type * $int ) > c_type ).
tff(func_def_270,type,
sK212: ( c_unique * c_unique * c_type * $int ) > c_unique ).
tff(func_def_271,type,
sK213: ( c_unique * c_unique * c_type * $int ) > $int ).
tff(func_def_272,type,
sK214: 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,X1: c_unique,X3: $int,X2: $int] :
( ( ( X0 = 10000 )
& ( X2 = 0 )
& valid_range(c_sort(type_alloc_table,X1),c_sort(type_pointer(type_global),X4),0,2800)
& ( X3 = 2800 ) )
=> ! [X5: $int,X6: c_unique] :
( ( ! [X7: $int] :
? [X8: c_type] :
( ( ( $lesseq(0,X7)
& $less(X7,X5) )
=> ( 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] :
( ( $lesseq(0,X9)
& $lesseq(X9,2800)
& ( '%'(X9,14) = 0 ) )
=> ! [X10: $int] :
( ( X10 = 0 )
=> ! [X11: $int] :
( ( X11 = $product(X9,2) )
=> ( ( X11 != 0 )
=> ! [X12: $int] :
( ( X12 = X9 )
=> ! [X13: $int,X16: c_unique,X15: $int,X14: $int] :
( ( $lesseq(X13,X9)
& ( X15 = $product(X13,2) )
& $lesseq(1,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] :
( ( 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) )
=> $less(X28,X13) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',formula_101) ).
tff(f113,plain,
~ ! [X4: c_unique,X0: $int,X1: c_unique,X3: $int,X2: $int] :
( ( ( X0 = 10000 )
& ( X2 = 0 )
& valid_range(c_sort(type_alloc_table,X1),c_sort(type_pointer(type_global),X4),0,2800)
& ( X3 = 2800 ) )
=> ! [X5: $int,X6: c_unique] :
( ( ! [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] :
( ( ( '%'(X9,14) = 0 )
& ~ $less(X9,0)
& ~ $less(2800,X9) )
=> ! [X10: $int] :
( ( X10 = 0 )
=> ! [X11: $int] :
( ( X11 = $product(X9,2) )
=> ( ( X11 != 0 )
=> ! [X12: $int] :
( ( X12 = X9 )
=> ! [X13: $int,X16: c_unique,X15: $int,X14: $int] :
( ( ~ $less(X9,X13)
& ( X15 = $product(X13,2) )
& ~ $less(X13,1) )
=> ( ( 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(X28,X13) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(theory_normalization,[],[f101]) ).
tff(f166,plain,
~ ! [X0: c_unique,X2: c_unique,X3: $int,X4: $int,X1: $int] :
( ( ( 0 = X4 )
& ( X3 = 2800 )
& valid_range(c_sort(type_alloc_table,X2),c_sort(type_pointer(type_global),X0),0,2800)
& ( 10000 = X1 ) )
=> ! [X6: c_unique,X5: $int] :
( ( ~ $less(X5,0)
& ! [X7: $int] :
? [X8: c_type] :
( ( X8 = type_pointer(type_global) )
& ( ( $less(X7,X5)
& ~ $less(X7,0) )
=> ( 2000 = ss2Int(c_sort(c_int,acc(c_sort(type_memory(c_int,type_global),X6),c_sort(X8,shift(c_sort(X8,X0),X7))))) ) ) )
& ~ $less(2800,X5) )
=> ( ( 0 = $sum(X5,$uminus(X3)) )
=> ! [X9: $int] :
( ( ( '%'(X9,14) = 0 )
& ~ $less(X9,0)
& ~ $less(2800,X9) )
=> ! [X10: $int] :
( ( X10 = 0 )
=> ! [X11: $int] :
( ( X11 = $product(X9,2) )
=> ( ( X11 != 0 )
=> ! [X12: $int] :
( ( X12 = X9 )
=> ! [X15: $int,X14: c_unique,X13: $int,X16: $int] :
( ( ~ $less(X9,X13)
& ( X15 = $product(X13,2) )
& ~ $less(X13,1) )
=> ( ( 1 != 0 )
=> ! [X17: c_unique] :
? [X18: c_type] :
( ( ( shift(c_sort(X18,X0),X13) = X17 )
=> ( valid(c_sort(type_alloc_table,X2),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(X16,$product(ss2Int(c_sort(c_int,X19)),X1)) = X20 )
=> ! [X21: c_unique] :
( ( shift(c_sort(X18,X0),X13) = X21 )
=> ! [X22: $int] :
( ( $sum(X15,$uminus(1)) = X22 )
=> ( ( X22 != 0 )
=> ! [X23: $int] :
( ( X23 = '%'(X20,X22) )
=> ( valid(c_sort(type_alloc_table,X2),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(X13,$uminus(1)) = X28 )
=> ( ( X28 != 0 )
=> ! [X29: $int] :
( ( X29 = $product(X27,X28) )
=> $less(X28,X13) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) )
& ( X18 = type_pointer(type_global) ) ) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f113]) ).
tff(f267,plain,
? [X0: c_unique,X2: c_unique,X3: $int,X4: $int,X1: $int] :
( ? [X6: c_unique,X5: $int] :
( ? [X9: $int] :
( ? [X10: $int] :
( ? [X11: $int] :
( ? [X12: $int] :
( ? [X15: $int,X14: c_unique,X13: $int,X16: $int] :
( ? [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] :
( ~ $less(X28,X13)
& ( X29 = $product(X27,X28) ) )
& ( X28 != 0 )
& ( $sum(X13,$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,X2),c_sort(X18,X21))
& ( X23 = '%'(X20,X22) ) )
& ( X22 != 0 )
& ( $sum(X15,$uminus(1)) = X22 ) )
& ( shift(c_sort(X18,X0),X13) = X21 ) )
& ( $sum(X16,$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,X2),c_sort(X18,X17))
& ( shift(c_sort(X18,X0),X13) = X17 ) )
| ( type_pointer(type_global) != X18 ) )
& ( 1 != 0 )
& ~ $less(X9,X13)
& ( X15 = $product(X13,2) )
& ~ $less(X13,1) )
& ( X12 = X9 ) )
& ( X11 != 0 )
& ( X11 = $product(X9,2) ) )
& ( X10 = 0 ) )
& ( '%'(X9,14) = 0 )
& ~ $less(X9,0)
& ~ $less(2800,X9) )
& ( 0 = $sum(X5,$uminus(X3)) )
& ~ $less(X5,0)
& ! [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),X6),c_sort(X8,shift(c_sort(X8,X0),X7))))) )
| ~ $less(X7,X5)
| $less(X7,0) ) )
& ~ $less(2800,X5) )
& ( 0 = X4 )
& ( X3 = 2800 )
& valid_range(c_sort(type_alloc_table,X2),c_sort(type_pointer(type_global),X0),0,2800)
& ( 10000 = X1 ) ),
inference(ennf_transformation,[],[f166]) ).
tff(f268,plain,
? [X0: c_unique,X2: c_unique,X4: $int,X3: $int,X1: $int] :
( valid_range(c_sort(type_alloc_table,X2),c_sort(type_pointer(type_global),X0),0,2800)
& ( 10000 = X1 )
& ( 0 = X4 )
& ? [X6: c_unique,X5: $int] :
( ( 0 = $sum(X5,$uminus(X3)) )
& ~ $less(X5,0)
& ~ $less(2800,X5)
& ! [X7: $int] :
? [X8: c_type] :
( ( $less(X7,0)
| ( 2000 = ss2Int(c_sort(c_int,acc(c_sort(type_memory(c_int,type_global),X6),c_sort(X8,shift(c_sort(X8,X0),X7))))) )
| ~ $less(X7,X5) )
& ( X8 = type_pointer(type_global) ) )
& ? [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: $int,X13: $int,X14: c_unique] :
( ? [X17: c_unique] :
! [X18: c_type] :
( ( type_pointer(type_global) != X18 )
| ( ? [X19: c_unique] :
( ? [X20: $int] :
( ( $sum(X16,$product(ss2Int(c_sort(c_int,X19)),X1)) = X20 )
& ? [X21: c_unique] :
( ( shift(c_sort(X18,X0),X13) = X21 )
& ? [X22: $int] :
( ( X22 != 0 )
& ( $sum(X15,$uminus(1)) = X22 )
& ? [X23: $int] :
( ( X23 = '%'(X20,X22) )
& valid(c_sort(type_alloc_table,X2),c_sort(X18,X21))
& ? [X24: c_unique] :
( ? [X25: $int] :
( ( X22 != 0 )
& ( $sum(X22,$uminus(1)) = X25 )
& ? [X26: $int] :
( ? [X27: $int] :
( ? [X28: $int] :
( ( X28 != 0 )
& ? [X29: $int] :
( ~ $less(X28,X13)
& ( X29 = $product(X27,X28) ) )
& ( $sum(X13,$uminus(1)) = X28 ) )
& ( X27 = X26 ) )
& ( X26 = whydivide(X20,X22) ) ) )
& ( upd(c_sort(type_memory(c_int,type_global),X14),c_sort(X18,X21),c_sort(c_int,int2U(X23))) = X24 ) ) ) ) ) )
& ( acc(c_sort(type_memory(c_int,type_global),X14),c_sort(X18,X17)) = X19 ) )
& valid(c_sort(type_alloc_table,X2),c_sort(X18,X17))
& ( shift(c_sort(X18,X0),X13) = X17 ) ) )
& ( 1 != 0 )
& ~ $less(X13,1)
& ( X15 = $product(X13,2) )
& ~ $less(X9,X13) ) ) ) ) ) )
& ( X3 = 2800 ) ),
inference(flattening,[],[f267]) ).
tff(f338,plain,
? [X0: c_unique,X1: c_unique,X2: $int,X3: $int,X4: $int] :
( valid_range(c_sort(type_alloc_table,X1),c_sort(type_pointer(type_global),X0),0,2800)
& ( 10000 = X4 )
& ( 0 = X2 )
& ? [X5: c_unique,X6: $int] :
( ( 0 = $sum(X6,$uminus(X3)) )
& ~ $less(X6,0)
& ~ $less(2800,X6)
& ! [X7: $int] :
? [X8: c_type] :
( ( $less(X7,0)
| ( 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) )
& ( X8 = type_pointer(type_global) ) )
& ? [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 )
& ? [X13: $int,X14: $int,X15: $int,X16: c_unique] :
( ? [X17: c_unique] :
! [X18: c_type] :
( ( type_pointer(type_global) != X18 )
| ( ? [X19: c_unique] :
( ? [X20: $int] :
( ( $sum(X14,$product(ss2Int(c_sort(c_int,X19)),X4)) = X20 )
& ? [X21: c_unique] :
( ( shift(c_sort(X18,X0),X15) = X21 )
& ? [X22: $int] :
( ( X22 != 0 )
& ( $sum(X13,$uminus(1)) = X22 )
& ? [X23: $int] :
( ( X23 = '%'(X20,X22) )
& valid(c_sort(type_alloc_table,X1),c_sort(X18,X21))
& ? [X24: c_unique] :
( ? [X25: $int] :
( ( X22 != 0 )
& ( $sum(X22,$uminus(1)) = X25 )
& ? [X26: $int] :
( ? [X27: $int] :
( ? [X28: $int] :
( ( X28 != 0 )
& ? [X29: $int] :
( ~ $less(X28,X15)
& ( X29 = $product(X27,X28) ) )
& ( $sum(X15,$uminus(1)) = X28 ) )
& ( X27 = X26 ) )
& ( X26 = whydivide(X20,X22) ) ) )
& ( upd(c_sort(type_memory(c_int,type_global),X16),c_sort(X18,X21),c_sort(c_int,int2U(X23))) = X24 ) ) ) ) ) )
& ( acc(c_sort(type_memory(c_int,type_global),X16),c_sort(X18,X17)) = X19 ) )
& valid(c_sort(type_alloc_table,X1),c_sort(X18,X17))
& ( shift(c_sort(X18,X0),X15) = X17 ) ) )
& ( 1 != 0 )
& ~ $less(X15,1)
& ( $product(X15,2) = X13 )
& ~ $less(X9,X15) ) ) ) ) ) )
& ( X3 = 2800 ) ),
inference(rectify,[],[f268]) ).
tff(f339,plain,
( valid_range(c_sort(type_alloc_table,sK53),c_sort(type_pointer(type_global),sK52),0,2800)
& ( 10000 = sK56 )
& ( 0 = sK54 )
& ( 0 = $sum(sK58,$uminus(sK55)) )
& ~ $less(sK58,0)
& ~ $less(2800,sK58)
& ! [X7: $int] :
( ( $less(X7,0)
| ( 2000 = ss2Int(c_sort(c_int,acc(c_sort(type_memory(c_int,type_global),sK57),c_sort(sK59(X7),shift(c_sort(sK59(X7),sK52),X7))))) )
| ~ $less(X7,sK58) )
& ( type_pointer(type_global) = sK59(X7) ) )
& ~ $less(2800,sK60)
& ~ $less(sK60,0)
& ( 0 = '%'(sK60,14) )
& ( 0 = sK61 )
& ( $product(sK60,2) = sK62 )
& ( 0 != sK62 )
& ( sK60 = sK63 )
& ! [X18: c_type] :
( ( type_pointer(type_global) != X18 )
| ( ( $sum(sK65,$product(ss2Int(c_sort(c_int,sK69(X18))),sK56)) = sK70(X18) )
& ( sK71(X18) = shift(c_sort(X18,sK52),sK66) )
& ( 0 != sK72(X18) )
& ( sK72(X18) = $sum(sK64,$uminus(1)) )
& ( '%'(sK70(X18),sK72(X18)) = sK73(X18) )
& valid(c_sort(type_alloc_table,sK53),c_sort(X18,sK71(X18)))
& ( 0 != sK72(X18) )
& ( sK75(X18) = $sum(sK72(X18),$uminus(1)) )
& ( 0 != sK78(X18) )
& ~ $less(sK78(X18),sK66)
& ( sK79(X18) = $product(sK77(X18),sK78(X18)) )
& ( $sum(sK66,$uminus(1)) = sK78(X18) )
& ( sK76(X18) = sK77(X18) )
& ( sK76(X18) = whydivide(sK70(X18),sK72(X18)) )
& ( sK74(X18) = upd(c_sort(type_memory(c_int,type_global),sK67),c_sort(X18,sK71(X18)),c_sort(c_int,int2U(sK73(X18)))) )
& ( sK69(X18) = acc(c_sort(type_memory(c_int,type_global),sK67),c_sort(X18,sK68)) )
& valid(c_sort(type_alloc_table,sK53),c_sort(X18,sK68))
& ( shift(c_sort(X18,sK52),sK66) = sK68 ) ) )
& ( 1 != 0 )
& ~ $less(sK66,1)
& ( sK64 = $product(sK66,2) )
& ~ $less(sK60,sK66)
& ( 2800 = sK55 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK52,sK53,sK54,sK55,sK56,sK57,sK58,sK59,sK60,sK61,sK62,sK63,sK64,sK65,sK66,sK67,sK68,sK69,sK70,sK71,sK72,sK73,sK74,sK75,sK76,sK77,sK78,sK79]),skolemize(X0,sK52),skolemize(X1,sK53),skolemize(X2,sK54),skolemize(X3,sK55),skolemize(X4,sK56),skolemize(X5,sK57),skolemize(X6,sK58),skolemize(X8,sK59(X7)),skolemize(X9,sK60),skolemize(X10,sK61),skolemize(X11,sK62),skolemize(X12,sK63),skolemize(X13,sK64),skolemize(X14,sK65),skolemize(X15,sK66),skolemize(X16,sK67),skolemize(X17,sK68),skolemize(X19,sK69(X18)),skolemize(X20,sK70(X18)),skolemize(X21,sK71(X18)),skolemize(X22,sK72(X18)),skolemize(X23,sK73(X18)),skolemize(X24,sK74(X18)),skolemize(X25,sK75(X18)),skolemize(X26,sK76(X18)),skolemize(X27,sK77(X18)),skolemize(X28,sK78(X18)),skolemize(X29,sK79(X18))],[f338]) ).
tff(f567,plain,
! [X18: c_type] :
( ( type_pointer(type_global) != X18 )
| ( $sum(sK66,$uminus(1)) = sK78(X18) ) ),
inference(cnf_transformation,[],[f339]) ).
tff(f569,plain,
! [X18: c_type] :
( ( type_pointer(type_global) != X18 )
| ~ $less(sK78(X18),sK66) ),
inference(cnf_transformation,[],[f339]) ).
tff(f1046,plain,
~ $less(sK78(type_pointer(type_global)),sK66),
inference(equality_resolution,[],[f569]) ).
tff(f1048,plain,
sK78(type_pointer(type_global)) = $sum(sK66,$uminus(1)),
inference(equality_resolution,[],[f567]) ).
tff(f1094,plain,
sK78(type_pointer(type_global)) = $sum(sK66,-1),
inference(evaluation,[],[f1048]) ).
tff(f1112,definition,
( spl215_4
<=> $less(sK78(type_pointer(type_global)),sK66) ),
introduced(definition,[new_symbols(definition,[spl215_4])],[avatar_definition]) ).
tff(f1115,plain,
~ spl215_4,
inference(avatar_split_clause,[],[f1046,f1112]) ).
tff(f1232,definition,
( spl215_28
<=> ( sK78(type_pointer(type_global)) = $sum(sK66,-1) ) ),
introduced(definition,[new_symbols(definition,[spl215_28])],[avatar_definition]) ).
tff(f1235,plain,
spl215_28,
inference(avatar_split_clause,[],[f1094,f1232]) ).
tff(f1256,plain,
$false,
inference(avatar_smt_refutation,[],[f1235,f1115]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW818_1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.18 % Computer : n013.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Mon Sep 28 14:30:13 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.21 Running first-order theorem proving
% 0.08/0.21 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.34/1.14 % (1225396)Detected arithmetic, will pick strategies from an ALASCA-aware ARI schedule.
% 3.34/1.14 % (1225404)lrs+1002_4:1_to=lpo:sil=64000:si=on:br=off:random_seed=2286596196:s2a=on:i=7:rtra=on:inst=on_2999 on theBenchmark for (2999ds/7Mi)
% 3.34/1.14 % (1225404)Instruction limit reached!
% 3.34/1.14 % (1225404)------------------------------
% 3.34/1.14 % (1225404)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.34/1.14 % (1225404)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.34/1.14 % (1225404)CaDiCaL version: 2.1.3
% 3.34/1.14 % (1225404)Termination reason: Instruction limit
% 3.34/1.14 % (1225404)Termination phase: Preprocessing 3
% 3.34/1.14 % (1225404)Time elapsed: 0.003 s
% 3.34/1.14 % (1225404)Peak memory usage: 86 MB
% 3.34/1.14 % (1225404)Instructions burned: 9 (million)
% 3.34/1.14 % (1225403)dis+10_3_slsqr=1,4:to=lpo:sil=128000:thi=strong:si=on:uwa=off:s2agt=20:slsqc=1:slsq=on:random_seed=2742774543:i=201:slsql=off:asg=cautious:rtra=on:gtg=all:ss=axioms:sgt=16_2999 on theBenchmark for (2999ds/201Mi)
% 3.34/1.14 % (1225405)dis+21_64_to=kbo:sil=128000:si=on:sp=weighted_frequency:uwa=alasca_can_abstract:random_seed=390564012:i=4:rtra=on_2999 on theBenchmark for (2999ds/4Mi)
% 3.34/1.15 % (1225407)lrs+10_1_tgt=ground:sas=z3:si=on:random_seed=1776520562:i=33:rtra=on_2999 on theBenchmark for (2999ds/33Mi)
% 3.34/1.15 % (1225401)dis+1002_16:1_to=lpo:sil=64000:sas=z3:si=on:norm_ineq=on:gve=force:uwa=one_side_constant:random_seed=1961783325:i=12:doe=on:rtra=on:gtg=exists_top:ss=axioms_2999 on theBenchmark for (2999ds/12Mi)
% 3.34/1.15 % (1225406)lrs+10_1_to=lpo:sas=z3:si=on:tha=off:random_seed=3842751370:i=46:rtra=on_2999 on theBenchmark for (2999ds/46Mi)
% 3.34/1.15 % (1225402)dis+1002_1_to=kbo:sil=128000:tgt=ground:sas=z3:si=on:spb=units:tha=off:random_seed=568573398:i=307:kws=precedence:nm=0:rtra=on_2999 on theBenchmark for (2999ds/307Mi)
% 3.34/1.15 % (1225405)Instruction limit reached!
% 3.34/1.15 % (1225405)------------------------------
% 3.34/1.15 % (1225405)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.34/1.15 % (1225405)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.34/1.15 % (1225405)CaDiCaL version: 2.1.3
% 3.34/1.15 % (1225405)Termination reason: Instruction limit
% 3.34/1.15 % (1225405)Termination phase: Preprocessing 1
% 3.34/1.15 % (1225405)Time elapsed: 0.003 s
% 3.34/1.15 % (1225405)Peak memory usage: 85 MB
% 3.34/1.15 % (1225405)Instructions burned: 5 (million)
% 3.34/1.15 % (1225401)Instruction limit reached!
% 3.34/1.15 % (1225401)------------------------------
% 3.34/1.15 % (1225401)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.34/1.15 % (1225401)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.34/1.15 % (1225401)CaDiCaL version: 2.1.3
% 3.34/1.15 % (1225401)Termination reason: Instruction limit
% 3.34/1.15 % (1225401)Termination phase: Property scanning
% 3.34/1.15 % (1225401)Time elapsed: 0.006 s
% 3.34/1.15 % (1225401)Peak memory usage: 86 MB
% 3.34/1.15 % (1225401)Instructions burned: 12 (million)
% 3.34/1.15 % (1225407)Instruction limit reached!
% 3.34/1.15 % (1225407)------------------------------
% 3.34/1.15 % (1225407)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.34/1.15 % (1225407)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.34/1.15 % (1225407)CaDiCaL version: 2.1.3
% 3.34/1.15 % (1225407)Termination reason: Instruction limit
% 3.34/1.15 % (1225407)Termination phase: Saturation
% 3.34/1.15 % (1225407)Time elapsed: 0.032 s
% 3.34/1.15 % (1225407)Peak memory usage: 101 MB
% 3.34/1.15 % (1225407)Instructions burned: 33 (million)
% 3.34/1.15 % (1225406)Instruction limit reached!
% 3.34/1.15 % (1225406)------------------------------
% 3.34/1.15 % (1225406)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.34/1.15 % (1225406)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.34/1.15 % (1225406)CaDiCaL version: 2.1.3
% 3.34/1.15 % (1225406)Termination reason: Instruction limit
% 3.34/1.15 % (1225406)Termination phase: Saturation
% 3.34/1.15 % (1225406)Time elapsed: 0.048 s
% 3.34/1.15 % (1225406)Peak memory usage: 115 MB
% 3.34/1.15 % (1225406)Instructions burned: 46 (million)
% 3.34/1.15 % (1225402)First to succeed.
% 3.34/1.15 % (1225402)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1225396"
% 3.34/1.15 % (1225409)dis+11_3_anc=none:drc=ordering:si=on:urr=ec_only:bce=on:tha=off:sac=on:random_seed=337772327:st=5:i=14:sd=10:rtra=on:ss=axioms:rawr=on_2998 on theBenchmark for (2998ds/14Mi)
% 3.34/1.15 % (1225409)Refutation not found, incomplete strategy
% 3.34/1.15 % (1225409)------------------------------
% 3.34/1.15 % (1225409)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.34/1.15 % (1225409)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.34/1.15 % (1225409)CaDiCaL version: 2.1.3
% 3.34/1.15 % (1225409)Termination reason: Refutation not found, incomplete strategy
% 3.34/1.15 % (1225409)Time elapsed: 0.002 s
% 3.34/1.15 % (1225409)Peak memory usage: 88 MB
% 3.34/1.15 % (1225409)Instructions burned: 4 (million)
% 3.34/1.15 % (1225416)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=1756933613:i=29:thsqd=64:nm=0:thsqc=8:rtra=on:thsq=on:ev=off_2998 on theBenchmark for (2998ds/29Mi)
% 3.34/1.15 % (1225417)ott+21_1024_to=lakbo:sil=128000:bsd=on:si=on:alasca=on:uwa=alasca_main:nwc=0.5:random_seed=3776666244:cond=on:i=16:fgj=on:ep=RS:asg=force:nm=10:rtra=on:rawr=on_2998 on theBenchmark for (2998ds/16Mi)
% 3.34/1.15 % (1225417)Instruction limit reached!
% 3.34/1.15 % (1225417)------------------------------
% 3.34/1.15 % (1225417)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.34/1.15 % (1225417)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.34/1.15 % (1225417)CaDiCaL version: 2.1.3
% 3.34/1.15 % (1225417)Termination reason: Instruction limit
% 3.34/1.15 % (1225417)Termination phase: Property scanning
% 3.34/1.15 % (1225417)Time elapsed: 0.011 s
% 3.34/1.15 % (1225417)Peak memory usage: 86 MB
% 3.34/1.15 % (1225417)Instructions burned: 19 (million)
% 3.34/1.15 % (1225416)Instruction limit reached!
% 3.34/1.15 % (1225416)------------------------------
% 3.34/1.15 % (1225416)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.34/1.15 % (1225416)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.34/1.15 % (1225416)CaDiCaL version: 2.1.3
% 3.34/1.15 % (1225416)Termination reason: Instruction limit
% 3.34/1.15 % (1225416)Termination phase: Saturation
% 3.34/1.15 % (1225416)Time elapsed: 0.015 s
% 3.34/1.15 % (1225416)Peak memory usage: 88 MB
% 3.34/1.15 % (1225416)Instructions burned: 29 (million)
% 3.34/1.15 % (1225403)Instruction limit reached!
% 3.34/1.15 % (1225403)------------------------------
% 3.34/1.15 % (1225403)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.34/1.15 % (1225403)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.34/1.15 % (1225403)CaDiCaL version: 2.1.3
% 3.34/1.15 % (1225403)Termination reason: Instruction limit
% 3.34/1.15 % (1225403)Termination phase: Saturation
% 3.34/1.15 % (1225403)Time elapsed: 0.171 s
% 3.34/1.15 % (1225403)Peak memory usage: 118 MB
% 3.34/1.15 % (1225403)Instructions burned: 203 (million)
% 3.34/1.15 % (1225418)dis+1011_1_prc=on:drc=off:si=on:sac=on:random_seed=2809809802:i=24:canc=force:rtra=on_2997 on theBenchmark for (2997ds/24Mi)
% 3.34/1.15 % (1225418)Instruction limit reached!
% 3.34/1.15 % (1225418)------------------------------
% 3.34/1.15 % (1225418)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.34/1.15 % (1225418)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.34/1.15 % (1225418)CaDiCaL version: 2.1.3
% 3.34/1.15 % (1225418)Termination reason: Instruction limit
% 3.34/1.15 % (1225418)Termination phase: Equality resolution with deletion
% 3.34/1.15 % (1225418)Time elapsed: 0.014 s
% 3.34/1.15 % (1225418)Peak memory usage: 87 MB
% 3.34/1.15 % (1225418)Instructions burned: 24 (million)
% 3.34/1.15 % (1225419)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=3515477573:i=27:canc=cautious:fsr=off:rtra=on_2997 on theBenchmark for (2997ds/27Mi)
% 3.34/1.15 % (1225409)------------------------------
% 3.34/1.15 % (1225409)------------------------------
% 3.34/1.15 % (1225419)Instruction limit reached!
% 3.34/1.15 % (1225419)------------------------------
% 3.34/1.15 % (1225419)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.34/1.15 % (1225419)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.34/1.15 % (1225419)CaDiCaL version: 2.1.3
% 3.34/1.15 % (1225419)Termination reason: Instruction limit
% 3.34/1.15 % (1225419)Termination phase: Property scanning
% 3.34/1.15 % (1225419)Time elapsed: 0.016 s
% 3.34/1.15 % (1225419)Peak memory usage: 87 MB
% 3.34/1.15 % (1225419)Instructions burned: 29 (million)
% 3.34/1.15 % (1225423)dis+1002_24_to=kbo:sil=128000:si=on:random_seed=1743007364:i=85:gtgl=4:rtra=on:gtg=exists_sym_2996 on theBenchmark for (2996ds/85Mi)
% 3.34/1.15 % (1225402)Refutation found. Thanks to Tanya!
% 3.34/1.15 % SZS status Unsatisfiable for theBenchmark
% 3.34/1.15 % SZS output start Proof for theBenchmark
% See solution above
% 4.09/1.34 % (1225402)------------------------------
% 4.09/1.34 % (1225402)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.09/1.34 % (1225402)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.09/1.34 % (1225402)CaDiCaL version: 2.1.3
% 4.09/1.34 % (1225402)Termination reason: Refutation
% 4.09/1.34 % (1225402)Time elapsed: 0.056 s
% 4.09/1.34 % (1225402)Peak memory usage: 117 MB
% 4.09/1.34 % (1225402)Instructions burned: 53 (million)
% 4.09/1.34 % (1225402)------------------------------
% 4.09/1.34 % (1225402)------------------------------
% 4.09/1.34 % (1225396)Success in time 0.496 s
% 4.09/1.34 % Vampire exiting
%------------------------------------------------------------------------------