Average Error: 0.0 → 0.0
Time: 408.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 r140497 = x;
        double r140498 = y;
        double r140499 = r140498 * r140498;
        double r140500 = r140497 - r140499;
        return r140500;
}
↓
double f(double x, double y) {
        double r140501 = x;
        double r140502 = y;
        double r140503 = r140502 * r140502;
        double r140504 = r140501 - r140503;
        return r140504;
}

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