Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381716113
details
property
value
status
complete
benchmark
PEANO_nokinds_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n034.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
NaTT
configuration
Default
runtime (wallclock)
0.571469068527 seconds
cpu usage
0.638174299
max memory
2.2011904E7
stage attributes
key
value
output-size
12213
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: active(U11(tt(),N)) -> mark(N) 2: active(U21(tt(),M,N)) -> mark(s(plus(N,M))) 3: active(and(tt(),X)) -> mark(X) 4: active(isNat(0())) -> mark(tt()) 5: active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) 6: active(isNat(s(V1))) -> mark(isNat(V1)) 7: active(plus(N,0())) -> mark(U11(isNat(N),N)) 8: active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) 9: active(U11(X1,X2)) -> U11(active(X1),X2) 10: active(U21(X1,X2,X3)) -> U21(active(X1),X2,X3) 11: active(s(X)) -> s(active(X)) 12: active(plus(X1,X2)) -> plus(active(X1),X2) 13: active(plus(X1,X2)) -> plus(X1,active(X2)) 14: active(and(X1,X2)) -> and(active(X1),X2) 15: U11(mark(X1),X2) -> mark(U11(X1,X2)) 16: U21(mark(X1),X2,X3) -> mark(U21(X1,X2,X3)) 17: s(mark(X)) -> mark(s(X)) 18: plus(mark(X1),X2) -> mark(plus(X1,X2)) 19: plus(X1,mark(X2)) -> mark(plus(X1,X2)) 20: and(mark(X1),X2) -> mark(and(X1,X2)) 21: proper(U11(X1,X2)) -> U11(proper(X1),proper(X2)) 22: proper(tt()) -> ok(tt()) 23: proper(U21(X1,X2,X3)) -> U21(proper(X1),proper(X2),proper(X3)) 24: proper(s(X)) -> s(proper(X)) 25: proper(plus(X1,X2)) -> plus(proper(X1),proper(X2)) 26: proper(and(X1,X2)) -> and(proper(X1),proper(X2)) 27: proper(isNat(X)) -> isNat(proper(X)) 28: proper(0()) -> ok(0()) 29: U11(ok(X1),ok(X2)) -> ok(U11(X1,X2)) 30: U21(ok(X1),ok(X2),ok(X3)) -> ok(U21(X1,X2,X3)) 31: s(ok(X)) -> ok(s(X)) 32: plus(ok(X1),ok(X2)) -> ok(plus(X1,X2)) 33: and(ok(X1),ok(X2)) -> ok(and(X1,X2)) 34: isNat(ok(X)) -> ok(isNat(X)) 35: top(mark(X)) -> top(proper(X)) 36: top(ok(X)) -> top(active(X)) Number of strict rules: 36 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #active(U21(tt(),M,N)) -> #s(plus(N,M)) #2: #active(U21(tt(),M,N)) -> #plus(N,M) #3: #U11(ok(X1),ok(X2)) -> #U11(X1,X2) #4: #top(mark(X)) -> #top(proper(X)) #5: #top(mark(X)) -> #proper(X) #6: #active(isNat(s(V1))) -> #isNat(V1) #7: #active(plus(X1,X2)) -> #plus(X1,active(X2)) #8: #active(plus(X1,X2)) -> #active(X2) #9: #active(U11(X1,X2)) -> #U11(active(X1),X2) #10: #active(U11(X1,X2)) -> #active(X1) #11: #active(s(X)) -> #s(active(X)) #12: #active(s(X)) -> #active(X) #13: #proper(s(X)) -> #s(proper(X)) #14: #proper(s(X)) -> #proper(X) #15: #proper(U21(X1,X2,X3)) -> #U21(proper(X1),proper(X2),proper(X3)) #16: #proper(U21(X1,X2,X3)) -> #proper(X1) #17: #proper(U21(X1,X2,X3)) -> #proper(X2) #18: #proper(U21(X1,X2,X3)) -> #proper(X3) #19: #active(plus(X1,X2)) -> #plus(active(X1),X2) #20: #active(plus(X1,X2)) -> #active(X1) #21: #s(ok(X)) -> #s(X) #22: #active(and(X1,X2)) -> #and(active(X1),X2) #23: #active(and(X1,X2)) -> #active(X1) #24: #U21(ok(X1),ok(X2),ok(X3)) -> #U21(X1,X2,X3) #25: #proper(plus(X1,X2)) -> #plus(proper(X1),proper(X2)) #26: #proper(plus(X1,X2)) -> #proper(X1) #27: #proper(plus(X1,X2)) -> #proper(X2) #28: #and(mark(X1),X2) -> #and(X1,X2) #29: #active(plus(N,0())) -> #U11(isNat(N),N) #30: #active(plus(N,0())) -> #isNat(N) #31: #active(U21(X1,X2,X3)) -> #U21(active(X1),X2,X3) #32: #active(U21(X1,X2,X3)) -> #active(X1) #33: #and(ok(X1),ok(X2)) -> #and(X1,X2) #34: #active(isNat(plus(V1,V2))) -> #and(isNat(V1),isNat(V2)) #35: #active(isNat(plus(V1,V2))) -> #isNat(V1) #36: #active(isNat(plus(V1,V2))) -> #isNat(V2) #37: #isNat(ok(X)) -> #isNat(X) #38: #proper(isNat(X)) -> #isNat(proper(X)) #39: #proper(isNat(X)) -> #proper(X) #40: #s(mark(X)) -> #s(X) #41: #plus(ok(X1),ok(X2)) -> #plus(X1,X2) #42: #plus(X1,mark(X2)) -> #plus(X1,X2) #43: #proper(and(X1,X2)) -> #and(proper(X1),proper(X2)) #44: #proper(and(X1,X2)) -> #proper(X1) #45: #proper(and(X1,X2)) -> #proper(X2) #46: #top(ok(X)) -> #top(active(X)) #47: #top(ok(X)) -> #active(X) #48: #proper(U11(X1,X2)) -> #U11(proper(X1),proper(X2)) #49: #proper(U11(X1,X2)) -> #proper(X1) #50: #proper(U11(X1,X2)) -> #proper(X2) #51: #U21(mark(X1),X2,X3) -> #U21(X1,X2,X3) #52: #active(plus(N,s(M))) -> #U21(and(isNat(M),isNat(N)),M,N)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472