Average Error: 0.3 → 0
Time: 648.0ms
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 r137725 = d;
        double r137726 = 10.0;
        double r137727 = r137725 * r137726;
        double r137728 = 20.0;
        double r137729 = r137725 * r137728;
        double r137730 = r137727 + r137729;
        return r137730;
}
↓
double f(double d) {
        double r137731 = d;
        double r137732 = 10.0;
        double r137733 = 20.0;
        double r137734 = r137732 + r137733;
        double r137735 = r137731 * r137734;
        return r137735;
}

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 2019323 +o rules:numerics
(FPCore (d)
  :name "FastMath test1"
  :precision binary64

  :herbie-target
  (* d 30)

  (+ (* d 10) (* d 20)))