Average Error: 0.0 → 0.0
Time: 396.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 r163278 = x;
        double r163279 = y;
        double r163280 = r163279 * r163279;
        double r163281 = r163278 - r163280;
        return r163281;
}
↓
double f(double x, double y) {
        double r163282 = x;
        double r163283 = y;
        double r163284 = r163283 * r163283;
        double r163285 = r163282 - r163284;
        return r163285;
}

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