Average Error: 0.0 → 0.0
Time: 2.3s
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 r6460005 = a;
        double r6460006 = r6460005 * r6460005;
        double r6460007 = b;
        double r6460008 = r6460007 * r6460007;
        double r6460009 = r6460006 - r6460008;
        return r6460009;
}
↓
double f(double a, double b) {
        double r6460010 = b;
        double r6460011 = a;
        double r6460012 = r6460010 + r6460011;
        double r6460013 = r6460011 - r6460010;
        double r6460014 = r6460012 * r6460013;
        return r6460014;
}

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

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

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