Average Error: 0.0 → 0.0
Time: 11.2s
Precision: 64
\[56789 \le a \le 98765 \land 0 \le b \le 1 \land 0 \le c \le 0.0016773 \land 0 \le d \le 0.0016773\]
\[a \cdot \left(\left(b + c\right) + d\right)\]
↓
\[d \cdot a + \left(b + c\right) \cdot a\]
a \cdot \left(\left(b + c\right) + d\right)
↓
d \cdot a + \left(b + c\right) \cdot a
double f(double a, double b, double c, double d) {
        double r2922371 = a;
        double r2922372 = b;
        double r2922373 = c;
        double r2922374 = r2922372 + r2922373;
        double r2922375 = d;
        double r2922376 = r2922374 + r2922375;
        double r2922377 = r2922371 * r2922376;
        return r2922377;
}
↓
double f(double a, double b, double c, double d) {
        double r2922378 = d;
        double r2922379 = a;
        double r2922380 = r2922378 * r2922379;
        double r2922381 = b;
        double r2922382 = c;
        double r2922383 = r2922381 + r2922382;
        double r2922384 = r2922383 * r2922379;
        double r2922385 = r2922380 + r2922384;
        return r2922385;
}

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. Final simplification0.0

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

Reproduce

herbie shell --seed 2019151 +o rules:numerics
(FPCore (a b c d)
  :name "Expression, p14"
  :pre (and (<= 56789 a 98765) (<= 0 b 1) (<= 0 c 0.0016773) (<= 0 d 0.0016773))

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

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