Average Error: 0.3 → 0
Time: 291.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 r321102 = d;
        double r321103 = 10.0;
        double r321104 = r321102 * r321103;
        double r321105 = 20.0;
        double r321106 = r321102 * r321105;
        double r321107 = r321104 + r321106;
        return r321107;
}
↓
double f(double d) {
        double r321108 = d;
        double r321109 = 10.0;
        double r321110 = 20.0;
        double r321111 = r321109 + r321110;
        double r321112 = r321108 * r321111;
        return r321112;
}

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

  :herbie-target
  (* d 30)

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