Average Error: 0.0 → 0.0
Time: 3.5s
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 r160783 = x;
        double r160784 = y;
        double r160785 = r160783 + r160784;
        double r160786 = r160783 - r160784;
        double r160787 = r160785 * r160786;
        return r160787;
}
↓
double f(double x, double y) {
        double r160788 = x;
        double r160789 = y;
        double r160790 = r160788 + r160789;
        double r160791 = r160788 - r160789;
        double r160792 = r160790 * r160791;
        return r160792;
}

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