Average Error: 0.0 → 0.0
Time: 4.9s
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 r9320052 = x;
        double r9320053 = y;
        double r9320054 = r9320053 * r9320053;
        double r9320055 = r9320052 - r9320054;
        return r9320055;
}
↓
double f(double x, double y) {
        double r9320056 = x;
        double r9320057 = y;
        double r9320058 = r9320057 * r9320057;
        double r9320059 = r9320056 - r9320058;
        return r9320059;
}

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