Metrics for logs (example 3.8)

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

0.4MiB live, 0.4MiB 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.6s (32.4%)

Memory

-35.1MiB live, 2 677.0MiB allocated; 1.1s collecting garbage

Samples

3.1s

8 256×

valid

Precisions

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

ival-log1p: 667.0ms (27.3% of total)

ival-log: 639.0ms (26.2% of total)

adjust: 476.0ms (19.5% of total)

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

ival-sub: 222.0ms (9.1% of total)

ival-add: 115.0ms (4.7% of total)

ival->: 24.0ms (1% of total)

exact: 12.0ms (0.5% of total)

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

Bogosity

explain485.0ms (4.4%)

Memory

22.3MiB live, 485.4MiB allocated; 149ms 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

270.0ms

512×

valid

Compiler

Compiled 121 to 31 computations (74.4% saved)

Precisions

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

ival-log: 107.0ms (43.4% of total)

ival-mult: 62.0ms (25.1% of total)

ival-log1p: 40.0ms (16.2% of total)

adjust: 23.0ms (9.3% of total)

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

ival-add: 6.0ms (2.4% of total)

ival-true: 1.0ms (0.4% of total)

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

exact: 0.0ms (0% of total)

preprocess944.0ms (8.5%)

Memory

-7.0MiB live, 402.6MiB allocated; 83ms collecting garbage

Algorithm

1×	egg-herbie

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	6394	32
0	9	15
0	16	15
1	26	15
2	49	15
3	185	15
4	547	15
5	2107	15
6	7817	15
0	8135	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.1MiB live, 0.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 0 to 1 computations (-∞% saved)

prune0.0ms (0%)

Memory

0.8MiB live, 0.8MiB 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)

simplify1.0s (9.3%)

Memory

27.6MiB live, 731.1MiB allocated; 170ms collecting garbage

Algorithm

1×	egg-herbie

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	7817	51
0	8135	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)

localize148.0ms (1.3%)

Memory

26.6MiB live, 116.2MiB allocated; 11ms collecting garbage

Localize:

Found 4 expressions of interest:

New	Metric	Score
accuracy	0.01171875	(-.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))
accuracy	0.27734375	(*.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64))))
accuracy	0.27734375	(*.f64 n (log.f64 n))
accuracy	62.0097295877987	(-.f64 (.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64)))) (.f64 n (log.f64 n)))

Samples

139.0ms

256×

valid

Compiler

Compiled 53 to 11 computations (79.2% saved)

Precisions

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

ival-mult: 68.0ms (53.4% of total)

ival-log: 21.0ms (16.5% of total)

ival-log1p: 19.0ms (14.9% of total)

adjust: 11.0ms (8.6% of total)

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

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

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

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

exact: 0.0ms (0% of total)

series75.0ms (0.7%)

Memory

-5.5MiB live, 132.7MiB allocated; 24ms collecting garbage

Counts

5 → 46

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))

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))
(+ 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
52.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)))
15.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)))
8.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)))

Time

Variable

Point

Expression

52.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)))

15.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)))

8.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)))

simplify352.0ms (3.2%)

Memory

-45.1MiB live, 242.2MiB allocated; 112ms collecting garbage

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	154	649
1	517	581
2	1878	549
0	8165	520

Stop Event

1×	iter limit
1×	node limit

Counts

46 → 45

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))
(+ 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)
(+ 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))))

rewrite41.0ms (0.4%)

Memory

0.6MiB live, 47.3MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	9	44
0	16	44
1	66	42
0	542	35

Stop Event

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

Counts

5 → 61

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))

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))

eval12.0ms (0.1%)

Memory: 21.4MiB live, 21.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 2 600 to 449 computations (82.7% saved)

prune9.0ms (0.1%)

Memory

-44.6MiB live, 8.5MiB allocated; 6ms collecting garbage

Pruning

3 alts after pruning (3 fresh and 0 done)

	Pruned	Kept	Total
New	103	3	106
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	104	3	107

Accuracy

100.0%

Counts

107 → 3

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))
▶	100.0%	#s(approx (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (-.f64 (log.f64 n) (/.f64 #s(literal -1/2 binary64) n)))
▶	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))

▶

100.0%

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

▶

1.6%

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

Compiler

Compiled 59 to 39 computations (33.9% saved)

simplify1.2s (10.9%)

