Average Error: 0.0 → 0.0
Time: 1.4s
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 r220609 = x;
        double r220610 = r220609 * r220609;
        double r220611 = y;
        double r220612 = r220611 * r220611;
        double r220613 = r220610 + r220612;
        return r220613;
}
↓
double f(double x, double y) {
        double r220614 = x;
        double r220615 = r220614 * r220614;
        double r220616 = y;
        double r220617 = r220616 * r220616;
        double r220618 = r220615 + r220617;
        return r220618;
}

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 2019353 
(FPCore (x y)
  :name "Graphics.Rasterific.Linear:$cquadrance from Rasterific-0.6.1"
  :precision binary64
  (+ (* x x) (* y y)))