Average Error: 0.0 → 0.0
Time: 1.1s
Precision: 64
\[\left(x + y\right) \cdot \left(x - y\right)\]
↓
\[\left(x + y\right) \cdot \left(x - y\right)\]
\left(x + y\right) \cdot \left(x - y\right)
↓
\left(x + y\right) \cdot \left(x - y\right)
double f(double x, double y) {
        double r242764 = x;
        double r242765 = y;
        double r242766 = r242764 + r242765;
        double r242767 = r242764 - r242765;
        double r242768 = r242766 * r242767;
        return r242768;
}
↓
double f(double x, double y) {
        double r242769 = x;
        double r242770 = y;
        double r242771 = r242769 + r242770;
        double r242772 = r242769 - r242770;
        double r242773 = r242771 * r242772;
        return r242773;
}

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

    \[\left(x + y\right) \cdot \left(x - y\right)\]

  2. Final simplification0.0

    \[\leadsto \left(x + y\right) \cdot \left(x - y\right)\]

Reproduce

herbie shell --seed 2020036 
(FPCore (x y)
  :name "Examples.Basics.BasicTests:f1 from sbv-4.4"
  :precision binary64
  (* (+ x y) (- x y)))