Metrics for Cancel like terms

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

sample900.0ms (53%)

Memory

36.4MiB live, 489.0MiB allocated; 846ms collecting garbage

Samples

572.0ms	3 824×	1	valid
122.0ms	4 432×	0	valid

Precisions

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

ival-sub: 316.0ms (65.6% of total)

adjust: 87.0ms (18.1% of total)

ival-add: 67.0ms (13.9% of total)

ival-true: 5.0ms (1% of total)

exact: 4.0ms (0.8% of total)

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

Bogosity

explain55.0ms (3.2%)

Memory

8.0MiB live, 54.2MiB allocated; 4ms collecting garbage

FPErrors

Click to see full error table

Ground Truth	Overpredictions	Example	Example	Subexpression
118	6	(-1005567.3889546794)	-	`(-.f64 (+.f64 #s(literal 1 binary64) x) x)`
0	0	-	-	`(+.f64 #s(literal 1 binary64) x)`
0	0	-	-	`#s(literal 1 binary64)`
0	0	-	-	`x`

Explanations

Click to see full explanations table

Operator	Subexpression	Explanation	Count
`-.f64`	`(-.f64 (+.f64 #s(literal 1 binary64) x) x)`	cancellation	124	0

Confusion

	Predicted +	Predicted -
+	118	0
-	6	132

Precision

0.9516129032258065

Recall

1.0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	118	0	0
-	6	0	132

Precision?

0.9516129032258065

Recall?

1.0

Freqs

test

number	freq
0	132
1	124

Total Confusion?

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

Precision?

1.0

Recall?

1.0

Samples

16.0ms	228×	1	valid
8.0ms	284×	0	valid

Compiler

Compiled 29 to 16 computations (44.8% saved)

Precisions

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

adjust: 5.0ms (39.5% of total)

ival-add: 4.0ms (31.6% of total)

ival-sub: 3.0ms (23.7% of total)

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

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

exact: 0.0ms (0% of total)

preprocess227.0ms (13.4%)

Memory

-2.5MiB live, 182.9MiB allocated; 28ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	6	15
1	11	2
2	24	2
3	67	2
4	287	2
5	2340	2
0	4	5
0	6	5
1	11	1
2	18	1
3	53	1
4	194	1
5	1686	1
6	7283	1
0	8033	1

Stop Event

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

Calls

Call 1

