Metrics for Exp of sum of logs

start0.0ms (0%)

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

analyze1.0ms (0%)

Memory

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

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	99.9%	0.1%	0%	0%	0%	0
0%	0%	99.9%	0.1%	0%	0%	0%	1
0%	0%	50%	0.1%	0%	50%	0%	2
100%	25%	0%	0.1%	0%	74.9%	0%	3

Compiler

Compiled 8 to 8 computations (0% saved)

sample990.0ms (62.4%)

Memory

64.6MiB live, 794.9MiB allocated; 954ms collecting garbage

Samples

512.0ms	8 243×	0	valid
2.0ms	13×	1	valid

Precisions

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

ival-log: 198.0ms (56.2% of total)

ival-exp: 130.0ms (36.9% of total)

ival-add!: 22.0ms (6.2% of total)

adjust: 2.0ms (0.6% of total)

Bogosity

preprocess78.0ms (4.9%)

Memory

-21.3MiB live, 73.4MiB allocated; 16ms collecting garbage

Iterations

Useful iterations: 3 (0.0ms)

Iter	Nodes	Cost
0	18	30
1	68	18
2	332	18
3	837	6

Stop Event

1×	iter-limit
1×	node-limit

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	92.1%	(exp.f64 (+.f64 (log.f64 a) (log.f64 b)))

Symmetry

(abs a)

(abs b)

(negabs a)

(negabs b)

(sort a b)

Compiler

Compiled 12 to 12 computations (0% saved)

series133.0ms (8.4%)

Memory

1.7MiB live, 183.0MiB allocated; 40ms collecting garbage

Counts

6 → 18

Calls

Call 1

Inputs
(exp.f64 (+.f64 (log.f64 a) (log.f64 b)))
(+.f64 (log.f64 a) (log.f64 b))
(log.f64 a)
a
(log.f64 b)
b

Outputs
#s(approx (exp (+ (log a) (log b))) #s(hole binary64 (exp (+ (log a) (log b)))))
#s(approx (+ (log a) (log b)) #s(hole binary64 (+ (log a) (log b))))
#s(approx (log a) #s(hole binary64 (log a)))
#s(approx a #s(hole binary64 a))
#s(approx (exp (+ (log a) (log b))) #s(hole binary64 (exp (+ (log b) (* -1 (log (/ 1 a)))))))
#s(approx (+ (log a) (log b)) #s(hole binary64 (+ (log b) (* -1 (log (/ 1 a))))))
#s(approx (log a) #s(hole binary64 (* -1 (log (/ 1 a)))))
#s(approx (exp (+ (log a) (log b))) #s(hole binary64 (exp (+ (log -1) (+ (log b) (* -1 (log (/ -1 a))))))))
#s(approx (+ (log a) (log b)) #s(hole binary64 (+ (log -1) (+ (log b) (* -1 (log (/ -1 a)))))))
#s(approx (log a) #s(hole binary64 (+ (log -1) (* -1 (log (/ -1 a))))))
#s(approx (log b) #s(hole binary64 (log b)))
#s(approx b #s(hole binary64 b))
#s(approx (exp (+ (log a) (log b))) #s(hole binary64 (exp (+ (log a) (* -1 (log (/ 1 b)))))))
#s(approx (+ (log a) (log b)) #s(hole binary64 (+ (log a) (* -1 (log (/ 1 b))))))
#s(approx (log b) #s(hole binary64 (* -1 (log (/ 1 b)))))
#s(approx (exp (+ (log a) (log b))) #s(hole binary64 (exp (+ (log -1) (+ (log a) (* -1 (log (/ -1 b))))))))
#s(approx (+ (log a) (log b)) #s(hole binary64 (+ (log -1) (+ (log a) (* -1 (log (/ -1 b)))))))
#s(approx (log b) #s(hole binary64 (+ (log -1) (* -1 (log (/ -1 b))))))

Calls

6 calls:

Time	Variable		Point	Expression
42.0ms	a	@	0	((exp (+ (log a) (log b))) (+ (log a) (log b)) (log a) a (log b) b)
29.0ms	b	@	0	((exp (+ (log a) (log b))) (+ (log a) (log b)) (log a) a (log b) b)
17.0ms	a	@	-inf	((exp (+ (log a) (log b))) (+ (log a) (log b)) (log a) a (log b) b)
17.0ms	b	@	-inf	((exp (+ (log a) (log b))) (+ (log a) (log b)) (log a) a (log b) b)
15.0ms	a	@	inf	((exp (+ (log a) (log b))) (+ (log a) (log b)) (log a) a (log b) b)

rewrite66.0ms (4.2%)

