TSTP Solution File: ARI758_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : ARI758_1 : TPTP v8.1.2. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed May 1 02:10:21 EDT 2024
% Result : Unsatisfiable 0.88s 0.83s
% Output : Refutation 0.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 459
% Syntax : Number of formulae : 498 ( 15 unt; 443 typ; 0 def)
% Number of atoms : 167 ( 87 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 174 ( 62 ~; 53 |; 33 &)
% ( 7 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 87 ( 0 atm; 36 fun; 49 num; 2 var)
% Number of types : 8 ( 5 usr; 2 ari)
% Number of type conns : 1525 ( 416 >;1109 *; 0 +; 0 <<)
% Number of predicates : 44 ( 42 usr; 8 prp; 0-4 aty)
% Number of functors : 409 ( 403 usr; 25 con; 0-9 aty)
% Number of variables : 58 ( 35 !; 23 ?; 58 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
c_sorted: $tType ).
tff(type_def_6,type,
'Unit': $tType ).
tff(type_def_7,type,
c_unsorted: $tType ).
tff(type_def_8,type,
c_Boolean: $tType ).
tff(type_def_9,type,
c_type: $tType ).
tff(func_def_0,type,
lsl: ( $int * $int ) > $int ).
tff(func_def_1,type,
char_P_tag: c_unsorted ).
tff(func_def_2,type,
pset_union: ( c_sorted * c_sorted ) > c_unsorted ).
tff(func_def_3,type,
int_of_tag: c_sorted > $int ).
tff(func_def_4,type,
bool_not: c_Boolean > c_Boolean ).
tff(func_def_5,type,
int_min: ( $int * $int ) > $int ).
tff(func_def_6,type,
c_Boolean_true: c_Boolean ).
tff(func_def_7,type,
bitvector_of_char_P: c_sorted > c_unsorted ).
tff(func_def_8,type,
base_block: c_sorted > c_unsorted ).
tff(func_def_9,type,
downcast: ( c_sorted * c_sorted * c_sorted ) > c_unsorted ).
tff(func_def_10,type,
pset_empty: c_unsorted ).
tff(func_def_11,type,
pset_range: ( c_sorted * $int * $int ) > c_unsorted ).
tff(func_def_12,type,
tag_table: c_type > c_type ).
tff(func_def_13,type,
int32_of_integer: $int > c_unsorted ).
tff(func_def_14,type,
int_max: ( $int * $int ) > $int ).
tff(func_def_15,type,
c_unit: c_type ).
tff(func_def_16,type,
pset_deref: ( c_sorted * c_sorted ) > c_unsorted ).
tff(func_def_17,type,
tag_id: c_type > c_type ).
tff(func_def_18,type,
offset_max_bytes: ( c_sorted * c_sorted * $int ) > $int ).
tff(func_def_19,type,
neq_int_bool: ( $int * $int ) > c_Boolean ).
tff(func_def_20,type,
store_bytes: ( c_sorted * c_sorted * $int * $int * c_sorted ) > c_unsorted ).
tff(func_def_21,type,
s2bool: c_sorted > c_Boolean ).
tff(func_def_22,type,
subtag_bool: ( c_sorted * c_sorted ) > c_Boolean ).
tff(func_def_23,type,
abs_real: $real > $real ).
tff(func_def_24,type,
replace_bytes: ( c_sorted * $int * $int * c_sorted ) > c_unsorted ).
tff(func_def_25,type,
neq_real_bool: ( $real * $real ) > c_Boolean ).
tff(func_def_26,type,
abs_int: $int > $int ).
tff(func_def_27,type,
c_Boolean_false: c_Boolean ).
tff(func_def_28,type,
bool_or: ( c_Boolean * c_Boolean ) > c_Boolean ).
tff(func_def_29,type,
eq_real_bool: ( $real * $real ) > c_Boolean ).
tff(func_def_30,type,
lt_real_bool: ( $real * $real ) > c_Boolean ).
tff(func_def_31,type,
block: c_type > c_type ).
tff(func_def_32,type,
int32_of_bitvector: c_sorted > c_unsorted ).
tff(func_def_33,type,
log: $real > $real ).
tff(func_def_34,type,
bitvector_of_int32: c_sorted > c_unsorted ).
tff(func_def_35,type,
pset: c_type > c_type ).
tff(func_def_36,type,
address: c_sorted > $int ).
tff(func_def_37,type,
shift: ( c_sorted * $int ) > c_unsorted ).
tff(func_def_38,type,
exp: $real > $real ).
tff(func_def_39,type,
gt_int_bool: ( $int * $int ) > c_Boolean ).
tff(func_def_40,type,
offset_min_bytes: ( c_sorted * c_sorted * $int ) > $int ).
tff(func_def_41,type,
null: c_unsorted ).
tff(func_def_42,type,
eq_pointer_bool: ( c_sorted * c_sorted ) > c_Boolean ).
tff(func_def_43,type,
unit2u: 'Unit' > c_unsorted ).
tff(func_def_44,type,
pset_range_left: ( c_sorted * $int ) > c_unsorted ).
tff(func_def_45,type,
le_real_bool: ( $real * $real ) > c_Boolean ).
tff(func_def_46,type,
void_P_of_bitvector: c_sorted > c_unsorted ).
tff(func_def_47,type,
s2real: c_sorted > $real ).
tff(func_def_48,type,
concat_bitvector: ( c_sorted * c_sorted ) > c_unsorted ).
tff(func_def_49,type,
pset_range_right: ( c_sorted * $int ) > c_unsorted ).
tff(func_def_50,type,
int2u: $int > c_unsorted ).
tff(func_def_51,type,
int8_of_integer: $int > c_unsorted ).
tff(func_def_52,type,
s2unit: c_sorted > 'Unit' ).
tff(func_def_53,type,
s2int: c_sorted > $int ).
tff(func_def_54,type,
void_P_of_pointer_address: c_sorted > c_unsorted ).
tff(func_def_55,type,
c_real: c_type ).
tff(func_def_56,type,
real_max: ( $real * $real ) > $real ).
tff(func_def_57,type,
lt_int_bool: ( $int * $int ) > c_Boolean ).
tff(func_def_58,type,
offset_max: ( c_sorted * c_sorted ) > $int ).
tff(func_def_59,type,
smtlib__select: ( c_sorted * c_sorted ) > c_unsorted ).
tff(func_def_60,type,
memory: ( c_type * c_type ) > c_type ).
tff(func_def_61,type,
real2u: $real > c_unsorted ).
tff(func_def_62,type,
int8: c_type ).
tff(func_def_63,type,
int32: c_type ).
tff(func_def_64,type,
bw_and: ( $int * $int ) > $int ).
tff(func_def_65,type,
gt_real_bool: ( $real * $real ) > c_Boolean ).
tff(func_def_66,type,
c_sort: ( c_type * c_unsorted ) > c_sorted ).
tff(func_def_67,type,
offset_min: ( c_sorted * c_sorted ) > $int ).
tff(func_def_68,type,
typeof: ( c_sorted * c_sorted ) > c_unsorted ).
tff(func_def_69,type,
bitvector_of_int8: c_sorted > c_unsorted ).
tff(func_def_70,type,
void_P_tag: c_unsorted ).
tff(func_def_71,type,
char_P_of_pointer_address: c_sorted > c_unsorted ).
tff(func_def_72,type,
le_int_bool: ( $int * $int ) > c_Boolean ).
tff(func_def_73,type,
bottom_tag: c_unsorted ).
tff(func_def_74,type,
bitvector: c_type ).
tff(func_def_75,type,
integer_of_int8: c_sorted > $int ).
tff(func_def_76,type,
lsr: ( $int * $int ) > $int ).
tff(func_def_77,type,
pset_all: c_sorted > c_unsorted ).
tff(func_def_78,type,
pointer_address: c_sorted > c_unsorted ).
tff(func_def_79,type,
extract_bytes: ( c_sorted * $int * $int ) > c_unsorted ).
tff(func_def_80,type,
bool_and: ( c_Boolean * c_Boolean ) > c_Boolean ).
tff(func_def_81,type,
smtlib__ite: ( c_Boolean * c_sorted * c_sorted ) > c_unsorted ).
tff(func_def_82,type,
bool_xor: ( c_Boolean * c_Boolean ) > c_Boolean ).
tff(func_def_83,type,
ge_real_bool: ( $real * $real ) > c_Boolean ).
tff(func_def_84,type,
eq_int_bool: ( $int * $int ) > c_Boolean ).
tff(func_def_85,type,
c_bool: c_type ).
tff(func_def_86,type,
pset_singleton: c_sorted > c_unsorted ).
tff(func_def_87,type,
bitvector_of_void_P: c_sorted > c_unsorted ).
tff(func_def_88,type,
pointer: c_type > c_type ).
tff(func_def_89,type,
select_bytes: ( c_sorted * c_sorted * $int * $int ) > c_unsorted ).
tff(func_def_90,type,
bool2u: c_Boolean > c_unsorted ).
tff(func_def_91,type,
void_P: c_type ).
tff(func_def_92,type,
integer_of_int32: c_sorted > $int ).
tff(func_def_93,type,
char_P_of_bitvector: c_sorted > c_unsorted ).
tff(func_def_94,type,
asr: ( $int * $int ) > $int ).
tff(func_def_95,type,
c_int: c_type ).
tff(func_def_96,type,
neq_pointer_bool: ( c_sorted * c_sorted ) > c_Boolean ).
tff(func_def_97,type,
int8_of_bitvector: c_sorted > c_unsorted ).
tff(func_def_98,type,
alloc_table: c_type > c_type ).
tff(func_def_99,type,
sub_pointer: ( c_sorted * c_sorted ) > $int ).
tff(func_def_100,type,
char_P: c_type ).
tff(func_def_101,type,
real_min: ( $real * $real ) > $real ).
tff(func_def_102,type,
ge_int_bool: ( $int * $int ) > c_Boolean ).
tff(func_def_103,type,
smtlib__store: ( c_sorted * c_sorted * c_sorted ) > c_unsorted ).
tff(func_def_119,type,
sK0: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_120,type,
sK1: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_121,type,
sK2: ( $int * $int ) > $int ).
tff(func_def_122,type,
sK3: ( $int * $int ) > $int ).
tff(func_def_123,type,
sK4: ( $int * $int ) > $int ).
tff(func_def_124,type,
sK5: ( $int * $int ) > $int ).
tff(func_def_125,type,
sK6: ( $real * $real ) > $real ).
tff(func_def_126,type,
sK7: ( $real * $real ) > $real ).
tff(func_def_127,type,
sK8: ( $real * $real ) > $real ).
tff(func_def_128,type,
sK9: ( $real * $real ) > $real ).
tff(func_def_129,type,
sK10: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_130,type,
sK11: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_131,type,
sK12: ( c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_132,type,
sK13: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_133,type,
sK14: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_134,type,
sK15: ( c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_135,type,
sK16: ( c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_136,type,
sK17: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_137,type,
sK18: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_138,type,
sK19: ( c_type * c_unsorted * $int * $int ) > c_type ).
tff(func_def_139,type,
sK20: ( c_type * c_unsorted * $int * $int ) > c_sorted ).
tff(func_def_140,type,
sK21: ( c_type * c_unsorted * $int * $int ) > c_type ).
tff(func_def_141,type,
sK22: ( c_type * c_unsorted * $int * $int ) > c_sorted ).
tff(func_def_142,type,
sK23: ( c_type * c_unsorted ) > c_type ).
tff(func_def_143,type,
sK24: ( c_type * c_unsorted ) > c_sorted ).
tff(func_def_144,type,
sK25: ( c_type * c_unsorted * $int * $int ) > c_type ).
tff(func_def_145,type,
sK26: ( c_type * c_unsorted * $int * $int ) > c_sorted ).
tff(func_def_146,type,
sK27: ( c_type * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_147,type,
sK28: ( c_type * c_unsorted * c_unsorted * $int ) > c_type ).
tff(func_def_148,type,
sK29: ( c_type * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_149,type,
sK30: ( c_type * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_150,type,
sK31: ( c_type * c_unsorted * c_unsorted * $int ) > c_type ).
tff(func_def_151,type,
sK32: ( c_type * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_152,type,
sK33: ( c_type * c_unsorted * $int * $int ) > c_type ).
tff(func_def_153,type,
sK34: ( c_type * c_unsorted * $int * $int ) > c_sorted ).
tff(func_def_154,type,
sK35: ( c_type * c_unsorted ) > c_sorted ).
tff(func_def_155,type,
sK36: ( c_type * c_unsorted ) > c_sorted ).
tff(func_def_156,type,
sK37: ( c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_157,type,
sK38: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_158,type,
sK39: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_159,type,
sK40: ( c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_160,type,
sK41: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_161,type,
sK42: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_162,type,
sK43: ( c_type * c_unsorted * c_unsorted * $int ) > c_type ).
tff(func_def_163,type,
sK44: ( c_type * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_164,type,
sK45: ( c_type * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_165,type,
sK46: ( c_type * c_unsorted * c_unsorted * $int ) > c_type ).
tff(func_def_166,type,
sK47: ( c_type * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_167,type,
sK48: ( c_type * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_168,type,
sK49: ( c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_169,type,
sK50: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_170,type,
sK51: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_171,type,
sK52: ( c_type * c_unsorted ) > c_sorted ).
tff(func_def_172,type,
sK53: ( c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_173,type,
sK54: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_174,type,
sK55: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_175,type,
sK56: ( c_type * c_unsorted * c_unsorted * $int ) > c_type ).
tff(func_def_176,type,
sK57: ( c_type * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_177,type,
sK58: ( c_type * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_178,type,
sK59: ( c_type * c_unsorted * c_unsorted * $int ) > c_type ).
tff(func_def_179,type,
sK60: ( c_type * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_180,type,
sK61: ( c_type * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_181,type,
sK62: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_182,type,
sK63: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_183,type,
sK64: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_184,type,
sK65: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_185,type,
sK66: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_186,type,
sK67: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_187,type,
sK68: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_188,type,
sK69: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_189,type,
sK70: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_190,type,
sK71: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_191,type,
sK72: ( c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_192,type,
sK73: ( c_type * c_unsorted * c_unsorted ) > c_unsorted ).
tff(func_def_193,type,
sK74: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_194,type,
sK75: ( c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_195,type,
sK76: ( c_type * c_unsorted * c_unsorted ) > c_unsorted ).
tff(func_def_196,type,
sK77: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_197,type,
sK78: ( c_type * c_unsorted ) > c_sorted ).
tff(func_def_198,type,
sK79: ( c_type * c_unsorted * $int * $int * $int * $int ) > c_type ).
tff(func_def_199,type,
sK80: ( c_type * c_unsorted * $int * $int * $int * $int ) > c_sorted ).
tff(func_def_200,type,
sK81: ( c_type * c_unsorted * $int * $int ) > c_type ).
tff(func_def_201,type,
sK82: ( c_type * c_unsorted * $int * $int ) > c_sorted ).
tff(func_def_202,type,
sK83: ( c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_203,type,
sK84: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_204,type,
sK85: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_205,type,
sK86: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_206,type,
sK87: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_unsorted ).
tff(func_def_207,type,
sK88: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_208,type,
sK89: ( c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_209,type,
sK90: ( c_type * c_unsorted * c_unsorted ) > $int ).
tff(func_def_210,type,
sK91: ( c_type * c_unsorted * c_unsorted ) > c_unsorted ).
tff(func_def_211,type,
sK92: ( c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_212,type,
sK93: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_213,type,
sK94: ( c_type * c_unsorted * c_unsorted * $int * $int ) > c_type ).
tff(func_def_214,type,
sK95: ( c_type * c_unsorted * c_unsorted * $int * $int ) > $int ).
tff(func_def_215,type,
sK96: ( c_type * c_unsorted * c_unsorted * $int * $int ) > c_unsorted ).
tff(func_def_216,type,
sK97: ( c_type * c_unsorted * c_unsorted * $int * $int ) > c_type ).
tff(func_def_217,type,
sK98: ( c_type * c_unsorted * c_unsorted * $int * $int ) > c_sorted ).
tff(func_def_218,type,
sK99: ( c_type * c_unsorted * c_unsorted * $int ) > c_type ).
tff(func_def_219,type,
sK100: ( c_type * c_unsorted * c_unsorted * $int ) > $int ).
tff(func_def_220,type,
sK101: ( c_type * c_unsorted * c_unsorted * $int ) > c_unsorted ).
tff(func_def_221,type,
sK102: ( c_type * c_unsorted * c_unsorted * $int ) > c_type ).
tff(func_def_222,type,
sK103: ( c_type * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_223,type,
sK104: ( c_type * c_unsorted * c_unsorted * $int ) > c_type ).
tff(func_def_224,type,
sK105: ( c_type * c_unsorted * c_unsorted * $int ) > $int ).
tff(func_def_225,type,
sK106: ( c_type * c_unsorted * c_unsorted * $int ) > c_unsorted ).
tff(func_def_226,type,
sK107: ( c_type * c_unsorted * c_unsorted * $int ) > c_type ).
tff(func_def_227,type,
sK108: ( c_type * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_228,type,
sK109: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_229,type,
sK110: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_230,type,
sK111: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_231,type,
sK112: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_232,type,
sK113: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_233,type,
sK114: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_234,type,
sK115: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_unsorted ).
tff(func_def_235,type,
sK116: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_unsorted ).
tff(func_def_236,type,
sK117: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_237,type,
sK118: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_238,type,
sK119: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_239,type,
sK120: ( c_type * c_unsorted * c_unsorted * $int * $int ) > c_type ).
tff(func_def_240,type,
sK121: ( c_type * c_unsorted * c_unsorted * $int * $int ) > $int ).
tff(func_def_241,type,
sK122: ( c_type * c_unsorted * c_unsorted * $int * $int ) > c_unsorted ).
tff(func_def_242,type,
sK123: ( c_type * c_unsorted * c_unsorted * $int * $int * $int * c_unsorted ) > c_type ).
tff(func_def_243,type,
sK124: ( c_type * c_unsorted * c_unsorted * $int * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_244,type,
sK125: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_245,type,
sK126: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_246,type,
sK127: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_247,type,
sK128: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_248,type,
sK129: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_249,type,
sK130: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_unsorted ).
tff(func_def_250,type,
sK131: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_251,type,
sK132: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_252,type,
sK133: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_253,type,
sK134: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_254,type,
sK135: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_255,type,
sK136: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_256,type,
sK137: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_257,type,
sK138: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_258,type,
sK139: ( c_type * c_unsorted * c_unsorted * $int ) > c_type ).
tff(func_def_259,type,
sK140: ( c_type * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_260,type,
sK141: ( c_type * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_261,type,
sK142: ( c_type * c_unsorted * c_unsorted * $int ) > c_type ).
tff(func_def_262,type,
sK143: ( c_type * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_263,type,
sK144: ( c_type * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_264,type,
sK145: ( c_type * c_unsorted * c_unsorted * $int ) > c_type ).
tff(func_def_265,type,
sK146: ( c_type * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_266,type,
sK147: ( c_type * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_267,type,
sK148: ( c_type * c_unsorted * c_unsorted * $int ) > c_type ).
tff(func_def_268,type,
sK149: ( c_type * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_269,type,
sK150: ( c_type * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_270,type,
sK151: ( c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_271,type,
sK152: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_272,type,
sK153: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_273,type,
sK154: ( c_type * c_unsorted ) > c_sorted ).
tff(func_def_274,type,
sK155: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_275,type,
sK156: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_276,type,
sK157: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_277,type,
sK158: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_278,type,
sK159: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_279,type,
sK160: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_280,type,
sK161: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_281,type,
sK162: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_282,type,
sK163: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_283,type,
sK164: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_284,type,
sK165: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_285,type,
sK166: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_286,type,
sK167: ( c_type * c_unsorted ) > c_type ).
tff(func_def_287,type,
sK168: ( c_type * c_unsorted ) > c_type ).
tff(func_def_288,type,
sK169: ( c_type * c_unsorted ) > c_sorted ).
tff(func_def_289,type,
sK170: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_290,type,
sK171: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_291,type,
sK172: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_292,type,
sK173: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_293,type,
sK174: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_294,type,
sK175: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_295,type,
sK176: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_296,type,
sK177: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_297,type,
sK178: ( c_type * c_unsorted * c_unsorted * $int ) > $int ).
tff(func_def_298,type,
sK179: ( c_type * c_unsorted * c_unsorted * $int * $int ) > c_type ).
tff(func_def_299,type,
sK180: c_type > c_type ).
tff(func_def_300,type,
sK181: c_type > c_type ).
tff(func_def_301,type,
sK182: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_302,type,
sK183: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_303,type,
sK184: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_304,type,
sK185: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_305,type,
sK186: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_306,type,
sK187: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_307,type,
sK188: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_308,type,
sK189: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_309,type,
sK190: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_310,type,
sK191: c_type > c_type ).
tff(func_def_311,type,
sK192: c_type > c_type ).
tff(func_def_312,type,
sK193: ( c_type * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_313,type,
sK194: ( c_type * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_314,type,
sK195: ( c_type * c_unsorted * c_unsorted * $int ) > $int ).
tff(func_def_315,type,
sK196: ( c_type * c_unsorted * c_unsorted * $int ) > $int ).
tff(func_def_316,type,
sK197: ( c_type * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_317,type,
sK198: ( c_type * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_318,type,
sK199: ( c_type * c_unsorted * c_unsorted * $int ) > $int ).
tff(func_def_319,type,
sK200: ( c_type * c_unsorted * c_unsorted * $int ) > $int ).
tff(func_def_320,type,
sK201: ( $int * $int * $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_321,type,
sK202: ( $int * $int * $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_322,type,
sK203: ( $int * $int * $int * $int * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_323,type,
sK204: ( $int * $int * $int * $int * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_324,type,
sK205: ( $int * $int * $int * $int * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_325,type,
sK206: ( $int * $int * $int * $int * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_326,type,
sK207: ( $int * $int * $int * $int * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_327,type,
sK208: ( $int * $int * $int * $int * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_328,type,
sK209: ( $int * $int * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_329,type,
sK210: ( c_type * c_unsorted * c_unsorted * c_unsorted * $int * $int * $int * $int * c_unsorted ) > c_type ).
tff(func_def_330,type,
sK211: ( c_type * c_unsorted * c_unsorted * c_unsorted * $int * $int * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_331,type,
sK212: ( c_type * c_unsorted * c_unsorted * c_unsorted * $int * $int * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_332,type,
sK213: ( c_type * c_unsorted * c_unsorted * c_unsorted * $int * $int * $int * $int * c_unsorted ) > c_type ).
tff(func_def_333,type,
sK214: ( c_type * c_unsorted * c_unsorted * c_unsorted * $int * $int * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_334,type,
sK215: ( c_type * c_unsorted * c_unsorted * c_unsorted * $int * $int * $int * $int * c_unsorted ) > c_type ).
tff(func_def_335,type,
sK216: ( c_type * c_unsorted * c_unsorted * c_unsorted * $int * $int * $int * $int * c_unsorted ) > c_type ).
tff(func_def_336,type,
sK217: ( c_type * c_unsorted * c_unsorted * c_unsorted * $int * $int * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_337,type,
sK218: ( c_type * c_unsorted * c_unsorted * c_unsorted * $int * $int * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_338,type,
sK219: ( c_type * c_unsorted * c_unsorted * c_unsorted * $int * $int * $int * $int * c_unsorted ) > c_type ).
tff(func_def_339,type,
sK220: ( c_type * c_unsorted * c_unsorted * c_unsorted * $int * $int * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_340,type,
sK221: ( c_type * c_unsorted * c_unsorted * $int * $int * $int * c_unsorted ) > c_type ).
tff(func_def_341,type,
sK222: ( c_type * c_unsorted * c_unsorted * $int * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_342,type,
sK223: ( c_type * c_unsorted * c_unsorted * $int * $int * $int * c_unsorted ) > c_type ).
tff(func_def_343,type,
sK224: ( c_type * c_unsorted * c_unsorted * $int * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_344,type,
sK225: ( c_type * c_unsorted * c_unsorted * $int * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_345,type,
sK226: ( c_type * c_unsorted * c_unsorted * $int * $int * $int ) > c_sorted ).
tff(func_def_346,type,
sK227: ( c_type * c_unsorted * c_unsorted * $int * $int * $int ) > c_type ).
tff(func_def_347,type,
sK228: ( c_type * c_unsorted * c_unsorted * $int * $int * $int ) > c_sorted ).
tff(func_def_348,type,
sK229: ( c_type * c_unsorted * c_unsorted * $int * $int * $int * $int * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_349,type,
sK230: ( c_type * c_unsorted * c_unsorted * $int * $int * $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_350,type,
sK231: ( c_type * c_unsorted * c_unsorted * $int * $int * $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_351,type,
sK232: ( c_type * c_unsorted * c_unsorted * $int * $int * $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_352,type,
sK233: ( c_type * c_unsorted * c_unsorted * $int * $int * $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_353,type,
sK234: ( c_type * c_unsorted * c_unsorted * $int * $int * $int * $int * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_354,type,
sK235: ( c_type * c_unsorted * c_unsorted * $int * $int * $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_355,type,
sK236: ( c_type * c_unsorted * c_unsorted * $int * $int * $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_356,type,
sK237: ( c_type * c_unsorted * c_unsorted * $int * $int * $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_357,type,
sK238: ( c_type * c_unsorted * c_unsorted * $int * $int * $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_358,type,
sK239: ( c_type * c_unsorted * c_unsorted * $int * $int * $int * $int ) > c_sorted ).
tff(func_def_359,type,
sK240: ( c_type * c_unsorted * c_unsorted * $int * $int * $int * $int ) > c_sorted ).
tff(func_def_360,type,
sK241: c_unsorted > c_sorted ).
tff(func_def_361,type,
sK242: c_unsorted > c_sorted ).
tff(func_def_362,type,
sK243: c_unsorted > c_sorted ).
tff(func_def_363,type,
sK244: c_unsorted > c_sorted ).
tff(func_def_364,type,
sK245: c_unsorted > c_type ).
tff(func_def_365,type,
sK246: c_unsorted > c_sorted ).
tff(func_def_366,type,
sK247: c_unsorted > c_type ).
tff(func_def_367,type,
sK248: c_unsorted > c_sorted ).
tff(func_def_368,type,
sK249: c_type ).
tff(func_def_369,type,
sK250: ( c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_370,type,
sK251: ( c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_371,type,
sK252: ( c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_372,type,
sK253: ( c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_373,type,
sK254: c_unsorted > c_sorted ).
tff(func_def_374,type,
sK255: c_unsorted > $int ).
tff(func_def_375,type,
sK256: c_unsorted > c_sorted ).
tff(func_def_376,type,
sK257: c_unsorted > $int ).
tff(func_def_377,type,
sK258: ( c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_378,type,
sK259: ( c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_379,type,
sK260: ( c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_380,type,
sK261: ( c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_381,type,
sK262: c_unsorted > c_type ).
tff(func_def_382,type,
sK263: c_unsorted > c_sorted ).
tff(func_def_383,type,
sK264: c_unsorted > c_type ).
tff(func_def_384,type,
sK265: c_unsorted > c_sorted ).
tff(func_def_385,type,
sK266: ( c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_386,type,
sK267: ( c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_387,type,
sK268: ( c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_388,type,
sK269: ( c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_389,type,
sK270: ( c_unsorted * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_390,type,
sK271: ( c_unsorted * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_391,type,
sK272: ( c_unsorted * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_392,type,
sK273: ( c_unsorted * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_393,type,
sK274: ( c_unsorted * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_394,type,
sK275: ( c_unsorted * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_395,type,
sK276: ( c_unsorted * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_396,type,
sK277: ( c_unsorted * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_397,type,
sK278: ( c_unsorted * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_398,type,
sK279: ( c_unsorted * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_399,type,
sK280: ( c_unsorted * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_400,type,
sK281: ( c_unsorted * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_401,type,
sK282: ( c_unsorted * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_402,type,
sK283: ( c_unsorted * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_403,type,
sK284: ( c_unsorted * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_404,type,
sK285: ( c_unsorted * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_405,type,
sK286: ( c_unsorted * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_406,type,
sK287: ( c_unsorted * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_407,type,
sK288: ( c_unsorted * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_408,type,
sK289: ( c_unsorted * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_409,type,
sK290: c_unsorted > c_type ).
tff(func_def_410,type,
sK291: c_unsorted > c_sorted ).
tff(func_def_411,type,
sK292: c_unsorted > c_type ).
tff(func_def_412,type,
sK293: c_unsorted > c_sorted ).
tff(func_def_413,type,
sK294: c_type ).
tff(func_def_414,type,
sK295: c_unsorted ).
tff(func_def_415,type,
sK296: c_unsorted ).
tff(func_def_416,type,
sK297: c_unsorted ).
tff(func_def_417,type,
sK298: c_unsorted ).
tff(pred_def_1,type,
left_valid_struct_void_P: ( c_sorted * $int * c_sorted ) > $o ).
tff(pred_def_2,type,
strict_valid_root_void_P: ( c_sorted * $int * $int * c_sorted ) > $o ).
tff(pred_def_3,type,
root_tag: c_sorted > $o ).
tff(pred_def_4,type,
alloc_extends: ( c_sorted * c_sorted ) > $o ).
tff(pred_def_5,type,
valid_root_void_P: ( c_sorted * $int * $int * c_sorted ) > $o ).
tff(pred_def_6,type,
valid_struct_char_P: ( c_sorted * $int * $int * c_sorted ) > $o ).
tff(pred_def_7,type,
eq_int8: ( c_sorted * c_sorted ) > $o ).
tff(pred_def_8,type,
same_block: ( c_sorted * c_sorted ) > $o ).
tff(pred_def_9,type,
pset_included: ( c_sorted * c_sorted ) > $o ).
tff(pred_def_10,type,
strict_valid_root_char_P: ( c_sorted * $int * $int * c_sorted ) > $o ).
tff(pred_def_11,type,
in_pset: ( c_sorted * c_sorted ) > $o ).
tff(pred_def_12,type,
instanceof: ( c_sorted * c_sorted * c_sorted ) > $o ).
tff(pred_def_13,type,
alloc_extends_except: ( c_sorted * c_sorted * c_sorted ) > $o ).
tff(pred_def_14,type,
not_assigns: ( c_sorted * c_sorted * c_sorted * c_sorted ) > $o ).
tff(pred_def_15,type,
valid_bitvector_struct_char_P: ( c_sorted * $int * $int * c_sorted ) > $o ).
tff(pred_def_16,type,
parenttag: ( c_sorted * c_sorted ) > $o ).
tff(pred_def_17,type,
valid_pset: ( c_sorted * c_sorted ) > $o ).
tff(pred_def_18,type,
right_valid_struct_char_P: ( c_sorted * $int * c_sorted ) > $o ).
tff(pred_def_19,type,
strict_valid_struct_char_P: ( c_sorted * $int * $int * c_sorted ) > $o ).
tff(pred_def_20,type,
valid_bitvector_struct_void_P: ( c_sorted * $int * $int * c_sorted ) > $o ).
tff(pred_def_21,type,
right_valid_struct_void_P: ( c_sorted * $int * c_sorted ) > $o ).
tff(pred_def_22,type,
valid: ( c_sorted * c_sorted ) > $o ).
tff(pred_def_23,type,
full_separated: ( c_sorted * c_sorted ) > $o ).
tff(pred_def_24,type,
strict_valid_struct_void_P: ( c_sorted * $int * $int * c_sorted ) > $o ).
tff(pred_def_25,type,
valid_root_char_P: ( c_sorted * $int * $int * c_sorted ) > $o ).
tff(pred_def_26,type,
fully_packed: ( c_sorted * c_sorted * c_sorted ) > $o ).
tff(pred_def_27,type,
alloc_fresh: ( c_sorted * c_sorted * $int ) > $o ).
tff(pred_def_28,type,
eq_int32: ( c_sorted * c_sorted ) > $o ).
tff(pred_def_29,type,
subtag: ( c_sorted * c_sorted ) > $o ).
tff(pred_def_30,type,
valid_struct_void_P: ( c_sorted * $int * $int * c_sorted ) > $o ).
tff(pred_def_31,type,
pset_disjoint: ( c_sorted * c_sorted ) > $o ).
tff(pred_def_32,type,
left_valid_struct_char_P: ( c_sorted * $int * c_sorted ) > $o ).
tff(pred_def_41,type,
sP299: $int > $o ).
tff(pred_def_42,type,
sP300: c_sorted > $o ).
tff(pred_def_43,type,
sP301: c_sorted > $o ).
tff(f2179,plain,
$false,
inference(avatar_sat_refutation,[],[f2003,f2008,f2013,f2018,f2023,f2028,f2144,f2178]) ).
tff(f2178,plain,
( ~ spl302_10
| spl302_13
| spl302_14
| ~ spl302_23 ),
inference(avatar_contradiction_clause,[],[f2177]) ).
tff(f2177,plain,
( $false
| ~ spl302_10
| spl302_13
| spl302_14
| ~ spl302_23 ),
inference(subsumption_resolution,[],[f2176,f2022]) ).
tff(f2022,plain,
( ~ sP300(c_sort(int32,sK298))
| spl302_14 ),
inference(avatar_component_clause,[],[f2020]) ).
tff(f2020,plain,
( spl302_14
<=> sP300(c_sort(int32,sK298)) ),
introduced(avatar_definition,[new_symbols(naming,[spl302_14])]) ).
tff(f2176,plain,
( sP300(c_sort(int32,sK298))
| ~ spl302_10
| spl302_13
| ~ spl302_23 ),
inference(resolution,[],[f2166,f2017]) ).
tff(f2017,plain,
( ~ sP301(c_sort(int32,sK298))
| spl302_13 ),
inference(avatar_component_clause,[],[f2015]) ).
tff(f2015,plain,
( spl302_13
<=> sP301(c_sort(int32,sK298)) ),
introduced(avatar_definition,[new_symbols(naming,[spl302_13])]) ).
tff(f2166,plain,
( ! [X0: c_sorted] :
( sP301(X0)
| sP300(X0) )
| ~ spl302_10
| ~ spl302_23 ),
inference(subsumption_resolution,[],[f2148,f2143]) ).
tff(f2143,plain,
( sP299(1)
| ~ spl302_23 ),
inference(avatar_component_clause,[],[f2141]) ).
tff(f2141,plain,
( spl302_23
<=> sP299(1) ),
introduced(avatar_definition,[new_symbols(naming,[spl302_23])]) ).
tff(f2148,plain,
( ! [X0: c_sorted] :
( ~ sP299(1)
| sP300(X0)
| sP301(X0) )
| ~ spl302_10 ),
inference(evaluation,[],[f2147]) ).
tff(f2147,plain,
( ! [X0: c_sorted] :
( ~ sP299($sum(-1,2))
| sP300(X0)
| sP301(X0) )
| ~ spl302_10 ),
inference(superposition,[],[f2096,f2093]) ).
tff(f2093,plain,
( ! [X0: c_sorted] :
( ( 2 = integer_of_int32(X0) )
| sP301(X0) )
| ~ spl302_10 ),
inference(superposition,[],[f2002,f1811]) ).
tff(f1811,plain,
! [X4: c_sorted] :
( ( c_sort(int32,sK297) = X4 )
| sP301(X4) ),
inference(inequality_splitting,[],[f1484,f1810]) ).
tff(f1810,plain,
~ sP301(c_sort(int32,sK298)),
introduced(inequality_splitting_name_introduction,[new_symbols(naming,[sP301])]) ).
tff(f1484,plain,
! [X4: c_sorted] :
( ( c_sort(int32,sK297) = X4 )
| ( c_sort(int32,sK298) != X4 ) ),
inference(cnf_transformation,[],[f930]) ).
tff(f930,plain,
( ! [X4: c_sorted] :
( ( ( $sum(integer_of_int32(X4),$uminus(1)) != integer_of_int32(c_sort(int32,sK296)) )
& ( c_sort(int32,sK297) = X4 ) )
| ( c_sort(int32,sK298) != X4 ) )
& ( 2 = integer_of_int32(c_sort(int32,sK297)) )
& ( c_sort(int32,sK295) = c_sort(int32,sK296) )
& ( 1 = integer_of_int32(c_sort(int32,sK295)) )
& ( c_Boolean_true = c_Boolean_true ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK295,sK296,sK297,sK298])],[f496,f929,f928,f927,f926]) ).
tff(f926,plain,
( ? [X0: c_unsorted] :
( ? [X1: c_unsorted] :
( ? [X2: c_unsorted] :
( ? [X3: c_unsorted] :
! [X4: c_sorted] :
( ( ( integer_of_int32(c_sort(int32,X1)) != $sum(integer_of_int32(X4),$uminus(1)) )
& ( c_sort(int32,X2) = X4 ) )
| ( c_sort(int32,X3) != X4 ) )
& ( 2 = integer_of_int32(c_sort(int32,X2)) ) )
& ( c_sort(int32,X1) = c_sort(int32,X0) ) )
& ( 1 = integer_of_int32(c_sort(int32,X0)) ) )
=> ( ? [X1: c_unsorted] :
( ? [X2: c_unsorted] :
( ? [X3: c_unsorted] :
! [X4: c_sorted] :
( ( ( integer_of_int32(c_sort(int32,X1)) != $sum(integer_of_int32(X4),$uminus(1)) )
& ( c_sort(int32,X2) = X4 ) )
| ( c_sort(int32,X3) != X4 ) )
& ( 2 = integer_of_int32(c_sort(int32,X2)) ) )
& ( c_sort(int32,X1) = c_sort(int32,sK295) ) )
& ( 1 = integer_of_int32(c_sort(int32,sK295)) ) ) ),
introduced(choice_axiom,[]) ).
tff(f927,plain,
( ? [X1: c_unsorted] :
( ? [X2: c_unsorted] :
( ? [X3: c_unsorted] :
! [X4: c_sorted] :
( ( ( integer_of_int32(c_sort(int32,X1)) != $sum(integer_of_int32(X4),$uminus(1)) )
& ( c_sort(int32,X2) = X4 ) )
| ( c_sort(int32,X3) != X4 ) )
& ( 2 = integer_of_int32(c_sort(int32,X2)) ) )
& ( c_sort(int32,X1) = c_sort(int32,sK295) ) )
=> ( ? [X2: c_unsorted] :
( ? [X3: c_unsorted] :
! [X4: c_sorted] :
( ( ( $sum(integer_of_int32(X4),$uminus(1)) != integer_of_int32(c_sort(int32,sK296)) )
& ( c_sort(int32,X2) = X4 ) )
| ( c_sort(int32,X3) != X4 ) )
& ( 2 = integer_of_int32(c_sort(int32,X2)) ) )
& ( c_sort(int32,sK295) = c_sort(int32,sK296) ) ) ),
introduced(choice_axiom,[]) ).
tff(f928,plain,
( ? [X2: c_unsorted] :
( ? [X3: c_unsorted] :
! [X4: c_sorted] :
( ( ( $sum(integer_of_int32(X4),$uminus(1)) != integer_of_int32(c_sort(int32,sK296)) )
& ( c_sort(int32,X2) = X4 ) )
| ( c_sort(int32,X3) != X4 ) )
& ( 2 = integer_of_int32(c_sort(int32,X2)) ) )
=> ( ? [X3: c_unsorted] :
! [X4: c_sorted] :
( ( ( $sum(integer_of_int32(X4),$uminus(1)) != integer_of_int32(c_sort(int32,sK296)) )
& ( c_sort(int32,sK297) = X4 ) )
| ( c_sort(int32,X3) != X4 ) )
& ( 2 = integer_of_int32(c_sort(int32,sK297)) ) ) ),
introduced(choice_axiom,[]) ).
tff(f929,plain,
( ? [X3: c_unsorted] :
! [X4: c_sorted] :
( ( ( $sum(integer_of_int32(X4),$uminus(1)) != integer_of_int32(c_sort(int32,sK296)) )
& ( c_sort(int32,sK297) = X4 ) )
| ( c_sort(int32,X3) != X4 ) )
=> ! [X4: c_sorted] :
( ( ( $sum(integer_of_int32(X4),$uminus(1)) != integer_of_int32(c_sort(int32,sK296)) )
& ( c_sort(int32,sK297) = X4 ) )
| ( c_sort(int32,sK298) != X4 ) ) ),
introduced(choice_axiom,[]) ).
tff(f496,plain,
( ? [X0: c_unsorted] :
( ? [X1: c_unsorted] :
( ? [X2: c_unsorted] :
( ? [X3: c_unsorted] :
! [X4: c_sorted] :
( ( ( integer_of_int32(c_sort(int32,X1)) != $sum(integer_of_int32(X4),$uminus(1)) )
& ( c_sort(int32,X2) = X4 ) )
| ( c_sort(int32,X3) != X4 ) )
& ( 2 = integer_of_int32(c_sort(int32,X2)) ) )
& ( c_sort(int32,X1) = c_sort(int32,X0) ) )
& ( 1 = integer_of_int32(c_sort(int32,X0)) ) )
& ( c_Boolean_true = c_Boolean_true ) ),
inference(ennf_transformation,[],[f418]) ).
tff(f418,plain,
~ ( ( c_Boolean_true = c_Boolean_true )
=> ! [X0: c_unsorted] :
( ( 1 = integer_of_int32(c_sort(int32,X0)) )
=> ! [X1: c_unsorted] :
( ( c_sort(int32,X1) = c_sort(int32,X0) )
=> ! [X2: c_unsorted] :
( ( 2 = integer_of_int32(c_sort(int32,X2)) )
=> ! [X3: c_unsorted] :
? [X4: c_sorted] :
( ( ( c_sort(int32,X2) = X4 )
=> ( integer_of_int32(c_sort(int32,X1)) = $sum(integer_of_int32(X4),$uminus(1)) ) )
& ( c_sort(int32,X3) = X4 ) ) ) ) ) ),
inference(rectify,[],[f223]) ).
tff(f223,plain,
~ ( ( c_Boolean_true = c_Boolean_true )
=> ! [X812: c_unsorted] :
( ( 1 = integer_of_int32(c_sort(int32,X812)) )
=> ! [X813: c_unsorted] :
( ( c_sort(int32,X812) = c_sort(int32,X813) )
=> ! [X814: c_unsorted] :
( ( 2 = integer_of_int32(c_sort(int32,X814)) )
=> ! [X815: c_unsorted] :
? [X816: c_sorted] :
( ( ( c_sort(int32,X814) = X816 )
=> ( integer_of_int32(c_sort(int32,X813)) = $sum(integer_of_int32(X816),$uminus(1)) ) )
& ( c_sort(int32,X815) = X816 ) ) ) ) ) ),
inference(theory_normalization,[],[f170]) ).
tff(f170,axiom,
~ ( ( c_Boolean_true = c_Boolean_true )
=> ! [X812: c_unsorted] :
( ( 1 = integer_of_int32(c_sort(int32,X812)) )
=> ! [X813: c_unsorted] :
( ( c_sort(int32,X812) = c_sort(int32,X813) )
=> ! [X814: c_unsorted] :
( ( 2 = integer_of_int32(c_sort(int32,X814)) )
=> ! [X815: c_unsorted] :
? [X816: c_sorted] :
( ( ( c_sort(int32,X814) = X816 )
=> ( integer_of_int32(c_sort(int32,X813)) = $difference(integer_of_int32(X816),1) ) )
& ( c_sort(int32,X815) = X816 ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.byI0myFdr6/Vampire---4.8_10299',formula_170) ).
tff(f2002,plain,
( ( 2 = integer_of_int32(c_sort(int32,sK297)) )
| ~ spl302_10 ),
inference(avatar_component_clause,[],[f2000]) ).
tff(f2000,plain,
( spl302_10
<=> ( 2 = integer_of_int32(c_sort(int32,sK297)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl302_10])]) ).
tff(f2096,plain,
! [X4: c_sorted] :
( ~ sP299($sum(-1,integer_of_int32(X4)))
| sP300(X4) ),
inference(forward_demodulation,[],[f1948,f224]) ).
tff(f224,plain,
! [X0: $int,X1: $int] : ( $sum(X0,X1) = $sum(X1,X0) ),
introduced(theory_axiom_135,[]) ).
tff(f1948,plain,
! [X4: c_sorted] :
( ~ sP299($sum(integer_of_int32(X4),-1))
| sP300(X4) ),
inference(evaluation,[],[f1946]) ).
tff(f1946,plain,
! [X4: c_sorted] :
( ~ sP299($sum(integer_of_int32(X4),$uminus(1)))
| sP300(X4) ),
inference(consistent_polarity_flipping,[],[f1809]) ).
tff(f1809,plain,
! [X4: c_sorted] :
( sP299($sum(integer_of_int32(X4),$uminus(1)))
| sP300(X4) ),
inference(inequality_splitting,[],[f1485,f1808,f1807]) ).
tff(f1807,plain,
~ sP299(integer_of_int32(c_sort(int32,sK296))),
introduced(inequality_splitting_name_introduction,[new_symbols(naming,[sP299])]) ).
tff(f1808,plain,
~ sP300(c_sort(int32,sK298)),
introduced(inequality_splitting_name_introduction,[new_symbols(naming,[sP300])]) ).
tff(f1485,plain,
! [X4: c_sorted] :
( ( $sum(integer_of_int32(X4),$uminus(1)) != integer_of_int32(c_sort(int32,sK296)) )
| ( c_sort(int32,sK298) != X4 ) ),
inference(cnf_transformation,[],[f930]) ).
tff(f2144,plain,
( spl302_23
| ~ spl302_11
| ~ spl302_12
| ~ spl302_15 ),
inference(avatar_split_clause,[],[f2139,f2025,f2010,f2005,f2141]) ).
tff(f2005,plain,
( spl302_11
<=> ( c_sort(int32,sK295) = c_sort(int32,sK296) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl302_11])]) ).
tff(f2010,plain,
( spl302_12
<=> ( 1 = integer_of_int32(c_sort(int32,sK295)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl302_12])]) ).
tff(f2025,plain,
( spl302_15
<=> sP299(integer_of_int32(c_sort(int32,sK296))) ),
introduced(avatar_definition,[new_symbols(naming,[spl302_15])]) ).
tff(f2139,plain,
( sP299(1)
| ~ spl302_11
| ~ spl302_12
| ~ spl302_15 ),
inference(forward_demodulation,[],[f2136,f2012]) ).
tff(f2012,plain,
( ( 1 = integer_of_int32(c_sort(int32,sK295)) )
| ~ spl302_12 ),
inference(avatar_component_clause,[],[f2010]) ).
tff(f2136,plain,
( sP299(integer_of_int32(c_sort(int32,sK295)))
| ~ spl302_11
| ~ spl302_15 ),
inference(backward_demodulation,[],[f2027,f2007]) ).
tff(f2007,plain,
( ( c_sort(int32,sK295) = c_sort(int32,sK296) )
| ~ spl302_11 ),
inference(avatar_component_clause,[],[f2005]) ).
tff(f2027,plain,
( sP299(integer_of_int32(c_sort(int32,sK296)))
| ~ spl302_15 ),
inference(avatar_component_clause,[],[f2025]) ).
tff(f2028,plain,
spl302_15,
inference(avatar_split_clause,[],[f1947,f2025]) ).
tff(f1947,plain,
sP299(integer_of_int32(c_sort(int32,sK296))),
inference(consistent_polarity_flipping,[],[f1807]) ).
tff(f2023,plain,
~ spl302_14,
inference(avatar_split_clause,[],[f1808,f2020]) ).
tff(f2018,plain,
~ spl302_13,
inference(avatar_split_clause,[],[f1810,f2015]) ).
tff(f2013,plain,
spl302_12,
inference(avatar_split_clause,[],[f1481,f2010]) ).
tff(f1481,plain,
1 = integer_of_int32(c_sort(int32,sK295)),
inference(cnf_transformation,[],[f930]) ).
tff(f2008,plain,
spl302_11,
inference(avatar_split_clause,[],[f1482,f2005]) ).
tff(f1482,plain,
c_sort(int32,sK295) = c_sort(int32,sK296),
inference(cnf_transformation,[],[f930]) ).
tff(f2003,plain,
spl302_10,
inference(avatar_split_clause,[],[f1483,f2000]) ).
tff(f1483,plain,
2 = integer_of_int32(c_sort(int32,sK297)),
inference(cnf_transformation,[],[f930]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : ARI758_1 : TPTP v8.1.2. Released v7.0.0.
% 0.08/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.36 % Computer : n010.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Apr 30 18:38:49 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TF0_UNS_EQU_ARI problem
% 0.15/0.36 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.byI0myFdr6/Vampire---4.8_10299
% 0.59/0.77 % (10505)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.59/0.77 % (10510)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2996ds/56Mi)
% 0.59/0.77 % (10503)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2996ds/34Mi)
% 0.59/0.77 % (10506)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.59/0.77 % (10504)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2996ds/51Mi)
% 0.59/0.77 % (10507)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2996ds/34Mi)
% 0.59/0.77 % (10508)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.59/0.77 % (10509)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2996ds/83Mi)
% 0.59/0.77 % (10505)Refutation not found, incomplete strategy% (10505)------------------------------
% 0.59/0.77 % (10505)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.59/0.77 % (10510)Refutation not found, incomplete strategy% (10510)------------------------------
% 0.59/0.77 % (10510)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.59/0.77 % (10510)Termination reason: Refutation not found, incomplete strategy
% 0.59/0.77
% 0.59/0.77 % (10510)Memory used [KB]: 1274
% 0.59/0.77 % (10510)Time elapsed: 0.004 s
% 0.59/0.77 % (10510)Instructions burned: 14 (million)
% 0.59/0.77 % (10510)------------------------------
% 0.59/0.77 % (10510)------------------------------
% 0.59/0.77 % (10505)Termination reason: Refutation not found, incomplete strategy
% 0.59/0.77
% 0.59/0.77 % (10505)Memory used [KB]: 1273
% 0.59/0.77 % (10505)Time elapsed: 0.004 s
% 0.59/0.77 % (10505)Instructions burned: 14 (million)
% 0.59/0.77 % (10505)------------------------------
% 0.59/0.77 % (10505)------------------------------
% 0.59/0.77 % (10513)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on Vampire---4 for (2996ds/55Mi)
% 0.59/0.77 % (10514)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on Vampire---4 for (2996ds/50Mi)
% 0.59/0.77 % (10506)Refutation not found, incomplete strategy% (10506)------------------------------
% 0.59/0.77 % (10506)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.59/0.77 % (10508)Refutation not found, incomplete strategy% (10508)------------------------------
% 0.59/0.77 % (10508)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.59/0.77 % (10508)Termination reason: Refutation not found, incomplete strategy
% 0.59/0.77
% 0.59/0.77 % (10508)Memory used [KB]: 1274
% 0.59/0.77 % (10508)Time elapsed: 0.007 s
% 0.59/0.77 % (10508)Instructions burned: 14 (million)
% 0.59/0.77 % (10508)------------------------------
% 0.59/0.77 % (10508)------------------------------
% 0.59/0.77 % (10503)Refutation not found, incomplete strategy% (10503)------------------------------
% 0.59/0.77 % (10503)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.59/0.77 % (10503)Termination reason: Refutation not found, incomplete strategy
% 0.59/0.77
% 0.59/0.77 % (10503)Memory used [KB]: 1274
% 0.59/0.77 % (10503)Time elapsed: 0.007 s
% 0.59/0.77 % (10503)Instructions burned: 14 (million)
% 0.59/0.77 % (10503)------------------------------
% 0.59/0.77 % (10503)------------------------------
% 0.59/0.77 % (10506)Termination reason: Refutation not found, incomplete strategy
% 0.59/0.77
% 0.59/0.77 % (10506)Memory used [KB]: 1275
% 0.59/0.77 % (10506)Time elapsed: 0.007 s
% 0.59/0.77 % (10506)Instructions burned: 14 (million)
% 0.59/0.77 % (10506)------------------------------
% 0.59/0.77 % (10506)------------------------------
% 0.59/0.78 % (10509)Refutation not found, incomplete strategy% (10509)------------------------------
% 0.59/0.78 % (10509)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.59/0.78 % (10509)Termination reason: Refutation not found, incomplete strategy
% 0.59/0.78
% 0.59/0.78 % (10509)Memory used [KB]: 1274
% 0.59/0.78 % (10509)Time elapsed: 0.008 s
% 0.59/0.78 % (10509)Instructions burned: 15 (million)
% 0.59/0.78 % (10509)------------------------------
% 0.59/0.78 % (10509)------------------------------
% 0.59/0.78 % (10518)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/208Mi)
% 0.59/0.78 % (10519)lrs-1011_1:1_sil=4000:plsq=on:plsqr=32,1:sp=frequency:plsql=on:nwc=10.0:i=52:aac=none:afr=on:ss=axioms:er=filter:sgt=16:rawr=on:etr=on:lma=on_0 on Vampire---4 for (2996ds/52Mi)
% 0.59/0.78 % (10520)lrs-1010_1:1_to=lpo:sil=2000:sp=reverse_arity:sos=on:urr=ec_only:i=518:sd=2:bd=off:ss=axioms:sgt=16_0 on Vampire---4 for (2996ds/518Mi)
% 0.59/0.78 % (10522)lrs+1011_87677:1048576_sil=8000:sos=on:spb=non_intro:nwc=10.0:kmz=on:i=42:ep=RS:nm=0:ins=1:uhcvi=on:rawr=on:fde=unused:afp=2000:afq=1.444:plsq=on:nicw=on_0 on Vampire---4 for (2996ds/42Mi)
% 0.59/0.78 % (10507)Instruction limit reached!
% 0.59/0.78 % (10507)------------------------------
% 0.59/0.78 % (10507)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.59/0.78 % (10507)Termination reason: Unknown
% 0.59/0.78 % (10507)Termination phase: Property scanning
% 0.59/0.78
% 0.59/0.78 % (10507)Memory used [KB]: 2181
% 0.59/0.78 % (10507)Time elapsed: 0.017 s
% 0.59/0.78 % (10507)Instructions burned: 34 (million)
% 0.59/0.78 % (10507)------------------------------
% 0.59/0.78 % (10507)------------------------------
% 0.59/0.78 % (10518)Refutation not found, incomplete strategy% (10518)------------------------------
% 0.59/0.78 % (10518)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.59/0.78 % (10519)Refutation not found, incomplete strategy% (10519)------------------------------
% 0.59/0.78 % (10519)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.59/0.78 % (10519)Termination reason: Refutation not found, incomplete strategy
% 0.59/0.78
% 0.59/0.78 % (10519)Memory used [KB]: 1290
% 0.59/0.78 % (10519)Time elapsed: 0.007 s
% 0.59/0.78 % (10519)Instructions burned: 14 (million)
% 0.59/0.78 % (10519)------------------------------
% 0.59/0.78 % (10519)------------------------------
% 0.59/0.78 % (10520)Refutation not found, incomplete strategy% (10520)------------------------------
% 0.59/0.78 % (10520)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.59/0.78 % (10520)Termination reason: Refutation not found, incomplete strategy
% 0.59/0.78
% 0.59/0.78 % (10520)Memory used [KB]: 1290
% 0.59/0.78 % (10520)Time elapsed: 0.008 s
% 0.59/0.78 % (10520)Instructions burned: 14 (million)
% 0.59/0.78 % (10520)------------------------------
% 0.59/0.78 % (10520)------------------------------
% 0.59/0.78 % (10518)Termination reason: Refutation not found, incomplete strategy
% 0.59/0.78
% 0.59/0.78 % (10518)Memory used [KB]: 1274
% 0.59/0.78 % (10518)Time elapsed: 0.008 s
% 0.59/0.78 % (10518)Instructions burned: 14 (million)
% 0.59/0.78 % (10518)------------------------------
% 0.59/0.78 % (10518)------------------------------
% 0.59/0.79 % (10513)Instruction limit reached!
% 0.59/0.79 % (10513)------------------------------
% 0.59/0.79 % (10513)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.59/0.79 % (10513)Termination reason: Unknown
% 0.59/0.79 % (10513)Termination phase: Saturation
% 0.59/0.79
% 0.59/0.79 % (10513)Memory used [KB]: 2413
% 0.59/0.79 % (10513)Time elapsed: 0.014 s
% 0.59/0.79 % (10513)Instructions burned: 55 (million)
% 0.59/0.79 % (10513)------------------------------
% 0.59/0.79 % (10513)------------------------------
% 0.59/0.79 % (10514)Instruction limit reached!
% 0.59/0.79 % (10514)------------------------------
% 0.59/0.79 % (10514)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.59/0.79 % (10514)Termination reason: Unknown
% 0.59/0.79 % (10514)Termination phase: Property scanning
% 0.59/0.79
% 0.59/0.79 % (10514)Memory used [KB]: 2332
% 0.59/0.79 % (10514)Time elapsed: 0.014 s
% 0.59/0.79 % (10514)Instructions burned: 52 (million)
% 0.59/0.79 % (10514)------------------------------
% 0.59/0.79 % (10514)------------------------------
% 0.59/0.79 % (10528)dis+1011_1258907:1048576_bsr=unit_only:to=lpo:drc=off:sil=2000:tgt=full:fde=none:sp=frequency:spb=goal:rnwc=on:nwc=6.70083:sac=on:newcnf=on:st=2:i=243:bs=unit_only:sd=3:afp=300:awrs=decay:awrsf=218:nm=16:ins=3:afq=3.76821:afr=on:ss=axioms:sgt=5:rawr=on:add=off:bsd=on_0 on Vampire---4 for (2995ds/243Mi)
% 0.59/0.79 % (10532)lrs+1666_1:1_sil=4000:sp=occurrence:sos=on:urr=on:newcnf=on:i=62:amm=off:ep=R:erd=off:nm=0:plsq=on:plsqr=14,1_0 on Vampire---4 for (2995ds/62Mi)
% 0.59/0.79 % (10534)lrs+21_2461:262144_anc=none:drc=off:sil=2000:sp=occurrence:nwc=6.0:updr=off:st=3.0:i=32:sd=2:afp=4000:erml=3:nm=14:afq=2.0:uhcvi=on:ss=included:er=filter:abs=on:nicw=on:ile=on:sims=off:s2a=on:s2agt=50:s2at=-1.0:plsq=on:plsql=on:plsqc=2:plsqr=1,32:newcnf=on:bd=off:to=lpo_0 on Vampire---4 for (2995ds/32Mi)
% 0.59/0.79 % (10529)lrs+1011_2:9_sil=2000:lsd=10:newcnf=on:i=117:sd=2:awrs=decay:ss=included:amm=off:ep=R_0 on Vampire---4 for (2995ds/117Mi)
% 0.59/0.79 % (10530)dis+1011_11:1_sil=2000:avsq=on:i=143:avsqr=1,16:ep=RS:rawr=on:aac=none:lsd=100:mep=off:fde=none:newcnf=on:bsr=unit_only_0 on Vampire---4 for (2995ds/143Mi)
% 0.59/0.79 % (10531)lrs+1011_1:2_to=lpo:sil=8000:plsqc=1:plsq=on:plsqr=326,59:sp=weighted_frequency:plsql=on:nwc=10.0:newcnf=on:i=93:awrs=converge:awrsf=200:bd=off:ins=1:rawr=on:alpa=false:avsq=on:avsqr=1,16_0 on Vampire---4 for (2995ds/93Mi)
% 0.59/0.79 % (10504)Instruction limit reached!
% 0.59/0.79 % (10504)------------------------------
% 0.59/0.79 % (10504)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.59/0.79 % (10504)Termination reason: Unknown
% 0.59/0.79 % (10504)Termination phase: Property scanning
% 0.59/0.79
% 0.59/0.79 % (10504)Memory used [KB]: 2342
% 0.59/0.79 % (10504)Time elapsed: 0.024 s
% 0.59/0.79 % (10504)Instructions burned: 51 (million)
% 0.59/0.79 % (10504)------------------------------
% 0.59/0.79 % (10504)------------------------------
% 0.59/0.79 % (10528)Refutation not found, incomplete strategy% (10528)------------------------------
% 0.59/0.79 % (10528)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.59/0.79 % (10528)Termination reason: Refutation not found, incomplete strategy
% 0.59/0.79
% 0.59/0.79 % (10528)Memory used [KB]: 1275
% 0.59/0.79 % (10528)Time elapsed: 0.007 s
% 0.59/0.79 % (10528)Instructions burned: 14 (million)
% 0.59/0.79 % (10528)------------------------------
% 0.59/0.79 % (10528)------------------------------
% 0.59/0.80 % (10536)dis+1011_1:1_sil=16000:nwc=7.0:s2agt=64:s2a=on:i=1919:ss=axioms:sgt=8:lsd=50:sd=7_0 on Vampire---4 for (2995ds/1919Mi)
% 0.59/0.80 % (10534)Instruction limit reached!
% 0.59/0.80 % (10534)------------------------------
% 0.59/0.80 % (10534)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.59/0.80 % (10534)Termination reason: Unknown
% 0.59/0.80 % (10534)Termination phase: Property scanning
% 0.59/0.80
% 0.59/0.80 % (10534)Memory used [KB]: 1939
% 0.59/0.80 % (10534)Time elapsed: 0.009 s
% 0.59/0.80 % (10534)Instructions burned: 33 (million)
% 0.59/0.80 % (10534)------------------------------
% 0.59/0.80 % (10534)------------------------------
% 0.76/0.80 % (10522)Instruction limit reached!
% 0.76/0.80 % (10522)------------------------------
% 0.76/0.80 % (10522)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.76/0.80 % (10522)Termination reason: Unknown
% 0.76/0.80 % (10522)Termination phase: Function definition elimination
% 0.76/0.80
% 0.76/0.80 % (10522)Memory used [KB]: 2252
% 0.76/0.80 % (10522)Time elapsed: 0.020 s
% 0.76/0.80 % (10522)Instructions burned: 42 (million)
% 0.76/0.80 % (10522)------------------------------
% 0.76/0.80 % (10522)------------------------------
% 0.76/0.80 % (10538)ott-32_5:1_sil=4000:sp=occurrence:urr=full:rp=on:nwc=5.0:newcnf=on:st=5.0:s2pl=on:i=55:sd=2:ins=2:ss=included:rawr=on:anc=none:sos=on:s2agt=8:spb=intro:ep=RS:avsq=on:avsqr=27,155:lma=on_0 on Vampire---4 for (2995ds/55Mi)
% 0.76/0.80 % (10539)lrs-1011_1:1_sil=2000:sos=on:urr=on:i=53:sd=1:bd=off:ins=3:av=off:ss=axioms:sgt=16:gsp=on:lsd=10_0 on Vampire---4 for (2995ds/53Mi)
% 0.76/0.80 % (10536)Refutation not found, incomplete strategy% (10536)------------------------------
% 0.76/0.80 % (10536)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.76/0.80 % (10536)Termination reason: Refutation not found, incomplete strategy
% 0.76/0.80
% 0.76/0.80 % (10536)Memory used [KB]: 1290
% 0.76/0.80 % (10536)Time elapsed: 0.007 s
% 0.76/0.80 % (10536)Instructions burned: 15 (million)
% 0.76/0.80 % (10536)------------------------------
% 0.76/0.80 % (10536)------------------------------
% 0.76/0.80 % (10539)Refutation not found, incomplete strategy% (10539)------------------------------
% 0.76/0.80 % (10539)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.76/0.80 % (10539)Termination reason: Refutation not found, incomplete strategy
% 0.76/0.80
% 0.76/0.80 % (10539)Memory used [KB]: 1290
% 0.76/0.80 % (10539)Time elapsed: 0.003 s
% 0.76/0.80 % (10539)Instructions burned: 14 (million)
% 0.76/0.80 % (10539)------------------------------
% 0.76/0.80 % (10539)------------------------------
% 0.76/0.80 % (10540)lrs+1011_6929:65536_anc=all_dependent:sil=2000:fde=none:plsqc=1:plsq=on:plsqr=19,8:plsql=on:nwc=3.0:i=46:afp=4000:ep=R:nm=3:fsr=off:afr=on:aer=off:gsp=on_0 on Vampire---4 for (2995ds/46Mi)
% 0.76/0.80 % (10544)ott+1011_9:29_slsqr=3,2:sil=2000:tgt=ground:lsd=10:lcm=predicate:avsqc=4:slsq=on:avsq=on:i=35:s2at=4.0:add=large:sd=1:avsqr=1,16:aer=off:ss=axioms:sgt=100:rawr=on:s2a=on:sac=on:afp=1:nwc=10.0:nm=64:bd=preordered:abs=on:rnwc=on:er=filter:nicw=on:spb=non_intro:lma=on_0 on Vampire---4 for (2995ds/35Mi)
% 0.76/0.80 % (10532)Instruction limit reached!
% 0.76/0.80 % (10532)------------------------------
% 0.76/0.80 % (10532)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.76/0.80 % (10532)Termination reason: Unknown
% 0.76/0.80 % (10532)Termination phase: Saturation
% 0.76/0.80
% 0.76/0.80 % (10532)Memory used [KB]: 2373
% 0.76/0.80 % (10532)Time elapsed: 0.017 s
% 0.76/0.80 % (10532)Instructions burned: 64 (million)
% 0.76/0.80 % (10532)------------------------------
% 0.76/0.80 % (10532)------------------------------
% 0.76/0.81 % (10543)dis+10_3:31_sil=2000:sp=frequency:abs=on:acc=on:lcm=reverse:nwc=3.0:alpa=random:st=3.0:i=102:sd=1:nm=4:ins=1:aer=off:ss=axioms_0 on Vampire---4 for (2995ds/102Mi)
% 0.76/0.81 % (10546)dis+1003_1:1024_sil=4000:urr=on:newcnf=on:i=87:av=off:fsr=off:bce=on_0 on Vampire---4 for (2995ds/87Mi)
% 0.76/0.81 % (10544)Refutation not found, incomplete strategy% (10544)------------------------------
% 0.76/0.81 % (10544)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.76/0.81 % (10544)Termination reason: Refutation not found, incomplete strategy
% 0.76/0.81
% 0.76/0.81 % (10544)Memory used [KB]: 1291
% 0.76/0.81 % (10544)Time elapsed: 0.004 s
% 0.76/0.81 % (10544)Instructions burned: 15 (million)
% 0.76/0.81 % (10544)------------------------------
% 0.76/0.81 % (10544)------------------------------
% 0.76/0.81 % (10549)dis+1010_12107:524288_anc=none:drc=encompass:sil=2000:bsd=on:rp=on:nwc=10.0:alpa=random:i=109:kws=precedence:awrs=decay:awrsf=2:nm=16:ins=3:rawr=on:s2a=on:s2at=4.5:acc=on:flr=on_0 on Vampire---4 for (2995ds/109Mi)
% 0.76/0.81 % (10543)Refutation not found, incomplete strategy% (10543)------------------------------
% 0.76/0.81 % (10543)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.76/0.81 % (10543)Termination reason: Refutation not found, incomplete strategy
% 0.76/0.81
% 0.76/0.81 % (10543)Memory used [KB]: 1274
% 0.76/0.81 % (10543)Time elapsed: 0.008 s
% 0.76/0.81 % (10543)Instructions burned: 14 (million)
% 0.76/0.81 % (10543)------------------------------
% 0.76/0.81 % (10543)------------------------------
% 0.76/0.82 % (10551)lrs+1002_1:16_sil=2000:sp=occurrence:sos=on:i=161:aac=none:bd=off:ss=included:sd=5:st=2.5:sup=off_0 on Vampire---4 for (2995ds/161Mi)
% 0.76/0.82 % (10540)Instruction limit reached!
% 0.76/0.82 % (10540)------------------------------
% 0.76/0.82 % (10540)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.76/0.82 % (10540)Termination reason: Unknown
% 0.76/0.82 % (10540)Termination phase: Property scanning
% 0.76/0.82
% 0.76/0.82 % (10538)Instruction limit reached!
% 0.76/0.82 % (10538)------------------------------
% 0.76/0.82 % (10538)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.76/0.82 % (10540)Memory used [KB]: 2269
% 0.76/0.82 % (10540)Time elapsed: 0.022 s
% 0.76/0.82 % (10540)Instructions burned: 46 (million)
% 0.76/0.82 % (10540)------------------------------
% 0.76/0.82 % (10540)------------------------------
% 0.76/0.82 % (10538)Termination reason: Unknown
% 0.76/0.82 % (10538)Termination phase: Property scanning
% 0.76/0.82
% 0.76/0.82 % (10538)Memory used [KB]: 2149
% 0.76/0.82 % (10538)Time elapsed: 0.026 s
% 0.76/0.82 % (10538)Instructions burned: 57 (million)
% 0.76/0.82 % (10538)------------------------------
% 0.76/0.82 % (10538)------------------------------
% 0.76/0.83 % (10558)lrs-1002_2:9_anc=none:sil=2000:plsqc=1:plsq=on:avsql=on:plsqr=2859761,1048576:erd=off:rp=on:nwc=21.7107:newcnf=on:avsq=on:i=69:aac=none:avsqr=6317,1048576:ep=RS:fsr=off:rawr=on:afp=50:afq=2.133940627822616:sac=on_0 on Vampire---4 for (2995ds/69Mi)
% 0.76/0.83 % (10559)lrs+1010_1:512_sil=8000:tgt=ground:spb=units:gs=on:lwlo=on:nicw=on:gsem=on:st=1.5:i=40:nm=21:ss=included:nwc=5.3:afp=4000:afq=1.38:ins=1:bs=unit_only:awrs=converge:awrsf=10:bce=on_0 on Vampire---4 for (2995ds/40Mi)
% 0.76/0.83 % (10549)First to succeed.
% 0.88/0.83 % (10549)Refutation found. Thanks to Tanya!
% 0.88/0.83 % SZS status Unsatisfiable for Vampire---4
% 0.88/0.83 % SZS output start Proof for Vampire---4
% See solution above
% 0.88/0.83 % (10549)------------------------------
% 0.88/0.83 % (10549)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.88/0.83 % (10549)Termination reason: Refutation
% 0.88/0.83
% 0.88/0.83 % (10549)Memory used [KB]: 2539
% 0.88/0.83 % (10549)Time elapsed: 0.020 s
% 0.88/0.83 % (10549)Instructions burned: 77 (million)
% 0.88/0.83 % (10549)------------------------------
% 0.88/0.83 % (10549)------------------------------
% 0.88/0.83 % (10467)Success in time 0.465 s
% 0.88/0.83 % Vampire---4.8 exiting
%------------------------------------------------------------------------------