Average Error: 0.0 → 0.0
Time: 1.1s
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 r91448 = a;
        double r91449 = r91448 * r91448;
        double r91450 = b;
        double r91451 = r91450 * r91450;
        double r91452 = r91449 - r91451;
        return r91452;
}
↓
double f(double a, double b) {
        double r91453 = a;
        double r91454 = b;
        double r91455 = r91453 + r91454;
        double r91456 = r91453 - r91454;
        double r91457 = r91455 * r91456;
        return r91457;
}

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 2020001 
(FPCore (a b)
  :name "Difference of squares"
  :precision binary64

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

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