Average Error: 0.0 → 0.0
Time: 6.9s
Precision: 64
\[5 \le a \le 10 \land 0.0 \le b \le 0.001000000000000000020816681711721685132943\]
\[\left(a + b\right) \cdot \left(a + b\right)\]
↓
\[a \cdot a + b \cdot \left(2 \cdot a + b\right)\]
\left(a + b\right) \cdot \left(a + b\right)
↓
a \cdot a + b \cdot \left(2 \cdot a + b\right)
double f(double a, double b) {
        double r8287578 = a;
        double r8287579 = b;
        double r8287580 = r8287578 + r8287579;
        double r8287581 = r8287580 * r8287580;
        return r8287581;
}
↓
double f(double a, double b) {
        double r8287582 = a;
        double r8287583 = r8287582 * r8287582;
        double r8287584 = b;
        double r8287585 = 2.0;
        double r8287586 = r8287585 * r8287582;
        double r8287587 = r8287586 + r8287584;
        double r8287588 = r8287584 * r8287587;
        double r8287589 = r8287583 + r8287588;
        return r8287589;
}

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

  3. Simplified0.0

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

  4. Final simplification0.0

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

Reproduce

herbie shell --seed 2019174 
(FPCore (a b)
  :name "Expression 4, p15"
  :pre (and (<= 5.0 a 10.0) (<= 0.0 b 0.001))

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

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