Average Error: 0.0 → 0.0
Time: 7.7s
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 r120005 = x;
        double r120006 = r120005 * r120005;
        double r120007 = y;
        double r120008 = r120007 * r120007;
        double r120009 = r120006 + r120008;
        return r120009;
}
↓
double f(double x, double y) {
        double r120010 = x;
        double r120011 = r120010 * r120010;
        double r120012 = y;
        double r120013 = r120012 * r120012;
        double r120014 = r120011 + r120013;
        return r120014;
}

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)))