Average Error: 0.0 → 0.0
Time: 21.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 r9405438 = x;
        double r9405439 = y;
        double r9405440 = r9405438 + r9405439;
        double r9405441 = r9405438 - r9405439;
        double r9405442 = r9405440 * r9405441;
        return r9405442;
}
↓
double f(double x, double y) {
        double r9405443 = x;
        double r9405444 = y;
        double r9405445 = r9405443 + r9405444;
        double r9405446 = r9405443 - r9405444;
        double r9405447 = r9405445 * r9405446;
        return r9405447;
}

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