Metrics for logs (example 3.8)

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	23.7%	76.3%	0%	0%	0%	0
100%	23.7%	0%	76.3%	0%	0%	0%	1

Compiler

Compiled 19 to 12 computations (36.8% saved)

sample3.8s (63.6%)

Memory

-38.7MiB live, 2 451.5MiB allocated; 1.2s collecting garbage

Samples

3.3s

8 256×

valid

Precisions

Click to see histograms. Total time spent on operations: 3.1s

ival-log: 1.0s (34% of total)

ival-log1p: 731.0ms (23.8% of total)

adjust: 424.0ms (13.8% of total)

ival-add: 310.0ms (10.1% of total)

ival-mult: 269.0ms (8.7% of total)

ival-sub: 231.0ms (7.5% of total)

ival->: 47.0ms (1.5% of total)

exact: 12.0ms (0.4% of total)

ival-assert: 4.0ms (0.1% of total)

Bogosity

explain243.0ms (4.1%)

Memory

11.2MiB live, 203.6MiB allocated; 17ms collecting garbage

FPErrors

Click to see full error table

Ground Truth	Example	Example	Subexpression
256	-	-	`(-.f64 (.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64)))) (.f64 n (log.f64 n)))`
0	-	-	`n`
0	-	-	`(*.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64))))`
0	-	-	`#s(literal 1 binary64)`
0	-	-	`(+.f64 n #s(literal 1 binary64))`
0	-	-	`(log.f64 n)`
0	-	-	`(-.f64 (-.f64 (.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64)))) (.f64 n (log.f64 n))) #s(literal 1 binary64))`
0	-	-	`(*.f64 n (log.f64 n))`
0	-	-	`(log.f64 (+.f64 n #s(literal 1 binary64)))`

Explanations

Click to see full explanations table

Operator	Subexpression	Explanation	Count
`-.f64`	`(-.f64 (.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64)))) (.f64 n (log.f64 n)))`	cancellation	253	0
`-.f64`	`(-.f64 (.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64)))) (.f64 n (log.f64 n)))`	nan-rescue	3	0
↳	`(*.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64))))`	overflow	3
↳	`(*.f64 n (log.f64 n))`	overflow	3

Confusion

	Predicted +	Predicted -
+	256	0
-	0	0

Precision

1.0

Recall

1.0

Confusion?

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

Precision?

1.0

Recall?

1.0

Freqs

test

number	freq
1	256

Total Confusion?

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

Precision?

1.0

Recall?

1.0

Samples

154.0ms

512×

valid

Compiler

Compiled 121 to 31 computations (74.4% saved)

Precisions

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

ival-log: 40.0ms (30.6% of total)

ival-log1p: 38.0ms (29% of total)

adjust: 22.0ms (16.8% of total)

ival-mult: 14.0ms (10.7% of total)

ival-sub: 9.0ms (6.9% of total)

ival-add: 8.0ms (6.1% of total)

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

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

exact: 0.0ms (0% of total)

preprocess209.0ms (3.5%)

Memory

12.3MiB live, 108.0MiB allocated; 15ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	11	37
1	24	37
2	52	37
3	177	35
4	548	34
5	2188	32
6	6391	32
0	9	15
0	16	15
1	26	15
2	49	15
3	185	15
4	547	15
5	2107	15
6	7813	15
0	8123	11

Stop Event

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

Calls

Call 1

Inputs
(-.f64 (-.f64 (.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64)))) (.f64 n (log.f64 n))) #s(literal 1 binary64))

Outputs

(-.f64 (-.f64 (*.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64)))) (*.f64 n (log.f64 n))) #s(literal 1 binary64))

(fma.f64 (-.f64 (log1p.f64 n) (log.f64 n)) n (-.f64 (log1p.f64 n) #s(literal 1 binary64)))

Compiler

Compiled 15 to 9 computations (40% 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.5MiB live, 0.5MiB allocated; 0ms collecting garbage

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	1.6%	(-.f64 (-.f64 (.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64)))) (.f64 n (log.f64 n))) #s(literal 1 binary64))

Compiler

Compiled 15 to 9 computations (40% saved)

simplify128.0ms (2.2%)

Memory

7.4MiB live, 95.8MiB allocated; 11ms collecting garbage

Localize:

Found 4 expressions of interest:

New	Metric	Score
cost-diff	0	(*.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64))))
cost-diff	0	(-.f64 (-.f64 (.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64)))) (.f64 n (log.f64 n))) #s(literal 1 binary64))
cost-diff	2	(log.f64 (+.f64 n #s(literal 1 binary64)))
cost-diff	2	(-.f64 (.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64)))) (.f64 n (log.f64 n)))

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	9	51
0	16	51
1	26	51
2	49	51
3	185	51
4	547	51
5	2107	51
6	7813	51
0	8123	39

Stop Event

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

Calls

Call 1

