Average Error: 0.0 → 0.0
Time: 431.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 r177709 = x;
        double r177710 = y;
        double r177711 = r177710 * r177710;
        double r177712 = r177709 - r177711;
        return r177712;
}
↓
double f(double x, double y) {
        double r177713 = x;
        double r177714 = y;
        double r177715 = r177714 * r177714;
        double r177716 = r177713 - r177715;
        return r177716;
}

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