Average Error: 0.0 → 0.0
Time: 10.6s
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 r144418 = x;
        double r144419 = y;
        double r144420 = r144419 * r144419;
        double r144421 = r144418 - r144420;
        return r144421;
}
↓
double f(double x, double y) {
        double r144422 = x;
        double r144423 = y;
        double r144424 = r144423 * r144423;
        double r144425 = r144422 - r144424;
        return r144425;
}

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