Average Error: 0.0 → 0.0
Time: 414.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 r163868 = x;
        double r163869 = y;
        double r163870 = r163869 * r163869;
        double r163871 = r163868 - r163870;
        return r163871;
}
↓
double f(double x, double y) {
        double r163872 = x;
        double r163873 = y;
        double r163874 = r163873 * r163873;
        double r163875 = r163872 - r163874;
        return r163875;
}

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