Average Error: 0.0 → 0.0
Time: 4.7s
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 r62333 = a;
        double r62334 = r62333 * r62333;
        double r62335 = b;
        double r62336 = r62335 * r62335;
        double r62337 = r62334 - r62336;
        return r62337;
}
↓
double f(double a, double b) {
        double r62338 = b;
        double r62339 = a;
        double r62340 = r62338 + r62339;
        double r62341 = r62339 - r62338;
        double r62342 = r62340 * r62341;
        return r62342;
}

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. Simplified0.0

    \[\leadsto \color{blue}{\left(b + a\right)} \cdot \left(a - b\right)\]

  5. Final simplification0.0

    \[\leadsto \left(b + a\right) \cdot \left(a - b\right)\]

Reproduce

herbie shell --seed 2019294 
(FPCore (a b)
  :name "Difference of squares"
  :precision binary64

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

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