Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Conditional pair #487562965
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
n022.star.cs.uiowa.edu
space
Mixed_CTRS
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
0.0737738609314 seconds
cpu usage
0.064594101
max memory
4808704.0
stage attributes
key
value
output-size
15657
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 v_NonEmpty:S a:S a_4:S l:S l':S l1:S l1_2:S l2:S l2_1:S l_3:S l_5:S x:S x_0:S y:S) (RULES append(l1_2:S,l2_1:S) -> match_0(l1_2:S,l2_1:S,l1_2:S) match_0(l1_2:S,l2_1:S,Cons(x:S,l:S)) -> Cons(x:S,append(l:S,l2_1:S)) match_0(l1_2:S,l2_1:S,Nil) -> l2_1:S match_1(a_4:S,l_3:S,Cons(x:S,l':S)) -> match_2(x:S,l':S,a_4:S,l_3:S,part(a_4:S,l':S)) match_1(a_4:S,l_3:S,Nil) -> Pair(Nil,Nil) match_2(x:S,l':S,a_4:S,l_3:S,Pair(l1:S,l2:S)) -> match_3(l1:S,l2:S,x:S,l':S,a_4:S,l_3:S,test(a_4:S,x:S)) match_3(l1:S,l2:S,x:S,l':S,a_4:S,l_3:S,False) -> Pair(Cons(x:S,l1:S),l2:S) match_3(l1:S,l2:S,x:S,l':S,a_4:S,l_3:S,True) -> Pair(l1:S,Cons(x:S,l2:S)) match_4(l_5:S,Cons(a:S,l':S)) -> match_5(a:S,l':S,l_5:S,part(a:S,l':S)) match_4(l_5:S,Nil) -> Nil match_5(a:S,l':S,l_5:S,Pair(l1:S,l2:S)) -> append(quick(l1:S),Cons(a:S,quick(l2:S))) part(a_4:S,l_3:S) -> match_1(a_4:S,l_3:S,l_3:S) quick(l_5:S) -> match_4(l_5:S,l_5:S) test(x_0:S,y:S) -> False test(x_0:S,y:S) -> True ) Problem 1: Dependency Pairs Processor: -> Pairs: APPEND(l1_2:S,l2_1:S) -> MATCH_0(l1_2:S,l2_1:S,l1_2:S) MATCH_0(l1_2:S,l2_1:S,Cons(x:S,l:S)) -> APPEND(l:S,l2_1:S) MATCH_1(a_4:S,l_3:S,Cons(x:S,l':S)) -> MATCH_2(x:S,l':S,a_4:S,l_3:S,part(a_4:S,l':S)) MATCH_1(a_4:S,l_3:S,Cons(x:S,l':S)) -> PART(a_4:S,l':S) MATCH_2(x:S,l':S,a_4:S,l_3:S,Pair(l1:S,l2:S)) -> MATCH_3(l1:S,l2:S,x:S,l':S,a_4:S,l_3:S,test(a_4:S,x:S)) MATCH_2(x:S,l':S,a_4:S,l_3:S,Pair(l1:S,l2:S)) -> TEST(a_4:S,x:S) MATCH_4(l_5:S,Cons(a:S,l':S)) -> MATCH_5(a:S,l':S,l_5:S,part(a:S,l':S)) MATCH_4(l_5:S,Cons(a:S,l':S)) -> PART(a:S,l':S) MATCH_5(a:S,l':S,l_5:S,Pair(l1:S,l2:S)) -> APPEND(quick(l1:S),Cons(a:S,quick(l2:S))) MATCH_5(a:S,l':S,l_5:S,Pair(l1:S,l2:S)) -> QUICK(l1:S) MATCH_5(a:S,l':S,l_5:S,Pair(l1:S,l2:S)) -> QUICK(l2:S) PART(a_4:S,l_3:S) -> MATCH_1(a_4:S,l_3:S,l_3:S) QUICK(l_5:S) -> MATCH_4(l_5:S,l_5:S) -> Rules: append(l1_2:S,l2_1:S) -> match_0(l1_2:S,l2_1:S,l1_2:S) match_0(l1_2:S,l2_1:S,Cons(x:S,l:S)) -> Cons(x:S,append(l:S,l2_1:S)) match_0(l1_2:S,l2_1:S,Nil) -> l2_1:S match_1(a_4:S,l_3:S,Cons(x:S,l':S)) -> match_2(x:S,l':S,a_4:S,l_3:S,part(a_4:S,l':S)) match_1(a_4:S,l_3:S,Nil) -> Pair(Nil,Nil) match_2(x:S,l':S,a_4:S,l_3:S,Pair(l1:S,l2:S)) -> match_3(l1:S,l2:S,x:S,l':S,a_4:S,l_3:S,test(a_4:S,x:S)) match_3(l1:S,l2:S,x:S,l':S,a_4:S,l_3:S,False) -> Pair(Cons(x:S,l1:S),l2:S) match_3(l1:S,l2:S,x:S,l':S,a_4:S,l_3:S,True) -> Pair(l1:S,Cons(x:S,l2:S)) match_4(l_5:S,Cons(a:S,l':S)) -> match_5(a:S,l':S,l_5:S,part(a:S,l':S)) match_4(l_5:S,Nil) -> Nil match_5(a:S,l':S,l_5:S,Pair(l1:S,l2:S)) -> append(quick(l1:S),Cons(a:S,quick(l2:S))) part(a_4:S,l_3:S) -> match_1(a_4:S,l_3:S,l_3:S) quick(l_5:S) -> match_4(l_5:S,l_5:S) test(x_0:S,y:S) -> False test(x_0:S,y:S) -> True Problem 1: SCC Processor: -> Pairs: APPEND(l1_2:S,l2_1:S) -> MATCH_0(l1_2:S,l2_1:S,l1_2:S) MATCH_0(l1_2:S,l2_1:S,Cons(x:S,l:S)) -> APPEND(l:S,l2_1:S) MATCH_1(a_4:S,l_3:S,Cons(x:S,l':S)) -> MATCH_2(x:S,l':S,a_4:S,l_3:S,part(a_4:S,l':S)) MATCH_1(a_4:S,l_3:S,Cons(x:S,l':S)) -> PART(a_4:S,l':S) MATCH_2(x:S,l':S,a_4:S,l_3:S,Pair(l1:S,l2:S)) -> MATCH_3(l1:S,l2:S,x:S,l':S,a_4:S,l_3:S,test(a_4:S,x:S)) MATCH_2(x:S,l':S,a_4:S,l_3:S,Pair(l1:S,l2:S)) -> TEST(a_4:S,x:S) MATCH_4(l_5:S,Cons(a:S,l':S)) -> MATCH_5(a:S,l':S,l_5:S,part(a:S,l':S)) MATCH_4(l_5:S,Cons(a:S,l':S)) -> PART(a:S,l':S) MATCH_5(a:S,l':S,l_5:S,Pair(l1:S,l2:S)) -> APPEND(quick(l1:S),Cons(a:S,quick(l2:S))) MATCH_5(a:S,l':S,l_5:S,Pair(l1:S,l2:S)) -> QUICK(l1:S) MATCH_5(a:S,l':S,l_5:S,Pair(l1:S,l2:S)) -> QUICK(l2:S) PART(a_4:S,l_3:S) -> MATCH_1(a_4:S,l_3:S,l_3:S) QUICK(l_5:S) -> MATCH_4(l_5:S,l_5:S) -> Rules: append(l1_2:S,l2_1:S) -> match_0(l1_2:S,l2_1:S,l1_2:S) match_0(l1_2:S,l2_1:S,Cons(x:S,l:S)) -> Cons(x:S,append(l:S,l2_1:S)) match_0(l1_2:S,l2_1:S,Nil) -> l2_1:S match_1(a_4:S,l_3:S,Cons(x:S,l':S)) -> match_2(x:S,l':S,a_4:S,l_3:S,part(a_4:S,l':S)) match_1(a_4:S,l_3:S,Nil) -> Pair(Nil,Nil) match_2(x:S,l':S,a_4:S,l_3:S,Pair(l1:S,l2:S)) -> match_3(l1:S,l2:S,x:S,l':S,a_4:S,l_3:S,test(a_4:S,x:S)) match_3(l1:S,l2:S,x:S,l':S,a_4:S,l_3:S,False) -> Pair(Cons(x:S,l1:S),l2:S) match_3(l1:S,l2:S,x:S,l':S,a_4:S,l_3:S,True) -> Pair(l1:S,Cons(x:S,l2:S)) match_4(l_5:S,Cons(a:S,l':S)) -> match_5(a:S,l':S,l_5:S,part(a:S,l':S)) match_4(l_5:S,Nil) -> Nil match_5(a:S,l':S,l_5:S,Pair(l1:S,l2:S)) -> append(quick(l1:S),Cons(a:S,quick(l2:S))) part(a_4:S,l_3:S) -> match_1(a_4:S,l_3:S,l_3:S) quick(l_5:S) -> match_4(l_5:S,l_5:S) test(x_0:S,y:S) -> False test(x_0:S,y:S) -> True ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: MATCH_1(a_4:S,l_3:S,Cons(x:S,l':S)) -> PART(a_4:S,l':S)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Conditional