Average Error: 0.0 → 0.0
Time: 13.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 r116685 = x;
        double r116686 = r116685 * r116685;
        double r116687 = y;
        double r116688 = r116687 * r116687;
        double r116689 = r116686 - r116688;
        return r116689;
}
↓
double f(double x, double y) {
        double r116690 = x;
        double r116691 = r116690 * r116690;
        double r116692 = y;
        double r116693 = r116692 * r116692;
        double r116694 = r116691 - r116693;
        return r116694;
}

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