Average Error: 0.0 → 0.0
Time: 4.6s
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 r61640 = a;
        double r61641 = r61640 * r61640;
        double r61642 = b;
        double r61643 = r61642 * r61642;
        double r61644 = r61641 - r61643;
        return r61644;
}
↓
double f(double a, double b) {
        double r61645 = b;
        double r61646 = a;
        double r61647 = r61645 + r61646;
        double r61648 = r61646 - r61645;
        double r61649 = r61647 * r61648;
        return r61649;
}

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. Simplified0.0

    \[\leadsto \color{blue}{\left(b + a\right) \cdot \left(a - b\right)}\]

  3. Final simplification0.0

    \[\leadsto \left(b + a\right) \cdot \left(a - b\right)\]

Reproduce

herbie shell --seed 2019209 
(FPCore (a b)
  :name "Difference of squares"
  :precision binary64

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

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