Average Error: 0.0 → 0.0
Time: 1.1s
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 r174688 = x;
        double r174689 = y;
        double r174690 = r174689 * r174689;
        double r174691 = r174688 - r174690;
        return r174691;
}
↓
double f(double x, double y) {
        double r174692 = x;
        double r174693 = y;
        double r174694 = r174693 * r174693;
        double r174695 = r174692 - r174694;
        return r174695;
}

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