Average Error: 0.0 → 0.0
Time: 16.2s
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 r9562573 = x;
        double r9562574 = y;
        double r9562575 = r9562574 * r9562574;
        double r9562576 = r9562573 - r9562575;
        return r9562576;
}
↓
double f(double x, double y) {
        double r9562577 = x;
        double r9562578 = y;
        double r9562579 = r9562578 * r9562578;
        double r9562580 = r9562577 - r9562579;
        return r9562580;
}

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