Average Error: 0.3 → 0
Time: 449.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 r423084 = d;
        double r423085 = 10.0;
        double r423086 = r423084 * r423085;
        double r423087 = 20.0;
        double r423088 = r423084 * r423087;
        double r423089 = r423086 + r423088;
        return r423089;
}
↓
double f(double d) {
        double r423090 = d;
        double r423091 = 10.0;
        double r423092 = 20.0;
        double r423093 = r423091 + r423092;
        double r423094 = r423090 * r423093;
        return r423094;
}

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

  :herbie-target
  (* d 30)

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