Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381713359
details
property
value
status
complete
benchmark
TreeSize.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n094.star.cs.uiowa.edu
space
Applicative_05
run statistics
property
value
solver
ttt2-1.17+nonreach
configuration
ttt2-1.17+nonreach
runtime (wallclock)
0.652255058289 seconds
cpu usage
1.271422133
max memory
2.28450304E8
stage attributes
key
value
output-size
11500
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem: app(app(map(),f),nil()) -> nil() app(app(map(),f),app(app(cons(),x),xs)) -> app(app(cons(),app(f,x)),app(app(map(),f),xs)) app(sum(),app(app(cons(),x),xs)) -> app(app(plus(),x),app(sum(),xs)) app(size(),app(app(node(),x),xs)) -> app(s(),app(sum(),app(app(map(),size()),xs))) app(app(plus(),0()),x) -> 0() app(app(plus(),app(s(),x)),y) -> app(s(),app(app(plus(),x),y)) Proof: Extended Uncurrying Processor: application symbol: app symbol table: 0 ==> 00/0 s ==> s0/0 s1/1 node ==> node0/0 node1/1 node2/2 size ==> size0/0 size1/1 plus ==> plus0/0 plus1/1 plus2/2 sum ==> sum0/0 sum1/1 cons ==> cons0/0 cons1/1 cons2/2 nil ==> nil0/0 map ==> map0/0 map1/1 map2/2 uncurry-rules: app(map1(x4),x5) -> map2(x4,x5) app(map0(),x4) -> map1(x4) app(cons1(x8),x9) -> cons2(x8,x9) app(cons0(),x8) -> cons1(x8) app(sum0(),x11) -> sum1(x11) app(plus1(x13),x14) -> plus2(x13,x14) app(plus0(),x13) -> plus1(x13) app(size0(),x16) -> size1(x16) app(node1(x18),x19) -> node2(x18,x19) app(node0(),x18) -> node1(x18) app(s0(),x21) -> s1(x21) eta-rules: problem: map2(f,nil0()) -> nil0() map2(f,cons2(x,xs)) -> cons2(app(f,x),map2(f,xs)) sum1(cons2(x,xs)) -> plus2(x,sum1(xs)) size1(node2(x,xs)) -> s1(sum1(map2(size0(),xs))) plus2(00(),x) -> 00() plus2(s1(x),y) -> s1(plus2(x,y)) app(map1(x4),x5) -> map2(x4,x5) app(map0(),x4) -> map1(x4) app(cons1(x8),x9) -> cons2(x8,x9) app(cons0(),x8) -> cons1(x8) app(sum0(),x11) -> sum1(x11) app(plus1(x13),x14) -> plus2(x13,x14) app(plus0(),x13) -> plus1(x13) app(size0(),x16) -> size1(x16) app(node1(x18),x19) -> node2(x18,x19) app(node0(),x18) -> node1(x18) app(s0(),x21) -> s1(x21) DP Processor: DPs: map{2,#}(f,cons2(x,xs)) -> map{2,#}(f,xs) map{2,#}(f,cons2(x,xs)) -> app#(f,x) sum{1,#}(cons2(x,xs)) -> sum{1,#}(xs) sum{1,#}(cons2(x,xs)) -> plus{2,#}(x,sum1(xs)) size{1,#}(node2(x,xs)) -> map{2,#}(size0(),xs) size{1,#}(node2(x,xs)) -> sum{1,#}(map2(size0(),xs)) plus{2,#}(s1(x),y) -> plus{2,#}(x,y) app#(map1(x4),x5) -> map{2,#}(x4,x5) app#(sum0(),x11) -> sum{1,#}(x11) app#(plus1(x13),x14) -> plus{2,#}(x13,x14) app#(size0(),x16) -> size{1,#}(x16) TRS: map2(f,nil0()) -> nil0() map2(f,cons2(x,xs)) -> cons2(app(f,x),map2(f,xs)) sum1(cons2(x,xs)) -> plus2(x,sum1(xs)) size1(node2(x,xs)) -> s1(sum1(map2(size0(),xs))) plus2(00(),x) -> 00() plus2(s1(x),y) -> s1(plus2(x,y)) app(map1(x4),x5) -> map2(x4,x5) app(map0(),x4) -> map1(x4) app(cons1(x8),x9) -> cons2(x8,x9) app(cons0(),x8) -> cons1(x8) app(sum0(),x11) -> sum1(x11) app(plus1(x13),x14) -> plus2(x13,x14) app(plus0(),x13) -> plus1(x13) app(size0(),x16) -> size1(x16) app(node1(x18),x19) -> node2(x18,x19) app(node0(),x18) -> node1(x18) app(s0(),x21) -> s1(x21) TDG Processor: DPs: map{2,#}(f,cons2(x,xs)) -> map{2,#}(f,xs) map{2,#}(f,cons2(x,xs)) -> app#(f,x) sum{1,#}(cons2(x,xs)) -> sum{1,#}(xs) sum{1,#}(cons2(x,xs)) -> plus{2,#}(x,sum1(xs)) size{1,#}(node2(x,xs)) -> map{2,#}(size0(),xs)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472