Memory

29.3MiB live, 777.4MiB allocated; 154ms collecting garbage

Algorithm

1×	egg-herbie

Localize:

Found 9 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	(/.f64 #s(literal -1/2 binary64) n)
cost-diff	0	(log.f64 n)
cost-diff	0	(-.f64 (log.f64 n) (/.f64 #s(literal -1/2 binary64) n))
cost-diff	0	#s(approx (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (-.f64 (log.f64 n) (/.f64 #s(literal -1/2 binary64) n)))
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	19	100
0	24	100
1	34	100
2	57	100
3	192	100
4	560	100
5	2129	100
6	7923	100
0	8011	84

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)
#s(approx (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (-.f64 (log.f64 n) (/.f64 #s(literal -1/2 binary64) n)))
(-.f64 (log.f64 n) (/.f64 #s(literal -1/2 binary64) n))
(log.f64 n)
n
(/.f64 #s(literal -1/2 binary64) n)
#s(literal -1/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))
#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)
#s(approx (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (-.f64 (log.f64 n) (/.f64 #s(literal -1/2 binary64) n)))
(-.f64 (log.f64 n) (/.f64 #s(literal -1/2 binary64) n))
(log.f64 n)
n
(/.f64 #s(literal -1/2 binary64) n)
#s(literal -1/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))
#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)

localize118.0ms (1.1%)

Memory

8.8MiB live, 137.5MiB allocated; 23ms collecting garbage

Localize:

Found 9 expressions of interest:

New	Metric	Score
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	0.0078125	(-.f64 (log.f64 n) #s(literal -1 binary64))
accuracy	0.01171875	(-.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	(/.f64 #s(literal -1/2 binary64) n)
accuracy	0.0	(-.f64 (log.f64 n) (/.f64 #s(literal -1/2 binary64) n))
accuracy	0.0	(log.f64 n)
accuracy	0.0	#s(approx (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (-.f64 (log.f64 n) (/.f64 #s(literal -1/2 binary64) n)))
accuracy	63.00430934203734	#s(approx (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) #s(literal -1 binary64))

Samples

100.0ms

256×

valid

Compiler

Compiled 83 to 16 computations (80.7% saved)

Precisions

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

ival-log: 22.0ms (25.8% of total)

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

adjust: 17.0ms (20% of total)

ival-sub: 14.0ms (16.4% of total)

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

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

ival-div: 2.0ms (2.3% of total)

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

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

exact: 0.0ms (0% of total)

series21.0ms (0.2%)

Memory

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

Counts

8 → 29

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) (-.f64 (log.f64 n) (/.f64 #s(literal -1/2 binary64) n)))
(-.f64 (log.f64 n) (/.f64 #s(literal -1/2 binary64) n))
(log.f64 n)
(/.f64 #s(literal -1/2 binary64) n)
(-.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))

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)
(/ 1/2 n)
(/ (+ 1/2 (* n (log n))) n)
(log n)
(/ -1/2 n)
(* 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))
(* -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
7.0ms	n	@	-inf	((- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (- (log n) (/ -1/2 n)) (log n) (/ -1/2 n) (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (- (* (+ n 1) (log (+ n 1))) (* n (log n))) (- (log n) -1))
7.0ms	n	@	inf	((- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (- (log n) (/ -1/2 n)) (log n) (/ -1/2 n) (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (- (* (+ n 1) (log (+ n 1))) (* n (log n))) (- (log n) -1))
7.0ms	n	@	0	((- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (- (log n) (/ -1/2 n)) (log n) (/ -1/2 n) (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (- (* (+ n 1) (log (+ n 1))) (* n (log n))) (- (log n) -1))

Time

Variable

Point

Expression

7.0ms

-inf

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

7.0ms

inf

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

7.0ms

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

simplify331.0ms (3%)

Memory

9.2MiB live, 289.5MiB allocated; 63ms collecting garbage

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	85	327
1	233	305
2	744	293
3	2696	287
0	8342	275

Stop Event

1×	iter limit
1×	node limit

Counts

29 → 29

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)
(/ 1/2 n)
(/ (+ 1/2 (* n (log n))) n)
(log n)
(/ -1/2 n)
(* 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))
(* -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))
(/ 1/2 n)
(/.f64 #s(literal 1/2 binary64) n)
(/ (+ 1/2 (* n (log n))) n)
(-.f64 (log.f64 n) (/.f64 #s(literal -1/2 binary64) n))
(log n)
(log.f64 n)
(/ -1/2 n)
(/.f64 #s(literal -1/2 binary64) n)
(* 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))
(* -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)))

rewrite40.0ms (0.4%)

Memory

2.2MiB live, 49.1MiB allocated; 2ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	19	92
0	24	92
1	109	88
0	897	82

Stop Event

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

Counts

8 → 37

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) (-.f64 (log.f64 n) (/.f64 #s(literal -1/2 binary64) n)))
(-.f64 (log.f64 n) (/.f64 #s(literal -1/2 binary64) n))
(log.f64 n)
(/.f64 #s(literal -1/2 binary64) n)
(-.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))

Outputs
#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) (-.f64 (log.f64 n) (/.f64 #s(literal -1/2 binary64) n)))
(/.f64 (neg.f64 (-.f64 (pow.f64 (log.f64 n) #s(literal 2 binary64)) (pow.f64 (/.f64 #s(literal -1/2 binary64) n) #s(literal 2 binary64)))) (neg.f64 (+.f64 (/.f64 #s(literal -1/2 binary64) n) (log.f64 n))))
(/.f64 (neg.f64 (-.f64 (pow.f64 (log.f64 n) #s(literal 3 binary64)) (pow.f64 (/.f64 #s(literal -1/2 binary64) n) #s(literal 3 binary64)))) (neg.f64 (fma.f64 (/.f64 #s(literal -1/2 binary64) n) (+.f64 (/.f64 #s(literal -1/2 binary64) n) (log.f64 n)) (pow.f64 (log.f64 n) #s(literal 2 binary64)))))
(/.f64 (-.f64 (pow.f64 (log.f64 n) #s(literal 2 binary64)) (pow.f64 (/.f64 #s(literal -1/2 binary64) n) #s(literal 2 binary64))) (+.f64 (/.f64 #s(literal -1/2 binary64) n) (log.f64 n)))
(/.f64 (-.f64 (pow.f64 (log.f64 n) #s(literal 3 binary64)) (pow.f64 (/.f64 #s(literal -1/2 binary64) n) #s(literal 3 binary64))) (fma.f64 (/.f64 #s(literal -1/2 binary64) n) (+.f64 (/.f64 #s(literal -1/2 binary64) n) (log.f64 n)) (pow.f64 (log.f64 n) #s(literal 2 binary64))))
(-.f64 (/.f64 (pow.f64 (log.f64 n) #s(literal 2 binary64)) (+.f64 (/.f64 #s(literal -1/2 binary64) n) (log.f64 n))) (/.f64 (pow.f64 (/.f64 #s(literal -1/2 binary64) n) #s(literal 2 binary64)) (+.f64 (/.f64 #s(literal -1/2 binary64) n) (log.f64 n))))
(-.f64 (/.f64 (pow.f64 (log.f64 n) #s(literal 3 binary64)) (fma.f64 (/.f64 #s(literal -1/2 binary64) n) (+.f64 (/.f64 #s(literal -1/2 binary64) n) (log.f64 n)) (pow.f64 (log.f64 n) #s(literal 2 binary64)))) (/.f64 (pow.f64 (/.f64 #s(literal -1/2 binary64) n) #s(literal 3 binary64)) (fma.f64 (/.f64 #s(literal -1/2 binary64) n) (+.f64 (/.f64 #s(literal -1/2 binary64) n) (log.f64 n)) (pow.f64 (log.f64 n) #s(literal 2 binary64)))))
(-.f64 (log.f64 n) (/.f64 #s(literal -1/2 binary64) n))
(log.f64 n)
(/.f64 #s(literal 1/2 binary64) (neg.f64 n))
(/.f64 #s(literal -1/2 binary64) (neg.f64 (neg.f64 n)))
(/.f64 #s(literal -1/2 binary64) n)
(neg.f64 (/.f64 #s(literal 1/2 binary64) n))
(neg.f64 (/.f64 #s(literal -1/2 binary64) (neg.f64 n)))
(/.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))

eval9.0ms (0.1%)

Memory: -27.4MiB live, 19.6MiB allocated; 2ms collecting garbage
Compiler: Compiled 2 004 to 231 computations (88.5% saved)

prune2.0ms (0%)

Memory

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

Pruning

3 alts after pruning (2 fresh and 1 done)

	Pruned	Kept	Total
New	63	2	65
Fresh	0	0	0
Picked	2	1	3
Done	0	0	0
Total	65	3	68

Accuracy

100.0%

Counts

68 → 3

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))

▶

5.1%

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

✓

1.6%

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

Compiler

Compiled 61 to 38 computations (37.7% saved)

simplify1.1s (10%)

Memory

-13.7MiB live, 871.5MiB allocated; 159ms collecting garbage

Algorithm

1×	egg-herbie

Localize:

Found 5 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))
cost-diff	0	(/.f64 #s(literal 1/2 binary64) n)
cost-diff	0	#s(approx (- (log n) (/ -1/2 n)) (/.f64 #s(literal 1/2 binary64) n))
cost-diff	0	#s(approx (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) #s(approx (- (log n) (/ -1/2 n)) (/.f64 #s(literal 1/2 binary64) n)))

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	18	62
0	20	62
1	30	62
2	53	62
3	188	62
4	553	62
5	2122	62
0	8011	54

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(approx (- (log n) (/ -1/2 n)) (/.f64 #s(literal 1/2 binary64) n)))
#s(approx (- (log n) (/ -1/2 n)) (/.f64 #s(literal 1/2 binary64) n))
(/.f64 #s(literal 1/2 binary64) n)
#s(literal 1/2 binary64)
n
#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) #s(approx (- (log n) (/ -1/2 n)) (/.f64 #s(literal 1/2 binary64) n)))
#s(approx (- (log n) (/ -1/2 n)) (/.f64 #s(literal 1/2 binary64) n))
(/.f64 #s(literal 1/2 binary64) n)
#s(literal 1/2 binary64)
n
#s(approx (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (log.f64 n))
(log.f64 n)
n

localize124.0ms (1.1%)

Memory

31.7MiB live, 116.6MiB allocated; 18ms collecting garbage

Localize:

Found 5 expressions of interest:

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

Samples

113.0ms

256×

valid

Compiler

Compiled 46 to 16 computations (65.2% saved)

Precisions

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

ival-log: 27.0ms (33.3% of total)

ival-log1p: 19.0ms (23.4% of total)

adjust: 14.0ms (17.3% of total)

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

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

ival-div: 3.0ms (3.7% of total)

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

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

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

exact: 0.0ms (0% of total)

series35.0ms (0.3%)

Memory

-13.8MiB live, 46.2MiB allocated; 10ms collecting garbage

Counts

5 → 15

Calls

Call 1

Inputs
#s(approx (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) #s(approx (- (log n) (/ -1/2 n)) (/.f64 #s(literal 1/2 binary64) n)))
#s(approx (- (log n) (/ -1/2 n)) (/.f64 #s(literal 1/2 binary64) n))
(/.f64 #s(literal 1/2 binary64) n)
#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)
(/ 1/2 n)
(/ (+ 1/2 (* n (log n))) 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)))
(+ (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

20.0ms

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

7.0ms

inf

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

7.0ms

-inf

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

simplify688.0ms (6.2%)

Memory

-25.8MiB live, 662.9MiB allocated; 104ms collecting garbage

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	65	153
1	178	143
2	518	135
3	1787	132
4	6444	132
0	8101	126

Stop Event

1×	iter limit
1×	node limit

Counts

15 → 15

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)
(/ 1/2 n)
(/ (+ 1/2 (* n (log n))) 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)))
(+ (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)
(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))
(/ 1/2 n)
(/.f64 #s(literal 1/2 binary64) n)
(/ (+ 1/2 (* n (log n))) n)
(-.f64 (log.f64 n) (/.f64 #s(literal -1/2 binary64) n))
(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)))

rewrite69.0ms (0.6%)

Memory

11.7MiB live, 57.2MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	18	59
0	20	59
1	86	57
0	689	53

Stop Event

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

Counts

5 → 8

Calls

Call 1

Inputs
#s(approx (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) #s(approx (- (log n) (/ -1/2 n)) (/.f64 #s(literal 1/2 binary64) n)))
#s(approx (- (log n) (/ -1/2 n)) (/.f64 #s(literal 1/2 binary64) n))
(/.f64 #s(literal 1/2 binary64) n)
#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) #s(approx (- (log n) (/ -1/2 n)) (/.f64 #s(literal 1/2 binary64) n)))
#s(approx (- (log n) (/ -1/2 n)) (/.f64 #s(literal 1/2 binary64) n))
(/.f64 #s(literal 1/2 binary64) (neg.f64 (neg.f64 n)))
(/.f64 #s(literal 1/2 binary64) n)
(/.f64 #s(literal -1/2 binary64) (neg.f64 n))
(neg.f64 (/.f64 #s(literal -1/2 binary64) n))
#s(approx (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (log.f64 n))
(log.f64 n)

eval2.0ms (0%)

Memory: 6.2MiB live, 6.2MiB allocated; 0ms collecting garbage
Compiler: Compiled 535 to 78 computations (85.4% saved)

prune11.0ms (0.1%)

Memory

-26.5MiB live, 20.0MiB allocated; 9ms collecting garbage

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	21	0	21
Fresh	0	0	0
Picked	0	2	2
Done	0	1	1
Total	21	3	24

Accuracy

100.0%

Counts

24 → 3

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))

✓

5.1%

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

✓

1.6%

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

Compiler

Compiled 179 to 72 computations (59.8% saved)

regimes6.0ms (0.1%)

Memory

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

Counts

6 → 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) #s(approx (- (log n) (/ -1/2 n)) (/.f64 #s(literal 1/2 binary64) n)))
#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))
#s(approx (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1) (-.f64 (log.f64 n) (/.f64 #s(literal -1/2 binary64) n)))
(-.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

(-.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))

2.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
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)

regimes14.0ms (0.1%)

Memory

-25.6MiB live, 16.3MiB allocated; 13ms collecting garbage

Counts

2 → 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) #s(approx (- (log n) (/ -1/2 n)) (/.f64 #s(literal 1/2 binary64) n)))

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

Calls

3 calls:

11.0ms

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
5.1%	1	`(-.f64 (.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64)))) (.f64 n (log.f64 n)))`
5.1%	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))`
5.1%	1	`n`

Compiler

Compiled 29 to 18 computations (37.9% saved)

regimes3.0ms (0%)

Memory

13.3MiB live, 13.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 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
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)

simplify43.0ms (0.4%)

Memory

-11.1MiB live, 32.2MiB allocated; 14ms collecting garbage

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	20	61
1	30	61
2	53	61
3	191	61
4	655	61
5	3597	61

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(approx (- (log n) (/ -1/2 n)) (/.f64 #s(literal 1/2 binary64) 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(approx (- (log n) (/ -1/2 n)) (/.f64 #s(literal 1/2 binary64) n)))

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

derivations480.0ms (4.3%)

Memory

5.9MiB live, 239.0MiB allocated; 66ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	154	649
1	517	581
2	1878	549
0	8165	520
0	85	327
1	233	305
2	744	293
3	2696	287
0	8342	275

Stop Event

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

Compiler

Compiled 61 to 20 computations (67.2% saved)

preprocess94.0ms (0.8%)

Memory: 22.7MiB live, 125.8MiB allocated; 10ms collecting garbage
Compiler: Compiled 200 to 92 computations (54% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample3.6s (32.4%)

explain485.0ms (4.4%)

preprocess944.0ms (8.5%)

eval0.0ms (0%)

prune0.0ms (0%)

simplify1.0s (9.3%)

localize148.0ms (1.3%)

series75.0ms (0.7%)

simplify352.0ms (3.2%)

rewrite41.0ms (0.4%)

eval12.0ms (0.1%)

prune9.0ms (0.1%)

simplify1.2s (10.9%)

localize118.0ms (1.1%)

series21.0ms (0.2%)

simplify331.0ms (3%)

rewrite40.0ms (0.4%)

eval9.0ms (0.1%)

prune2.0ms (0%)

simplify1.1s (10%)

localize124.0ms (1.1%)

series35.0ms (0.3%)

simplify688.0ms (6.2%)

rewrite69.0ms (0.6%)

eval2.0ms (0%)

prune11.0ms (0.1%)

regimes6.0ms (0.1%)

regimes14.0ms (0.1%)

regimes3.0ms (0%)

simplify43.0ms (0.4%)

derivations480.0ms (4.3%)

preprocess94.0ms (0.8%)

end0.0ms (0%)

Profiling