WORST_CASE(?, O(n^1)) fnilnilf.nily.nilfyf..xyzf.x.yzgnilnilg.xnil.gxnilg.x.yzg..xyznil0.2f1g112.110012nil00.0000f001g002nil11nil13f104.1341.1006.1065f151nil12g107nil18.1782.10010.11009g192nil14.1344f164f154.1066nil17.1787g1107g197.110010AProVEAProVE 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