WORST_CASE(?, O(n^1)) comp_f_g#1plus_xx3comp_f_gx1x20plus_x#1x3comp_f_g#1x1x20comp_f_g#1plus_xx3id0plus_x#1x30map#2NilNilmap#2Consx16x6Consplus_xx16map#2x6plus_x#10x6x6plus_x#1Sx8x10Splus_x#1x8x10foldr_f#3Nil00foldr_f#3Consx16x5x24comp_f_g#1x16foldr#3x5x24foldr#3Nilidfoldr#3Consx32x6comp_f_gx32foldr#3x6mainx3foldr_f#3map#2x30plus_x1comp_f_g200id0Nil0Cons2S1comp_f_g#13map#21plus_x#12foldr_f#32foldr#31main112.1200123456plus_x000comp_f_g0000000id00Nil00Cons0000S000comp_f_g#100001map#2002plus_x#10003foldr_f#30004foldr#3005main006018comp_f_g#110087plus_x#11071019plus_x#11091Nil12plus_x1010map#21011Cons110112plus_x#110012S1123014foldr#31013comp_f_g#1101304id15foldr#31014comp_f_g10145map#210150116foldr_f#3115166plus_x#11077plus_x#11097Nil111Nil115Cons1101111Cons1101115plus_x#110712S1121plus_x#110912S11212id113id114comp_f_g101413comp_f_g101414comp_f_g#1101487plus_x#11074plus_x#11094S1127026foldr#321117comp_f_g#121017166id217foldr#321118comp_f_g2101817id218comp_f_g21018180220comp_f_g#1210182019plus_x#1201960221plus_x#120216plus_x#1201919plus_x#1202119plus_x#1101912S1126plus_x#1102112S112190301271712749197196191221621122119AProVEAProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Statistics for single proof: 100.00 % (1 real / 0 unknown / 0 assumptions / 1 total proof steps)http://aprove.informatik.rwth-aachen.deJohnDoe