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 r10663468 = a;
        double r10663469 = r10663468 * r10663468;
        double r10663470 = b;
        double r10663471 = r10663470 * r10663470;
        double r10663472 = r10663469 - r10663471;
        return r10663472;
}
↓
double f(double a, double b) {
        double r10663473 = b;
        double r10663474 = a;
        double r10663475 = r10663473 + r10663474;
        double r10663476 = r10663474 - r10663473;
        double r10663477 = r10663475 * r10663476;
        return r10663477;
}

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

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

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