Average Error: 0.0 → 0.0
Time: 6.7s
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 r6500376 = x;
        double r6500377 = y;
        double r6500378 = r6500377 * r6500377;
        double r6500379 = r6500376 - r6500378;
        return r6500379;
}
↓
double f(double x, double y) {
        double r6500380 = x;
        double r6500381 = y;
        double r6500382 = r6500381 * r6500381;
        double r6500383 = r6500380 - r6500382;
        return r6500383;
}

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