Average Error: 0.0 → 0.0
Time: 647.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 r100652 = a;
        double r100653 = r100652 * r100652;
        double r100654 = b;
        double r100655 = r100654 * r100654;
        double r100656 = r100653 - r100655;
        return r100656;
}
↓
double f(double a, double b) {
        double r100657 = a;
        double r100658 = r100657 * r100657;
        double r100659 = b;
        double r100660 = r100659 * r100659;
        double r100661 = r100658 - r100660;
        return r100661;
}

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

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

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