Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381715233
details
property
value
status
complete
benchmark
LengthOfFiniteLists_complete_Z.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n027.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
NaTT
configuration
Default
runtime (wallclock)
15.9329929352 seconds
cpu usage
16.097265042
max memory
4.6854144E7
stage attributes
key
value
output-size
7485
starexec-result
MAYBE
output
/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE Input TRS: 1: zeros() -> cons(0(),n__zeros()) 2: U11(tt(),V1) -> U12(isNatList(activate(V1))) 3: U12(tt()) -> tt() 4: U21(tt(),V1) -> U22(isNat(activate(V1))) 5: U22(tt()) -> tt() 6: U31(tt(),V) -> U32(isNatList(activate(V))) 7: U32(tt()) -> tt() 8: U41(tt(),V1,V2) -> U42(isNat(activate(V1)),activate(V2)) 9: U42(tt(),V2) -> U43(isNatIList(activate(V2))) 10: U43(tt()) -> tt() 11: U51(tt(),V1,V2) -> U52(isNat(activate(V1)),activate(V2)) 12: U52(tt(),V2) -> U53(isNatList(activate(V2))) 13: U53(tt()) -> tt() 14: U61(tt(),L) -> s(length(activate(L))) 15: and(tt(),X) -> activate(X) 16: isNat(n__0()) -> tt() 17: isNat(n__length(V1)) -> U11(isNatIListKind(activate(V1)),activate(V1)) 18: isNat(n__s(V1)) -> U21(isNatKind(activate(V1)),activate(V1)) 19: isNatIList(V) -> U31(isNatIListKind(activate(V)),activate(V)) 20: isNatIList(n__zeros()) -> tt() 21: isNatIList(n__cons(V1,V2)) -> U41(and(isNatKind(activate(V1)),n__isNatIListKind(activate(V2))),activate(V1),activate(V2)) 22: isNatIListKind(n__nil()) -> tt() 23: isNatIListKind(n__zeros()) -> tt() 24: isNatIListKind(n__cons(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatIListKind(activate(V2))) 25: isNatKind(n__0()) -> tt() 26: isNatKind(n__length(V1)) -> isNatIListKind(activate(V1)) 27: isNatKind(n__s(V1)) -> isNatKind(activate(V1)) 28: isNatList(n__nil()) -> tt() 29: isNatList(n__cons(V1,V2)) -> U51(and(isNatKind(activate(V1)),n__isNatIListKind(activate(V2))),activate(V1),activate(V2)) 30: length(nil()) -> 0() 31: length(cons(N,L)) -> U61(and(and(isNatList(activate(L)),n__isNatIListKind(activate(L))),n__and(isNat(N),n__isNatKind(N))),activate(L)) 32: zeros() -> n__zeros() 33: 0() -> n__0() 34: length(X) -> n__length(X) 35: s(X) -> n__s(X) 36: cons(X1,X2) -> n__cons(X1,X2) 37: isNatIListKind(X) -> n__isNatIListKind(X) 38: nil() -> n__nil() 39: and(X1,X2) -> n__and(X1,X2) 40: isNatKind(X) -> n__isNatKind(X) 41: activate(n__zeros()) -> zeros() 42: activate(n__0()) -> 0() 43: activate(n__length(X)) -> length(X) 44: activate(n__s(X)) -> s(X) 45: activate(n__cons(X1,X2)) -> cons(X1,X2) 46: activate(n__isNatIListKind(X)) -> isNatIListKind(X) 47: activate(n__nil()) -> nil() 48: activate(n__and(X1,X2)) -> and(X1,X2) 49: activate(n__isNatKind(X)) -> isNatKind(X) 50: activate(X) -> X Number of strict rules: 50 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #U11(tt(),V1) -> #U12(isNatList(activate(V1))) #2: #U11(tt(),V1) -> #isNatList(activate(V1)) #3: #U11(tt(),V1) -> #activate(V1) #4: #activate(n__length(X)) -> #length(X) #5: #isNatList(n__cons(V1,V2)) -> #U51(and(isNatKind(activate(V1)),n__isNatIListKind(activate(V2))),activate(V1),activate(V2)) #6: #isNatList(n__cons(V1,V2)) -> #and(isNatKind(activate(V1)),n__isNatIListKind(activate(V2))) #7: #isNatList(n__cons(V1,V2)) -> #isNatKind(activate(V1)) #8: #isNatList(n__cons(V1,V2)) -> #activate(V1) #9: #isNatList(n__cons(V1,V2)) -> #activate(V2) #10: #isNatList(n__cons(V1,V2)) -> #activate(V1) #11: #isNatList(n__cons(V1,V2)) -> #activate(V2) #12: #activate(n__isNatIListKind(X)) -> #isNatIListKind(X) #13: #activate(n__0()) -> #0() #14: #activate(n__zeros()) -> #zeros() #15: #activate(n__nil()) -> #nil() #16: #activate(n__and(X1,X2)) -> #and(X1,X2) #17: #U31(tt(),V) -> #U32(isNatList(activate(V))) #18: #U31(tt(),V) -> #isNatList(activate(V)) #19: #U31(tt(),V) -> #activate(V) #20: #U42(tt(),V2) -> #U43(isNatIList(activate(V2))) #21: #U42(tt(),V2) -> #isNatIList(activate(V2)) #22: #U42(tt(),V2) -> #activate(V2) #23: #U51(tt(),V1,V2) -> #U52(isNat(activate(V1)),activate(V2)) #24: #U51(tt(),V1,V2) -> #isNat(activate(V1)) #25: #U51(tt(),V1,V2) -> #activate(V1) #26: #U51(tt(),V1,V2) -> #activate(V2) #27: #isNatIListKind(n__cons(V1,V2)) -> #and(isNatKind(activate(V1)),n__isNatIListKind(activate(V2))) #28: #isNatIListKind(n__cons(V1,V2)) -> #isNatKind(activate(V1)) #29: #isNatIListKind(n__cons(V1,V2)) -> #activate(V1) #30: #isNatIListKind(n__cons(V1,V2)) -> #activate(V2) #31: #activate(n__cons(X1,X2)) -> #cons(X1,X2) #32: #U52(tt(),V2) -> #U53(isNatList(activate(V2))) #33: #U52(tt(),V2) -> #isNatList(activate(V2)) #34: #U52(tt(),V2) -> #activate(V2) #35: #length(cons(N,L)) -> #U61(and(and(isNatList(activate(L)),n__isNatIListKind(activate(L))),n__and(isNat(N),n__isNatKind(N))),activate(L)) #36: #length(cons(N,L)) -> #and(and(isNatList(activate(L)),n__isNatIListKind(activate(L))),n__and(isNat(N),n__isNatKind(N))) #37: #length(cons(N,L)) -> #and(isNatList(activate(L)),n__isNatIListKind(activate(L))) #38: #length(cons(N,L)) -> #isNatList(activate(L))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472