Average Error: 0.3 → 0
Time: 312.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 r278119 = d;
        double r278120 = 10.0;
        double r278121 = r278119 * r278120;
        double r278122 = 20.0;
        double r278123 = r278119 * r278122;
        double r278124 = r278121 + r278123;
        return r278124;
}
↓
double f(double d) {
        double r278125 = d;
        double r278126 = 10.0;
        double r278127 = 20.0;
        double r278128 = r278126 + r278127;
        double r278129 = r278125 * r278128;
        return r278129;
}

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

  :herbie-target
  (* d 30)

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