Average Error: 0.0 → 0.0
Time: 2.5s
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 r194761 = x;
        double r194762 = y;
        double r194763 = r194762 * r194762;
        double r194764 = r194761 - r194763;
        return r194764;
}
↓
double f(double x, double y) {
        double r194765 = x;
        double r194766 = y;
        double r194767 = r194766 * r194766;
        double r194768 = r194765 - r194767;
        return r194768;
}

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