Average Error: 0.0 → 0.0
Time: 708.0ms
Precision: 64
\[x \cdot x + y \cdot y\]
\[\mathsf{hypot}\left(x, y\right) \cdot \mathsf{hypot}\left(x, y\right)\]
x \cdot x + y \cdot y
\mathsf{hypot}\left(x, y\right) \cdot \mathsf{hypot}\left(x, y\right)
double f(double x, double y) {
        double r222658 = x;
        double r222659 = r222658 * r222658;
        double r222660 = y;
        double r222661 = r222660 * r222660;
        double r222662 = r222659 + r222661;
        return r222662;
}

double f(double x, double y) {
        double r222663 = x;
        double r222664 = y;
        double r222665 = hypot(r222663, r222664);
        double r222666 = r222665 * r222665;
        return r222666;
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[x \cdot x + y \cdot y\]
  2. Simplified0.0

    \[\leadsto \color{blue}{\mathsf{fma}\left(x, x, y \cdot y\right)}\]
  3. Using strategy rm
  4. Applied add-sqr-sqrt0.0

    \[\leadsto \color{blue}{\sqrt{\mathsf{fma}\left(x, x, y \cdot y\right)} \cdot \sqrt{\mathsf{fma}\left(x, x, y \cdot y\right)}}\]
  5. Simplified0.0

    \[\leadsto \color{blue}{\mathsf{hypot}\left(x, y\right)} \cdot \sqrt{\mathsf{fma}\left(x, x, y \cdot y\right)}\]
  6. Simplified0.0

    \[\leadsto \mathsf{hypot}\left(x, y\right) \cdot \color{blue}{\mathsf{hypot}\left(x, y\right)}\]
  7. Final simplification0.0

    \[\leadsto \mathsf{hypot}\left(x, y\right) \cdot \mathsf{hypot}\left(x, y\right)\]

Reproduce

herbie shell --seed 2020062 +o rules:numerics
(FPCore (x y)
  :name "Graphics.Rasterific.Linear:$cquadrance from Rasterific-0.6.1"
  :precision binary64
  (+ (* x x) (* y y)))