Average Error: 0.0 → 0.0
Time: 13.9s
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 r116483 = x;
        double r116484 = y;
        double r116485 = r116483 + r116484;
        double r116486 = r116483 - r116484;
        double r116487 = r116485 * r116486;
        return r116487;
}
↓
double f(double x, double y) {
        double r116488 = x;
        double r116489 = y;
        double r116490 = r116488 + r116489;
        double r116491 = r116488 - r116489;
        double r116492 = r116490 * r116491;
        return r116492;
}

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