Average Error: 0.0 → 0.0
Time: 6.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 r110744 = x;
        double r110745 = y;
        double r110746 = r110745 * r110745;
        double r110747 = r110744 - r110746;
        return r110747;
}
↓
double f(double x, double y) {
        double r110748 = x;
        double r110749 = y;
        double r110750 = r110749 * r110749;
        double r110751 = r110748 - r110750;
        return r110751;
}

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