Average Error: 0.0 → 0.0
Time: 7.7s
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 r121043 = x;
        double r121044 = r121043 * r121043;
        double r121045 = y;
        double r121046 = r121045 * r121045;
        double r121047 = r121044 + r121046;
        return r121047;
}
↓
double f(double x, double y) {
        double r121048 = x;
        double r121049 = r121048 * r121048;
        double r121050 = y;
        double r121051 = r121050 * r121050;
        double r121052 = r121049 + r121051;
        return r121052;
}

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