details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.24875497818 seconds
cpu usage	0.197305686
max memory	3895296.0

stage attributes

key	value
output-size	7036
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 x:S y:S z:S) (RULES a(a(x:S,y:S),z:S) -> a(x:S,a(y:S,z:S)) a(lambda(x:S),y:S) -> lambda(a(x:S,a(y:S,t))) a(lambda(x:S),y:S) -> lambda(a(x:S,1)) a(x:S,y:S) -> x:S a(x:S,y:S) -> y:S lambda(x:S) -> x:S ) Problem 1: Dependency Pairs Processor: -> Pairs: A(a(x:S,y:S),z:S) -> A(x:S,a(y:S,z:S)) A(a(x:S,y:S),z:S) -> A(y:S,z:S) A(lambda(x:S),y:S) -> A(x:S,a(y:S,t)) A(lambda(x:S),y:S) -> A(x:S,1) A(lambda(x:S),y:S) -> A(y:S,t) A(lambda(x:S),y:S) -> LAMBDA(a(x:S,a(y:S,t))) A(lambda(x:S),y:S) -> LAMBDA(a(x:S,1)) -> Rules: a(a(x:S,y:S),z:S) -> a(x:S,a(y:S,z:S)) a(lambda(x:S),y:S) -> lambda(a(x:S,a(y:S,t))) a(lambda(x:S),y:S) -> lambda(a(x:S,1)) a(x:S,y:S) -> x:S a(x:S,y:S) -> y:S lambda(x:S) -> x:S Problem 1: SCC Processor: -> Pairs: A(a(x:S,y:S),z:S) -> A(x:S,a(y:S,z:S)) A(a(x:S,y:S),z:S) -> A(y:S,z:S) A(lambda(x:S),y:S) -> A(x:S,a(y:S,t)) A(lambda(x:S),y:S) -> A(x:S,1) A(lambda(x:S),y:S) -> A(y:S,t) A(lambda(x:S),y:S) -> LAMBDA(a(x:S,a(y:S,t))) A(lambda(x:S),y:S) -> LAMBDA(a(x:S,1)) -> Rules: a(a(x:S,y:S),z:S) -> a(x:S,a(y:S,z:S)) a(lambda(x:S),y:S) -> lambda(a(x:S,a(y:S,t))) a(lambda(x:S),y:S) -> lambda(a(x:S,1)) a(x:S,y:S) -> x:S a(x:S,y:S) -> y:S lambda(x:S) -> x:S ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A(a(x:S,y:S),z:S) -> A(x:S,a(y:S,z:S)) A(a(x:S,y:S),z:S) -> A(y:S,z:S) A(lambda(x:S),y:S) -> A(x:S,a(y:S,t)) A(lambda(x:S),y:S) -> A(x:S,1) A(lambda(x:S),y:S) -> A(y:S,t) ->->-> Rules: a(a(x:S,y:S),z:S) -> a(x:S,a(y:S,z:S)) a(lambda(x:S),y:S) -> lambda(a(x:S,a(y:S,t))) a(lambda(x:S),y:S) -> lambda(a(x:S,1)) a(x:S,y:S) -> x:S a(x:S,y:S) -> y:S lambda(x:S) -> x:S Problem 1: Reduction Pair Processor: -> Pairs: A(a(x:S,y:S),z:S) -> A(x:S,a(y:S,z:S)) A(a(x:S,y:S),z:S) -> A(y:S,z:S) A(lambda(x:S),y:S) -> A(x:S,a(y:S,t)) A(lambda(x:S),y:S) -> A(x:S,1) A(lambda(x:S),y:S) -> A(y:S,t) -> Rules: a(a(x:S,y:S),z:S) -> a(x:S,a(y:S,z:S)) a(lambda(x:S),y:S) -> lambda(a(x:S,a(y:S,t))) a(lambda(x:S),y:S) -> lambda(a(x:S,1)) a(x:S,y:S) -> x:S a(x:S,y:S) -> y:S lambda(x:S) -> x:S -> Usable rules: a(a(x:S,y:S),z:S) -> a(x:S,a(y:S,z:S)) a(lambda(x:S),y:S) -> lambda(a(x:S,a(y:S,t))) a(lambda(x:S),y:S) -> lambda(a(x:S,1)) a(x:S,y:S) -> x:S a(x:S,y:S) -> y:S lambda(x:S) -> x:S ->Interpretation type: Linear ->Coefficients: Natural Numbers popout

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

job log

popout

actions

all output return to TRS Standard