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 r144393 = x;
        double r144394 = y;
        double r144395 = r144394 * r144394;
        double r144396 = r144393 - r144395;
        return r144396;
}
↓
double f(double x, double y) {
        double r144397 = x;
        double r144398 = y;
        double r144399 = r144398 * r144398;
        double r144400 = r144397 - r144399;
        return r144400;
}

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