Average Error: 0.0 → 0.0
Time: 996.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 r240048 = x;
        double r240049 = y;
        double r240050 = r240049 * r240049;
        double r240051 = r240048 - r240050;
        return r240051;
}

double f(double x, double y) {
        double r240052 = x;
        double r240053 = y;
        double r240054 = r240053 * r240053;
        double r240055 = r240052 - r240054;
        return r240055;
}

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