Average Error: 0.0 → 0.0
Time: 1.4s
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 r106815 = x;
        double r106816 = y;
        double r106817 = r106816 * r106816;
        double r106818 = r106815 - r106817;
        return r106818;
}
↓
double f(double x, double y) {
        double r106819 = x;
        double r106820 = y;
        double r106821 = r106820 * r106820;
        double r106822 = r106819 - r106821;
        return r106822;
}

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