Average Error: 0.0 → 0.0
Time: 993.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 r139045 = x;
        double r139046 = y;
        double r139047 = r139046 * r139046;
        double r139048 = r139045 - r139047;
        return r139048;
}
↓
double f(double x, double y) {
        double r139049 = x;
        double r139050 = y;
        double r139051 = r139050 * r139050;
        double r139052 = r139049 - r139051;
        return r139052;
}

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