Average Error: 0.0 → 0.0
Time: 6.4s
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 r5284242 = x;
        double r5284243 = y;
        double r5284244 = r5284243 * r5284243;
        double r5284245 = r5284242 - r5284244;
        return r5284245;
}
↓
double f(double x, double y) {
        double r5284246 = x;
        double r5284247 = y;
        double r5284248 = r5284247 * r5284247;
        double r5284249 = r5284246 - r5284248;
        return r5284249;
}

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 2019172 +o rules:numerics
(FPCore (x y)
  :name "Graphics.Rasterific.Shading:$sradialGradientWithFocusShader from Rasterific-0.6.1"
  (- x (* y y)))