Average Error: 0.0 → 0.0
Time: 6.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 r8912133 = x;
        double r8912134 = y;
        double r8912135 = r8912134 * r8912134;
        double r8912136 = r8912133 - r8912135;
        return r8912136;
}
↓
double f(double x, double y) {
        double r8912137 = x;
        double r8912138 = y;
        double r8912139 = r8912138 * r8912138;
        double r8912140 = r8912137 - r8912139;
        return r8912140;
}

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