Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381712654
details
property
value
status
complete
benchmark
jones6.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n191.star.cs.uiowa.edu
space
Mixed_TRS
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.0159151554108 seconds
cpu usage
0.013514787
max memory
1388544.0
stage attributes
key
value
output-size
2648
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: (VAR a d k x) (RULES f(a,cons(x,k)) -> f(cons(x,a),k) f(a,empty) -> g(a,empty) g(cons(x,k),d) -> g(k,cons(x,d)) g(empty,d) -> d ) Problem 1: Innermost Equivalent Processor: -> Rules: f(a,cons(x,k)) -> f(cons(x,a),k) f(a,empty) -> g(a,empty) g(cons(x,k),d) -> g(k,cons(x,d)) g(empty,d) -> d -> 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,cons(x,k)) -> F(cons(x,a),k) F(a,empty) -> G(a,empty) G(cons(x,k),d) -> G(k,cons(x,d)) -> Rules: f(a,cons(x,k)) -> f(cons(x,a),k) f(a,empty) -> g(a,empty) g(cons(x,k),d) -> g(k,cons(x,d)) g(empty,d) -> d Problem 1: SCC Processor: -> Pairs: F(a,cons(x,k)) -> F(cons(x,a),k) F(a,empty) -> G(a,empty) G(cons(x,k),d) -> G(k,cons(x,d)) -> Rules: f(a,cons(x,k)) -> f(cons(x,a),k) f(a,empty) -> g(a,empty) g(cons(x,k),d) -> g(k,cons(x,d)) g(empty,d) -> d ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: G(cons(x,k),d) -> G(k,cons(x,d)) ->->-> Rules: f(a,cons(x,k)) -> f(cons(x,a),k) f(a,empty) -> g(a,empty) g(cons(x,k),d) -> g(k,cons(x,d)) g(empty,d) -> d ->->Cycle: ->->-> Pairs: F(a,cons(x,k)) -> F(cons(x,a),k) ->->-> Rules: f(a,cons(x,k)) -> f(cons(x,a),k) f(a,empty) -> g(a,empty) g(cons(x,k),d) -> g(k,cons(x,d)) g(empty,d) -> d The problem is decomposed in 2 subproblems. Problem 1.1: Subterm Processor: -> Pairs: G(cons(x,k),d) -> G(k,cons(x,d)) -> Rules: f(a,cons(x,k)) -> f(cons(x,a),k) f(a,empty) -> g(a,empty) g(cons(x,k),d) -> g(k,cons(x,d)) g(empty,d) -> d ->Projection: pi(G) = 1 Problem 1.1: SCC Processor: -> Pairs: Empty -> Rules: f(a,cons(x,k)) -> f(cons(x,a),k) f(a,empty) -> g(a,empty) g(cons(x,k),d) -> g(k,cons(x,d)) g(empty,d) -> d ->Strongly Connected Components: There is no strongly connected component
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472