Average Error: 0.0 → 0.0
Time: 2.7s
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 r9089006 = x;
        double r9089007 = y;
        double r9089008 = r9089007 * r9089007;
        double r9089009 = r9089006 - r9089008;
        return r9089009;
}
↓
double f(double x, double y) {
        double r9089010 = x;
        double r9089011 = y;
        double r9089012 = r9089011 * r9089011;
        double r9089013 = r9089010 - r9089012;
        return r9089013;
}

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