Metrics for Statistics.Distribution.Binomial:directEntropy from math-functions-0.1.5.2

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

0.5MiB live, 0.5MiB 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
100%	50%	0%	0%	0%	50%	0%	2

Compiler

Compiled 6 to 5 computations (16.7% saved)

sample914.0ms (33.9%)

Memory

34.5MiB live, 964.1MiB allocated; 305ms collecting garbage

Samples

640.0ms

8 256×

valid

Precisions

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

ival-log: 207.0ms (68% of total)

ival-mult: 86.0ms (28.2% of total)

ival-true: 6.0ms (2% of total)

ival-assert: 3.0ms (1% of total)

adjust: 2.0ms (0.7% of total)

Bogosity

explain71.0ms (2.6%)

Memory

-11.0MiB live, 78.0MiB allocated; 25ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`(log.f64 x)`
-	-	`(*.f64 x (log.f64 x))`
-	-	`x`

Confusion

	Predicted +	Predicted -
+	0	0
-	0	256

Precision

0/0

Recall

0/0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	256

Precision?

0/0

Recall?

0/0

Freqs

test

number	freq
0	256

Total Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	1

Precision?

0/0

Recall?

0/0

Samples

31.0ms

512×

valid

Compiler

Compiled 22 to 13 computations (40.9% saved)

Precisions

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

ival-log: 6.0ms (59.8% of total)

ival-mult: 4.0ms (39.9% of total)

ival-true: 0.0ms (0% of total)

adjust: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

