Average Error: 0.0 → 0.0
Time: 581.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 r110257 = x;
        double r110258 = y;
        double r110259 = r110258 * r110258;
        double r110260 = r110257 - r110259;
        return r110260;
}
↓
double f(double x, double y) {
        double r110261 = x;
        double r110262 = y;
        double r110263 = r110262 * r110262;
        double r110264 = r110261 - r110263;
        return r110264;
}

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