Average Error: 0.0 → 0.0
Time: 4.9s
Precision: 64
\[56789 \le a \le 98765 \land 0.0 \le b \le 1 \land 0.0 \le c \le 0.001677300000000000058247850986958837893326 \land 0.0 \le d \le 0.001677300000000000058247850986958837893326\]
\[a \cdot \left(\left(b + c\right) + d\right)\]
↓
\[a \cdot \left(\left(b + c\right) + d\right)\]
a \cdot \left(\left(b + c\right) + d\right)
↓
a \cdot \left(\left(b + c\right) + d\right)
double f(double a, double b, double c, double d) {
        double r65760 = a;
        double r65761 = b;
        double r65762 = c;
        double r65763 = r65761 + r65762;
        double r65764 = d;
        double r65765 = r65763 + r65764;
        double r65766 = r65760 * r65765;
        return r65766;
}
↓
double f(double a, double b, double c, double d) {
        double r65767 = a;
        double r65768 = b;
        double r65769 = c;
        double r65770 = r65768 + r65769;
        double r65771 = d;
        double r65772 = r65770 + r65771;
        double r65773 = r65767 * r65772;
        return r65773;
}

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

Reproduce

herbie shell --seed 2019304 
(FPCore (a b c d)
  :name "Expression, p14"
  :precision binary64
  :pre (and (<= 56789 a 98765) (<= 0.0 b 1) (<= 0.0 c 0.0016773000000000001) (<= 0.0 d 0.0016773000000000001))

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

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