Average Error: 0.0 → 0.0
Time: 1.1s
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 r240992 = x;
        double r240993 = r240992 * r240992;
        double r240994 = y;
        double r240995 = r240994 * r240994;
        double r240996 = r240993 + r240995;
        return r240996;
}
↓
double f(double x, double y) {
        double r240997 = x;
        double r240998 = r240997 * r240997;
        double r240999 = y;
        double r241000 = r240999 * r240999;
        double r241001 = r240998 + r241000;
        return r241001;
}

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