Average Error: 0.0 → 0.0
Time: 405.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 r186720 = x;
        double r186721 = y;
        double r186722 = r186721 * r186721;
        double r186723 = r186720 - r186722;
        return r186723;
}
↓
double f(double x, double y) {
        double r186724 = x;
        double r186725 = y;
        double r186726 = r186725 * r186725;
        double r186727 = r186724 - r186726;
        return r186727;
}

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