Average Error: 0.0 → 0.0
Time: 1.9s
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 r902 = x;
        double r903 = y;
        double r904 = r902 + r903;
        double r905 = r902 - r903;
        double r906 = r904 * r905;
        return r906;
}
↓
double f(double x, double y) {
        double r907 = x;
        double r908 = y;
        double r909 = r907 + r908;
        double r910 = r907 - r908;
        double r911 = r909 * r910;
        return r911;
}

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