Average Error: 0.0 → 0.0
Time: 11.6s
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 r153397 = x;
        double r153398 = y;
        double r153399 = r153398 * r153398;
        double r153400 = r153397 - r153399;
        return r153400;
}
↓
double f(double x, double y) {
        double r153401 = x;
        double r153402 = y;
        double r153403 = r153402 * r153402;
        double r153404 = r153401 - r153403;
        return r153404;
}

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