Average Error: 0.0 → 0.0
Time: 1.1s
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 r7211031 = x;
        double r7211032 = y;
        double r7211033 = r7211032 * r7211032;
        double r7211034 = r7211031 - r7211033;
        return r7211034;
}
↓
double f(double x, double y) {
        double r7211035 = x;
        double r7211036 = y;
        double r7211037 = r7211036 * r7211036;
        double r7211038 = r7211035 - r7211037;
        return r7211038;
}

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