Average Error: 0.0 → 0.0
Time: 633.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 r125847 = x;
        double r125848 = y;
        double r125849 = r125848 * r125848;
        double r125850 = r125847 - r125849;
        return r125850;
}
↓
double f(double x, double y) {
        double r125851 = x;
        double r125852 = y;
        double r125853 = r125852 * r125852;
        double r125854 = r125851 - r125853;
        return r125854;
}

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