Memory

0.9MiB live, 46.1MiB allocated; 11ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	55	239
0	59	201
0	290	201
1	758	201

Stop Event

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

Counts

24 → 32

Calls

Call 1

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

Outputs
(*.f64 (exp.f64 (log.f64 a)) (exp.f64 (log.f64 b)))
(fabs.f64 (exp.f64 (log.f64 (*.f64 a b))))
(exp.f64 (log.f64 (*.f64 a b)))
(+.f64 (cosh.f64 (log.f64 (.f64 a b))) (sinh.f64 (log.f64 (.f64 a b))))
(-.f64 (log.f64 a) (neg.f64 (log.f64 b)))
(+.f64 (log.f64 b) (log.f64 a))
(+.f64 (log.f64 a) (log.f64 b))
(log.f64 (*.f64 a b))
(log.f64 (fabs.f64 a))
(log.f64 a)
a
(log.f64 (fabs.f64 b))
(log.f64 b)
b
#s(approx (exp (+ (log a) (log b))) (exp.f64 (log.f64 (*.f64 a b))))
#s(approx (+ (log a) (log b)) (log.f64 (*.f64 a b)))
#s(approx (log a) (log.f64 a))
#s(approx a a)
#s(approx (exp (+ (log a) (log b))) (exp.f64 (+.f64 (neg.f64 (neg.f64 (log.f64 a))) (log.f64 b))))
#s(approx (+ (log a) (log b)) (+.f64 (neg.f64 (neg.f64 (log.f64 a))) (log.f64 b)))
#s(approx (log a) (neg.f64 (neg.f64 (log.f64 a))))
#s(approx (exp (+ (log a) (log b))) (exp.f64 (+.f64 (+.f64 (neg.f64 (log.f64 (/.f64 #s(literal -1 binary64) a))) (log.f64 b)) #s(literal 0 binary64))))
#s(approx (+ (log a) (log b)) (+.f64 (+.f64 (neg.f64 (log.f64 (/.f64 #s(literal -1 binary64) a))) (log.f64 b)) #s(literal 0 binary64)))
#s(approx (log a) (+.f64 (neg.f64 (log.f64 (/.f64 #s(literal -1 binary64) a))) #s(literal 0 binary64)))
#s(approx (log b) (log.f64 b))
#s(approx b b)
#s(approx (exp (+ (log a) (log b))) (exp.f64 (+.f64 (neg.f64 (neg.f64 (log.f64 b))) (log.f64 a))))
#s(approx (+ (log a) (log b)) (+.f64 (neg.f64 (neg.f64 (log.f64 b))) (log.f64 a)))
#s(approx (log b) (neg.f64 (neg.f64 (log.f64 b))))
#s(approx (exp (+ (log a) (log b))) (exp.f64 (+.f64 (+.f64 (neg.f64 (log.f64 (/.f64 #s(literal -1 binary64) b))) (log.f64 a)) #s(literal 0 binary64))))
#s(approx (+ (log a) (log b)) (+.f64 (+.f64 (neg.f64 (log.f64 (/.f64 #s(literal -1 binary64) b))) (log.f64 a)) #s(literal 0 binary64)))
#s(approx (log b) (+.f64 (neg.f64 (log.f64 (/.f64 #s(literal -1 binary64) b))) #s(literal 0 binary64)))

eval2.0ms (0.1%)

