Average Error: 0.0 → 0.0
Time: 3.8s
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 r189447 = x;
        double r189448 = y;
        double r189449 = r189447 + r189448;
        double r189450 = r189447 - r189448;
        double r189451 = r189449 * r189450;
        return r189451;
}
↓
double f(double x, double y) {
        double r189452 = x;
        double r189453 = y;
        double r189454 = r189452 + r189453;
        double r189455 = r189452 - r189453;
        double r189456 = r189454 * r189455;
        return r189456;
}

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