Average Error: 0.0 → 0.0
Time: 48.0s
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 r18975364 = x;
        double r18975365 = r18975364 * r18975364;
        double r18975366 = y;
        double r18975367 = r18975366 * r18975366;
        double r18975368 = r18975365 + r18975367;
        return r18975368;
}
↓
double f(double x, double y) {
        double r18975369 = x;
        double r18975370 = r18975369 * r18975369;
        double r18975371 = y;
        double r18975372 = r18975371 * r18975371;
        double r18975373 = r18975370 + r18975372;
        return r18975373;
}

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