Average Error: 0.0 → 0.0
Time: 3.6s
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 r189987 = x;
        double r189988 = y;
        double r189989 = r189988 * r189988;
        double r189990 = r189987 - r189989;
        return r189990;
}
↓
double f(double x, double y) {
        double r189991 = x;
        double r189992 = y;
        double r189993 = r189992 * r189992;
        double r189994 = r189991 - r189993;
        return r189994;
}

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