Average Error: 0.0 → 0.0
Time: 647.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 r165624 = x;
        double r165625 = y;
        double r165626 = r165625 * r165625;
        double r165627 = r165624 - r165626;
        return r165627;
}
↓
double f(double x, double y) {
        double r165628 = x;
        double r165629 = y;
        double r165630 = r165629 * r165629;
        double r165631 = r165628 - r165630;
        return r165631;
}

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