Average Error: 0.0 → 0.0
Time: 6.3s
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 r201955 = x;
        double r201956 = y;
        double r201957 = r201955 + r201956;
        double r201958 = r201955 - r201956;
        double r201959 = r201957 * r201958;
        return r201959;
}
↓
double f(double x, double y) {
        double r201960 = x;
        double r201961 = y;
        double r201962 = r201960 - r201961;
        double r201963 = r201960 + r201961;
        double r201964 = r201962 * r201963;
        return r201964;
}

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. Simplified0.0

    \[\leadsto \color{blue}{\left(x - y\right) \cdot \left(x + y\right)}\]

  3. Final simplification0.0

    \[\leadsto \left(x - y\right) \cdot \left(x + y\right)\]

Reproduce

herbie shell --seed 2020042 
(FPCore (x y)
  :name "Examples.Basics.BasicTests:f1 from sbv-4.4"
  :precision binary64
  (* (+ x y) (- x y)))