Average Error: 0.0 → 0.0
Time: 7.3s
Precision: 64
\[56789 \le a \le 98765 \land 0 \le b \le 1 \land 0 \le c \le 0.0016773 \land 0 \le d \le 0.0016773\]
\[a \cdot \left(\left(b + c\right) + d\right)\]
↓
\[\left(\left(b + c\right) + d\right) \cdot a\]
a \cdot \left(\left(b + c\right) + d\right)
↓
\left(\left(b + c\right) + d\right) \cdot a
double f(double a, double b, double c, double d) {
        double r1395133 = a;
        double r1395134 = b;
        double r1395135 = c;
        double r1395136 = r1395134 + r1395135;
        double r1395137 = d;
        double r1395138 = r1395136 + r1395137;
        double r1395139 = r1395133 * r1395138;
        return r1395139;
}
↓
double f(double a, double b, double c, double d) {
        double r1395140 = b;
        double r1395141 = c;
        double r1395142 = r1395140 + r1395141;
        double r1395143 = d;
        double r1395144 = r1395142 + r1395143;
        double r1395145 = a;
        double r1395146 = r1395144 * r1395145;
        return r1395146;
}

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 \left(\left(b + c\right) + d\right) \cdot a\]

Reproduce

herbie shell --seed 2019128 +o rules:numerics
(FPCore (a b c d)
  :name "Expression, p14"
  :pre (and (<= 56789 a 98765) (<= 0 b 1) (<= 0 c 0.0016773) (<= 0 d 0.0016773))

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

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