Average Error: 0.0 → 0.0
Time: 670.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 r156312 = x;
        double r156313 = y;
        double r156314 = r156313 * r156313;
        double r156315 = r156312 - r156314;
        return r156315;
}
↓
double f(double x, double y) {
        double r156316 = x;
        double r156317 = y;
        double r156318 = r156317 * r156317;
        double r156319 = r156316 - r156318;
        return r156319;
}

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