Average Error: 0.0 → 0.0
Time: 3.8s
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 r97812 = x;
        double r97813 = y;
        double r97814 = r97813 * r97813;
        double r97815 = r97812 - r97814;
        return r97815;
}
↓
double f(double x, double y) {
        double r97816 = x;
        double r97817 = y;
        double r97818 = r97817 * r97817;
        double r97819 = r97816 - r97818;
        return r97819;
}

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