Average Error: 0.0 → 0.0
Time: 868.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 r147408 = x;
        double r147409 = y;
        double r147410 = r147408 + r147409;
        double r147411 = r147408 - r147409;
        double r147412 = r147410 * r147411;
        return r147412;
}
↓
double f(double x, double y) {
        double r147413 = x;
        double r147414 = y;
        double r147415 = r147413 + r147414;
        double r147416 = r147413 - r147414;
        double r147417 = r147415 * r147416;
        return r147417;
}

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