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 r2729992 = a;
        double r2729993 = r2729992 * r2729992;
        double r2729994 = b;
        double r2729995 = r2729994 * r2729994;
        double r2729996 = r2729993 - r2729995;
        return r2729996;
}
↓
double f(double a, double b) {
        double r2729997 = b;
        double r2729998 = a;
        double r2729999 = r2729997 + r2729998;
        double r2730000 = r2729998 - r2729997;
        double r2730001 = r2729999 * r2730000;
        return r2730001;
}

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

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

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