Average Error: 0.0 → 0.0
Time: 4.3s
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 r151105 = x;
        double r151106 = y;
        double r151107 = r151106 * r151106;
        double r151108 = r151105 - r151107;
        return r151108;
}
↓
double f(double x, double y) {
        double r151109 = x;
        double r151110 = y;
        double r151111 = r151110 * r151110;
        double r151112 = r151109 - r151111;
        return r151112;
}

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