WORST_CASE(?, O(n^1)) admitxnilniladmitx.u.v.wzcond=sumxuvw.u.v.wadmitcarryxuvzcondtrueyynil0.2w0=2sum3carry3true0admit2cond212.1admitz0nilniladmitz0nilcadmitz0.z1.z2.wz3cond=sumz0z1z2w.z1.z2.wadmitcarryz0z1z2z3admitz0.z1.z2.wz3c1cond=sumz0z1z2w.z1.z2.wadmitcarryz0z1z2z3admitcarryz0z1z2z3condtruez0z0condtruez0c2admitz0niladmitz0.z1.z2.wz3condtruez0condtruez0z01c00c1211012c200admit2111admit2110cond2110nil01.2110w01cond2111=2110sum30carry3110true01condtruez0c2admitz0nilcadmitz0.z1.z2.wz3c1cond=sumz0z1z2w.z1.z2.wadmitcarryz0z1z2z3admitcarryz0z1z2z3condtruez0c21c00c1211012c200admit2111admit2111cond2110nil01.2110w01cond2111=2110sum3110carry30true00admitz0nilcadmitz0nilcadmitz0.z1.z2.wz3c1cond=sumz0z1z2w.z1.z2.wadmitcarryz0z1z2z3admitcarryz0z1z2z3condtruez0c21c00c1211012c200admit2111admit211012cond2110nil01.2112w01cond2111=2110sum30carry3110true00admitz0.z1.z2.wz3c1cond=sumz0z1z2w.z1.z2.wadmitcarryz0z1z2z3admitcarryz0z1z2z3admitz0nilcadmitz0.z1.z2.wz3c1cond=sumz0z1z2w.z1.z2.wadmitcarryz0z1z2z3admitcarryz0z1z2z3condtruez0c2AProVEAProVE 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