details

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

run statistics

property	value
solver	NaTT
configuration	Default
runtime (wallclock)	0.450261116028 seconds
cpu usage	0.515575853
max memory	2.3384064E7

stage attributes

key	value
output-size	8150
starexec-result	MAYBE

output

/export/starexec/sandbox/solver/bin/starexec_run_Default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- MAYBE Input TRS: 1: le(s(x),0()) -> false() 2: le(0(),y) -> true() 3: le(s(x),s(y)) -> le(x,y) 4: double(0()) -> 0() 5: double(s(x)) -> s(s(double(x))) 6: log(0()) -> logError() 7: log(s(x)) -> loop(s(x),s(0()),0()) 8: loop(x,s(y),z) -> if(le(x,s(y)),x,s(y),z) 9: if(true(),x,y,z) -> z 10: if(false(),x,y,z) -> loop(x,double(y),s(z)) 11: maplog(xs) -> mapIter(xs,nil()) 12: mapIter(xs,ys) -> ifmap(isempty(xs),xs,ys) 13: ifmap(true(),xs,ys) -> ys 14: ifmap(false(),xs,ys) -> mapIter(droplast(xs),cons(log(last(xs)),ys)) 15: isempty(nil()) -> true() 16: isempty(cons(x,xs)) -> false() 17: last(nil()) -> error() 18: last(cons(x,nil())) -> x 19: last(cons(x,cons(y,xs))) -> last(cons(y,xs)) 20: droplast(nil()) -> nil() 21: droplast(cons(x,nil())) -> nil() 22: droplast(cons(x,cons(y,xs))) -> cons(x,droplast(cons(y,xs))) 23: a() -> b() 24: a() -> c() Number of strict rules: 24 Direct POLO(bPol) ... failed. Uncurrying droplast last 1: le(s(x),0()) -> false() 2: le(0(),y) -> true() 3: le(s(x),s(y)) -> le(x,y) 4: double(0()) -> 0() 5: double(s(x)) -> s(s(double(x))) 6: log(0()) -> logError() 7: log(s(x)) -> loop(s(x),s(0()),0()) 8: loop(x,s(y),z) -> if(le(x,s(y)),x,s(y),z) 9: if(true(),x,y,z) -> z 10: if(false(),x,y,z) -> loop(x,double(y),s(z)) 11: maplog(xs) -> mapIter(xs,nil()) 12: mapIter(xs,ys) -> ifmap(isempty(xs),xs,ys) 13: ifmap(true(),xs,ys) -> ys 14: ifmap(false(),xs,ys) -> mapIter(droplast(xs),cons(log(last(xs)),ys)) 15: isempty(nil()) -> true() 16: isempty(cons(x,xs)) -> false() 17: last^1_nil() -> error() 18: last^1_cons(x,nil()) -> x 19: last^1_cons(x,cons(y,xs)) -> last^1_cons(y,xs) 20: droplast^1_nil() -> nil() 21: droplast^1_cons(x,nil()) -> nil() 22: droplast^1_cons(x,cons(y,xs)) -> cons(x,droplast^1_cons(y,xs)) 23: a() -> b() 24: a() -> c() 25: last(cons(_1,_2)) ->= last^1_cons(_1,_2) 26: last(nil()) ->= last^1_nil() 27: droplast(cons(_1,_2)) ->= droplast^1_cons(_1,_2) 28: droplast(nil()) ->= droplast^1_nil() Number of strict rules: 24 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #maplog(xs) -> #mapIter(xs,nil()) #2: #mapIter(xs,ys) -> #ifmap(isempty(xs),xs,ys) #3: #mapIter(xs,ys) -> #isempty(xs) #4: #ifmap(false(),xs,ys) -> #mapIter(droplast(xs),cons(log(last(xs)),ys)) #5: #ifmap(false(),xs,ys) -> #droplast(xs) #6: #ifmap(false(),xs,ys) -> #log(last(xs)) #7: #ifmap(false(),xs,ys) -> #last(xs) #8: #last(cons(_1,_2)) ->? #last^1_cons(_1,_2) #9: #log(s(x)) -> #loop(s(x),s(0()),0()) #10: #if(false(),x,y,z) -> #loop(x,double(y),s(z)) #11: #if(false(),x,y,z) -> #double(y) #12: #double(s(x)) -> #double(x) #13: #droplast(nil()) ->? #droplast^1_nil() #14: #droplast^1_cons(x,cons(y,xs)) -> #droplast^1_cons(y,xs) #15: #droplast(cons(_1,_2)) ->? #droplast^1_cons(_1,_2) #16: #last^1_cons(x,cons(y,xs)) -> #last^1_cons(y,xs) #17: #last(nil()) ->? #last^1_nil() #18: #le(s(x),s(y)) -> #le(x,y) #19: #loop(x,s(y),z) -> #if(le(x,s(y)),x,s(y),z) #20: #loop(x,s(y),z) -> #le(x,s(y)) Number of SCCs: 6, DPs: 8 SCC { #12 } POLO(Sum)... succeeded. #droplast w: 0 a w: 0 droplast^1_cons w: 0 isempty w: 0 le w: 0 mapIter w: 0 logError w: 0 s w: x1 + 1 #le w: 0 ifmap w: 0 b w: 0 popout

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

job log

popout

actions

all output return to TRS Stand 20472