Average Error: 0.0 → 0.0
Time: 40.1s
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 r15184258 = a;
        double r15184259 = b;
        double r15184260 = c;
        double r15184261 = r15184259 + r15184260;
        double r15184262 = d;
        double r15184263 = r15184261 + r15184262;
        double r15184264 = r15184258 * r15184263;
        return r15184264;
}

double f(double a, double b, double c, double d) {
        double r15184265 = b;
        double r15184266 = c;
        double r15184267 = r15184265 + r15184266;
        double r15184268 = d;
        double r15184269 = r15184267 + r15184268;
        double r15184270 = a;
        double r15184271 = r15184269 * r15184270;
        return r15184271;
}

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