Average Error: 0.0 → 0.0
Time: 5.0s
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 r136723 = x;
        double r136724 = y;
        double r136725 = r136723 + r136724;
        double r136726 = r136723 - r136724;
        double r136727 = r136725 * r136726;
        return r136727;
}
↓
double f(double x, double y) {
        double r136728 = x;
        double r136729 = y;
        double r136730 = r136728 + r136729;
        double r136731 = r136728 - r136729;
        double r136732 = r136730 * r136731;
        return r136732;
}

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 2019199 
(FPCore (x y)
  :name "Examples.Basics.BasicTests:f1 from sbv-4.4"
  (* (+ x y) (- x y)))