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 r170327 = x;
        double r170328 = y;
        double r170329 = r170328 * r170328;
        double r170330 = r170327 - r170329;
        return r170330;
}
↓
double f(double x, double y) {
        double r170331 = x;
        double r170332 = y;
        double r170333 = r170332 * r170332;
        double r170334 = r170331 - r170333;
        return r170334;
}

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