Average Error: 0.0 → 0.0
Time: 5.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 r138013 = x;
        double r138014 = y;
        double r138015 = r138013 + r138014;
        double r138016 = r138013 - r138014;
        double r138017 = r138015 * r138016;
        return r138017;
}
↓
double f(double x, double y) {
        double r138018 = x;
        double r138019 = y;
        double r138020 = r138018 + r138019;
        double r138021 = r138018 - r138019;
        double r138022 = r138020 * r138021;
        return r138022;
}

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