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 r9561239 = x;
        double r9561240 = r9561239 * r9561239;
        double r9561241 = y;
        double r9561242 = r9561241 * r9561241;
        double r9561243 = r9561240 + r9561242;
        return r9561243;
}
↓
double f(double x, double y) {
        double r9561244 = x;
        double r9561245 = r9561244 * r9561244;
        double r9561246 = y;
        double r9561247 = r9561246 * r9561246;
        double r9561248 = r9561245 + r9561247;
        return r9561248;
}

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