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 r198537 = x;
        double r198538 = y;
        double r198539 = r198538 * r198538;
        double r198540 = r198537 - r198539;
        return r198540;
}
↓
double f(double x, double y) {
        double r198541 = x;
        double r198542 = y;
        double r198543 = r198542 * r198542;
        double r198544 = r198541 - r198543;
        return r198544;
}

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