Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381711909
details
property
value
status
complete
benchmark
test830.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n013.star.cs.uiowa.edu
space
Strategy_removed_mixed_05
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.0532209873199 seconds
cpu usage
0.029965657
max memory
3452928.0
stage attributes
key
value
output-size
3325
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(s(X)) -> f(X) g(cons(0,Y)) -> g(Y) g(cons(s(X),Y)) -> s(X) h(cons(X,Y)) -> h(g(cons(X,Y))) ) Problem 1: Innermost Equivalent Processor: -> Rules: f(s(X)) -> f(X) g(cons(0,Y)) -> g(Y) g(cons(s(X),Y)) -> s(X) h(cons(X,Y)) -> h(g(cons(X,Y))) -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: F(s(X)) -> F(X) G(cons(0,Y)) -> G(Y) H(cons(X,Y)) -> G(cons(X,Y)) H(cons(X,Y)) -> H(g(cons(X,Y))) -> Rules: f(s(X)) -> f(X) g(cons(0,Y)) -> g(Y) g(cons(s(X),Y)) -> s(X) h(cons(X,Y)) -> h(g(cons(X,Y))) Problem 1: SCC Processor: -> Pairs: F(s(X)) -> F(X) G(cons(0,Y)) -> G(Y) H(cons(X,Y)) -> G(cons(X,Y)) H(cons(X,Y)) -> H(g(cons(X,Y))) -> Rules: f(s(X)) -> f(X) g(cons(0,Y)) -> g(Y) g(cons(s(X),Y)) -> s(X) h(cons(X,Y)) -> h(g(cons(X,Y))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: G(cons(0,Y)) -> G(Y) ->->-> Rules: f(s(X)) -> f(X) g(cons(0,Y)) -> g(Y) g(cons(s(X),Y)) -> s(X) h(cons(X,Y)) -> h(g(cons(X,Y))) ->->Cycle: ->->-> Pairs: H(cons(X,Y)) -> H(g(cons(X,Y))) ->->-> Rules: f(s(X)) -> f(X) g(cons(0,Y)) -> g(Y) g(cons(s(X),Y)) -> s(X) h(cons(X,Y)) -> h(g(cons(X,Y))) ->->Cycle: ->->-> Pairs: F(s(X)) -> F(X) ->->-> Rules: f(s(X)) -> f(X) g(cons(0,Y)) -> g(Y) g(cons(s(X),Y)) -> s(X) h(cons(X,Y)) -> h(g(cons(X,Y))) The problem is decomposed in 3 subproblems. Problem 1.1: Subterm Processor: -> Pairs: G(cons(0,Y)) -> G(Y) -> Rules: f(s(X)) -> f(X) g(cons(0,Y)) -> g(Y) g(cons(s(X),Y)) -> s(X) h(cons(X,Y)) -> h(g(cons(X,Y))) ->Projection: pi(G) = 1 Problem 1.1:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472