Average Error: 0 → 0
Time: 971.0ms
Precision: 64
\[\left(x \cdot 2\right) \cdot x\]
↓
\[x \cdot \left(x \cdot 2\right)\]
\left(x \cdot 2\right) \cdot x
↓
x \cdot \left(x \cdot 2\right)
double f(double x) {
        double r19707836 = x;
        double r19707837 = 2.0;
        double r19707838 = r19707836 * r19707837;
        double r19707839 = r19707838 * r19707836;
        return r19707839;
}
↓
double f(double x) {
        double r19707840 = x;
        double r19707841 = 2.0;
        double r19707842 = r19707840 * r19707841;
        double r19707843 = r19707840 * r19707842;
        return r19707843;
}

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

Reproduce

herbie shell --seed 2019170 +o rules:numerics
(FPCore (x)
  :name "Numeric.Log:$cexpm1 from log-domain-0.10.2.1, A"

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

  (* (* x 2.0) x))