Average Error: 0.0 → 0.0
Time: 834.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 r212108 = x;
        double r212109 = y;
        double r212110 = r212109 * r212109;
        double r212111 = r212108 - r212110;
        return r212111;
}
↓
double f(double x, double y) {
        double r212112 = x;
        double r212113 = y;
        double r212114 = r212113 * r212113;
        double r212115 = r212112 - r212114;
        return r212115;
}

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