Average Error: 0.0 → 0.0
Time: 6.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 r95704 = a;
        double r95705 = r95704 * r95704;
        double r95706 = b;
        double r95707 = r95706 * r95706;
        double r95708 = r95705 - r95707;
        return r95708;
}
↓
double f(double a, double b) {
        double r95709 = b;
        double r95710 = a;
        double r95711 = r95709 + r95710;
        double r95712 = r95710 - r95709;
        double r95713 = r95711 * r95712;
        return r95713;
}

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

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

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