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