Average Error: 0.0 → 0.0
Time: 642.0ms
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 r186033 = x;
        double r186034 = y;
        double r186035 = r186033 + r186034;
        double r186036 = r186033 - r186034;
        double r186037 = r186035 * r186036;
        return r186037;
}
↓
double f(double x, double y) {
        double r186038 = x;
        double r186039 = y;
        double r186040 = r186038 + r186039;
        double r186041 = r186038 - r186039;
        double r186042 = r186040 * r186041;
        return r186042;
}

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