Average Error: 0.0 → 0.0
Time: 1.0s
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 r125729 = x;
        double r125730 = y;
        double r125731 = r125730 * r125730;
        double r125732 = r125729 - r125731;
        return r125732;
}
↓
double f(double x, double y) {
        double r125733 = x;
        double r125734 = y;
        double r125735 = r125734 * r125734;
        double r125736 = r125733 - r125735;
        return r125736;
}

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