Average Error: 0.0 → 0.0
Time: 472.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 r124158 = x;
        double r124159 = y;
        double r124160 = r124159 * r124159;
        double r124161 = r124158 - r124160;
        return r124161;
}
↓
double f(double x, double y) {
        double r124162 = x;
        double r124163 = y;
        double r124164 = r124163 * r124163;
        double r124165 = r124162 - r124164;
        return r124165;
}

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