Inputs
(-.f64 (-.f64 (.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64)))) (.f64 n (log.f64 n))) #s(literal 1 binary64))
(-.f64 (.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64)))) (.f64 n (log.f64 n)))
(*.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64))))
(+.f64 n #s(literal 1 binary64))
n
#s(literal 1 binary64)
(log.f64 (+.f64 n #s(literal 1 binary64)))
(*.f64 n (log.f64 n))
(log.f64 n)

Outputs
(-.f64 (-.f64 (.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64)))) (.f64 n (log.f64 n))) #s(literal 1 binary64))
(fma.f64 (-.f64 (log1p.f64 n) (log.f64 n)) n (-.f64 (log1p.f64 n) #s(literal 1 binary64)))
(-.f64 (.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64)))) (.f64 n (log.f64 n)))
(fma.f64 (-.f64 (log1p.f64 n) (log.f64 n)) n (log1p.f64 n))
(*.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64))))
(fma.f64 (log1p.f64 n) n (log1p.f64 n))
(+.f64 n #s(literal 1 binary64))
(-.f64 n #s(literal -1 binary64))
n
#s(literal 1 binary64)
(log.f64 (+.f64 n #s(literal 1 binary64)))
(log1p.f64 n)
(*.f64 n (log.f64 n))
(*.f64 (log.f64 n) n)
(log.f64 n)

localize184.0ms (3.1%)

Memory

-48.5MiB live, 80.1MiB allocated; 70ms collecting garbage

Localize:

Found 4 expressions of interest:

New	Metric	Score
accuracy	0.0	(log.f64 n)
accuracy	0.25390625	(*.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64))))
accuracy	0.25390625	(*.f64 n (log.f64 n))
accuracy	61.96085998990777	(-.f64 (.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64)))) (.f64 n (log.f64 n)))

Samples

112.0ms

256×

valid

Compiler

Compiled 53 to 11 computations (79.2% saved)

Precisions

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

ival-log1p: 20.0ms (31.8% of total)

ival-log: 17.0ms (27% of total)

adjust: 11.0ms (17.5% of total)

ival-mult: 7.0ms (11.1% of total)

ival-sub: 5.0ms (8% of total)

ival-add: 3.0ms (4.8% of total)

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

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

exact: 0.0ms (0% of total)

series91.0ms (1.5%)

Memory

12.6MiB live, 59.9MiB allocated; 8ms collecting garbage

Counts

6 → 47

Calls

Call 1

Inputs
(-.f64 (.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64)))) (.f64 n (log.f64 n)))
(log.f64 (+.f64 n #s(literal 1 binary64)))
(-.f64 (-.f64 (.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64)))) (.f64 n (log.f64 n))) #s(literal 1 binary64))
(*.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64))))
(*.f64 n (log.f64 n))
(log.f64 n)

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

Calls

3 calls:

Time	Variable		Point	Expression
42.0ms	n	@	inf	((- (* (+ n 1) (log (+ n 1))) (* n (log n))) (log (+ n 1)) (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (* (+ n 1) (log (+ n 1))) (* n (log n)) (log n))
36.0ms	n	@	0	((- (* (+ n 1) (log (+ n 1))) (* n (log n))) (log (+ n 1)) (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (* (+ n 1) (log (+ n 1))) (* n (log n)) (log n))
12.0ms	n	@	-inf	((- (* (+ n 1) (log (+ n 1))) (* n (log n))) (log (+ n 1)) (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (* (+ n 1) (log (+ n 1))) (* n (log n)) (log n))

Time

Variable

Point

Expression

42.0ms

inf

((- (* (+ n 1) (log (+ n 1))) (* n (log n))) (log (+ n 1)) (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (* (+ n 1) (log (+ n 1))) (* n (log n)) (log n))

36.0ms

((- (* (+ n 1) (log (+ n 1))) (* n (log n))) (log (+ n 1)) (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (* (+ n 1) (log (+ n 1))) (* n (log n)) (log n))

12.0ms

-inf

((- (* (+ n 1) (log (+ n 1))) (* n (log n))) (log (+ n 1)) (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (* (+ n 1) (log (+ n 1))) (* n (log n)) (log n))

simplify141.0ms (2.4%)

Memory

-9.9MiB live, 132.0MiB allocated; 21ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	154	649
1	517	583
2	1878	551
0	8165	522

Stop Event

1×	iter limit
1×	node limit

Counts

47 → 46

Calls

Call 1

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

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

rewrite45.0ms (0.8%)

Memory

35.7MiB live, 80.5MiB allocated; 6ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	9	46
0	16	46
1	66	44
0	549	37

Stop Event

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

Counts

6 → 62

Calls

Call 1

Inputs
(-.f64 (.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64)))) (.f64 n (log.f64 n)))
(log.f64 (+.f64 n #s(literal 1 binary64)))
(-.f64 (-.f64 (.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64)))) (.f64 n (log.f64 n))) #s(literal 1 binary64))
(*.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64))))
(*.f64 n (log.f64 n))
(log.f64 n)

