Average Error: 0.0 → 0.0
Time: 637.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 r246544 = x;
        double r246545 = y;
        double r246546 = r246544 + r246545;
        double r246547 = r246544 - r246545;
        double r246548 = r246546 * r246547;
        return r246548;
}
↓
double f(double x, double y) {
        double r246549 = x;
        double r246550 = y;
        double r246551 = r246549 + r246550;
        double r246552 = r246549 - r246550;
        double r246553 = r246551 * r246552;
        return r246553;
}

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