Average Error: 0.0 → 0.0
Time: 8.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 r7033109 = x;
        double r7033110 = y;
        double r7033111 = r7033110 * r7033110;
        double r7033112 = r7033109 - r7033111;
        return r7033112;
}
↓
double f(double x, double y) {
        double r7033113 = x;
        double r7033114 = y;
        double r7033115 = r7033114 * r7033114;
        double r7033116 = r7033113 - r7033115;
        return r7033116;
}

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