details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.0238018035889 seconds
cpu usage	0.020350168
max memory	2002944.0

stage attributes

key	value
output-size	7525
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 Problem 1: (VAR w x y z) (RULES app(app(eq,app(s,x)),0) -> false app(app(eq,0),app(s,x)) -> false app(app(eq,x),x) -> true app(app(lt,app(s,x)),app(s,y)) -> app(app(lt,x),y) app(app(lt,0),app(s,y)) -> true app(app(lt,y),0) -> false app(app(member,w),app(app(app(fork,x),y),z)) -> app(app(app(if,app(app(lt,w),y)),app(app(member,w),x)),app(app(app(if,app(app(eq,w),y)),true),app(app(member,w),z))) app(app(member,w),null) -> false ) Problem 1: Innermost Equivalent Processor: -> Rules: app(app(eq,app(s,x)),0) -> false app(app(eq,0),app(s,x)) -> false app(app(eq,x),x) -> true app(app(lt,app(s,x)),app(s,y)) -> app(app(lt,x),y) app(app(lt,0),app(s,y)) -> true app(app(lt,y),0) -> false app(app(member,w),app(app(app(fork,x),y),z)) -> app(app(app(if,app(app(lt,w),y)),app(app(member,w),x)),app(app(app(if,app(app(eq,w),y)),true),app(app(member,w),z))) app(app(member,w),null) -> false -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: APP(app(lt,app(s,x)),app(s,y)) -> APP(app(lt,x),y) APP(app(member,w),app(app(app(fork,x),y),z)) -> APP(app(app(if,app(app(eq,w),y)),true),app(app(member,w),z)) APP(app(member,w),app(app(app(fork,x),y),z)) -> APP(app(app(if,app(app(lt,w),y)),app(app(member,w),x)),app(app(app(if,app(app(eq,w),y)),true),app(app(member,w),z))) APP(app(member,w),app(app(app(fork,x),y),z)) -> APP(app(eq,w),y) APP(app(member,w),app(app(app(fork,x),y),z)) -> APP(app(if,app(app(eq,w),y)),true) APP(app(member,w),app(app(app(fork,x),y),z)) -> APP(app(if,app(app(lt,w),y)),app(app(member,w),x)) APP(app(member,w),app(app(app(fork,x),y),z)) -> APP(app(lt,w),y) APP(app(member,w),app(app(app(fork,x),y),z)) -> APP(app(member,w),x) APP(app(member,w),app(app(app(fork,x),y),z)) -> APP(app(member,w),z) APP(app(member,w),app(app(app(fork,x),y),z)) -> APP(if,app(app(eq,w),y)) APP(app(member,w),app(app(app(fork,x),y),z)) -> APP(if,app(app(lt,w),y)) -> Rules: app(app(eq,app(s,x)),0) -> false app(app(eq,0),app(s,x)) -> false app(app(eq,x),x) -> true app(app(lt,app(s,x)),app(s,y)) -> app(app(lt,x),y) app(app(lt,0),app(s,y)) -> true app(app(lt,y),0) -> false app(app(member,w),app(app(app(fork,x),y),z)) -> app(app(app(if,app(app(lt,w),y)),app(app(member,w),x)),app(app(app(if,app(app(eq,w),y)),true),app(app(member,w),z))) app(app(member,w),null) -> false Problem 1: SCC Processor: -> Pairs: APP(app(lt,app(s,x)),app(s,y)) -> APP(app(lt,x),y) APP(app(member,w),app(app(app(fork,x),y),z)) -> APP(app(app(if,app(app(eq,w),y)),true),app(app(member,w),z)) APP(app(member,w),app(app(app(fork,x),y),z)) -> APP(app(app(if,app(app(lt,w),y)),app(app(member,w),x)),app(app(app(if,app(app(eq,w),y)),true),app(app(member,w),z))) APP(app(member,w),app(app(app(fork,x),y),z)) -> APP(app(eq,w),y) APP(app(member,w),app(app(app(fork,x),y),z)) -> APP(app(if,app(app(eq,w),y)),true) APP(app(member,w),app(app(app(fork,x),y),z)) -> APP(app(if,app(app(lt,w),y)),app(app(member,w),x)) APP(app(member,w),app(app(app(fork,x),y),z)) -> APP(app(lt,w),y) APP(app(member,w),app(app(app(fork,x),y),z)) -> APP(app(member,w),x) APP(app(member,w),app(app(app(fork,x),y),z)) -> APP(app(member,w),z) APP(app(member,w),app(app(app(fork,x),y),z)) -> APP(if,app(app(eq,w),y)) APP(app(member,w),app(app(app(fork,x),y),z)) -> APP(if,app(app(lt,w),y)) -> Rules: app(app(eq,app(s,x)),0) -> false app(app(eq,0),app(s,x)) -> false app(app(eq,x),x) -> true app(app(lt,app(s,x)),app(s,y)) -> app(app(lt,x),y) app(app(lt,0),app(s,y)) -> true app(app(lt,y),0) -> false app(app(member,w),app(app(app(fork,x),y),z)) -> app(app(app(if,app(app(lt,w),y)),app(app(member,w),x)),app(app(app(if,app(app(eq,w),y)),true),app(app(member,w),z))) app(app(member,w),null) -> false ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: APP(app(lt,app(s,x)),app(s,y)) -> APP(app(lt,x),y) ->->-> Rules: app(app(eq,app(s,x)),0) -> false app(app(eq,0),app(s,x)) -> false app(app(eq,x),x) -> true app(app(lt,app(s,x)),app(s,y)) -> app(app(lt,x),y) app(app(lt,0),app(s,y)) -> true app(app(lt,y),0) -> false app(app(member,w),app(app(app(fork,x),y),z)) -> app(app(app(if,app(app(lt,w),y)),app(app(member,w),x)),app(app(app(if,app(app(eq,w),y)),true),app(app(member,w),z))) app(app(member,w),null) -> false ->->Cycle: popout

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

job log

popout

actions

all output return to TRS Stand 20472