Average Error: 0.0 → 0.0
Time: 10.8s
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 r88471 = a;
        double r88472 = r88471 * r88471;
        double r88473 = b;
        double r88474 = r88473 * r88473;
        double r88475 = r88472 - r88474;
        return r88475;
}
↓
double f(double a, double b) {
        double r88476 = a;
        double r88477 = r88476 * r88476;
        double r88478 = b;
        double r88479 = r88478 * r88478;
        double r88480 = r88477 - r88479;
        return r88480;
}

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

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

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