Average Error: 0.0 → 0.0
Time: 2.4s
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 r7181508 = x;
        double r7181509 = y;
        double r7181510 = r7181509 * r7181509;
        double r7181511 = r7181508 - r7181510;
        return r7181511;
}
↓
double f(double x, double y) {
        double r7181512 = x;
        double r7181513 = y;
        double r7181514 = r7181513 * r7181513;
        double r7181515 = r7181512 - r7181514;
        return r7181515;
}

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)))