Average Error: 0.0 → 0.0
Time: 8.2s
Precision: 64
\[5 \le a \le 10 \land 0 \le b \le 0.001\]
\[\left(a + b\right) \cdot \left(a + b\right)\]
↓
\[a \cdot a + \left(b \cdot b + \left(a \cdot b + a \cdot b\right)\right)\]
\left(a + b\right) \cdot \left(a + b\right)
↓
a \cdot a + \left(b \cdot b + \left(a \cdot b + a \cdot b\right)\right)
double f(double a, double b) {
        double r1613829 = a;
        double r1613830 = b;
        double r1613831 = r1613829 + r1613830;
        double r1613832 = r1613831 * r1613831;
        return r1613832;
}
↓
double f(double a, double b) {
        double r1613833 = a;
        double r1613834 = r1613833 * r1613833;
        double r1613835 = b;
        double r1613836 = r1613835 * r1613835;
        double r1613837 = r1613833 * r1613835;
        double r1613838 = r1613837 + r1613837;
        double r1613839 = r1613836 + r1613838;
        double r1613840 = r1613834 + r1613839;
        return r1613840;
}

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(\left(b \cdot a + b \cdot b\right) + b \cdot a\right) + a \cdot a\]

Derivation

  1. Initial program 0.0

    \[\left(a + b\right) \cdot \left(a + b\right)\]

  2. Taylor expanded around inf 0.0

    \[\leadsto \color{blue}{{a}^{2} + \left({b}^{2} + 2 \cdot \left(a \cdot b\right)\right)}\]

  3. Simplified0.0

    \[\leadsto \color{blue}{a \cdot a + \left(b \cdot b + \left(a \cdot b + a \cdot b\right)\right)}\]

  4. Final simplification0.0

    \[\leadsto a \cdot a + \left(b \cdot b + \left(a \cdot b + a \cdot b\right)\right)\]

Reproduce

herbie shell --seed 2019152 
(FPCore (a b)
  :name "Expression 4, p15"
  :pre (and (<= 5 a 10) (<= 0 b 0.001))

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

  (* (+ a b) (+ a b)))