Average Error: 0.0 → 0.0
Time: 2.6s
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 r92133 = a;
        double r92134 = b;
        double r92135 = c;
        double r92136 = r92134 + r92135;
        double r92137 = d;
        double r92138 = r92136 + r92137;
        double r92139 = r92133 * r92138;
        return r92139;
}
↓
double f(double a, double b, double c, double d) {
        double r92140 = a;
        double r92141 = b;
        double r92142 = c;
        double r92143 = r92141 + r92142;
        double r92144 = d;
        double r92145 = r92143 + r92144;
        double r92146 = r92140 * r92145;
        return r92146;
}

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 2020027 +o rules:numerics
(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)))