Average Error: 0 → 0
Time: 644.0ms
Precision: 64
\[\left(x \cdot 2.0\right) \cdot x\]
↓
\[x \cdot \left(x \cdot 2.0\right)\]
\left(x \cdot 2.0\right) \cdot x
↓
x \cdot \left(x \cdot 2.0\right)
double f(double x) {
        double r24078182 = x;
        double r24078183 = 2.0;
        double r24078184 = r24078182 * r24078183;
        double r24078185 = r24078184 * r24078182;
        return r24078185;
}
↓
double f(double x) {
        double r24078186 = x;
        double r24078187 = 2.0;
        double r24078188 = r24078186 * r24078187;
        double r24078189 = r24078186 * r24078188;
        return r24078189;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original0
Target0
Herbie0
\[\left(2.0 \cdot x\right) \cdot x\]

Derivation

  1. Initial program 0

    \[\left(x \cdot 2.0\right) \cdot x\]

  2. Final simplification0

    \[\leadsto x \cdot \left(x \cdot 2.0\right)\]

Reproduce

herbie shell --seed 2019168 
(FPCore (x)
  :name "Numeric.Log:$cexpm1 from log-domain-0.10.2.1, A"

  :herbie-target
  (* (* 2.0 x) x)

  (* (* x 2.0) x))