Average Error: 0.0 → 0.0
Time: 5.4s
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 r10119533 = x;
        double r10119534 = r10119533 * r10119533;
        double r10119535 = y;
        double r10119536 = r10119535 * r10119535;
        double r10119537 = r10119534 + r10119536;
        return r10119537;
}
↓
double f(double x, double y) {
        double r10119538 = x;
        double r10119539 = r10119538 * r10119538;
        double r10119540 = y;
        double r10119541 = r10119540 * r10119540;
        double r10119542 = r10119539 + r10119541;
        return r10119542;
}

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