Average Error: 0.0 → 0.0
Time: 1.4s
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 r191656 = x;
        double r191657 = y;
        double r191658 = r191656 + r191657;
        double r191659 = r191656 - r191657;
        double r191660 = r191658 * r191659;
        return r191660;
}
↓
double f(double x, double y) {
        double r191661 = x;
        double r191662 = y;
        double r191663 = r191661 + r191662;
        double r191664 = r191661 - r191662;
        double r191665 = r191663 * r191664;
        return r191665;
}

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