Average Error: 0.3 → 0
Time: 318.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 r432000 = d;
        double r432001 = 10.0;
        double r432002 = r432000 * r432001;
        double r432003 = 20.0;
        double r432004 = r432000 * r432003;
        double r432005 = r432002 + r432004;
        return r432005;
}
↓
double f(double d) {
        double r432006 = d;
        double r432007 = 10.0;
        double r432008 = 20.0;
        double r432009 = r432007 + r432008;
        double r432010 = r432006 * r432009;
        return r432010;
}

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

  :herbie-target
  (* d 30)

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