%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWW813_1 : TPTP v9.3.1. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 01:37:52 PM UTC 2026
% Result : Unsatisfiable 3.66s 1.29s
% Output : Refutation 4.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 39 ( 10 unt; 0 typ; 4 def)
% Number of atoms : 380 ( 279 equ)
% Maximal formula atoms : 46 ( 9 avg)
% Number of connectives : 458 ( 117 ~; 32 |; 204 &)
% ( 4 <=>; 101 =>; 0 <=; 0 <~>)
% Maximal formula depth : 75 ( 13 avg)
% Maximal term depth : 8 ( 2 avg)
% Number arithmetic : 599 ( 56 atm; 113 fun; 286 num; 144 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 : 276 ( 264 usr; 33 con; 0-9 aty)
% Number of variables : 208 ( 109 !; 99 ?; 208 :)
% 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_unique * c_unique * c_type * c_unique * c_type ) > c_type ).
tff(func_def_59,type,
sK1: ( c_unique * c_unique * c_unique * c_type * c_unique * c_type ) > c_ssorted ).
tff(func_def_60,type,
sK2: ( c_unique * c_unique * c_unique * c_type * c_unique * c_type ) > c_type ).
tff(func_def_61,type,
sK3: ( c_unique * c_unique * c_unique * c_type * c_unique * c_type ) > c_ssorted ).
tff(func_def_62,type,
sK4: ( $int * c_type * c_unique * c_unique ) > c_type ).
tff(func_def_63,type,
sK5: ( $int * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_64,type,
sK6: ( $int * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_65,type,
sK7: ( c_unique * c_unique * c_type * c_unique * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_66,type,
sK8: ( c_unique * c_unique * c_type * c_unique * c_type * c_unique * c_unique ) > c_type ).
tff(func_def_67,type,
sK9: ( c_unique * c_unique * c_type * c_unique * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_68,type,
sK10: ( c_unique * c_unique * c_type * c_unique * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_69,type,
sK11: ( c_unique * c_unique * c_type * c_unique * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_70,type,
sK12: ( c_unique * c_unique * c_type * c_unique * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_71,type,
sK13: ( $int * $int * c_type * c_unique * c_unique * c_unique * c_type ) > c_type ).
tff(func_def_72,type,
sK14: ( $int * $int * c_type * c_unique * c_unique * c_unique * c_type ) > c_unique ).
tff(func_def_73,type,
sK15: ( $int * $int * c_type * c_unique * c_unique * c_unique * c_type ) > $int ).
tff(func_def_74,type,
sK16: ( c_unique * c_type * c_unique * c_unique * c_type ) > c_type ).
tff(func_def_75,type,
sK17: ( c_unique * c_type * c_unique * c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_76,type,
sK18: ( c_unique * c_unique * c_type ) > c_type ).
tff(func_def_77,type,
sK19: ( c_unique * c_type * c_unique ) > c_type ).
tff(func_def_78,type,
sK20: ( c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_79,type,
sK21: ( c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_80,type,
sK22: ( c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_81,type,
sK23: ( c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_82,type,
sK24: ( c_unique * c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_83,type,
sK25: ( c_unique * c_unique * c_unique * c_type ) > c_type ).
tff(func_def_84,type,
sK26: ( c_unique * c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_85,type,
sK27: ( c_type * c_unique * c_type ) > c_unique ).
tff(func_def_86,type,
sK28: ( c_type * c_unique * c_type ) > c_unique ).
tff(func_def_87,type,
sK29: ( c_type * c_unique * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_88,type,
sK30: ( c_type * c_unique * c_type * c_unique * c_unique ) > c_type ).
tff(func_def_89,type,
sK31: ( c_type * c_unique * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_90,type,
sK32: ( c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_91,type,
sK33: ( c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_92,type,
sK34: ( c_unique * c_type * c_unique ) > $int ).
tff(func_def_93,type,
sK35: ( c_unique * c_type * c_unique * $int ) > c_type ).
tff(func_def_94,type,
sK36: ( c_unique * c_type * c_unique * $int ) > c_ssorted ).
tff(func_def_95,type,
sK37: ( c_unique * c_type * c_unique * $int ) > c_ssorted ).
tff(func_def_96,type,
sK38: ( c_unique * c_type * c_unique ) > c_type ).
tff(func_def_97,type,
sK39: ( c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_98,type,
sK40: ( c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_99,type,
sK41: ( c_unique * c_unique * c_unique * c_type ) > c_type ).
tff(func_def_100,type,
sK42: ( c_unique * c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_101,type,
sK43: ( c_unique * c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_102,type,
sK44: ( c_unique * c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_103,type,
sK45: ( c_unique * c_type * c_unique ) > c_type ).
tff(func_def_104,type,
sK46: ( c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_105,type,
sK47: ( c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_106,type,
sK48: ( c_type * c_unique * c_unique * c_type * c_unique ) > c_type ).
tff(func_def_107,type,
sK49: ( c_type * c_unique * c_unique * c_type * c_unique * c_unique * $int ) > c_type ).
tff(func_def_108,type,
sK50: ( c_unique * c_type * c_unique ) > c_type ).
tff(func_def_109,type,
sK51: ( c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_110,type,
sK52: ( c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_111,type,
sK53: ( $int * c_unique * c_unique * c_unique * $int * c_type * c_type ) > c_type ).
tff(func_def_112,type,
sK54: ( $int * c_unique * c_unique * c_unique * $int * c_type * c_type * c_unique * $int ) > c_type ).
tff(func_def_113,type,
sK55: ( c_unique * $int * c_type * c_type * c_unique * $int * $int ) > c_type ).
tff(func_def_114,type,
sK56: ( c_unique * $int * c_type * c_type * c_unique * $int * $int ) > c_type ).
tff(func_def_115,type,
sK57: ( c_unique * $int * c_type * c_type * c_unique * $int * $int ) > c_ssorted ).
tff(func_def_116,type,
sK58: ( c_unique * $int * c_type * c_type * c_unique * $int * $int ) > c_ssorted ).
tff(func_def_117,type,
sK59: ( c_unique * $int * c_type * c_type ) > c_unique ).
tff(func_def_118,type,
sK60: ( c_unique * $int * c_type * c_type ) > c_unique ).
tff(func_def_119,type,
sK61: ( c_unique * $int * c_type * c_type ) > $int ).
tff(func_def_120,type,
sK62: ( c_unique * $int * c_type * c_type ) > $int ).
tff(func_def_121,type,
sK63: ( c_unique * c_type * c_unique * c_unique ) > c_type ).
tff(func_def_122,type,
sK64: ( c_unique * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_123,type,
sK65: ( c_unique * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_124,type,
sK66: ( $int * c_unique * $int * $int * c_unique * c_type ) > c_ssorted ).
tff(func_def_125,type,
sK67: ( $int * c_unique * $int * $int * c_unique * c_type ) > c_ssorted ).
tff(func_def_126,type,
sK68: ( $int * c_unique * c_type * $int * c_unique ) > c_type ).
tff(func_def_127,type,
sK69: ( $int * c_unique * c_type * $int * c_unique ) > c_ssorted ).
tff(func_def_128,type,
sK70: ( $int * c_unique * c_type * $int * c_unique ) > c_ssorted ).
tff(func_def_129,type,
sK71: ( $int * c_unique * c_type ) > c_type ).
tff(func_def_130,type,
sK72: ( $int * c_unique * c_type ) > c_ssorted ).
tff(func_def_131,type,
sK73: ( c_unique * c_unique * c_unique * c_type ) > c_type ).
tff(func_def_132,type,
sK74: ( c_unique * c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_133,type,
sK75: ( c_unique * c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_134,type,
sK76: ( c_unique * c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_135,type,
sK77: ( c_type * c_unique * c_type * $int ) > c_unique ).
tff(func_def_136,type,
sK78: ( c_type * c_unique * c_type * $int ) > c_unique ).
tff(func_def_137,type,
sK79: ( c_type * c_unique * c_type * $int * c_unique * c_unique ) > c_ssorted ).
tff(func_def_138,type,
sK80: ( c_type * c_unique * c_type * $int * c_unique * c_unique ) > c_ssorted ).
tff(func_def_139,type,
sK81: ( c_type * c_unique * c_type * $int * c_unique * c_unique ) > c_type ).
tff(func_def_140,type,
sK82: ( c_unique * c_unique * $int * $int * c_type ) > c_ssorted ).
tff(func_def_141,type,
sK83: ( c_unique * c_unique * $int * $int * c_type ) > c_ssorted ).
tff(func_def_142,type,
sK84: ( c_unique * c_type * c_unique * c_type ) > c_type ).
tff(func_def_143,type,
sK85: ( c_unique * c_type * c_unique * c_type * c_unique * c_unique ) > c_type ).
tff(func_def_144,type,
sK86: ( c_unique * c_type * c_unique * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_145,type,
sK87: ( c_unique * c_type * c_unique * c_type ) > c_unique ).
tff(func_def_146,type,
sK88: ( c_unique * c_type * c_unique * c_type ) > c_unique ).
tff(func_def_147,type,
sK89: ( c_type * c_unique * $int * c_unique * c_type ) > c_type ).
tff(func_def_148,type,
sK90: ( c_type * c_unique * $int * c_unique * c_type ) > $int ).
tff(func_def_149,type,
sK91: ( c_type * c_unique * $int * c_unique * c_type ) > c_unique ).
tff(func_def_150,type,
sK92: ( c_type * c_unique * $int * c_unique * c_type ) > c_unique ).
tff(func_def_151,type,
sK93: ( c_type * c_unique * $int * c_unique * c_type * $int * c_unique * c_unique ) > c_type ).
tff(func_def_152,type,
sK94: ( c_type * c_unique * $int * c_unique * c_type * $int * c_unique * c_unique ) > c_type ).
tff(func_def_153,type,
sK95: ( $int * c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_154,type,
sK96: ( $int * c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_155,type,
sK97: ( $int * c_unique * c_type * c_unique ) > $int ).
tff(func_def_156,type,
sK98: ( c_type * c_unique * c_unique ) > c_type ).
tff(func_def_157,type,
sK99: ( c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_158,type,
sK100: ( c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_159,type,
sK101: ( c_unique * c_unique * c_type * c_type * c_unique ) > c_type ).
tff(func_def_160,type,
sK102: ( c_unique * c_unique * c_type * c_type * c_unique ) > c_unique ).
tff(func_def_161,type,
sK103: ( c_unique * c_type * $int * c_unique ) > c_type ).
tff(func_def_162,type,
sK104: $int > $int ).
tff(func_def_163,type,
sK105: ( c_unique * c_type * c_unique * c_type * c_unique ) > c_type ).
tff(func_def_164,type,
sK106: ( c_unique * c_type * c_unique * c_type * c_unique ) > c_ssorted ).
tff(func_def_165,type,
sK107: ( c_type * c_unique * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_166,type,
sK108: ( c_type * c_unique * c_unique * c_type * c_unique * c_unique ) > c_type ).
tff(func_def_167,type,
sK109: ( c_type * c_unique * c_unique * c_type * c_unique * c_unique * c_unique ) > c_ssorted ).
tff(func_def_168,type,
sK110: ( c_type * c_unique * c_unique * c_type * c_unique * c_unique ) > c_unique ).
tff(func_def_169,type,
sK111: ( c_type * c_unique * c_unique * $int ) > c_type ).
tff(func_def_170,type,
sK112: ( c_type * c_unique * c_unique * $int ) > c_unique ).
tff(func_def_171,type,
sK113: ( c_type * c_unique * c_unique * $int ) > $int ).
tff(func_def_172,type,
sK114: ( c_unique * c_type * c_unique * c_type * $int * c_unique ) > c_type ).
tff(func_def_173,type,
sK115: ( c_unique * c_type * c_unique * c_type * $int * c_unique ) > c_ssorted ).
tff(func_def_174,type,
sK116: ( c_unique * c_type * c_unique * c_type * $int * c_unique ) > c_ssorted ).
tff(func_def_175,type,
sK117: ( c_unique * c_type * c_unique * c_type * $int * c_unique ) > c_ssorted ).
tff(func_def_176,type,
sK118: ( c_unique * c_unique * c_type ) > c_type ).
tff(func_def_177,type,
sK119: ( c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_178,type,
sK120: ( c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_179,type,
sK121: ( $int * c_type * c_unique * c_unique * c_unique * c_type ) > c_type ).
tff(func_def_180,type,
sK122: ( $int * c_type * c_unique * c_unique * c_unique * c_type ) > c_unique ).
tff(func_def_181,type,
sK123: ( $int * c_type * c_unique * c_unique * c_unique * c_type ) > $int ).
tff(func_def_182,type,
sK124: ( c_unique * $int * c_unique * c_type * $int ) > c_type ).
tff(func_def_183,type,
sK125: ( c_unique * $int * c_unique * c_type * $int ) > c_ssorted ).
tff(func_def_184,type,
sK126: ( c_unique * $int * c_unique * c_type * $int ) > c_ssorted ).
tff(func_def_185,type,
sK127: ( c_type * c_unique * c_unique ) > c_type ).
tff(func_def_186,type,
sK128: ( c_type * c_unique * c_unique ) > c_unique ).
tff(func_def_187,type,
sK129: ( c_type * c_type * c_unique * c_unique ) > c_type ).
tff(func_def_188,type,
sK130: ( c_type * c_type * c_unique * c_unique * c_unique * c_unique ) > c_type ).
tff(func_def_189,type,
sK131: ( c_type * c_type * c_unique * c_unique * c_unique * c_unique ) > c_type ).
tff(func_def_190,type,
sK132: ( c_type * c_type * c_unique * c_unique ) > c_unique ).
tff(func_def_191,type,
sK133: ( c_type * c_type * c_unique * c_unique ) > c_unique ).
tff(func_def_192,type,
sK134: ( c_unique * c_unique * c_type * c_unique * c_type * $int ) > c_type ).
tff(func_def_193,type,
sK135: ( c_unique * c_unique * c_type * c_unique * c_type * $int ) > c_unique ).
tff(func_def_194,type,
sK136: ( c_unique * c_unique * c_type * c_unique * c_type * $int ) > $int ).
tff(func_def_195,type,
sK137: ( $int * c_type * c_unique * c_unique * c_type * c_unique ) > c_type ).
tff(func_def_196,type,
sK138: ( $int * c_type * c_unique * c_unique * c_type * c_unique * c_unique * $int ) > c_type ).
tff(func_def_197,type,
sK139: ( c_unique * $int * c_unique * $int * c_type ) > c_ssorted ).
tff(func_def_198,type,
sK140: ( c_unique * $int * c_unique * $int * c_type ) > c_ssorted ).
tff(func_def_199,type,
sK141: ( c_unique * $int * c_unique * $int * c_type ) > $int ).
tff(func_def_200,type,
sK142: ( c_unique * c_type * $int * $int * $int * c_unique ) > c_type ).
tff(func_def_201,type,
sK143: ( c_unique * c_type * $int * $int * $int * c_unique ) > c_ssorted ).
tff(func_def_202,type,
sK144: ( c_unique * c_type * $int * $int * $int * c_unique ) > c_ssorted ).
tff(func_def_203,type,
sK145: ( $int * c_unique * c_type * c_type * c_unique ) > c_type ).
tff(func_def_204,type,
sK146: ( $int * c_unique * c_type * c_type * c_unique * c_unique * $int ) > c_type ).
tff(func_def_205,type,
sK147: ( $int * c_unique * c_type * c_type * c_unique * c_unique * $int ) > c_type ).
tff(func_def_206,type,
sK148: ( $int * c_unique * c_type * c_type * c_unique * c_unique * $int ) > c_ssorted ).
tff(func_def_207,type,
sK149: ( $int * c_unique * c_type * c_type * c_unique ) > c_unique ).
tff(func_def_208,type,
sK150: ( $int * c_unique * c_type * c_type * c_unique ) > c_unique ).
tff(func_def_209,type,
sK151: ( $int * c_unique * c_type * c_type * c_unique ) > $int ).
tff(func_def_210,type,
sK152: ( c_unique * $int * c_unique * c_unique * c_type * c_type ) > c_type ).
tff(func_def_211,type,
sK153: ( c_unique * $int * c_unique * c_unique * c_type * c_type * c_unique * $int ) > c_type ).
tff(func_def_212,type,
sK154: ( c_unique * c_unique * c_type * $int * $int * c_unique ) > c_ssorted ).
tff(func_def_213,type,
sK155: ( c_type * c_unique * c_unique * c_unique ) > c_ssorted ).
tff(func_def_214,type,
sK156: ( c_unique * c_unique * c_unique ) > c_ssorted ).
tff(func_def_215,type,
sK157: ( c_unique * c_unique * c_unique ) > c_ssorted ).
tff(func_def_216,type,
sK158: ( c_unique * c_unique * c_unique ) > c_ssorted ).
tff(func_def_217,type,
sK159: ( c_type * $int * c_unique * $int * c_unique ) > c_type ).
tff(func_def_218,type,
sK160: ( c_type * $int * c_unique * $int * c_unique ) > c_unique ).
tff(func_def_219,type,
sK161: ( c_type * $int * c_unique * $int * c_unique ) > $int ).
tff(func_def_220,type,
sK162: ( c_unique * c_type * c_unique ) > c_type ).
tff(func_def_221,type,
sK163: ( c_unique * c_type * c_unique * c_unique ) > c_type ).
tff(func_def_222,type,
sK164: ( c_unique * c_type * c_unique * c_unique ) > c_ssorted ).
tff(func_def_223,type,
sK165: ( c_unique * c_type ) > c_ssorted ).
tff(func_def_224,type,
sK166: ( $int * c_type * c_unique * c_unique * $int ) > c_type ).
tff(func_def_225,type,
sK167: ( c_unique * c_unique * c_type ) > c_type ).
tff(func_def_226,type,
sK168: ( c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_227,type,
sK169: ( c_unique * c_unique * c_type ) > c_ssorted ).
tff(func_def_228,type,
sK170: c_unique > c_ssorted ).
tff(func_def_229,type,
sK171: ( c_type * c_unique * $int * c_unique ) > c_type ).
tff(func_def_230,type,
sK172: ( c_unique * c_unique * c_unique * c_type * c_type ) > c_type ).
tff(func_def_231,type,
sK173: ( c_unique * c_unique * c_unique * c_type * c_type ) > c_unique ).
tff(func_def_232,type,
sK174: ( c_unique * c_unique * c_unique * c_type * c_type ) > $int ).
tff(func_def_233,type,
sK175: ( c_unique * c_type * c_unique * $int * c_unique ) > c_ssorted ).
tff(func_def_234,type,
sK176: ( c_unique * c_unique * $int * c_type ) > c_type ).
tff(func_def_235,type,
sK177: ( c_unique * c_unique * $int * c_type ) > c_unique ).
tff(func_def_236,type,
sK178: ( c_unique * c_unique * $int * c_type ) > $int ).
tff(func_def_237,type,
sK179: ( c_type * $int * c_unique ) > c_type ).
tff(func_def_238,type,
sK180: ( c_type * $int * c_unique ) > c_ssorted ).
tff(func_def_239,type,
sK181: ( c_type * c_unique * $int * $int ) > c_type ).
tff(func_def_240,type,
sK182: ( c_type * c_unique * $int * $int ) > c_ssorted ).
tff(func_def_241,type,
sK183: $int ).
tff(func_def_242,type,
sK184: c_unique ).
tff(func_def_243,type,
sK185: c_unique ).
tff(func_def_244,type,
sK186: $int ).
tff(func_def_245,type,
sK187: $int ).
tff(func_def_246,type,
sK188: $int ).
tff(func_def_247,type,
sK189: c_unique ).
tff(func_def_248,type,
sK190: $int > c_type ).
tff(func_def_249,type,
sK191: $int ).
tff(func_def_250,type,
sK192: $int ).
tff(func_def_251,type,
sK193: $int ).
tff(func_def_252,type,
sK194: $int ).
tff(func_def_253,type,
sK195: $int ).
tff(func_def_254,type,
sK196: $int ).
tff(func_def_255,type,
sK197: c_unique ).
tff(func_def_256,type,
sK198: $int ).
tff(func_def_257,type,
sK199: c_unique ).
tff(func_def_258,type,
sK200: c_type > c_unique ).
tff(func_def_259,type,
sK201: c_type > $int ).
tff(func_def_260,type,
sK202: c_type > c_unique ).
tff(func_def_261,type,
sK203: c_type > $int ).
tff(func_def_262,type,
sK204: c_type > $int ).
tff(func_def_263,type,
sK205: c_type > c_unique ).
tff(func_def_264,type,
sK206: c_type > $int ).
tff(func_def_265,type,
sK207: c_type > $int ).
tff(func_def_266,type,
sK208: c_type > $int ).
tff(func_def_267,type,
sK209: c_type > $int ).
tff(func_def_268,type,
sK210: c_type > $int ).
tff(func_def_269,type,
sK211: c_type > $int ).
tff(func_def_270,type,
sK212: c_type > $int ).
tff(func_def_271,type,
sK213: c_type > $int ).
tff(func_def_272,type,
sK214: ( c_unique * c_type * c_unique ) > c_type ).
tff(func_def_273,type,
sK215: ( c_unique * c_unique * $int * c_type * $int ) > c_type ).
tff(func_def_274,type,
sK216: ( c_unique * c_unique * $int * c_type * $int ) > c_ssorted ).
tff(func_def_275,type,
sK217: ( c_unique * c_unique * $int * c_type * $int ) > 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(f98,axiom,
! [X0: $int] :
( ( '%'(X0,14) = 0 )
=> ( '%'($difference(X0,14),14) = 0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',formula_98) ).
tff(f101,axiom,
~ ! [X0: $int,X4: c_unique,X1: c_unique,X3: $int,X2: $int] :
( ( ( X0 = 10000 )
& ( X3 = 2800 )
& valid_range(c_sort(type_alloc_table,X1),c_sort(type_pointer(type_global),X4),0,2800)
& ( X2 = 0 ) )
=> ! [X5: $int,X6: c_unique] :
( ( $lesseq(0,X5)
& ! [X7: $int] :
? [X8: c_type] :
( ( X8 = type_pointer(type_global) )
& ( ( $lesseq(0,X7)
& $less(X7,X5) )
=> ( ss2Int(c_sort(c_int,acc(c_sort(type_memory(c_int,type_global),X6),c_sort(X8,shift(c_sort(X8,X4),X7))))) = 2000 ) ) )
& $lesseq(X5,2800) )
=> ( ( $difference(X5,X3) = 0 )
=> ! [X9: $int] :
( ( $lesseq(X9,2800)
& ( '%'(X9,14) = 0 )
& $lesseq(0,X9) )
=> ! [X10: $int] :
( ( X10 = 0 )
=> ! [X11: $int] :
( ( X11 = $product(X9,2) )
=> ( ( X11 != 0 )
=> ! [X12: $int] :
( ( X12 = X9 )
=> ! [X14: $int,X15: $int,X13: $int,X16: c_unique] :
( ( ( X15 = $product(X13,2) )
& $lesseq(1,X13)
& $lesseq(X13,X9) )
=> ( ( 1 != 0 )
=> ! [X17: c_unique] :
? [X18: c_type] :
( ( ( 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 = $difference(X9,14) )
=> ( ( X0 != 0 )
=> ! [X30: $int] :
( ( X30 = whydivide(X27,X0) )
=> ( ( X0 != 0 )
=> ! [X31: $int] :
( ( X31 = '%'(X27,X0) )
=> ! [X32: $int] :
( ( X32 = X31 )
=> ( '%'(X29,14) = 0 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) )
& ( X18 = type_pointer(type_global) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',formula_101) ).
tff(f102,plain,
~ ! [X0: $int,X4: c_unique,X1: c_unique,X3: $int,X2: $int] :
( ( ( X0 = 10000 )
& ( X3 = 2800 )
& valid_range(c_sort(type_alloc_table,X1),c_sort(type_pointer(type_global),X4),0,2800)
& ( X2 = 0 ) )
=> ! [X5: $int,X6: c_unique] :
( ( ~ $less(X5,0)
& ! [X7: $int] :
? [X8: c_type] :
( ( X8 = type_pointer(type_global) )
& ( ( ~ $less(X7,0)
& $less(X7,X5) )
=> ( ss2Int(c_sort(c_int,acc(c_sort(type_memory(c_int,type_global),X6),c_sort(X8,shift(c_sort(X8,X4),X7))))) = 2000 ) ) )
& ~ $less(2800,X5) )
=> ( ( 0 = $sum(X5,$uminus(X3)) )
=> ! [X9: $int] :
( ( ~ $less(2800,X9)
& ~ $less(X9,0)
& ( '%'(X9,14) = 0 ) )
=> ! [X10: $int] :
( ( X10 = 0 )
=> ! [X11: $int] :
( ( X11 = $product(X9,2) )
=> ( ( X11 != 0 )
=> ! [X12: $int] :
( ( X12 = X9 )
=> ! [X14: $int,X15: $int,X13: $int,X16: c_unique] :
( ( ( X15 = $product(X13,2) )
& ~ $less(X13,1)
& ~ $less(X9,X13) )
=> ( ( 1 != 0 )
=> ! [X17: c_unique] :
? [X18: c_type] :
( ( ( 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] :
( ( $sum(X9,$uminus(14)) = X29 )
=> ( ( X0 != 0 )
=> ! [X30: $int] :
( ( X30 = whydivide(X27,X0) )
=> ( ( X0 != 0 )
=> ! [X31: $int] :
( ( X31 = '%'(X27,X0) )
=> ! [X32: $int] :
( ( X32 = X31 )
=> ( '%'(X29,14) = 0 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) )
& ( X18 = type_pointer(type_global) ) ) ) ) ) ) ) ) ) ) ) ),
inference(theory_normalization,[],[f101]) ).
tff(f115,plain,
! [X0: $int] :
( ( '%'(X0,14) = 0 )
=> ( 0 = '%'($sum(X0,$uminus(14)),14) ) ),
inference(theory_normalization,[],[f98]) ).
tff(f136,plain,
~ ! [X1: c_unique,X4: $int,X2: c_unique,X3: $int,X0: $int] :
( ( ( X3 = 2800 )
& valid_range(c_sort(type_alloc_table,X2),c_sort(type_pointer(type_global),X1),0,2800)
& ( X0 = 10000 )
& ( 0 = X4 ) )
=> ! [X6: c_unique,X5: $int] :
( ( ! [X7: $int] :
? [X8: c_type] :
( ( X8 = type_pointer(type_global) )
& ( ( ~ $less(X7,0)
& $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,X1),X7))))) ) ) )
& ~ $less(2800,X5)
& ~ $less(X5,0) )
=> ( ( 0 = $sum(X5,$uminus(X3)) )
=> ! [X9: $int] :
( ( ~ $less(2800,X9)
& ~ $less(X9,0)
& ( '%'(X9,14) = 0 ) )
=> ! [X10: $int] :
( ( X10 = 0 )
=> ! [X11: $int] :
( ( X11 = $product(X9,2) )
=> ( ( X11 != 0 )
=> ! [X12: $int] :
( ( X12 = X9 )
=> ! [X14: $int,X15: $int,X16: c_unique,X13: $int] :
( ( ~ $less(X15,1)
& ( $product(X15,2) = X14 )
& ~ $less(X9,X15) )
=> ( ( 1 != 0 )
=> ! [X17: c_unique] :
? [X18: c_type] :
( ( ( shift(c_sort(X18,X1),X15) = X17 )
=> ( valid(c_sort(type_alloc_table,X2),c_sort(X18,X17))
=> ! [X19: c_unique] :
( ( X19 = acc(c_sort(type_memory(c_int,type_global),X16),c_sort(X18,X17)) )
=> ! [X20: $int] :
( ( $sum(X13,$product(ss2Int(c_sort(c_int,X19)),X0)) = X20 )
=> ! [X21: c_unique] :
( ( shift(c_sort(X18,X1),X15) = X21 )
=> ! [X22: $int] :
( ( $sum(X14,$uminus(1)) = X22 )
=> ( ( X22 != 0 )
=> ! [X23: $int] :
( ( X23 = '%'(X20,X22) )
=> ( valid(c_sort(type_alloc_table,X2),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(X15,$uminus(1)) = X28 )
=> ( ( X28 = 0 )
=> ! [X29: $int] :
( ( $sum(X9,$uminus(14)) = X29 )
=> ( ( X0 != 0 )
=> ! [X30: $int] :
( ( X30 = whydivide(X27,X0) )
=> ( ( X0 != 0 )
=> ! [X31: $int] :
( ( X31 = '%'(X27,X0) )
=> ! [X32: $int] :
( ( X32 = X31 )
=> ( '%'(X29,14) = 0 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) )
& ( X18 = type_pointer(type_global) ) ) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f102]) ).
tff(f235,plain,
! [X0: $int] :
( ( 0 = '%'($sum(X0,$uminus(14)),14) )
| ( 0 != '%'(X0,14) ) ),
inference(ennf_transformation,[],[f115]) ).
tff(f258,plain,
? [X1: c_unique,X4: $int,X2: c_unique,X3: $int,X0: $int] :
( ? [X6: c_unique,X5: $int] :
( ? [X9: $int] :
( ? [X10: $int] :
( ? [X11: $int] :
( ? [X12: $int] :
( ? [X14: $int,X15: $int,X16: c_unique,X13: $int] :
( ? [X17: c_unique] :
! [X18: c_type] :
( ( ? [X19: c_unique] :
( ? [X20: $int] :
( ? [X21: c_unique] :
( ? [X22: $int] :
( ? [X23: $int] :
( ? [X24: c_unique] :
( ? [X25: $int] :
( ? [X26: $int] :
( ? [X27: $int] :
( ? [X28: $int] :
( ? [X29: $int] :
( ? [X30: $int] :
( ? [X31: $int] :
( ? [X32: $int] :
( ( X32 = X31 )
& ( 0 != '%'(X29,14) ) )
& ( X31 = '%'(X27,X0) ) )
& ( X0 != 0 )
& ( X30 = whydivide(X27,X0) ) )
& ( X0 != 0 )
& ( $sum(X9,$uminus(14)) = X29 ) )
& ( X28 = 0 )
& ( $sum(X15,$uminus(1)) = X28 ) )
& ( X27 = X26 ) )
& ( X26 = whydivide(X20,X22) ) )
& ( X22 != 0 )
& ( $sum(X22,$uminus(1)) = X25 ) )
& ( X24 = upd(c_sort(type_memory(c_int,type_global),X16),c_sort(X18,X21),c_sort(c_int,int2U(X23))) ) )
& valid(c_sort(type_alloc_table,X2),c_sort(X18,X21))
& ( X23 = '%'(X20,X22) ) )
& ( X22 != 0 )
& ( $sum(X14,$uminus(1)) = X22 ) )
& ( shift(c_sort(X18,X1),X15) = X21 ) )
& ( $sum(X13,$product(ss2Int(c_sort(c_int,X19)),X0)) = X20 ) )
& ( X19 = acc(c_sort(type_memory(c_int,type_global),X16),c_sort(X18,X17)) ) )
& valid(c_sort(type_alloc_table,X2),c_sort(X18,X17))
& ( shift(c_sort(X18,X1),X15) = X17 ) )
| ( type_pointer(type_global) != X18 ) )
& ( 1 != 0 )
& ~ $less(X15,1)
& ( $product(X15,2) = X14 )
& ~ $less(X9,X15) )
& ( X12 = X9 ) )
& ( X11 != 0 )
& ( X11 = $product(X9,2) ) )
& ( X10 = 0 ) )
& ~ $less(2800,X9)
& ~ $less(X9,0)
& ( '%'(X9,14) = 0 ) )
& ( 0 = $sum(X5,$uminus(X3)) )
& ! [X7: $int] :
? [X8: c_type] :
( ( X8 = type_pointer(type_global) )
& ( ( 2000 = ss2Int(c_sort(c_int,acc(c_sort(type_memory(c_int,type_global),X6),c_sort(X8,shift(c_sort(X8,X1),X7))))) )
| $less(X7,0)
| ~ $less(X7,X5) ) )
& ~ $less(2800,X5)
& ~ $less(X5,0) )
& ( X3 = 2800 )
& valid_range(c_sort(type_alloc_table,X2),c_sort(type_pointer(type_global),X1),0,2800)
& ( X0 = 10000 )
& ( 0 = X4 ) ),
inference(ennf_transformation,[],[f136]) ).
tff(f259,plain,
? [X0: $int,X2: c_unique,X1: c_unique,X3: $int,X4: $int] :
( ( X3 = 2800 )
& ( X0 = 10000 )
& valid_range(c_sort(type_alloc_table,X2),c_sort(type_pointer(type_global),X1),0,2800)
& ( 0 = X4 )
& ? [X5: $int,X6: c_unique] :
( ! [X7: $int] :
? [X8: c_type] :
( ( $less(X7,0)
| ( 2000 = ss2Int(c_sort(c_int,acc(c_sort(type_memory(c_int,type_global),X6),c_sort(X8,shift(c_sort(X8,X1),X7))))) )
| ~ $less(X7,X5) )
& ( X8 = type_pointer(type_global) ) )
& ~ $less(X5,0)
& ~ $less(2800,X5)
& ? [X9: $int] :
( ~ $less(X9,0)
& ? [X10: $int] :
( ? [X11: $int] :
( ( X11 = $product(X9,2) )
& ? [X12: $int] :
( ( X12 = X9 )
& ? [X15: $int,X14: $int,X16: c_unique,X13: $int] :
( ~ $less(X15,1)
& ~ $less(X9,X15)
& ? [X17: c_unique] :
! [X18: c_type] :
( ( ? [X19: c_unique] :
( ( X19 = acc(c_sort(type_memory(c_int,type_global),X16),c_sort(X18,X17)) )
& ? [X20: $int] :
( ( $sum(X13,$product(ss2Int(c_sort(c_int,X19)),X0)) = X20 )
& ? [X21: c_unique] :
( ( shift(c_sort(X18,X1),X15) = X21 )
& ? [X22: $int] :
( ? [X23: $int] :
( ? [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 )
& ? [X26: $int] :
( ( X26 = whydivide(X20,X22) )
& ? [X27: $int] :
( ? [X28: $int] :
( ( $sum(X15,$uminus(1)) = X28 )
& ( X28 = 0 )
& ? [X29: $int] :
( ( $sum(X9,$uminus(14)) = X29 )
& ? [X30: $int] :
( ( X30 = whydivide(X27,X0) )
& ( X0 != 0 )
& ? [X31: $int] :
( ? [X32: $int] :
( ( X32 = X31 )
& ( 0 != '%'(X29,14) ) )
& ( X31 = '%'(X27,X0) ) ) )
& ( X0 != 0 ) ) )
& ( X27 = X26 ) ) )
& ( X22 != 0 ) ) )
& ( X23 = '%'(X20,X22) )
& valid(c_sort(type_alloc_table,X2),c_sort(X18,X21)) )
& ( X22 != 0 )
& ( $sum(X14,$uminus(1)) = X22 ) ) ) ) )
& valid(c_sort(type_alloc_table,X2),c_sort(X18,X17))
& ( shift(c_sort(X18,X1),X15) = X17 ) )
| ( type_pointer(type_global) != X18 ) )
& ( $product(X15,2) = X14 )
& ( 1 != 0 ) ) )
& ( X11 != 0 ) )
& ( X10 = 0 ) )
& ( '%'(X9,14) = 0 )
& ~ $less(2800,X9) )
& ( 0 = $sum(X5,$uminus(X3)) ) ) ),
inference(flattening,[],[f258]) ).
tff(f460,plain,
? [X0: $int,X1: c_unique,X2: c_unique,X3: $int,X4: $int] :
( ( X3 = 2800 )
& ( X0 = 10000 )
& valid_range(c_sort(type_alloc_table,X1),c_sort(type_pointer(type_global),X2),0,2800)
& ( 0 = X4 )
& ? [X5: $int,X6: c_unique] :
( ! [X7: $int] :
? [X8: c_type] :
( ( $less(X7,0)
| ( 2000 = ss2Int(c_sort(c_int,acc(c_sort(type_memory(c_int,type_global),X6),c_sort(X8,shift(c_sort(X8,X2),X7))))) )
| ~ $less(X7,X5) )
& ( X8 = type_pointer(type_global) ) )
& ~ $less(X5,0)
& ~ $less(2800,X5)
& ? [X9: $int] :
( ~ $less(X9,0)
& ? [X10: $int] :
( ? [X11: $int] :
( ( X11 = $product(X9,2) )
& ? [X12: $int] :
( ( X12 = X9 )
& ? [X13: $int,X14: $int,X15: c_unique,X16: $int] :
( ~ $less(X13,1)
& ~ $less(X9,X13)
& ? [X17: c_unique] :
! [X18: c_type] :
( ( ? [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)),X0)) = X20 )
& ? [X21: c_unique] :
( ( shift(c_sort(X18,X2),X13) = X21 )
& ? [X22: $int] :
( ? [X23: $int] :
( ? [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 )
& ? [X26: $int] :
( ( X26 = whydivide(X20,X22) )
& ? [X27: $int] :
( ? [X28: $int] :
( ( $sum(X13,$uminus(1)) = X28 )
& ( X28 = 0 )
& ? [X29: $int] :
( ( $sum(X9,$uminus(14)) = X29 )
& ? [X30: $int] :
( ( X30 = whydivide(X27,X0) )
& ( X0 != 0 )
& ? [X31: $int] :
( ? [X32: $int] :
( ( X32 = X31 )
& ( 0 != '%'(X29,14) ) )
& ( X31 = '%'(X27,X0) ) ) )
& ( X0 != 0 ) ) )
& ( X27 = X26 ) ) )
& ( X22 != 0 ) ) )
& ( X23 = '%'(X20,X22) )
& valid(c_sort(type_alloc_table,X1),c_sort(X18,X21)) )
& ( X22 != 0 )
& ( $sum(X14,$uminus(1)) = X22 ) ) ) ) )
& valid(c_sort(type_alloc_table,X1),c_sort(X18,X17))
& ( shift(c_sort(X18,X2),X13) = X17 ) )
| ( type_pointer(type_global) != X18 ) )
& ( $product(X13,2) = X14 )
& ( 1 != 0 ) ) )
& ( X11 != 0 ) )
& ( X10 = 0 ) )
& ( '%'(X9,14) = 0 )
& ~ $less(2800,X9) )
& ( 0 = $sum(X5,$uminus(X3)) ) ) ),
inference(rectify,[],[f259]) ).
tff(f461,plain,
( ( 2800 = sK186 )
& ( 10000 = sK183 )
& valid_range(c_sort(type_alloc_table,sK184),c_sort(type_pointer(type_global),sK185),0,2800)
& ( 0 = sK187 )
& ! [X7: $int] :
( ( $less(X7,0)
| ( 2000 = ss2Int(c_sort(c_int,acc(c_sort(type_memory(c_int,type_global),sK189),c_sort(sK190(X7),shift(c_sort(sK190(X7),sK185),X7))))) )
| ~ $less(X7,sK188) )
& ( type_pointer(type_global) = sK190(X7) ) )
& ~ $less(sK188,0)
& ~ $less(2800,sK188)
& ~ $less(sK191,0)
& ( sK193 = $product(sK191,2) )
& ( sK191 = sK194 )
& ~ $less(sK195,1)
& ~ $less(sK191,sK195)
& ! [X18: c_type] :
( ( ( acc(c_sort(type_memory(c_int,type_global),sK197),c_sort(X18,sK199)) = sK200(X18) )
& ( sK201(X18) = $sum(sK198,$product(ss2Int(c_sort(c_int,sK200(X18))),sK183)) )
& ( sK202(X18) = shift(c_sort(X18,sK185),sK195) )
& ( upd(c_sort(type_memory(c_int,type_global),sK197),c_sort(X18,sK202(X18)),c_sort(c_int,int2U(sK204(X18)))) = sK205(X18) )
& ( $sum(sK203(X18),$uminus(1)) = sK206(X18) )
& ( whydivide(sK201(X18),sK203(X18)) = sK207(X18) )
& ( sK209(X18) = $sum(sK195,$uminus(1)) )
& ( 0 = sK209(X18) )
& ( sK210(X18) = $sum(sK191,$uminus(14)) )
& ( whydivide(sK208(X18),sK183) = sK211(X18) )
& ( 0 != sK183 )
& ( sK213(X18) = sK212(X18) )
& ( 0 != '%'(sK210(X18),14) )
& ( sK212(X18) = '%'(sK208(X18),sK183) )
& ( 0 != sK183 )
& ( sK207(X18) = sK208(X18) )
& ( 0 != sK203(X18) )
& ( sK204(X18) = '%'(sK201(X18),sK203(X18)) )
& valid(c_sort(type_alloc_table,sK184),c_sort(X18,sK202(X18)))
& ( 0 != sK203(X18) )
& ( $sum(sK196,$uminus(1)) = sK203(X18) )
& valid(c_sort(type_alloc_table,sK184),c_sort(X18,sK199))
& ( sK199 = shift(c_sort(X18,sK185),sK195) ) )
| ( type_pointer(type_global) != X18 ) )
& ( sK196 = $product(sK195,2) )
& ( 1 != 0 )
& ( 0 != sK193 )
& ( 0 = sK192 )
& ( 0 = '%'(sK191,14) )
& ~ $less(2800,sK191)
& ( 0 = $sum(sK188,$uminus(sK186)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK183,sK184,sK185,sK186,sK187,sK188,sK189,sK190,sK191,sK192,sK193,sK194,sK195,sK196,sK197,sK198,sK199,sK200,sK201,sK202,sK203,sK204,sK205,sK206,sK207,sK208,sK209,sK210,sK211,sK212,sK213]),skolemize(X0,sK183),skolemize(X1,sK184),skolemize(X2,sK185),skolemize(X3,sK186),skolemize(X4,sK187),skolemize(X5,sK188),skolemize(X6,sK189),skolemize(X8,sK190(X7)),skolemize(X9,sK191),skolemize(X10,sK192),skolemize(X11,sK193),skolemize(X12,sK194),skolemize(X13,sK195),skolemize(X14,sK196),skolemize(X15,sK197),skolemize(X16,sK198),skolemize(X17,sK199),skolemize(X19,sK200(X18)),skolemize(X20,sK201(X18)),skolemize(X21,sK202(X18)),skolemize(X22,sK203(X18)),skolemize(X23,sK204(X18)),skolemize(X24,sK205(X18)),skolemize(X25,sK206(X18)),skolemize(X26,sK207(X18)),skolemize(X27,sK208(X18)),skolemize(X28,sK209(X18)),skolemize(X29,sK210(X18)),skolemize(X30,sK211(X18)),skolemize(X31,sK212(X18)),skolemize(X32,sK213(X18))],[f460]) ).
tff(f671,plain,
! [X0: $int] :
( ( 0 != '%'(X0,14) )
| ( 0 = '%'($sum(X0,$uminus(14)),14) ) ),
inference(cnf_transformation,[],[f235]) ).
tff(f771,plain,
0 = '%'(sK191,14),
inference(cnf_transformation,[],[f461]) ).
tff(f786,plain,
! [X18: c_type] :
( ( 0 != '%'(sK210(X18),14) )
| ( type_pointer(type_global) != X18 ) ),
inference(cnf_transformation,[],[f461]) ).
tff(f790,plain,
! [X18: c_type] :
( ( sK210(X18) = $sum(sK191,$uminus(14)) )
| ( type_pointer(type_global) != X18 ) ),
inference(cnf_transformation,[],[f461]) ).
tff(f801,plain,
sK191 = sK194,
inference(cnf_transformation,[],[f461]) ).
tff(f987,plain,
! [X18: c_type] :
( ( sK210(X18) = $sum(sK194,$uminus(14)) )
| ( type_pointer(type_global) != X18 ) ),
inference(definition_unfolding,[],[f790,f801]) ).
tff(f992,plain,
0 = '%'(sK194,14),
inference(definition_unfolding,[],[f771,f801]) ).
tff(f1088,plain,
$sum(sK194,$uminus(14)) = sK210(type_pointer(type_global)),
inference(equality_resolution,[],[f987]) ).
tff(f1092,plain,
0 != '%'(sK210(type_pointer(type_global)),14),
inference(equality_resolution,[],[f786]) ).
tff(f1104,plain,
$sum(sK194,-14) = sK210(type_pointer(type_global)),
inference(evaluation,[],[f1088]) ).
tff(f1108,plain,
! [X0: $int] :
( ( 0 = '%'($sum(X0,-14),14) )
| ( 0 != '%'(X0,14) ) ),
inference(evaluation,[],[f671]) ).
tff(f1128,definition,
( spl218_4
<=> ( $sum(sK194,-14) = sK210(type_pointer(type_global)) ) ),
introduced(definition,[new_symbols(definition,[spl218_4])],[avatar_definition]) ).
tff(f1130,plain,
( ( $sum(sK194,-14) = sK210(type_pointer(type_global)) )
| ~ spl218_4 ),
inference(avatar_component_clause,[],[f1128]) ).
tff(f1131,plain,
spl218_4,
inference(avatar_split_clause,[],[f1104,f1128]) ).
tff(f1163,definition,
( spl218_11
<=> ( 0 = '%'(sK210(type_pointer(type_global)),14) ) ),
introduced(definition,[new_symbols(definition,[spl218_11])],[avatar_definition]) ).
tff(f1165,plain,
( ( 0 != '%'(sK210(type_pointer(type_global)),14) )
| spl218_11 ),
inference(avatar_component_clause,[],[f1163]) ).
tff(f1166,plain,
~ spl218_11,
inference(avatar_split_clause,[],[f1092,f1163]) ).
tff(f1208,definition,
( spl218_20
<=> ( 0 = '%'(sK194,14) ) ),
introduced(definition,[new_symbols(definition,[spl218_20])],[avatar_definition]) ).
tff(f1210,plain,
( ( 0 = '%'(sK194,14) )
| ~ spl218_20 ),
inference(avatar_component_clause,[],[f1208]) ).
tff(f1211,plain,
spl218_20,
inference(avatar_split_clause,[],[f992,f1208]) ).
tff(f1295,plain,
( ( 0 != '%'($sum(sK194,-14),14) )
| ~ spl218_4
| spl218_11 ),
inference(forward_demodulation,[],[f1165,f1130]) ).
tff(f1297,definition,
( spl218_36
<=> ( 0 = '%'($sum(sK194,-14),14) ) ),
introduced(definition,[new_symbols(definition,[spl218_36])],[avatar_definition]) ).
tff(f1299,plain,
( ( 0 != '%'($sum(sK194,-14),14) )
| spl218_36 ),
inference(avatar_component_clause,[],[f1297]) ).
tff(f1300,plain,
( ~ spl218_36
| ~ spl218_4
| spl218_11 ),
inference(avatar_split_clause,[],[f1295,f1163,f1128,f1297]) ).
tff(f1580,plain,
( ( 0 != '%'(sK194,14) )
| ( 0 != 0 )
| spl218_36 ),
inference(superposition,[],[f1299,f1108]) ).
tff(f1582,plain,
( ( 0 != '%'(sK194,14) )
| spl218_36 ),
inference(trivial_inequality_removal,[],[f1580]) ).
tff(f1584,plain,
( $false
| ~ spl218_20
| spl218_36 ),
inference(forward_subsumption_resolution,[],[f1582,f1210]) ).
tff(f1585,plain,
( ~ spl218_20
| spl218_36 ),
inference(avatar_contradiction_clause,[],[f1584]) ).
tff(f1586,plain,
$false,
inference(avatar_smt_refutation,[],[f1585,f1300,f1211,f1166,f1131]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW813_1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.20 % Computer : n017.cluster.edu
% 0.10/0.20 % Model : x86_64 x86_64
% 0.10/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.20 % Memory : 8046.5625MB
% 0.10/0.20 % OS : Linux 6.8.0-71-generic
% 0.10/0.20 % CPULimit : 300
% 0.10/0.20 % WCLimit : 300
% 0.10/0.20 % DateTime : Mon Sep 28 14:26:13 UTC 2026
% 0.10/0.20 % CPUTime :
% 0.10/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.24 Running first-order theorem proving
% 0.10/0.24 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.66/1.29 % (3598443)Detected arithmetic, will pick strategies from an ALASCA-aware ARI schedule.
% 3.66/1.29 % (3598471)lrs+1002_4:1_to=lpo:sil=64000:si=on:br=off:random_seed=3120223340:s2a=on:i=7:rtra=on:inst=on_2999 on theBenchmark for (2999ds/7Mi)
% 3.66/1.29 % (3598471)Instruction limit reached!
% 3.66/1.29 % (3598471)------------------------------
% 3.66/1.29 % (3598471)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.66/1.29 % (3598471)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.66/1.29 % (3598471)CaDiCaL version: 2.1.3
% 3.66/1.29 % (3598471)Termination reason: Instruction limit
% 3.66/1.29 % (3598471)Termination phase: Preprocessing 3
% 3.66/1.29 % (3598471)Time elapsed: 0.003 s
% 3.66/1.29 % (3598471)Peak memory usage: 86 MB
% 3.66/1.29 % (3598471)Instructions burned: 9 (million)
% 3.66/1.29 % (3598473)lrs+10_1_to=lpo:sas=z3:si=on:tha=off:random_seed=3561173852:i=46:rtra=on_2999 on theBenchmark for (2999ds/46Mi)
% 3.66/1.29 % (3598468)dis+1002_16:1_to=lpo:sil=64000:sas=z3:si=on:norm_ineq=on:gve=force:uwa=one_side_constant:random_seed=4063017065:i=12:doe=on:rtra=on:gtg=exists_top:ss=axioms_2999 on theBenchmark for (2999ds/12Mi)
% 3.66/1.29 % (3598474)lrs+10_1_tgt=ground:sas=z3:si=on:random_seed=353489042:i=33:rtra=on_2999 on theBenchmark for (2999ds/33Mi)
% 3.66/1.29 % (3598469)dis+1002_1_to=kbo:sil=128000:tgt=ground:sas=z3:si=on:spb=units:tha=off:random_seed=2842864333:i=307:kws=precedence:nm=0:rtra=on_2999 on theBenchmark for (2999ds/307Mi)
% 3.66/1.29 % (3598470)dis+10_3_slsqr=1,4:to=lpo:sil=128000:thi=strong:si=on:uwa=off:s2agt=20:slsqc=1:slsq=on:random_seed=65894871:i=201:slsql=off:asg=cautious:rtra=on:gtg=all:ss=axioms:sgt=16_2999 on theBenchmark for (2999ds/201Mi)
% 3.66/1.29 % (3598472)dis+21_64_to=kbo:sil=128000:si=on:sp=weighted_frequency:uwa=alasca_can_abstract:random_seed=2062287053:i=4:rtra=on_2999 on theBenchmark for (2999ds/4Mi)
% 3.66/1.29 % (3598472)Instruction limit reached!
% 3.66/1.29 % (3598472)------------------------------
% 3.66/1.29 % (3598472)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.66/1.29 % (3598472)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.66/1.29 % (3598472)CaDiCaL version: 2.1.3
% 3.66/1.29 % (3598472)Termination reason: Instruction limit
% 3.66/1.29 % (3598472)Termination phase: Property scanning
% 3.66/1.29 % (3598472)Time elapsed: 0.004 s
% 3.66/1.29 % (3598472)Peak memory usage: 85 MB
% 3.66/1.29 % (3598472)Instructions burned: 4 (million)
% 3.66/1.29 % (3598468)Instruction limit reached!
% 3.66/1.29 % (3598468)------------------------------
% 3.66/1.29 % (3598468)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.66/1.29 % (3598468)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.66/1.29 % (3598468)CaDiCaL version: 2.1.3
% 3.66/1.29 % (3598468)Termination reason: Instruction limit
% 3.66/1.29 % (3598468)Termination phase: Property scanning
% 3.66/1.29 % (3598468)Time elapsed: 0.007 s
% 3.66/1.29 % (3598468)Peak memory usage: 87 MB
% 3.66/1.29 % (3598468)Instructions burned: 13 (million)
% 3.66/1.29 % (3598474)Instruction limit reached!
% 3.66/1.29 % (3598474)------------------------------
% 3.66/1.29 % (3598474)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.66/1.29 % (3598474)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.66/1.29 % (3598474)CaDiCaL version: 2.1.3
% 3.66/1.29 % (3598474)Termination reason: Instruction limit
% 3.66/1.29 % (3598474)Termination phase: Saturation
% 3.66/1.29 % (3598474)Time elapsed: 0.027 s
% 3.66/1.29 % (3598474)Peak memory usage: 98 MB
% 3.66/1.29 % (3598474)Instructions burned: 33 (million)
% 3.66/1.29 % (3598473)Instruction limit reached!
% 3.66/1.29 % (3598473)------------------------------
% 3.66/1.29 % (3598473)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.66/1.29 % (3598473)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.66/1.29 % (3598473)CaDiCaL version: 2.1.3
% 3.66/1.29 % (3598473)Termination reason: Instruction limit
% 3.66/1.29 % (3598473)Termination phase: Saturation
% 3.66/1.29 % (3598473)Time elapsed: 0.050 s
% 3.66/1.29 % (3598473)Peak memory usage: 113 MB
% 3.66/1.29 % (3598473)Instructions burned: 46 (million)
% 3.66/1.29 % (3598469)First to succeed.
% 3.66/1.29 % (3598470)Also succeeded, but the first one will report.
% 3.66/1.29 % (3598469)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3598443"
% 3.66/1.29 % (3598518)dis+11_3_anc=none:drc=ordering:si=on:urr=ec_only:bce=on:tha=off:sac=on:random_seed=458189879:st=5:i=14:sd=10:rtra=on:ss=axioms:rawr=on_2998 on theBenchmark for (2998ds/14Mi)
% 3.66/1.29 % (3598518)Refutation not found, incomplete strategy
% 3.66/1.29 % (3598518)------------------------------
% 3.66/1.29 % (3598518)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.66/1.29 % (3598518)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.66/1.29 % (3598518)CaDiCaL version: 2.1.3
% 3.66/1.29 % (3598518)Termination reason: Refutation not found, incomplete strategy
% 3.66/1.29 % (3598518)Time elapsed: 0.003 s
% 3.66/1.29 % (3598518)Peak memory usage: 88 MB
% 3.66/1.29 % (3598518)Instructions burned: 4 (million)
% 3.66/1.29 % (3598538)ott+21_1024_to=lakbo:sil=128000:bsd=on:si=on:alasca=on:uwa=alasca_main:nwc=0.5:random_seed=3933648130:cond=on:i=16:fgj=on:ep=RS:asg=force:nm=10:rtra=on:rawr=on_2998 on theBenchmark for (2998ds/16Mi)
% 3.66/1.29 % (3598538)Instruction limit reached!
% 3.66/1.29 % (3598538)------------------------------
% 3.66/1.29 % (3598538)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.66/1.29 % (3598538)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.66/1.29 % (3598538)CaDiCaL version: 2.1.3
% 3.66/1.29 % (3598538)Termination reason: Instruction limit
% 3.66/1.29 % (3598538)Termination phase: Property scanning
% 3.66/1.29 % (3598538)Time elapsed: 0.006 s
% 3.66/1.29 % (3598538)Peak memory usage: 87 MB
% 3.66/1.29 % (3598538)Instructions burned: 18 (million)
% 3.66/1.29 % (3598537)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=352364644:i=29:thsqd=64:nm=0:thsqc=8:rtra=on:thsq=on:ev=off_2998 on theBenchmark for (2998ds/29Mi)
% 3.66/1.29 % (3598537)Instruction limit reached!
% 3.66/1.29 % (3598537)------------------------------
% 3.66/1.29 % (3598537)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.66/1.29 % (3598537)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.66/1.29 % (3598537)CaDiCaL version: 2.1.3
% 3.66/1.29 % (3598537)Termination reason: Instruction limit
% 3.66/1.29 % (3598537)Termination phase: Saturation
% 3.66/1.29 % (3598537)Time elapsed: 0.017 s
% 3.66/1.29 % (3598537)Peak memory usage: 89 MB
% 3.66/1.29 % (3598537)Instructions burned: 30 (million)
% 3.66/1.29 % (3598541)dis+1011_1_prc=on:drc=off:si=on:sac=on:random_seed=3739845785:i=24:canc=force:rtra=on_2997 on theBenchmark for (2997ds/24Mi)
% 3.66/1.29 % (3598541)Instruction limit reached!
% 3.66/1.29 % (3598541)------------------------------
% 3.66/1.29 % (3598541)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.66/1.29 % (3598541)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.66/1.29 % (3598541)CaDiCaL version: 2.1.3
% 3.66/1.29 % (3598541)Termination reason: Instruction limit
% 3.66/1.29 % (3598541)Termination phase: Property scanning
% 3.66/1.29 % (3598541)Time elapsed: 0.015 s
% 3.66/1.29 % (3598541)Peak memory usage: 87 MB
% 3.66/1.29 % (3598541)Instructions burned: 26 (million)
% 3.66/1.29 % (3598556)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=1888867951:i=27:canc=cautious:fsr=off:rtra=on_2997 on theBenchmark for (2997ds/27Mi)
% 3.66/1.29 % (3598556)Instruction limit reached!
% 3.66/1.29 % (3598556)------------------------------
% 3.66/1.29 % (3598556)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.66/1.29 % (3598556)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.66/1.29 % (3598556)CaDiCaL version: 2.1.3
% 3.66/1.29 % (3598556)Termination reason: Instruction limit
% 3.66/1.29 % (3598556)Termination phase: Property scanning
% 3.66/1.29 % (3598556)Time elapsed: 0.016 s
% 3.66/1.29 % (3598556)Peak memory usage: 87 MB
% 3.66/1.29 % (3598556)Instructions burned: 28 (million)
% 3.66/1.29 % (3598570)dis+1002_24_to=kbo:sil=128000:si=on:random_seed=1958170072:i=85:gtgl=4:rtra=on:gtg=exists_sym_2996 on theBenchmark for (2996ds/85Mi)
% 3.66/1.29 % (3598570)Instruction limit reached!
% 3.66/1.29 % (3598570)------------------------------
% 3.66/1.29 % (3598570)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.66/1.29 % (3598570)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.66/1.29 % (3598570)CaDiCaL version: 2.1.3
% 3.66/1.29 % (3598570)Termination reason: Instruction limit
% 3.66/1.29 % (3598570)Termination phase: Saturation
% 3.66/1.29 % (3598570)Time elapsed: 0.044 s
% 3.66/1.29 % (3598570)Peak memory usage: 90 MB
% 3.66/1.29 % (3598570)Instructions burned: 86 (million)
% 3.66/1.29 % (3598583)ott+1002_1_si=on:sp=occurrence:spb=goal:lcm=predicate:random_seed=2326652384:i=2:bd=preordered:nm=2:ins=3:rtra=on:inst=on:tar=off_2996 on theBenchmark for (2996ds/2Mi)
% 3.66/1.29 % (3598583)Instruction limit reached!
% 3.66/1.29 % (3598583)------------------------------
% 3.66/1.29 % (3598583)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.66/1.29 % (3598583)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.66/1.29 % (3598583)CaDiCaL version: 2.1.3
% 3.66/1.29 % (3598583)Termination reason: Instruction limit
% 3.66/1.29 % (3598583)Termination phase: Property scanning
% 3.66/1.29 % (3598583)Time elapsed: 0.003 s
% 3.66/1.29 % (3598583)Peak memory usage: 85 MB
% 3.66/1.29 % (3598583)Instructions burned: 3 (million)
% 3.66/1.29 % (3598469)Refutation found. Thanks to Tanya!
% 3.66/1.29 % SZS status Unsatisfiable for theBenchmark
% 3.66/1.29 % SZS output start Proof for theBenchmark
% See solution above
% 4.81/1.50 % (3598469)------------------------------
% 4.81/1.50 % (3598469)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.81/1.50 % (3598469)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.81/1.50 % (3598469)CaDiCaL version: 2.1.3
% 4.81/1.50 % (3598469)Termination reason: Refutation
% 4.81/1.50 % (3598469)Time elapsed: 0.098 s
% 4.81/1.50 % (3598469)Peak memory usage: 118 MB
% 4.93/1.50 % (3598469)Instructions burned: 97 (million)
% 4.93/1.50 % (3598469)------------------------------
% 4.93/1.50 % (3598469)------------------------------
% 4.93/1.50 % (3598443)Success in time 0.612 s
% 4.93/1.50 % Vampire exiting
%------------------------------------------------------------------------------