Average Error: 0.0 → 0.0
Time: 2.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 r216269 = x;
        double r216270 = y;
        double r216271 = r216270 * r216270;
        double r216272 = r216269 - r216271;
        return r216272;
}
↓
double f(double x, double y) {
        double r216273 = x;
        double r216274 = y;
        double r216275 = r216274 * r216274;
        double r216276 = r216273 - r216275;
        return r216276;
}

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