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 r138332 = d;
        double r138333 = 10.0;
        double r138334 = r138332 * r138333;
        double r138335 = 20.0;
        double r138336 = r138332 * r138335;
        double r138337 = r138334 + r138336;
        return r138337;
}
↓
double f(double d) {
        double r138338 = d;
        double r138339 = 10.0;
        double r138340 = 20.0;
        double r138341 = r138339 + r138340;
        double r138342 = r138338 * r138341;
        return r138342;
}

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

  :herbie-target
  (* d 30)

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