Metrics for Jmat.Real.lambertw, estimator

start0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated; 0ms collecting garbage

analyze1.0ms (0.1%)

Memory

1.3MiB live, 1.3MiB allocated; 0ms collecting garbage

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	100%	0%	0%	0%	0%	0
0%	0%	100%	0%	0%	0%	0%	1
0%	0%	50%	0%	0%	50%	0%	2
50%	25%	25%	0%	0%	50%	0%	3
66.7%	25%	12.5%	0%	0%	62.5%	0%	4
80%	25%	6.2%	0%	0%	68.7%	0%	5
88.9%	25%	3.1%	0%	0%	71.8%	0%	6
94.1%	25%	1.6%	0%	0%	73.4%	0%	7
97%	25%	0.8%	0%	0%	74.2%	0%	8
98.5%	25%	0.4%	0%	0%	74.6%	0%	9
99.2%	25%	0.2%	0%	0%	74.8%	0%	10
99.6%	25%	0.1%	0%	0%	74.9%	0%	11
99.8%	25%	0%	0%	0%	74.9%	0%	12

Compiler

Compiled 8 to 6 computations (25% saved)

sample933.0ms (64.6%)

Memory

0.2MiB live, 1 146.5MiB allocated; 357ms collecting garbage

Samples

706.0ms	8 256×	0	valid
0.0ms	8×	0	invalid

Precisions

Click to see histograms. Total time spent on operations: 316.0ms

ival-log: 296.0ms (93.6% of total)

ival-sub!: 19.0ms (6% of total)

adjust: 1.0ms (0.3% of total)

Bogosity

preprocess55.0ms (3.8%)

Memory

-29.9MiB live, 63.3MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	9	18
1	29	15
2	124	15
3	377	15
4	1198	15
5	6533	15

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	99.6%	(-.f64 (log.f64 x) (log.f64 (log.f64 x)))

Symmetry

(abs x)

Compiler

Compiled 10 to 8 computations (20% saved)

series115.0ms (8%)

Memory

18.5MiB live, 205.5MiB allocated; 16ms collecting garbage

Counts

4 → 10

Calls

Call 1

Inputs
(-.f64 (log.f64 x) (log.f64 (log.f64 x)))
(log.f64 x)
x
(log.f64 (log.f64 x))

Outputs
#s(approx (- (log x) (log (log x))) #s(hole binary64 (- (log x) (log (log x)))))
#s(approx (log x) #s(hole binary64 (log x)))
#s(approx x #s(hole binary64 x))
#s(approx (log (log x)) #s(hole binary64 (log (log x))))
#s(approx (- (log x) (log (log x))) #s(hole binary64 (- (* -1 (log (/ 1 x))) (log (* -1 (log (/ 1 x)))))))
#s(approx (log x) #s(hole binary64 (* -1 (log (/ 1 x)))))
#s(approx (log (log x)) #s(hole binary64 (log (* -1 (log (/ 1 x))))))
#s(approx (- (log x) (log (log x))) #s(hole binary64 (- (+ (log -1) (* -1 (log (/ -1 x)))) (log (+ (log -1) (* -1 (log (/ -1 x))))))))
#s(approx (log x) #s(hole binary64 (+ (log -1) (* -1 (log (/ -1 x))))))
#s(approx (log (log x)) #s(hole binary64 (log (+ (log -1) (* -1 (log (/ -1 x)))))))

Calls

3 calls:

Time	Variable		Point	Expression
47.0ms	x	@	0	((- (log x) (log (log x))) (log x) x (log (log x)))
45.0ms	x	@	-inf	((- (log x) (log (log x))) (log x) x (log (log x)))
22.0ms	x	@	inf	((- (log x) (log (log x))) (log x) x (log (log x)))

rewrite38.0ms (2.6%)

Memory

13.7MiB live, 55.5MiB allocated; 13ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	31	134
0	36	113
0	161	113
1	371	113

Stop Event

1×	iter-limit
1×	iter-limit
1×	iter-limit
1×	unsound
1×	iter-limit

Counts

14 → 21

Calls

Call 1

