%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWW811_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 : n026.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:51 PM UTC 2026
% Result : Unsatisfiable 3.01s 1.13s
% Output : Refutation 3.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 14 unt; 0 typ; 5 def)
% Number of atoms : 319 ( 231 equ)
% Maximal formula atoms : 41 ( 10 avg)
% Number of connectives : 384 ( 95 ~; 16 |; 184 &)
% ( 5 <=>; 84 =>; 0 <=; 0 <~>)
% Maximal formula depth : 67 ( 14 avg)
% Maximal term depth : 8 ( 2 avg)
% Number arithmetic : 507 ( 56 atm; 117 fun; 213 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 : 30 ( 26 usr; 6 prp; 0-4 aty)
% Number of functors : 273 ( 261 usr; 33 con; 0-9 aty)
% Number of variables : 186 ( 96 !; 90 ?; 186 :)
% 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_ssorted ).
tff(func_def_60,type,
sK2: ( c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_61,type,
sK3: ( c_unique * $int * c_type ) > c_type ).
tff(func_def_62,type,
sK4: ( c_unique * $int * c_type ) > c_ssorted ).
tff(func_def_63,type,
sK5: ( c_type * c_unique * $int * c_unique ) > c_type ).
tff(func_def_64,type,
sK6: ( c_unique * c_type * c_unique * c_unique * c_type * c_unique ) > c_type ).
tff(func_def_65,type,
sK7: ( c_unique * c_type * c_unique * c_unique * c_type * c_unique ) > c_unique ).
tff(func_def_66,type,
sK8: ( c_unique * c_type * c_unique * c_unique * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_67,type,
sK9: ( c_unique * c_unique * $int * c_type * $int * $int ) > c_ssorted ).
tff(func_def_68,type,
sK10: ( c_unique * c_unique * $int * c_type * $int * $int ) > c_ssorted ).
tff(func_def_69,type,
sK11: ( c_unique * c_type * c_unique * c_type * c_unique ) > c_type ).
tff(func_def_70,type,
sK12: ( c_unique * c_type * c_unique * c_type * c_unique * c_unique * $int ) > c_type ).
tff(func_def_71,type,
sK13: ( c_unique * $int * c_unique * c_type * $int ) > c_type ).
tff(func_def_72,type,
sK14: ( c_type * c_unique * c_unique * c_unique * $int * c_type ) > c_type ).
tff(func_def_73,type,
sK15: ( c_type * c_unique * c_unique * c_unique * $int * c_type ) > c_unique ).
tff(func_def_74,type,
sK16: ( c_type * c_unique * c_unique * c_unique * $int * c_type ) > $int ).
tff(func_def_75,type,
sK17: ( c_type * c_unique * $int ) > c_type ).
tff(func_def_76,type,
sK18: ( c_type * c_unique * $int ) > c_ssorted ).
tff(func_def_77,type,
sK19: ( $int * c_unique * c_unique * $int * c_type ) > c_type ).
tff(func_def_78,type,
sK20: ( $int * c_unique * c_unique * $int * c_type ) > c_unique ).
tff(func_def_79,type,
sK21: ( $int * c_unique * c_unique * $int * c_type ) > $int ).
tff(func_def_80,type,
sK22: ( c_type * c_unique * c_unique ) > c_type ).
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_ssorted ).
tff(func_def_83,type,
sK25: ( $int * c_unique * c_unique * c_type ) > c_type ).
tff(func_def_84,type,
sK26: ( $int * c_unique * c_unique * c_type ) > c_unique ).
tff(func_def_85,type,
sK27: ( $int * c_unique * c_unique * c_type ) > $int ).
tff(func_def_86,type,
sK28: ( c_unique * c_unique * $int * c_type ) > c_type ).
tff(func_def_87,type,
sK29: ( c_unique * c_unique * $int * c_type ) > c_ssorted ).
tff(func_def_88,type,
sK30: ( c_unique * c_unique * $int * c_type ) > c_ssorted ).
tff(func_def_89,type,
sK31: ( c_unique * c_type * c_unique * $int ) > c_type ).
tff(func_def_90,type,
sK32: ( c_unique * c_type * c_unique * $int ) > c_unique ).
tff(func_def_91,type,
sK33: ( c_unique * c_type * c_unique * $int ) > $int ).
tff(func_def_92,type,
sK34: ( c_unique * c_unique * c_type * c_type * c_unique ) > c_type ).
tff(func_def_93,type,
sK35: ( c_unique * c_unique * c_type * c_type * c_unique ) > c_unique ).
tff(func_def_94,type,
sK36: ( c_unique * c_unique * c_type * c_type * c_unique ) > $int ).
tff(func_def_95,type,
sK37: ( $int * $int * c_unique * c_unique * c_type * $int ) > c_ssorted ).
tff(func_def_96,type,
sK38: ( $int * $int * c_unique * c_unique * c_type * $int ) > c_type ).
tff(func_def_97,type,
sK39: ( $int * $int * c_unique * c_unique * c_type * $int ) > c_ssorted ).
tff(func_def_98,type,
sK40: ( c_unique * $int * $int * c_type * c_unique * c_unique * c_type ) > c_type ).
tff(func_def_99,type,
sK41: ( c_unique * $int * $int * c_type * c_unique * c_unique * c_type * c_unique * $int ) > c_type ).
tff(func_def_100,type,
sK42: ( c_unique * c_type * $int * c_unique * $int * c_type * c_unique ) > c_type ).
tff(func_def_101,type,
sK43: ( c_unique * c_type * $int * c_unique * $int * c_type * c_unique ) > c_unique ).
tff(func_def_102,type,
sK44: ( c_unique * c_type * $int * c_unique * $int * c_type * c_unique ) > $int ).
tff(func_def_103,type,
sK45: ( c_type * c_unique * $int * c_unique ) > c_ssorted ).
tff(func_def_104,type,
sK46: ( c_type * c_unique * $int * c_unique ) > c_ssorted ).
tff(func_def_105,type,
sK47: ( c_type * c_unique * $int * c_unique ) > $int ).
tff(func_def_106,type,
sK48: ( c_unique * c_type * c_unique ) > c_type ).
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 ) > c_unique ).
tff(func_def_109,type,
sK51: ( c_type * $int * c_unique * c_type ) > $int ).
tff(func_def_110,type,
sK52: ( c_type * $int * c_unique * c_type ) > $int ).
tff(func_def_111,type,
sK53: ( c_type * $int * c_unique * c_type * c_unique * $int * $int ) > c_type ).
tff(func_def_112,type,
sK54: ( c_type * $int * c_unique * c_type * c_unique * $int * $int ) > c_type ).
tff(func_def_113,type,
sK55: ( c_type * $int * c_unique * c_type * c_unique * $int * $int ) > c_ssorted ).
tff(func_def_114,type,
sK56: ( c_type * $int * c_unique * c_type * c_unique * $int * $int ) > c_ssorted ).
tff(func_def_115,type,
sK57: ( c_unique * $int * c_type * c_unique ) > c_ssorted ).
tff(func_def_116,type,
sK58: ( c_unique * $int * c_type * c_unique ) > c_type ).
tff(func_def_117,type,
sK59: ( c_unique * $int * c_type * c_unique ) > c_ssorted ).
tff(func_def_118,type,
sK60: ( c_unique * c_type * c_unique * c_unique ) > c_type ).
tff(func_def_119,type,
sK61: ( c_unique * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_120,type,
sK62: ( c_unique * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_121,type,
sK63: ( c_unique * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_122,type,
sK64: ( c_unique * c_type * c_unique ) > c_type ).
tff(func_def_123,type,
sK65: ( c_unique * c_type * c_unique * c_unique ) > c_type ).
tff(func_def_124,type,
sK66: ( c_unique * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_125,type,
sK67: ( c_unique * c_unique * c_type * c_unique * c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_126,type,
sK68: ( c_unique * c_unique * c_type * c_unique * c_unique * c_type * c_unique ) > c_type ).
tff(func_def_127,type,
sK69: ( c_unique * c_unique * c_type * c_unique * c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_128,type,
sK70: ( c_unique * c_unique * c_type * c_unique * c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_129,type,
sK71: ( c_unique * c_unique * c_type * c_unique * c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_130,type,
sK72: ( c_unique * c_unique * c_type * c_unique * c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_131,type,
sK73: ( c_unique * c_type * c_unique ) > c_type ).
tff(func_def_132,type,
sK74: ( c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_133,type,
sK75: ( c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_134,type,
sK76: ( c_type * c_unique * c_unique ) > c_type ).
tff(func_def_135,type,
sK77: ( c_unique * $int * c_type * $int ) > c_type ).
tff(func_def_136,type,
sK78: ( c_unique * $int * c_type * $int ) > c_ssorted ).
tff(func_def_137,type,
sK79: ( c_unique * c_unique * c_type ) > c_type ).
tff(func_def_138,type,
sK80: ( c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_139,type,
sK81: ( c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_140,type,
sK82: ( c_unique * c_unique * c_type * c_unique * c_type ) > c_ssorted ).
tff(func_def_141,type,
sK83: ( c_unique * c_type * c_unique ) > c_type ).
tff(func_def_142,type,
sK84: ( c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_143,type,
sK85: ( c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_144,type,
sK86: ( $int * c_type * c_unique * c_unique * c_type * c_unique ) > c_type ).
tff(func_def_145,type,
sK87: ( $int * c_type * c_unique * c_unique * c_type * c_unique ) > c_unique ).
tff(func_def_146,type,
sK88: ( $int * c_type * c_unique * c_unique * c_type * c_unique ) > $int ).
tff(func_def_147,type,
sK89: ( c_unique * c_type * c_type * c_unique * c_unique ) > c_type ).
tff(func_def_148,type,
sK90: ( c_unique * c_type * c_type * c_unique * c_unique ) > c_unique ).
tff(func_def_149,type,
sK91: ( c_unique * c_type * c_unique ) > c_type ).
tff(func_def_150,type,
sK92: ( c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_151,type,
sK93: ( c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_152,type,
sK94: ( c_unique * c_unique * c_type ) > c_type ).
tff(func_def_153,type,
sK95: ( c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_154,type,
sK96: ( c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_155,type,
sK97: ( c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_156,type,
sK98: ( c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_157,type,
sK99: ( c_type * c_unique * c_unique * c_unique * c_type * c_unique ) > c_type ).
tff(func_def_158,type,
sK100: ( c_type * c_unique * c_unique * c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_159,type,
sK101: ( c_type * c_unique * c_unique * c_unique * c_type * c_unique ) > c_type ).
tff(func_def_160,type,
sK102: ( c_type * c_unique * c_unique * c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_161,type,
sK103: ( c_unique * c_unique * c_type * c_type * c_unique ) > c_ssorted ).
tff(func_def_162,type,
sK104: ( c_unique * c_unique * c_type * c_type * c_unique ) > c_type ).
tff(func_def_163,type,
sK105: ( c_unique * c_type * c_unique ) > c_type ).
tff(func_def_164,type,
sK106: ( c_unique * c_type * c_unique ) > c_unique ).
tff(func_def_165,type,
sK107: ( $int * c_type * c_type * c_unique * c_unique * c_unique ) > c_ssorted ).
tff(func_def_166,type,
sK108: ( $int * c_type * c_type * c_unique * c_unique * c_unique ) > c_ssorted ).
tff(func_def_167,type,
sK109: ( $int * c_type * c_type * c_unique * c_unique * c_unique ) > c_type ).
tff(func_def_168,type,
sK110: ( $int * c_type * c_type * c_unique ) > c_unique ).
tff(func_def_169,type,
sK111: ( $int * c_type * c_type * c_unique ) > c_unique ).
tff(func_def_170,type,
sK112: ( c_type * c_unique * c_type ) > c_unique ).
tff(func_def_171,type,
sK113: ( c_type * c_unique * c_type ) > c_unique ).
tff(func_def_172,type,
sK114: ( c_type * c_unique * c_type * c_unique * c_unique ) > c_type ).
tff(func_def_173,type,
sK115: ( c_type * c_unique * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_174,type,
sK116: ( c_type * c_unique * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_175,type,
sK117: ( c_unique * c_unique * $int * c_type * $int ) > c_ssorted ).
tff(func_def_176,type,
sK118: ( c_unique * c_unique * $int * c_type * $int ) > c_ssorted ).
tff(func_def_177,type,
sK119: $int ).
tff(func_def_178,type,
sK120: c_unique ).
tff(func_def_179,type,
sK121: c_unique ).
tff(func_def_180,type,
sK122: $int ).
tff(func_def_181,type,
sK123: $int ).
tff(func_def_182,type,
sK124: $int ).
tff(func_def_183,type,
sK125: c_unique ).
tff(func_def_184,type,
sK126: $int ).
tff(func_def_185,type,
sK127: $int ).
tff(func_def_186,type,
sK128: $int ).
tff(func_def_187,type,
sK129: $int ).
tff(func_def_188,type,
sK130: $int ).
tff(func_def_189,type,
sK131: c_unique ).
tff(func_def_190,type,
sK132: $int ).
tff(func_def_191,type,
sK133: $int ).
tff(func_def_192,type,
sK134: c_unique ).
tff(func_def_193,type,
sK135: c_type > c_unique ).
tff(func_def_194,type,
sK136: c_type > $int ).
tff(func_def_195,type,
sK137: c_type > c_unique ).
tff(func_def_196,type,
sK138: c_type > $int ).
tff(func_def_197,type,
sK139: c_type > $int ).
tff(func_def_198,type,
sK140: c_type > c_unique ).
tff(func_def_199,type,
sK141: c_type > $int ).
tff(func_def_200,type,
sK142: c_type > $int ).
tff(func_def_201,type,
sK143: c_type > $int ).
tff(func_def_202,type,
sK144: c_type > $int ).
tff(func_def_203,type,
sK145: c_type > $int ).
tff(func_def_204,type,
sK146: $int > c_type ).
tff(func_def_205,type,
sK147: ( c_unique * $int * c_type * c_unique ) > c_type ).
tff(func_def_206,type,
sK148: ( c_type * c_unique * c_unique * c_unique ) > c_ssorted ).
tff(func_def_207,type,
sK149: ( c_type * c_unique * c_unique * c_unique ) > c_type ).
tff(func_def_208,type,
sK150: ( c_type * c_unique * c_unique * c_unique ) > c_ssorted ).
tff(func_def_209,type,
sK151: ( c_type * c_unique * c_unique * c_unique ) > c_ssorted ).
tff(func_def_210,type,
sK152: ( c_unique * c_unique * c_type * $int * c_unique ) > c_ssorted ).
tff(func_def_211,type,
sK153: ( c_unique * $int * c_type * c_unique * c_type * c_unique ) > c_type ).
tff(func_def_212,type,
sK154: ( c_unique * $int * c_type * c_unique * c_type * c_unique * c_unique * $int ) > c_type ).
tff(func_def_213,type,
sK155: ( c_unique * c_type * c_unique * $int * c_type ) > c_type ).
tff(func_def_214,type,
sK156: ( c_unique * c_type * c_unique * $int * c_type * $int * c_unique * c_unique ) > c_type ).
tff(func_def_215,type,
sK157: ( c_unique * c_type * c_unique * $int * c_type * $int * c_unique * c_unique ) > c_type ).
tff(func_def_216,type,
sK158: ( c_unique * c_type * c_unique * $int * c_type ) > $int ).
tff(func_def_217,type,
sK159: ( c_unique * c_type * c_unique * $int * c_type ) > c_unique ).
tff(func_def_218,type,
sK160: ( c_unique * c_type * c_unique * $int * c_type ) > c_unique ).
tff(func_def_219,type,
sK161: ( c_unique * c_unique * c_unique * c_type ) > c_type ).
tff(func_def_220,type,
sK162: ( c_unique * c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_221,type,
sK163: ( c_unique * c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_222,type,
sK164: ( c_unique * c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_223,type,
sK165: ( c_unique * c_unique * c_type * c_unique ) > c_type ).
tff(func_def_224,type,
sK166: ( c_unique * c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_225,type,
sK167: c_unique > c_ssorted ).
tff(func_def_226,type,
sK168: ( c_unique * c_unique * c_unique ) > c_ssorted ).
tff(func_def_227,type,
sK169: ( c_unique * c_unique * c_unique ) > c_ssorted ).
tff(func_def_228,type,
sK170: ( c_unique * c_unique * c_unique ) > c_ssorted ).
tff(func_def_229,type,
sK171: ( c_type * c_unique * c_type * c_unique ) > c_type ).
tff(func_def_230,type,
sK172: ( c_type * c_unique * c_type * c_unique * c_unique * c_unique ) > c_type ).
tff(func_def_231,type,
sK173: ( c_type * c_unique * c_type * c_unique * c_unique * c_unique ) > c_type ).
tff(func_def_232,type,
sK174: ( c_type * c_unique * c_type * c_unique ) > c_unique ).
tff(func_def_233,type,
sK175: ( c_type * c_unique * c_type * c_unique ) > c_unique ).
tff(func_def_234,type,
sK176: ( c_type * c_unique * c_unique * c_unique ) > c_ssorted ).
tff(func_def_235,type,
sK177: ( c_unique * c_type * c_unique * $int * c_unique * $int ) > c_ssorted ).
tff(func_def_236,type,
sK178: ( c_type * c_unique * c_unique * c_type ) > c_type ).
tff(func_def_237,type,
sK179: ( c_type * c_unique * c_unique * c_type ) > c_unique ).
tff(func_def_238,type,
sK180: ( c_type * c_unique * c_unique * c_type ) > c_unique ).
tff(func_def_239,type,
sK181: ( c_type * c_unique * c_unique * c_type * c_unique * c_unique ) > c_type ).
tff(func_def_240,type,
sK182: ( c_type * c_unique * c_unique * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_241,type,
sK183: ( $int * c_unique * $int * c_type * c_unique ) > c_type ).
tff(func_def_242,type,
sK184: ( $int * c_unique * $int * c_type * c_unique ) > c_ssorted ).
tff(func_def_243,type,
sK185: ( $int * c_unique * $int * c_type * c_unique ) > c_ssorted ).
tff(func_def_244,type,
sK186: ( c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_245,type,
sK187: ( c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_246,type,
sK188: ( c_type * c_unique * c_unique ) > $int ).
tff(func_def_247,type,
sK189: $int > $int ).
tff(func_def_248,type,
sK190: ( c_unique * c_unique * c_unique * $int * c_type * c_type ) > c_type ).
tff(func_def_249,type,
sK191: ( c_unique * c_unique * c_unique * $int * c_type * c_type * c_unique * $int ) > c_type ).
tff(func_def_250,type,
sK192: ( c_type * c_unique * $int * $int * c_unique ) > c_ssorted ).
tff(func_def_251,type,
sK193: ( c_type * c_unique * $int * $int * c_unique ) > c_ssorted ).
tff(func_def_252,type,
sK194: ( c_type * c_unique * $int * $int * c_unique ) > $int ).
tff(func_def_253,type,
sK195: ( $int * c_unique * $int * c_type * c_unique ) > c_type ).
tff(func_def_254,type,
sK196: ( $int * c_unique * $int * c_type * c_unique ) > c_ssorted ).
tff(func_def_255,type,
sK197: ( $int * c_unique * $int * c_type * c_unique ) > c_ssorted ).
tff(func_def_256,type,
sK198: ( c_unique * $int * c_type * $int * c_unique ) > c_type ).
tff(func_def_257,type,
sK199: ( c_unique * $int * c_type * $int * c_unique ) > c_ssorted ).
tff(func_def_258,type,
sK200: ( c_unique * $int * c_type * $int * c_unique ) > c_ssorted ).
tff(func_def_259,type,
sK201: ( c_type * c_type * c_unique * c_unique * c_unique * $int ) > c_type ).
tff(func_def_260,type,
sK202: ( c_type * c_type * c_unique * c_unique * c_unique * $int ) > c_ssorted ).
tff(func_def_261,type,
sK203: ( c_type * c_type * c_unique * c_unique * c_unique * $int ) > c_ssorted ).
tff(func_def_262,type,
sK204: ( c_type * c_type * c_unique * c_unique * c_unique * $int ) > c_ssorted ).
tff(func_def_263,type,
sK205: ( c_type * c_type * $int * c_unique * c_unique ) > c_type ).
tff(func_def_264,type,
sK206: ( c_type * c_type * $int * c_unique * c_unique ) > c_unique ).
tff(func_def_265,type,
sK207: ( c_type * c_type * $int * c_unique * c_unique ) > c_unique ).
tff(func_def_266,type,
sK208: ( c_type * c_type * $int * c_unique * c_unique ) > $int ).
tff(func_def_267,type,
sK209: ( c_type * c_type * $int * c_unique * c_unique * c_unique * $int ) > c_type ).
tff(func_def_268,type,
sK210: ( c_type * c_type * $int * c_unique * c_unique * c_unique * $int ) > c_type ).
tff(func_def_269,type,
sK211: ( c_type * c_type * $int * c_unique * c_unique * c_unique * $int ) > c_ssorted ).
tff(func_def_270,type,
sK212: ( c_type * c_unique ) > c_ssorted ).
tff(func_def_271,type,
sK213: ( c_unique * c_unique * c_type * c_type * c_unique ) > c_type ).
tff(func_def_272,type,
sK214: ( c_unique * c_unique * c_type * c_type * 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,
~ ! [X3: $int,X0: $int,X4: c_unique,X2: $int,X1: c_unique] :
( ( ( X3 = 2800 )
& ( X2 = 0 )
& valid_range(c_sort(type_alloc_table,X1),c_sort(type_pointer(type_global),X4),0,2800)
& ( X0 = 10000 ) )
=> ! [X5: $int,X6: c_unique] :
( ( $lesseq(X5,2800)
& ! [X7: $int] :
? [X8: c_type] :
( ( X8 = type_pointer(type_global) )
& ( ( $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 ) ) )
& $lesseq(0,X5) )
=> ( ( $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 )
=> ! [X13: $int,X15: $int,X16: c_unique,X14: $int] :
( ( $lesseq(1,X13)
& $lesseq(X13,X9)
& ( X15 = $product(X13,2) ) )
=> ( ( 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) )
=> ( X25 = $product(X28,2) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',formula_101) ).
tff(f125,plain,
~ ! [X3: $int,X0: $int,X4: c_unique,X2: $int,X1: c_unique] :
( ( ( X3 = 2800 )
& ( X2 = 0 )
& valid_range(c_sort(type_alloc_table,X1),c_sort(type_pointer(type_global),X4),0,2800)
& ( X0 = 10000 ) )
=> ! [X5: $int,X6: c_unique] :
( ( ~ $less(2800,X5)
& ! [X7: $int] :
? [X8: c_type] :
( ( X8 = type_pointer(type_global) )
& ( ( $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 ) ) )
& ~ $less(X5,0) )
=> ( ( 0 = $sum(X5,$uminus(X3)) )
=> ! [X9: $int] :
( ( ( '%'(X9,14) = 0 )
& ~ $less(2800,X9)
& ~ $less(X9,0) )
=> ! [X10: $int] :
( ( X10 = 0 )
=> ! [X11: $int] :
( ( X11 = $product(X9,2) )
=> ( ( X11 != 0 )
=> ! [X12: $int] :
( ( X12 = X9 )
=> ! [X13: $int,X15: $int,X16: c_unique,X14: $int] :
( ( ~ $less(X13,1)
& ~ $less(X9,X13)
& ( X15 = $product(X13,2) ) )
=> ( ( 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) )
=> ( X25 = $product(X28,2) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(theory_normalization,[],[f101]) ).
tff(f190,plain,
~ ! [X4: c_unique,X1: $int,X2: c_unique,X3: $int,X0: $int] :
( ( ( 10000 = X1 )
& ( 0 = X3 )
& ( 2800 = X0 )
& valid_range(c_sort(type_alloc_table,X4),c_sort(type_pointer(type_global),X2),0,2800) )
=> ! [X5: $int,X6: c_unique] :
( ( ~ $less(2800,X5)
& ! [X7: $int] :
? [X8: c_type] :
( ( ( $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,X2),X7))))) ) )
& ( X8 = type_pointer(type_global) ) )
& ~ $less(X5,0) )
=> ( ( 0 = $sum(X5,$uminus(X0)) )
=> ! [X9: $int] :
( ( ( '%'(X9,14) = 0 )
& ~ $less(2800,X9)
& ~ $less(X9,0) )
=> ! [X10: $int] :
( ( X10 = 0 )
=> ! [X11: $int] :
( ( X11 = $product(X9,2) )
=> ( ( X11 != 0 )
=> ! [X12: $int] :
( ( X12 = X9 )
=> ! [X13: $int,X16: $int,X15: c_unique,X14: $int] :
( ( ( $product(X13,2) = X14 )
& ~ $less(X9,X13)
& ~ $less(X13,1) )
=> ( ( 1 != 0 )
=> ! [X17: c_unique] :
? [X18: c_type] :
( ( X18 = type_pointer(type_global) )
& ( ( shift(c_sort(X18,X2),X13) = X17 )
=> ( valid(c_sort(type_alloc_table,X4),c_sort(X18,X17))
=> ! [X19: c_unique] :
( ( acc(c_sort(type_memory(c_int,type_global),X15),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,X2),X13) = X21 )
=> ! [X22: $int] :
( ( $sum(X14,$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),X15),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) )
=> ( X25 = $product(X28,2) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f125]) ).
tff(f275,plain,
? [X4: c_unique,X1: $int,X2: c_unique,X3: $int,X0: $int] :
( ? [X5: $int,X6: c_unique] :
( ? [X9: $int] :
( ? [X10: $int] :
( ? [X11: $int] :
( ? [X12: $int] :
( ? [X13: $int,X16: $int,X15: c_unique,X14: $int] :
( ? [X17: c_unique] :
! [X18: c_type] :
( ( type_pointer(type_global) != X18 )
| ( ? [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] :
( ( $product(X28,2) != X25 )
& ( 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),X15),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(X14,$uminus(1)) = X22 ) )
& ( shift(c_sort(X18,X2),X13) = X21 ) )
& ( $sum(X16,$product(ss2Int(c_sort(c_int,X19)),X1)) = X20 ) )
& ( acc(c_sort(type_memory(c_int,type_global),X15),c_sort(X18,X17)) = X19 ) )
& valid(c_sort(type_alloc_table,X4),c_sort(X18,X17))
& ( shift(c_sort(X18,X2),X13) = X17 ) ) )
& ( 1 != 0 )
& ( $product(X13,2) = X14 )
& ~ $less(X9,X13)
& ~ $less(X13,1) )
& ( X12 = X9 ) )
& ( X11 != 0 )
& ( X11 = $product(X9,2) ) )
& ( X10 = 0 ) )
& ( '%'(X9,14) = 0 )
& ~ $less(2800,X9)
& ~ $less(X9,0) )
& ( 0 = $sum(X5,$uminus(X0)) )
& ~ $less(2800,X5)
& ! [X7: $int] :
? [X8: c_type] :
( ( ( 2000 = ss2Int(c_sort(c_int,acc(c_sort(type_memory(c_int,type_global),X6),c_sort(X8,shift(c_sort(X8,X2),X7))))) )
| ~ $less(X7,X5)
| $less(X7,0) )
& ( X8 = type_pointer(type_global) ) )
& ~ $less(X5,0) )
& ( 10000 = X1 )
& ( 0 = X3 )
& ( 2800 = X0 )
& valid_range(c_sort(type_alloc_table,X4),c_sort(type_pointer(type_global),X2),0,2800) ),
inference(ennf_transformation,[],[f190]) ).
tff(f276,plain,
? [X0: $int,X4: c_unique,X2: c_unique,X1: $int,X3: $int] :
( ( 0 = X3 )
& valid_range(c_sort(type_alloc_table,X4),c_sort(type_pointer(type_global),X2),0,2800)
& ( 2800 = X0 )
& ( 10000 = X1 )
& ? [X5: $int,X6: c_unique] :
( ? [X9: $int] :
( ( '%'(X9,14) = 0 )
& ? [X10: $int] :
( ( X10 = 0 )
& ? [X11: $int] :
( ( X11 != 0 )
& ( X11 = $product(X9,2) )
& ? [X12: $int] :
( ? [X16: $int,X15: c_unique,X13: $int,X14: $int] :
( ( 1 != 0 )
& ~ $less(X9,X13)
& ( $product(X13,2) = X14 )
& ? [X17: c_unique] :
! [X18: c_type] :
( ( valid(c_sort(type_alloc_table,X4),c_sort(X18,X17))
& ? [X19: c_unique] :
( ? [X20: $int] :
( ( $sum(X16,$product(ss2Int(c_sort(c_int,X19)),X1)) = X20 )
& ? [X21: c_unique] :
( ( shift(c_sort(X18,X2),X13) = X21 )
& ? [X22: $int] :
( ? [X23: $int] :
( valid(c_sort(type_alloc_table,X4),c_sort(X18,X21))
& ? [X24: c_unique] :
( ( upd(c_sort(type_memory(c_int,type_global),X15),c_sort(X18,X21),c_sort(c_int,int2U(X23))) = X24 )
& ? [X25: $int] :
( ( $sum(X22,$uminus(1)) = X25 )
& ( X22 != 0 )
& ? [X26: $int] :
( ? [X27: $int] :
( ( X27 = X26 )
& ? [X28: $int] :
( ? [X29: $int] :
( ( $product(X28,2) != X25 )
& ( X29 = $product(X27,X28) ) )
& ( X28 != 0 )
& ( $sum(X13,$uminus(1)) = X28 ) ) )
& ( X26 = whydivide(X20,X22) ) ) ) )
& ( X23 = '%'(X20,X22) ) )
& ( X22 != 0 )
& ( $sum(X14,$uminus(1)) = X22 ) ) ) )
& ( acc(c_sort(type_memory(c_int,type_global),X15),c_sort(X18,X17)) = X19 ) )
& ( shift(c_sort(X18,X2),X13) = X17 ) )
| ( type_pointer(type_global) != X18 ) )
& ~ $less(X13,1) )
& ( X12 = X9 ) ) ) )
& ~ $less(X9,0)
& ~ $less(2800,X9) )
& ~ $less(X5,0)
& ! [X7: $int] :
? [X8: c_type] :
( ( ~ $less(X7,X5)
| ( 2000 = ss2Int(c_sort(c_int,acc(c_sort(type_memory(c_int,type_global),X6),c_sort(X8,shift(c_sort(X8,X2),X7))))) )
| $less(X7,0) )
& ( X8 = type_pointer(type_global) ) )
& ( 0 = $sum(X5,$uminus(X0)) )
& ~ $less(2800,X5) ) ),
inference(flattening,[],[f275]) ).
tff(f405,plain,
? [X0: $int,X1: c_unique,X2: c_unique,X3: $int,X4: $int] :
( ( 0 = X4 )
& valid_range(c_sort(type_alloc_table,X1),c_sort(type_pointer(type_global),X2),0,2800)
& ( 2800 = X0 )
& ( 10000 = X3 )
& ? [X5: $int,X6: c_unique] :
( ? [X7: $int] :
( ( 0 = '%'(X7,14) )
& ? [X8: $int] :
( ( 0 = X8 )
& ? [X9: $int] :
( ( 0 != X9 )
& ( $product(X7,2) = X9 )
& ? [X10: $int] :
( ? [X11: $int,X12: c_unique,X13: $int,X14: $int] :
( ( 1 != 0 )
& ~ $less(X7,X13)
& ( $product(X13,2) = X14 )
& ? [X15: c_unique] :
! [X16: c_type] :
( ( valid(c_sort(type_alloc_table,X1),c_sort(X16,X15))
& ? [X17: c_unique] :
( ? [X18: $int] :
( ( $sum(X11,$product(ss2Int(c_sort(c_int,X17)),X3)) = X18 )
& ? [X19: c_unique] :
( ( shift(c_sort(X16,X2),X13) = X19 )
& ? [X20: $int] :
( ? [X21: $int] :
( valid(c_sort(type_alloc_table,X1),c_sort(X16,X19))
& ? [X22: c_unique] :
( ( upd(c_sort(type_memory(c_int,type_global),X12),c_sort(X16,X19),c_sort(c_int,int2U(X21))) = X22 )
& ? [X23: $int] :
( ( $sum(X20,$uminus(1)) = X23 )
& ( 0 != X20 )
& ? [X24: $int] :
( ? [X25: $int] :
( ( X24 = X25 )
& ? [X26: $int] :
( ? [X27: $int] :
( ( $product(X26,2) != X23 )
& ( $product(X25,X26) = X27 ) )
& ( 0 != X26 )
& ( $sum(X13,$uminus(1)) = X26 ) ) )
& ( whydivide(X18,X20) = X24 ) ) ) )
& ( '%'(X18,X20) = X21 ) )
& ( 0 != X20 )
& ( $sum(X14,$uminus(1)) = X20 ) ) ) )
& ( acc(c_sort(type_memory(c_int,type_global),X12),c_sort(X16,X15)) = X17 ) )
& ( shift(c_sort(X16,X2),X13) = X15 ) )
| ( type_pointer(type_global) != X16 ) )
& ~ $less(X13,1) )
& ( X7 = X10 ) ) ) )
& ~ $less(X7,0)
& ~ $less(2800,X7) )
& ~ $less(X5,0)
& ! [X28: $int] :
? [X29: c_type] :
( ( ~ $less(X28,X5)
| ( 2000 = ss2Int(c_sort(c_int,acc(c_sort(type_memory(c_int,type_global),X6),c_sort(X29,shift(c_sort(X29,X2),X28))))) )
| $less(X28,0) )
& ( type_pointer(type_global) = X29 ) )
& ( 0 = $sum(X5,$uminus(X0)) )
& ~ $less(2800,X5) ) ),
inference(rectify,[],[f276]) ).
tff(f406,plain,
( ( 0 = sK123 )
& valid_range(c_sort(type_alloc_table,sK120),c_sort(type_pointer(type_global),sK121),0,2800)
& ( 2800 = sK119 )
& ( 10000 = sK122 )
& ( 0 = '%'(sK126,14) )
& ( 0 = sK127 )
& ( 0 != sK128 )
& ( sK128 = $product(sK126,2) )
& ( 1 != 0 )
& ~ $less(sK126,sK132)
& ( sK133 = $product(sK132,2) )
& ! [X16: c_type] :
( ( valid(c_sort(type_alloc_table,sK120),c_sort(X16,sK134))
& ( $sum(sK130,$product(ss2Int(c_sort(c_int,sK135(X16))),sK122)) = sK136(X16) )
& ( shift(c_sort(X16,sK121),sK132) = sK137(X16) )
& valid(c_sort(type_alloc_table,sK120),c_sort(X16,sK137(X16)))
& ( sK140(X16) = upd(c_sort(type_memory(c_int,type_global),sK131),c_sort(X16,sK137(X16)),c_sort(c_int,int2U(sK139(X16)))) )
& ( sK141(X16) = $sum(sK138(X16),$uminus(1)) )
& ( 0 != sK138(X16) )
& ( sK143(X16) = sK142(X16) )
& ( $product(sK144(X16),2) != sK141(X16) )
& ( sK145(X16) = $product(sK143(X16),sK144(X16)) )
& ( 0 != sK144(X16) )
& ( sK144(X16) = $sum(sK132,$uminus(1)) )
& ( whydivide(sK136(X16),sK138(X16)) = sK142(X16) )
& ( '%'(sK136(X16),sK138(X16)) = sK139(X16) )
& ( 0 != sK138(X16) )
& ( sK138(X16) = $sum(sK133,$uminus(1)) )
& ( acc(c_sort(type_memory(c_int,type_global),sK131),c_sort(X16,sK134)) = sK135(X16) )
& ( sK134 = shift(c_sort(X16,sK121),sK132) ) )
| ( type_pointer(type_global) != X16 ) )
& ~ $less(sK132,1)
& ( sK129 = sK126 )
& ~ $less(sK126,0)
& ~ $less(2800,sK126)
& ~ $less(sK124,0)
& ! [X28: $int] :
( ( ~ $less(X28,sK124)
| ( 2000 = ss2Int(c_sort(c_int,acc(c_sort(type_memory(c_int,type_global),sK125),c_sort(sK146(X28),shift(c_sort(sK146(X28),sK121),X28))))) )
| $less(X28,0) )
& ( type_pointer(type_global) = sK146(X28) ) )
& ( 0 = $sum(sK124,$uminus(sK119)) )
& ~ $less(2800,sK124) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK119,sK120,sK121,sK122,sK123,sK124,sK125,sK126,sK127,sK128,sK129,sK130,sK131,sK132,sK133,sK134,sK135,sK136,sK137,sK138,sK139,sK140,sK141,sK142,sK143,sK144,sK145,sK146]),skolemize(X0,sK119),skolemize(X1,sK120),skolemize(X2,sK121),skolemize(X3,sK122),skolemize(X4,sK123),skolemize(X5,sK124),skolemize(X6,sK125),skolemize(X7,sK126),skolemize(X8,sK127),skolemize(X9,sK128),skolemize(X10,sK129),skolemize(X11,sK130),skolemize(X12,sK131),skolemize(X13,sK132),skolemize(X14,sK133),skolemize(X15,sK134),skolemize(X17,sK135(X16)),skolemize(X18,sK136(X16)),skolemize(X19,sK137(X16)),skolemize(X20,sK138(X16)),skolemize(X21,sK139(X16)),skolemize(X22,sK140(X16)),skolemize(X23,sK141(X16)),skolemize(X24,sK142(X16)),skolemize(X25,sK143(X16)),skolemize(X26,sK144(X16)),skolemize(X27,sK145(X16)),skolemize(X29,sK146(X28))],[f405]) ).
tff(f680,plain,
! [X16: c_type] :
( ( sK138(X16) = $sum(sK133,$uminus(1)) )
| ( type_pointer(type_global) != X16 ) ),
inference(cnf_transformation,[],[f406]) ).
tff(f684,plain,
! [X16: c_type] :
( ( sK144(X16) = $sum(sK132,$uminus(1)) )
| ( type_pointer(type_global) != X16 ) ),
inference(cnf_transformation,[],[f406]) ).
tff(f687,plain,
! [X16: c_type] :
( ( $product(sK144(X16),2) != sK141(X16) )
| ( type_pointer(type_global) != X16 ) ),
inference(cnf_transformation,[],[f406]) ).
tff(f690,plain,
! [X16: c_type] :
( ( sK141(X16) = $sum(sK138(X16),$uminus(1)) )
| ( type_pointer(type_global) != X16 ) ),
inference(cnf_transformation,[],[f406]) ).
tff(f696,plain,
sK133 = $product(sK132,2),
inference(cnf_transformation,[],[f406]) ).
tff(f1051,plain,
$sum(sK138(type_pointer(type_global)),$uminus(1)) = sK141(type_pointer(type_global)),
inference(equality_resolution,[],[f690]) ).
tff(f1054,plain,
$product(sK144(type_pointer(type_global)),2) != sK141(type_pointer(type_global)),
inference(equality_resolution,[],[f687]) ).
tff(f1057,plain,
sK144(type_pointer(type_global)) = $sum(sK132,$uminus(1)),
inference(equality_resolution,[],[f684]) ).
tff(f1061,plain,
sK138(type_pointer(type_global)) = $sum(sK133,$uminus(1)),
inference(equality_resolution,[],[f680]) ).
tff(f1089,plain,
sK144(type_pointer(type_global)) = $sum(sK132,-1),
inference(evaluation,[],[f1057]) ).
tff(f1092,plain,
$sum(sK133,-1) = sK138(type_pointer(type_global)),
inference(evaluation,[],[f1061]) ).
tff(f1094,plain,
$sum(sK138(type_pointer(type_global)),-1) = sK141(type_pointer(type_global)),
inference(evaluation,[],[f1051]) ).
tff(f1102,definition,
( spl215_2
<=> ( $product(sK144(type_pointer(type_global)),2) = sK141(type_pointer(type_global)) ) ),
introduced(definition,[new_symbols(definition,[spl215_2])],[avatar_definition]) ).
tff(f1105,plain,
~ spl215_2,
inference(avatar_split_clause,[],[f1054,f1102]) ).
tff(f1107,definition,
( spl215_3
<=> ( sK144(type_pointer(type_global)) = $sum(sK132,-1) ) ),
introduced(definition,[new_symbols(definition,[spl215_3])],[avatar_definition]) ).
tff(f1110,plain,
spl215_3,
inference(avatar_split_clause,[],[f1089,f1107]) ).
tff(f1167,definition,
( spl215_15
<=> ( $sum(sK133,-1) = sK138(type_pointer(type_global)) ) ),
introduced(definition,[new_symbols(definition,[spl215_15])],[avatar_definition]) ).
tff(f1170,plain,
spl215_15,
inference(avatar_split_clause,[],[f1092,f1167]) ).
tff(f1192,definition,
( spl215_20
<=> ( $sum(sK138(type_pointer(type_global)),-1) = sK141(type_pointer(type_global)) ) ),
introduced(definition,[new_symbols(definition,[spl215_20])],[avatar_definition]) ).
tff(f1195,plain,
spl215_20,
inference(avatar_split_clause,[],[f1094,f1192]) ).
tff(f1202,definition,
( spl215_22
<=> ( sK133 = $product(sK132,2) ) ),
introduced(definition,[new_symbols(definition,[spl215_22])],[avatar_definition]) ).
tff(f1205,plain,
spl215_22,
inference(avatar_split_clause,[],[f696,f1202]) ).
tff(f1256,plain,
$false,
inference(avatar_smt_refutation,[],[f1205,f1195,f1170,f1110,f1105]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWW811_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.08/0.18 % Computer : n026.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:33:34 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running first-order theorem proving
% 0.08/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
% 3.01/1.13 % (3892640)Detected arithmetic, will pick strategies from an ALASCA-aware ARI schedule.
% 3.01/1.13 % (3892690)lrs+10_1_tgt=ground:sas=z3:si=on:random_seed=652279072:i=33:rtra=on_2999 on theBenchmark for (2999ds/33Mi)
% 3.01/1.13 % (3892690)Instruction limit reached!
% 3.01/1.13 % (3892690)------------------------------
% 3.01/1.13 % (3892690)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.01/1.13 % (3892690)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.01/1.13 % (3892690)CaDiCaL version: 2.1.3
% 3.01/1.13 % (3892690)Termination reason: Instruction limit
% 3.01/1.13 % (3892690)Termination phase: Saturation
% 3.01/1.13 % (3892690)Time elapsed: 0.019 s
% 3.01/1.13 % (3892690)Peak memory usage: 102 MB
% 3.01/1.13 % (3892690)Instructions burned: 33 (million)
% 3.01/1.13 % (3892687)lrs+1002_4:1_to=lpo:sil=64000:si=on:br=off:random_seed=274948977:s2a=on:i=7:rtra=on:inst=on_2999 on theBenchmark for (2999ds/7Mi)
% 3.01/1.13 % (3892685)dis+1002_1_to=kbo:sil=128000:tgt=ground:sas=z3:si=on:spb=units:tha=off:random_seed=2072471610:i=307:kws=precedence:nm=0:rtra=on_2999 on theBenchmark for (2999ds/307Mi)
% 3.01/1.13 % (3892684)dis+1002_16:1_to=lpo:sil=64000:sas=z3:si=on:norm_ineq=on:gve=force:uwa=one_side_constant:random_seed=3425202923:i=12:doe=on:rtra=on:gtg=exists_top:ss=axioms_2999 on theBenchmark for (2999ds/12Mi)
% 3.01/1.13 % (3892686)dis+10_3_slsqr=1,4:to=lpo:sil=128000:thi=strong:si=on:uwa=off:s2agt=20:slsqc=1:slsq=on:random_seed=2545598761:i=201:slsql=off:asg=cautious:rtra=on:gtg=all:ss=axioms:sgt=16_2999 on theBenchmark for (2999ds/201Mi)
% 3.01/1.13 % (3892688)dis+21_64_to=kbo:sil=128000:si=on:sp=weighted_frequency:uwa=alasca_can_abstract:random_seed=1901011078:i=4:rtra=on_2999 on theBenchmark for (2999ds/4Mi)
% 3.01/1.13 % (3892687)Instruction limit reached!
% 3.01/1.13 % (3892687)------------------------------
% 3.01/1.13 % (3892687)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.01/1.13 % (3892687)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.01/1.13 % (3892687)CaDiCaL version: 2.1.3
% 3.01/1.13 % (3892687)Termination reason: Instruction limit
% 3.01/1.13 % (3892687)Termination phase: Preprocessing 1
% 3.01/1.13 % (3892687)Time elapsed: 0.004 s
% 3.01/1.13 % (3892687)Peak memory usage: 86 MB
% 3.01/1.13 % (3892687)Instructions burned: 7 (million)
% 3.01/1.13 % (3892688)Instruction limit reached!
% 3.01/1.13 % (3892688)------------------------------
% 3.01/1.13 % (3892688)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.01/1.13 % (3892688)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.01/1.13 % (3892688)CaDiCaL version: 2.1.3
% 3.01/1.13 % (3892688)Termination reason: Instruction limit
% 3.01/1.13 % (3892688)Termination phase: Preprocessing 1
% 3.01/1.13 % (3892688)Time elapsed: 0.003 s
% 3.01/1.13 % (3892688)Peak memory usage: 86 MB
% 3.01/1.13 % (3892688)Instructions burned: 5 (million)
% 3.01/1.13 % (3892684)Instruction limit reached!
% 3.01/1.13 % (3892684)------------------------------
% 3.01/1.13 % (3892684)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.01/1.13 % (3892684)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.01/1.13 % (3892684)CaDiCaL version: 2.1.3
% 3.01/1.13 % (3892684)Termination reason: Instruction limit
% 3.01/1.13 % (3892684)Termination phase: Saturation
% 3.01/1.13 % (3892684)Time elapsed: 0.007 s
% 3.01/1.13 % (3892684)Peak memory usage: 87 MB
% 3.01/1.13 % (3892684)Instructions burned: 13 (million)
% 3.01/1.13 % (3892689)lrs+10_1_to=lpo:sas=z3:si=on:tha=off:random_seed=1118330206:i=46:rtra=on_2999 on theBenchmark for (2999ds/46Mi)
% 3.01/1.13 % (3892685)First to succeed.
% 3.01/1.13 % (3892685)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3892640"
% 3.01/1.13 % (3892689)Instruction limit reached!
% 3.01/1.13 % (3892689)------------------------------
% 3.01/1.13 % (3892689)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.01/1.13 % (3892689)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.01/1.13 % (3892689)CaDiCaL version: 2.1.3
% 3.01/1.13 % (3892689)Termination reason: Instruction limit
% 3.01/1.13 % (3892689)Termination phase: Saturation
% 3.01/1.13 % (3892689)Time elapsed: 0.048 s
% 3.01/1.13 % (3892689)Peak memory usage: 115 MB
% 3.01/1.13 % (3892689)Instructions burned: 46 (million)
% 3.01/1.13 % (3892693)dis+11_3_anc=none:drc=ordering:si=on:urr=ec_only:bce=on:tha=off:sac=on:random_seed=2487462891:st=5:i=14:sd=10:rtra=on:ss=axioms:rawr=on_2998 on theBenchmark for (2998ds/14Mi)
% 3.01/1.13 % (3892693)Refutation not found, incomplete strategy
% 3.01/1.13 % (3892693)------------------------------
% 3.01/1.13 % (3892693)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.01/1.13 % (3892693)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.01/1.13 % (3892693)CaDiCaL version: 2.1.3
% 3.01/1.13 % (3892693)Termination reason: Refutation not found, incomplete strategy
% 3.01/1.13 % (3892693)Time elapsed: 0.002 s
% 3.01/1.13 % (3892693)Peak memory usage: 88 MB
% 3.01/1.13 % (3892693)Instructions burned: 4 (million)
% 3.01/1.13 % (3892698)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=4237517485:i=29:thsqd=64:nm=0:thsqc=8:rtra=on:thsq=on:ev=off_2998 on theBenchmark for (2998ds/29Mi)
% 3.01/1.13 % (3892699)ott+21_1024_to=lakbo:sil=128000:bsd=on:si=on:alasca=on:uwa=alasca_main:nwc=0.5:random_seed=3400529938:cond=on:i=16:fgj=on:ep=RS:asg=force:nm=10:rtra=on:rawr=on_2998 on theBenchmark for (2998ds/16Mi)
% 3.01/1.13 % (3892699)Instruction limit reached!
% 3.01/1.13 % (3892699)------------------------------
% 3.01/1.13 % (3892699)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.01/1.13 % (3892699)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.01/1.13 % (3892699)CaDiCaL version: 2.1.3
% 3.01/1.13 % (3892699)Termination reason: Instruction limit
% 3.01/1.13 % (3892699)Termination phase: Property scanning
% 3.01/1.13 % (3892699)Time elapsed: 0.010 s
% 3.01/1.13 % (3892699)Peak memory usage: 87 MB
% 3.01/1.13 % (3892699)Instructions burned: 16 (million)
% 3.01/1.13 % (3892698)Instruction limit reached!
% 3.01/1.13 % (3892698)------------------------------
% 3.01/1.13 % (3892698)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.01/1.13 % (3892698)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.01/1.13 % (3892698)CaDiCaL version: 2.1.3
% 3.01/1.13 % (3892698)Termination reason: Instruction limit
% 3.01/1.13 % (3892698)Termination phase: Saturation
% 3.01/1.13 % (3892698)Time elapsed: 0.016 s
% 3.01/1.13 % (3892698)Peak memory usage: 88 MB
% 3.01/1.13 % (3892698)Instructions burned: 31 (million)
% 3.01/1.13 % (3892700)dis+1011_1_prc=on:drc=off:si=on:sac=on:random_seed=1327604405:i=24:canc=force:rtra=on_2998 on theBenchmark for (2998ds/24Mi)
% 3.01/1.13 % (3892686)Instruction limit reached!
% 3.01/1.13 % (3892686)------------------------------
% 3.01/1.13 % (3892686)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.01/1.13 % (3892686)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.01/1.13 % (3892686)CaDiCaL version: 2.1.3
% 3.01/1.13 % (3892686)Termination reason: Instruction limit
% 3.01/1.13 % (3892686)Termination phase: Saturation
% 3.01/1.13 % (3892686)Time elapsed: 0.162 s
% 3.01/1.13 % (3892686)Peak memory usage: 118 MB
% 3.01/1.13 % (3892686)Instructions burned: 201 (million)
% 3.01/1.13 % (3892700)Instruction limit reached!
% 3.01/1.13 % (3892700)------------------------------
% 3.01/1.13 % (3892700)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.01/1.13 % (3892700)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.01/1.13 % (3892700)CaDiCaL version: 2.1.3
% 3.01/1.13 % (3892700)Termination reason: Instruction limit
% 3.01/1.13 % (3892700)Termination phase: Property scanning
% 3.01/1.13 % (3892700)Time elapsed: 0.014 s
% 3.01/1.13 % (3892700)Peak memory usage: 87 MB
% 3.01/1.13 % (3892700)Instructions burned: 25 (million)
% 3.01/1.13 % (3892702)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=2682451520:i=27:canc=cautious:fsr=off:rtra=on_2997 on theBenchmark for (2997ds/27Mi)
% 3.01/1.13 % (3892702)Instruction limit reached!
% 3.01/1.13 % (3892702)------------------------------
% 3.01/1.13 % (3892702)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.01/1.13 % (3892702)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.01/1.13 % (3892702)CaDiCaL version: 2.1.3
% 3.01/1.13 % (3892702)Termination reason: Instruction limit
% 3.01/1.13 % (3892702)Termination phase: Property scanning
% 3.01/1.13 % (3892702)Time elapsed: 0.016 s
% 3.01/1.13 % (3892702)Peak memory usage: 88 MB
% 3.01/1.13 % (3892702)Instructions burned: 27 (million)
% 3.01/1.13 % (3892693)------------------------------
% 3.01/1.13 % (3892693)------------------------------
% 3.01/1.13 % (3892708)ott+1002_1_si=on:sp=occurrence:spb=goal:lcm=predicate:random_seed=453471955:i=2:bd=preordered:nm=2:ins=3:rtra=on:inst=on:tar=off_2996 on theBenchmark for (2996ds/2Mi)
% 3.01/1.13 % (3892708)Instruction limit reached!
% 3.01/1.13 % (3892708)------------------------------
% 3.01/1.13 % (3892708)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.01/1.13 % (3892708)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.01/1.13 % (3892708)CaDiCaL version: 2.1.3
% 3.01/1.13 % (3892708)Termination reason: Instruction limit
% 3.01/1.13 % (3892708)Termination phase: Property scanning
% 3.01/1.13 % (3892708)Time elapsed: 0.002 s
% 3.01/1.13 % (3892708)Peak memory usage: 85 MB
% 3.01/1.13 % (3892708)Instructions burned: 3 (million)
% 3.01/1.13 % (3892706)dis+1002_24_to=kbo:sil=128000:si=on:random_seed=3118503119:i=85:gtgl=4:rtra=on:gtg=exists_sym_2997 on theBenchmark for (2997ds/85Mi)
% 3.01/1.13 % (3892709)dis+1010_1_to=kbo:sil=128000:tgt=full:si=on:tha=off:random_seed=1046107070:i=181:rtra=on:ss=axioms:ev=cautious_2996 on theBenchmark for (2996ds/181Mi)
% 3.01/1.13 % (3892709)Refutation not found, incomplete strategy
% 3.01/1.13 % (3892709)------------------------------
% 3.01/1.13 % (3892709)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.01/1.13 % (3892709)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.01/1.13 % (3892709)CaDiCaL version: 2.1.3
% 3.01/1.13 % (3892709)Termination reason: Refutation not found, incomplete strategy
% 3.01/1.13 % (3892709)Time elapsed: 0.003 s
% 3.01/1.13 % (3892709)Peak memory usage: 88 MB
% 3.01/1.13 % (3892709)Instructions burned: 3 (million)
% 3.01/1.13 % (3892710)lrs+10_2_to=lpo:sil=64000:si=on:sos=on:gve=force:lcm=reverse:uwa=one_side_interpreted:random_seed=107827843:i=4:ep=RST:ins=2:rtra=on_2996 on theBenchmark for (2996ds/4Mi)
% 3.01/1.13 % (3892710)Instruction limit reached!
% 3.01/1.13 % (3892710)------------------------------
% 3.01/1.13 % (3892710)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.01/1.13 % (3892710)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.01/1.13 % (3892710)CaDiCaL version: 2.1.3
% 3.01/1.13 % (3892710)Termination reason: Instruction limit
% 3.01/1.13 % (3892710)Termination phase: Preprocessing 1
% 3.01/1.13 % (3892710)Time elapsed: 0.003 s
% 3.01/1.13 % (3892710)Peak memory usage: 86 MB
% 3.01/1.13 % (3892710)Instructions burned: 5 (million)
% 3.01/1.13 % (3892685)Refutation found. Thanks to Tanya!
% 3.01/1.13 % SZS status Unsatisfiable for theBenchmark
% 3.01/1.13 % SZS output start Proof for theBenchmark
% See solution above
% 3.93/1.31 % (3892685)------------------------------
% 3.93/1.31 % (3892685)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.93/1.31 % (3892685)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.93/1.31 % (3892685)CaDiCaL version: 2.1.3
% 3.93/1.31 % (3892685)Termination reason: Refutation
% 3.93/1.31 % (3892685)Time elapsed: 0.058 s
% 3.93/1.31 % (3892685)Peak memory usage: 118 MB
% 3.93/1.31 % (3892685)Instructions burned: 56 (million)
% 3.93/1.31 % (3892685)------------------------------
% 3.93/1.31 % (3892685)------------------------------
% 3.93/1.31 % (3892640)Success in time 0.472 s
% 3.93/1.31 % Vampire exiting
%------------------------------------------------------------------------------