Average Error: 0.3 → 0
Time: 292.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 r339783 = d;
        double r339784 = 10.0;
        double r339785 = r339783 * r339784;
        double r339786 = 20.0;
        double r339787 = r339783 * r339786;
        double r339788 = r339785 + r339787;
        return r339788;
}
↓
double f(double d) {
        double r339789 = d;
        double r339790 = 10.0;
        double r339791 = 20.0;
        double r339792 = r339790 + r339791;
        double r339793 = r339789 * r339792;
        return r339793;
}

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

  :herbie-target
  (* d 30)

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