Average Error: 0.0 → 0.0
Time: 1.6s
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 r67454 = a;
        double r67455 = r67454 * r67454;
        double r67456 = b;
        double r67457 = r67456 * r67456;
        double r67458 = r67455 - r67457;
        return r67458;
}
↓
double f(double a, double b) {
        double r67459 = a;
        double r67460 = b;
        double r67461 = r67459 + r67460;
        double r67462 = r67459 - r67460;
        double r67463 = r67461 * r67462;
        return r67463;
}

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

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

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