Average Error: 0.0 → 0.0
Time: 2.1s
Precision: 64
\[56789 \le a \le 98765 \land 0.0 \le b \le 1 \land 0.0 \le c \le 0.0016773000000000001 \land 0.0 \le d \le 0.0016773000000000001\]
\[a \cdot \left(\left(b + c\right) + d\right)\]
↓
\[a \cdot \left(b + c\right) + a \cdot d\]
a \cdot \left(\left(b + c\right) + d\right)
↓
a \cdot \left(b + c\right) + a \cdot d
double f(double a, double b, double c, double d) {
        double r95597 = a;
        double r95598 = b;
        double r95599 = c;
        double r95600 = r95598 + r95599;
        double r95601 = d;
        double r95602 = r95600 + r95601;
        double r95603 = r95597 * r95602;
        return r95603;
}
↓
double f(double a, double b, double c, double d) {
        double r95604 = a;
        double r95605 = b;
        double r95606 = c;
        double r95607 = r95605 + r95606;
        double r95608 = r95604 * r95607;
        double r95609 = d;
        double r95610 = r95604 * r95609;
        double r95611 = r95608 + r95610;
        return r95611;
}

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. Using strategy rm

  3. Applied distribute-lft-in0.0

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

  4. Final simplification0.0

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

Reproduce

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