Average Error: 0.0 → 0.0
Time: 7.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 r151418 = x;
        double r151419 = y;
        double r151420 = r151419 * r151419;
        double r151421 = r151418 - r151420;
        return r151421;
}

double f(double x, double y) {
        double r151422 = x;
        double r151423 = y;
        double r151424 = r151423 * r151423;
        double r151425 = r151422 - r151424;
        return r151425;
}

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