Average Error: 0.0 → 0.0
Time: 6.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 r7112663 = x;
        double r7112664 = y;
        double r7112665 = r7112664 * r7112664;
        double r7112666 = r7112663 - r7112665;
        return r7112666;
}
↓
double f(double x, double y) {
        double r7112667 = x;
        double r7112668 = y;
        double r7112669 = r7112668 * r7112668;
        double r7112670 = r7112667 - r7112669;
        return r7112670;
}

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