Average Error: 0.0 → 0.0
Time: 8.0s
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 r219537 = x;
        double r219538 = y;
        double r219539 = r219537 + r219538;
        double r219540 = r219537 - r219538;
        double r219541 = r219539 * r219540;
        return r219541;
}
↓
double f(double x, double y) {
        double r219542 = x;
        double r219543 = y;
        double r219544 = r219542 + r219543;
        double r219545 = r219542 - r219543;
        double r219546 = r219544 * r219545;
        return r219546;
}

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