Average Error: 0.0 → 0.0
Time: 1.1s
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 r161928 = x;
        double r161929 = y;
        double r161930 = r161929 * r161929;
        double r161931 = r161928 - r161930;
        return r161931;
}
↓
double f(double x, double y) {
        double r161932 = x;
        double r161933 = y;
        double r161934 = r161933 * r161933;
        double r161935 = r161932 - r161934;
        return r161935;
}

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