Average Error: 0.0 → 0.0
Time: 4.9s
Precision: 64
\[x - y \cdot y\]
↓
\[x - y \cdot y\]
x - y \cdot y
↓
x - y \cdot y
double f(double x, double y) {
        double r8566832 = x;
        double r8566833 = y;
        double r8566834 = r8566833 * r8566833;
        double r8566835 = r8566832 - r8566834;
        return r8566835;
}
↓
double f(double x, double y) {
        double r8566836 = x;
        double r8566837 = y;
        double r8566838 = r8566837 * r8566837;
        double r8566839 = r8566836 - r8566838;
        return r8566839;
}

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 - y \cdot y\]

  2. Final simplification0.0

    \[\leadsto x - y \cdot y\]

Reproduce

herbie shell --seed 2019162 +o rules:numerics
(FPCore (x y)
  :name "Graphics.Rasterific.Shading:$sradialGradientWithFocusShader from Rasterific-0.6.1"
  (- x (* y y)))