Average Error: 0.0 → 0.0
Time: 13.1s
Precision: 64
\[a \cdot a - b \cdot b\]
↓
\[a \cdot a - b \cdot b\]
a \cdot a - b \cdot b
↓
a \cdot a - b \cdot b
double f(double a, double b) {
        double r79355 = a;
        double r79356 = r79355 * r79355;
        double r79357 = b;
        double r79358 = r79357 * r79357;
        double r79359 = r79356 - r79358;
        return r79359;
}
↓
double f(double a, double b) {
        double r79360 = a;
        double r79361 = r79360 * r79360;
        double r79362 = b;
        double r79363 = r79362 * r79362;
        double r79364 = r79361 - r79363;
        return r79364;
}

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. Final simplification0.0

    \[\leadsto a \cdot a - b \cdot b\]

Reproduce

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

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

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