Metrics for Diagrams.Tangent:$catParam from diagrams-lib-1.3.0.3, F

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

Algorithm

1×

Search

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

Compiler

Compiled 7 to 6 computations (14.3% saved)

sample737.0ms (52.2%)

Memory

-6.1MiB live, 1 065.4MiB allocated; 235ms collecting garbage

Samples

464.0ms

8 256×

valid

Precisions

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

ival-mult: 169.0ms (90.2% of total)

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

exact: 6.0ms (3.2% of total)

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

adjust: 2.0ms (1.1% of total)

Bogosity

explain61.0ms (4.3%)

Memory

20.5MiB live, 77.6MiB allocated; 8ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`(.f64 (.f64 x #s(literal 3 binary64)) x)`
-	-	`#s(literal 3 binary64)`
-	-	`(*.f64 x #s(literal 3 binary64))`
-	-	`x`

Confusion

	Predicted +	Predicted -
+	0	0
-	0	256

Precision

0/0

Recall

0/0

Confusion?

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

Precision?

0/0

Recall?

0/0

Freqs

test

number	freq
0	256

Total Confusion?

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

Precision?

0/0

Recall?

0/0

Samples

38.0ms

512×

valid

Compiler

Compiled 29 to 16 computations (44.8% saved)

Precisions

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

ival-mult: 27.0ms (95.5% of total)

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

adjust: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

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

preprocess21.0ms (1.5%)

Memory

-0.4MiB live, 44.4MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	15
1	17	10
2	45	10
3	65	10
4	81	10
5	118	10
6	138	10
0	4	5
0	6	5
1	9	5
2	12	5
3	16	5
4	37	5
5	73	5
6	105	5
7	123	5
8	123	5
0	123	5

Stop Event

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

Calls

Call 1

