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 r128318 = x;
        double r128319 = y;
        double r128320 = r128319 * r128319;
        double r128321 = r128318 - r128320;
        return r128321;
}
↓
double f(double x, double y) {
        double r128322 = x;
        double r128323 = y;
        double r128324 = r128323 * r128323;
        double r128325 = r128322 - r128324;
        return r128325;
}

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