Average Error: 0.0 → 0.0
Time: 866.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 r263426 = x;
        double r263427 = y;
        double r263428 = r263426 + r263427;
        double r263429 = r263426 - r263427;
        double r263430 = r263428 * r263429;
        return r263430;
}
↓
double f(double x, double y) {
        double r263431 = x;
        double r263432 = y;
        double r263433 = r263431 + r263432;
        double r263434 = r263431 - r263432;
        double r263435 = r263433 * r263434;
        return r263435;
}

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