Average Error: 0.3 → 0
Time: 876.0ms
Precision: 64
\[d \cdot 10 + d \cdot 20\]
↓
\[30 \cdot d\]
d \cdot 10 + d \cdot 20
↓
30 \cdot d
double f(double d) {
        double r8088230 = d;
        double r8088231 = 10.0;
        double r8088232 = r8088230 * r8088231;
        double r8088233 = 20.0;
        double r8088234 = r8088230 * r8088233;
        double r8088235 = r8088232 + r8088234;
        return r8088235;
}
↓
double f(double d) {
        double r8088236 = 30.0;
        double r8088237 = d;
        double r8088238 = r8088236 * r8088237;
        return r8088238;
}

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

  3. Final simplification0

    \[\leadsto 30 \cdot d\]

Reproduce

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

  :herbie-target
  (* d 30)

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