Average Error: 0.0 → 0.0
Time: 924.0ms
Precision: 64
Internal Precision: 128
\[x + x \cdot x\]
↓
\[x \cdot x + x\]

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original0.0
Target0.0
Herbie0.0
\[\left(1.0 + x\right) \cdot x\]

Derivation

  1. Initial program 0.0

    \[x + x \cdot x\]

  2. Final simplification0.0

    \[\leadsto x \cdot x + x\]

Reproduce

herbie shell --seed 2019022 
(FPCore (x)
  :name "Expression 2, p15"
  :pre (<= 0 x 2)

  :herbie-target
  (* (+ 1.0 x) x)

  (+ x (* x x)))

Details

Time bar (total: 692.0ms)Debug log

sample28.0ms

Algorithm
intervals
Results
12.0ms256×body80valid
7.0ms256×pre80true

simplify9.0ms

Counts
1 → 1
Calls
1 calls:
Slowest
9.0ms
(+ x (* x x))

prune3.0ms

Pruning

1 alts after pruning (1 fresh and 0 done)

Merged error: 0b

localize5.0ms

Local error

Found 0 expressions with local error:

rewrite0.0ms

Algorithm
rewrite-expression-head
Rules
Counts
0 → 0
Calls
0 calls:
Slowest

series0.0ms

Counts
0 → 0
Calls
0 calls:
Slowest

simplify0.0ms

Counts
0 → 0
Calls
0 calls:
Slowest

prune2.0ms

Pruning

1 alts after pruning (0 fresh and 1 done)

Merged error: 0b

end0.0ms

sample644.0ms

Algorithm
intervals
Results
333.0ms8000×body80valid
215.0ms8000×pre80true