Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381711761
details
property
value
status
complete
benchmark
PEANO_nokinds_FR.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n102.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.500471115112 seconds
cpu usage
0.516101541
max memory
6938624.0
stage attributes
key
value
output-size
51385
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 V1 V2 X X1 X2) (RULES 0 -> n__0 U11(tt,N) -> activate(N) U21(tt,M,N) -> s(plus(activate(N),activate(M))) activate(n__0) -> 0 activate(n__isNat(X)) -> isNat(X) activate(n__plus(X1,X2)) -> plus(activate(X1),activate(X2)) activate(n__s(X)) -> s(activate(X)) activate(X) -> X and(tt,X) -> activate(X) isNat(n__0) -> tt isNat(n__plus(V1,V2)) -> and(isNat(activate(V1)),n__isNat(activate(V2))) isNat(n__s(V1)) -> isNat(activate(V1)) isNat(X) -> n__isNat(X) plus(N,0) -> U11(isNat(N),N) plus(N,s(M)) -> U21(and(isNat(M),n__isNat(N)),M,N) plus(X1,X2) -> n__plus(X1,X2) s(X) -> n__s(X) ) Problem 1: Dependency Pairs Processor: -> Pairs: U11#(tt,N) -> ACTIVATE(N) U21#(tt,M,N) -> ACTIVATE(M) U21#(tt,M,N) -> ACTIVATE(N) U21#(tt,M,N) -> PLUS(activate(N),activate(M)) U21#(tt,M,N) -> S(plus(activate(N),activate(M))) ACTIVATE(n__0) -> 0# ACTIVATE(n__isNat(X)) -> ISNAT(X) ACTIVATE(n__plus(X1,X2)) -> ACTIVATE(X1) ACTIVATE(n__plus(X1,X2)) -> ACTIVATE(X2) ACTIVATE(n__plus(X1,X2)) -> PLUS(activate(X1),activate(X2)) ACTIVATE(n__s(X)) -> ACTIVATE(X) ACTIVATE(n__s(X)) -> S(activate(X)) AND(tt,X) -> ACTIVATE(X) ISNAT(n__plus(V1,V2)) -> ACTIVATE(V1) ISNAT(n__plus(V1,V2)) -> ACTIVATE(V2) ISNAT(n__plus(V1,V2)) -> AND(isNat(activate(V1)),n__isNat(activate(V2))) ISNAT(n__plus(V1,V2)) -> ISNAT(activate(V1)) ISNAT(n__s(V1)) -> ACTIVATE(V1) ISNAT(n__s(V1)) -> ISNAT(activate(V1)) PLUS(N,0) -> U11#(isNat(N),N) PLUS(N,0) -> ISNAT(N) PLUS(N,s(M)) -> U21#(and(isNat(M),n__isNat(N)),M,N) PLUS(N,s(M)) -> AND(isNat(M),n__isNat(N)) PLUS(N,s(M)) -> ISNAT(M) -> Rules: 0 -> n__0 U11(tt,N) -> activate(N) U21(tt,M,N) -> s(plus(activate(N),activate(M))) activate(n__0) -> 0 activate(n__isNat(X)) -> isNat(X) activate(n__plus(X1,X2)) -> plus(activate(X1),activate(X2)) activate(n__s(X)) -> s(activate(X)) activate(X) -> X and(tt,X) -> activate(X) isNat(n__0) -> tt isNat(n__plus(V1,V2)) -> and(isNat(activate(V1)),n__isNat(activate(V2))) isNat(n__s(V1)) -> isNat(activate(V1)) isNat(X) -> n__isNat(X) plus(N,0) -> U11(isNat(N),N) plus(N,s(M)) -> U21(and(isNat(M),n__isNat(N)),M,N) plus(X1,X2) -> n__plus(X1,X2) s(X) -> n__s(X) Problem 1: SCC Processor: -> Pairs: U11#(tt,N) -> ACTIVATE(N) U21#(tt,M,N) -> ACTIVATE(M) U21#(tt,M,N) -> ACTIVATE(N) U21#(tt,M,N) -> PLUS(activate(N),activate(M)) U21#(tt,M,N) -> S(plus(activate(N),activate(M))) ACTIVATE(n__0) -> 0# ACTIVATE(n__isNat(X)) -> ISNAT(X) ACTIVATE(n__plus(X1,X2)) -> ACTIVATE(X1) ACTIVATE(n__plus(X1,X2)) -> ACTIVATE(X2) ACTIVATE(n__plus(X1,X2)) -> PLUS(activate(X1),activate(X2)) ACTIVATE(n__s(X)) -> ACTIVATE(X) ACTIVATE(n__s(X)) -> S(activate(X)) AND(tt,X) -> ACTIVATE(X) ISNAT(n__plus(V1,V2)) -> ACTIVATE(V1) ISNAT(n__plus(V1,V2)) -> ACTIVATE(V2) ISNAT(n__plus(V1,V2)) -> AND(isNat(activate(V1)),n__isNat(activate(V2))) ISNAT(n__plus(V1,V2)) -> ISNAT(activate(V1)) ISNAT(n__s(V1)) -> ACTIVATE(V1)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472