Average Error: 0.0 → 0.0
Time: 10.3s
Precision: 64
\[x \cdot x - y \cdot y\]
↓
\[x \cdot x - y \cdot y\]
x \cdot x - y \cdot y
↓
x \cdot x - y \cdot y
double f(double x, double y) {
        double r11420305 = x;
        double r11420306 = r11420305 * r11420305;
        double r11420307 = y;
        double r11420308 = r11420307 * r11420307;
        double r11420309 = r11420306 - r11420308;
        return r11420309;
}
↓
double f(double x, double y) {
        double r11420310 = x;
        double r11420311 = r11420310 * r11420310;
        double r11420312 = y;
        double r11420313 = r11420312 * r11420312;
        double r11420314 = r11420311 - r11420313;
        return r11420314;
}

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 \cdot x - y \cdot y\]

  2. Final simplification0.0

    \[\leadsto x \cdot x - y \cdot y\]

Reproduce

herbie shell --seed 2019172 +o rules:numerics
(FPCore (x y)
  :name "Examples.Basics.BasicTests:f2 from sbv-4.4"
  (- (* x x) (* y y)))