Average Error: 0.0 → 0.0
Time: 7.2s
Precision: 64
\[56789 \le a \le 98765 \land 0.0 \le b \le 1 \land 0.0 \le c \le 0.0016773000000000001 \land 0.0 \le d \le 0.0016773000000000001\]
\[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 r99213 = a;
        double r99214 = b;
        double r99215 = c;
        double r99216 = r99214 + r99215;
        double r99217 = d;
        double r99218 = r99216 + r99217;
        double r99219 = r99213 * r99218;
        return r99219;
}
↓
double f(double a, double b, double c, double d) {
        double r99220 = a;
        double r99221 = b;
        double r99222 = c;
        double r99223 = r99221 + r99222;
        double r99224 = d;
        double r99225 = r99223 + r99224;
        double r99226 = r99220 * r99225;
        return r99226;
}

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