Average Error: 0.3 → 0
Time: 896.0ms
Precision: 64
\[d \cdot 10 + d \cdot 20\]
↓
\[d \cdot 30\]
d \cdot 10 + d \cdot 20
↓
d \cdot 30
double f(double d) {
        double r8560577 = d;
        double r8560578 = 10.0;
        double r8560579 = r8560577 * r8560578;
        double r8560580 = 20.0;
        double r8560581 = r8560577 * r8560580;
        double r8560582 = r8560579 + r8560581;
        return r8560582;
}
↓
double f(double d) {
        double r8560583 = d;
        double r8560584 = 30.0;
        double r8560585 = r8560583 * r8560584;
        return r8560585;
}

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 30}\]

  3. Final simplification0

    \[\leadsto d \cdot 30\]

Reproduce

herbie shell --seed 2019133 +o rules:numerics
(FPCore (d)
  :name "FastMath test1"

  :herbie-target
  (* d 30)

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