Average Error: 0.3 → 0
Time: 313.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 r338331 = d;
        double r338332 = 10.0;
        double r338333 = r338331 * r338332;
        double r338334 = 20.0;
        double r338335 = r338331 * r338334;
        double r338336 = r338333 + r338335;
        return r338336;
}
↓
double f(double d) {
        double r338337 = d;
        double r338338 = 10.0;
        double r338339 = 20.0;
        double r338340 = r338338 + r338339;
        double r338341 = r338337 * r338340;
        return r338341;
}

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

  :herbie-target
  (* d 30)

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