Average Error: 0.0 → 0.0
Time: 2.8s
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 r223689 = x;
        double r223690 = y;
        double r223691 = r223690 * r223690;
        double r223692 = r223689 - r223691;
        return r223692;
}
↓
double f(double x, double y) {
        double r223693 = x;
        double r223694 = y;
        double r223695 = r223694 * r223694;
        double r223696 = r223693 - r223695;
        return r223696;
}

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