Average Error: 0.0 → 0.0
Time: 537.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 r176012 = x;
        double r176013 = y;
        double r176014 = r176013 * r176013;
        double r176015 = r176012 - r176014;
        return r176015;
}
↓
double f(double x, double y) {
        double r176016 = x;
        double r176017 = y;
        double r176018 = r176017 * r176017;
        double r176019 = r176016 - r176018;
        return r176019;
}

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