Average Error: 0.0 → 0.0
Time: 2.3s
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 r157277 = x;
        double r157278 = y;
        double r157279 = r157278 * r157278;
        double r157280 = r157277 - r157279;
        return r157280;
}
↓
double f(double x, double y) {
        double r157281 = x;
        double r157282 = y;
        double r157283 = r157282 * r157282;
        double r157284 = r157281 - r157283;
        return r157284;
}

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