Average Error: 0.0 → 0.0
Time: 8.0s
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 r182628 = x;
        double r182629 = r182628 * r182628;
        double r182630 = y;
        double r182631 = r182630 * r182630;
        double r182632 = r182629 + r182631;
        return r182632;
}
↓
double f(double x, double y) {
        double r182633 = x;
        double r182634 = r182633 * r182633;
        double r182635 = y;
        double r182636 = r182635 * r182635;
        double r182637 = r182634 + r182636;
        return r182637;
}

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