Average Error: 0.0 → 0.0
Time: 971.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 r219766 = x;
        double r219767 = y;
        double r219768 = r219767 * r219767;
        double r219769 = r219766 - r219768;
        return r219769;
}
↓
double f(double x, double y) {
        double r219770 = x;
        double r219771 = y;
        double r219772 = r219771 * r219771;
        double r219773 = r219770 - r219772;
        return r219773;
}

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