Average Error: 0.0 → 0.0
Time: 602.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 r139329 = x;
        double r139330 = y;
        double r139331 = r139329 + r139330;
        double r139332 = r139329 - r139330;
        double r139333 = r139331 * r139332;
        return r139333;
}
↓
double f(double x, double y) {
        double r139334 = x;
        double r139335 = y;
        double r139336 = r139334 + r139335;
        double r139337 = r139334 - r139335;
        double r139338 = r139336 * r139337;
        return r139338;
}

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