Average Error: 0.0 → 0.0
Time: 2.5s
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 r177888 = x;
        double r177889 = y;
        double r177890 = r177889 * r177889;
        double r177891 = r177888 - r177890;
        return r177891;
}
↓
double f(double x, double y) {
        double r177892 = x;
        double r177893 = y;
        double r177894 = r177893 * r177893;
        double r177895 = r177892 - r177894;
        return r177895;
}

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