Average Error: 0.0 → 0.0
Time: 732.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 r117026 = x;
        double r117027 = y;
        double r117028 = r117027 * r117027;
        double r117029 = r117026 - r117028;
        return r117029;
}
↓
double f(double x, double y) {
        double r117030 = x;
        double r117031 = y;
        double r117032 = r117031 * r117031;
        double r117033 = r117030 - r117032;
        return r117033;
}

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