Average Error: 0.0 → 0.0
Time: 8.9s
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 r160856 = x;
        double r160857 = y;
        double r160858 = r160857 * r160857;
        double r160859 = r160856 - r160858;
        return r160859;
}
↓
double f(double x, double y) {
        double r160860 = x;
        double r160861 = y;
        double r160862 = r160861 * r160861;
        double r160863 = r160860 - r160862;
        return r160863;
}

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