Average Error: 0.0 → 0.0
Time: 8.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)\]
\[\left(b + c\right) \cdot a + a \cdot d\]
a \cdot \left(\left(b + c\right) + d\right)
\left(b + c\right) \cdot a + a \cdot d
double f(double a, double b, double c, double d) {
        double r122448 = a;
        double r122449 = b;
        double r122450 = c;
        double r122451 = r122449 + r122450;
        double r122452 = d;
        double r122453 = r122451 + r122452;
        double r122454 = r122448 * r122453;
        return r122454;
}

double f(double a, double b, double c, double d) {
        double r122455 = b;
        double r122456 = c;
        double r122457 = r122455 + r122456;
        double r122458 = a;
        double r122459 = r122457 * r122458;
        double r122460 = d;
        double r122461 = r122458 * r122460;
        double r122462 = r122459 + r122461;
        return r122462;
}

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. Simplified0.0

    \[\leadsto \color{blue}{\left(b + c\right) \cdot a} + a \cdot d\]
  5. Final simplification0.0

    \[\leadsto \left(b + c\right) \cdot a + a \cdot d\]

Reproduce

herbie shell --seed 2020042 +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)))