Average Error: 0.0 → 0.0
Time: 611.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 r181867 = x;
        double r181868 = y;
        double r181869 = r181868 * r181868;
        double r181870 = r181867 - r181869;
        return r181870;
}
↓
double f(double x, double y) {
        double r181871 = x;
        double r181872 = y;
        double r181873 = r181872 * r181872;
        double r181874 = r181871 - r181873;
        return r181874;
}

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