Average Error: 0.0 → 0.0
Time: 760.0ms
Precision: 64
\[a \cdot a - b \cdot b\]
↓
\[\left(a + b\right) \cdot \left(a - b\right)\]
a \cdot a - b \cdot b
↓
\left(a + b\right) \cdot \left(a - b\right)
double f(double a, double b) {
        double r90482 = a;
        double r90483 = r90482 * r90482;
        double r90484 = b;
        double r90485 = r90484 * r90484;
        double r90486 = r90483 - r90485;
        return r90486;
}
↓
double f(double a, double b) {
        double r90487 = a;
        double r90488 = b;
        double r90489 = r90487 + r90488;
        double r90490 = r90487 - r90488;
        double r90491 = r90489 * r90490;
        return r90491;
}

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(a + b\right) \cdot \left(a - b\right)\]

Reproduce

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

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

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