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