Average Error: 0.0 → 0.0
Time: 3.6s
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 r3923648 = x;
        double r3923649 = r3923648 * r3923648;
        double r3923650 = y;
        double r3923651 = r3923650 * r3923650;
        double r3923652 = r3923649 + r3923651;
        return r3923652;
}
↓
double f(double x, double y) {
        double r3923653 = x;
        double r3923654 = r3923653 * r3923653;
        double r3923655 = y;
        double r3923656 = r3923655 * r3923655;
        double r3923657 = r3923654 + r3923656;
        return r3923657;
}

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