WORST_CASE(?, O(n^3)) add0Sxx2+S0add0x2xadd00x2x2+xS0Sx+S0ySyS100add02+232.1add0Sz0z1+S0add0z1z0add0Sz0z1c2+S0add0z1z0add0z1z0add00z0z0add00z0c3+z0S0Sz0+z0S0c+S0z0Sz0+S0z0c1+z0S0+S0z0add0Sz0z1add00z03c00c100c2211012c300add020+2111122112111111112111221+21101111111add021S10000add00z0c3+z0S0c+S0z0c1add0Sz0z1c2+S0add0z1z0add0z1z0add00z0c31c00c100c2211012c300add0211012+211012+20add0211012S1111000add0Sz0z1c2+S0add0z1z0add0z1z0+z0S0c+S0z0c1add0Sz0z1c2+S0add0z1z0add0z1z0add00z0c3AProVEAProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Statistics for single proof: 100.00 % (4 real / 0 unknown / 0 assumptions / 4 total proof steps)http://aprove.informatik.rwth-aachen.deJohnDoe