Average Error: 0.0 → 0.0
Time: 641.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 r184413 = x;
        double r184414 = y;
        double r184415 = r184414 * r184414;
        double r184416 = r184413 - r184415;
        return r184416;
}
↓
double f(double x, double y) {
        double r184417 = x;
        double r184418 = y;
        double r184419 = r184418 * r184418;
        double r184420 = r184417 - r184419;
        return r184420;
}

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