Average Error: 0.0 → 0.0
Time: 7.0s
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 r1473732 = a;
        double r1473733 = b;
        double r1473734 = c;
        double r1473735 = r1473733 + r1473734;
        double r1473736 = d;
        double r1473737 = r1473735 + r1473736;
        double r1473738 = r1473732 * r1473737;
        return r1473738;
}

double f(double a, double b, double c, double d) {
        double r1473739 = b;
        double r1473740 = c;
        double r1473741 = r1473739 + r1473740;
        double r1473742 = d;
        double r1473743 = r1473741 + r1473742;
        double r1473744 = a;
        double r1473745 = r1473743 * r1473744;
        return r1473745;
}

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 2019156 +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)))