Average Error: 0.0 → 0.0
Time: 10.2s
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 r174417 = x;
        double r174418 = y;
        double r174419 = r174417 + r174418;
        double r174420 = r174417 - r174418;
        double r174421 = r174419 * r174420;
        return r174421;
}
↓
double f(double x, double y) {
        double r174422 = x;
        double r174423 = y;
        double r174424 = r174422 + r174423;
        double r174425 = r174422 - r174423;
        double r174426 = r174424 * r174425;
        return r174426;
}

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