Average Error: 0.3 → 0
Time: 327.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 r347528 = d;
        double r347529 = 10.0;
        double r347530 = r347528 * r347529;
        double r347531 = 20.0;
        double r347532 = r347528 * r347531;
        double r347533 = r347530 + r347532;
        return r347533;
}
↓
double f(double d) {
        double r347534 = d;
        double r347535 = 10.0;
        double r347536 = 20.0;
        double r347537 = r347535 + r347536;
        double r347538 = r347534 * r347537;
        return r347538;
}

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

  :herbie-target
  (* d 30)

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