Average Error: 0.0 → 0.0
Time: 631.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 r157487 = x;
        double r157488 = y;
        double r157489 = r157487 + r157488;
        double r157490 = r157487 - r157488;
        double r157491 = r157489 * r157490;
        return r157491;
}
↓
double f(double x, double y) {
        double r157492 = x;
        double r157493 = y;
        double r157494 = r157492 + r157493;
        double r157495 = r157492 - r157493;
        double r157496 = r157494 * r157495;
        return r157496;
}

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