details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.0511479377747 seconds
cpu usage	0.01821915
max memory	1531904.0

stage attributes

key	value
output-size	2102
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 v_NonEmpty:S a:S b:S c:S k:S l:S x:S) (RULES f(cons(x:S,k:S),l:S) -> g(k:S,l:S,cons(x:S,k:S)) f(empty,l:S) -> l:S g(a:S,b:S,c:S) -> f(a:S,cons(b:S,c:S)) ) Problem 1: Innermost Equivalent Processor: -> Rules: f(cons(x:S,k:S),l:S) -> g(k:S,l:S,cons(x:S,k:S)) f(empty,l:S) -> l:S g(a:S,b:S,c:S) -> f(a:S,cons(b:S,c:S)) -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: F(cons(x:S,k:S),l:S) -> G(k:S,l:S,cons(x:S,k:S)) G(a:S,b:S,c:S) -> F(a:S,cons(b:S,c:S)) -> Rules: f(cons(x:S,k:S),l:S) -> g(k:S,l:S,cons(x:S,k:S)) f(empty,l:S) -> l:S g(a:S,b:S,c:S) -> f(a:S,cons(b:S,c:S)) Problem 1: SCC Processor: -> Pairs: F(cons(x:S,k:S),l:S) -> G(k:S,l:S,cons(x:S,k:S)) G(a:S,b:S,c:S) -> F(a:S,cons(b:S,c:S)) -> Rules: f(cons(x:S,k:S),l:S) -> g(k:S,l:S,cons(x:S,k:S)) f(empty,l:S) -> l:S g(a:S,b:S,c:S) -> f(a:S,cons(b:S,c:S)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: F(cons(x:S,k:S),l:S) -> G(k:S,l:S,cons(x:S,k:S)) G(a:S,b:S,c:S) -> F(a:S,cons(b:S,c:S)) ->->-> Rules: f(cons(x:S,k:S),l:S) -> g(k:S,l:S,cons(x:S,k:S)) f(empty,l:S) -> l:S g(a:S,b:S,c:S) -> f(a:S,cons(b:S,c:S)) Problem 1: Subterm Processor: -> Pairs: F(cons(x:S,k:S),l:S) -> G(k:S,l:S,cons(x:S,k:S)) G(a:S,b:S,c:S) -> F(a:S,cons(b:S,c:S)) -> Rules: f(cons(x:S,k:S),l:S) -> g(k:S,l:S,cons(x:S,k:S)) f(empty,l:S) -> l:S g(a:S,b:S,c:S) -> f(a:S,cons(b:S,c:S)) ->Projection: pi(F) = 1 pi(G) = 1 Problem 1: SCC Processor: -> Pairs: G(a:S,b:S,c:S) -> F(a:S,cons(b:S,c:S)) -> Rules: f(cons(x:S,k:S),l:S) -> g(k:S,l:S,cons(x:S,k:S)) f(empty,l:S) -> l:S g(a:S,b:S,c:S) -> f(a:S,cons(b:S,c:S)) ->Strongly Connected Components: There is no strongly connected component The problem is finite. popout

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

job log

popout

actions

all output return to TRS Standard