Average Error: 0.0 → 0.0
Time: 2.7s
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 r8700067 = x;
        double r8700068 = y;
        double r8700069 = r8700068 * r8700068;
        double r8700070 = r8700067 - r8700069;
        return r8700070;
}
↓
double f(double x, double y) {
        double r8700071 = x;
        double r8700072 = y;
        double r8700073 = r8700072 * r8700072;
        double r8700074 = r8700071 - r8700073;
        return r8700074;
}

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