Average Error: 0.0 → 0.0
Time: 2.0s
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(\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 r82136 = a;
        double r82137 = b;
        double r82138 = c;
        double r82139 = r82137 + r82138;
        double r82140 = d;
        double r82141 = r82139 + r82140;
        double r82142 = r82136 * r82141;
        return r82142;
}
↓
double f(double a, double b, double c, double d) {
        double r82143 = a;
        double r82144 = b;
        double r82145 = c;
        double r82146 = r82144 + r82145;
        double r82147 = d;
        double r82148 = r82146 + r82147;
        double r82149 = r82143 * r82148;
        return r82149;
}

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