Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381715293
details
property
value
status
complete
benchmark
OvConsOS_nokinds_Z.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n101.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
NaTT
configuration
Default
runtime (wallclock)
33.7919192314 seconds
cpu usage
33.952075173
max memory
4.4470272E7
stage attributes
key
value
output-size
6333
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(),L) -> s(length(activate(L))) 3: U21(tt()) -> nil() 4: U31(tt(),IL,M,N) -> cons(activate(N),n__take(activate(M),activate(IL))) 5: and(tt(),X) -> activate(X) 6: isNat(n__0()) -> tt() 7: isNat(n__length(V1)) -> isNatList(activate(V1)) 8: isNat(n__s(V1)) -> isNat(activate(V1)) 9: isNatIList(V) -> isNatList(activate(V)) 10: isNatIList(n__zeros()) -> tt() 11: isNatIList(n__cons(V1,V2)) -> and(isNat(activate(V1)),n__isNatIList(activate(V2))) 12: isNatList(n__nil()) -> tt() 13: isNatList(n__cons(V1,V2)) -> and(isNat(activate(V1)),n__isNatList(activate(V2))) 14: isNatList(n__take(V1,V2)) -> and(isNat(activate(V1)),n__isNatIList(activate(V2))) 15: length(nil()) -> 0() 16: length(cons(N,L)) -> U11(and(isNatList(activate(L)),n__isNat(N)),activate(L)) 17: take(0(),IL) -> U21(isNatIList(IL)) 18: take(s(M),cons(N,IL)) -> U31(and(isNatIList(activate(IL)),n__and(isNat(M),n__isNat(N))),activate(IL),M,N) 19: zeros() -> n__zeros() 20: take(X1,X2) -> n__take(X1,X2) 21: 0() -> n__0() 22: length(X) -> n__length(X) 23: s(X) -> n__s(X) 24: cons(X1,X2) -> n__cons(X1,X2) 25: isNatIList(X) -> n__isNatIList(X) 26: nil() -> n__nil() 27: isNatList(X) -> n__isNatList(X) 28: isNat(X) -> n__isNat(X) 29: and(X1,X2) -> n__and(X1,X2) 30: activate(n__zeros()) -> zeros() 31: activate(n__take(X1,X2)) -> take(X1,X2) 32: activate(n__0()) -> 0() 33: activate(n__length(X)) -> length(X) 34: activate(n__s(X)) -> s(X) 35: activate(n__cons(X1,X2)) -> cons(X1,X2) 36: activate(n__isNatIList(X)) -> isNatIList(X) 37: activate(n__nil()) -> nil() 38: activate(n__isNatList(X)) -> isNatList(X) 39: activate(n__isNat(X)) -> isNat(X) 40: activate(n__and(X1,X2)) -> and(X1,X2) 41: activate(X) -> X Number of strict rules: 41 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #U11(tt(),L) -> #s(length(activate(L))) #2: #U11(tt(),L) -> #length(activate(L)) #3: #U11(tt(),L) -> #activate(L) #4: #activate(n__cons(X1,X2)) -> #cons(X1,X2) #5: #activate(n__nil()) -> #nil() #6: #activate(n__isNatList(X)) -> #isNatList(X) #7: #activate(n__and(X1,X2)) -> #and(X1,X2) #8: #isNatList(n__cons(V1,V2)) -> #and(isNat(activate(V1)),n__isNatList(activate(V2))) #9: #isNatList(n__cons(V1,V2)) -> #isNat(activate(V1)) #10: #isNatList(n__cons(V1,V2)) -> #activate(V1) #11: #isNatList(n__cons(V1,V2)) -> #activate(V2) #12: #isNatIList(V) -> #isNatList(activate(V)) #13: #isNatIList(V) -> #activate(V) #14: #isNatIList(n__cons(V1,V2)) -> #and(isNat(activate(V1)),n__isNatIList(activate(V2))) #15: #isNatIList(n__cons(V1,V2)) -> #isNat(activate(V1)) #16: #isNatIList(n__cons(V1,V2)) -> #activate(V1) #17: #isNatIList(n__cons(V1,V2)) -> #activate(V2) #18: #activate(n__take(X1,X2)) -> #take(X1,X2) #19: #isNatList(n__take(V1,V2)) -> #and(isNat(activate(V1)),n__isNatIList(activate(V2))) #20: #isNatList(n__take(V1,V2)) -> #isNat(activate(V1)) #21: #isNatList(n__take(V1,V2)) -> #activate(V1) #22: #isNatList(n__take(V1,V2)) -> #activate(V2) #23: #activate(n__zeros()) -> #zeros() #24: #isNat(n__length(V1)) -> #isNatList(activate(V1)) #25: #isNat(n__length(V1)) -> #activate(V1) #26: #activate(n__isNat(X)) -> #isNat(X) #27: #activate(n__length(X)) -> #length(X) #28: #and(tt(),X) -> #activate(X) #29: #activate(n__s(X)) -> #s(X) #30: #take(0(),IL) -> #U21(isNatIList(IL)) #31: #take(0(),IL) -> #isNatIList(IL) #32: #activate(n__0()) -> #0() #33: #activate(n__isNatIList(X)) -> #isNatIList(X) #34: #length(cons(N,L)) -> #U11(and(isNatList(activate(L)),n__isNat(N)),activate(L)) #35: #length(cons(N,L)) -> #and(isNatList(activate(L)),n__isNat(N)) #36: #length(cons(N,L)) -> #isNatList(activate(L)) #37: #length(cons(N,L)) -> #activate(L) #38: #length(cons(N,L)) -> #activate(L) #39: #U21(tt()) -> #nil() #40: #zeros() -> #cons(0(),n__zeros()) #41: #zeros() -> #0() #42: #isNat(n__s(V1)) -> #isNat(activate(V1)) #43: #isNat(n__s(V1)) -> #activate(V1) #44: #length(nil()) -> #0() #45: #U31(tt(),IL,M,N) -> #cons(activate(N),n__take(activate(M),activate(IL))) #46: #U31(tt(),IL,M,N) -> #activate(N) #47: #U31(tt(),IL,M,N) -> #activate(M)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472