Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516962518
details
property
value
status
complete
benchmark
MYNAT_complete_GM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n083.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
NaTT 2.1
configuration
default
runtime (wallclock)
5.09607791901 seconds
cpu usage
5.270047055
max memory
4.6260224E7
stage attributes
key
value
output-size
23856
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: a__U11(tt(),V1,V2) -> a__U12(a__isNat(V1),V2) 2: a__U12(tt(),V2) -> a__U13(a__isNat(V2)) 3: a__U13(tt()) -> tt() 4: a__U21(tt(),V1) -> a__U22(a__isNat(V1)) 5: a__U22(tt()) -> tt() 6: a__U31(tt(),V1,V2) -> a__U32(a__isNat(V1),V2) 7: a__U32(tt(),V2) -> a__U33(a__isNat(V2)) 8: a__U33(tt()) -> tt() 9: a__U41(tt(),N) -> mark(N) 10: a__U51(tt(),M,N) -> s(a__plus(mark(N),mark(M))) 11: a__U61(tt()) -> 0() 12: a__U71(tt(),M,N) -> a__plus(a__x(mark(N),mark(M)),mark(N)) 13: a__and(tt(),X) -> mark(X) 14: a__isNat(0()) -> tt() 15: a__isNat(plus(V1,V2)) -> a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) 16: a__isNat(s(V1)) -> a__U21(a__isNatKind(V1),V1) 17: a__isNat(x(V1,V2)) -> a__U31(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) 18: a__isNatKind(0()) -> tt() 19: a__isNatKind(plus(V1,V2)) -> a__and(a__isNatKind(V1),isNatKind(V2)) 20: a__isNatKind(s(V1)) -> a__isNatKind(V1) 21: a__isNatKind(x(V1,V2)) -> a__and(a__isNatKind(V1),isNatKind(V2)) 22: a__plus(N,0()) -> a__U41(a__and(a__isNat(N),isNatKind(N)),N) 23: a__plus(N,s(M)) -> a__U51(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))),M,N) 24: a__x(N,0()) -> a__U61(a__and(a__isNat(N),isNatKind(N))) 25: a__x(N,s(M)) -> a__U71(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))),M,N) 26: mark(U11(X1,X2,X3)) -> a__U11(mark(X1),X2,X3) 27: mark(U12(X1,X2)) -> a__U12(mark(X1),X2) 28: mark(isNat(X)) -> a__isNat(X) 29: mark(U13(X)) -> a__U13(mark(X)) 30: mark(U21(X1,X2)) -> a__U21(mark(X1),X2) 31: mark(U22(X)) -> a__U22(mark(X)) 32: mark(U31(X1,X2,X3)) -> a__U31(mark(X1),X2,X3) 33: mark(U32(X1,X2)) -> a__U32(mark(X1),X2) 34: mark(U33(X)) -> a__U33(mark(X)) 35: mark(U41(X1,X2)) -> a__U41(mark(X1),X2) 36: mark(U51(X1,X2,X3)) -> a__U51(mark(X1),X2,X3) 37: mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) 38: mark(U61(X)) -> a__U61(mark(X)) 39: mark(U71(X1,X2,X3)) -> a__U71(mark(X1),X2,X3) 40: mark(x(X1,X2)) -> a__x(mark(X1),mark(X2)) 41: mark(and(X1,X2)) -> a__and(mark(X1),X2) 42: mark(isNatKind(X)) -> a__isNatKind(X) 43: mark(tt()) -> tt() 44: mark(s(X)) -> s(mark(X)) 45: mark(0()) -> 0() 46: a__U11(X1,X2,X3) -> U11(X1,X2,X3) 47: a__U12(X1,X2) -> U12(X1,X2) 48: a__isNat(X) -> isNat(X) 49: a__U13(X) -> U13(X) 50: a__U21(X1,X2) -> U21(X1,X2) 51: a__U22(X) -> U22(X) 52: a__U31(X1,X2,X3) -> U31(X1,X2,X3) 53: a__U32(X1,X2) -> U32(X1,X2) 54: a__U33(X) -> U33(X) 55: a__U41(X1,X2) -> U41(X1,X2) 56: a__U51(X1,X2,X3) -> U51(X1,X2,X3) 57: a__plus(X1,X2) -> plus(X1,X2) 58: a__U61(X) -> U61(X) 59: a__U71(X1,X2,X3) -> U71(X1,X2,X3) 60: a__x(X1,X2) -> x(X1,X2) 61: a__and(X1,X2) -> and(X1,X2) 62: a__isNatKind(X) -> isNatKind(X) Number of strict rules: 62 Direct poly ... failed. Freezing ... failed. Dependency Pairs: #1: #a__U12(tt(),V2) -> #a__U13(a__isNat(V2)) #2: #a__U12(tt(),V2) -> #a__isNat(V2) #3: #mark(U13(X)) -> #a__U13(mark(X)) #4: #mark(U13(X)) -> #mark(X) #5: #mark(U41(X1,X2)) -> #a__U41(mark(X1),X2) #6: #mark(U41(X1,X2)) -> #mark(X1) #7: #mark(isNatKind(X)) -> #a__isNatKind(X) #8: #mark(and(X1,X2)) -> #a__and(mark(X1),X2) #9: #mark(and(X1,X2)) -> #mark(X1) #10: #mark(plus(X1,X2)) -> #a__plus(mark(X1),mark(X2)) #11: #mark(plus(X1,X2)) -> #mark(X1) #12: #mark(plus(X1,X2)) -> #mark(X2) #13: #mark(U61(X)) -> #a__U61(mark(X)) #14: #mark(U61(X)) -> #mark(X) #15: #a__U31(tt(),V1,V2) -> #a__U32(a__isNat(V1),V2) #16: #a__U31(tt(),V1,V2) -> #a__isNat(V1) #17: #mark(x(X1,X2)) -> #a__x(mark(X1),mark(X2)) #18: #mark(x(X1,X2)) -> #mark(X1) #19: #mark(x(X1,X2)) -> #mark(X2) #20: #a__and(tt(),X) -> #mark(X) #21: #a__U41(tt(),N) -> #mark(N) #22: #a__x(N,0()) -> #a__U61(a__and(a__isNat(N),isNatKind(N))) #23: #a__x(N,0()) -> #a__and(a__isNat(N),isNatKind(N)) #24: #a__x(N,0()) -> #a__isNat(N) #25: #a__plus(N,s(M)) -> #a__U51(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))),M,N) #26: #a__plus(N,s(M)) -> #a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N)))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard