Average Error: 0.0 → 0.0
Time: 408.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 r227667 = x;
        double r227668 = y;
        double r227669 = r227668 * r227668;
        double r227670 = r227667 - r227669;
        return r227670;
}
↓
double f(double x, double y) {
        double r227671 = x;
        double r227672 = y;
        double r227673 = r227672 * r227672;
        double r227674 = r227671 - r227673;
        return r227674;
}

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)))