Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516962633
details
property
value
status
complete
benchmark
LengthOfFiniteLists_nokinds_FR.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n035.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
NaTT 2.1
configuration
default
runtime (wallclock)
49.2787470818 seconds
cpu usage
50.249616342
max memory
1.0962944E8
stage attributes
key
value
output-size
10666
starexec-result
MAYBE
output
/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- MAYBE Input TRS: 1: zeros() -> cons(0(),n__zeros()) 2: U11(tt(),L) -> s(length(activate(L))) 3: and(tt(),X) -> activate(X) 4: isNat(n__0()) -> tt() 5: isNat(n__length(V1)) -> isNatList(activate(V1)) 6: isNat(n__s(V1)) -> isNat(activate(V1)) 7: isNatIList(V) -> isNatList(activate(V)) 8: isNatIList(n__zeros()) -> tt() 9: isNatIList(n__cons(V1,V2)) -> and(isNat(activate(V1)),n__isNatIList(activate(V2))) 10: isNatList(n__nil()) -> tt() 11: isNatList(n__cons(V1,V2)) -> and(isNat(activate(V1)),n__isNatList(activate(V2))) 12: length(nil()) -> 0() 13: length(cons(N,L)) -> U11(and(isNatList(activate(L)),n__isNat(N)),activate(L)) 14: zeros() -> n__zeros() 15: 0() -> n__0() 16: length(X) -> n__length(X) 17: s(X) -> n__s(X) 18: cons(X1,X2) -> n__cons(X1,X2) 19: isNatIList(X) -> n__isNatIList(X) 20: nil() -> n__nil() 21: isNatList(X) -> n__isNatList(X) 22: isNat(X) -> n__isNat(X) 23: activate(n__zeros()) -> zeros() 24: activate(n__0()) -> 0() 25: activate(n__length(X)) -> length(activate(X)) 26: activate(n__s(X)) -> s(activate(X)) 27: activate(n__cons(X1,X2)) -> cons(activate(X1),X2) 28: activate(n__isNatIList(X)) -> isNatIList(X) 29: activate(n__nil()) -> nil() 30: activate(n__isNatList(X)) -> isNatList(X) 31: activate(n__isNat(X)) -> isNat(X) 32: activate(X) -> X Number of strict rules: 32 Direct poly ... removes: 8 5 10 7 12 isNatList(x1) w: (x1) U11(x1,x2) w: (13962 + 2 * x2 + x1) s(x1) w: (x1) activate(x1) w: (x1) and(x1,x2) w: (x2 + x1) n__zeros() w: (0) isNatIList(x1) w: (1 + x1) zeros() w: (0) n__nil() w: (625) n__s(x1) w: (x1) 0() w: (0) n__isNatList(x1) w: (x1) n__cons(x1,x2) w: (2 * x2 + x1) nil() w: (625) n__isNat(x1) w: (x1) n__0() w: (0) n__length(x1) w: (13962 + 2 * x1) isNat(x1) w: (x1) cons(x1,x2) w: (2 * x2 + x1) n__isNatIList(x1) w: (1 + x1) tt() w: (0) length(x1) w: (13962 + 2 * x1) Number of strict rules: 27 Direct poly ... failed. Freezing ... 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__nil()) -> #nil() #5: #isNat(n__s(V1)) -> #isNat(activate(V1)) #6: #isNat(n__s(V1)) -> #activate(V1) #7: #length(cons(N,L)) -> #U11(and(isNatList(activate(L)),n__isNat(N)),activate(L)) #8: #length(cons(N,L)) -> #and(isNatList(activate(L)),n__isNat(N)) #9: #length(cons(N,L)) -> #isNatList(activate(L)) #10: #length(cons(N,L)) -> #activate(L) #11: #length(cons(N,L)) -> #activate(L) #12: #isNatIList(n__cons(V1,V2)) -> #and(isNat(activate(V1)),n__isNatIList(activate(V2))) #13: #isNatIList(n__cons(V1,V2)) -> #isNat(activate(V1)) #14: #isNatIList(n__cons(V1,V2)) -> #activate(V1) #15: #isNatIList(n__cons(V1,V2)) -> #activate(V2) #16: #isNatList(n__cons(V1,V2)) -> #and(isNat(activate(V1)),n__isNatList(activate(V2))) #17: #isNatList(n__cons(V1,V2)) -> #isNat(activate(V1)) #18: #isNatList(n__cons(V1,V2)) -> #activate(V1) #19: #isNatList(n__cons(V1,V2)) -> #activate(V2) #20: #activate(n__0()) -> #0() #21: #activate(n__zeros()) -> #zeros() #22: #activate(n__isNat(X)) -> #isNat(X) #23: #activate(n__isNatList(X)) -> #isNatList(X) #24: #activate(n__length(X)) -> #length(activate(X)) #25: #activate(n__length(X)) -> #activate(X) #26: #activate(n__isNatIList(X)) -> #isNatIList(X) #27: #activate(n__cons(X1,X2)) -> #cons(activate(X1),X2) #28: #activate(n__cons(X1,X2)) -> #activate(X1) #29: #activate(n__s(X)) -> #s(activate(X)) #30: #activate(n__s(X)) -> #activate(X) #31: #and(tt(),X) -> #activate(X) #32: #zeros() -> #cons(0(),n__zeros())
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard