Average Error: 0.0 → 0.0
Time: 409.0ms
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 r190492 = x;
        double r190493 = y;
        double r190494 = r190493 * r190493;
        double r190495 = r190492 - r190494;
        return r190495;
}

double f(double x, double y) {
        double r190496 = x;
        double r190497 = y;
        double r190498 = r190497 * r190497;
        double r190499 = r190496 - r190498;
        return r190499;
}

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