Average Error: 0.0 → 0.0
Time: 8.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 r148121 = x;
        double r148122 = r148121 * r148121;
        double r148123 = y;
        double r148124 = r148123 * r148123;
        double r148125 = r148122 + r148124;
        return r148125;
}
↓
double f(double x, double y) {
        double r148126 = x;
        double r148127 = r148126 * r148126;
        double r148128 = y;
        double r148129 = r148128 * r148128;
        double r148130 = r148127 + r148129;
        return r148130;
}

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