Average Error: 0.0 → 0.0
Time: 6.7s
Precision: 64
\[a \cdot a - b \cdot b\]
↓
\[\left(b + a\right) \cdot \left(a - b\right)\]
a \cdot a - b \cdot b
↓
\left(b + a\right) \cdot \left(a - b\right)
double f(double a, double b) {
        double r5039899 = a;
        double r5039900 = r5039899 * r5039899;
        double r5039901 = b;
        double r5039902 = r5039901 * r5039901;
        double r5039903 = r5039900 - r5039902;
        return r5039903;
}
↓
double f(double a, double b) {
        double r5039904 = b;
        double r5039905 = a;
        double r5039906 = r5039904 + r5039905;
        double r5039907 = r5039905 - r5039904;
        double r5039908 = r5039906 * r5039907;
        return r5039908;
}

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(b + a\right) \cdot \left(a - b\right)\]

Reproduce

herbie shell --seed 2019179 
(FPCore (a b)
  :name "Difference of squares"

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

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