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	n175.star.cs.uiowa.edu
space	Transformed_CSR_04

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	29.653 seconds
cpu usage	113.236
user time	103.34
system time	9.89526
max virtual memory	6688020.0
max residence set size	249012.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: 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))) and(tt(),X) -> activate(X) 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)) 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) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNatKind(X) -> n__isNatKind(X) s(X) -> n__s(X) and(X1,X2) -> n__and(X1,X2) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__isNatKind(X)) -> isNatKind(X) activate(n__s(X)) -> s(X) activate(n__and(X1,X2)) -> and(X1,X2) activate(X) -> X Proof: DP Processor: DPs: U11#(tt(),V1,V2) -> activate#(V2) U11#(tt(),V1,V2) -> activate#(V1) U11#(tt(),V1,V2) -> isNat#(activate(V1)) U11#(tt(),V1,V2) -> U12#(isNat(activate(V1)),activate(V2)) U12#(tt(),V2) -> activate#(V2) U12#(tt(),V2) -> isNat#(activate(V2)) U12#(tt(),V2) -> U13#(isNat(activate(V2))) U21#(tt(),V1) -> activate#(V1) U21#(tt(),V1) -> isNat#(activate(V1)) U21#(tt(),V1) -> U22#(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))) and#(tt(),X) -> activate#(X) isNat#(n__plus(V1,V2)) -> activate#(V2) isNat#(n__plus(V1,V2)) -> activate#(V1) isNat#(n__plus(V1,V2)) -> isNatKind#(activate(V1)) isNat#(n__plus(V1,V2)) -> and#(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNat#(n__plus(V1,V2)) -> U11#(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2)) isNat#(n__s(V1)) -> activate#(V1) isNat#(n__s(V1)) -> isNatKind#(activate(V1)) isNat#(n__s(V1)) -> U21#(isNatKind(activate(V1)),activate(V1)) isNatKind#(n__plus(V1,V2)) -> activate#(V2) isNatKind#(n__plus(V1,V2)) -> activate#(V1) isNatKind#(n__plus(V1,V2)) -> isNatKind#(activate(V1)) isNatKind#(n__plus(V1,V2)) -> and#(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind#(n__s(V1)) -> activate#(V1) isNatKind#(n__s(V1)) -> isNatKind#(activate(V1)) plus#(N,0()) -> isNat#(N) plus#(N,0()) -> and#(isNat(N),n__isNatKind(N)) plus#(N,0()) -> U31#(and(isNat(N),n__isNatKind(N)),N) plus#(N,s(M)) -> isNat#(N) plus#(N,s(M)) -> isNat#(M) plus#(N,s(M)) -> and#(isNat(M),n__isNatKind(M)) plus#(N,s(M)) -> and#(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))) plus#(N,s(M)) -> U41#(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) activate#(n__0()) -> 0#() activate#(n__plus(X1,X2)) -> plus#(X1,X2) activate#(n__isNatKind(X)) -> isNatKind#(X) activate#(n__s(X)) -> s#(X) activate#(n__and(X1,X2)) -> and#(X1,X2) TRS: 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))) and(tt(),X) -> activate(X) 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)) 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) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNatKind(X) -> n__isNatKind(X) popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to TRS Standard