Average Error: 0.3 → 0
Time: 1.2s
Precision: 64
\[d \cdot 10 + d \cdot 20\]
↓
\[d \cdot \left(10 + 20\right)\]
d \cdot 10 + d \cdot 20
↓
d \cdot \left(10 + 20\right)
double f(double d) {
        double r118722 = d;
        double r118723 = 10.0;
        double r118724 = r118722 * r118723;
        double r118725 = 20.0;
        double r118726 = r118722 * r118725;
        double r118727 = r118724 + r118726;
        return r118727;
}
↓
double f(double d) {
        double r118728 = d;
        double r118729 = 10.0;
        double r118730 = 20.0;
        double r118731 = r118729 + r118730;
        double r118732 = r118728 * r118731;
        return r118732;
}

Error

Bits error versus d

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original0.3
Target0
Herbie0
\[d \cdot 30\]

Derivation

  1. Initial program 0.3

    \[d \cdot 10 + d \cdot 20\]

  2. Simplified0

    \[\leadsto \color{blue}{d \cdot \left(10 + 20\right)}\]

  3. Final simplification0

    \[\leadsto d \cdot \left(10 + 20\right)\]

Reproduce

herbie shell --seed 2019195 +o rules:numerics
(FPCore (d)
  :name "FastMath test1"

  :herbie-target
  (* d 30.0)

  (+ (* d 10.0) (* d 20.0)))