Memory: 4.3MiB live, 4.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 196 to 95 computations (51.5% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

2 alts after pruning (2 fresh and 0 done)

	Pruned	Kept	Total
New	25	2	27
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	26	2	28

Accuracy

93.9%

Counts

28 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	92.4%	(*.f64 (exp.f64 (log.f64 a)) (exp.f64 (log.f64 b)))
▶	93.4%	(exp.f64 (log.f64 (*.f64 a b)))

Compiler

Compiled 12 to 12 computations (0% saved)

series194.0ms (12.2%)

Memory

6.8MiB live, 156.5MiB allocated; 42ms collecting garbage

Counts

10 → 14

Calls

Call 1

Inputs
(exp.f64 (log.f64 (*.f64 a b)))
(log.f64 (*.f64 a b))
(*.f64 a b)
a
b
(*.f64 (exp.f64 (log.f64 a)) (exp.f64 (log.f64 b)))
(exp.f64 (log.f64 a))
(log.f64 a)
(exp.f64 (log.f64 b))
(log.f64 b)

Outputs
#s(approx (exp (log (* a b))) #s(hole binary64 (* a b)))
#s(approx (log (* a b)) #s(hole binary64 (+ (log a) (log b))))
#s(approx a #s(hole binary64 a))
#s(approx (log a) #s(hole binary64 (log a)))
#s(approx (log (* a b)) #s(hole binary64 (+ (log b) (* -1 (log (/ 1 a))))))
#s(approx (log a) #s(hole binary64 (* -1 (log (/ 1 a)))))
#s(approx (log (* a b)) #s(hole binary64 (+ (log (* -1 b)) (* -1 (log (/ -1 a))))))
#s(approx (log a) #s(hole binary64 (+ (log -1) (* -1 (log (/ -1 a))))))
#s(approx b #s(hole binary64 b))
#s(approx (log b) #s(hole binary64 (log b)))
#s(approx (log (* a b)) #s(hole binary64 (+ (log a) (* -1 (log (/ 1 b))))))
#s(approx (log b) #s(hole binary64 (* -1 (log (/ 1 b)))))
#s(approx (log (* a b)) #s(hole binary64 (+ (log (* -1 a)) (* -1 (log (/ -1 b))))))
#s(approx (log b) #s(hole binary64 (+ (log -1) (* -1 (log (/ -1 b))))))

Calls

6 calls:

Time	Variable		Point	Expression
87.0ms	b	@	0	((exp (log (* a b))) (log (* a b)) (* a b) a b (* (exp (log a)) (exp (log b))) (exp (log a)) (log a) (exp (log b)) (log b))
34.0ms	a	@	-inf	((exp (log (* a b))) (log (* a b)) (* a b) a b (* (exp (log a)) (exp (log b))) (exp (log a)) (log a) (exp (log b)) (log b))
24.0ms	b	@	-inf	((exp (log (* a b))) (log (* a b)) (* a b) a b (* (exp (log a)) (exp (log b))) (exp (log a)) (log a) (exp (log b)) (log b))
23.0ms	a	@	inf	((exp (log (* a b))) (log (* a b)) (* a b) a b (* (exp (log a)) (exp (log b))) (exp (log a)) (log a) (exp (log b)) (log b))
13.0ms	b	@	inf	((exp (log (* a b))) (log (* a b)) (* a b) a b (* (exp (log a)) (exp (log b))) (exp (log a)) (log a) (exp (log b)) (log b))

rewrite34.0ms (2.1%)

Memory

-8.1MiB live, 34.0MiB allocated; 11ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	55	168
0	65	139
0	265	139
1	650	139

Stop Event

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

Counts

24 → 39

Calls

Call 1

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

Outputs
(*.f64 b a)
(*.f64 a b)
(fabs.f64 (*.f64 b a))
(exp.f64 (log.f64 (*.f64 b a)))
(+.f64 (cosh.f64 (log.f64 (.f64 b a))) (sinh.f64 (log.f64 (.f64 b a))))
(-.f64 (log.f64 a) (neg.f64 (log.f64 b)))
(+.f64 (log.f64 b) (log.f64 a))
(+.f64 (log.f64 a) (log.f64 b))
(log.f64 (*.f64 b a))
(*.f64 b a)
(*.f64 a b)
(fabs.f64 (*.f64 b a))
(exp.f64 (log.f64 (*.f64 b a)))
(+.f64 (cosh.f64 (log.f64 (.f64 b a))) (sinh.f64 (log.f64 (.f64 b a))))
a
b
(*.f64 b a)
(*.f64 a b)
(fabs.f64 (*.f64 b a))
(exp.f64 (log.f64 (*.f64 b a)))
(+.f64 (cosh.f64 (log.f64 (.f64 b a))) (sinh.f64 (log.f64 (.f64 b a))))
a
(log.f64 a)
b
(log.f64 b)
#s(approx (exp (log (* a b))) (*.f64 b a))
#s(approx (log (* a b)) (log.f64 (*.f64 b a)))
#s(approx a a)
#s(approx (log a) (log.f64 a))
#s(approx (log (* a b)) (+.f64 (neg.f64 (neg.f64 (log.f64 a))) (log.f64 b)))
#s(approx (log a) (neg.f64 (neg.f64 (log.f64 a))))
#s(approx (log (* a b)) (+.f64 (neg.f64 (log.f64 (/.f64 #s(literal -1 binary64) a))) (log.f64 (neg.f64 b))))
#s(approx (log a) (+.f64 #s(literal 0 binary64) (neg.f64 (log.f64 (/.f64 #s(literal -1 binary64) a)))))
#s(approx b b)
#s(approx (log b) (log.f64 b))
#s(approx (log (* a b)) (+.f64 (neg.f64 (neg.f64 (log.f64 b))) (log.f64 a)))
#s(approx (log b) (neg.f64 (neg.f64 (log.f64 b))))
#s(approx (log (* a b)) (+.f64 (neg.f64 (log.f64 (/.f64 #s(literal -1 binary64) b))) (log.f64 (neg.f64 a))))
#s(approx (log b) (+.f64 (neg.f64 (log.f64 (/.f64 #s(literal -1 binary64) b))) #s(literal 0 binary64)))

eval2.0ms (0.1%)

Memory: 5.5MiB live, 5.5MiB allocated; 0ms collecting garbage
Compiler: Compiled 143 to 90 computations (37.1% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	24	1	25
Fresh	0	0	0
Picked	2	0	2
Done	0	0	0
Total	26	1	27

Accuracy

100.0%

Counts

27 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(*.f64 b a)

Compiler

Compiled 3 to 3 computations (0% saved)

series2.0ms (0.1%)

Memory

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

Counts

3 → 3

Calls

Call 1

Inputs
(*.f64 b a)
b
a

Outputs
#s(approx (* b a) #s(hole binary64 (* a b)))
#s(approx a #s(hole binary64 a))
#s(approx b #s(hole binary64 b))

Calls

6 calls:

Time	Variable		Point	Expression
1.0ms	a	@	-inf	((* b a) b a)
0.0ms	b	@	-inf	((* b a) b a)
0.0ms	a	@	inf	((* b a) b a)
0.0ms	b	@	inf	((* b a) b a)
0.0ms	a	@	0	((* b a) b a)

rewrite6.0ms (0.4%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	8	18
0	8	18
1	9	18
0	9	18
1	12	18

Stop Event

1×	saturated
1×	saturated
1×	iter-limit

Counts

6 → 7

Calls

Call 1

Inputs
(*.f64 b a)
b
a
#s(approx (* b a) #s(hole binary64 (* a b)))
#s(approx a #s(hole binary64 a))
#s(approx b #s(hole binary64 b))

Outputs
(*.f64 a b)
(*.f64 b a)
b
a
#s(approx (* b a) (*.f64 a b))
#s(approx a a)
#s(approx b b)

eval0.0ms (0%)

Memory: 0.8MiB live, 0.8MiB allocated; 0ms collecting garbage
Compiler: Compiled 10 to 9 computations (10% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	4	0	4
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	4	1	5

Accuracy

100.0%

Counts

5 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(*.f64 b a)

Compiler

Compiled 18 to 16 computations (11.1% saved)

regimes15.0ms (0.9%)

Memory

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

Accuracy

Total -5.2b remaining (-∞%)

Threshold costs -5.2b (-∞%)

Counts

4 → 1

Calls

Call 1

Inputs
(*.f64 b a)
(exp.f64 (log.f64 (*.f64 a b)))
(exp.f64 (+.f64 (log.f64 a) (log.f64 b)))
(*.f64 (exp.f64 (log.f64 a)) (exp.f64 (log.f64 b)))

Outputs
(*.f64 b a)

Calls

6 calls:

7.0ms	b
2.0ms	a
2.0ms	(+.f64 (log.f64 a) (log.f64 b))
2.0ms	(log.f64 a)
2.0ms	(log.f64 b)

Results

Accuracy	Segments	Branch
100.0%	1	`(log.f64 b)`
100.0%	1	`(log.f64 a)`
100.0%	1	`(+.f64 (log.f64 a) (log.f64 b))`
100.0%	1	`(exp.f64 (+.f64 (log.f64 a) (log.f64 b)))`
100.0%	1	`a`
100.0%	1	`b`

Compiler

Compiled 17 to 21 computations (-23.5% saved)

derivations2.0ms (0.1%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 3 to 3 computations (0% saved)

preprocess58.0ms (3.6%)

Memory

-10.9MiB live, 45.0MiB allocated; 15ms collecting garbage

Remove

(sort a b)

(negabs b)

(negabs a)

(abs b)

(abs a)

Compiler

Compiled 42 to 42 computations (0% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze1.0ms (0%)

sample990.0ms (62.4%)

preprocess78.0ms (4.9%)

series133.0ms (8.4%)

rewrite66.0ms (4.2%)

eval2.0ms (0.1%)

prune1.0ms (0.1%)

series194.0ms (12.2%)

rewrite34.0ms (2.1%)

eval2.0ms (0.1%)

prune1.0ms (0.1%)

series2.0ms (0.1%)

rewrite6.0ms (0.4%)

eval0.0ms (0%)

prune1.0ms (0.1%)

regimes15.0ms (0.9%)

derivations2.0ms (0.1%)

preprocess58.0ms (3.6%)

end0.0ms (0%)

Profiling