Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381715963
details
property
value
status
complete
benchmark
MYNAT_complete-noand_FR.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n105.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
NaTT
configuration
Default
runtime (wallclock)
3.15085697174 seconds
cpu usage
3.34718413
max memory
4.5010944E7
stage attributes
key
value
output-size
21508
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 Input TRS: 1: U101(tt(),M,N) -> U102(isNatKind(activate(M)),activate(M),activate(N)) 2: U102(tt(),M,N) -> U103(isNat(activate(N)),activate(M),activate(N)) 3: U103(tt(),M,N) -> U104(isNatKind(activate(N)),activate(M),activate(N)) 4: U104(tt(),M,N) -> plus(x(activate(N),activate(M)),activate(N)) 5: U11(tt(),V1,V2) -> U12(isNatKind(activate(V1)),activate(V1),activate(V2)) 6: U12(tt(),V1,V2) -> U13(isNatKind(activate(V2)),activate(V1),activate(V2)) 7: U13(tt(),V1,V2) -> U14(isNatKind(activate(V2)),activate(V1),activate(V2)) 8: U14(tt(),V1,V2) -> U15(isNat(activate(V1)),activate(V2)) 9: U15(tt(),V2) -> U16(isNat(activate(V2))) 10: U16(tt()) -> tt() 11: U21(tt(),V1) -> U22(isNatKind(activate(V1)),activate(V1)) 12: U22(tt(),V1) -> U23(isNat(activate(V1))) 13: U23(tt()) -> tt() 14: U31(tt(),V1,V2) -> U32(isNatKind(activate(V1)),activate(V1),activate(V2)) 15: U32(tt(),V1,V2) -> U33(isNatKind(activate(V2)),activate(V1),activate(V2)) 16: U33(tt(),V1,V2) -> U34(isNatKind(activate(V2)),activate(V1),activate(V2)) 17: U34(tt(),V1,V2) -> U35(isNat(activate(V1)),activate(V2)) 18: U35(tt(),V2) -> U36(isNat(activate(V2))) 19: U36(tt()) -> tt() 20: U41(tt(),V2) -> U42(isNatKind(activate(V2))) 21: U42(tt()) -> tt() 22: U51(tt()) -> tt() 23: U61(tt(),V2) -> U62(isNatKind(activate(V2))) 24: U62(tt()) -> tt() 25: U71(tt(),N) -> U72(isNatKind(activate(N)),activate(N)) 26: U72(tt(),N) -> activate(N) 27: U81(tt(),M,N) -> U82(isNatKind(activate(M)),activate(M),activate(N)) 28: U82(tt(),M,N) -> U83(isNat(activate(N)),activate(M),activate(N)) 29: U83(tt(),M,N) -> U84(isNatKind(activate(N)),activate(M),activate(N)) 30: U84(tt(),M,N) -> s(plus(activate(N),activate(M))) 31: U91(tt(),N) -> U92(isNatKind(activate(N))) 32: U92(tt()) -> 0() 33: isNat(n__0()) -> tt() 34: isNat(n__plus(V1,V2)) -> U11(isNatKind(activate(V1)),activate(V1),activate(V2)) 35: isNat(n__s(V1)) -> U21(isNatKind(activate(V1)),activate(V1)) 36: isNat(n__x(V1,V2)) -> U31(isNatKind(activate(V1)),activate(V1),activate(V2)) 37: isNatKind(n__0()) -> tt() 38: isNatKind(n__plus(V1,V2)) -> U41(isNatKind(activate(V1)),activate(V2)) 39: isNatKind(n__s(V1)) -> U51(isNatKind(activate(V1))) 40: isNatKind(n__x(V1,V2)) -> U61(isNatKind(activate(V1)),activate(V2)) 41: plus(N,0()) -> U71(isNat(N),N) 42: plus(N,s(M)) -> U81(isNat(M),M,N) 43: x(N,0()) -> U91(isNat(N),N) 44: x(N,s(M)) -> U101(isNat(M),M,N) 45: 0() -> n__0() 46: plus(X1,X2) -> n__plus(X1,X2) 47: s(X) -> n__s(X) 48: x(X1,X2) -> n__x(X1,X2) 49: activate(n__0()) -> 0() 50: activate(n__plus(X1,X2)) -> plus(activate(X1),activate(X2)) 51: activate(n__s(X)) -> s(activate(X)) 52: activate(n__x(X1,X2)) -> x(activate(X1),activate(X2)) 53: activate(X) -> X Number of strict rules: 53 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #U102(tt(),M,N) -> #U103(isNat(activate(N)),activate(M),activate(N)) #2: #U102(tt(),M,N) -> #isNat(activate(N)) #3: #U102(tt(),M,N) -> #activate(N) #4: #U102(tt(),M,N) -> #activate(M) #5: #U102(tt(),M,N) -> #activate(N) #6: #x(N,0()) -> #U91(isNat(N),N) #7: #x(N,0()) -> #isNat(N) #8: #U83(tt(),M,N) -> #U84(isNatKind(activate(N)),activate(M),activate(N)) #9: #U83(tt(),M,N) -> #isNatKind(activate(N)) #10: #U83(tt(),M,N) -> #activate(N) #11: #U83(tt(),M,N) -> #activate(M) #12: #U83(tt(),M,N) -> #activate(N) #13: #isNat(n__s(V1)) -> #U21(isNatKind(activate(V1)),activate(V1)) #14: #isNat(n__s(V1)) -> #isNatKind(activate(V1)) #15: #isNat(n__s(V1)) -> #activate(V1) #16: #isNat(n__s(V1)) -> #activate(V1) #17: #plus(N,s(M)) -> #U81(isNat(M),M,N) #18: #plus(N,s(M)) -> #isNat(M) #19: #plus(N,0()) -> #U71(isNat(N),N) #20: #plus(N,0()) -> #isNat(N) #21: #isNatKind(n__plus(V1,V2)) -> #U41(isNatKind(activate(V1)),activate(V2)) #22: #isNatKind(n__plus(V1,V2)) -> #isNatKind(activate(V1)) #23: #isNatKind(n__plus(V1,V2)) -> #activate(V1) #24: #isNatKind(n__plus(V1,V2)) -> #activate(V2) #25: #U12(tt(),V1,V2) -> #U13(isNatKind(activate(V2)),activate(V1),activate(V2)) #26: #U12(tt(),V1,V2) -> #isNatKind(activate(V2)) #27: #U12(tt(),V1,V2) -> #activate(V2) #28: #U12(tt(),V1,V2) -> #activate(V1) #29: #U12(tt(),V1,V2) -> #activate(V2) #30: #isNatKind(n__x(V1,V2)) -> #U61(isNatKind(activate(V1)),activate(V2)) #31: #isNatKind(n__x(V1,V2)) -> #isNatKind(activate(V1)) #32: #isNatKind(n__x(V1,V2)) -> #activate(V1) #33: #isNatKind(n__x(V1,V2)) -> #activate(V2) #34: #activate(n__s(X)) -> #s(activate(X)) #35: #activate(n__s(X)) -> #activate(X)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472