Average Error: 0.0 → 0.0
Time: 860.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 r7760308 = x;
        double r7760309 = y;
        double r7760310 = r7760309 * r7760309;
        double r7760311 = r7760308 - r7760310;
        return r7760311;
}
↓
double f(double x, double y) {
        double r7760312 = x;
        double r7760313 = y;
        double r7760314 = r7760313 * r7760313;
        double r7760315 = r7760312 - r7760314;
        return r7760315;
}

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