Average Error: 0.0 → 0.0
Time: 12.3s
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 r99075 = a;
        double r99076 = r99075 * r99075;
        double r99077 = b;
        double r99078 = r99077 * r99077;
        double r99079 = r99076 - r99078;
        return r99079;
}
↓
double f(double a, double b) {
        double r99080 = a;
        double r99081 = r99080 * r99080;
        double r99082 = b;
        double r99083 = r99082 * r99082;
        double r99084 = r99081 - r99083;
        return r99084;
}

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

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

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