Average Error: 0.0 → 0.0
Time: 10.4s
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 r4180729 = a;
        double r4180730 = r4180729 * r4180729;
        double r4180731 = b;
        double r4180732 = r4180731 * r4180731;
        double r4180733 = r4180730 - r4180732;
        return r4180733;
}
↓
double f(double a, double b) {
        double r4180734 = b;
        double r4180735 = a;
        double r4180736 = r4180734 + r4180735;
        double r4180737 = r4180735 - r4180734;
        double r4180738 = r4180736 * r4180737;
        return r4180738;
}

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 2019163 +o rules:numerics
(FPCore (a b)
  :name "Difference of squares"

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

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