Average Error: 0.0 → 0.0
Time: 990.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 r134357 = x;
        double r134358 = y;
        double r134359 = r134358 * r134358;
        double r134360 = r134357 - r134359;
        return r134360;
}
↓
double f(double x, double y) {
        double r134361 = x;
        double r134362 = y;
        double r134363 = r134362 * r134362;
        double r134364 = r134361 - r134363;
        return r134364;
}

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