Average Error: 0.0 → 0.0
Time: 2.3s
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 r82431 = a;
        double r82432 = b;
        double r82433 = c;
        double r82434 = r82432 + r82433;
        double r82435 = d;
        double r82436 = r82434 + r82435;
        double r82437 = r82431 * r82436;
        return r82437;
}
↓
double f(double a, double b, double c, double d) {
        double r82438 = a;
        double r82439 = b;
        double r82440 = c;
        double r82441 = r82439 + r82440;
        double r82442 = r82438 * r82441;
        double r82443 = d;
        double r82444 = r82438 * r82443;
        double r82445 = r82442 + r82444;
        return r82445;
}

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 2020033 
(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)))