Average Error: 0.0 → 0.0
Time: 615.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 r170490 = x;
        double r170491 = y;
        double r170492 = r170490 + r170491;
        double r170493 = r170490 - r170491;
        double r170494 = r170492 * r170493;
        return r170494;
}
↓
double f(double x, double y) {
        double r170495 = x;
        double r170496 = y;
        double r170497 = r170495 + r170496;
        double r170498 = r170495 - r170496;
        double r170499 = r170497 * r170498;
        return r170499;
}

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