Average Error: 0.0 → 0.0
Time: 583.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 r181121 = x;
        double r181122 = y;
        double r181123 = r181122 * r181122;
        double r181124 = r181121 - r181123;
        return r181124;
}
↓
double f(double x, double y) {
        double r181125 = x;
        double r181126 = y;
        double r181127 = r181126 * r181126;
        double r181128 = r181125 - r181127;
        return r181128;
}

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