Average Error: 0.0 → 0.0
Time: 21.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 r3817014 = a;
        double r3817015 = r3817014 * r3817014;
        double r3817016 = b;
        double r3817017 = r3817016 * r3817016;
        double r3817018 = r3817015 - r3817017;
        return r3817018;
}
↓
double f(double a, double b) {
        double r3817019 = b;
        double r3817020 = a;
        double r3817021 = r3817019 + r3817020;
        double r3817022 = r3817020 - r3817019;
        double r3817023 = r3817021 * r3817022;
        return r3817023;
}

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

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

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