Average Error: 0.0 → 0.0
Time: 658.0ms
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 r94103 = a;
        double r94104 = r94103 * r94103;
        double r94105 = b;
        double r94106 = r94105 * r94105;
        double r94107 = r94104 - r94106;
        return r94107;
}
↓
double f(double a, double b) {
        double r94108 = a;
        double r94109 = r94108 * r94108;
        double r94110 = b;
        double r94111 = r94110 * r94110;
        double r94112 = r94109 - r94111;
        return r94112;
}

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

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

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