Average Error: 0.0 → 0.0
Time: 28.7s
Precision: 64
\[56789.0 \le a \le 98765.0 \land 0.0 \le b \le 1.0 \land 0.0 \le c \le 0.0016773 \land 0.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 r4590994 = a;
        double r4590995 = b;
        double r4590996 = c;
        double r4590997 = r4590995 + r4590996;
        double r4590998 = d;
        double r4590999 = r4590997 + r4590998;
        double r4591000 = r4590994 * r4590999;
        return r4591000;
}

double f(double a, double b, double c, double d) {
        double r4591001 = b;
        double r4591002 = c;
        double r4591003 = r4591001 + r4591002;
        double r4591004 = d;
        double r4591005 = r4591003 + r4591004;
        double r4591006 = a;
        double r4591007 = r4591005 * r4591006;
        return r4591007;
}

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 2019165 +o rules:numerics
(FPCore (a b c d)
  :name "Expression, p14"
  :pre (and (<= 56789.0 a 98765.0) (<= 0.0 b 1.0) (<= 0.0 c 0.0016773) (<= 0.0 d 0.0016773))

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

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