Average Error: 0.0 → 0.0
Time: 1.8s
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 r900 = x;
        double r901 = y;
        double r902 = r901 * r901;
        double r903 = r900 - r902;
        return r903;
}
↓
double f(double x, double y) {
        double r904 = x;
        double r905 = y;
        double r906 = r905 * r905;
        double r907 = r904 - r906;
        return r907;
}

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