Average Error: 0 → 0
Time: 776.0ms
Precision: 64
\[\left(x \cdot 2\right) \cdot x\]
↓
\[\left(x \cdot 2\right) \cdot x\]
\left(x \cdot 2\right) \cdot x
↓
\left(x \cdot 2\right) \cdot x
double f(double x) {
        double r362698 = x;
        double r362699 = 2.0;
        double r362700 = r362698 * r362699;
        double r362701 = r362700 * r362698;
        return r362701;
}
↓
double f(double x) {
        double r362702 = x;
        double r362703 = 2.0;
        double r362704 = r362702 * r362703;
        double r362705 = r362704 * r362702;
        return r362705;
}

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 \cdot x\right) \cdot x\]

Derivation

  1. Initial program 0

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

  2. Final simplification0

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

Reproduce

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

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

  (* (* x 2.0) x))