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

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

sample853.0ms (57.4%)

Memory

-0.3MiB live, 1 079.7MiB allocated; 227ms collecting garbage

Samples

521.0ms

8 256×

valid

Precisions

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

ival-mult: 263.0ms (93.5% of total)

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

exact: 6.0ms (2.1% of total)

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

adjust: 2.0ms (0.7% of total)

Bogosity

explain45.0ms (3%)

Memory

17.8MiB live, 110.7MiB 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

19.0ms

512×

valid

Compiler

Compiled 29 to 16 computations (44.8% saved)

Precisions

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

ival-mult: 8.0ms (88.9% 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)

preprocess19.0ms (1.3%)

Memory

-8.2MiB live, 41.1MiB allocated; 6ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	8	18
1	21	15
2	49	15
3	70	15
4	85	15
5	123	15
6	145	15
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.2MiB live, 0.2MiB 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
▶	99.7%	(.f64 (.f64 x #s(literal 3 binary64)) x)

Compiler

Compiled 5 to 4 computations (20% saved)

simplify5.0ms (0.4%)

Memory

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

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
cost-diff	0	(*.f64 x #s(literal 3 binary64))
cost-diff	0	(.f64 (.f64 x #s(literal 3 binary64)) x)

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	10
0	6	10
1	9	10
2	12	10
3	16	10
4	37	10
5	73	10
6	105	10
7	123	10
8	123	10
0	123	10

Stop Event

1×	iter limit
1×	saturated
1×	iter limit

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 x #s(literal 3 binary64)) x)
(.f64 (.f64 #s(literal 3 binary64) x) x)
(*.f64 x #s(literal 3 binary64))
(*.f64 #s(literal 3 binary64) x)
x
#s(literal 3 binary64)

localize15.0ms (1%)

Memory

-14.1MiB live, 32.2MiB allocated; 3ms collecting garbage

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
accuracy	0.0	(*.f64 x #s(literal 3 binary64))
accuracy	0.1796875	(.f64 (.f64 x #s(literal 3 binary64)) x)

Samples

10.0ms

256×

valid

Compiler

Compiled 12 to 6 computations (50% saved)

Precisions

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

ival-mult: 4.0ms (82.4% 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)

series2.0ms (0.2%)

Memory

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

Counts

2 → 2

Calls

Call 1

Inputs
(.f64 (.f64 x #s(literal 3 binary64)) x)
(*.f64 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)))

Calls

3 calls:

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

simplify154.0ms (10.4%)

Memory

-0.1MiB live, 146.0MiB allocated; 31ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	10	18
1	17	18
2	27	18
3	53	18
4	108	18
5	219	18
6	763	18
7	4775	18
0	8417	18

Stop Event

1×	iter limit
1×	node limit

Counts

2 → 2

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

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

rewrite38.0ms (2.6%)

Memory

20.5MiB live, 64.3MiB allocated; 9ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

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

Stop Event

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

Counts

2 → 11

Calls

Call 1

Inputs
(.f64 (.f64 x #s(literal 3 binary64)) x)
(*.f64 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))

eval1.0ms (0.1%)

Memory: 2.7MiB live, 2.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 84 to 25 computations (70.2% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

2 alts after pruning (1 fresh and 1 done)

	Pruned	Kept	Total
New	12	1	13
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	12	2	14

Accuracy

99.9%

Counts

14 → 2

Alt Table

Click to see full alt table

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

Compiler

Compiled 10 to 8 computations (20% saved)

simplify10.0ms (0.7%)

Memory

-33.5MiB live, 11.0MiB allocated; 10ms collecting garbage

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
cost-diff	0	(*.f64 x x)
cost-diff	0	(.f64 (.f64 x x) #s(literal 3 binary64))

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	10
0	6	10
1	13	10
2	37	10
3	73	10
4	106	10
5	124	10
6	124	10
0	124	10

Stop Event

1×	iter limit
1×	saturated
1×	iter limit

Calls

Call 1

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

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

localize15.0ms (1%)

Memory

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

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
accuracy	0.0	(*.f64 x x)
accuracy	0.2109375	(.f64 (.f64 x x) #s(literal 3 binary64))

Samples

10.0ms

256×

valid

Compiler

Compiled 12 to 6 computations (50% saved)

Precisions

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

ival-mult: 3.0ms (79.8% 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)

series2.0ms (0.1%)

Memory

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

Counts

2 → 2

Calls

Call 1

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

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

Calls

3 calls:

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

simplify185.0ms (12.4%)

Memory

-22.6MiB live, 158.9MiB allocated; 75ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	9	18
1	20	18
2	49	18
3	90	18
4	141	18
5	238	18
6	768	18
7	4784	18
0	8426	18

Stop Event

1×	iter limit
1×	node limit

Counts

2 → 2

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

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

rewrite25.0ms (1.7%)

Memory

10.2MiB live, 56.7MiB allocated; 2ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

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

Stop Event

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

Counts

2 → 24

Calls

Call 1

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

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

eval2.0ms (0.2%)

Memory: 7.7MiB live, 7.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 182 to 61 computations (66.5% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

2 alts after pruning (0 fresh and 2 done)

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

Accuracy

99.9%

Counts

28 → 2

Alt Table

Click to see full alt table

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

Compiler

Compiled 20 to 14 computations (30% saved)

regimes3.0ms (0.2%)

Memory

9.9MiB live, 10.0MiB allocated; 0ms collecting garbage

Accuracy

Total -0.1b remaining (-71.7%)

Threshold costs -0.1b (-71.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.7%	1	`(.f64 (.f64 x #s(literal 3 binary64)) x)`
99.7%	1	`x`

Compiler

Compiled 6 to 5 computations (16.7% saved)

simplify35.0ms (2.4%)

Memory

-52.9MiB live, 49.4MiB allocated; 19ms 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.9MiB live, 0.9MiB allocated; 0ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 5 to 4 computations (20% saved)

preprocess74.0ms (5%)

Memory: 11.0MiB live, 57.9MiB allocated; 3ms 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	8	18
1	21	15
2	49	15
3	70	15
4	85	15
5	123	15
6	145	15
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	8	18
1	21	15
2	49	15
3	70	15
4	85	15
5	123	15
6	145	15
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%)

sample853.0ms (57.4%)

explain45.0ms (3%)

preprocess19.0ms (1.3%)

eval0.0ms (0%)

prune0.0ms (0%)

simplify5.0ms (0.4%)

localize15.0ms (1%)

series2.0ms (0.2%)

simplify154.0ms (10.4%)

rewrite38.0ms (2.6%)

eval1.0ms (0.1%)

prune1.0ms (0.1%)

simplify10.0ms (0.7%)

localize15.0ms (1%)

series2.0ms (0.1%)

simplify185.0ms (12.4%)

rewrite25.0ms (1.7%)

eval2.0ms (0.2%)

prune2.0ms (0.1%)

regimes3.0ms (0.2%)

simplify35.0ms (2.4%)

derivations0.0ms (0%)

preprocess74.0ms (5%)

end0.0ms (0%)

Profiling

Iter	Nodes	Cost
0	8	18
1	21	15
2	49	15
3	70	15
4	85	15
5	123	15
6	145	15
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