Average Error: 0.0 → 0.0
Time: 1.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 r132058 = x;
        double r132059 = y;
        double r132060 = r132059 * r132059;
        double r132061 = r132058 - r132060;
        return r132061;
}
↓
double f(double x, double y) {
        double r132062 = x;
        double r132063 = y;
        double r132064 = r132063 * r132063;
        double r132065 = r132062 - r132064;
        return r132065;
}

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