Average Error: 0.0 → 0.0
Time: 816.0ms
Precision: 64
\[a \cdot a - b \cdot b\]
↓
\[\left(a + b\right) \cdot \left(a - b\right)\]
a \cdot a - b \cdot b
↓
\left(a + b\right) \cdot \left(a - b\right)
double f(double a, double b) {
        double r89605 = a;
        double r89606 = r89605 * r89605;
        double r89607 = b;
        double r89608 = r89607 * r89607;
        double r89609 = r89606 - r89608;
        return r89609;
}
↓
double f(double a, double b) {
        double r89610 = a;
        double r89611 = b;
        double r89612 = r89610 + r89611;
        double r89613 = r89610 - r89611;
        double r89614 = r89612 * r89613;
        return r89614;
}

Error

Bits error versus a

Bits error versus b

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original0.0
Target0.0
Herbie0.0
\[\left(a + b\right) \cdot \left(a - b\right)\]

Derivation

  1. Initial program 0.0

    \[a \cdot a - b \cdot b\]
  2. Using strategy rm

  3. Applied difference-of-squares0.0

    \[\leadsto \color{blue}{\left(a + b\right) \cdot \left(a - b\right)}\]

  4. Final simplification0.0

    \[\leadsto \left(a + b\right) \cdot \left(a - b\right)\]

Reproduce

herbie shell --seed 2020039 
(FPCore (a b)
  :name "Difference of squares"
  :precision binary64

  :herbie-target
  (* (+ a b) (- a b))

  (- (* a a) (* b b)))