Average Error: 0.0 → 0.0
Time: 988.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 r186011 = x;
        double r186012 = y;
        double r186013 = r186012 * r186012;
        double r186014 = r186011 - r186013;
        return r186014;
}
↓
double f(double x, double y) {
        double r186015 = x;
        double r186016 = y;
        double r186017 = r186016 * r186016;
        double r186018 = r186015 - r186017;
        return r186018;
}

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