details

property	value
status	complete
benchmark	quicktest_sum.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n149.star.cs.uiowa.edu
space	INVY_15

run statistics

property	value
solver	NaTT v.1.6c
configuration	Default
runtime (wallclock)	0.147734 seconds
cpu usage	0.060284
user time	0.027222
system time	0.033062
max virtual memory	113188.0
max residence set size	6828.0

stage attributes

key	value
starexec-result	YES

output

YES Input TRS: 1: +(0(),y) -> y 2: +(s(x),y) -> s(+(x,y)) 3: sum1(nil()) -> 0() 4: sum1(cons(x,y)) -> +(x,sum1(y)) 5: sum2(nil(),z) -> z 6: sum2(cons(x,y),z) -> sum2(y,+(x,z)) 7: tests(0()) -> true() 8: tests(s(x)) -> and(test(rands(rand(0()),nil())),x) 9: test(done(y)) -> eq(f(y),g(y)) 10: eq(x,x) -> true() 11: rands(0(),y) -> done(y) 12: rands(s(x),y) -> rands(x,::(rand(0()),y)) 13: rand(x) ->= x 14: rand(x) ->= rand(s(x)) Number of strict rules: 12 Direct POLO(bPol) ... removes: 4 8 1 3 5 10 7 11 9 6 rands w: x1 + 2 * x2 + 12214 tests w: x1 + 45021 test w: 2 * x1 + 4 s w: x1 done w: 2 * x1 + 1 and w: x1 + x2 + 20584 eq w: x1 + x2 + 1 sum2 w: 2 * x1 + 2 * x2 :: w: x1 + x2 true w: 0 rand w: x1 f w: 2 * x1 + 1 0 w: 0 nil w: 1 cons w: x1 + x2 + 31113 + w: x1 + x2 + 7579 g w: 2 * x1 + 3 sum1 w: 2 * x1 + 1 Number of strict rules: 2 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #+(s(x),y) -> #+(x,y) #2: #rands(s(x),y) -> #rands(x,::(rand(0()),y)) Number of SCCs: 2, DPs: 2 SCC { #1 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... succeeded. rands s: [] p: 2 w: 4 tests s: [] p: 0 w: 1 test s: 1 s s: [1] p: 0 w: x1 done s: [] p: 0 w: 1 and s: [] p: 0 w: 1 eq s: 2 sum2 s: [1] p: 0 w: x1 + 1 :: s: [1] p: 1 w: x1 + 1 true s: [] p: 0 w: 0 rand s: [] p: 0 w: x1 + 1 f s: [] p: 0 w: 1 #rands s: 2 0 s: [] p: 3 w: 1 nil s: [] p: 0 w: 0 cons s: [1,2] p: 0 w: x1 + x2 + 1 + s: [2,1] p: 1 w: x1 + x2 + 1 g s: [] p: 0 w: 1 #+ s: [1] p: 0 w: x1 sum1 s: [] p: 0 w: 1 Removed DPs: #1 Number of SCCs: 1, DPs: 1 SCC { #2 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... succeeded. rands s: [] p: 4 w: 4 tests s: [] p: 0 w: 1 test s: 1 s s: [1] p: 0 w: x1 done s: [] p: 0 w: 1 and s: [] p: 0 w: 1 eq s: 2 sum2 s: [1] p: 0 w: x1 + 1 :: s: [2] p: 1 w: x2 + 1 true s: [] p: 0 w: 0 rand s: [] p: 3 w: x1 + 1 f s: [] p: 0 w: 1 #rands s: 1 0 s: [] p: 5 w: 1 nil s: [] p: 0 w: 0 cons s: [1,2] p: 0 w: x1 + x2 + 1 + s: [2,1] p: 1 w: x1 + x2 + 1 g s: [] p: 0 w: 1 #+ s: [1] p: 0 w: x1 sum1 s: [] p: 0 w: 1 Removed DPs: #2 Number of SCCs: 0, DPs: 0 popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to TRS Relative