Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381711098
details
property
value
status
complete
benchmark
rta1.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n114.star.cs.uiowa.edu
space
AProVE_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.0468230247498 seconds
cpu usage
0.031226009
max memory
3321856.0
stage attributes
key
value
output-size
5569
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 x y) (RULES ack(0,y) -> s(y) ack(s(x),0) -> ack(x,s(0)) ack(s(x),s(y)) -> ack(x,plus(y,ack(s(x),y))) plus(0,y) -> y plus(s(0),y) -> s(y) plus(s(s(x)),y) -> s(plus(x,s(y))) plus(x,s(s(y))) -> s(plus(s(x),y)) ) Problem 1: Dependency Pairs Processor: -> Pairs: ACK(s(x),0) -> ACK(x,s(0)) ACK(s(x),s(y)) -> ACK(s(x),y) ACK(s(x),s(y)) -> ACK(x,plus(y,ack(s(x),y))) ACK(s(x),s(y)) -> PLUS(y,ack(s(x),y)) PLUS(s(s(x)),y) -> PLUS(x,s(y)) PLUS(x,s(s(y))) -> PLUS(s(x),y) -> Rules: ack(0,y) -> s(y) ack(s(x),0) -> ack(x,s(0)) ack(s(x),s(y)) -> ack(x,plus(y,ack(s(x),y))) plus(0,y) -> y plus(s(0),y) -> s(y) plus(s(s(x)),y) -> s(plus(x,s(y))) plus(x,s(s(y))) -> s(plus(s(x),y)) Problem 1: SCC Processor: -> Pairs: ACK(s(x),0) -> ACK(x,s(0)) ACK(s(x),s(y)) -> ACK(s(x),y) ACK(s(x),s(y)) -> ACK(x,plus(y,ack(s(x),y))) ACK(s(x),s(y)) -> PLUS(y,ack(s(x),y)) PLUS(s(s(x)),y) -> PLUS(x,s(y)) PLUS(x,s(s(y))) -> PLUS(s(x),y) -> Rules: ack(0,y) -> s(y) ack(s(x),0) -> ack(x,s(0)) ack(s(x),s(y)) -> ack(x,plus(y,ack(s(x),y))) plus(0,y) -> y plus(s(0),y) -> s(y) plus(s(s(x)),y) -> s(plus(x,s(y))) plus(x,s(s(y))) -> s(plus(s(x),y)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: PLUS(s(s(x)),y) -> PLUS(x,s(y)) PLUS(x,s(s(y))) -> PLUS(s(x),y) ->->-> Rules: ack(0,y) -> s(y) ack(s(x),0) -> ack(x,s(0)) ack(s(x),s(y)) -> ack(x,plus(y,ack(s(x),y))) plus(0,y) -> y plus(s(0),y) -> s(y) plus(s(s(x)),y) -> s(plus(x,s(y))) plus(x,s(s(y))) -> s(plus(s(x),y)) ->->Cycle: ->->-> Pairs: ACK(s(x),0) -> ACK(x,s(0)) ACK(s(x),s(y)) -> ACK(s(x),y) ACK(s(x),s(y)) -> ACK(x,plus(y,ack(s(x),y))) ->->-> Rules: ack(0,y) -> s(y) ack(s(x),0) -> ack(x,s(0)) ack(s(x),s(y)) -> ack(x,plus(y,ack(s(x),y))) plus(0,y) -> y plus(s(0),y) -> s(y) plus(s(s(x)),y) -> s(plus(x,s(y))) plus(x,s(s(y))) -> s(plus(s(x),y)) The problem is decomposed in 2 subproblems. Problem 1.1: Reduction Pair Processor: -> Pairs: PLUS(s(s(x)),y) -> PLUS(x,s(y)) PLUS(x,s(s(y))) -> PLUS(s(x),y) -> Rules: ack(0,y) -> s(y) ack(s(x),0) -> ack(x,s(0)) ack(s(x),s(y)) -> ack(x,plus(y,ack(s(x),y))) plus(0,y) -> y plus(s(0),y) -> s(y)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472