Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Conte Sensi 17651 pair #381733418
details
property
value
status
complete
benchmark
Ex4_7_15_Bor03.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n040.star.cs.uiowa.edu
space
CSR_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.0292890071869 seconds
cpu usage
0.02687372
max memory
3092480.0
stage attributes
key
value
output-size
1758
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: (STRATEGY CONTEXTSENSITIVE (f 1) (p 1) (0) (cons 1) (s 1) ) (RULES f(0) -> cons(0,f(s(0))) f(s(0)) -> f(p(s(0))) p(s(0)) -> 0 ) Problem 1: Innermost Equivalent Processor: -> Rules: f(0) -> cons(0,f(s(0))) f(s(0)) -> f(p(s(0))) p(s(0)) -> 0 -> The context-sensitive term rewriting system is an orthogonal system. Therefore, innermost cs-termination implies cs-termination. Problem 1: Dependency Pairs Processor: -> Pairs: F(s(0)) -> F(p(s(0))) F(s(0)) -> P(s(0)) -> Rules: f(0) -> cons(0,f(s(0))) f(s(0)) -> f(p(s(0))) p(s(0)) -> 0 -> Unhiding Rules: Empty Problem 1: SCC Processor: -> Pairs: F(s(0)) -> F(p(s(0))) F(s(0)) -> P(s(0)) -> Rules: f(0) -> cons(0,f(s(0))) f(s(0)) -> f(p(s(0))) p(s(0)) -> 0 -> Unhiding rules: Empty ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: F(s(0)) -> F(p(s(0))) ->->-> Rules: f(0) -> cons(0,f(s(0))) f(s(0)) -> f(p(s(0))) p(s(0)) -> 0 ->->-> Unhiding rules: Empty Problem 1: Reduction Pairs Processor: -> Pairs: F(s(0)) -> F(p(s(0))) -> Rules: f(0) -> cons(0,f(s(0))) f(s(0)) -> f(p(s(0))) p(s(0)) -> 0 -> Unhiding rules: Empty -> Usable rules: p(s(0)) -> 0 ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [p](X) = 2 [0] = 2 [s](X) = 2.X + 2 [F](X) = 2.X Problem 1: Basic Processor:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Conte Sensi 17651