Average Error: 0.0 → 0.0
Time: 10.8s
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 r5378871 = x;
        double r5378872 = r5378871 * r5378871;
        double r5378873 = y;
        double r5378874 = r5378873 * r5378873;
        double r5378875 = r5378872 - r5378874;
        return r5378875;
}
↓
double f(double x, double y) {
        double r5378876 = x;
        double r5378877 = r5378876 * r5378876;
        double r5378878 = y;
        double r5378879 = r5378878 * r5378878;
        double r5378880 = r5378877 - r5378879;
        return r5378880;
}

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)))