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 r200908 = x;
        double r200909 = y;
        double r200910 = r200909 * r200909;
        double r200911 = r200908 - r200910;
        return r200911;
}
↓
double f(double x, double y) {
        double r200912 = x;
        double r200913 = y;
        double r200914 = r200913 * r200913;
        double r200915 = r200912 - r200914;
        return r200915;
}

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