Average Error: 0.0 → 0.0
Time: 4.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 r2071175 = a;
        double r2071176 = r2071175 * r2071175;
        double r2071177 = b;
        double r2071178 = r2071177 * r2071177;
        double r2071179 = r2071176 - r2071178;
        return r2071179;
}
↓
double f(double a, double b) {
        double r2071180 = b;
        double r2071181 = a;
        double r2071182 = r2071180 + r2071181;
        double r2071183 = r2071181 - r2071180;
        double r2071184 = r2071182 * r2071183;
        return r2071184;
}

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

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

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