Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381713741
details
property
value
status
complete
benchmark
PEANO_complete-noand_Z.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)
3.05228281021 seconds
cpu usage
3.089664082
max memory
1.2742656E7
stage attributes
key
value
output-size
208765
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,V1,V2) -> U12(isNatKind(activate(V1)),activate(V1),activate(V2)) U12(tt,V1,V2) -> U13(isNatKind(activate(V2)),activate(V1),activate(V2)) U13(tt,V1,V2) -> U14(isNatKind(activate(V2)),activate(V1),activate(V2)) U14(tt,V1,V2) -> U15(isNat(activate(V1)),activate(V2)) U15(tt,V2) -> U16(isNat(activate(V2))) U16(tt) -> tt U21(tt,V1) -> U22(isNatKind(activate(V1)),activate(V1)) U22(tt,V1) -> U23(isNat(activate(V1))) U23(tt) -> tt U31(tt,V2) -> U32(isNatKind(activate(V2))) U32(tt) -> tt U41(tt) -> tt U51(tt,N) -> U52(isNatKind(activate(N)),activate(N)) U52(tt,N) -> activate(N) U61(tt,M,N) -> U62(isNatKind(activate(M)),activate(M),activate(N)) U62(tt,M,N) -> U63(isNat(activate(N)),activate(M),activate(N)) U63(tt,M,N) -> U64(isNatKind(activate(N)),activate(M),activate(N)) U64(tt,M,N) -> s(plus(activate(N),activate(M))) activate(n__0) -> 0 activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__s(X)) -> s(X) activate(X) -> X isNat(n__0) -> tt isNat(n__plus(V1,V2)) -> U11(isNatKind(activate(V1)),activate(V1),activate(V2)) isNat(n__s(V1)) -> U21(isNatKind(activate(V1)),activate(V1)) isNatKind(n__0) -> tt isNatKind(n__plus(V1,V2)) -> U31(isNatKind(activate(V1)),activate(V2)) isNatKind(n__s(V1)) -> U41(isNatKind(activate(V1))) plus(N,0) -> U51(isNat(N),N) plus(N,s(M)) -> U61(isNat(M),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#(isNatKind(activate(V1)),activate(V1),activate(V2)) U11#(tt,V1,V2) -> ACTIVATE(V1) U11#(tt,V1,V2) -> ACTIVATE(V2) U11#(tt,V1,V2) -> ISNATKIND(activate(V1)) U12#(tt,V1,V2) -> U13#(isNatKind(activate(V2)),activate(V1),activate(V2)) U12#(tt,V1,V2) -> ACTIVATE(V1) U12#(tt,V1,V2) -> ACTIVATE(V2) U12#(tt,V1,V2) -> ISNATKIND(activate(V2)) U13#(tt,V1,V2) -> U14#(isNatKind(activate(V2)),activate(V1),activate(V2)) U13#(tt,V1,V2) -> ACTIVATE(V1) U13#(tt,V1,V2) -> ACTIVATE(V2) U13#(tt,V1,V2) -> ISNATKIND(activate(V2)) U14#(tt,V1,V2) -> U15#(isNat(activate(V1)),activate(V2)) U14#(tt,V1,V2) -> ACTIVATE(V1) U14#(tt,V1,V2) -> ACTIVATE(V2) U14#(tt,V1,V2) -> ISNAT(activate(V1)) U15#(tt,V2) -> U16#(isNat(activate(V2))) U15#(tt,V2) -> ACTIVATE(V2) U15#(tt,V2) -> ISNAT(activate(V2)) U21#(tt,V1) -> U22#(isNatKind(activate(V1)),activate(V1)) U21#(tt,V1) -> ACTIVATE(V1) U21#(tt,V1) -> ISNATKIND(activate(V1)) U22#(tt,V1) -> U23#(isNat(activate(V1))) U22#(tt,V1) -> ACTIVATE(V1) U22#(tt,V1) -> ISNAT(activate(V1)) U31#(tt,V2) -> U32#(isNatKind(activate(V2))) U31#(tt,V2) -> ACTIVATE(V2) U31#(tt,V2) -> ISNATKIND(activate(V2)) U51#(tt,N) -> U52#(isNatKind(activate(N)),activate(N)) U51#(tt,N) -> ACTIVATE(N) U51#(tt,N) -> ISNATKIND(activate(N)) U52#(tt,N) -> ACTIVATE(N) U61#(tt,M,N) -> U62#(isNatKind(activate(M)),activate(M),activate(N)) U61#(tt,M,N) -> ACTIVATE(M) U61#(tt,M,N) -> ACTIVATE(N) U61#(tt,M,N) -> ISNATKIND(activate(M)) U62#(tt,M,N) -> U63#(isNat(activate(N)),activate(M),activate(N)) U62#(tt,M,N) -> ACTIVATE(M) U62#(tt,M,N) -> ACTIVATE(N) U62#(tt,M,N) -> ISNAT(activate(N)) U63#(tt,M,N) -> U64#(isNatKind(activate(N)),activate(M),activate(N)) U63#(tt,M,N) -> ACTIVATE(M) U63#(tt,M,N) -> ACTIVATE(N) U63#(tt,M,N) -> ISNATKIND(activate(N)) U64#(tt,M,N) -> ACTIVATE(M) U64#(tt,M,N) -> ACTIVATE(N) U64#(tt,M,N) -> PLUS(activate(N),activate(M)) U64#(tt,M,N) -> S(plus(activate(N),activate(M))) ACTIVATE(n__0) -> 0#
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472