Average Error: 0.0 → 0.0
Time: 1.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 r185010 = x;
        double r185011 = r185010 * r185010;
        double r185012 = y;
        double r185013 = r185012 * r185012;
        double r185014 = r185011 + r185013;
        return r185014;
}
↓
double f(double x, double y) {
        double r185015 = x;
        double r185016 = r185015 * r185015;
        double r185017 = y;
        double r185018 = r185017 * r185017;
        double r185019 = r185016 + r185018;
        return r185019;
}

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