preprocess13.0ms (0.5%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	13
1	12	11
2	17	11
3	22	11
4	27	11
0	3	4
0	5	4
1	6	4
0	6	4

Stop Event

1×	iter limit
1×	saturated
1×	iter limit
1×	saturated

Calls

Call 1

Inputs
(*.f64 x (log.f64 x))

Outputs
(*.f64 x (log.f64 x))
(*.f64 (log.f64 x) x)

Compiler

Compiled 4 to 3 computations (25% saved)

eval0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 0 to 1 computations (-∞% saved)

prune0.0ms (0%)

Memory

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

Alt Table

Click to see full alt table

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

Compiler

Compiled 4 to 3 computations (25% saved)

series114.0ms (4.2%)

Memory

-21.3MiB live, 122.6MiB allocated; 53ms collecting garbage

Counts

3 → 7

Calls

Call 1

Inputs
(*.f64 x (log.f64 x))
x
(log.f64 x)

Outputs
(* x (log x))
x
(log x)
(* -1 (* x (log (/ 1 x))))
(* -1 (log (/ 1 x)))
(* x (+ (log -1) (* -1 (log (/ -1 x)))))
(+ (log -1) (* -1 (log (/ -1 x))))

Calls

3 calls:

Time	Variable		Point	Expression
86.0ms	x	@	0	((* x (log x)) x (log x))
21.0ms	x	@	-inf	((* x (log x)) x (log x))
7.0ms	x	@	inf	((* x (log x)) x (log x))

simplify165.0ms (6.1%)

Memory

5.0MiB live, 199.0MiB allocated; 23ms collecting garbage

Iterations

Useful iterations: 5 (0.0ms)

Iter	Nodes	Cost
0	16	31
1	40	29
2	82	29
3	159	29
4	498	29
5	2512	27
0	5645	27

Stop Event

1×	iter limit
1×	iter limit
1×	node limit

Counts

7 → 6

Calls

Call 1

Inputs
(* x (log x))
x
(log x)
(* -1 (* x (log (/ 1 x))))
(* -1 (log (/ 1 x)))
(* x (+ (log -1) (* -1 (log (/ -1 x)))))
(+ (log -1) (* -1 (log (/ -1 x))))

Outputs
(* x (log x))
(*.f64 x (log.f64 x))
x
(log x)
(log.f64 x)
(* -1 (* x (log (/ 1 x))))
(*.f64 x (log.f64 x))
(* -1 (log (/ 1 x)))
(log.f64 x)
(* x (+ (log -1) (* -1 (log (/ -1 x)))))
(*.f64 x (-.f64 (log.f64 (neg.f64 x)) (log.f64 #s(literal -1 binary64))))
(+ (log -1) (* -1 (log (/ -1 x))))
(-.f64 (log.f64 (neg.f64 x)) (log.f64 #s(literal -1 binary64)))

rewrite49.0ms (1.8%)

Memory

14.2MiB live, 108.0MiB allocated; 13ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	3	7
0	5	7
1	8	7
2	13	7
3	44	7
0	243	7

Stop Event

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

Counts

3 → 15

Calls

Call 1

Inputs
(*.f64 x (log.f64 x))
x
(log.f64 x)

Outputs
(.f64 (.f64 (/.f64 x #s(literal 2 binary64)) #s(literal 2 binary64)) (log.f64 x))
(.f64 (/.f64 x #s(literal 2 binary64)) (log.f64 (.f64 x x)))
(*.f64 #s(literal 2 binary64) (log.f64 (sqrt.f64 (pow.f64 x x))))
(*.f64 (log.f64 x) (log.f64 (exp.f64 x)))
(*.f64 (log.f64 x) x)
(*.f64 x (log.f64 x))
(/.f64 (-.f64 (.f64 (log.f64 (sqrt.f64 (pow.f64 x x))) (log.f64 (sqrt.f64 (pow.f64 x x)))) (.f64 (log.f64 (sqrt.f64 (pow.f64 x x))) (log.f64 (sqrt.f64 (pow.f64 x x))))) (-.f64 (log.f64 (sqrt.f64 (pow.f64 x x))) (log.f64 (sqrt.f64 (pow.f64 x x)))))
(/.f64 (+.f64 (pow.f64 (log.f64 (sqrt.f64 (pow.f64 x x))) #s(literal 3 binary64)) (pow.f64 (log.f64 (sqrt.f64 (pow.f64 x x))) #s(literal 3 binary64))) (fma.f64 (log.f64 (sqrt.f64 (pow.f64 x x))) (log.f64 (sqrt.f64 (pow.f64 x x))) (-.f64 (.f64 (log.f64 (sqrt.f64 (pow.f64 x x))) (log.f64 (sqrt.f64 (pow.f64 x x)))) (.f64 (log.f64 (sqrt.f64 (pow.f64 x x))) (log.f64 (sqrt.f64 (pow.f64 x x)))))))
(fma.f64 (/.f64 x #s(literal 2 binary64)) (log.f64 x) (log.f64 (sqrt.f64 (pow.f64 x x))))
(fma.f64 (log.f64 x) (/.f64 x #s(literal 2 binary64)) (log.f64 (sqrt.f64 (pow.f64 x x))))
(+.f64 (log.f64 (neg.f64 (sqrt.f64 (pow.f64 x x)))) (log.f64 (neg.f64 (sqrt.f64 (pow.f64 x x)))))
(+.f64 (log.f64 (sqrt.f64 (pow.f64 x x))) (log.f64 (sqrt.f64 (pow.f64 x x))))
(log.f64 (pow.f64 x x))
x
(log.f64 x)

eval2.0ms (0.1%)

Memory: 7.1MiB live, 7.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 224 to 48 computations (78.6% saved)

prune1.0ms (0%)

Memory

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

Pruning

2 alts after pruning (1 fresh and 1 done)

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

Accuracy

99.6%

Counts

21 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	99.6%	(*.f64 x (log.f64 x))
▶	7.3%	(log.f64 (pow.f64 x x))

Compiler

Compiled 8 to 6 computations (25% saved)

series77.0ms (2.8%)

Memory

-25.0MiB live, 112.0MiB allocated; 12ms collecting garbage

Counts

3 → 10

Calls

Call 1

Inputs
(log.f64 (pow.f64 x x))
(pow.f64 x x)
x

Outputs
(* x (log x))
(* x (+ (log x) (* 1/2 (* x (+ (* -1 (pow (log x) 2)) (pow (log x) 2))))))
(* x (+ (log x) (* x (+ (* 1/6 (* x (+ (* -3 (pow (log x) 3)) (+ (* 2 (pow (log x) 3)) (pow (log x) 3))))) (* 1/2 (+ (* -1 (pow (log x) 2)) (pow (log x) 2)))))))
(* x (+ (log x) (* x (+ (* 1/2 (+ (* -1 (pow (log x) 2)) (pow (log x) 2))) (* x (+ (* 1/24 (* x (+ (* -6 (pow (log x) 4)) (+ (* -4 (pow (log x) 4)) (+ (* -3 (pow (log x) 4)) (+ (* 12 (pow (log x) 4)) (pow (log x) 4))))))) (* 1/6 (+ (* -3 (pow (log x) 3)) (+ (* 2 (pow (log x) 3)) (pow (log x) 3))))))))))
1
(+ 1 (* x (log x)))
(+ 1 (* x (+ (log x) (* 1/2 (* x (pow (log x) 2))))))
(+ 1 (* x (+ (log x) (* x (+ (* 1/6 (* x (pow (log x) 3))) (* 1/2 (pow (log x) 2)))))))
x
(pow x x)

Calls

3 calls:

Time	Variable		Point	Expression
60.0ms	x	@	-inf	((log (pow x x)) (pow x x) x)
16.0ms	x	@	inf	((log (pow x x)) (pow x x) x)
1.0ms	x	@	0	((log (pow x x)) (pow x x) x)

simplify234.0ms (8.7%)

Memory

-9.8MiB live, 251.9MiB allocated; 155ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	67	149
1	251	107
2	1159	83
3	6884	83
0	8011	74

Stop Event

1×	iter limit
1×	node limit

Counts

10 → 9

Calls

Call 1

Inputs
(* x (log x))
(* x (+ (log x) (* 1/2 (* x (+ (* -1 (pow (log x) 2)) (pow (log x) 2))))))
(* x (+ (log x) (* x (+ (* 1/6 (* x (+ (* -3 (pow (log x) 3)) (+ (* 2 (pow (log x) 3)) (pow (log x) 3))))) (* 1/2 (+ (* -1 (pow (log x) 2)) (pow (log x) 2)))))))
(* x (+ (log x) (* x (+ (* 1/2 (+ (* -1 (pow (log x) 2)) (pow (log x) 2))) (* x (+ (* 1/24 (* x (+ (* -6 (pow (log x) 4)) (+ (* -4 (pow (log x) 4)) (+ (* -3 (pow (log x) 4)) (+ (* 12 (pow (log x) 4)) (pow (log x) 4))))))) (* 1/6 (+ (* -3 (pow (log x) 3)) (+ (* 2 (pow (log x) 3)) (pow (log x) 3))))))))))
1
(+ 1 (* x (log x)))
(+ 1 (* x (+ (log x) (* 1/2 (* x (pow (log x) 2))))))
(+ 1 (* x (+ (log x) (* x (+ (* 1/6 (* x (pow (log x) 3))) (* 1/2 (pow (log x) 2)))))))
x
(pow x x)

Outputs
(* x (log x))
(*.f64 (log.f64 x) x)
(* x (+ (log x) (* 1/2 (* x (+ (* -1 (pow (log x) 2)) (pow (log x) 2))))))
(fma.f64 (log.f64 x) x #s(literal 0 binary64))
(* x (+ (log x) (* x (+ (* 1/6 (* x (+ (* -3 (pow (log x) 3)) (+ (* 2 (pow (log x) 3)) (pow (log x) 3))))) (* 1/2 (+ (* -1 (pow (log x) 2)) (pow (log x) 2)))))))
(fma.f64 (log.f64 x) x #s(literal 0 binary64))
(* x (+ (log x) (* x (+ (* 1/2 (+ (* -1 (pow (log x) 2)) (pow (log x) 2))) (* x (+ (* 1/24 (* x (+ (* -6 (pow (log x) 4)) (+ (* -4 (pow (log x) 4)) (+ (* -3 (pow (log x) 4)) (+ (* 12 (pow (log x) 4)) (pow (log x) 4))))))) (* 1/6 (+ (* -3 (pow (log x) 3)) (+ (* 2 (pow (log x) 3)) (pow (log x) 3))))))))))
(.f64 (fma.f64 (.f64 (.f64 (.f64 (*.f64 (pow.f64 (log.f64 x) #s(literal 4 binary64)) #s(literal 0 binary64)) x) #s(literal 1/24 binary64)) x) x (log.f64 x)) x)
1
#s(literal 1 binary64)
(+ 1 (* x (log x)))
(fma.f64 (log.f64 x) x #s(literal 1 binary64))
(+ 1 (* x (+ (log x) (* 1/2 (* x (pow (log x) 2))))))
(fma.f64 (fma.f64 (*.f64 (pow.f64 (log.f64 x) #s(literal 2 binary64)) x) #s(literal 1/2 binary64) (log.f64 x)) x #s(literal 1 binary64))
(+ 1 (* x (+ (log x) (* x (+ (* 1/6 (* x (pow (log x) 3))) (* 1/2 (pow (log x) 2)))))))
(fma.f64 (fma.f64 (.f64 (pow.f64 (log.f64 x) #s(literal 2 binary64)) (fma.f64 (.f64 #s(literal 1/6 binary64) x) (log.f64 x) #s(literal 1/2 binary64))) x (log.f64 x)) x #s(literal 1 binary64))
x
(pow x x)
(pow.f64 x x)

rewrite58.0ms (2.1%)

Memory

-2.1MiB live, 92.4MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	3	8
0	5	8
1	13	8
2	42	8
0	233	8

Stop Event

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

Counts

3 → 38

Calls

Call 1

Inputs
(log.f64 (pow.f64 x x))
(pow.f64 x x)
x

Outputs
(.f64 (.f64 (/.f64 x #s(literal 2 binary64)) #s(literal 2 binary64)) (log.f64 x))
(.f64 (/.f64 x #s(literal 2 binary64)) (log.f64 (.f64 x x)))
(*.f64 #s(literal 2 binary64) (log.f64 (sqrt.f64 (pow.f64 x x))))
(*.f64 (log.f64 x) x)
(*.f64 x (log.f64 x))
(/.f64 (-.f64 (.f64 (log.f64 (sqrt.f64 (pow.f64 x x))) (log.f64 (sqrt.f64 (pow.f64 x x)))) (.f64 (log.f64 (sqrt.f64 (pow.f64 x x))) (log.f64 (sqrt.f64 (pow.f64 x x))))) (-.f64 (log.f64 (sqrt.f64 (pow.f64 x x))) (log.f64 (sqrt.f64 (pow.f64 x x)))))
(/.f64 (+.f64 (pow.f64 (log.f64 (sqrt.f64 (pow.f64 x x))) #s(literal 3 binary64)) (pow.f64 (log.f64 (sqrt.f64 (pow.f64 x x))) #s(literal 3 binary64))) (fma.f64 (log.f64 (sqrt.f64 (pow.f64 x x))) (log.f64 (sqrt.f64 (pow.f64 x x))) (-.f64 (.f64 (log.f64 (sqrt.f64 (pow.f64 x x))) (log.f64 (sqrt.f64 (pow.f64 x x)))) (.f64 (log.f64 (sqrt.f64 (pow.f64 x x))) (log.f64 (sqrt.f64 (pow.f64 x x)))))))
(fma.f64 (/.f64 x #s(literal 2 binary64)) (log.f64 x) (log.f64 (sqrt.f64 (pow.f64 x x))))
(fma.f64 (log.f64 x) (/.f64 x #s(literal 2 binary64)) (log.f64 (sqrt.f64 (pow.f64 x x))))
(+.f64 (log.f64 (neg.f64 (sqrt.f64 (pow.f64 x x)))) (log.f64 (neg.f64 (sqrt.f64 (pow.f64 x x)))))
(+.f64 (log.f64 (sqrt.f64 (pow.f64 x x))) (log.f64 (sqrt.f64 (pow.f64 x x))))
(log.f64 (pow.f64 x x))
(.f64 (.f64 (sqrt.f64 (pow.f64 x x)) (pow.f64 x (/.f64 x #s(literal 4 binary64)))) (pow.f64 x (/.f64 x #s(literal 4 binary64))))
(.f64 (pow.f64 x (/.f64 (.f64 (/.f64 x #s(literal 2 binary64)) #s(literal 2 binary64)) #s(literal 2 binary64))) (pow.f64 x (/.f64 (*.f64 (/.f64 x #s(literal 2 binary64)) #s(literal 2 binary64)) #s(literal 2 binary64))))
(*.f64 (neg.f64 (neg.f64 (sqrt.f64 (pow.f64 x x)))) (neg.f64 (neg.f64 (sqrt.f64 (pow.f64 x x)))))
(*.f64 (pow.f64 (sqrt.f64 (pow.f64 x x)) #s(literal 1 binary64)) (pow.f64 (sqrt.f64 (pow.f64 x x)) #s(literal 1 binary64)))
(*.f64 (pow.f64 (sqrt.f64 (pow.f64 x x)) #s(literal 1 binary64)) (sqrt.f64 (pow.f64 x x)))
(.f64 (pow.f64 x (/.f64 x #s(literal 4 binary64))) (.f64 (pow.f64 x (/.f64 x #s(literal 4 binary64))) (sqrt.f64 (pow.f64 x x))))
(*.f64 (neg.f64 (sqrt.f64 (pow.f64 x x))) (neg.f64 (sqrt.f64 (pow.f64 x x))))
(*.f64 (sqrt.f64 (pow.f64 x x)) (sqrt.f64 (pow.f64 x x)))
(pow.f64 (exp.f64 x) (log.f64 x))
(pow.f64 (neg.f64 (sqrt.f64 (pow.f64 x x))) #s(literal 2 binary64))
(pow.f64 (*.f64 x x) (/.f64 x #s(literal 2 binary64)))
(pow.f64 (sqrt.f64 (pow.f64 x x)) #s(literal 2 binary64))
(pow.f64 x (*.f64 (/.f64 x #s(literal 2 binary64)) #s(literal 2 binary64)))
(pow.f64 x x)
(/.f64 (-.f64 (.f64 (cosh.f64 (.f64 (log.f64 x) x)) (cosh.f64 (.f64 (log.f64 x) x))) (.f64 (sinh.f64 (.f64 (log.f64 x) x)) (sinh.f64 (.f64 (log.f64 x) x)))) (-.f64 (cosh.f64 (.f64 (log.f64 x) x)) (sinh.f64 (.f64 (log.f64 x) x))))
(/.f64 (+.f64 (pow.f64 (cosh.f64 (.f64 (log.f64 x) x)) #s(literal 3 binary64)) (pow.f64 (sinh.f64 (.f64 (log.f64 x) x)) #s(literal 3 binary64))) (fma.f64 (cosh.f64 (.f64 (log.f64 x) x)) (cosh.f64 (.f64 (log.f64 x) x)) (-.f64 (.f64 (sinh.f64 (.f64 (log.f64 x) x)) (sinh.f64 (.f64 (log.f64 x) x))) (.f64 (cosh.f64 (.f64 (log.f64 x) x)) (sinh.f64 (.f64 (log.f64 x) x))))))
(neg.f64 (*.f64 (neg.f64 (sqrt.f64 (pow.f64 x x))) (sqrt.f64 (pow.f64 x x))))
(neg.f64 (*.f64 (sqrt.f64 (pow.f64 x x)) (neg.f64 (sqrt.f64 (pow.f64 x x)))))
(fabs.f64 (pow.f64 x x))
(exp.f64 (.f64 (log.f64 (.f64 x x)) (/.f64 x #s(literal 2 binary64))))
(exp.f64 (*.f64 (log.f64 (sqrt.f64 (pow.f64 x x))) #s(literal 2 binary64)))
(exp.f64 (.f64 (log.f64 x) (.f64 (/.f64 x #s(literal 2 binary64)) #s(literal 2 binary64))))
(exp.f64 (*.f64 (log.f64 x) x))
(+.f64 (sinh.f64 (.f64 (log.f64 x) x)) (cosh.f64 (.f64 (log.f64 x) x)))
(+.f64 (cosh.f64 (.f64 (log.f64 x) x)) (sinh.f64 (.f64 (log.f64 x) x)))
x

eval6.0ms (0.2%)

Memory: 23.4MiB live, 23.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 614 to 144 computations (76.5% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (1 fresh and 2 done)

	Pruned	Kept	Total
New	46	1	47
Fresh	0	0	0
Picked	0	1	1
Done	0	1	1
Total	46	3	49

Accuracy

99.6%

Counts

49 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	99.6%	(*.f64 x (log.f64 x))
✓	7.3%	(log.f64 (pow.f64 x x))
▶	3.8%	(log.f64 #s(approx (pow x x) #s(literal 1 binary64)))

Compiler

Compiled 14 to 11 computations (21.4% saved)

series14.0ms (0.5%)

Memory

-5.0MiB live, 42.1MiB allocated; 2ms collecting garbage

Counts

3 → 9

Calls

Call 1

Inputs
(log.f64 #s(approx (pow x x) #s(literal 1 binary64)))
#s(approx (pow x x) #s(literal 1 binary64))
#s(literal 1 binary64)

Outputs
(* x (log x))
(* x (+ (log x) (* 1/2 (* x (+ (* -1 (pow (log x) 2)) (pow (log x) 2))))))
(* x (+ (log x) (* x (+ (* 1/6 (* x (+ (* -3 (pow (log x) 3)) (+ (* 2 (pow (log x) 3)) (pow (log x) 3))))) (* 1/2 (+ (* -1 (pow (log x) 2)) (pow (log x) 2)))))))
(* x (+ (log x) (* x (+ (* 1/2 (+ (* -1 (pow (log x) 2)) (pow (log x) 2))) (* x (+ (* 1/24 (* x (+ (* -6 (pow (log x) 4)) (+ (* -4 (pow (log x) 4)) (+ (* -3 (pow (log x) 4)) (+ (* 12 (pow (log x) 4)) (pow (log x) 4))))))) (* 1/6 (+ (* -3 (pow (log x) 3)) (+ (* 2 (pow (log x) 3)) (pow (log x) 3))))))))))
1
(+ 1 (* x (log x)))
(+ 1 (* x (+ (log x) (* 1/2 (* x (pow (log x) 2))))))
(+ 1 (* x (+ (log x) (* x (+ (* 1/6 (* x (pow (log x) 3))) (* 1/2 (pow (log x) 2)))))))
(pow x x)

Calls

3 calls:

Time	Variable		Point	Expression
8.0ms	x	@	inf	((log (pow x x)) (pow x x) 1)
6.0ms	x	@	-inf	((log (pow x x)) (pow x x) 1)
0.0ms	x	@	0	((log (pow x x)) (pow x x) 1)

simplify166.0ms (6.2%)

Memory

12.8MiB live, 242.0MiB allocated; 65ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	67	148
1	251	106
2	1158	82
3	6881	82
0	8008	73

Stop Event

1×	iter limit
1×	node limit

Counts

9 → 9

Calls

Call 1

Inputs
(* x (log x))
(* x (+ (log x) (* 1/2 (* x (+ (* -1 (pow (log x) 2)) (pow (log x) 2))))))
(* x (+ (log x) (* x (+ (* 1/6 (* x (+ (* -3 (pow (log x) 3)) (+ (* 2 (pow (log x) 3)) (pow (log x) 3))))) (* 1/2 (+ (* -1 (pow (log x) 2)) (pow (log x) 2)))))))
(* x (+ (log x) (* x (+ (* 1/2 (+ (* -1 (pow (log x) 2)) (pow (log x) 2))) (* x (+ (* 1/24 (* x (+ (* -6 (pow (log x) 4)) (+ (* -4 (pow (log x) 4)) (+ (* -3 (pow (log x) 4)) (+ (* 12 (pow (log x) 4)) (pow (log x) 4))))))) (* 1/6 (+ (* -3 (pow (log x) 3)) (+ (* 2 (pow (log x) 3)) (pow (log x) 3))))))))))
1
(+ 1 (* x (log x)))
(+ 1 (* x (+ (log x) (* 1/2 (* x (pow (log x) 2))))))
(+ 1 (* x (+ (log x) (* x (+ (* 1/6 (* x (pow (log x) 3))) (* 1/2 (pow (log x) 2)))))))
(pow x x)

Outputs
(* x (log x))
(*.f64 (log.f64 x) x)
(* x (+ (log x) (* 1/2 (* x (+ (* -1 (pow (log x) 2)) (pow (log x) 2))))))
(fma.f64 (log.f64 x) x #s(literal 0 binary64))
(* x (+ (log x) (* x (+ (* 1/6 (* x (+ (* -3 (pow (log x) 3)) (+ (* 2 (pow (log x) 3)) (pow (log x) 3))))) (* 1/2 (+ (* -1 (pow (log x) 2)) (pow (log x) 2)))))))
(fma.f64 (log.f64 x) x #s(literal 0 binary64))
(* x (+ (log x) (* x (+ (* 1/2 (+ (* -1 (pow (log x) 2)) (pow (log x) 2))) (* x (+ (* 1/24 (* x (+ (* -6 (pow (log x) 4)) (+ (* -4 (pow (log x) 4)) (+ (* -3 (pow (log x) 4)) (+ (* 12 (pow (log x) 4)) (pow (log x) 4))))))) (* 1/6 (+ (* -3 (pow (log x) 3)) (+ (* 2 (pow (log x) 3)) (pow (log x) 3))))))))))
(.f64 (fma.f64 (.f64 (.f64 (.f64 (*.f64 (pow.f64 (log.f64 x) #s(literal 4 binary64)) #s(literal 0 binary64)) x) #s(literal 1/24 binary64)) x) x (log.f64 x)) x)
1
#s(literal 1 binary64)
(+ 1 (* x (log x)))
(fma.f64 (log.f64 x) x #s(literal 1 binary64))
(+ 1 (* x (+ (log x) (* 1/2 (* x (pow (log x) 2))))))
(fma.f64 (fma.f64 (*.f64 (pow.f64 (log.f64 x) #s(literal 2 binary64)) x) #s(literal 1/2 binary64) (log.f64 x)) x #s(literal 1 binary64))
(+ 1 (* x (+ (log x) (* x (+ (* 1/6 (* x (pow (log x) 3))) (* 1/2 (pow (log x) 2)))))))
(fma.f64 (fma.f64 (.f64 (pow.f64 (log.f64 x) #s(literal 2 binary64)) (fma.f64 (.f64 #s(literal 1/6 binary64) x) (log.f64 x) #s(literal 1/2 binary64))) x (log.f64 x)) x #s(literal 1 binary64))
(pow x x)
(pow.f64 x x)

rewrite63.0ms (2.3%)

Memory

-9.3MiB live, 34.6MiB allocated; 14ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	12
0	6	12
1	16	12
2	47	12
0	223	12

Stop Event

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

Counts

3 → 3

Calls

Call 1

Inputs
(log.f64 #s(approx (pow x x) #s(literal 1 binary64)))
#s(approx (pow x x) #s(literal 1 binary64))
#s(literal 1 binary64)

Outputs
(log.f64 #s(approx (pow x x) #s(literal 1 binary64)))
#s(approx (pow x x) #s(literal 1 binary64))
#s(literal 1 binary64)

eval1.0ms (0.1%)

Memory: 2.5MiB live, 2.5MiB allocated; 0ms collecting garbage
Compiler: Compiled 120 to 44 computations (63.3% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	10	0	10
Fresh	0	0	0
Picked	0	1	1
Done	0	2	2
Total	10	3	13

Accuracy

99.6%

Counts

13 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	99.6%	(*.f64 x (log.f64 x))
✓	7.3%	(log.f64 (pow.f64 x x))
✓	3.8%	(log.f64 #s(approx (pow x x) #s(literal 1 binary64)))

Compiler

Compiled 28 to 20 computations (28.6% saved)

regimes4.0ms (0.1%)

Memory

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

Counts

3 → 1

Calls

Call 1

Inputs
(log.f64 #s(approx (pow x x) #s(literal 1 binary64)))
(*.f64 x (log.f64 x))
(log.f64 (pow.f64 x x))

Outputs
(*.f64 x (log.f64 x))

Calls

2 calls:

2.0ms	x
2.0ms	(*.f64 x (log.f64 x))

Results

Accuracy	Segments	Branch
99.6%	1	`(*.f64 x (log.f64 x))`
99.6%	1	`x`

Compiler

Compiled 5 to 4 computations (20% saved)

regimes28.0ms (1.1%)

Memory

-36.4MiB live, 6.0MiB allocated; 19ms collecting garbage

Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts

1 → 1

Calls

Call 1

Inputs
(log.f64 #s(approx (pow x x) #s(literal 1 binary64)))

Outputs
(log.f64 #s(approx (pow x x) #s(literal 1 binary64)))

Calls

2 calls:

27.0ms	(*.f64 x (log.f64 x))
1.0ms	x

Results

Accuracy	Segments	Branch
3.8%	1	`(*.f64 x (log.f64 x))`
3.8%	1	`x`

Compiler

Compiled 5 to 4 computations (20% saved)

simplify54.0ms (2%)

Memory

22.6MiB live, 67.0MiB allocated; 12ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	10
1	9	10
2	12	10
3	20	10
4	43	10
5	216	10
6	2220	10
7	5391	10

Stop Event

1×	node limit

Calls

Call 1

Inputs
(*.f64 x (log.f64 x))
(log.f64 #s(approx (pow x x) #s(literal 1 binary64)))

Outputs
(*.f64 x (log.f64 x))
(log.f64 #s(approx (pow x x) #s(literal 1 binary64)))

derivations443.0ms (16.4%)

Memory

-100.1MiB live, 30.1MiB allocated; 785ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 10 to 7 computations (30% saved)

preprocess216.0ms (8%)

Memory: 2.6MiB live, 67.1MiB allocated; 23ms collecting garbage
Compiler: Compiled 28 to 20 computations (28.6% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample914.0ms (33.9%)

explain71.0ms (2.6%)

preprocess13.0ms (0.5%)

eval0.0ms (0%)

prune0.0ms (0%)

series114.0ms (4.2%)

simplify165.0ms (6.1%)

rewrite49.0ms (1.8%)

eval2.0ms (0.1%)

prune1.0ms (0%)

series77.0ms (2.8%)

simplify234.0ms (8.7%)

rewrite58.0ms (2.1%)

eval6.0ms (0.2%)

prune2.0ms (0.1%)

series14.0ms (0.5%)

simplify166.0ms (6.2%)

rewrite63.0ms (2.3%)

eval1.0ms (0.1%)

prune2.0ms (0.1%)

regimes4.0ms (0.1%)

regimes28.0ms (1.1%)

simplify54.0ms (2%)

derivations443.0ms (16.4%)

preprocess216.0ms (8%)

end0.0ms (0%)

Profiling