Average Error: 0.3 → 0
Time: 1.1s
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 r6199067 = d;
        double r6199068 = 10.0;
        double r6199069 = r6199067 * r6199068;
        double r6199070 = 20.0;
        double r6199071 = r6199067 * r6199070;
        double r6199072 = r6199069 + r6199071;
        return r6199072;
}
↓
double f(double d) {
        double r6199073 = d;
        double r6199074 = 30.0;
        double r6199075 = r6199073 * r6199074;
        return r6199075;
}

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 2019146 +o rules:numerics
(FPCore (d)
  :name "FastMath test1"

  :herbie-target
  (* d 30)

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