%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWW810_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 : n006.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 01:37:51 PM UTC 2026
% Result : Unsatisfiable 3.28s 1.18s
% Output : Refutation 4.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 10 unt; 0 typ; 4 def)
% Number of atoms : 232 ( 151 equ)
% Maximal formula atoms : 30 ( 10 avg)
% Number of connectives : 279 ( 70 ~; 14 |; 140 &)
% ( 4 <=>; 51 =>; 0 <=; 0 <~>)
% Maximal formula depth : 48 ( 13 avg)
% Maximal term depth : 8 ( 2 avg)
% Number arithmetic : 377 ( 58 atm; 62 fun; 172 num; 85 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 : 29 ( 25 usr; 5 prp; 0-4 aty)
% Number of functors : 266 ( 254 usr; 34 con; 0-9 aty)
% Number of variables : 142 ( 73 !; 69 ?; 142 :)
% 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_unique * c_type * c_unique * $int ) > c_type ).
tff(func_def_59,type,
sK1: ( c_unique * c_type * c_unique * $int ) > c_unique ).
tff(func_def_60,type,
sK2: ( c_unique * c_type * c_unique * $int ) > $int ).
tff(func_def_61,type,
sK3: ( c_type * c_unique * c_unique * c_unique ) > c_type ).
tff(func_def_62,type,
sK4: ( c_type * c_unique * c_unique * c_unique ) > c_ssorted ).
tff(func_def_63,type,
sK5: ( c_type * c_unique * c_unique * c_unique ) > c_ssorted ).
tff(func_def_64,type,
sK6: ( c_type * c_unique * c_unique * c_unique ) > c_ssorted ).
tff(func_def_65,type,
sK7: ( c_type * c_type * c_unique * c_unique * c_unique * $int ) > c_type ).
tff(func_def_66,type,
sK8: ( c_type * c_type * c_unique * c_unique * c_unique * $int * c_unique * $int ) > c_type ).
tff(func_def_67,type,
sK9: ( c_unique * c_unique * c_unique ) > c_ssorted ).
tff(func_def_68,type,
sK10: ( c_unique * c_unique * c_unique ) > c_ssorted ).
tff(func_def_69,type,
sK11: ( c_unique * c_unique * c_unique ) > c_ssorted ).
tff(func_def_70,type,
sK12: ( c_unique * c_unique * c_type * $int * $int * c_unique ) > c_ssorted ).
tff(func_def_71,type,
sK13: ( c_unique * c_type * c_unique ) > c_type ).
tff(func_def_72,type,
sK14: ( c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_73,type,
sK15: ( c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_74,type,
sK16: ( $int * $int * c_type * c_unique ) > c_type ).
tff(func_def_75,type,
sK17: ( $int * $int * c_type * c_unique ) > c_ssorted ).
tff(func_def_76,type,
sK18: ( c_unique * c_type * c_unique * c_type * c_unique * c_unique ) > c_type ).
tff(func_def_77,type,
sK19: ( c_unique * c_type * c_unique * c_type * c_unique * c_unique * c_unique ) > c_ssorted ).
tff(func_def_78,type,
sK20: ( c_unique * c_type * c_unique * c_type * c_unique * c_unique ) > c_unique ).
tff(func_def_79,type,
sK21: c_unique > c_ssorted ).
tff(func_def_80,type,
sK22: ( $int * c_unique * c_type * c_unique * $int ) > c_type ).
tff(func_def_81,type,
sK23: ( $int * c_unique * c_type * c_unique * $int ) > c_ssorted ).
tff(func_def_82,type,
sK24: ( $int * c_unique * c_type * c_unique * $int ) > c_ssorted ).
tff(func_def_83,type,
sK25: ( c_type * c_unique * c_type * c_unique * c_unique * c_unique ) > c_type ).
tff(func_def_84,type,
sK26: ( c_type * c_unique * c_type * c_unique * c_unique * c_unique ) > c_ssorted ).
tff(func_def_85,type,
sK27: ( c_type * c_unique * c_type * c_unique * c_unique * c_unique ) > c_type ).
tff(func_def_86,type,
sK28: ( c_type * c_unique * c_type * c_unique * c_unique * c_unique ) > c_ssorted ).
tff(func_def_87,type,
sK29: ( c_type * c_unique * $int * c_unique * c_type ) > c_type ).
tff(func_def_88,type,
sK30: ( c_type * c_unique * $int * c_unique * c_type ) > c_unique ).
tff(func_def_89,type,
sK31: ( c_type * c_unique * $int * c_unique * c_type ) > c_unique ).
tff(func_def_90,type,
sK32: ( c_type * c_unique * $int * c_unique * c_type ) > $int ).
tff(func_def_91,type,
sK33: ( c_type * c_unique * $int * c_unique * c_type * c_unique * $int ) > c_type ).
tff(func_def_92,type,
sK34: ( c_type * c_unique * $int * c_unique * c_type * c_unique * $int ) > c_type ).
tff(func_def_93,type,
sK35: ( c_type * c_unique * $int * c_unique * c_type * c_unique * $int ) > c_ssorted ).
tff(func_def_94,type,
sK36: ( c_unique * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_95,type,
sK37: ( c_unique * c_type * c_unique * c_unique ) > c_type ).
tff(func_def_96,type,
sK38: ( c_unique * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_97,type,
sK39: ( c_unique * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_98,type,
sK40: ( $int * c_unique * c_unique * c_unique * c_type * c_type ) > c_type ).
tff(func_def_99,type,
sK41: ( $int * c_unique * c_unique * c_unique * c_type * c_type ) > c_unique ).
tff(func_def_100,type,
sK42: ( $int * c_unique * c_unique * c_unique * c_type * c_type ) > $int ).
tff(func_def_101,type,
sK43: ( c_unique * c_unique * c_type ) > c_type ).
tff(func_def_102,type,
sK44: ( c_unique * c_unique * c_type ) > c_unique ).
tff(func_def_103,type,
sK45: ( c_unique * $int * c_type * c_type ) > c_unique ).
tff(func_def_104,type,
sK46: ( c_unique * $int * c_type * c_type ) > c_unique ).
tff(func_def_105,type,
sK47: ( c_unique * $int * c_type * c_type * c_unique * c_unique ) > c_type ).
tff(func_def_106,type,
sK48: ( c_unique * $int * c_type * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_107,type,
sK49: ( c_unique * $int * c_type * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_108,type,
sK50: ( c_type * c_unique * $int * c_unique ) > c_type ).
tff(func_def_109,type,
sK51: ( c_type * c_unique * $int * c_unique ) > c_unique ).
tff(func_def_110,type,
sK52: ( c_type * c_unique * $int * c_unique ) > $int ).
tff(func_def_111,type,
sK53: ( c_type * c_unique * c_unique ) > c_type ).
tff(func_def_112,type,
sK54: ( c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_113,type,
sK55: ( c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_114,type,
sK56: ( c_unique * c_unique * c_type ) > $int ).
tff(func_def_115,type,
sK57: ( c_type * c_unique * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_116,type,
sK58: ( c_type * c_unique * c_type * c_unique * c_unique ) > c_type ).
tff(func_def_117,type,
sK59: ( c_type * c_unique * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_118,type,
sK60: ( c_type * c_unique * c_type ) > c_unique ).
tff(func_def_119,type,
sK61: ( c_type * c_unique * c_type ) > c_unique ).
tff(func_def_120,type,
sK62: ( c_unique * c_unique * c_type * c_type * $int * c_unique ) > c_type ).
tff(func_def_121,type,
sK63: ( c_unique * c_unique * c_type * c_type * $int * c_unique * c_unique * $int ) > c_type ).
tff(func_def_122,type,
sK64: ( c_unique * c_unique * $int * c_type * $int * c_type * c_unique ) > c_type ).
tff(func_def_123,type,
sK65: ( c_unique * c_unique * $int * c_type * $int * c_type * c_unique ) > c_unique ).
tff(func_def_124,type,
sK66: ( c_unique * c_unique * $int * c_type * $int * c_type * c_unique ) > $int ).
tff(func_def_125,type,
sK67: ( c_unique * c_type * c_unique ) > c_type ).
tff(func_def_126,type,
sK68: ( c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_127,type,
sK69: ( c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_128,type,
sK70: ( c_unique * c_unique * c_unique * c_type * c_type ) > c_type ).
tff(func_def_129,type,
sK71: ( c_unique * c_unique * c_unique * c_type * c_type * c_unique * $int ) > c_type ).
tff(func_def_130,type,
sK72: ( c_unique * c_unique * c_unique * c_type * c_type ) > c_ssorted ).
tff(func_def_131,type,
sK73: ( $int * c_unique * c_unique * c_type ) > c_type ).
tff(func_def_132,type,
sK74: ( c_unique * c_type * $int * c_type ) > c_unique ).
tff(func_def_133,type,
sK75: ( c_unique * c_type * $int * c_type ) > c_unique ).
tff(func_def_134,type,
sK76: ( c_unique * c_type * $int * c_type ) > $int ).
tff(func_def_135,type,
sK77: ( c_unique * c_type * $int * c_type ) > $int ).
tff(func_def_136,type,
sK78: ( c_unique * c_type * $int * c_type * c_unique * $int * $int ) > c_type ).
tff(func_def_137,type,
sK79: ( c_unique * c_type * $int * c_type * c_unique * $int * $int ) > c_type ).
tff(func_def_138,type,
sK80: ( c_unique * c_type * $int * c_type * c_unique * $int * $int ) > c_ssorted ).
tff(func_def_139,type,
sK81: ( c_unique * c_type * $int * c_type * c_unique * $int * $int ) > c_ssorted ).
tff(func_def_140,type,
sK82: ( c_unique * c_unique * c_type ) > c_type ).
tff(func_def_141,type,
sK83: ( c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_142,type,
sK84: ( c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_143,type,
sK85: ( $int * c_type * $int * c_unique * c_unique * $int ) > c_ssorted ).
tff(func_def_144,type,
sK86: ( $int * c_type * $int * c_unique * c_unique * $int ) > c_ssorted ).
tff(func_def_145,type,
sK87: ( c_unique * c_unique * c_type ) > c_type ).
tff(func_def_146,type,
sK88: ( c_unique * c_unique * c_type * c_unique ) > c_type ).
tff(func_def_147,type,
sK89: ( c_unique * c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_148,type,
sK90: ( c_type * c_unique * c_unique * c_type ) > c_type ).
tff(func_def_149,type,
sK91: ( c_type * c_unique * c_unique * c_type * c_unique * c_unique ) > c_type ).
tff(func_def_150,type,
sK92: ( c_type * c_unique * c_unique * c_type * c_unique * c_unique ) > c_type ).
tff(func_def_151,type,
sK93: ( c_type * c_unique * c_unique * c_type ) > c_unique ).
tff(func_def_152,type,
sK94: ( c_type * c_unique * c_unique * c_type ) > c_unique ).
tff(func_def_153,type,
sK95: ( c_type * c_unique * c_unique ) > c_type ).
tff(func_def_154,type,
sK96: ( c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_155,type,
sK97: ( c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_156,type,
sK98: ( c_type * c_unique * c_unique * c_type ) > c_type ).
tff(func_def_157,type,
sK99: ( c_type * c_unique * c_unique * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_158,type,
sK100: ( c_type * c_unique * c_unique * c_type * c_unique * c_unique ) > c_type ).
tff(func_def_159,type,
sK101: ( c_type * c_unique * c_unique * c_type ) > c_unique ).
tff(func_def_160,type,
sK102: ( c_type * c_unique * c_unique * c_type ) > c_unique ).
tff(func_def_161,type,
sK103: ( c_unique * c_unique * $int * $int * c_type ) > c_type ).
tff(func_def_162,type,
sK104: ( c_unique * c_unique * $int * $int * c_type ) > c_ssorted ).
tff(func_def_163,type,
sK105: ( c_unique * c_unique * $int * $int * c_type ) > c_ssorted ).
tff(func_def_164,type,
sK106: ( c_unique * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_165,type,
sK107: ( c_unique * c_type * c_unique * c_unique ) > c_type ).
tff(func_def_166,type,
sK108: ( c_unique * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_167,type,
sK109: ( c_type * c_unique * $int * c_unique ) > c_type ).
tff(func_def_168,type,
sK110: ( c_type * c_unique * $int * c_unique ) > c_ssorted ).
tff(func_def_169,type,
sK111: ( c_type * c_unique * $int * c_unique ) > c_ssorted ).
tff(func_def_170,type,
sK112: ( c_unique * c_type * $int * c_unique ) > c_ssorted ).
tff(func_def_171,type,
sK113: ( c_unique * c_type * $int * c_unique ) > c_ssorted ).
tff(func_def_172,type,
sK114: ( c_unique * c_type * $int * c_unique ) > $int ).
tff(func_def_173,type,
sK115: ( c_unique * c_type * $int * $int * c_unique ) > c_type ).
tff(func_def_174,type,
sK116: ( c_unique * c_type * $int * $int * c_unique ) > c_unique ).
tff(func_def_175,type,
sK117: ( c_unique * c_type * $int * $int * c_unique ) > $int ).
tff(func_def_176,type,
sK118: ( c_type * c_unique * c_unique ) > c_type ).
tff(func_def_177,type,
sK119: ( c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_178,type,
sK120: ( c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_179,type,
sK121: ( c_unique * c_type * c_unique ) > c_type ).
tff(func_def_180,type,
sK122: ( c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_181,type,
sK123: ( c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_182,type,
sK124: ( c_unique * c_type * c_unique * c_unique * c_type ) > c_type ).
tff(func_def_183,type,
sK125: ( c_unique * c_type * c_unique * c_unique * c_type ) > c_unique ).
tff(func_def_184,type,
sK126: ( c_unique * c_type * c_unique * c_unique * c_type ) > $int ).
tff(func_def_185,type,
sK127: ( c_unique * c_type * c_unique ) > c_type ).
tff(func_def_186,type,
sK128: ( c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_187,type,
sK129: ( c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_188,type,
sK130: ( c_unique * c_unique * c_type * c_type * $int ) > c_type ).
tff(func_def_189,type,
sK131: ( c_unique * c_unique * c_type * c_type * $int ) > c_unique ).
tff(func_def_190,type,
sK132: ( c_unique * c_unique * c_type * c_type * $int ) > $int ).
tff(func_def_191,type,
sK133: ( c_unique * c_unique * c_type * c_type * $int ) > c_unique ).
tff(func_def_192,type,
sK134: ( c_unique * c_unique * c_type * c_type * $int * c_unique * $int * c_unique ) > c_type ).
tff(func_def_193,type,
sK135: ( c_unique * c_unique * c_type * c_type * $int * c_unique * $int * c_unique ) > c_type ).
tff(func_def_194,type,
sK136: ( c_unique * c_type * c_unique ) > c_type ).
tff(func_def_195,type,
sK137: ( c_type * $int * c_unique ) > c_type ).
tff(func_def_196,type,
sK138: ( c_type * $int * c_unique ) > c_ssorted ).
tff(func_def_197,type,
sK139: ( c_type * c_unique * $int * c_unique * $int * $int ) > c_ssorted ).
tff(func_def_198,type,
sK140: ( c_type * c_unique * $int * c_unique * $int * $int ) > c_type ).
tff(func_def_199,type,
sK141: ( c_type * c_unique * $int * c_unique * $int * $int ) > c_ssorted ).
tff(func_def_200,type,
sK142: $int > $int ).
tff(func_def_201,type,
sK143: ( c_unique * $int * c_type * c_unique ) > c_type ).
tff(func_def_202,type,
sK144: ( c_unique * c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_203,type,
sK145: ( c_unique * c_unique * c_type * $int * c_unique ) > c_ssorted ).
tff(func_def_204,type,
sK146: ( c_unique * $int * c_type * c_unique * $int ) > c_type ).
tff(func_def_205,type,
sK147: ( c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_206,type,
sK148: ( c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_207,type,
sK149: ( $int * c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_208,type,
sK150: ( $int * c_unique * c_unique * c_type ) > c_type ).
tff(func_def_209,type,
sK151: ( $int * c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_210,type,
sK152: c_unique ).
tff(func_def_211,type,
sK153: $int ).
tff(func_def_212,type,
sK154: $int ).
tff(func_def_213,type,
sK155: $int ).
tff(func_def_214,type,
sK156: c_unique ).
tff(func_def_215,type,
sK157: c_unique ).
tff(func_def_216,type,
sK158: $int ).
tff(func_def_217,type,
sK159: $int ).
tff(func_def_218,type,
sK160: $int ).
tff(func_def_219,type,
sK161: $int ).
tff(func_def_220,type,
sK162: $int ).
tff(func_def_221,type,
sK163: c_unique ).
tff(func_def_222,type,
sK164: $int ).
tff(func_def_223,type,
sK165: $int ).
tff(func_def_224,type,
sK166: $int ).
tff(func_def_225,type,
sK167: c_unique ).
tff(func_def_226,type,
sK168: c_type > c_unique ).
tff(func_def_227,type,
sK169: c_type > $int ).
tff(func_def_228,type,
sK170: c_type > c_unique ).
tff(func_def_229,type,
sK171: $int ).
tff(func_def_230,type,
sK172: $int > c_type ).
tff(func_def_231,type,
sK173: ( c_unique * $int * $int * c_unique * c_type ) > c_ssorted ).
tff(func_def_232,type,
sK174: ( c_unique * $int * $int * c_unique * c_type ) > c_ssorted ).
tff(func_def_233,type,
sK175: ( c_unique * $int * $int * c_unique * c_type ) > $int ).
tff(func_def_234,type,
sK176: ( c_type * c_unique * c_unique * c_unique ) > c_ssorted ).
tff(func_def_235,type,
sK177: ( c_type * c_unique * c_unique * c_unique ) > c_type ).
tff(func_def_236,type,
sK178: ( c_type * c_unique * c_unique * c_unique ) > c_ssorted ).
tff(func_def_237,type,
sK179: ( c_unique * c_type ) > c_ssorted ).
tff(func_def_238,type,
sK180: ( c_type * c_unique * c_unique * c_unique * c_type ) > c_type ).
tff(func_def_239,type,
sK181: ( c_type * c_unique * c_unique * c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_240,type,
sK182: ( $int * c_unique * $int * c_unique * c_type ) > c_ssorted ).
tff(func_def_241,type,
sK183: ( $int * c_unique * $int * c_unique * c_type ) > c_ssorted ).
tff(func_def_242,type,
sK184: ( c_unique * c_type * c_type * c_unique * c_unique * $int ) > c_type ).
tff(func_def_243,type,
sK185: ( c_unique * c_type * c_type * c_unique * c_unique * $int ) > c_unique ).
tff(func_def_244,type,
sK186: ( c_unique * c_type * c_type * c_unique * c_unique * $int ) > $int ).
tff(func_def_245,type,
sK187: ( c_unique * $int * $int * c_type * c_unique ) > c_type ).
tff(func_def_246,type,
sK188: ( c_unique * $int * $int * c_type * c_unique ) > c_ssorted ).
tff(func_def_247,type,
sK189: ( c_unique * $int * $int * c_type * c_unique ) > c_ssorted ).
tff(func_def_248,type,
sK190: ( c_type * c_type * c_unique * c_unique * c_unique * c_unique * c_unique ) > c_ssorted ).
tff(func_def_249,type,
sK191: ( c_type * c_type * c_unique * c_unique * c_unique * c_unique * c_unique ) > c_type ).
tff(func_def_250,type,
sK192: ( c_type * c_type * c_unique * c_unique * c_unique * c_unique * c_unique ) > c_ssorted ).
tff(func_def_251,type,
sK193: ( c_type * c_type * c_unique * c_unique * c_unique * c_unique * c_unique ) > c_ssorted ).
tff(func_def_252,type,
sK194: ( c_type * c_type * c_unique * c_unique * c_unique * c_unique * c_unique ) > c_ssorted ).
tff(func_def_253,type,
sK195: ( c_type * c_type * c_unique * c_unique * c_unique * c_unique * c_unique ) > c_ssorted ).
tff(func_def_254,type,
sK196: ( c_unique * c_unique * c_type * c_type * c_unique ) > c_type ).
tff(func_def_255,type,
sK197: ( c_unique * c_unique * c_type * c_type * c_unique ) > c_unique ).
tff(func_def_256,type,
sK198: ( c_unique * c_type * c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_257,type,
sK199: ( c_unique * c_type * c_unique * c_type * c_unique ) > c_type ).
tff(func_def_258,type,
sK200: ( c_type * c_unique * c_unique * c_unique * $int * c_type ) > c_type ).
tff(func_def_259,type,
sK201: ( c_type * c_unique * c_unique * c_unique * $int * c_type ) > c_ssorted ).
tff(func_def_260,type,
sK202: ( c_type * c_unique * c_unique * c_unique * $int * c_type ) > c_ssorted ).
tff(func_def_261,type,
sK203: ( c_type * c_unique * c_unique * c_unique * $int * c_type ) > c_ssorted ).
tff(func_def_262,type,
sK204: ( c_unique * c_type * $int ) > c_type ).
tff(func_def_263,type,
sK205: ( c_unique * c_type * $int ) > c_ssorted ).
tff(func_def_264,type,
sK206: ( $int * c_unique * $int * c_type * c_unique * c_unique * c_type ) > c_type ).
tff(func_def_265,type,
sK207: ( $int * c_unique * $int * c_type * c_unique * c_unique * c_type * c_unique * $int ) > c_type ).
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,
~ ! [X1: c_unique,X0: $int,X4: c_unique,X3: $int,X2: $int] :
( ( ( X3 = 2800 )
& valid_range(c_sort(type_alloc_table,X1),c_sort(type_pointer(type_global),X4),0,2800)
& ( X2 = 0 )
& ( X0 = 10000 ) )
=> ! [X6: c_unique,X5: $int] :
( ( $lesseq(0,X5)
& ! [X7: $int] :
? [X8: c_type] :
( ( ( $less(X7,X5)
& $lesseq(0,X7) )
=> ( ss2Int(c_sort(c_int,acc(c_sort(type_memory(c_int,type_global),X6),c_sort(X8,shift(c_sort(X8,X4),X7))))) = 2000 ) )
& ( X8 = type_pointer(type_global) ) )
& $lesseq(X5,2800) )
=> ( ( $difference(X5,X3) = 0 )
=> ! [X9: $int] :
( ( $lesseq(X9,2800)
& $lesseq(0,X9)
& ( '%'(X9,14) = 0 ) )
=> ! [X10: $int] :
( ( X10 = 0 )
=> ! [X11: $int] :
( ( X11 = $product(X9,2) )
=> ( ( X11 != 0 )
=> ! [X12: $int] :
( ( X12 = X9 )
=> ! [X15: $int,X14: $int,X16: c_unique,X13: $int] :
( ( $lesseq(1,X13)
& ( X15 = $product(X13,2) )
& $lesseq(X13,X9) )
=> ( ( 1 != 0 )
=> ! [X17: c_unique] :
? [X18: c_type] :
( ( X18 = type_pointer(type_global) )
& ( ( X17 = shift(c_sort(X18,X4),X13) )
=> ( valid(c_sort(type_alloc_table,X1),c_sort(X18,X17))
=> ! [X19: c_unique] :
( ( X19 = acc(c_sort(type_memory(c_int,type_global),X16),c_sort(X18,X17)) )
=> ! [X20: $int] :
( ( X20 = $sum(X14,$product(ss2Int(c_sort(c_int,X19)),X0)) )
=> ! [X21: c_unique] :
( ( X21 = shift(c_sort(X18,X4),X13) )
=> ! [X22: $int] :
( ( X22 = $difference(X15,1) )
=> ( X22 != 0 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',formula_101) ).
tff(f109,plain,
~ ! [X1: c_unique,X0: $int,X4: c_unique,X3: $int,X2: $int] :
( ( ( X3 = 2800 )
& valid_range(c_sort(type_alloc_table,X1),c_sort(type_pointer(type_global),X4),0,2800)
& ( X2 = 0 )
& ( X0 = 10000 ) )
=> ! [X6: c_unique,X5: $int] :
( ( ~ $less(X5,0)
& ! [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(2800,X5) )
=> ( ( 0 = $sum(X5,$uminus(X3)) )
=> ! [X9: $int] :
( ( ~ $less(2800,X9)
& ( '%'(X9,14) = 0 )
& ~ $less(X9,0) )
=> ! [X10: $int] :
( ( X10 = 0 )
=> ! [X11: $int] :
( ( X11 = $product(X9,2) )
=> ( ( X11 != 0 )
=> ! [X12: $int] :
( ( X12 = X9 )
=> ! [X15: $int,X14: $int,X16: c_unique,X13: $int] :
( ( ~ $less(X13,1)
& ( X15 = $product(X13,2) )
& ~ $less(X9,X13) )
=> ( ( 1 != 0 )
=> ! [X17: c_unique] :
? [X18: c_type] :
( ( X18 = type_pointer(type_global) )
& ( ( X17 = shift(c_sort(X18,X4),X13) )
=> ( valid(c_sort(type_alloc_table,X1),c_sort(X18,X17))
=> ! [X19: c_unique] :
( ( X19 = acc(c_sort(type_memory(c_int,type_global),X16),c_sort(X18,X17)) )
=> ! [X20: $int] :
( ( X20 = $sum(X14,$product(ss2Int(c_sort(c_int,X19)),X0)) )
=> ! [X21: c_unique] :
( ( X21 = shift(c_sort(X18,X4),X13) )
=> ! [X22: $int] :
( ( $sum(X15,$uminus(1)) = X22 )
=> ( X22 != 0 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(theory_normalization,[],[f101]) ).
tff(f153,plain,
~ ! [X2: c_unique,X4: $int,X1: $int,X3: $int,X0: c_unique] :
( ( ( X3 = 2800 )
& ( 10000 = X1 )
& ( 0 = X4 )
& valid_range(c_sort(type_alloc_table,X0),c_sort(type_pointer(type_global),X2),0,2800) )
=> ! [X6: $int,X5: c_unique] :
( ( ~ $less(X6,0)
& ! [X7: $int] :
? [X8: c_type] :
( ( ( ~ $less(X7,0)
& $less(X7,X6) )
=> ( 2000 = ss2Int(c_sort(c_int,acc(c_sort(type_memory(c_int,type_global),X5),c_sort(X8,shift(c_sort(X8,X2),X7))))) ) )
& ( X8 = type_pointer(type_global) ) )
& ~ $less(2800,X6) )
=> ( ( 0 = $sum(X6,$uminus(X3)) )
=> ! [X9: $int] :
( ( ~ $less(2800,X9)
& ( '%'(X9,14) = 0 )
& ~ $less(X9,0) )
=> ! [X10: $int] :
( ( X10 = 0 )
=> ! [X11: $int] :
( ( X11 = $product(X9,2) )
=> ( ( X11 != 0 )
=> ! [X12: $int] :
( ( X12 = X9 )
=> ! [X13: $int,X16: $int,X14: $int,X15: c_unique] :
( ( ~ $less(X16,1)
& ( $product(X16,2) = X13 )
& ~ $less(X9,X16) )
=> ( ( 1 != 0 )
=> ! [X17: c_unique] :
? [X18: c_type] :
( ( ( shift(c_sort(X18,X2),X16) = X17 )
=> ( valid(c_sort(type_alloc_table,X0),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(X14,$product(ss2Int(c_sort(c_int,X19)),X1)) = X20 )
=> ! [X21: c_unique] :
( ( shift(c_sort(X18,X2),X16) = X21 )
=> ! [X22: $int] :
( ( $sum(X13,$uminus(1)) = X22 )
=> ( X22 != 0 ) ) ) ) ) ) )
& ( X18 = type_pointer(type_global) ) ) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f109]) ).
tff(f236,plain,
? [X2: c_unique,X4: $int,X1: $int,X3: $int,X0: c_unique] :
( ? [X6: $int,X5: c_unique] :
( ? [X9: $int] :
( ? [X10: $int] :
( ? [X11: $int] :
( ? [X12: $int] :
( ? [X13: $int,X16: $int,X14: $int,X15: c_unique] :
( ? [X17: c_unique] :
! [X18: c_type] :
( ( ? [X19: c_unique] :
( ? [X20: $int] :
( ? [X21: c_unique] :
( ( shift(c_sort(X18,X2),X16) = X21 )
& ? [X22: $int] :
( ( $sum(X13,$uminus(1)) = X22 )
& ( 0 = X22 ) ) )
& ( $sum(X14,$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,X0),c_sort(X18,X17))
& ( shift(c_sort(X18,X2),X16) = X17 ) )
| ( type_pointer(type_global) != X18 ) )
& ( 1 != 0 )
& ~ $less(X16,1)
& ( $product(X16,2) = X13 )
& ~ $less(X9,X16) )
& ( X12 = X9 ) )
& ( X11 != 0 )
& ( X11 = $product(X9,2) ) )
& ( X10 = 0 ) )
& ~ $less(2800,X9)
& ( '%'(X9,14) = 0 )
& ~ $less(X9,0) )
& ( 0 = $sum(X6,$uminus(X3)) )
& ~ $less(X6,0)
& ! [X7: $int] :
? [X8: c_type] :
( ( ( 2000 = ss2Int(c_sort(c_int,acc(c_sort(type_memory(c_int,type_global),X5),c_sort(X8,shift(c_sort(X8,X2),X7))))) )
| $less(X7,0)
| ~ $less(X7,X6) )
& ( X8 = type_pointer(type_global) ) )
& ~ $less(2800,X6) )
& ( X3 = 2800 )
& ( 10000 = X1 )
& ( 0 = X4 )
& valid_range(c_sort(type_alloc_table,X0),c_sort(type_pointer(type_global),X2),0,2800) ),
inference(ennf_transformation,[],[f153]) ).
tff(f237,plain,
? [X2: c_unique,X3: $int,X1: $int,X4: $int,X0: c_unique] :
( valid_range(c_sort(type_alloc_table,X0),c_sort(type_pointer(type_global),X2),0,2800)
& ( X3 = 2800 )
& ( 10000 = X1 )
& ( 0 = X4 )
& ? [X5: c_unique,X6: $int] :
( ? [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] :
( ? [X15: c_unique,X16: $int,X14: $int,X13: $int] :
( ? [X17: c_unique] :
! [X18: c_type] :
( ( valid(c_sort(type_alloc_table,X0),c_sort(X18,X17))
& ( shift(c_sort(X18,X2),X16) = X17 )
& ? [X19: c_unique] :
( ? [X20: $int] :
( ? [X21: c_unique] :
( ( shift(c_sort(X18,X2),X16) = X21 )
& ? [X22: $int] :
( ( $sum(X13,$uminus(1)) = X22 )
& ( 0 = X22 ) ) )
& ( $sum(X14,$product(ss2Int(c_sort(c_int,X19)),X1)) = X20 ) )
& ( acc(c_sort(type_memory(c_int,type_global),X15),c_sort(X18,X17)) = X19 ) ) )
| ( type_pointer(type_global) != X18 ) )
& ~ $less(X9,X16)
& ( $product(X16,2) = X13 )
& ~ $less(X16,1)
& ( 1 != 0 ) )
& ( X12 = X9 ) ) ) ) )
& ~ $less(2800,X6)
& ! [X7: $int] :
? [X8: c_type] :
( ( X8 = type_pointer(type_global) )
& ( ( 2000 = ss2Int(c_sort(c_int,acc(c_sort(type_memory(c_int,type_global),X5),c_sort(X8,shift(c_sort(X8,X2),X7))))) )
| ~ $less(X7,X6)
| $less(X7,0) ) )
& ~ $less(X6,0)
& ( 0 = $sum(X6,$uminus(X3)) ) ) ),
inference(flattening,[],[f236]) ).
tff(f435,plain,
? [X0: c_unique,X1: $int,X2: $int,X3: $int,X4: c_unique] :
( valid_range(c_sort(type_alloc_table,X4),c_sort(type_pointer(type_global),X0),0,2800)
& ( 2800 = X1 )
& ( 10000 = X2 )
& ( 0 = X3 )
& ? [X5: c_unique,X6: $int] :
( ? [X7: $int] :
( ( 0 = '%'(X7,14) )
& ~ $less(2800,X7)
& ~ $less(X7,0)
& ? [X8: $int] :
( ( 0 = X8 )
& ? [X9: $int] :
( ( $product(X7,2) = X9 )
& ( 0 != X9 )
& ? [X10: $int] :
( ? [X11: c_unique,X12: $int,X13: $int,X14: $int] :
( ? [X15: c_unique] :
! [X16: c_type] :
( ( valid(c_sort(type_alloc_table,X4),c_sort(X16,X15))
& ( shift(c_sort(X16,X0),X12) = X15 )
& ? [X17: c_unique] :
( ? [X18: $int] :
( ? [X19: c_unique] :
( ( shift(c_sort(X16,X0),X12) = X19 )
& ? [X20: $int] :
( ( $sum(X14,$uminus(1)) = X20 )
& ( 0 = X20 ) ) )
& ( $sum(X13,$product(ss2Int(c_sort(c_int,X17)),X2)) = X18 ) )
& ( acc(c_sort(type_memory(c_int,type_global),X11),c_sort(X16,X15)) = X17 ) ) )
| ( type_pointer(type_global) != X16 ) )
& ~ $less(X7,X12)
& ( $product(X12,2) = X14 )
& ~ $less(X12,1)
& ( 1 != 0 ) )
& ( X7 = X10 ) ) ) ) )
& ~ $less(2800,X6)
& ! [X21: $int] :
? [X22: c_type] :
( ( type_pointer(type_global) = X22 )
& ( ( 2000 = ss2Int(c_sort(c_int,acc(c_sort(type_memory(c_int,type_global),X5),c_sort(X22,shift(c_sort(X22,X0),X21))))) )
| ~ $less(X21,X6)
| $less(X21,0) ) )
& ~ $less(X6,0)
& ( 0 = $sum(X6,$uminus(X1)) ) ) ),
inference(rectify,[],[f237]) ).
tff(f436,plain,
( valid_range(c_sort(type_alloc_table,sK156),c_sort(type_pointer(type_global),sK152),0,2800)
& ( 2800 = sK153 )
& ( 10000 = sK154 )
& ( 0 = sK155 )
& ( 0 = '%'(sK159,14) )
& ~ $less(2800,sK159)
& ~ $less(sK159,0)
& ( 0 = sK160 )
& ( $product(sK159,2) = sK161 )
& ( 0 != sK161 )
& ! [X16: c_type] :
( ( valid(c_sort(type_alloc_table,sK156),c_sort(X16,sK167))
& ( sK167 = shift(c_sort(X16,sK152),sK164) )
& ( sK170(X16) = shift(c_sort(X16,sK152),sK164) )
& ( sK171 = $sum(sK166,$uminus(1)) )
& ( 0 = sK171 )
& ( sK169(X16) = $sum(sK165,$product(ss2Int(c_sort(c_int,sK168(X16))),sK154)) )
& ( acc(c_sort(type_memory(c_int,type_global),sK163),c_sort(X16,sK167)) = sK168(X16) ) )
| ( type_pointer(type_global) != X16 ) )
& ~ $less(sK159,sK164)
& ( sK166 = $product(sK164,2) )
& ~ $less(sK164,1)
& ( 1 != 0 )
& ( sK162 = sK159 )
& ~ $less(2800,sK158)
& ! [X21: $int] :
( ( type_pointer(type_global) = sK172(X21) )
& ( ( 2000 = ss2Int(c_sort(c_int,acc(c_sort(type_memory(c_int,type_global),sK157),c_sort(sK172(X21),shift(c_sort(sK172(X21),sK152),X21))))) )
| ~ $less(X21,sK158)
| $less(X21,0) ) )
& ~ $less(sK158,0)
& ( 0 = $sum(sK158,$uminus(sK153)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK152,sK153,sK154,sK155,sK156,sK157,sK158,sK159,sK160,sK161,sK162,sK163,sK164,sK165,sK166,sK167,sK168,sK169,sK170,sK171,sK172]),skolemize(X0,sK152),skolemize(X1,sK153),skolemize(X2,sK154),skolemize(X3,sK155),skolemize(X4,sK156),skolemize(X5,sK157),skolemize(X6,sK158),skolemize(X7,sK159),skolemize(X8,sK160),skolemize(X9,sK161),skolemize(X10,sK162),skolemize(X11,sK163),skolemize(X12,sK164),skolemize(X13,sK165),skolemize(X14,sK166),skolemize(X15,sK167),skolemize(X17,sK168(X16)),skolemize(X18,sK169(X16)),skolemize(X19,sK170(X16)),skolemize(X20,sK171),skolemize(X22,sK172(X21))],[f435]) ).
tff(f727,plain,
~ $less(sK164,1),
inference(cnf_transformation,[],[f436]) ).
tff(f728,plain,
sK166 = $product(sK164,2),
inference(cnf_transformation,[],[f436]) ).
tff(f732,plain,
! [X16: c_type] :
( ( 0 = sK171 )
| ( type_pointer(type_global) != X16 ) ),
inference(cnf_transformation,[],[f436]) ).
tff(f733,plain,
! [X16: c_type] :
( ( sK171 = $sum(sK166,$uminus(1)) )
| ( type_pointer(type_global) != X16 ) ),
inference(cnf_transformation,[],[f436]) ).
tff(f1053,plain,
sK171 = $sum(sK166,$uminus(1)),
inference(equality_resolution,[],[f733]) ).
tff(f1054,plain,
0 = sK171,
inference(equality_resolution,[],[f732]) ).
tff(f1066,plain,
sK171 = $sum(sK166,-1),
inference(evaluation,[],[f1053]) ).
tff(f1073,definition,
( spl208_2
<=> ( 0 = sK171 ) ),
introduced(definition,[new_symbols(definition,[spl208_2])],[avatar_definition]) ).
tff(f1076,plain,
spl208_2,
inference(avatar_split_clause,[],[f1054,f1073]) ).
tff(f1078,definition,
( spl208_3
<=> ( sK166 = $product(sK164,2) ) ),
introduced(definition,[new_symbols(definition,[spl208_3])],[avatar_definition]) ).
tff(f1081,plain,
spl208_3,
inference(avatar_split_clause,[],[f728,f1078]) ).
tff(f1128,definition,
( spl208_13
<=> $less(sK164,1) ),
introduced(definition,[new_symbols(definition,[spl208_13])],[avatar_definition]) ).
tff(f1131,plain,
~ spl208_13,
inference(avatar_split_clause,[],[f727,f1128]) ).
tff(f1148,definition,
( spl208_17
<=> ( sK171 = $sum(sK166,-1) ) ),
introduced(definition,[new_symbols(definition,[spl208_17])],[avatar_definition]) ).
tff(f1151,plain,
spl208_17,
inference(avatar_split_clause,[],[f1066,f1148]) ).
tff(f1177,plain,
$false,
inference(avatar_smt_refutation,[],[f1151,f1131,f1081,f1076]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW810_1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.19 % Computer : n006.cluster.edu
% 0.10/0.19 % Model : x86_64 x86_64
% 0.10/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.19 % Memory : 8046.5625MB
% 0.10/0.19 % OS : Linux 6.8.0-71-generic
% 0.10/0.19 % CPULimit : 300
% 0.10/0.19 % WCLimit : 300
% 0.10/0.19 % DateTime : Mon Sep 28 14:30:33 UTC 2026
% 0.10/0.19 % CPUTime :
% 0.10/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.23 Running first-order theorem proving
% 0.10/0.23 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.28/1.18 % (4010994)Detected arithmetic, will pick strategies from an ALASCA-aware ARI schedule.
% 3.28/1.18 % (4011133)dis+10_3_slsqr=1,4:to=lpo:sil=128000:thi=strong:si=on:uwa=off:s2agt=20:slsqc=1:slsq=on:random_seed=3647174271:i=201:slsql=off:asg=cautious:rtra=on:gtg=all:ss=axioms:sgt=16_2999 on theBenchmark for (2999ds/201Mi)
% 3.28/1.18 % (4011131)dis+1002_16:1_to=lpo:sil=64000:sas=z3:si=on:norm_ineq=on:gve=force:uwa=one_side_constant:random_seed=1410039534:i=12:doe=on:rtra=on:gtg=exists_top:ss=axioms_2999 on theBenchmark for (2999ds/12Mi)
% 3.28/1.18 % (4011137)lrs+10_1_tgt=ground:sas=z3:si=on:random_seed=4130273676:i=33:rtra=on_2999 on theBenchmark for (2999ds/33Mi)
% 3.28/1.18 % (4011136)lrs+10_1_to=lpo:sas=z3:si=on:tha=off:random_seed=2991472339:i=46:rtra=on_2999 on theBenchmark for (2999ds/46Mi)
% 3.28/1.18 % (4011135)dis+21_64_to=kbo:sil=128000:si=on:sp=weighted_frequency:uwa=alasca_can_abstract:random_seed=2986237246:i=4:rtra=on_2999 on theBenchmark for (2999ds/4Mi)
% 3.28/1.18 % (4011132)dis+1002_1_to=kbo:sil=128000:tgt=ground:sas=z3:si=on:spb=units:tha=off:random_seed=1770747621:i=307:kws=precedence:nm=0:rtra=on_2999 on theBenchmark for (2999ds/307Mi)
% 3.28/1.18 % (4011134)lrs+1002_4:1_to=lpo:sil=64000:si=on:br=off:random_seed=3585443157:s2a=on:i=7:rtra=on:inst=on_2999 on theBenchmark for (2999ds/7Mi)
% 3.28/1.18 % (4011135)Instruction limit reached!
% 3.28/1.18 % (4011135)------------------------------
% 3.28/1.18 % (4011135)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.28/1.18 % (4011135)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.28/1.18 % (4011135)CaDiCaL version: 2.1.3
% 3.28/1.18 % (4011135)Termination reason: Instruction limit
% 3.28/1.18 % (4011135)Termination phase: Preprocessing 1
% 3.28/1.18 % (4011135)Time elapsed: 0.003 s
% 3.28/1.18 % (4011135)Peak memory usage: 85 MB
% 3.28/1.18 % (4011135)Instructions burned: 5 (million)
% 3.28/1.18 % (4011134)Instruction limit reached!
% 3.28/1.18 % (4011134)------------------------------
% 3.28/1.18 % (4011134)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.28/1.18 % (4011134)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.28/1.18 % (4011134)CaDiCaL version: 2.1.3
% 3.28/1.18 % (4011134)Termination reason: Instruction limit
% 3.28/1.18 % (4011134)Termination phase: Unused predicate definition removal
% 3.28/1.18 % (4011134)Time elapsed: 0.004 s
% 3.28/1.18 % (4011134)Peak memory usage: 86 MB
% 3.28/1.18 % (4011134)Instructions burned: 7 (million)
% 3.28/1.18 % (4011131)Instruction limit reached!
% 3.28/1.18 % (4011131)------------------------------
% 3.28/1.18 % (4011131)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.28/1.18 % (4011131)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.28/1.18 % (4011131)CaDiCaL version: 2.1.3
% 3.28/1.18 % (4011131)Termination reason: Instruction limit
% 3.28/1.18 % (4011131)Termination phase: Saturation
% 3.28/1.18 % (4011131)Time elapsed: 0.007 s
% 3.28/1.18 % (4011131)Peak memory usage: 89 MB
% 3.28/1.18 % (4011131)Instructions burned: 12 (million)
% 3.28/1.18 % (4011137)Instruction limit reached!
% 3.28/1.18 % (4011137)------------------------------
% 3.28/1.18 % (4011137)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.28/1.18 % (4011137)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.28/1.18 % (4011137)CaDiCaL version: 2.1.3
% 3.28/1.18 % (4011137)Termination reason: Instruction limit
% 3.28/1.18 % (4011137)Termination phase: Saturation
% 3.28/1.18 % (4011137)Time elapsed: 0.037 s
% 3.28/1.18 % (4011137)Peak memory usage: 107 MB
% 3.28/1.18 % (4011137)Instructions burned: 33 (million)
% 3.28/1.18 % (4011136)Instruction limit reached!
% 3.28/1.18 % (4011136)------------------------------
% 3.28/1.18 % (4011136)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.28/1.18 % (4011136)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.28/1.18 % (4011136)CaDiCaL version: 2.1.3
% 3.28/1.18 % (4011136)Termination reason: Instruction limit
% 3.28/1.18 % (4011136)Termination phase: Saturation
% 3.28/1.18 % (4011136)Time elapsed: 0.049 s
% 3.28/1.18 % (4011136)Peak memory usage: 115 MB
% 3.28/1.18 % (4011136)Instructions burned: 46 (million)
% 3.28/1.18 % (4011132)First to succeed.
% 3.28/1.18 % (4011132)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-4010994"
% 3.28/1.18 % (4011133)Instruction limit reached!
% 3.28/1.18 % (4011133)------------------------------
% 3.28/1.18 % (4011133)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.28/1.18 % (4011133)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.28/1.18 % (4011133)CaDiCaL version: 2.1.3
% 3.28/1.18 % (4011133)Termination reason: Instruction limit
% 3.28/1.18 % (4011133)Termination phase: Saturation
% 3.28/1.18 % (4011133)Time elapsed: 0.095 s
% 3.28/1.18 % (4011133)Peak memory usage: 118 MB
% 3.28/1.18 % (4011133)Instructions burned: 201 (million)
% 3.28/1.18 % (4011145)dis+11_3_anc=none:drc=ordering:si=on:urr=ec_only:bce=on:tha=off:sac=on:random_seed=1404550380:st=5:i=14:sd=10:rtra=on:ss=axioms:rawr=on_2998 on theBenchmark for (2998ds/14Mi)
% 3.28/1.18 % (4011146)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=1179438536:i=29:thsqd=64:nm=0:thsqc=8:rtra=on:thsq=on:ev=off_2998 on theBenchmark for (2998ds/29Mi)
% 3.28/1.18 % (4011147)ott+21_1024_to=lakbo:sil=128000:bsd=on:si=on:alasca=on:uwa=alasca_main:nwc=0.5:random_seed=624246473:cond=on:i=16:fgj=on:ep=RS:asg=force:nm=10:rtra=on:rawr=on_2998 on theBenchmark for (2998ds/16Mi)
% 3.28/1.18 % (4011150)dis+1002_24_to=kbo:sil=128000:si=on:random_seed=2368545226:i=85:gtgl=4:rtra=on:gtg=exists_sym_2997 on theBenchmark for (2997ds/85Mi)
% 3.28/1.18 % (4011145)Refutation not found, incomplete strategy
% 3.28/1.18 % (4011145)------------------------------
% 3.28/1.18 % (4011145)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.28/1.18 % (4011145)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.28/1.18 % (4011145)CaDiCaL version: 2.1.3
% 3.28/1.18 % (4011145)Termination reason: Refutation not found, incomplete strategy
% 3.28/1.18 % (4011145)Time elapsed: 0.003 s
% 3.28/1.18 % (4011145)Peak memory usage: 88 MB
% 3.28/1.18 % (4011145)Instructions burned: 4 (million)
% 3.28/1.18 % (4011147)Instruction limit reached!
% 3.28/1.18 % (4011147)------------------------------
% 3.28/1.18 % (4011147)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.28/1.18 % (4011147)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.28/1.18 % (4011147)CaDiCaL version: 2.1.3
% 3.28/1.18 % (4011147)Termination reason: Instruction limit
% 3.28/1.18 % (4011147)Termination phase: Property scanning
% 3.28/1.18 % (4011147)Time elapsed: 0.011 s
% 3.28/1.18 % (4011147)Peak memory usage: 87 MB
% 3.28/1.18 % (4011147)Instructions burned: 18 (million)
% 3.28/1.18 % (4011146)Instruction limit reached!
% 3.28/1.18 % (4011146)------------------------------
% 3.28/1.18 % (4011146)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.28/1.18 % (4011146)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.28/1.18 % (4011146)CaDiCaL version: 2.1.3
% 3.28/1.18 % (4011146)Termination reason: Instruction limit
% 3.28/1.18 % (4011146)Termination phase: Saturation
% 3.28/1.18 % (4011146)Time elapsed: 0.016 s
% 3.28/1.18 % (4011146)Peak memory usage: 88 MB
% 3.28/1.18 % (4011146)Instructions burned: 29 (million)
% 3.28/1.18 % (4011150)Instruction limit reached!
% 3.28/1.18 % (4011150)------------------------------
% 3.28/1.18 % (4011150)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.28/1.18 % (4011150)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.28/1.18 % (4011150)CaDiCaL version: 2.1.3
% 3.28/1.18 % (4011150)Termination reason: Instruction limit
% 3.28/1.18 % (4011150)Termination phase: Saturation
% 3.28/1.18 % (4011150)Time elapsed: 0.026 s
% 3.28/1.18 % (4011150)Peak memory usage: 90 MB
% 3.28/1.18 % (4011150)Instructions burned: 86 (million)
% 3.28/1.18 % (4011148)dis+1011_1_prc=on:drc=off:si=on:sac=on:random_seed=1197558365:i=24:canc=force:rtra=on_2997 on theBenchmark for (2997ds/24Mi)
% 3.28/1.18 % (4011149)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=1436138439:i=27:canc=cautious:fsr=off:rtra=on_2997 on theBenchmark for (2997ds/27Mi)
% 3.28/1.18 % (4011148)Instruction limit reached!
% 3.28/1.18 % (4011148)------------------------------
% 3.28/1.18 % (4011148)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.28/1.18 % (4011148)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.28/1.18 % (4011148)CaDiCaL version: 2.1.3
% 3.28/1.18 % (4011148)Termination reason: Instruction limit
% 3.28/1.18 % (4011148)Termination phase: Property scanning
% 3.28/1.18 % (4011148)Time elapsed: 0.015 s
% 3.28/1.18 % (4011148)Peak memory usage: 87 MB
% 3.28/1.18 % (4011148)Instructions burned: 26 (million)
% 3.28/1.18 % (4011149)Instruction limit reached!
% 3.28/1.18 % (4011149)------------------------------
% 3.28/1.18 % (4011149)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.28/1.18 % (4011149)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.28/1.18 % (4011149)CaDiCaL version: 2.1.3
% 3.28/1.18 % (4011149)Termination reason: Instruction limit
% 3.28/1.18 % (4011149)Termination phase: Property scanning
% 3.28/1.18 % (4011149)Time elapsed: 0.015 s
% 3.28/1.18 % (4011149)Peak memory usage: 87 MB
% 3.28/1.18 % (4011149)Instructions burned: 28 (million)
% 3.28/1.18 % (4011157)lrs+10_2_to=lpo:sil=64000:si=on:sos=on:gve=force:lcm=reverse:uwa=one_side_interpreted:random_seed=452767793:i=4:ep=RST:ins=2:rtra=on_2996 on theBenchmark for (2996ds/4Mi)
% 3.28/1.18 % (4011157)Instruction limit reached!
% 3.28/1.18 % (4011157)------------------------------
% 3.28/1.18 % (4011157)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.28/1.18 % (4011157)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.28/1.18 % (4011157)CaDiCaL version: 2.1.3
% 3.28/1.18 % (4011157)Termination reason: Instruction limit
% 3.28/1.18 % (4011157)Termination phase: shuffling
% 3.28/1.18 % (4011157)Time elapsed: 0.002 s
% 3.28/1.18 % (4011157)Peak memory usage: 86 MB
% 3.28/1.18 % (4011157)Instructions burned: 6 (million)
% 3.28/1.18 % (4011155)ott+1002_1_si=on:sp=occurrence:spb=goal:lcm=predicate:random_seed=2987388381:i=2:bd=preordered:nm=2:ins=3:rtra=on:inst=on:tar=off_2996 on theBenchmark for (2996ds/2Mi)
% 3.28/1.18 % (4011132)Refutation found. Thanks to Tanya!
% 3.28/1.18 % SZS status Unsatisfiable for theBenchmark
% 3.28/1.18 % SZS output start Proof for theBenchmark
% See solution above
% 4.11/1.38 % (4011132)------------------------------
% 4.11/1.38 % (4011132)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.11/1.38 % (4011132)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.11/1.38 % (4011132)CaDiCaL version: 2.1.3
% 4.11/1.38 % (4011132)Termination reason: Refutation
% 4.11/1.38 % (4011132)Time elapsed: 0.055 s
% 4.11/1.38 % (4011132)Peak memory usage: 117 MB
% 4.11/1.38 % (4011132)Instructions burned: 50 (million)
% 4.11/1.38 % (4011132)------------------------------
% 4.11/1.38 % (4011132)------------------------------
% 4.11/1.38 % (4010994)Success in time 0.505 s
% 4.11/1.38 % Vampire exiting
%------------------------------------------------------------------------------