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 r144466 = x;
        double r144467 = y;
        double r144468 = r144467 * r144467;
        double r144469 = r144466 - r144468;
        return r144469;
}
↓
double f(double x, double y) {
        double r144470 = x;
        double r144471 = y;
        double r144472 = r144471 * r144471;
        double r144473 = r144470 - r144472;
        return r144473;
}

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