Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381715373
details
property
value
status
complete
benchmark
LengthOfFiniteLists_nokinds_noand_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n078.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
NaTT
configuration
Default
runtime (wallclock)
10.610172987 seconds
cpu usage
10.837389267
max memory
7.1614464E7
stage attributes
key
value
output-size
18159
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: active(zeros()) -> mark(cons(0(),zeros())) 2: active(U11(tt())) -> mark(tt()) 3: active(U21(tt())) -> mark(tt()) 4: active(U31(tt())) -> mark(tt()) 5: active(U41(tt(),V2)) -> mark(U42(isNatIList(V2))) 6: active(U42(tt())) -> mark(tt()) 7: active(U51(tt(),V2)) -> mark(U52(isNatList(V2))) 8: active(U52(tt())) -> mark(tt()) 9: active(U61(tt(),L,N)) -> mark(U62(isNat(N),L)) 10: active(U62(tt(),L)) -> mark(s(length(L))) 11: active(isNat(0())) -> mark(tt()) 12: active(isNat(length(V1))) -> mark(U11(isNatList(V1))) 13: active(isNat(s(V1))) -> mark(U21(isNat(V1))) 14: active(isNatIList(V)) -> mark(U31(isNatList(V))) 15: active(isNatIList(zeros())) -> mark(tt()) 16: active(isNatIList(cons(V1,V2))) -> mark(U41(isNat(V1),V2)) 17: active(isNatList(nil())) -> mark(tt()) 18: active(isNatList(cons(V1,V2))) -> mark(U51(isNat(V1),V2)) 19: active(length(nil())) -> mark(0()) 20: active(length(cons(N,L))) -> mark(U61(isNatList(L),L,N)) 21: active(cons(X1,X2)) -> cons(active(X1),X2) 22: active(U11(X)) -> U11(active(X)) 23: active(U21(X)) -> U21(active(X)) 24: active(U31(X)) -> U31(active(X)) 25: active(U41(X1,X2)) -> U41(active(X1),X2) 26: active(U42(X)) -> U42(active(X)) 27: active(U51(X1,X2)) -> U51(active(X1),X2) 28: active(U52(X)) -> U52(active(X)) 29: active(U61(X1,X2,X3)) -> U61(active(X1),X2,X3) 30: active(U62(X1,X2)) -> U62(active(X1),X2) 31: active(s(X)) -> s(active(X)) 32: active(length(X)) -> length(active(X)) 33: cons(mark(X1),X2) -> mark(cons(X1,X2)) 34: U11(mark(X)) -> mark(U11(X)) 35: U21(mark(X)) -> mark(U21(X)) 36: U31(mark(X)) -> mark(U31(X)) 37: U41(mark(X1),X2) -> mark(U41(X1,X2)) 38: U42(mark(X)) -> mark(U42(X)) 39: U51(mark(X1),X2) -> mark(U51(X1,X2)) 40: U52(mark(X)) -> mark(U52(X)) 41: U61(mark(X1),X2,X3) -> mark(U61(X1,X2,X3)) 42: U62(mark(X1),X2) -> mark(U62(X1,X2)) 43: s(mark(X)) -> mark(s(X)) 44: length(mark(X)) -> mark(length(X)) 45: proper(zeros()) -> ok(zeros()) 46: proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 47: proper(0()) -> ok(0()) 48: proper(U11(X)) -> U11(proper(X)) 49: proper(tt()) -> ok(tt()) 50: proper(U21(X)) -> U21(proper(X)) 51: proper(U31(X)) -> U31(proper(X)) 52: proper(U41(X1,X2)) -> U41(proper(X1),proper(X2)) 53: proper(U42(X)) -> U42(proper(X)) 54: proper(isNatIList(X)) -> isNatIList(proper(X)) 55: proper(U51(X1,X2)) -> U51(proper(X1),proper(X2)) 56: proper(U52(X)) -> U52(proper(X)) 57: proper(isNatList(X)) -> isNatList(proper(X)) 58: proper(U61(X1,X2,X3)) -> U61(proper(X1),proper(X2),proper(X3)) 59: proper(U62(X1,X2)) -> U62(proper(X1),proper(X2)) 60: proper(isNat(X)) -> isNat(proper(X)) 61: proper(s(X)) -> s(proper(X)) 62: proper(length(X)) -> length(proper(X)) 63: proper(nil()) -> ok(nil()) 64: cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) 65: U11(ok(X)) -> ok(U11(X)) 66: U21(ok(X)) -> ok(U21(X)) 67: U31(ok(X)) -> ok(U31(X)) 68: U41(ok(X1),ok(X2)) -> ok(U41(X1,X2)) 69: U42(ok(X)) -> ok(U42(X)) 70: isNatIList(ok(X)) -> ok(isNatIList(X)) 71: U51(ok(X1),ok(X2)) -> ok(U51(X1,X2)) 72: U52(ok(X)) -> ok(U52(X)) 73: isNatList(ok(X)) -> ok(isNatList(X)) 74: U61(ok(X1),ok(X2),ok(X3)) -> ok(U61(X1,X2,X3)) 75: U62(ok(X1),ok(X2)) -> ok(U62(X1,X2)) 76: isNat(ok(X)) -> ok(isNat(X)) 77: s(ok(X)) -> ok(s(X)) 78: length(ok(X)) -> ok(length(X)) 79: top(mark(X)) -> top(proper(X)) 80: top(ok(X)) -> top(active(X)) Number of strict rules: 80 Direct POLO(bPol) ... removes: 4 15 19 17 14 12 U21 w: x1 isNatList w: x1 + 1 U11 w: x1 s w: x1 U42 w: x1 top w: x1 isNatIList w: 2 * x1 + 3 zeros w: 0 proper w: x1 ok w: x1
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472