Average Error: 0.0 → 0.0
Time: 5.1s
Precision: 64
\[5 \le a \le 10 \land 0 \le b \le 0.001\]
\[\left(a + b\right) \cdot \left(a + b\right)\]
↓
\[\left(2 \cdot a + b\right) \cdot b + a \cdot a\]
\left(a + b\right) \cdot \left(a + b\right)
↓
\left(2 \cdot a + b\right) \cdot b + a \cdot a
double f(double a, double b) {
        double r12188924 = a;
        double r12188925 = b;
        double r12188926 = r12188924 + r12188925;
        double r12188927 = r12188926 * r12188926;
        return r12188927;
}
↓
double f(double a, double b) {
        double r12188928 = 2.0;
        double r12188929 = a;
        double r12188930 = r12188928 * r12188929;
        double r12188931 = b;
        double r12188932 = r12188930 + r12188931;
        double r12188933 = r12188932 * r12188931;
        double r12188934 = r12188929 * r12188929;
        double r12188935 = r12188933 + r12188934;
        return r12188935;
}

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

  4. Final simplification0.0

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

Reproduce

herbie shell --seed 2019107 
(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)))