details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.0600299835205 seconds
cpu usage	0.053950393
max memory	4583424.0

stage attributes

key	value
output-size	12813
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR a a_4 l l' l1 l1_2 l2 l2_1 l_3 l_5 x x_0 y) (RULES append(l1_2,l2_1) -> match_0(l1_2,l2_1,l1_2) match_0(l1_2,l2_1,Cons(x,l)) -> Cons(x,append(l,l2_1)) match_0(l1_2,l2_1,Nil) -> l2_1 match_1(a_4,l_3,Cons(x,l')) -> match_2(x,l',a_4,l_3,part(a_4,l')) match_1(a_4,l_3,Nil) -> Pair(Nil,Nil) match_2(x,l',a_4,l_3,Pair(l1,l2)) -> match_3(l1,l2,x,l',a_4,l_3,test(a_4,x)) match_3(l1,l2,x,l',a_4,l_3,False) -> Pair(Cons(x,l1),l2) match_3(l1,l2,x,l',a_4,l_3,True) -> Pair(l1,Cons(x,l2)) match_4(l_5,Cons(a,l')) -> match_5(a,l',l_5,part(a,l')) match_4(l_5,Nil) -> Nil match_5(a,l',l_5,Pair(l1,l2)) -> append(quick(l1),Cons(a,quick(l2))) part(a_4,l_3) -> match_1(a_4,l_3,l_3) quick(l_5) -> match_4(l_5,l_5) test(x_0,y) -> False test(x_0,y) -> True ) Problem 1: Dependency Pairs Processor: -> Pairs: APPEND(l1_2,l2_1) -> MATCH_0(l1_2,l2_1,l1_2) MATCH_0(l1_2,l2_1,Cons(x,l)) -> APPEND(l,l2_1) MATCH_1(a_4,l_3,Cons(x,l')) -> MATCH_2(x,l',a_4,l_3,part(a_4,l')) MATCH_1(a_4,l_3,Cons(x,l')) -> PART(a_4,l') MATCH_2(x,l',a_4,l_3,Pair(l1,l2)) -> MATCH_3(l1,l2,x,l',a_4,l_3,test(a_4,x)) MATCH_2(x,l',a_4,l_3,Pair(l1,l2)) -> TEST(a_4,x) MATCH_4(l_5,Cons(a,l')) -> MATCH_5(a,l',l_5,part(a,l')) MATCH_4(l_5,Cons(a,l')) -> PART(a,l') MATCH_5(a,l',l_5,Pair(l1,l2)) -> APPEND(quick(l1),Cons(a,quick(l2))) MATCH_5(a,l',l_5,Pair(l1,l2)) -> QUICK(l1) MATCH_5(a,l',l_5,Pair(l1,l2)) -> QUICK(l2) PART(a_4,l_3) -> MATCH_1(a_4,l_3,l_3) QUICK(l_5) -> MATCH_4(l_5,l_5) -> Rules: append(l1_2,l2_1) -> match_0(l1_2,l2_1,l1_2) match_0(l1_2,l2_1,Cons(x,l)) -> Cons(x,append(l,l2_1)) match_0(l1_2,l2_1,Nil) -> l2_1 match_1(a_4,l_3,Cons(x,l')) -> match_2(x,l',a_4,l_3,part(a_4,l')) match_1(a_4,l_3,Nil) -> Pair(Nil,Nil) match_2(x,l',a_4,l_3,Pair(l1,l2)) -> match_3(l1,l2,x,l',a_4,l_3,test(a_4,x)) match_3(l1,l2,x,l',a_4,l_3,False) -> Pair(Cons(x,l1),l2) match_3(l1,l2,x,l',a_4,l_3,True) -> Pair(l1,Cons(x,l2)) match_4(l_5,Cons(a,l')) -> match_5(a,l',l_5,part(a,l')) match_4(l_5,Nil) -> Nil match_5(a,l',l_5,Pair(l1,l2)) -> append(quick(l1),Cons(a,quick(l2))) part(a_4,l_3) -> match_1(a_4,l_3,l_3) quick(l_5) -> match_4(l_5,l_5) test(x_0,y) -> False test(x_0,y) -> True Problem 1: SCC Processor: -> Pairs: APPEND(l1_2,l2_1) -> MATCH_0(l1_2,l2_1,l1_2) MATCH_0(l1_2,l2_1,Cons(x,l)) -> APPEND(l,l2_1) MATCH_1(a_4,l_3,Cons(x,l')) -> MATCH_2(x,l',a_4,l_3,part(a_4,l')) MATCH_1(a_4,l_3,Cons(x,l')) -> PART(a_4,l') MATCH_2(x,l',a_4,l_3,Pair(l1,l2)) -> MATCH_3(l1,l2,x,l',a_4,l_3,test(a_4,x)) MATCH_2(x,l',a_4,l_3,Pair(l1,l2)) -> TEST(a_4,x) MATCH_4(l_5,Cons(a,l')) -> MATCH_5(a,l',l_5,part(a,l')) MATCH_4(l_5,Cons(a,l')) -> PART(a,l') MATCH_5(a,l',l_5,Pair(l1,l2)) -> APPEND(quick(l1),Cons(a,quick(l2))) MATCH_5(a,l',l_5,Pair(l1,l2)) -> QUICK(l1) MATCH_5(a,l',l_5,Pair(l1,l2)) -> QUICK(l2) PART(a_4,l_3) -> MATCH_1(a_4,l_3,l_3) QUICK(l_5) -> MATCH_4(l_5,l_5) -> Rules: append(l1_2,l2_1) -> match_0(l1_2,l2_1,l1_2) match_0(l1_2,l2_1,Cons(x,l)) -> Cons(x,append(l,l2_1)) match_0(l1_2,l2_1,Nil) -> l2_1 match_1(a_4,l_3,Cons(x,l')) -> match_2(x,l',a_4,l_3,part(a_4,l')) match_1(a_4,l_3,Nil) -> Pair(Nil,Nil) match_2(x,l',a_4,l_3,Pair(l1,l2)) -> match_3(l1,l2,x,l',a_4,l_3,test(a_4,x)) match_3(l1,l2,x,l',a_4,l_3,False) -> Pair(Cons(x,l1),l2) match_3(l1,l2,x,l',a_4,l_3,True) -> Pair(l1,Cons(x,l2)) match_4(l_5,Cons(a,l')) -> match_5(a,l',l_5,part(a,l')) match_4(l_5,Nil) -> Nil match_5(a,l',l_5,Pair(l1,l2)) -> append(quick(l1),Cons(a,quick(l2))) part(a_4,l_3) -> match_1(a_4,l_3,l_3) quick(l_5) -> match_4(l_5,l_5) test(x_0,y) -> False test(x_0,y) -> True ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: MATCH_1(a_4,l_3,Cons(x,l')) -> PART(a_4,l') popout

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

job log

popout

actions

all output return to TRS Condi 20667