Average Error: 0.3 → 0
Time: 770.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 r157307 = d;
        double r157308 = 10.0;
        double r157309 = r157307 * r157308;
        double r157310 = 20.0;
        double r157311 = r157307 * r157310;
        double r157312 = r157309 + r157311;
        return r157312;
}
↓
double f(double d) {
        double r157313 = d;
        double r157314 = 10.0;
        double r157315 = 20.0;
        double r157316 = r157314 + r157315;
        double r157317 = r157313 * r157316;
        return r157317;
}

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

  :herbie-target
  (* d 30.0)

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