qlog (example 3.10)

Time bar (total: 9.9s)

analyze239.0ms (2.4%)

Memory
0.2MiB live, 78.3MiB allocated
Algorithm
1×search
Search
ProbabilityValidUnknownPreconditionInfiniteDomainCan'tIter
0%0%50%50%0%0%0%0
0%0%50%50%0%0%0%1
0%0%50%50%0%0%0%2
0%0%50%50%0%0%0%3
0%0%50%50%0%0%0%4
0%0%50%50%0%0%0%5
0%0%50%50%0%0%0%6
3.1%1.6%48.4%50%0%0%0%7
6.3%3.1%46.8%50%0%0%0%8
7%3.5%46.4%50%0%0%0%9
7.4%3.7%46.2%50%0%0%0%10
7.8%3.9%46%50%0%0%0%11
8%4%46%50%0%0%0%12
Compiler

Compiled 22 to 17 computations (22.7% saved)

sample9.6s (96.9%)

Memory
12.0MiB live, 1 448.5MiB allocated
Samples
2.9s3 870×2valid-baseline
1.6s3 870×2valid-rival
1.3s4 103×1valid-baseline
1.3s3 870×2valid-sollya
810.0ms4 103×1valid-rival
628.0ms4 103×1valid-sollya
24.0ms283×0valid-baseline
20.0ms283×0valid-sollya
18.0ms283×0valid-rival
Bogosity

preprocess47.0ms (0.5%)

Memory
-0.8MiB live, 19.5MiB allocated
Algorithm
1×egg-herbie
Rules
31×fmm-def
29×fma-define
24×sub-neg
11×+-commutative
10×distribute-lft-neg-in
Iterations

Useful iterations: 1 (0.0ms)

IterNodesCost
019124
140104
261104
3102104
4151104
5203104
6235104
7254104
8274104
9276104
Stop Event
1×saturated
Calls
Call 1
Inputs
(/.f64 (log.f64 (-.f64 #s(literal 1 binary64) x)) (log.f64 (+.f64 #s(literal 1 binary64) x)))
(/.f64 (log.f64 (-.f64 #s(literal 1 binary64) x)) (log.f64 (+.f64 #s(literal 1 binary64) x)))
(/.f64 (log.f64 (-.f64 #s(literal 1 binary64) (neg.f64 x))) (log.f64 (+.f64 #s(literal 1 binary64) (neg.f64 x))))
(neg.f64 (/.f64 (log.f64 (-.f64 #s(literal 1 binary64) (neg.f64 x))) (log.f64 (+.f64 #s(literal 1 binary64) (neg.f64 x)))))
Outputs
(/.f64 (log.f64 (-.f64 #s(literal 1 binary64) x)) (log.f64 (+.f64 #s(literal 1 binary64) x)))
(/.f64 (log1p.f64 (neg.f64 x)) (log1p.f64 x))
(/.f64 (log.f64 (-.f64 #s(literal 1 binary64) x)) (log.f64 (+.f64 #s(literal 1 binary64) x)))
(/.f64 (log1p.f64 (neg.f64 x)) (log1p.f64 x))
(/.f64 (log.f64 (-.f64 #s(literal 1 binary64) (neg.f64 x))) (log.f64 (+.f64 #s(literal 1 binary64) (neg.f64 x))))
(/.f64 (log.f64 (-.f64 #s(literal 1 binary64) (neg.f64 x))) (log1p.f64 (neg.f64 x)))
(/.f64 (log1p.f64 x) (log1p.f64 (neg.f64 x)))
(neg.f64 (/.f64 (log.f64 (-.f64 #s(literal 1 binary64) (neg.f64 x))) (log.f64 (+.f64 #s(literal 1 binary64) (neg.f64 x)))))
(/.f64 (log.f64 (-.f64 #s(literal 1 binary64) (neg.f64 x))) (neg.f64 (log1p.f64 (neg.f64 x))))
(/.f64 (neg.f64 (log1p.f64 x)) (log1p.f64 (neg.f64 x)))
(/.f64 (log1p.f64 x) (neg.f64 (log1p.f64 (neg.f64 x))))
Compiler

Compiled 10 to 7 computations (30% saved)

eval0.0ms (0%)

Memory
0.3MiB live, 0.3MiB allocated
Compiler

Compiled 1 to 1 computations (0% saved)

prune1.0ms (0%)

Memory
0.8MiB live, 0.8MiB allocated
Alt Table
Click to see full alt table
StatusAccuracyProgram
3.6%
(/.f64 (log.f64 (-.f64 #s(literal 1 binary64) x)) (log.f64 (+.f64 #s(literal 1 binary64) x)))
Compiler

Compiled 20 to 14 computations (30% saved)

simplify2.0ms (0%)

Memory
0.4MiB live, 0.4MiB allocated
Algorithm
1×egg-herbie
Rules
3×1-exp
3×+-commutative
2×sub-neg
1×*-commutative
1×neg-sub0
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
01233
12033
22433
32633
42733
Stop Event
1×saturated
Calls
Call 1
Inputs
(/.f64 (log.f64 (-.f64 #s(literal 1 binary64) x)) (log.f64 (+.f64 #s(literal 1 binary64) x)))
Outputs
(/.f64 (log.f64 (-.f64 #s(literal 1 binary64) x)) (log.f64 (+.f64 #s(literal 1 binary64) x)))

soundness0.0ms (0%)

Memory
0.3MiB live, 0.3MiB allocated
Stop Event
1×fuel
Compiler

Compiled 10 to 7 computations (30% saved)

preprocess20.0ms (0.2%)

Memory
-1.7MiB live, 29.4MiB allocated
Compiler

Compiled 54 to 38 computations (29.6% saved)

end0.0ms (0%)

Memory
0.0MiB live, 0.0MiB allocated

Profiling

Loading profile data...