Average Error: 0.0 → 0.0
Time: 621.0ms
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 r175601 = x;
        double r175602 = r175601 * r175601;
        double r175603 = y;
        double r175604 = r175603 * r175603;
        double r175605 = r175602 - r175604;
        return r175605;
}
↓
double f(double x, double y) {
        double r175606 = x;
        double r175607 = r175606 * r175606;
        double r175608 = y;
        double r175609 = r175608 * r175608;
        double r175610 = r175607 - r175609;
        return r175610;
}

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