Average Error: 0.1 → 0.1
Time: 40.5s
Precision: 64
\[\left(d1 \cdot 3 + d1 \cdot d2\right) + d1 \cdot d3\]
↓
\[\left(d3 + \left(d2 + 3\right)\right) \cdot d1\]
\left(d1 \cdot 3 + d1 \cdot d2\right) + d1 \cdot d3
↓
\left(d3 + \left(d2 + 3\right)\right) \cdot d1
double f(double d1, double d2, double d3) {
        double r53270187 = d1;
        double r53270188 = 3.0;
        double r53270189 = r53270187 * r53270188;
        double r53270190 = d2;
        double r53270191 = r53270187 * r53270190;
        double r53270192 = r53270189 + r53270191;
        double r53270193 = d3;
        double r53270194 = r53270187 * r53270193;
        double r53270195 = r53270192 + r53270194;
        return r53270195;
}
↓
double f(double d1, double d2, double d3) {
        double r53270196 = d3;
        double r53270197 = d2;
        double r53270198 = 3.0;
        double r53270199 = r53270197 + r53270198;
        double r53270200 = r53270196 + r53270199;
        double r53270201 = d1;
        double r53270202 = r53270200 * r53270201;
        return r53270202;
}

Error

Bits error versus d1

Bits error versus d2

Bits error versus d3

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original0.1
Target0.1
Herbie0.1
\[d1 \cdot \left(\left(3 + d2\right) + d3\right)\]

Derivation

  1. Initial program 0.1

    \[\left(d1 \cdot 3 + d1 \cdot d2\right) + d1 \cdot d3\]

  2. Simplified0.1

    \[\leadsto \color{blue}{d1 \cdot \left(d3 + \left(3 + d2\right)\right)}\]

  3. Final simplification0.1

    \[\leadsto \left(d3 + \left(d2 + 3\right)\right) \cdot d1\]

Reproduce

herbie shell --seed 2019128 
(FPCore (d1 d2 d3)
  :name "FastMath test3"

  :herbie-target
  (* d1 (+ (+ 3 d2) d3))

  (+ (+ (* d1 3) (* d1 d2)) (* d1 d3)))