Average Error: 0.0 → 0.0
Time: 920.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 r6379101 = x;
        double r6379102 = y;
        double r6379103 = r6379102 * r6379102;
        double r6379104 = r6379101 - r6379103;
        return r6379104;
}
↓
double f(double x, double y) {
        double r6379105 = x;
        double r6379106 = y;
        double r6379107 = r6379106 * r6379106;
        double r6379108 = r6379105 - r6379107;
        return r6379108;
}

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