Average Error: 0.0 → 0.0
Time: 7.1s
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 r93230 = a;
        double r93231 = b;
        double r93232 = c;
        double r93233 = r93231 + r93232;
        double r93234 = d;
        double r93235 = r93233 + r93234;
        double r93236 = r93230 * r93235;
        return r93236;
}
↓
double f(double a, double b, double c, double d) {
        double r93237 = a;
        double r93238 = b;
        double r93239 = c;
        double r93240 = r93238 + r93239;
        double r93241 = d;
        double r93242 = r93240 + r93241;
        double r93243 = r93237 * r93242;
        return r93243;
}

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