Average Error: 0.0 → 0.0
Time: 1.1s
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 r132510 = x;
        double r132511 = r132510 * r132510;
        double r132512 = y;
        double r132513 = r132512 * r132512;
        double r132514 = r132511 + r132513;
        return r132514;
}
↓
double f(double x, double y) {
        double r132515 = x;
        double r132516 = r132515 * r132515;
        double r132517 = y;
        double r132518 = r132517 * r132517;
        double r132519 = r132516 + r132518;
        return r132519;
}

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