Average Error: 0.0 → 0.0
Time: 823.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 r80197 = a;
        double r80198 = r80197 * r80197;
        double r80199 = b;
        double r80200 = r80199 * r80199;
        double r80201 = r80198 - r80200;
        return r80201;
}
↓
double f(double a, double b) {
        double r80202 = a;
        double r80203 = b;
        double r80204 = r80202 + r80203;
        double r80205 = r80202 - r80203;
        double r80206 = r80204 * r80205;
        return r80206;
}

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

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

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