Average Error: 0.0 → 0.0
Time: 1.1m
Precision: 64
\[5 \le a \le 10 \land 0 \le b \le 0.001\]
\[\left(a + b\right) \cdot \left(a + b\right)\]
\[b \cdot b + \left(a \cdot a + \left(a \cdot 2\right) \cdot b\right)\]
\left(a + b\right) \cdot \left(a + b\right)
b \cdot b + \left(a \cdot a + \left(a \cdot 2\right) \cdot b\right)
double f(double a, double b) {
        double r6066371 = a;
        double r6066372 = b;
        double r6066373 = r6066371 + r6066372;
        double r6066374 = r6066373 * r6066373;
        return r6066374;
}

double f(double a, double b) {
        double r6066375 = b;
        double r6066376 = r6066375 * r6066375;
        double r6066377 = a;
        double r6066378 = r6066377 * r6066377;
        double r6066379 = 2.0;
        double r6066380 = r6066377 * r6066379;
        double r6066381 = r6066380 * r6066375;
        double r6066382 = r6066378 + r6066381;
        double r6066383 = r6066376 + r6066382;
        return r6066383;
}

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

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

Reproduce

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