Average Error: 0.0 → 0.0
Time: 8.9s
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 r3127185 = a;
        double r3127186 = b;
        double r3127187 = r3127185 + r3127186;
        double r3127188 = r3127187 * r3127187;
        return r3127188;
}
↓
double f(double a, double b) {
        double r3127189 = b;
        double r3127190 = r3127189 * r3127189;
        double r3127191 = a;
        double r3127192 = r3127191 * r3127191;
        double r3127193 = 2.0;
        double r3127194 = r3127191 * r3127193;
        double r3127195 = r3127194 * r3127189;
        double r3127196 = r3127192 + r3127195;
        double r3127197 = r3127190 + r3127196;
        return r3127197;
}

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 2019141 
(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)))