Average Error: 0.0 → 0.0
Time: 649.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 r223993 = x;
        double r223994 = y;
        double r223995 = r223994 * r223994;
        double r223996 = r223993 - r223995;
        return r223996;
}
↓
double f(double x, double y) {
        double r223997 = x;
        double r223998 = y;
        double r223999 = r223998 * r223998;
        double r224000 = r223997 - r223999;
        return r224000;
}

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