Average Error: 0.0 → 0.0
Time: 2.7s
Precision: 64
\[5 \le a \le 10 \land 0.0 \le b \le 10^{-3}\]
\[\left(a + b\right) \cdot \left(a + b\right)\]
↓
\[\left(a + b\right) \cdot \left(a + b\right)\]
\left(a + b\right) \cdot \left(a + b\right)
↓
\left(a + b\right) \cdot \left(a + b\right)
double f(double a, double b) {
        double r97524 = a;
        double r97525 = b;
        double r97526 = r97524 + r97525;
        double r97527 = r97526 * r97526;
        return r97527;
}
↓
double f(double a, double b) {
        double r97528 = a;
        double r97529 = b;
        double r97530 = r97528 + r97529;
        double r97531 = r97530 * r97530;
        return r97531;
}

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. Final simplification0.0

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

Reproduce

herbie shell --seed 2020083 +o rules:numerics
(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)))