Average Error: 0.0 → 0.0
Time: 768.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 r105799 = a;
        double r105800 = r105799 * r105799;
        double r105801 = b;
        double r105802 = r105801 * r105801;
        double r105803 = r105800 - r105802;
        return r105803;
}
↓
double f(double a, double b) {
        double r105804 = a;
        double r105805 = b;
        double r105806 = r105804 + r105805;
        double r105807 = r105804 - r105805;
        double r105808 = r105806 * r105807;
        return r105808;
}

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

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

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