Average Error: 0.0 → 0.0
Time: 12.0s
Precision: 64
\[5 \le a \le 10 \land 0.0 \le b \le 0.001000000000000000020816681711721685132943\]
\[\left(a + b\right) \cdot \left(a + b\right)\]
↓
\[\left(a + b\right) \cdot a + \left(a + b\right) \cdot b\]
\left(a + b\right) \cdot \left(a + b\right)
↓
\left(a + b\right) \cdot a + \left(a + b\right) \cdot b
double f(double a, double b) {
        double r67013 = a;
        double r67014 = b;
        double r67015 = r67013 + r67014;
        double r67016 = r67015 * r67015;
        return r67016;
}
↓
double f(double a, double b) {
        double r67017 = a;
        double r67018 = b;
        double r67019 = r67017 + r67018;
        double r67020 = r67019 * r67017;
        double r67021 = r67019 * r67018;
        double r67022 = r67020 + r67021;
        return r67022;
}

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. Using strategy rm

  3. Applied distribute-lft-in0.0

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

  4. Final simplification0.0

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

Reproduce

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