Average Error: 0.0 → 0.0
Time: 2.0s
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)\]
\[\left(a \cdot b + a \cdot c\right) + a \cdot d\]
a \cdot \left(\left(b + c\right) + d\right)
\left(a \cdot b + a \cdot c\right) + a \cdot d
double f(double a, double b, double c, double d) {
        double r93356 = a;
        double r93357 = b;
        double r93358 = c;
        double r93359 = r93357 + r93358;
        double r93360 = d;
        double r93361 = r93359 + r93360;
        double r93362 = r93356 * r93361;
        return r93362;
}

double f(double a, double b, double c, double d) {
        double r93363 = a;
        double r93364 = b;
        double r93365 = r93363 * r93364;
        double r93366 = c;
        double r93367 = r93363 * r93366;
        double r93368 = r93365 + r93367;
        double r93369 = d;
        double r93370 = r93363 * r93369;
        double r93371 = r93368 + r93370;
        return r93371;
}

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. Using strategy rm
  3. Applied distribute-lft-in0.0

    \[\leadsto \color{blue}{a \cdot \left(b + c\right) + a \cdot d}\]
  4. Using strategy rm
  5. Applied distribute-lft-in0.0

    \[\leadsto \color{blue}{\left(a \cdot b + a \cdot c\right)} + a \cdot d\]
  6. Final simplification0.0

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

Reproduce

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