Average Error: 0.0 → 0.0
Time: 802.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 r162708 = x;
        double r162709 = y;
        double r162710 = r162709 * r162709;
        double r162711 = r162708 - r162710;
        return r162711;
}
↓
double f(double x, double y) {
        double r162712 = x;
        double r162713 = y;
        double r162714 = r162713 * r162713;
        double r162715 = r162712 - r162714;
        return r162715;
}

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