Metrics for Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, F

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

0.8MiB live, 0.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
100%	99.9%	0%	0.1%	0%	0%	0%	1

Compiler

Compiled 7 to 7 computations (0% saved)

sample963.0ms (74.7%)

Memory

22.2MiB live, 834.3MiB allocated; 145ms collecting garbage

Samples

723.0ms

8 256×

valid

Precisions

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

ival-mult: 325.0ms (95% of total)

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

exact: 5.0ms (1.5% of total)

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

adjust: 3.0ms (0.9% of total)

Bogosity

explain93.0ms (7.2%)

Memory

-5.3MiB live, 36.8MiB allocated; 18ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`(.f64 (.f64 x #s(literal 27 binary64)) y)`
-	-	`#s(literal 27 binary64)`
-	-	`y`
-	-	`(*.f64 x #s(literal 27 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 31 to 19 computations (38.7% saved)

Precisions

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

ival-mult: 7.0ms (92.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)

preprocess33.0ms (2.6%)

Memory

-9.5MiB live, 35.9MiB allocated; 10ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	33
1	34	25
2	74	25
3	121	25
0	5	5
0	7	5
1	11	5
2	18	5
3	20	5
0	20	5

Stop Event

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

Calls

Call 1

Inputs
(.f64 (.f64 x #s(literal 27 binary64)) y)

Outputs
(.f64 (.f64 x #s(literal 27 binary64)) y)
(.f64 y (.f64 #s(literal 27 binary64) x))

Symmetry

(negabs y)

(negabs x)

(sort x y)

Compiler

Compiled 5 to 5 computations (0% saved)

eval0.0ms (0%)

Memory: 0.1MiB live, 0.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 0 to 2 computations (-∞% saved)

prune0.0ms (0%)

Memory

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

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	99.6%	(.f64 (.f64 x #s(literal 27 binary64)) y)

Compiler

Compiled 5 to 5 computations (0% saved)

series6.0ms (0.4%)

Memory

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

Counts

5 → 4

Calls

Call 1

Inputs
(.f64 (.f64 x #s(literal 27 binary64)) y)
(*.f64 x #s(literal 27 binary64))
x
#s(literal 27 binary64)
y

Outputs
(* 27 (* x y))
(* 27 x)
x
y

Calls

6 calls:

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

simplify3.0ms (0.3%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	10
1	10	10
2	16	10
3	17	10
0	17	10

Stop Event

1×	iter limit
1×	saturated

Counts

4 → 2

Calls

Call 1

Inputs
(* 27 (* x y))
(* 27 x)
x
y

Outputs
(* 27 (* x y))
(.f64 (.f64 y x) #s(literal 27 binary64))
(* 27 x)
(*.f64 #s(literal 27 binary64) x)
x
y

rewrite30.0ms (2.3%)

Memory

-23.8MiB live, 30.9MiB allocated; 12ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	11
0	7	11
1	11	11
2	18	11
3	20	11
0	20	11

Stop Event

1×	iter limit
1×	saturated
1×	iter limit

Counts

5 → 11

Calls

Call 1

Inputs
(.f64 (.f64 x #s(literal 27 binary64)) y)
(*.f64 x #s(literal 27 binary64))
x
#s(literal 27 binary64)
y

Outputs
(.f64 (.f64 y x) #s(literal 27 binary64))
(.f64 (.f64 y #s(literal 27 binary64)) x)
(.f64 y (.f64 #s(literal 27 binary64) x))
(.f64 (.f64 #s(literal 27 binary64) x) y)
(.f64 #s(literal 27 binary64) (.f64 y x))
(.f64 x (.f64 y #s(literal 27 binary64)))
(*.f64 #s(literal 27 binary64) x)
(*.f64 x #s(literal 27 binary64))
x
#s(literal 27 binary64)
y

eval1.0ms (0.1%)

Memory: 2.4MiB live, 2.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 75 to 20 computations (73.3% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

3 alts after pruning (2 fresh and 1 done)

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

Accuracy

99.9%

Counts

14 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	99.7%	(.f64 (.f64 y x) #s(literal 27 binary64))
▶	99.3%	(.f64 (.f64 y #s(literal 27 binary64)) x)
✓	99.6%	(.f64 (.f64 x #s(literal 27 binary64)) y)

Compiler

Compiled 15 to 15 computations (0% saved)

series4.0ms (0.3%)

Memory

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

Counts

7 → 5

Calls

Call 1

Inputs
(.f64 (.f64 y #s(literal 27 binary64)) x)
(*.f64 y #s(literal 27 binary64))
y
#s(literal 27 binary64)
x
(.f64 (.f64 y x) #s(literal 27 binary64))
(*.f64 y x)

Outputs
(* 27 (* x y))
x
(* x y)
(* 27 y)
y

Calls

6 calls:

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

simplify3.0ms (0.2%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	13
1	11	13
2	16	13
0	16	13

Stop Event

1×	iter limit
1×	saturated

Counts

5 → 3

Calls

Call 1

Inputs
(* 27 (* x y))
x
(* x y)
(* 27 y)
y

Outputs
(* 27 (* x y))
(.f64 (.f64 x y) #s(literal 27 binary64))
x
(* x y)
(*.f64 x y)
(* 27 y)
(*.f64 #s(literal 27 binary64) y)
y

rewrite17.0ms (1.4%)

Memory

-36.4MiB live, 9.7MiB allocated; 6ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	19
0	11	19
1	19	19
2	21	19
0	21	19

Stop Event

1×	iter limit
1×	saturated
1×	iter limit

Counts

7 → 19

Calls

Call 1

Inputs
(.f64 (.f64 y #s(literal 27 binary64)) x)
(*.f64 y #s(literal 27 binary64))
y
#s(literal 27 binary64)
x
(.f64 (.f64 y x) #s(literal 27 binary64))
(*.f64 y x)

Outputs
(.f64 (.f64 x #s(literal 27 binary64)) y)
(.f64 (.f64 x y) #s(literal 27 binary64))
(.f64 x (.f64 #s(literal 27 binary64) y))
(.f64 (.f64 #s(literal 27 binary64) y) x)
(.f64 #s(literal 27 binary64) (.f64 x y))
(.f64 y (.f64 x #s(literal 27 binary64)))
(*.f64 #s(literal 27 binary64) y)
(*.f64 y #s(literal 27 binary64))
y
#s(literal 27 binary64)
x
(.f64 (.f64 x #s(literal 27 binary64)) y)
(.f64 (.f64 x y) #s(literal 27 binary64))
(.f64 x (.f64 #s(literal 27 binary64) y))
(.f64 (.f64 #s(literal 27 binary64) y) x)
(.f64 #s(literal 27 binary64) (.f64 x y))
(.f64 y (.f64 x #s(literal 27 binary64)))
(*.f64 x y)
(*.f64 y x)

eval3.0ms (0.2%)

Memory: 5.5MiB live, 5.5MiB allocated; 0ms collecting garbage
Compiler: Compiled 109 to 25 computations (77.1% saved)

prune3.0ms (0.3%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	19	0	19
Fresh	0	0	0
Picked	0	2	2
Done	0	1	1
Total	19	3	22

Accuracy

99.9%

Counts

22 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	99.7%	(.f64 (.f64 y x) #s(literal 27 binary64))
✓	99.3%	(.f64 (.f64 y #s(literal 27 binary64)) x)
✓	99.6%	(.f64 (.f64 x #s(literal 27 binary64)) y)

Compiler

Compiled 30 to 24 computations (20% saved)

regimes7.0ms (0.5%)

Memory

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

Counts

3 → 1

Calls

Call 1

Inputs
(.f64 (.f64 x #s(literal 27 binary64)) y)
(.f64 (.f64 y #s(literal 27 binary64)) x)
(.f64 (.f64 y x) #s(literal 27 binary64))

Outputs
(.f64 (.f64 y x) #s(literal 27 binary64))

Calls

4 calls:

2.0ms	y
2.0ms	(*.f64 x #s(literal 27 binary64))
1.0ms	x
1.0ms	(.f64 (.f64 x #s(literal 27 binary64)) y)

Results

Accuracy	Segments	Branch
99.7%	1	`(*.f64 x #s(literal 27 binary64))`
99.7%	1	`(.f64 (.f64 x #s(literal 27 binary64)) y)`
99.7%	1	`x`
99.7%	1	`y`

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes27.0ms (2.1%)

Memory

-25.8MiB live, 18.4MiB allocated; 6ms collecting garbage

Accuracy

Total -0.4b remaining (-147.7%)

Threshold costs -0.4b (-147.7%)

Counts

2 → 1

Calls

Call 1

Inputs
(.f64 (.f64 x #s(literal 27 binary64)) y)
(.f64 (.f64 y #s(literal 27 binary64)) x)

Outputs
(.f64 (.f64 x #s(literal 27 binary64)) y)

Calls

4 calls:

23.0ms	(.f64 (.f64 x #s(literal 27 binary64)) y)
1.0ms	(*.f64 x #s(literal 27 binary64))
1.0ms	y
1.0ms	x

Results

Accuracy	Segments	Branch
99.6%	1	`(*.f64 x #s(literal 27 binary64))`
99.6%	1	`(.f64 (.f64 x #s(literal 27 binary64)) y)`
99.6%	1	`x`
99.6%	1	`y`

Compiler

Compiled 10 to 13 computations (-30% saved)

simplify9.0ms (0.7%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	10

Stop Event

1×

saturated

Calls

Call 1

Inputs
(.f64 (.f64 y x) #s(literal 27 binary64))
(.f64 (.f64 x #s(literal 27 binary64)) y)

Outputs
(.f64 (.f64 y x) #s(literal 27 binary64))
(.f64 (.f64 x #s(literal 27 binary64)) y)

derivations1.0ms (0.1%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 10 to 7 computations (30% saved)

preprocess85.0ms (6.6%)

Memory

2.5MiB live, 96.2MiB allocated; 34ms collecting garbage

Remove

(sort x y)

(negabs x)

(negabs y)

Compiler

Compiled 90 to 84 computations (6.7% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample963.0ms (74.7%)

explain93.0ms (7.2%)

preprocess33.0ms (2.6%)

eval0.0ms (0%)

prune0.0ms (0%)

series6.0ms (0.4%)

simplify3.0ms (0.3%)

rewrite30.0ms (2.3%)

eval1.0ms (0.1%)

prune2.0ms (0.2%)

series4.0ms (0.3%)

simplify3.0ms (0.2%)

rewrite17.0ms (1.4%)

eval3.0ms (0.2%)

prune3.0ms (0.3%)

regimes7.0ms (0.5%)

regimes27.0ms (2.1%)

simplify9.0ms (0.7%)

derivations1.0ms (0.1%)

preprocess85.0ms (6.6%)

end0.0ms (0%)

Profiling