Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381710785
details
property
value
status
complete
benchmark
jwtpa1.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n039.star.cs.uiowa.edu
space
Waldmann_06
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
1.34512901306 seconds
cpu usage
1.188674466
max memory
1.0141696E7
stage attributes
key
value
output-size
2388
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) (RULES f(f(a,x),y) -> f(y,f(x,f(a,f(h(a),a)))) ) Problem 1: Innermost Equivalent Processor: -> Rules: f(f(a,x),y) -> f(y,f(x,f(a,f(h(a),a)))) -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: F(f(a,x),y) -> F(x,f(a,f(h(a),a))) F(f(a,x),y) -> F(y,f(x,f(a,f(h(a),a)))) -> Rules: f(f(a,x),y) -> f(y,f(x,f(a,f(h(a),a)))) Problem 1: SCC Processor: -> Pairs: F(f(a,x),y) -> F(x,f(a,f(h(a),a))) F(f(a,x),y) -> F(y,f(x,f(a,f(h(a),a)))) -> Rules: f(f(a,x),y) -> f(y,f(x,f(a,f(h(a),a)))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: F(f(a,x),y) -> F(x,f(a,f(h(a),a))) F(f(a,x),y) -> F(y,f(x,f(a,f(h(a),a)))) ->->-> Rules: f(f(a,x),y) -> f(y,f(x,f(a,f(h(a),a)))) Problem 1: Reduction Pairs Processor: -> Pairs: F(f(a,x),y) -> F(x,f(a,f(h(a),a))) F(f(a,x),y) -> F(y,f(x,f(a,f(h(a),a)))) -> Rules: f(f(a,x),y) -> f(y,f(x,f(a,f(h(a),a)))) -> Usable rules: f(f(a,x),y) -> f(y,f(x,f(a,f(h(a),a)))) ->Interpretation type: Simple mixed ->Coefficients: All rationals ->Dimension: 1 ->Bound: 2 ->Interpretation: [f](X1,X2) = X1.X2 + 1/2.X1 [a] = 2 [h](X) = 0 [F](X1,X2) = X1.X2 + X1 Problem 1: SCC Processor: -> Pairs: F(f(a,x),y) -> F(y,f(x,f(a,f(h(a),a)))) -> Rules: f(f(a,x),y) -> f(y,f(x,f(a,f(h(a),a)))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: F(f(a,x),y) -> F(y,f(x,f(a,f(h(a),a)))) ->->-> Rules: f(f(a,x),y) -> f(y,f(x,f(a,f(h(a),a)))) Problem 1: Reduction Pairs Processor: -> Pairs: F(f(a,x),y) -> F(y,f(x,f(a,f(h(a),a)))) -> Rules: f(f(a,x),y) -> f(y,f(x,f(a,f(h(a),a)))) -> Usable rules: f(f(a,x),y) -> f(y,f(x,f(a,f(h(a),a)))) ->Interpretation type: Linear ->Coefficients: All rationals
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472