Average Error: 0.0 → 0.0
Time: 4.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 r200966 = x;
        double r200967 = r200966 * r200966;
        double r200968 = y;
        double r200969 = r200968 * r200968;
        double r200970 = r200967 + r200969;
        return r200970;
}
↓
double f(double x, double y) {
        double r200971 = x;
        double r200972 = r200971 * r200971;
        double r200973 = y;
        double r200974 = r200973 * r200973;
        double r200975 = r200972 + r200974;
        return r200975;
}

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