Average Error: 0.0 → 0.0
Time: 752.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 r118965 = a;
        double r118966 = r118965 * r118965;
        double r118967 = b;
        double r118968 = r118967 * r118967;
        double r118969 = r118966 - r118968;
        return r118969;
}
↓
double f(double a, double b) {
        double r118970 = a;
        double r118971 = b;
        double r118972 = r118970 + r118971;
        double r118973 = r118970 - r118971;
        double r118974 = r118972 * r118973;
        return r118974;
}

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

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

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