Average Error: 0.0 → 0.0
Time: 1.3s
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 r168055 = x;
        double r168056 = y;
        double r168057 = r168056 * r168056;
        double r168058 = r168055 - r168057;
        return r168058;
}
↓
double f(double x, double y) {
        double r168059 = x;
        double r168060 = y;
        double r168061 = r168060 * r168060;
        double r168062 = r168059 - r168061;
        return r168062;
}

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