Average Error: 0.3 → 0
Time: 616.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 r29681 = d;
        double r29682 = 10.0;
        double r29683 = r29681 * r29682;
        double r29684 = 20.0;
        double r29685 = r29681 * r29684;
        double r29686 = r29683 + r29685;
        return r29686;
}
↓
double f(double d) {
        double r29687 = d;
        double r29688 = 10.0;
        double r29689 = 20.0;
        double r29690 = r29688 + r29689;
        double r29691 = r29687 * r29690;
        return r29691;
}

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

  :herbie-target
  (* d 30)

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