Average Error: 0.0 → 0.0
Time: 396.0ms
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 r182042 = x;
        double r182043 = y;
        double r182044 = r182043 * r182043;
        double r182045 = r182042 - r182044;
        return r182045;
}
↓
double f(double x, double y) {
        double r182046 = x;
        double r182047 = y;
        double r182048 = r182047 * r182047;
        double r182049 = r182046 - r182048;
        return r182049;
}

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