Average Error: 0.0 → 0.0
Time: 8.3s
Precision: 64
\[x \cdot x + y \cdot y\]
↓
\[x \cdot x + y \cdot y\]
x \cdot x + y \cdot y
↓
x \cdot x + y \cdot y
double f(double x, double y) {
        double r116686 = x;
        double r116687 = r116686 * r116686;
        double r116688 = y;
        double r116689 = r116688 * r116688;
        double r116690 = r116687 + r116689;
        return r116690;
}
↓
double f(double x, double y) {
        double r116691 = x;
        double r116692 = r116691 * r116691;
        double r116693 = y;
        double r116694 = r116693 * r116693;
        double r116695 = r116692 + r116694;
        return r116695;
}

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. Final simplification0.0

    \[\leadsto x \cdot x + y \cdot y\]

Reproduce

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