WORST_CASE(?, O(n^1)) f0y0fsxyffxyy00s1f212.1f0z00f0z0cfsz0z1ffz0z1z1fsz0z1c1ffz0z1z1fz0z1f0z0fsz0z11c00c1211012f21f2110001s1111f0z0cf0z0cfsz0z1c1ffz0z1z1fz0z1f0z00fsz0z1ffz0z1z11c00c1211012f20f2110000s1111fsz0z1c1ffz0z1z1fz0z1f0z0cfsz0z1c1ffz0z1z1fz0z1f0z00fsz0z1ffz0z1z1AProVEAProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Statistics for single proof: 100.00 % (4 real / 0 unknown / 0 assumptions / 4 total proof steps)http://aprove.informatik.rwth-aachen.deJohnDoe