WORST_CASE(?, O(n^1)) fafcafcXXfcafdbfafdafdXXfcbfdaegXeXa0c1d1b0g1f1e112.120012a00c000d000b00g000f001e002a14c143f131b16d165f151a18d187f171e102b210d2109f29101416181101AProVEAProVE 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