Average Error: 0.3 → 0
Time: 297.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 r28594 = d;
        double r28595 = 10.0;
        double r28596 = r28594 * r28595;
        double r28597 = 20.0;
        double r28598 = r28594 * r28597;
        double r28599 = r28596 + r28598;
        return r28599;
}
↓
double f(double d) {
        double r28600 = d;
        double r28601 = 10.0;
        double r28602 = 20.0;
        double r28603 = r28601 + r28602;
        double r28604 = r28600 * r28603;
        return r28604;
}

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

  :herbie-target
  (* d 30)

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