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 r109020 = x;
        double r109021 = y;
        double r109022 = r109021 * r109021;
        double r109023 = r109020 - r109022;
        return r109023;
}
↓
double f(double x, double y) {
        double r109024 = x;
        double r109025 = y;
        double r109026 = r109025 * r109025;
        double r109027 = r109024 - r109026;
        return r109027;
}

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