Average Error: 0.0 → 0.0
Time: 2.5s
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 r183802 = x;
        double r183803 = y;
        double r183804 = r183803 * r183803;
        double r183805 = r183802 - r183804;
        return r183805;
}
↓
double f(double x, double y) {
        double r183806 = x;
        double r183807 = y;
        double r183808 = r183807 * r183807;
        double r183809 = r183806 - r183808;
        return r183809;
}

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