Average Error: 0.0 → 0.0
Time: 6.3s
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 r3123247 = a;
        double r3123248 = r3123247 * r3123247;
        double r3123249 = b;
        double r3123250 = r3123249 * r3123249;
        double r3123251 = r3123248 - r3123250;
        return r3123251;
}
↓
double f(double a, double b) {
        double r3123252 = b;
        double r3123253 = a;
        double r3123254 = r3123252 + r3123253;
        double r3123255 = r3123253 - r3123252;
        double r3123256 = r3123254 * r3123255;
        return r3123256;
}

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

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

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