Average Error: 0.0 → 0.0
Time: 10.7s
Precision: 64
\[5 \le a \le 10 \land 0.0 \le b \le 0.001000000000000000020816681711721685132943\]
\[\left(a + b\right) \cdot \left(a + b\right)\]
↓
\[b \cdot \left(2 \cdot a + b\right) + a \cdot a\]
\left(a + b\right) \cdot \left(a + b\right)
↓
b \cdot \left(2 \cdot a + b\right) + a \cdot a
double f(double a, double b) {
        double r87403 = a;
        double r87404 = b;
        double r87405 = r87403 + r87404;
        double r87406 = r87405 * r87405;
        return r87406;
}
↓
double f(double a, double b) {
        double r87407 = b;
        double r87408 = 2.0;
        double r87409 = a;
        double r87410 = r87408 * r87409;
        double r87411 = r87410 + r87407;
        double r87412 = r87407 * r87411;
        double r87413 = r87409 * r87409;
        double r87414 = r87412 + r87413;
        return r87414;
}

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 0 0.0

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

  3. Simplified0.0

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

  4. Final simplification0.0

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

Reproduce

herbie shell --seed 2019325 
(FPCore (a b)
  :name "Expression 4, p15"
  :precision binary64
  :pre (and (<= 5 a 10) (<= 0.0 b 0.001))

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

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