Average Error: 0.3 → 0
Time: 342.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 r241634 = d;
        double r241635 = 10.0;
        double r241636 = r241634 * r241635;
        double r241637 = 20.0;
        double r241638 = r241634 * r241637;
        double r241639 = r241636 + r241638;
        return r241639;
}
↓
double f(double d) {
        double r241640 = d;
        double r241641 = 10.0;
        double r241642 = 20.0;
        double r241643 = r241641 + r241642;
        double r241644 = r241640 * r241643;
        return r241644;
}

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

  :herbie-target
  (* d 30)

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