Inputs
(-.f64 (log.f64 x) (log.f64 (log.f64 x)))
(log.f64 x)
x
(log.f64 (log.f64 x))
#s(approx (- (log x) (log (log x))) #s(hole binary64 (- (log x) (log (log x)))))
#s(approx (log x) #s(hole binary64 (log x)))
#s(approx x #s(hole binary64 x))
#s(approx (log (log x)) #s(hole binary64 (log (log x))))
#s(approx (- (log x) (log (log x))) #s(hole binary64 (- (* -1 (log (/ 1 x))) (log (* -1 (log (/ 1 x)))))))
#s(approx (log x) #s(hole binary64 (* -1 (log (/ 1 x)))))
#s(approx (log (log x)) #s(hole binary64 (log (* -1 (log (/ 1 x))))))
#s(approx (- (log x) (log (log x))) #s(hole binary64 (- (+ (log -1) (* -1 (log (/ -1 x)))) (log (+ (log -1) (* -1 (log (/ -1 x))))))))
#s(approx (log x) #s(hole binary64 (+ (log -1) (* -1 (log (/ -1 x))))))
#s(approx (log (log x)) #s(hole binary64 (log (+ (log -1) (* -1 (log (/ -1 x)))))))

Outputs
(/.f64 (-.f64 (.f64 (log.f64 x) (log.f64 x)) (.f64 (log.f64 (log.f64 x)) (log.f64 (log.f64 x)))) (+.f64 (log.f64 x) (log.f64 (log.f64 x))))
(/.f64 (-.f64 (pow.f64 (log.f64 x) #s(literal 3 binary64)) (pow.f64 (log.f64 (log.f64 x)) #s(literal 3 binary64))) (fma.f64 (log.f64 x) (log.f64 x) (fma.f64 (log.f64 (log.f64 x)) (log.f64 (log.f64 x)) (*.f64 (log.f64 x) (log.f64 (log.f64 x))))))
(neg.f64 (-.f64 (log.f64 (log.f64 x)) (log.f64 x)))
(-.f64 (log.f64 x) (log.f64 (log.f64 x)))
(+.f64 (log.f64 x) (neg.f64 (log.f64 (log.f64 x))))
(log.f64 (/.f64 x (log.f64 x)))
(log.f64 (fabs.f64 x))
(log.f64 x)
x
(log.f64 (fabs.f64 (log.f64 x)))
(log.f64 (log.f64 x))
#s(approx (- (log x) (log (log x))) (log.f64 (/.f64 x (log.f64 x))))
#s(approx (log x) (log.f64 x))
#s(approx x x)
#s(approx (log (log x)) (log.f64 (log.f64 x)))
#s(approx (- (log x) (log (log x))) (-.f64 (neg.f64 (neg.f64 (log.f64 x))) (log.f64 (neg.f64 (neg.f64 (log.f64 x))))))
#s(approx (log x) (neg.f64 (neg.f64 (log.f64 x))))
#s(approx (log (log x)) (log.f64 (neg.f64 (neg.f64 (log.f64 x)))))
#s(approx (- (log x) (log (log x))) (-.f64 (+.f64 #s(literal 0 binary64) (neg.f64 (log.f64 (/.f64 #s(literal -1 binary64) x)))) (log.f64 (+.f64 #s(literal 0 binary64) (neg.f64 (log.f64 (/.f64 #s(literal -1 binary64) x)))))))
#s(approx (log x) (+.f64 #s(literal 0 binary64) (neg.f64 (log.f64 (/.f64 #s(literal -1 binary64) x)))))
#s(approx (log (log x)) (log.f64 (+.f64 #s(literal 0 binary64) (neg.f64 (log.f64 (/.f64 #s(literal -1 binary64) x))))))

eval2.0ms (0.1%)

Memory: 4.7MiB live, 4.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 160 to 66 computations (58.8% saved)

prune1.0ms (0.1%)

Memory

2.3MiB live, 2.3MiB allocated; 0ms collecting garbage

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	16	1	17
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	17	1	18

Accuracy

100.0%

Counts

18 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(log.f64 (/.f64 x (log.f64 x)))

Compiler

Compiled 4 to 4 computations (0% saved)

series250.0ms (17.4%)

Memory

58.0MiB live, 203.0MiB allocated; 132ms collecting garbage

Counts

4 → 10

Calls

Call 1

Inputs
(log.f64 (/.f64 x (log.f64 x)))
(/.f64 x (log.f64 x))
x
(log.f64 x)

Outputs
#s(approx (log (/ x (log x))) #s(hole binary64 (+ (log x) (log (/ 1 (log x))))))
#s(approx (/ x (log x)) #s(hole binary64 (/ x (log x))))
#s(approx x #s(hole binary64 x))
#s(approx (log x) #s(hole binary64 (log x)))
#s(approx (log (/ x (log x))) #s(hole binary64 (+ (log (/ -1 (log (/ 1 x)))) (* -1 (log (/ 1 x))))))
#s(approx (/ x (log x)) #s(hole binary64 (* -1 (/ x (log (/ 1 x))))))
#s(approx (log x) #s(hole binary64 (* -1 (log (/ 1 x)))))
#s(approx (log (/ x (log x))) #s(hole binary64 (+ (log (/ -1 (+ (log -1) (* -1 (log (/ -1 x)))))) (* -1 (log (/ -1 x))))))
#s(approx (/ x (log x)) #s(hole binary64 (/ x (+ (log -1) (* -1 (log (/ -1 x)))))))
#s(approx (log x) #s(hole binary64 (+ (log -1) (* -1 (log (/ -1 x))))))

Calls

3 calls:

Time	Variable		Point	Expression
137.0ms	x	@	inf	((log (/ x (log x))) (/ x (log x)) x (log x))
71.0ms	x	@	-inf	((log (/ x (log x))) (/ x (log x)) x (log x))
43.0ms	x	@	0	((log (/ x (log x))) (/ x (log x)) x (log x))

rewrite32.0ms (2.3%)

Memory

-29.0MiB live, 17.3MiB allocated; 9ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	39	138
0	43	119
0	211	119
1	478	119

Stop Event

1×	iter-limit
1×	iter-limit
1×	iter-limit
1×	unsound
1×	iter-limit

Counts

14 → 24

Calls

Call 1

Inputs
(log.f64 (/.f64 x (log.f64 x)))
(/.f64 x (log.f64 x))
x
(log.f64 x)
#s(approx (log (/ x (log x))) #s(hole binary64 (+ (log x) (log (/ 1 (log x))))))
#s(approx (/ x (log x)) #s(hole binary64 (/ x (log x))))
#s(approx x #s(hole binary64 x))
#s(approx (log x) #s(hole binary64 (log x)))
#s(approx (log (/ x (log x))) #s(hole binary64 (+ (log (/ -1 (log (/ 1 x)))) (* -1 (log (/ 1 x))))))
#s(approx (/ x (log x)) #s(hole binary64 (* -1 (/ x (log (/ 1 x))))))
#s(approx (log x) #s(hole binary64 (* -1 (log (/ 1 x)))))
#s(approx (log (/ x (log x))) #s(hole binary64 (+ (log (/ -1 (+ (log -1) (* -1 (log (/ -1 x)))))) (* -1 (log (/ -1 x))))))
#s(approx (/ x (log x)) #s(hole binary64 (/ x (+ (log -1) (* -1 (log (/ -1 x)))))))
#s(approx (log x) #s(hole binary64 (+ (log -1) (* -1 (log (/ -1 x))))))

Outputs
(/.f64 (-.f64 (.f64 (log.f64 x) (log.f64 x)) (.f64 (neg.f64 (log.f64 (log.f64 x))) (neg.f64 (log.f64 (log.f64 x))))) (-.f64 (log.f64 x) (neg.f64 (log.f64 (log.f64 x)))))
(/.f64 (+.f64 (pow.f64 (log.f64 x) #s(literal 3 binary64)) (pow.f64 (neg.f64 (log.f64 (log.f64 x))) #s(literal 3 binary64))) (fma.f64 (log.f64 x) (log.f64 x) (-.f64 (.f64 (neg.f64 (log.f64 (log.f64 x))) (neg.f64 (log.f64 (log.f64 x)))) (.f64 (log.f64 x) (neg.f64 (log.f64 (log.f64 x)))))))
(-.f64 (log.f64 x) (neg.f64 (neg.f64 (log.f64 (log.f64 x)))))
(+.f64 (neg.f64 (log.f64 (log.f64 x))) (log.f64 x))
(+.f64 (log.f64 x) (neg.f64 (log.f64 (log.f64 x))))
(log.f64 (fabs.f64 (/.f64 x (log.f64 x))))
(log.f64 (/.f64 x (log.f64 x)))
(*.f64 x (/.f64 #s(literal 1 binary64) (log.f64 x)))
(/.f64 (neg.f64 x) (neg.f64 (log.f64 x)))
(/.f64 #s(literal 1 binary64) (/.f64 (log.f64 x) x))
(/.f64 x (log.f64 x))
x
(log.f64 (fabs.f64 x))
(log.f64 x)
#s(approx (log (/ x (log x))) (log.f64 (/.f64 x (log.f64 x))))
#s(approx (/ x (log x)) (/.f64 x (log.f64 x)))
#s(approx x x)
#s(approx (log x) (log.f64 x))
#s(approx (log (/ x (log x))) (+.f64 (neg.f64 (neg.f64 (log.f64 x))) (neg.f64 (log.f64 (log.f64 x)))))
#s(approx (/ x (log x)) (neg.f64 (/.f64 x (neg.f64 (log.f64 x)))))
#s(approx (log x) (neg.f64 (neg.f64 (log.f64 x))))
#s(approx (log (/ x (log x))) (+.f64 (log.f64 (/.f64 #s(literal -1 binary64) (+.f64 #s(literal 0 binary64) (neg.f64 (log.f64 (/.f64 #s(literal -1 binary64) x)))))) (neg.f64 (log.f64 (/.f64 #s(literal -1 binary64) x)))))
#s(approx (/ x (log x)) (/.f64 x (+.f64 #s(literal 0 binary64) (neg.f64 (log.f64 (/.f64 #s(literal -1 binary64) x))))))
#s(approx (log x) (+.f64 #s(literal 0 binary64) (neg.f64 (log.f64 (/.f64 #s(literal -1 binary64) x)))))

eval2.0ms (0.1%)

Memory: 2.9MiB live, 2.9MiB allocated; 0ms collecting garbage
Compiler: Compiled 163 to 79 computations (51.5% saved)

prune1.0ms (0.1%)

Memory

1.9MiB live, 1.9MiB allocated; 0ms collecting garbage

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	20	0	20
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	20	1	21

Accuracy

100.0%

Counts

21 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(log.f64 (/.f64 x (log.f64 x)))

Compiler

Compiled 12 to 10 computations (16.7% saved)

regimes4.0ms (0.3%)

Memory

7.4MiB live, 7.4MiB allocated; 0ms collecting garbage

Accuracy

Total -0.2b remaining (-∞%)

Threshold costs -0.2b (-∞%)

Counts

2 → 1

Calls

Call 1

Inputs
(log.f64 (/.f64 x (log.f64 x)))
(-.f64 (log.f64 x) (log.f64 (log.f64 x)))

Outputs
(log.f64 (/.f64 x (log.f64 x)))

Calls

3 calls:

1.0ms	(-.f64 (log.f64 x) (log.f64 (log.f64 x)))
1.0ms	x
1.0ms	(log.f64 x)

Results

Accuracy	Segments	Branch
100.0%	1	`(log.f64 x)`
100.0%	1	`(-.f64 (log.f64 x) (log.f64 (log.f64 x)))`
100.0%	1	`x`

Compiler

Compiled 8 to 7 computations (12.5% saved)

derivations1.0ms (0.1%)

Memory

1.1MiB live, 1.1MiB allocated; 0ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 4 to 4 computations (0% saved)

preprocess8.0ms (0.6%)

Memory: 12.8MiB live, 12.8MiB allocated; 0ms collecting garbage
Remove: (abs x)
Compiler: Compiled 17 to 16 computations (5.9% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated; 0ms collecting garbage

start0.0ms (0%)

analyze1.0ms (0.1%)

sample933.0ms (64.6%)

preprocess55.0ms (3.8%)

series115.0ms (8%)

rewrite38.0ms (2.6%)

eval2.0ms (0.1%)

prune1.0ms (0.1%)

series250.0ms (17.4%)

rewrite32.0ms (2.3%)

eval2.0ms (0.1%)

prune1.0ms (0.1%)

regimes4.0ms (0.3%)

derivations1.0ms (0.1%)

preprocess8.0ms (0.6%)

end0.0ms (0%)

Profiling