Average Error: 0.0 → 0.0
Time: 12.1s
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 r3554666 = a;
        double r3554667 = r3554666 * r3554666;
        double r3554668 = b;
        double r3554669 = r3554668 * r3554668;
        double r3554670 = r3554667 - r3554669;
        return r3554670;
}
↓
double f(double a, double b) {
        double r3554671 = b;
        double r3554672 = a;
        double r3554673 = r3554671 + r3554672;
        double r3554674 = r3554672 - r3554671;
        double r3554675 = r3554673 * r3554674;
        return r3554675;
}

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

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

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