Average Error: 0.0 → 0.0
Time: 8.5s
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 r9736926 = x;
        double r9736927 = r9736926 * r9736926;
        double r9736928 = y;
        double r9736929 = r9736928 * r9736928;
        double r9736930 = r9736927 + r9736929;
        return r9736930;
}
↓
double f(double x, double y) {
        double r9736931 = x;
        double r9736932 = r9736931 * r9736931;
        double r9736933 = y;
        double r9736934 = r9736933 * r9736933;
        double r9736935 = r9736932 + r9736934;
        return r9736935;
}

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