Average Error: 0.0 → 0.0
Time: 1.3s
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 r201551 = x;
        double r201552 = y;
        double r201553 = r201552 * r201552;
        double r201554 = r201551 - r201553;
        return r201554;
}
↓
double f(double x, double y) {
        double r201555 = x;
        double r201556 = y;
        double r201557 = r201556 * r201556;
        double r201558 = r201555 - r201557;
        return r201558;
}

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