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