Average Error: 0.0 → 0.0
Time: 615.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 r148907 = x;
        double r148908 = y;
        double r148909 = r148907 + r148908;
        double r148910 = r148907 - r148908;
        double r148911 = r148909 * r148910;
        return r148911;
}
↓
double f(double x, double y) {
        double r148912 = x;
        double r148913 = y;
        double r148914 = r148912 + r148913;
        double r148915 = r148912 - r148913;
        double r148916 = r148914 * r148915;
        return r148916;
}

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