Average Error: 0.3 → 0
Time: 834.0ms
Precision: 64
\[d \cdot 10 + d \cdot 20\]
↓
\[d \cdot 30\]
d \cdot 10 + d \cdot 20
↓
d \cdot 30
double f(double d) {
        double r10190099 = d;
        double r10190100 = 10.0;
        double r10190101 = r10190099 * r10190100;
        double r10190102 = 20.0;
        double r10190103 = r10190099 * r10190102;
        double r10190104 = r10190101 + r10190103;
        return r10190104;
}
↓
double f(double d) {
        double r10190105 = d;
        double r10190106 = 30.0;
        double r10190107 = r10190105 * r10190106;
        return r10190107;
}

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 30}\]

  3. Final simplification0

    \[\leadsto d \cdot 30\]

Reproduce

herbie shell --seed 2019163 +o rules:numerics
(FPCore (d)
  :name "FastMath test1"

  :herbie-target
  (* d 30)

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