Average Error: 0.0 → 0.0
Time: 549.0ms
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 r201532 = x;
        double r201533 = r201532 * r201532;
        double r201534 = y;
        double r201535 = r201534 * r201534;
        double r201536 = r201533 + r201535;
        return r201536;
}
↓
double f(double x, double y) {
        double r201537 = x;
        double r201538 = r201537 * r201537;
        double r201539 = y;
        double r201540 = r201539 * r201539;
        double r201541 = r201538 + r201540;
        return r201541;
}

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