Average Error: 0.0 → 0.0
Time: 442.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 r161252 = x;
        double r161253 = y;
        double r161254 = r161253 * r161253;
        double r161255 = r161252 - r161254;
        return r161255;
}
↓
double f(double x, double y) {
        double r161256 = x;
        double r161257 = y;
        double r161258 = r161257 * r161257;
        double r161259 = r161256 - r161258;
        return r161259;
}

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