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