Average Error: 0.3 → 0
Time: 291.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 r188650 = d;
        double r188651 = 10.0;
        double r188652 = r188650 * r188651;
        double r188653 = 20.0;
        double r188654 = r188650 * r188653;
        double r188655 = r188652 + r188654;
        return r188655;
}
↓
double f(double d) {
        double r188656 = d;
        double r188657 = 10.0;
        double r188658 = 20.0;
        double r188659 = r188657 + r188658;
        double r188660 = r188656 * r188659;
        return r188660;
}

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

  :herbie-target
  (* d 30)

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