WORST_CASE(?, O(n^2)) gcdx0xgcd0yygcdsxsyif<xygcdsx-yxgcd-xysy00s1if3<2-2gcd222.1gcdz00z0gcdz00cgcd0z0z0gcd0z0c1gcdsz0sz1if<z0z1gcdsz0-z1z0gcd-z0z1sz1gcdsz0sz1c2gcdsz0-z1z0gcd-z0z1sz1gcdz00gcd0z0gcdsz0sz1gcdz00z0gcd0z0z0gcdsz0sz1if<z0z1gcdsz0-z1z0gcd-z0z1sz11c00c100c2211012gcd231022003s10-20gcdz00cgcd0z0c1gcdz00cgcd0z0c1gcdsz0sz1c2gcdsz0-z1z0gcd-z0z1sz12c00c100c2211012gcd22120000s12-20gcdsz0sz1c2gcdsz0-z1z0gcd-z0z1sz1gcdz00cgcd0z0c1gcdsz0sz1c2gcdsz0-z1z0gcd-z0z1sz1AProVEAProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Statistics for single proof: 100.00 % (5 real / 0 unknown / 0 assumptions / 5 total proof steps)http://aprove.informatik.rwth-aachen.deJohnDoe