Average Error: 0.0 → 0.0
Time: 12.7s
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 r86318 = x;
        double r86319 = y;
        double r86320 = r86318 + r86319;
        double r86321 = r86318 - r86319;
        double r86322 = r86320 * r86321;
        return r86322;
}
↓
double f(double x, double y) {
        double r86323 = x;
        double r86324 = y;
        double r86325 = r86323 + r86324;
        double r86326 = r86323 - r86324;
        double r86327 = r86325 * r86326;
        return r86327;
}

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