Average Error: 0.0 → 0.0
Time: 11.5s
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)\]
\[\left(\left(b + c\right) + d\right) \cdot a\]
a \cdot \left(\left(b + c\right) + d\right)
\left(\left(b + c\right) + d\right) \cdot a
double f(double a, double b, double c, double d) {
        double r4150098 = a;
        double r4150099 = b;
        double r4150100 = c;
        double r4150101 = r4150099 + r4150100;
        double r4150102 = d;
        double r4150103 = r4150101 + r4150102;
        double r4150104 = r4150098 * r4150103;
        return r4150104;
}

double f(double a, double b, double c, double d) {
        double r4150105 = b;
        double r4150106 = c;
        double r4150107 = r4150105 + r4150106;
        double r4150108 = d;
        double r4150109 = r4150107 + r4150108;
        double r4150110 = a;
        double r4150111 = r4150109 * r4150110;
        return r4150111;
}

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 \left(\left(b + c\right) + d\right) \cdot a\]

Reproduce

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