Text.Parsec.Token:makeTokenParser from parsec-3.1.9, A

Time bar (total: 6.6s)

analyze1.0ms (0%)

Algorithm
search
Search
ProbabilityValidUnknownPreconditionInfiniteDomainCan'tIter
0%0%99.9%0.1%0%0%0%0
100%99.9%0%0.1%0%0%0%1
Compiler

Compiled 8 to 6 computations (25% saved)

sample6.4s (97.5%)

Results
1.0s8256×0valid-rival
721.0ms8206×0valid-sollya
250.0ms50×0exit-sollya
Bogosity

preprocess119.0ms (1.8%)

Algorithm
egg-herbie
Rules
178×fma-neg
69×fma-define
32×sub-neg
32×div-sub
24×associate-/l*
Iterations

Useful iterations: 1 (0.0ms)

IterNodesCost
021141
142133
276133
3155133
4403133
5700133
6784133
7829133
8835133
Stop Event
saturated
Calls
Call 1
Inputs
(/.f64 (+.f64 x y) #s(literal 10 binary64))
(/.f64 (+.f64 x y) #s(literal 10 binary64))
(/.f64 (+.f64 (neg.f64 x) y) #s(literal 10 binary64))
(/.f64 (+.f64 x (neg.f64 y)) #s(literal 10 binary64))
(neg.f64 (/.f64 (+.f64 (neg.f64 x) y) #s(literal 10 binary64)))
(neg.f64 (/.f64 (+.f64 x (neg.f64 y)) #s(literal 10 binary64)))
(/.f64 (+.f64 y x) #s(literal 10 binary64))
Outputs
(/.f64 (+.f64 x y) #s(literal 10 binary64))
(*.f64 (+.f64 x y) #s(literal 1/10 binary64))
(/.f64 (+.f64 x y) #s(literal 10 binary64))
(*.f64 (+.f64 x y) #s(literal 1/10 binary64))
(/.f64 (+.f64 (neg.f64 x) y) #s(literal 10 binary64))
(/.f64 (+.f64 y (neg.f64 x)) #s(literal 10 binary64))
(/.f64 (-.f64 y x) #s(literal 10 binary64))
(*.f64 (-.f64 y x) #s(literal 1/10 binary64))
(/.f64 (+.f64 x (neg.f64 y)) #s(literal 10 binary64))
(/.f64 (-.f64 x y) #s(literal 10 binary64))
(/.f64 (-.f64 y x) #s(literal -10 binary64))
(*.f64 (-.f64 x y) #s(literal 1/10 binary64))
(*.f64 (-.f64 y x) #s(literal -1/10 binary64))
(neg.f64 (/.f64 (+.f64 (neg.f64 x) y) #s(literal 10 binary64)))
(/.f64 (-.f64 x y) #s(literal 10 binary64))
(/.f64 (-.f64 y x) #s(literal -10 binary64))
(*.f64 (-.f64 x y) #s(literal 1/10 binary64))
(*.f64 (-.f64 y x) #s(literal -1/10 binary64))
(neg.f64 (/.f64 (+.f64 x (neg.f64 y)) #s(literal 10 binary64)))
(/.f64 (+.f64 y (neg.f64 x)) #s(literal 10 binary64))
(/.f64 (-.f64 y x) #s(literal 10 binary64))
(*.f64 (-.f64 y x) #s(literal 1/10 binary64))
(/.f64 (+.f64 y x) #s(literal 10 binary64))
(/.f64 (+.f64 x y) #s(literal 10 binary64))
(*.f64 (+.f64 x y) #s(literal 1/10 binary64))
Symmetry

(sort x y)

Compiler

Compiled 7 to 5 computations (28.6% saved)

eval0.0ms (0%)

Compiler

Compiled 2 to 2 computations (0% saved)

prune1.0ms (0%)

Alt Table
Click to see full alt table
StatusAccuracyProgram
100.0%
(/.f64 (+.f64 x y) #s(literal 10 binary64))
Compiler

Compiled 14 to 10 computations (28.6% saved)

simplify2.0ms (0%)

Algorithm
egg-herbie
Rules
+-commutative
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
01019
11119
Stop Event
saturated
Calls
Call 1
Inputs
(/.f64 (+.f64 x y) #s(literal 10 binary64))
Outputs
(/.f64 (+.f64 x y) #s(literal 10 binary64))

soundness1.0ms (0%)

Stop Event
fuel
Compiler

Compiled 7 to 5 computations (28.6% saved)

preprocess39.0ms (0.6%)

Remove

(sort x y)

Compiler

Compiled 56 to 40 computations (28.6% saved)

end0.0ms (0%)

Profiling

Loading profile data...