Average Error: 0.0 → 0.0
Time: 12.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 r187411 = x;
        double r187412 = y;
        double r187413 = r187411 + r187412;
        double r187414 = r187411 - r187412;
        double r187415 = r187413 * r187414;
        return r187415;
}
↓
double f(double x, double y) {
        double r187416 = x;
        double r187417 = y;
        double r187418 = r187416 + r187417;
        double r187419 = r187416 - r187417;
        double r187420 = r187418 * r187419;
        return r187420;
}

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