Average Error: 0.0 → 0.0
Time: 806.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 r201200 = x;
        double r201201 = y;
        double r201202 = r201200 + r201201;
        double r201203 = r201200 - r201201;
        double r201204 = r201202 * r201203;
        return r201204;
}
↓
double f(double x, double y) {
        double r201205 = x;
        double r201206 = y;
        double r201207 = r201205 + r201206;
        double r201208 = r201205 - r201206;
        double r201209 = r201207 * r201208;
        return r201209;
}

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