Average Error: 0.0 → 0.0
Time: 408.0ms
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 r161559 = x;
        double r161560 = y;
        double r161561 = r161560 * r161560;
        double r161562 = r161559 - r161561;
        return r161562;
}
↓
double f(double x, double y) {
        double r161563 = x;
        double r161564 = y;
        double r161565 = r161564 * r161564;
        double r161566 = r161563 - r161565;
        return r161566;
}

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