Average Error: 0.0 → 0.0
Time: 6.0s
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 r8737900 = x;
        double r8737901 = y;
        double r8737902 = r8737901 * r8737901;
        double r8737903 = r8737900 - r8737902;
        return r8737903;
}
↓
double f(double x, double y) {
        double r8737904 = x;
        double r8737905 = y;
        double r8737906 = r8737905 * r8737905;
        double r8737907 = r8737904 - r8737906;
        return r8737907;
}

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