Average Error: 0.0 → 0.0
Time: 704.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 r193489 = x;
        double r193490 = y;
        double r193491 = r193489 + r193490;
        double r193492 = r193489 - r193490;
        double r193493 = r193491 * r193492;
        return r193493;
}
↓
double f(double x, double y) {
        double r193494 = x;
        double r193495 = y;
        double r193496 = r193494 + r193495;
        double r193497 = r193494 - r193495;
        double r193498 = r193496 * r193497;
        return r193498;
}

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