WORST_CASE(?, O(n^1)) normnil0normgxysnormxfxnilgnilxfxgyzgfxyzremnilynilremgxy0gxyremgxyszremxznil000g2s1norm1f2rem212.1100123nil00000g0000s000norm001f0002rem0003011norm104s141nil15g1502f1006g1602nil13g1003rem1003014s144g1506g1606AProVEAProVE 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