Average Error: 0.3 → 0
Time: 608.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 r137387 = d;
        double r137388 = 10.0;
        double r137389 = r137387 * r137388;
        double r137390 = 20.0;
        double r137391 = r137387 * r137390;
        double r137392 = r137389 + r137391;
        return r137392;
}
↓
double f(double d) {
        double r137393 = d;
        double r137394 = 10.0;
        double r137395 = 20.0;
        double r137396 = r137394 + r137395;
        double r137397 = r137393 * r137396;
        return r137397;
}

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

  :herbie-target
  (* d 30)

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