Average Error: 0.0 → 0.0
Time: 1.2s
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 r236268 = x;
        double r236269 = y;
        double r236270 = r236269 * r236269;
        double r236271 = r236268 - r236270;
        return r236271;
}
↓
double f(double x, double y) {
        double r236272 = x;
        double r236273 = y;
        double r236274 = r236273 * r236273;
        double r236275 = r236272 - r236274;
        return r236275;
}

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 2020036 
(FPCore (x y)
  :name "Graphics.Rasterific.Shading:$sradialGradientWithFocusShader from Rasterific-0.6.1"
  :precision binary64
  (- x (* y y)))