Average Error: 0.3 → 0
Time: 300.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 r327981 = d;
        double r327982 = 10.0;
        double r327983 = r327981 * r327982;
        double r327984 = 20.0;
        double r327985 = r327981 * r327984;
        double r327986 = r327983 + r327985;
        return r327986;
}
↓
double f(double d) {
        double r327987 = d;
        double r327988 = 10.0;
        double r327989 = 20.0;
        double r327990 = r327988 + r327989;
        double r327991 = r327987 * r327990;
        return r327991;
}

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 2020064 
(FPCore (d)
  :name "FastMath test1"
  :precision binary64

  :herbie-target
  (* d 30)

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