Average Error: 0.0 → 0.0
Time: 3.2s
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 r140525 = x;
        double r140526 = y;
        double r140527 = r140525 + r140526;
        double r140528 = r140525 - r140526;
        double r140529 = r140527 * r140528;
        return r140529;
}
↓
double f(double x, double y) {
        double r140530 = x;
        double r140531 = y;
        double r140532 = r140530 + r140531;
        double r140533 = r140530 - r140531;
        double r140534 = r140532 * r140533;
        return r140534;
}

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