WORST_CASE(?, O(n^1)) ackinsXsYu21ackinsXYXu21ackoutXYu22ackinYXs1ackout1u221ackin2u21212.1ackinsz0sz1u21ackinsz0z1z0ackinsz0sz1cu21ackinsz0z1z0ackinsz0z1u21ackoutz0z1u22ackinz1z0u21ackoutz0z1c1ackinz1z0ackinsz0sz1u21ackoutz0z11c211012c11110ackin20u212210ackin20u212110s10ackout1311u2210u21ackoutz0z1c1ackinz1z0ackinsz0sz1cu21ackinsz0z1z0ackinsz0z1u21ackoutz0z1c1ackinz1z0u21ackoutz0z1u22ackinz1z0ackinsz0sz1u21ackinsz0z1z01c211012c11110ackin20u212110ackin2112u212110s1111ackout1111u221111ackinsz0sz1cu21ackinsz0z1z0ackinsz0z1ackinsz0sz1cu21ackinsz0z1z0ackinsz0z1u21ackoutz0z1c1ackinz1z0u21ackoutz0z1u22ackinz1z0ackinsz0sz1u21ackinsz0z1z0AProVEAProVE 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