Average Error: 0.3 → 0
Time: 716.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 r103702 = d;
        double r103703 = 10.0;
        double r103704 = r103702 * r103703;
        double r103705 = 20.0;
        double r103706 = r103702 * r103705;
        double r103707 = r103704 + r103706;
        return r103707;
}
↓
double f(double d) {
        double r103708 = d;
        double r103709 = 10.0;
        double r103710 = 20.0;
        double r103711 = r103709 + r103710;
        double r103712 = r103708 * r103711;
        return r103712;
}

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

  :herbie-target
  (* d 30.0)

  (+ (* d 10.0) (* d 20.0)))