Average Error: 0.0 → 0.0
Time: 8.6s
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 r116764 = x;
        double r116765 = r116764 * r116764;
        double r116766 = y;
        double r116767 = r116766 * r116766;
        double r116768 = r116765 - r116767;
        return r116768;
}
↓
double f(double x, double y) {
        double r116769 = x;
        double r116770 = r116769 * r116769;
        double r116771 = y;
        double r116772 = r116771 * r116771;
        double r116773 = r116770 - r116772;
        return r116773;
}

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 2019350 +o rules:numerics
(FPCore (x y)
  :name "Examples.Basics.BasicTests:f2 from sbv-4.4"
  :precision binary64
  (- (* x x) (* y y)))