Average Error: 0.0 → 0.0
Time: 5.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 r164892 = x;
        double r164893 = r164892 * r164892;
        double r164894 = y;
        double r164895 = r164894 * r164894;
        double r164896 = r164893 + r164895;
        return r164896;
}
↓
double f(double x, double y) {
        double r164897 = x;
        double r164898 = r164897 * r164897;
        double r164899 = y;
        double r164900 = r164899 * r164899;
        double r164901 = r164898 + r164900;
        return r164901;
}

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