Metrics for math.cube on real

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

0.4MiB live, 0.4MiB 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 5 computations (28.6% saved)

sample589.0ms (73.5%)

Memory

1.2MiB live, 762.7MiB allocated; 134ms collecting garbage

Samples

289.0ms

8 256×

valid

Precisions

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

ival-mult: 151.0ms (97.4% of total)

adjust: 2.0ms (1.3% of total)

ival-assert: 2.0ms (1.3% of total)

Bogosity

explain58.0ms (7.2%)

Memory

37.5MiB live, 84.4MiB allocated; 2ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`(.f64 (.f64 x x) x)`
-	-	`(*.f64 x x)`
-	-	`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

16.0ms

512×

valid

Compiler

Compiled 27 to 13 computations (51.9% saved)

Precisions

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

ival-mult: 7.0ms (95.2% of total)

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

adjust: 0.0ms (0% of total)

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

preprocess18.0ms (2.3%)

Memory

-15.6MiB live, 29.0MiB allocated; 7ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	7	16
1	25	10
2	63	10
3	100	10
4	122	10
0	3	5
0	5	5
1	10	3
2	31	3
3	65	3
4	99	3
5	106	3
0	106	3

Stop Event

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

Calls

Call 1

Inputs
(.f64 (.f64 x x) x)

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

Symmetry

(negabs x)

Compiler

Compiled 5 to 3 computations (40% 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.9MiB live, 0.9MiB allocated; 0ms collecting garbage

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	99.9%	(.f64 (.f64 x x) x)

Compiler

Compiled 5 to 3 computations (40% saved)

series3.0ms (0.4%)

Memory

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

Counts

3 → 3

Calls

Call 1

Inputs
(.f64 (.f64 x x) x)
(*.f64 x x)
x

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

Calls

3 calls:

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

rewrite31.0ms (3.9%)

Memory

-4.1MiB live, 40.7MiB allocated; 5ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	12	28
0	14	24
1	35	24
0	119	24

Stop Event

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

Counts

6 → 36

Calls

Call 1

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

Outputs
(.f64 (.f64 x (fabs.f64 x)) (fabs.f64 x))
(.f64 (.f64 x (neg.f64 x)) (neg.f64 x))
(*.f64 (neg.f64 (pow.f64 x #s(literal 3/2 binary64))) (neg.f64 (pow.f64 x #s(literal 3/2 binary64))))
(*.f64 (fabs.f64 (pow.f64 x #s(literal 3/2 binary64))) (fabs.f64 (pow.f64 x #s(literal 3/2 binary64))))
(*.f64 (pow.f64 x #s(literal 3/2 binary64)) (pow.f64 x #s(literal 3/2 binary64)))
(.f64 (neg.f64 x) (.f64 (neg.f64 x) x))
(.f64 (fabs.f64 x) (.f64 (fabs.f64 x) x))
(.f64 (.f64 x x) x)
(.f64 x (.f64 x x))
(pow.f64 (exp.f64 (log.f64 x)) #s(literal 3 binary64))
(pow.f64 (pow.f64 x #s(literal 3/2 binary64)) #s(literal 2 binary64))
(pow.f64 (*.f64 x x) #s(literal 3/2 binary64))
(pow.f64 x #s(literal 3 binary64))
(exp.f64 (*.f64 (log.f64 x) #s(literal 3 binary64)))
(+.f64 (cosh.f64 (.f64 (log.f64 x) #s(literal 3 binary64))) (sinh.f64 (.f64 (log.f64 x) #s(literal 3 binary64))))
(*.f64 (neg.f64 (neg.f64 x)) (neg.f64 (neg.f64 x)))
(*.f64 (neg.f64 (fabs.f64 x)) (neg.f64 (fabs.f64 x)))
(*.f64 (fabs.f64 (fabs.f64 x)) (fabs.f64 (fabs.f64 x)))
(*.f64 (exp.f64 (log.f64 x)) (exp.f64 (log.f64 x)))
(*.f64 (neg.f64 x) (neg.f64 x))
(*.f64 (fabs.f64 x) (fabs.f64 x))
(*.f64 x x)
(pow.f64 (exp.f64 (log.f64 x)) #s(literal 2 binary64))
(pow.f64 (neg.f64 x) #s(literal 2 binary64))
(pow.f64 (fabs.f64 x) #s(literal 2 binary64))
(pow.f64 (*.f64 x x) #s(literal 1 binary64))
(pow.f64 x #s(literal 2 binary64))
(neg.f64 (*.f64 (neg.f64 x) x))
(neg.f64 (*.f64 x (neg.f64 x)))
(fabs.f64 (*.f64 x x))
(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(approx (* (* x x) x) (pow.f64 x #s(literal 3 binary64)))
#s(approx (* x x) (*.f64 x x))
#s(approx x x)

eval4.0ms (0.5%)

Memory: 9.2MiB live, 9.2MiB allocated; 0ms collecting garbage
Compiler: Compiled 277 to 84 computations (69.7% saved)

prune2.0ms (0.3%)

Memory

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

Pruning

2 alts after pruning (1 fresh and 1 done)

	Pruned	Kept	Total
New	39	1	40
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	39	2	41

Accuracy

100.0%

Counts

41 → 2

Alt Table

Click to see full alt table

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

Compiler

Compiled 8 to 6 computations (25% saved)

series2.0ms (0.2%)

Memory

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

Counts

3 → 2

Calls

Call 1

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

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

Calls

3 calls:

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

rewrite40.0ms (4.9%)

Memory

-36.3MiB live, 27.0MiB allocated; 27ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	15
0	6	15
1	17	15
0	49	15

Stop Event

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

Counts

5 → 15

Calls

Call 1

Inputs
(pow.f64 x #s(literal 3 binary64))
x
#s(literal 3 binary64)
#s(approx (pow x 3) #s(hole binary64 (pow x 3)))
#s(approx x #s(hole binary64 x))

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

eval2.0ms (0.2%)

Memory: 2.7MiB live, 2.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 87 to 29 computations (66.7% saved)

prune1.0ms (0.2%)

Memory

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

Pruning

2 alts after pruning (0 fresh and 2 done)

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

Accuracy

100.0%

Counts

17 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(pow.f64 x #s(literal 3 binary64))
✓	99.9%	(.f64 (.f64 x x) x)

Compiler

Compiled 16 to 11 computations (31.3% saved)

regimes3.0ms (0.3%)

Memory

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

Counts

2 → 1

Calls

Call 1

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

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

Calls

2 calls:

1.0ms	x
1.0ms	(.f64 (.f64 x x) x)

Results

Accuracy	Segments	Branch
100.0%	1	`(.f64 (.f64 x x) x)`
100.0%	1	`x`

Compiler

Compiled 6 to 4 computations (33.3% saved)

regimes2.0ms (0.3%)

Memory

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

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

1 → 1

Calls

Call 1

Inputs
(.f64 (.f64 x x) x)

Outputs
(.f64 (.f64 x x) x)

Calls

2 calls:

1.0ms	x
1.0ms	(.f64 (.f64 x x) x)

Results

Accuracy	Segments	Branch
99.9%	1	`(.f64 (.f64 x x) x)`
99.9%	1	`x`

Compiler

Compiled 6 to 4 computations (33.3% saved)

simplify22.0ms (2.7%)

Memory

-32.1MiB live, 15.6MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	8

Stop Event

1×

saturated

Calls

Call 1

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

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

derivations1.0ms (0.1%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 8 to 5 computations (37.5% saved)

preprocess24.0ms (3%)

Memory: 7.8MiB live, 51.7MiB allocated; 9ms collecting garbage
Remove: (negabs x)
Compiler: Compiled 44 to 34 computations (22.7% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample589.0ms (73.5%)

explain58.0ms (7.2%)

preprocess18.0ms (2.3%)

eval0.0ms (0%)

prune0.0ms (0%)

series3.0ms (0.4%)

rewrite31.0ms (3.9%)

eval4.0ms (0.5%)

prune2.0ms (0.3%)

series2.0ms (0.2%)

rewrite40.0ms (4.9%)

eval2.0ms (0.2%)

prune1.0ms (0.2%)

regimes3.0ms (0.3%)

regimes2.0ms (0.3%)

simplify22.0ms (2.7%)

derivations1.0ms (0.1%)

preprocess24.0ms (3%)

end0.0ms (0%)

Profiling