WORST_CASE(?, O(n^1)) termsNconsrecipsqrNsqr00sqrssdbl00dblssadd0XXaddsYsfirst0XnilfirstsconsYconsYcons1recip100s0nil0terms1sqr1dbl1add2first212.110012345cons000recip000000s00nil00terms001sqr002dbl003add0004first0005sqr107recip176cons161012s12013s13s14nil15cons105017s1704AProVEAProVE 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