Inputs
(.f64 (.f64 x #s(literal 3 binary64)) x)

Outputs
(.f64 (.f64 x #s(literal 3 binary64)) x)
(.f64 (.f64 #s(literal 3 binary64) x) x)

Symmetry

(abs x)

Compiler

Compiled 5 to 4 computations (20% 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

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

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	99.8%	(.f64 (.f64 x #s(literal 3 binary64)) x)

Compiler

Compiled 5 to 4 computations (20% saved)

series3.0ms (0.2%)

Memory

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

Counts

4 → 3

Calls

Call 1

Inputs
(.f64 (.f64 x #s(literal 3 binary64)) x)
(*.f64 x #s(literal 3 binary64))
x
#s(literal 3 binary64)

Outputs
#s(approx (* (* x 3) x) #s(hole binary64 (* 3 (pow x 2))))
#s(approx (* x 3) #s(hole binary64 (* 3 x)))
#s(approx x #s(hole binary64 x))

Calls

3 calls:

Time	Variable		Point	Expression
1.0ms	x	@	-inf	((* (* x 3) x) (* x 3) x 3)
1.0ms	x	@	inf	((* (* x 3) x) (* x 3) x 3)
1.0ms	x	@	0	((* (* x 3) x) (* x 3) x 3)

simplify215.0ms (15.2%)

Memory

-26.5MiB live, 164.9MiB allocated; 15ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	11	21
1	18	21
2	28	21
3	54	21
4	109	21
5	220	21
6	764	21
7	4776	21
0	8418	21

Stop Event

1×	iter limit
1×	node limit

Counts

3 → 3

Calls

Call 1

Inputs
#s(approx (* (* x 3) x) #s(hole binary64 (* 3 (pow x 2))))
#s(approx (* x 3) #s(hole binary64 (* 3 x)))
#s(approx x #s(hole binary64 x))

Outputs
#s(approx (* (* x 3) x) #s(hole binary64 (* 3 (pow x 2))))
#s(approx (* (* x 3) x) (.f64 (.f64 x x) #s(literal 3 binary64)))
#s(approx (* x 3) #s(hole binary64 (* 3 x)))
#s(approx (* x 3) (*.f64 #s(literal 3 binary64) x))
#s(approx x #s(hole binary64 x))
#s(approx x x)

rewrite49.0ms (3.5%)

Memory

22.7MiB live, 69.6MiB allocated; 2ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	10
0	6	10
1	9	10
2	12	10
3	18	10
4	49	10
0	169	10

Stop Event

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

Counts

4 → 13

Calls

Call 1

Inputs
(.f64 (.f64 x #s(literal 3 binary64)) x)
(*.f64 x #s(literal 3 binary64))
x
#s(literal 3 binary64)

Outputs
(.f64 (.f64 (neg.f64 x) #s(literal 3 binary64)) (neg.f64 x))
(.f64 (.f64 x x) #s(literal 3 binary64))
(.f64 (neg.f64 x) (.f64 (neg.f64 x) #s(literal 3 binary64)))
(.f64 (.f64 #s(literal 3 binary64) x) x)
(.f64 #s(literal 3 binary64) (.f64 x x))
(.f64 x (.f64 #s(literal 3 binary64) x))
(neg.f64 (.f64 (.f64 (neg.f64 x) #s(literal 3 binary64)) x))
(neg.f64 (.f64 x (.f64 (neg.f64 x) #s(literal 3 binary64))))
(neg.f64 (.f64 (.f64 x x) #s(literal 3 binary64)))
(*.f64 #s(literal 3 binary64) x)
(*.f64 x #s(literal 3 binary64))
x
#s(literal 3 binary64)

eval1.0ms (0.1%)

Memory: 4.4MiB live, 4.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 113 to 29 computations (74.3% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

2 alts after pruning (1 fresh and 1 done)

	Pruned	Kept	Total
New	17	1	18
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	17	2	19

Accuracy

99.9%

Counts

19 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	99.7%	(.f64 (.f64 x x) #s(literal 3 binary64))
✓	99.8%	(.f64 (.f64 x #s(literal 3 binary64)) x)

Compiler

Compiled 10 to 8 computations (20% saved)

series17.0ms (1.2%)

Memory

-41.2MiB live, 5.7MiB allocated; 2ms collecting garbage

Counts

4 → 3

Calls

Call 1

Inputs
(.f64 (.f64 x x) #s(literal 3 binary64))
(*.f64 x x)
x
#s(literal 3 binary64)

Outputs
#s(approx (* (* x x) 3) #s(hole binary64 (* 3 (pow x 2))))
#s(approx (* x x) #s(hole binary64 (pow x 2)))
#s(approx x #s(hole binary64 x))

Calls

3 calls:

Time	Variable		Point	Expression
16.0ms	x	@	-inf	((* (* x x) 3) (* x x) x 3)
1.0ms	x	@	inf	((* (* x x) 3) (* x x) x 3)
0.0ms	x	@	0	((* (* x x) 3) (* x x) x 3)

simplify229.0ms (16.2%)

Memory

35.4MiB live, 188.6MiB allocated; 22ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	10	21
1	21	21
2	50	21
3	91	21
4	142	21
5	239	21
6	769	21
7	4789	21
0	8431	21

Stop Event

1×	iter limit
1×	node limit

Counts

3 → 3

Calls

Call 1

Inputs
#s(approx (* (* x x) 3) #s(hole binary64 (* 3 (pow x 2))))
#s(approx (* x x) #s(hole binary64 (pow x 2)))
#s(approx x #s(hole binary64 x))

Outputs
#s(approx (* (* x x) 3) #s(hole binary64 (* 3 (pow x 2))))
#s(approx (* (* x x) 3) (.f64 (.f64 x x) #s(literal 3 binary64)))
#s(approx (* x x) #s(hole binary64 (pow x 2)))
#s(approx (* x x) (*.f64 x x))
#s(approx x #s(hole binary64 x))
#s(approx x x)

rewrite46.0ms (3.2%)

Memory

-23.7MiB live, 71.3MiB allocated; 18ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	10
0	6	10
1	15	10
2	49	10
0	173	10

Stop Event

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

Counts

4 → 26

Calls

Call 1

Inputs
(.f64 (.f64 x x) #s(literal 3 binary64))
(*.f64 x x)
x
#s(literal 3 binary64)

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

eval3.0ms (0.2%)

Memory: 7.4MiB live, 7.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 211 to 66 computations (68.7% saved)

prune3.0ms (0.2%)

Memory

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

Pruning

2 alts after pruning (0 fresh and 2 done)

	Pruned	Kept	Total
New	31	0	31
Fresh	0	0	0
Picked	0	1	1
Done	0	1	1
Total	31	2	33

Accuracy

99.9%

Counts

33 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	99.7%	(.f64 (.f64 x x) #s(literal 3 binary64))
✓	99.8%	(.f64 (.f64 x #s(literal 3 binary64)) x)

Compiler

Compiled 20 to 14 computations (30% saved)

regimes3.0ms (0.2%)

Memory

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

Accuracy

Total -0.1b remaining (-109.7%)

Threshold costs -0.1b (-109.7%)

Counts

2 → 1

Calls

Call 1

Inputs
(.f64 (.f64 x #s(literal 3 binary64)) x)
(.f64 (.f64 x x) #s(literal 3 binary64))

Outputs
(.f64 (.f64 x #s(literal 3 binary64)) x)

Calls

2 calls:

1.0ms	x
1.0ms	(.f64 (.f64 x #s(literal 3 binary64)) x)

Results

Accuracy	Segments	Branch
99.8%	1	`(.f64 (.f64 x #s(literal 3 binary64)) x)`
99.8%	1	`x`

Compiler

Compiled 6 to 5 computations (16.7% saved)

simplify13.0ms (0.9%)

Memory

-21.2MiB live, 24.3MiB allocated; 5ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	5

Stop Event

1×

saturated

Calls

Call 1

Inputs
(.f64 (.f64 x #s(literal 3 binary64)) x)

Outputs
(.f64 (.f64 x #s(literal 3 binary64)) x)

derivations0.0ms (0%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 5 to 4 computations (20% saved)

preprocess10.0ms (0.7%)

Memory: 25.6MiB live, 25.6MiB allocated; 0ms collecting garbage
Remove: (abs x)
Compiler: Compiled 40 to 32 computations (20% saved)

end0.0ms (0%)

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

Iter	Nodes	Cost
0	6	15
1	17	10
2	45	10
3	65	10
4	81	10
5	118	10
6	138	10
0	4	5
0	6	5
1	9	5
2	12	5
3	16	5
4	37	5
5	73	5
6	105	5
7	123	5
8	123	5
0	123	5

Iter	Nodes	Cost
0	6	15
1	17	10
2	45	10
3	65	10
4	81	10
5	118	10
6	138	10
0	4	5
0	6	5
1	9	5
2	12	5
3	16	5
4	37	5
5	73	5
6	105	5
7	123	5
8	123	5
0	123	5

start0.0ms (0%)

analyze0.0ms (0%)

sample737.0ms (52.2%)

explain61.0ms (4.3%)

preprocess21.0ms (1.5%)

eval0.0ms (0%)

prune0.0ms (0%)

series3.0ms (0.2%)

simplify215.0ms (15.2%)

rewrite49.0ms (3.5%)

eval1.0ms (0.1%)

prune2.0ms (0.2%)

series17.0ms (1.2%)

simplify229.0ms (16.2%)

rewrite46.0ms (3.2%)

eval3.0ms (0.2%)

prune3.0ms (0.2%)

regimes3.0ms (0.2%)

simplify13.0ms (0.9%)

derivations0.0ms (0%)

preprocess10.0ms (0.7%)

end0.0ms (0%)

Profiling

Iter	Nodes	Cost
0	6	15
1	17	10
2	45	10
3	65	10
4	81	10
5	118	10
6	138	10
0	4	5
0	6	5
1	9	5
2	12	5
3	16	5
4	37	5
5	73	5
6	105	5
7	123	5
8	123	5
0	123	5