Average Error: 0.0 → 0.0
Time: 2.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 r194644 = x;
        double r194645 = y;
        double r194646 = r194645 * r194645;
        double r194647 = r194644 - r194646;
        return r194647;
}
↓
double f(double x, double y) {
        double r194648 = x;
        double r194649 = y;
        double r194650 = r194649 * r194649;
        double r194651 = r194648 - r194650;
        return r194651;
}

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