Average Error: 0.3 → 0
Time: 809.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 r11313949 = d;
        double r11313950 = 10.0;
        double r11313951 = r11313949 * r11313950;
        double r11313952 = 20.0;
        double r11313953 = r11313949 * r11313952;
        double r11313954 = r11313951 + r11313953;
        return r11313954;
}
↓
double f(double d) {
        double r11313955 = d;
        double r11313956 = 30.0;
        double r11313957 = r11313955 * r11313956;
        return r11313957;
}

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

  :herbie-target
  (* d 30)

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