Average Error: 0.0 → 0.0
Time: 462.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 r139918 = x;
        double r139919 = y;
        double r139920 = r139919 * r139919;
        double r139921 = r139918 - r139920;
        return r139921;
}
↓
double f(double x, double y) {
        double r139922 = x;
        double r139923 = y;
        double r139924 = r139923 * r139923;
        double r139925 = r139922 - r139924;
        return r139925;
}

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