Average Error: 0.0 → 0.0
Time: 5.1s
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 r172134 = x;
        double r172135 = y;
        double r172136 = r172135 * r172135;
        double r172137 = r172134 - r172136;
        return r172137;
}
↓
double f(double x, double y) {
        double r172138 = x;
        double r172139 = y;
        double r172140 = r172139 * r172139;
        double r172141 = r172138 - r172140;
        return r172141;
}

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)))