Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Conte Sensi 17651 pair #381733383
details
property
value
status
complete
benchmark
Ex6_Luc98.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n025.star.cs.uiowa.edu
space
CSR_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.015832901001 seconds
cpu usage
0.012349132
max memory
1392640.0
stage attributes
key
value
output-size
1153
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 X Y Z) (STRATEGY CONTEXTSENSITIVE (first 1 2) (from 1) (0) (cons 1) (nil) (s 1) ) (RULES first(0,X) -> nil first(s(X),cons(Y,Z)) -> cons(Y,first(X,Z)) from(X) -> cons(X,from(s(X))) ) Problem 1: Innermost Equivalent Processor: -> Rules: first(0,X) -> nil first(s(X),cons(Y,Z)) -> cons(Y,first(X,Z)) from(X) -> cons(X,from(s(X))) -> The context-sensitive term rewriting system is an orthogonal system. Therefore, innermost cs-termination implies cs-termination. Problem 1: Dependency Pairs Processor: -> Pairs: Empty -> Rules: first(0,X) -> nil first(s(X),cons(Y,Z)) -> cons(Y,first(X,Z)) from(X) -> cons(X,from(s(X))) -> Unhiding Rules: Empty Problem 1: Basic Processor: -> Pairs: Empty -> Rules: first(0,X) -> nil first(s(X),cons(Y,Z)) -> cons(Y,first(X,Z)) from(X) -> cons(X,from(s(X))) -> Unhiding rules: Empty -> Result: Set P is empty The problem is finite.
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Conte Sensi 17651