Average Error: 0.0 → 0.0
Time: 6.9s
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 r173073 = x;
        double r173074 = r173073 * r173073;
        double r173075 = y;
        double r173076 = r173075 * r173075;
        double r173077 = r173074 + r173076;
        return r173077;
}
↓
double f(double x, double y) {
        double r173078 = x;
        double r173079 = r173078 * r173078;
        double r173080 = y;
        double r173081 = r173080 * r173080;
        double r173082 = r173079 + r173081;
        return r173082;
}

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