Average Error: 0.0 → 0.0
Time: 12.6s
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 r10320250 = x;
        double r10320251 = r10320250 * r10320250;
        double r10320252 = y;
        double r10320253 = r10320252 * r10320252;
        double r10320254 = r10320251 + r10320253;
        return r10320254;
}
↓
double f(double x, double y) {
        double r10320255 = x;
        double r10320256 = r10320255 * r10320255;
        double r10320257 = y;
        double r10320258 = r10320257 * r10320257;
        double r10320259 = r10320256 + r10320258;
        return r10320259;
}

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