details

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

run statistics

property	value
solver	NaTT v.1.6c
configuration	Default
runtime (wallclock)	0.247985839844 seconds
cpu usage	0.246250138
max memory	1.4860288E7

stage attributes

key	value
output-size	3799
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Input TRS: 1: 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(x1)))))))))) 2: 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(x1))))))))))))) 3: 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(x1)))))))))))))))) 4: 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(x1))))))))))))))))))) 5: 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(x1)))))))))))))))))))))) 6: 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(x1))))))))))))))))))))))))) Number of strict rules: 6 Direct POLO(bPol) ... failed. Uncurrying 0^1_1 0 1: 0^1_1^1_2(1(x1)) -> 1(2(1(1(0^1_1^1_2(0^1_1^1_2(x1)))))) 2: 0^1_1^1_2(1(x1)) -> 1(2(1(1(0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(x1))))))) 3: 0^1_1^1_2(1(x1)) -> 1(2(1(1(0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(x1)))))))) 4: 0^1_1^1_2(1(x1)) -> 1(2(1(1(0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(x1))))))))) 5: 0^1_1^1_2(1(x1)) -> 1(2(1(1(0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(x1)))))))))) 6: 0^1_1^1_2(1(x1)) -> 1(2(1(1(0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(x1))))))))))) 7: 0(1(_1)) ->= 0^1_1(_1) 8: 0^1_1(2(_1)) ->= 0^1_1^1_2(_1) Number of strict rules: 6 Direct POLO(bPol) ... removes: 8 7 1 w: x1 0^1_1^1_2 w: x1 0 w: x1 + 3 0^1_1 w: x1 + 2 2 w: x1 Number of strict rules: 6 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #0^1_1^1_2(1(x1)) -> #0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(x1))) #2: #0^1_1^1_2(1(x1)) -> #0^1_1^1_2(0^1_1^1_2(x1)) #3: #0^1_1^1_2(1(x1)) -> #0^1_1^1_2(x1) #4: #0^1_1^1_2(1(x1)) -> #0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(x1))))))) #5: #0^1_1^1_2(1(x1)) -> #0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(x1)))))) #6: #0^1_1^1_2(1(x1)) -> #0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(x1))))) #7: #0^1_1^1_2(1(x1)) -> #0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(x1)))) #8: #0^1_1^1_2(1(x1)) -> #0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(x1))) #9: #0^1_1^1_2(1(x1)) -> #0^1_1^1_2(0^1_1^1_2(x1)) #10: #0^1_1^1_2(1(x1)) -> #0^1_1^1_2(x1) #11: #0^1_1^1_2(1(x1)) -> #0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(x1)))))) #12: #0^1_1^1_2(1(x1)) -> #0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(x1))))) #13: #0^1_1^1_2(1(x1)) -> #0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(x1)))) #14: #0^1_1^1_2(1(x1)) -> #0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(x1))) #15: #0^1_1^1_2(1(x1)) -> #0^1_1^1_2(0^1_1^1_2(x1)) #16: #0^1_1^1_2(1(x1)) -> #0^1_1^1_2(x1) #17: #0^1_1^1_2(1(x1)) -> #0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(x1)))) #18: #0^1_1^1_2(1(x1)) -> #0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(x1))) #19: #0^1_1^1_2(1(x1)) -> #0^1_1^1_2(0^1_1^1_2(x1)) #20: #0^1_1^1_2(1(x1)) -> #0^1_1^1_2(x1) #21: #0^1_1^1_2(1(x1)) -> #0^1_1^1_2(0^1_1^1_2(x1)) #22: #0^1_1^1_2(1(x1)) -> #0^1_1^1_2(x1) #23: #0^1_1^1_2(1(x1)) -> #0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(x1))))) #24: #0^1_1^1_2(1(x1)) -> #0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(x1)))) #25: #0^1_1^1_2(1(x1)) -> #0^1_1^1_2(0^1_1^1_2(0^1_1^1_2(x1))) #26: #0^1_1^1_2(1(x1)) -> #0^1_1^1_2(0^1_1^1_2(x1)) #27: #0^1_1^1_2(1(x1)) -> #0^1_1^1_2(x1) Number of SCCs: 1, DPs: 27 SCC { #1..27 } POLO(Sum)... succeeded. 1 w: x1 + 235 0^1_1^1_2 w: x1 + 39 0 w: 0 #0^1_1^1_2 w: x1 0^1_1 w: 0 2 w: 37 USABLE RULES: { 1..6 } Removed DPs: #1..27 Number of SCCs: 0, DPs: 0 popout

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

job log

popout

actions

all output return to SRS Standard