Average Error: 0 → 0
Time: 624.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 r21507913 = x;
        double r21507914 = 2.0;
        double r21507915 = r21507913 * r21507914;
        double r21507916 = r21507915 * r21507913;
        return r21507916;
}

double f(double x) {
        double r21507917 = x;
        double r21507918 = 2.0;
        double r21507919 = r21507917 * r21507918;
        double r21507920 = r21507917 * r21507919;
        return r21507920;
}

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 2019164 +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))