Average Error: 0.0 → 0.0
Time: 1.2s
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 r213815 = x;
        double r213816 = y;
        double r213817 = r213816 * r213816;
        double r213818 = r213815 - r213817;
        return r213818;
}
↓
double f(double x, double y) {
        double r213819 = x;
        double r213820 = y;
        double r213821 = r213820 * r213820;
        double r213822 = r213819 - r213821;
        return r213822;
}

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