Average Error: 0.0 → 0.0
Time: 3.8s
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 r163592 = x;
        double r163593 = y;
        double r163594 = r163593 * r163593;
        double r163595 = r163592 - r163594;
        return r163595;
}
↓
double f(double x, double y) {
        double r163596 = x;
        double r163597 = y;
        double r163598 = r163597 * r163597;
        double r163599 = r163596 - r163598;
        return r163599;
}

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