Outputs
(.f64 (fma.f64 (neg.f64 n) (log.f64 n) (.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64)))) #s(literal 1 binary64))
(.f64 #s(literal 1 binary64) (fma.f64 (neg.f64 n) (log.f64 n) (.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64)))))
(/.f64 (.f64 (-.f64 (pow.f64 (.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64))) #s(literal 2 binary64)) (pow.f64 (.f64 (log.f64 n) n) #s(literal 2 binary64))) #s(literal 1 binary64)) (fma.f64 (log.f64 n) n (.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64)))))
(/.f64 (.f64 (-.f64 (pow.f64 (.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64))) #s(literal 3 binary64)) (pow.f64 (.f64 (log.f64 n) n) #s(literal 3 binary64))) #s(literal 1 binary64)) (fma.f64 (.f64 (log.f64 n) n) (fma.f64 (log.f64 n) n (.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64)))) (pow.f64 (.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64))) #s(literal 2 binary64))))
(/.f64 (+.f64 (pow.f64 (.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64))) #s(literal 3 binary64)) (pow.f64 (.f64 (neg.f64 n) (log.f64 n)) #s(literal 3 binary64))) (+.f64 (pow.f64 (.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64))) #s(literal 2 binary64)) (-.f64 (pow.f64 (.f64 (log.f64 n) n) #s(literal 2 binary64)) (.f64 (.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64))) (*.f64 (neg.f64 n) (log.f64 n))))))
(/.f64 (neg.f64 (-.f64 (pow.f64 (.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64))) #s(literal 2 binary64)) (pow.f64 (.f64 (log.f64 n) n) #s(literal 2 binary64)))) (neg.f64 (fma.f64 (log.f64 n) n (*.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64))))))
(/.f64 (neg.f64 (-.f64 (pow.f64 (.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64))) #s(literal 3 binary64)) (pow.f64 (.f64 (log.f64 n) n) #s(literal 3 binary64)))) (neg.f64 (fma.f64 (.f64 (log.f64 n) n) (fma.f64 (log.f64 n) n (.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64)))) (pow.f64 (*.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64))) #s(literal 2 binary64)))))
(/.f64 (-.f64 (pow.f64 (.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64))) #s(literal 2 binary64)) (pow.f64 (.f64 (log.f64 n) n) #s(literal 2 binary64))) (fma.f64 (log.f64 n) n (*.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64)))))
(/.f64 (-.f64 (pow.f64 (.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64))) #s(literal 3 binary64)) (pow.f64 (.f64 (log.f64 n) n) #s(literal 3 binary64))) (fma.f64 (.f64 (log.f64 n) n) (fma.f64 (log.f64 n) n (.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64)))) (pow.f64 (*.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64))) #s(literal 2 binary64))))
(fma.f64 (neg.f64 n) (log.f64 n) (*.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64))))
(fma.f64 (log.f64 n) (neg.f64 n) (*.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64))))
(fma.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64)) (*.f64 (neg.f64 (log.f64 n)) n))
(fma.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64)) (*.f64 (neg.f64 n) (log.f64 n)))
(fma.f64 (-.f64 n #s(literal -1 binary64)) (log1p.f64 n) (*.f64 (neg.f64 (log.f64 n)) n))
(fma.f64 (-.f64 n #s(literal -1 binary64)) (log1p.f64 n) (*.f64 (neg.f64 n) (log.f64 n)))
(-.f64 (/.f64 (pow.f64 (.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64))) #s(literal 2 binary64)) (fma.f64 (log.f64 n) n (.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64))))) (/.f64 (pow.f64 (.f64 (log.f64 n) n) #s(literal 2 binary64)) (fma.f64 (log.f64 n) n (.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64))))))
(-.f64 (/.f64 (pow.f64 (.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64))) #s(literal 3 binary64)) (fma.f64 (.f64 (log.f64 n) n) (fma.f64 (log.f64 n) n (.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64)))) (pow.f64 (.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64))) #s(literal 2 binary64)))) (/.f64 (pow.f64 (.f64 (log.f64 n) n) #s(literal 3 binary64)) (fma.f64 (.f64 (log.f64 n) n) (fma.f64 (log.f64 n) n (.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64)))) (pow.f64 (.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64))) #s(literal 2 binary64)))))
(-.f64 (.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64))) (.f64 (neg.f64 (neg.f64 n)) (log.f64 n)))
(-.f64 (.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64))) (.f64 (log.f64 n) n))
(+.f64 (.f64 (neg.f64 n) (log.f64 n)) (.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64))))
(+.f64 (.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64))) (.f64 (neg.f64 (log.f64 n)) n))
(+.f64 (.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64))) (.f64 (neg.f64 n) (log.f64 n)))
(log.f64 (/.f64 (pow.f64 (-.f64 n #s(literal -1 binary64)) (-.f64 n #s(literal -1 binary64))) (pow.f64 n n)))
(log1p.f64 n)
(-.f64 (log.f64 (fma.f64 n n #s(literal -1 binary64))) (log.f64 (-.f64 n #s(literal 1 binary64))))
(-.f64 (log1p.f64 (pow.f64 n #s(literal 3 binary64))) (log.f64 (fma.f64 n n (-.f64 #s(literal 1 binary64) n))))
(log.f64 (-.f64 n #s(literal -1 binary64)))
(/.f64 (-.f64 (pow.f64 (.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64))) #s(literal 2 binary64)) (.f64 (fma.f64 (log.f64 n) n #s(literal 1 binary64)) (fma.f64 (log.f64 n) n #s(literal 1 binary64)))) (fma.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64)) (fma.f64 (log.f64 n) n #s(literal 1 binary64))))
(/.f64 (-.f64 (pow.f64 (.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64))) #s(literal 3 binary64)) (pow.f64 (fma.f64 (log.f64 n) n #s(literal 1 binary64)) #s(literal 3 binary64))) (+.f64 (pow.f64 (.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64))) #s(literal 2 binary64)) (fma.f64 (fma.f64 (log.f64 n) n #s(literal 1 binary64)) (fma.f64 (log.f64 n) n #s(literal 1 binary64)) (.f64 (.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64))) (fma.f64 (log.f64 n) n #s(literal 1 binary64))))))
(/.f64 (neg.f64 (-.f64 (pow.f64 (fma.f64 (neg.f64 n) (log.f64 n) (*.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64)))) #s(literal 2 binary64)) #s(literal 1 binary64))) (neg.f64 (fma.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64)) (fma.f64 (neg.f64 n) (log.f64 n) #s(literal 1 binary64)))))
(/.f64 (neg.f64 (-.f64 (pow.f64 (fma.f64 (neg.f64 n) (log.f64 n) (.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64)))) #s(literal 3 binary64)) #s(literal 1 binary64))) (neg.f64 (+.f64 (fma.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64)) (fma.f64 (neg.f64 n) (log.f64 n) #s(literal 1 binary64))) (pow.f64 (fma.f64 (neg.f64 n) (log.f64 n) (.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64)))) #s(literal 2 binary64)))))
(/.f64 (-.f64 (pow.f64 (fma.f64 (neg.f64 n) (log.f64 n) (*.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64)))) #s(literal 2 binary64)) #s(literal 1 binary64)) (fma.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64)) (fma.f64 (neg.f64 n) (log.f64 n) #s(literal 1 binary64))))
(/.f64 (-.f64 (pow.f64 (fma.f64 (neg.f64 n) (log.f64 n) (.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64)))) #s(literal 3 binary64)) #s(literal 1 binary64)) (+.f64 (fma.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64)) (fma.f64 (neg.f64 n) (log.f64 n) #s(literal 1 binary64))) (pow.f64 (fma.f64 (neg.f64 n) (log.f64 n) (.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64)))) #s(literal 2 binary64))))
(fma.f64 (fma.f64 (neg.f64 n) (log.f64 n) (*.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64)))) #s(literal 1 binary64) #s(literal -1 binary64))
(fma.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64)) (-.f64 (*.f64 (neg.f64 n) (log.f64 n)) #s(literal 1 binary64)))
(fma.f64 (-.f64 n #s(literal -1 binary64)) (log1p.f64 n) (-.f64 (*.f64 (neg.f64 n) (log.f64 n)) #s(literal 1 binary64)))
(fma.f64 #s(literal 1 binary64) (fma.f64 (neg.f64 n) (log.f64 n) (*.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64)))) #s(literal -1 binary64))
(-.f64 (/.f64 (pow.f64 (fma.f64 (neg.f64 n) (log.f64 n) (*.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64)))) #s(literal 2 binary64)) (fma.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64)) (fma.f64 (neg.f64 n) (log.f64 n) #s(literal 1 binary64)))) (/.f64 #s(literal 1 binary64) (fma.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64)) (fma.f64 (neg.f64 n) (log.f64 n) #s(literal 1 binary64)))))
(-.f64 (/.f64 (pow.f64 (fma.f64 (neg.f64 n) (log.f64 n) (.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64)))) #s(literal 3 binary64)) (+.f64 (fma.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64)) (fma.f64 (neg.f64 n) (log.f64 n) #s(literal 1 binary64))) (pow.f64 (fma.f64 (neg.f64 n) (log.f64 n) (.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64)))) #s(literal 2 binary64)))) (/.f64 #s(literal 1 binary64) (+.f64 (fma.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64)) (fma.f64 (neg.f64 n) (log.f64 n) #s(literal 1 binary64))) (pow.f64 (fma.f64 (neg.f64 n) (log.f64 n) (*.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64)))) #s(literal 2 binary64)))))
(-.f64 (fma.f64 (neg.f64 n) (log.f64 n) (*.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64)))) #s(literal 1 binary64))
(-.f64 (*.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64))) (fma.f64 (log.f64 n) n #s(literal 1 binary64)))
(+.f64 (fma.f64 (neg.f64 n) (log.f64 n) (*.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64)))) #s(literal -1 binary64))
(+.f64 (.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64))) (-.f64 (.f64 (neg.f64 n) (log.f64 n)) #s(literal 1 binary64)))
(*.f64 (log1p.f64 n) (-.f64 n #s(literal -1 binary64)))
(*.f64 (-.f64 n #s(literal -1 binary64)) (log1p.f64 n))
(/.f64 (*.f64 (fma.f64 n n #s(literal -1 binary64)) (log1p.f64 n)) (-.f64 n #s(literal 1 binary64)))
(/.f64 (*.f64 (-.f64 (pow.f64 n #s(literal 3 binary64)) #s(literal -1 binary64)) (log1p.f64 n)) (fma.f64 n n (-.f64 #s(literal 1 binary64) n)))
(/.f64 (*.f64 (log1p.f64 n) (fma.f64 n n #s(literal -1 binary64))) (-.f64 n #s(literal 1 binary64)))
(/.f64 (*.f64 (log1p.f64 n) (-.f64 (pow.f64 n #s(literal 3 binary64)) #s(literal -1 binary64))) (fma.f64 n n (-.f64 #s(literal 1 binary64) n)))
(fma.f64 (log1p.f64 n) #s(literal 1 binary64) (*.f64 (log1p.f64 n) n))
(fma.f64 (log1p.f64 n) n (*.f64 (log1p.f64 n) #s(literal 1 binary64)))
(fma.f64 #s(literal 1 binary64) (log1p.f64 n) (*.f64 n (log1p.f64 n)))
(fma.f64 n (log1p.f64 n) (*.f64 #s(literal 1 binary64) (log1p.f64 n)))
(+.f64 (.f64 #s(literal 1 binary64) (log1p.f64 n)) (.f64 n (log1p.f64 n)))
(+.f64 (.f64 n (log1p.f64 n)) (.f64 #s(literal 1 binary64) (log1p.f64 n)))
(+.f64 (.f64 (log1p.f64 n) #s(literal 1 binary64)) (.f64 (log1p.f64 n) n))
(+.f64 (.f64 (log1p.f64 n) n) (.f64 (log1p.f64 n) #s(literal 1 binary64)))
(log.f64 (pow.f64 (-.f64 n #s(literal -1 binary64)) (-.f64 n #s(literal -1 binary64))))
(*.f64 (log.f64 n) n)
(*.f64 n (log.f64 n))
(log.f64 (pow.f64 n n))
(log.f64 n)

eval48.0ms (0.8%)

Memory: -32.2MiB live, 14.9MiB allocated; 2ms collecting garbage
Compiler: Compiled 2 633 to 453 computations (82.8% saved)

prune3.0ms (0%)

Memory

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

Pruning

2 alts after pruning (2 fresh and 0 done)

	Pruned	Kept	Total
New	106	2	108
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	107	2	109

Accuracy

100.0%

Counts

109 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(-.f64 #s(approx (- (* (+ n 1) (log (+ n 1))) (* n (log n))) (-.f64 (log.f64 n) #s(literal -1 binary64))) #s(literal 1 binary64))
▶	1.6%	#s(approx (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) #s(literal -1 binary64))

Status

Accuracy

Program

▶

100.0%

(-.f64 #s(approx (- (* (+ n 1) (log (+ n 1))) (* n (log n))) (-.f64 (log.f64 n) #s(literal -1 binary64))) #s(literal 1 binary64))

▶

1.6%

#s(approx (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) #s(literal -1 binary64))

Compiler

Compiled 37 to 25 computations (32.4% saved)

simplify133.0ms (2.3%)

Memory

13.5MiB live, 110.4MiB allocated; 10ms collecting garbage

Localize:

Found 5 expressions of interest:

New	Metric	Score	Program
cost-diff	0	(log.f64 n)
cost-diff	0	(-.f64 (log.f64 n) #s(literal -1 binary64))
cost-diff	0	#s(approx (- (* (+ n 1) (log (+ n 1))) (* n (log n))) (-.f64 (log.f64 n) #s(literal -1 binary64)))
cost-diff	0	(-.f64 #s(approx (- (* (+ n 1) (log (+ n 1))) (* n (log n))) (-.f64 (log.f64 n) #s(literal -1 binary64))) #s(literal 1 binary64))
cost-diff	0	#s(approx (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) #s(literal -1 binary64))

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	15	65
0	18	65
1	28	65
2	51	65
3	186	65
4	552	65
5	2121	65
6	7842	65
0	8010	53

Stop Event

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

Calls

Call 1

Inputs
#s(approx (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) #s(literal -1 binary64))
#s(literal -1 binary64)
(-.f64 #s(approx (- (* (+ n 1) (log (+ n 1))) (* n (log n))) (-.f64 (log.f64 n) #s(literal -1 binary64))) #s(literal 1 binary64))
#s(approx (- (* (+ n 1) (log (+ n 1))) (* n (log n))) (-.f64 (log.f64 n) #s(literal -1 binary64)))
(-.f64 (log.f64 n) #s(literal -1 binary64))
(log.f64 n)
n
#s(literal -1 binary64)
#s(literal 1 binary64)

Outputs
#s(approx (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) #s(literal -1 binary64))
#s(literal -1 binary64)
(-.f64 #s(approx (- (* (+ n 1) (log (+ n 1))) (* n (log n))) (-.f64 (log.f64 n) #s(literal -1 binary64))) #s(literal 1 binary64))
#s(approx (- (* (+ n 1) (log (+ n 1))) (* n (log n))) (-.f64 (log.f64 n) #s(literal -1 binary64)))
(-.f64 (log.f64 n) #s(literal -1 binary64))
(log.f64 n)
n
#s(literal -1 binary64)
#s(literal 1 binary64)

localize91.0ms (1.5%)

Memory

21.2MiB live, 66.9MiB allocated; 3ms collecting garbage

Localize:

Found 5 expressions of interest:

New	Metric	Score
accuracy	0.0	(-.f64 (log.f64 n) #s(literal -1 binary64))
accuracy	0.0	(-.f64 #s(approx (- (* (+ n 1) (log (+ n 1))) (* n (log n))) (-.f64 (log.f64 n) #s(literal -1 binary64))) #s(literal 1 binary64))
accuracy	0.0	(log.f64 n)
accuracy	0.0	#s(approx (- (* (+ n 1) (log (+ n 1))) (* n (log n))) (-.f64 (log.f64 n) #s(literal -1 binary64)))
accuracy	63.00434700345206	#s(approx (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) #s(literal -1 binary64))

Samples

81.0ms

256×

valid

Compiler

Compiled 55 to 13 computations (76.4% saved)

Precisions

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

ival-log1p: 20.0ms (29.1% of total)

ival-log: 17.0ms (24.7% of total)

adjust: 14.0ms (20.3% of total)

ival-mult: 8.0ms (11.6% of total)

ival-sub: 6.0ms (8.7% of total)

ival-add: 3.0ms (4.4% of total)

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

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

exact: 0.0ms (0% of total)

series22.0ms (0.4%)

Memory

-19.9MiB live, 25.7MiB allocated; 5ms collecting garbage

Counts

5 → 26

Calls

Call 1

Inputs
#s(approx (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) #s(literal -1 binary64))
(-.f64 #s(approx (- (* (+ n 1) (log (+ n 1))) (* n (log n))) (-.f64 (log.f64 n) #s(literal -1 binary64))) #s(literal 1 binary64))
#s(approx (- (* (+ n 1) (log (+ n 1))) (* n (log n))) (-.f64 (log.f64 n) #s(literal -1 binary64)))
(-.f64 (log.f64 n) #s(literal -1 binary64))
(log.f64 n)

Outputs
-1
(- (* n (- 1 (log n))) 1)
(- (* n (- (+ 1 (* 1/2 n)) (log n))) 1)
(- (* n (- (+ 1 (* n (+ 1/2 (* -1/6 n)))) (log n))) 1)
(* n (- 1 (log n)))
(* n (- (+ 1 (* 1/2 n)) (log n)))
(* n (- (+ 1 (* n (+ 1/2 (* -1/6 n)))) (log n)))
(* n (- (+ 1 (* n (+ 1/2 (* n (- (* 1/12 n) 1/6))))) (log n)))
(+ 1 (log n))
(log n)
(* -1 (log (/ 1 n)))
(+ (* -1 (log (/ 1 n))) (* 1/2 (/ 1 n)))
(- (+ (* -1 (log (/ 1 n))) (* 1/2 (/ 1 n))) (/ 1/6 (pow n 2)))
(- (+ (* -1 (log (/ 1 n))) (+ (* 1/2 (/ 1 n)) (* 1/12 (/ 1 (pow n 3))))) (/ 1/6 (pow n 2)))
(+ 1 (* -1 (log (/ 1 n))))
(+ 1 (+ (* -1 (log (/ 1 n))) (* 1/2 (/ 1 n))))
(- (+ 1 (+ (* -1 (log (/ 1 n))) (* 1/2 (/ 1 n)))) (/ 1/6 (pow n 2)))
(- (+ 1 (+ (* -1 (log (/ 1 n))) (+ (* 1/2 (/ 1 n)) (* 1/12 (/ 1 (pow n 3)))))) (/ 1/6 (pow n 2)))
(+ (log -1) (* -1 (log (/ -1 n))))
(+ (log -1) (+ (* -1 (log (/ -1 n))) (* 1/2 (/ 1 n))))
(+ (log -1) (+ (* -1 (log (/ -1 n))) (* -1 (/ (- (* 1/6 (/ 1 n)) 1/2) n))))
(+ (log -1) (+ (* -1 (log (/ -1 n))) (* -1 (/ (- (* -1 (/ (- (* 1/12 (/ 1 n)) 1/6) n)) 1/2) n))))
(+ 1 (+ (log -1) (* -1 (log (/ -1 n)))))
(+ 1 (+ (log -1) (+ (* -1 (log (/ -1 n))) (* 1/2 (/ 1 n)))))
(+ 1 (+ (log -1) (+ (* -1 (log (/ -1 n))) (* -1 (/ (- (* 1/6 (/ 1 n)) 1/2) n)))))
(+ 1 (+ (log -1) (+ (* -1 (log (/ -1 n))) (* -1 (/ (- (* -1 (/ (- (* 1/12 (/ 1 n)) 1/6) n)) 1/2) n)))))

Calls

3 calls:

Time	Variable		Point	Expression
9.0ms	n	@	0	((- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (- (* (+ n 1) (log (+ n 1))) (* n (log n))) (- (log n) -1) (log n))
6.0ms	n	@	inf	((- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (- (* (+ n 1) (log (+ n 1))) (* n (log n))) (- (log n) -1) (log n))
6.0ms	n	@	-inf	((- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (- (* (+ n 1) (log (+ n 1))) (* n (log n))) (- (log n) -1) (log n))

Time

Variable

Point

Expression

9.0ms

((- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (- (* (+ n 1) (log (+ n 1))) (* n (log n))) (- (log n) -1) (log n))

6.0ms

inf

((- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (- (* (+ n 1) (log (+ n 1))) (* n (log n))) (- (log n) -1) (log n))

6.0ms

-inf

((- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (- (* (+ n 1) (log (+ n 1))) (* n (log n))) (- (log n) -1) (log n))

simplify142.0ms (2.4%)

Memory

-0.6MiB live, 97.2MiB allocated; 11ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	79	313
1	222	289
2	720	281
3	2617	275
0	8230	263

Stop Event

1×	iter limit
1×	node limit

Counts

26 → 26

Calls

Call 1

Inputs
-1
(- (* n (- 1 (log n))) 1)
(- (* n (- (+ 1 (* 1/2 n)) (log n))) 1)
(- (* n (- (+ 1 (* n (+ 1/2 (* -1/6 n)))) (log n))) 1)
(* n (- 1 (log n)))
(* n (- (+ 1 (* 1/2 n)) (log n)))
(* n (- (+ 1 (* n (+ 1/2 (* -1/6 n)))) (log n)))
(* n (- (+ 1 (* n (+ 1/2 (* n (- (* 1/12 n) 1/6))))) (log n)))
(+ 1 (log n))
(log n)
(* -1 (log (/ 1 n)))
(+ (* -1 (log (/ 1 n))) (* 1/2 (/ 1 n)))
(- (+ (* -1 (log (/ 1 n))) (* 1/2 (/ 1 n))) (/ 1/6 (pow n 2)))
(- (+ (* -1 (log (/ 1 n))) (+ (* 1/2 (/ 1 n)) (* 1/12 (/ 1 (pow n 3))))) (/ 1/6 (pow n 2)))
(+ 1 (* -1 (log (/ 1 n))))
(+ 1 (+ (* -1 (log (/ 1 n))) (* 1/2 (/ 1 n))))
(- (+ 1 (+ (* -1 (log (/ 1 n))) (* 1/2 (/ 1 n)))) (/ 1/6 (pow n 2)))
(- (+ 1 (+ (* -1 (log (/ 1 n))) (+ (* 1/2 (/ 1 n)) (* 1/12 (/ 1 (pow n 3)))))) (/ 1/6 (pow n 2)))
(+ (log -1) (* -1 (log (/ -1 n))))
(+ (log -1) (+ (* -1 (log (/ -1 n))) (* 1/2 (/ 1 n))))
(+ (log -1) (+ (* -1 (log (/ -1 n))) (* -1 (/ (- (* 1/6 (/ 1 n)) 1/2) n))))
(+ (log -1) (+ (* -1 (log (/ -1 n))) (* -1 (/ (- (* -1 (/ (- (* 1/12 (/ 1 n)) 1/6) n)) 1/2) n))))
(+ 1 (+ (log -1) (* -1 (log (/ -1 n)))))
(+ 1 (+ (log -1) (+ (* -1 (log (/ -1 n))) (* 1/2 (/ 1 n)))))
(+ 1 (+ (log -1) (+ (* -1 (log (/ -1 n))) (* -1 (/ (- (* 1/6 (/ 1 n)) 1/2) n)))))
(+ 1 (+ (log -1) (+ (* -1 (log (/ -1 n))) (* -1 (/ (- (* -1 (/ (- (* 1/12 (/ 1 n)) 1/6) n)) 1/2) n)))))

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

rewrite43.0ms (0.7%)

Memory

-9.5MiB live, 35.0MiB allocated; 4ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	15	61
0	18	61
1	90	58
0	770	54

Stop Event

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

Counts

5 → 24

Calls

Call 1

Inputs
#s(approx (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) #s(literal -1 binary64))
(-.f64 #s(approx (- (* (+ n 1) (log (+ n 1))) (* n (log n))) (-.f64 (log.f64 n) #s(literal -1 binary64))) #s(literal 1 binary64))
#s(approx (- (* (+ n 1) (log (+ n 1))) (* n (log n))) (-.f64 (log.f64 n) #s(literal -1 binary64)))
(-.f64 (log.f64 n) #s(literal -1 binary64))
(log.f64 n)

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

eval5.0ms (0.1%)

Memory: 5.4MiB live, 5.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 1 490 to 177 computations (88.1% saved)

prune2.0ms (0%)

Memory

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

Pruning

2 alts after pruning (1 fresh and 1 done)

	Pruned	Kept	Total
New	47	1	48
Fresh	0	0	0
Picked	1	1	2
Done	0	0	0
Total	48	2	50

Accuracy

100.0%

Counts

50 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	#s(approx (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (log.f64 n))
✓	1.6%	#s(approx (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) #s(literal -1 binary64))

Compiler

Compiled 35 to 22 computations (37.1% saved)

simplify139.0ms (2.4%)

Memory

15.8MiB live, 102.7MiB allocated; 12ms collecting garbage

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
cost-diff	0	(log.f64 n)
cost-diff	0	#s(approx (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (log.f64 n))

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	11	21
0	12	21
1	22	21
2	45	21
3	180	21
4	543	21
5	2111	21
6	7822	21
0	8132	17

Stop Event

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

Calls

Call 1

Inputs
#s(approx (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (log.f64 n))
(log.f64 n)
n

Outputs
#s(approx (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (log.f64 n))
(log.f64 n)
n

localize112.0ms (1.9%)

Memory

10.6MiB live, 112.0MiB allocated; 36ms collecting garbage

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
accuracy	0.0	(log.f64 n)
accuracy	0.0	#s(approx (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (log.f64 n))

Samples

104.0ms

256×

valid

Compiler

Compiled 20 to 11 computations (45% saved)

Precisions

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

ival-log: 29.0ms (30.5% of total)

ival-mult: 20.0ms (21.1% of total)

ival-log1p: 20.0ms (21.1% of total)

adjust: 11.0ms (11.6% of total)

ival-add: 9.0ms (9.5% of total)

ival-sub: 4.0ms (4.2% of total)

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

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

exact: 0.0ms (0% of total)

series25.0ms (0.4%)

Memory

-16.6MiB live, 29.1MiB allocated; 12ms collecting garbage

Counts

2 → 13

Calls

Call 1

Inputs
#s(approx (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (log.f64 n))
(log.f64 n)

Outputs
-1
(- (* n (- 1 (log n))) 1)
(- (* n (- (+ 1 (* 1/2 n)) (log n))) 1)
(- (* n (- (+ 1 (* n (+ 1/2 (* -1/6 n)))) (log n))) 1)
(log n)
(* -1 (log (/ 1 n)))
(+ (* -1 (log (/ 1 n))) (* 1/2 (/ 1 n)))
(- (+ (* -1 (log (/ 1 n))) (* 1/2 (/ 1 n))) (/ 1/6 (pow n 2)))
(- (+ (* -1 (log (/ 1 n))) (+ (* 1/2 (/ 1 n)) (* 1/12 (/ 1 (pow n 3))))) (/ 1/6 (pow n 2)))
(+ (log -1) (* -1 (log (/ -1 n))))
(+ (log -1) (+ (* -1 (log (/ -1 n))) (* 1/2 (/ 1 n))))
(+ (log -1) (+ (* -1 (log (/ -1 n))) (* -1 (/ (- (* 1/6 (/ 1 n)) 1/2) n))))
(+ (log -1) (+ (* -1 (log (/ -1 n))) (* -1 (/ (- (* -1 (/ (- (* 1/12 (/ 1 n)) 1/6) n)) 1/2) n))))

Calls

3 calls:

Time	Variable		Point	Expression
12.0ms	n	@	0	((- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (log n))
6.0ms	n	@	inf	((- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (log n))
6.0ms	n	@	-inf	((- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (log n))

simplify149.0ms (2.5%)

Memory

14.1MiB live, 115.6MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	61	142
1	168	130
2	484	126
3	1654	123
4	5802	123
0	8214	117

Stop Event

1×	iter limit
1×	node limit

Counts

13 → 13

Calls

Call 1

Inputs
-1
(- (* n (- 1 (log n))) 1)
(- (* n (- (+ 1 (* 1/2 n)) (log n))) 1)
(- (* n (- (+ 1 (* n (+ 1/2 (* -1/6 n)))) (log n))) 1)
(log n)
(* -1 (log (/ 1 n)))
(+ (* -1 (log (/ 1 n))) (* 1/2 (/ 1 n)))
(- (+ (* -1 (log (/ 1 n))) (* 1/2 (/ 1 n))) (/ 1/6 (pow n 2)))
(- (+ (* -1 (log (/ 1 n))) (+ (* 1/2 (/ 1 n)) (* 1/12 (/ 1 (pow n 3))))) (/ 1/6 (pow n 2)))
(+ (log -1) (* -1 (log (/ -1 n))))
(+ (log -1) (+ (* -1 (log (/ -1 n))) (* 1/2 (/ 1 n))))
(+ (log -1) (+ (* -1 (log (/ -1 n))) (* -1 (/ (- (* 1/6 (/ 1 n)) 1/2) n))))
(+ (log -1) (+ (* -1 (log (/ -1 n))) (* -1 (/ (- (* -1 (/ (- (* 1/12 (/ 1 n)) 1/6) n)) 1/2) n))))

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

rewrite35.0ms (0.6%)

Memory

-21.9MiB live, 24.0MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	11	20
0	12	20
1	62	19
0	545	17

Stop Event

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

Counts

2 → 2

Calls

Call 1

Inputs
#s(approx (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (log.f64 n))
(log.f64 n)

Outputs
#s(approx (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (log.f64 n))
(log.f64 n)

eval1.0ms (0%)

Memory: 2.9MiB live, 2.9MiB allocated; 0ms collecting garbage
Compiler: Compiled 346 to 60 computations (82.7% saved)

prune2.0ms (0%)

Memory

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

Pruning

2 alts after pruning (0 fresh and 2 done)

	Pruned	Kept	Total
New	14	0	14
Fresh	0	0	0
Picked	0	1	1
Done	0	1	1
Total	14	2	16

Accuracy

100.0%

Counts

16 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	#s(approx (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (log.f64 n))
✓	1.6%	#s(approx (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) #s(literal -1 binary64))

Compiler

Compiled 105 to 45 computations (57.1% saved)

regimes5.0ms (0.1%)

Memory

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

Counts

4 → 1

Calls

Call 1

Inputs
#s(approx (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) #s(literal -1 binary64))
#s(approx (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (log.f64 n))
(-.f64 #s(approx (- (* (+ n 1) (log (+ n 1))) (* n (log n))) (-.f64 (log.f64 n) #s(literal -1 binary64))) #s(literal 1 binary64))
(-.f64 (-.f64 (.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64)))) (.f64 n (log.f64 n))) #s(literal 1 binary64))

Outputs
#s(approx (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (log.f64 n))

Calls

3 calls:

2.0ms

1.0ms

(-.f64 (*.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64)))) (*.f64 n (log.f64 n)))

1.0ms

(-.f64 (-.f64 (*.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64)))) (*.f64 n (log.f64 n))) #s(literal 1 binary64))

Results

Accuracy	Segments	Branch
100.0%	1	`(-.f64 (.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64)))) (.f64 n (log.f64 n)))`
100.0%	1	`(-.f64 (-.f64 (.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64)))) (.f64 n (log.f64 n))) #s(literal 1 binary64))`
100.0%	1	`n`

Compiler

Compiled 29 to 18 computations (37.9% saved)

regimes3.0ms (0.1%)

Memory

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

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

1 → 1

Calls

Call 1

Inputs
#s(approx (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) #s(literal -1 binary64))

Outputs
#s(approx (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) #s(literal -1 binary64))

Calls

3 calls:

1.0ms

(-.f64 (-.f64 (*.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64)))) (*.f64 n (log.f64 n))) #s(literal 1 binary64))

1.0ms

(-.f64 (*.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64)))) (*.f64 n (log.f64 n)))

Results

Accuracy	Segments	Branch
1.6%	1	`(-.f64 (.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64)))) (.f64 n (log.f64 n)))`
1.6%	1	`(-.f64 (-.f64 (.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64)))) (.f64 n (log.f64 n))) #s(literal 1 binary64))`
1.6%	1	`n`

Compiler

Compiled 29 to 18 computations (37.9% saved)

simplify39.0ms (0.7%)

Memory

-23.3MiB live, 22.4MiB allocated; 11ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	35
1	23	35
2	46	35
3	184	35
4	646	35
5	3587	35

Stop Event

1×	node limit

Calls

Call 1

Inputs
#s(approx (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (log.f64 n))
#s(approx (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) #s(literal -1 binary64))

Outputs
#s(approx (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (log.f64 n))
#s(approx (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) #s(literal -1 binary64))

derivations87.0ms (1.5%)

Memory

-8.9MiB live, 35.9MiB allocated; 7ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 35 to 13 computations (62.9% saved)

preprocess20.0ms (0.3%)

Memory: 44.3MiB live, 44.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 148 to 78 computations (47.3% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample3.8s (63.6%)

explain243.0ms (4.1%)

preprocess209.0ms (3.5%)

eval0.0ms (0%)

prune0.0ms (0%)

simplify128.0ms (2.2%)

localize184.0ms (3.1%)

series91.0ms (1.5%)

simplify141.0ms (2.4%)

rewrite45.0ms (0.8%)

eval48.0ms (0.8%)

prune3.0ms (0%)

simplify133.0ms (2.3%)

localize91.0ms (1.5%)

series22.0ms (0.4%)

simplify142.0ms (2.4%)

rewrite43.0ms (0.7%)

eval5.0ms (0.1%)

prune2.0ms (0%)

simplify139.0ms (2.4%)

localize112.0ms (1.9%)

series25.0ms (0.4%)

simplify149.0ms (2.5%)

rewrite35.0ms (0.6%)

eval1.0ms (0%)

prune2.0ms (0%)

regimes5.0ms (0.1%)

regimes3.0ms (0.1%)

simplify39.0ms (0.7%)

derivations87.0ms (1.5%)

preprocess20.0ms (0.3%)

end0.0ms (0%)

Profiling