Average Error: 0.0 → 0.0
Time: 4.2s
Precision: 64
\[56789 \le a \le 98765 \land 0.0 \le b \le 1 \land 0.0 \le c \le 0.001677300000000000058247850986958837893326 \land 0.0 \le d \le 0.001677300000000000058247850986958837893326\]
\[a \cdot \left(\left(b + c\right) + d\right)\]
↓
\[a \cdot \left(\left(b + c\right) + d\right)\]
a \cdot \left(\left(b + c\right) + d\right)
↓
a \cdot \left(\left(b + c\right) + d\right)
double f(double a, double b, double c, double d) {
        double r109354 = a;
        double r109355 = b;
        double r109356 = c;
        double r109357 = r109355 + r109356;
        double r109358 = d;
        double r109359 = r109357 + r109358;
        double r109360 = r109354 * r109359;
        return r109360;
}
↓
double f(double a, double b, double c, double d) {
        double r109361 = a;
        double r109362 = b;
        double r109363 = c;
        double r109364 = r109362 + r109363;
        double r109365 = d;
        double r109366 = r109364 + r109365;
        double r109367 = r109361 * r109366;
        return r109367;
}

Error

Bits error versus a

Bits error versus b

Bits error versus c

Bits error versus d

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original0.0
Target0.0
Herbie0.0
\[a \cdot b + a \cdot \left(c + d\right)\]

Derivation

  1. Initial program 0.0

    \[a \cdot \left(\left(b + c\right) + d\right)\]

  2. Final simplification0.0

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

Reproduce

herbie shell --seed 2019354 
(FPCore (a b c d)
  :name "Expression, p14"
  :precision binary64
  :pre (and (<= 56789 a 98765) (<= 0.0 b 1) (<= 0.0 c 0.0016773) (<= 0.0 d 0.0016773))

  :herbie-target
  (+ (* a b) (* a (+ c d)))

  (* a (+ (+ b c) d)))