Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381710608
details
property
value
status
complete
benchmark
ack_prolog.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n092.star.cs.uiowa.edu
space
CiME_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.0187220573425 seconds
cpu usage
0.014888791
max memory
1736704.0
stage attributes
key
value
output-size
4144
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 m n) (RULES ack_in(0,n) -> ack_out(s(n)) ack_in(s(m),0) -> u11(ack_in(m,s(0))) ack_in(s(m),s(n)) -> u21(ack_in(s(m),n),m) u11(ack_out(n)) -> ack_out(n) u21(ack_out(n),m) -> u22(ack_in(m,n)) u22(ack_out(n)) -> ack_out(n) ) Problem 1: Innermost Equivalent Processor: -> Rules: ack_in(0,n) -> ack_out(s(n)) ack_in(s(m),0) -> u11(ack_in(m,s(0))) ack_in(s(m),s(n)) -> u21(ack_in(s(m),n),m) u11(ack_out(n)) -> ack_out(n) u21(ack_out(n),m) -> u22(ack_in(m,n)) u22(ack_out(n)) -> ack_out(n) -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: ACK_IN(s(m),0) -> ACK_IN(m,s(0)) ACK_IN(s(m),0) -> U11(ack_in(m,s(0))) ACK_IN(s(m),s(n)) -> ACK_IN(s(m),n) ACK_IN(s(m),s(n)) -> U21(ack_in(s(m),n),m) U21(ack_out(n),m) -> ACK_IN(m,n) U21(ack_out(n),m) -> U22(ack_in(m,n)) -> Rules: ack_in(0,n) -> ack_out(s(n)) ack_in(s(m),0) -> u11(ack_in(m,s(0))) ack_in(s(m),s(n)) -> u21(ack_in(s(m),n),m) u11(ack_out(n)) -> ack_out(n) u21(ack_out(n),m) -> u22(ack_in(m,n)) u22(ack_out(n)) -> ack_out(n) Problem 1: SCC Processor: -> Pairs: ACK_IN(s(m),0) -> ACK_IN(m,s(0)) ACK_IN(s(m),0) -> U11(ack_in(m,s(0))) ACK_IN(s(m),s(n)) -> ACK_IN(s(m),n) ACK_IN(s(m),s(n)) -> U21(ack_in(s(m),n),m) U21(ack_out(n),m) -> ACK_IN(m,n) U21(ack_out(n),m) -> U22(ack_in(m,n)) -> Rules: ack_in(0,n) -> ack_out(s(n)) ack_in(s(m),0) -> u11(ack_in(m,s(0))) ack_in(s(m),s(n)) -> u21(ack_in(s(m),n),m) u11(ack_out(n)) -> ack_out(n) u21(ack_out(n),m) -> u22(ack_in(m,n)) u22(ack_out(n)) -> ack_out(n) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: ACK_IN(s(m),0) -> ACK_IN(m,s(0)) ACK_IN(s(m),s(n)) -> ACK_IN(s(m),n) ACK_IN(s(m),s(n)) -> U21(ack_in(s(m),n),m) U21(ack_out(n),m) -> ACK_IN(m,n) ->->-> Rules: ack_in(0,n) -> ack_out(s(n)) ack_in(s(m),0) -> u11(ack_in(m,s(0))) ack_in(s(m),s(n)) -> u21(ack_in(s(m),n),m) u11(ack_out(n)) -> ack_out(n) u21(ack_out(n),m) -> u22(ack_in(m,n)) u22(ack_out(n)) -> ack_out(n) Problem 1: Subterm Processor: -> Pairs: ACK_IN(s(m),0) -> ACK_IN(m,s(0)) ACK_IN(s(m),s(n)) -> ACK_IN(s(m),n) ACK_IN(s(m),s(n)) -> U21(ack_in(s(m),n),m) U21(ack_out(n),m) -> ACK_IN(m,n) -> Rules: ack_in(0,n) -> ack_out(s(n)) ack_in(s(m),0) -> u11(ack_in(m,s(0))) ack_in(s(m),s(n)) -> u21(ack_in(s(m),n),m) u11(ack_out(n)) -> ack_out(n) u21(ack_out(n),m) -> u22(ack_in(m,n)) u22(ack_out(n)) -> ack_out(n) ->Projection: pi(ACK_IN) = 1
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472