Average Error: 0.0 → 0.0
Time: 770.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 r92098 = x;
        double r92099 = y;
        double r92100 = r92099 * r92099;
        double r92101 = r92098 - r92100;
        return r92101;
}

double f(double x, double y) {
        double r92102 = x;
        double r92103 = y;
        double r92104 = r92103 * r92103;
        double r92105 = r92102 - r92104;
        return r92105;
}

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