WORST_CASE(?, O(n^1)) Dt1Dconstant0D+xy+DxDyD*xy+*yDx*xDyD-xy-DxDyt010constant000+2*2-2D112.1Dt1DtcDconstant0Dconstantc1D+z0z1+Dz0Dz1D+z0z1c2Dz0Dz1D*z0z1+*z1Dz0*z0Dz1D*z0z1c3Dz0Dz1D-z0z1-Dz0Dz1D-z0z1c4Dz0Dz1DtDconstantD+z0z1D*z0z1D-z0z1Dt1Dconstant0D+z0z1+Dz0Dz1D*z0z1+*z1Dz0*z0Dz1D-z0z1-Dz0Dz11c00c100c2211012c3211012c4211012D1210t03constant03+221112*231112-221112DtcDconstantc1D+z0z1c2Dz0Dz1D*z0z1c3Dz0Dz1D-z0z1c4Dz0Dz1DtcDconstantc1D+z0z1c2Dz0Dz1D*z0z1c3Dz0Dz1D-z0z1c4Dz0Dz1AProVEAProVE 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