Expression, p14

Average Error: 0.0 → 0.0

Time: 12.1s

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\]

Math

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

↓

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

C

double f(double a, double b, double c, double d) {
        double r102808 = a;
        double r102809 = b;
        double r102810 = c;
        double r102811 = r102809 + r102810;
        double r102812 = d;
        double r102813 = r102811 + r102812;
        double r102814 = r102808 * r102813;
        return r102814;
}

↓

double f(double a, double b, double c, double d) {
        double r102815 = b;
        double r102816 = c;
        double r102817 = r102815 + r102816;
        double r102818 = a;
        double r102819 = r102817 * r102818;
        double r102820 = d;
        double r102821 = r102820 * r102818;
        double r102822 = r102819 + r102821;
        return r102822;
}

Error

Bits error versus a

Bits error versus b

Bits error versus c

Bits error versus d

Target

Original	0.0
Target	0.0
Herbie	0.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-in 0.0

   \[\leadsto \color{blue}{a \cdot \left(b + c\right) + a \cdot d}\]

4. Simplified 0.0

   \[\leadsto \color{blue}{\left(b + c\right) \cdot a} + a \cdot d\]

5. Simplified 0.0

   \[\leadsto \left(b + c\right) \cdot a + \color{blue}{d \cdot a}\]

6. Final simplification 0.0

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

Reproduce

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

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

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