Average Error: 0.0 → 0.0
Time: 1.2s
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 r169392 = x;
        double r169393 = y;
        double r169394 = r169393 * r169393;
        double r169395 = r169392 - r169394;
        return r169395;
}
↓
double f(double x, double y) {
        double r169396 = x;
        double r169397 = y;
        double r169398 = r169397 * r169397;
        double r169399 = r169396 - r169398;
        return r169399;
}

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