Inputs
(-.f64 (+.f64 #s(literal 1 binary64) x) x)

Outputs
(-.f64 (+.f64 #s(literal 1 binary64) x) x)
#s(literal 1 binary64)

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

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

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	55.3%	(-.f64 (+.f64 #s(literal 1 binary64) x) x)

Compiler

Compiled 5 to 4 computations (20% saved)

series1.0ms (0.1%)

Memory

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

Counts

4 → 4

Calls

Call 1

Inputs
(-.f64 (+.f64 #s(literal 1 binary64) x) x)
(+.f64 #s(literal 1 binary64) x)
#s(literal 1 binary64)
x

Outputs
1
(+ 1 x)
x
(* x (+ 1 (/ 1 x)))

Calls

3 calls:

Time	Variable		Point	Expression
1.0ms	x	@	-inf	((- (+ 1 x) x) (+ 1 x) 1 x)
0.0ms	x	@	inf	((- (+ 1 x) x) (+ 1 x) 1 x)
0.0ms	x	@	0	((- (+ 1 x) x) (+ 1 x) 1 x)

simplify113.0ms (6.7%)

Memory

22.1MiB live, 68.6MiB allocated; 4ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	8
1	17	8
2	31	8
3	110	8
4	800	8
5	5377	8
0	8481	8

Stop Event

1×	iter limit
1×	node limit

Counts

4 → 3

Calls

Call 1

Inputs
1
(+ 1 x)
x
(* x (+ 1 (/ 1 x)))

Outputs
1
#s(literal 1 binary64)
(+ 1 x)
(-.f64 x #s(literal -1 binary64))
x
(* x (+ 1 (/ 1 x)))
(-.f64 x #s(literal -1 binary64))

rewrite65.0ms (3.8%)

Memory

-23.2MiB live, 23.3MiB allocated; 2ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	10
0	6	6
1	35	6
0	307	6

Stop Event

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

Counts

4 → 14

Calls

Call 1

Inputs
(-.f64 (+.f64 #s(literal 1 binary64) x) x)
(+.f64 #s(literal 1 binary64) x)
#s(literal 1 binary64)
x

Outputs
#s(literal 1 binary64)
(/.f64 (-.f64 (*.f64 x x) #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64)))
(/.f64 (neg.f64 (-.f64 #s(literal 1 binary64) (*.f64 x x))) (neg.f64 (-.f64 #s(literal 1 binary64) x)))
(/.f64 (neg.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) #s(literal 1 binary64))) (neg.f64 (fma.f64 x (-.f64 x #s(literal 1 binary64)) #s(literal 1 binary64))))
(/.f64 (-.f64 #s(literal 1 binary64) (*.f64 x x)) (-.f64 #s(literal 1 binary64) x))
(/.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) #s(literal 1 binary64)) (fma.f64 x x (-.f64 #s(literal 1 binary64) x)))
(/.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) #s(literal 1 binary64)) (fma.f64 x (-.f64 x #s(literal 1 binary64)) #s(literal 1 binary64)))
(-.f64 (/.f64 #s(literal 1 binary64) (-.f64 #s(literal 1 binary64) x)) (/.f64 (*.f64 x x) (-.f64 #s(literal 1 binary64) x)))
(-.f64 x #s(literal -1 binary64))
(+.f64 (/.f64 #s(literal 1 binary64) (fma.f64 x (-.f64 x #s(literal 1 binary64)) #s(literal 1 binary64))) (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x (-.f64 x #s(literal 1 binary64)) #s(literal 1 binary64))))
(+.f64 x #s(literal 1 binary64))
(+.f64 #s(literal 1 binary64) x)
#s(literal 1 binary64)
x

eval2.0ms (0.1%)

Memory: 2.5MiB live, 2.5MiB allocated; 0ms collecting garbage
Compiler: Compiled 157 to 49 computations (68.8% saved)

prune1.0ms (0%)

Memory

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

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	15	1	16
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	16	1	17

Accuracy

100.0%

Counts

17 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	#s(approx (- (+ 1 x) x) #s(literal 1 binary64))

Compiler

Compiled 7 to 6 computations (14.3% saved)

series0.0ms (0%)

Memory

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

Counts

2 → 1

Calls

Call 1

Inputs
#s(approx (- (+ 1 x) x) #s(literal 1 binary64))
#s(literal 1 binary64)

Outputs
1

Calls

3 calls:

Time	Variable		Point	Expression
0.0ms	x	@	0	((- (+ 1 x) x) 1)
0.0ms	x	@	inf	((- (+ 1 x) x) 1)
0.0ms	x	@	-inf	((- (+ 1 x) x) 1)

simplify182.0ms (10.7%)

Memory

-15.3MiB live, 99.0MiB allocated; 50ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	1	1
1	3	1
2	6	1
3	14	1
4	40	1
5	177	1
6	1420	1
7	4355	1
0	8026	1

Stop Event

1×	iter limit
1×	node limit

Counts

1 → 1

Calls

Call 1

Inputs
1

Outputs
1
#s(literal 1 binary64)

rewrite58.0ms (3.4%)

Memory

-12.3MiB live, 33.6MiB allocated; 5ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	5	8
0	5	8
1	34	4
0	307	4

Stop Event

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

Counts

2 → 2

Calls

Call 1

Inputs
#s(approx (- (+ 1 x) x) #s(literal 1 binary64))
#s(literal 1 binary64)

Outputs
#s(approx (- (+ 1 x) x) #s(literal 1 binary64))
#s(literal 1 binary64)

eval0.0ms (0%)

Memory: 0.3MiB live, 0.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 14 to 6 computations (57.1% saved)

prune1.0ms (0%)

Memory

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

Pruning

1 alts after pruning (0 fresh and 1 done)

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

Accuracy

100.0%

Counts

3 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	#s(approx (- (+ 1 x) x) #s(literal 1 binary64))

Compiler

Compiled 19 to 14 computations (26.3% saved)

regimes2.0ms (0.1%)

Memory

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

Accuracy

Total -28.6b remaining (-∞%)

Threshold costs -28.6b (-∞%)

Counts

2 → 1

Calls

Call 1

Inputs
#s(approx (- (+ 1 x) x) #s(literal 1 binary64))
(-.f64 (+.f64 #s(literal 1 binary64) x) x)

Outputs
#s(approx (- (+ 1 x) x) #s(literal 1 binary64))

Calls

2 calls:

1.0ms	x
1.0ms	(-.f64 (+.f64 #s(literal 1 binary64) x) x)

Results

Accuracy	Segments	Branch
100.0%	1	`(-.f64 (+.f64 #s(literal 1 binary64) x) x)`
100.0%	1	`x`

Compiler

Compiled 6 to 5 computations (16.7% saved)

simplify35.0ms (2.1%)

Memory

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

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	5	7
1	10	5
2	17	3
3	41	3
4	153	3
5	1141	3
6	4949	3

Stop Event

1×	node limit

Calls

Call 1

Inputs
#s(approx (- (+ 1 x) x) #s(literal 1 binary64))

Outputs
#s(approx (- (+ 1 x) x) #s(literal 1 binary64))

derivations45.0ms (2.6%)

Memory

-41.2MiB live, 5.5MiB allocated; 3ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 7 to 6 computations (14.3% saved)

preprocess10.0ms (0.6%)

Memory: 15.0MiB live, 15.0MiB allocated; 0ms collecting garbage
Remove: (abs x)
Compiler: Compiled 38 to 32 computations (15.8% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample900.0ms (53%)

explain55.0ms (3.2%)

preprocess227.0ms (13.4%)

eval0.0ms (0%)

prune0.0ms (0%)

series1.0ms (0.1%)

simplify113.0ms (6.7%)

rewrite65.0ms (3.8%)

eval2.0ms (0.1%)

prune1.0ms (0%)

series0.0ms (0%)

simplify182.0ms (10.7%)

rewrite58.0ms (3.4%)

eval0.0ms (0%)

prune1.0ms (0%)

regimes2.0ms (0.1%)

simplify35.0ms (2.1%)

derivations45.0ms (2.6%)

preprocess10.0ms (0.6%)

end0.0ms (0%)

Profiling