Average Error: 0.0 → 0.0
Time: 3.4s
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 r126692 = x;
        double r126693 = y;
        double r126694 = r126693 * r126693;
        double r126695 = r126692 - r126694;
        return r126695;
}
↓
double f(double x, double y) {
        double r126696 = x;
        double r126697 = y;
        double r126698 = r126697 * r126697;
        double r126699 = r126696 - r126698;
        return r126699;
}

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