Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381717098
details
property
value
status
complete
benchmark
MYNAT_complete_FR.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n097.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
NaTT
configuration
Default
runtime (wallclock)
1.13259291649 seconds
cpu usage
1.290286231
max memory
3.0756864E7
stage attributes
key
value
output-size
13572
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: U11(tt(),V1,V2) -> U12(isNat(activate(V1)),activate(V2)) 2: U12(tt(),V2) -> U13(isNat(activate(V2))) 3: U13(tt()) -> tt() 4: U21(tt(),V1) -> U22(isNat(activate(V1))) 5: U22(tt()) -> tt() 6: U31(tt(),V1,V2) -> U32(isNat(activate(V1)),activate(V2)) 7: U32(tt(),V2) -> U33(isNat(activate(V2))) 8: U33(tt()) -> tt() 9: U41(tt(),N) -> activate(N) 10: U51(tt(),M,N) -> s(plus(activate(N),activate(M))) 11: U61(tt()) -> 0() 12: U71(tt(),M,N) -> plus(x(activate(N),activate(M)),activate(N)) 13: and(tt(),X) -> activate(X) 14: isNat(n__0()) -> tt() 15: isNat(n__plus(V1,V2)) -> U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2)) 16: isNat(n__s(V1)) -> U21(isNatKind(activate(V1)),activate(V1)) 17: isNat(n__x(V1,V2)) -> U31(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2)) 18: isNatKind(n__0()) -> tt() 19: isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) 20: isNatKind(n__s(V1)) -> isNatKind(activate(V1)) 21: isNatKind(n__x(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) 22: plus(N,0()) -> U41(and(isNat(N),n__isNatKind(N)),N) 23: plus(N,s(M)) -> U51(and(and(isNat(M),n__isNatKind(M)),n__and(n__isNat(N),n__isNatKind(N))),M,N) 24: x(N,0()) -> U61(and(isNat(N),n__isNatKind(N))) 25: x(N,s(M)) -> U71(and(and(isNat(M),n__isNatKind(M)),n__and(n__isNat(N),n__isNatKind(N))),M,N) 26: 0() -> n__0() 27: plus(X1,X2) -> n__plus(X1,X2) 28: isNatKind(X) -> n__isNatKind(X) 29: s(X) -> n__s(X) 30: x(X1,X2) -> n__x(X1,X2) 31: and(X1,X2) -> n__and(X1,X2) 32: isNat(X) -> n__isNat(X) 33: activate(n__0()) -> 0() 34: activate(n__plus(X1,X2)) -> plus(activate(X1),activate(X2)) 35: activate(n__isNatKind(X)) -> isNatKind(X) 36: activate(n__s(X)) -> s(activate(X)) 37: activate(n__x(X1,X2)) -> x(activate(X1),activate(X2)) 38: activate(n__and(X1,X2)) -> and(activate(X1),X2) 39: activate(n__isNat(X)) -> isNat(X) 40: activate(X) -> X Number of strict rules: 40 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #U12(tt(),V2) -> #U13(isNat(activate(V2))) #2: #U12(tt(),V2) -> #isNat(activate(V2)) #3: #U12(tt(),V2) -> #activate(V2) #4: #activate(n__isNatKind(X)) -> #isNatKind(X) #5: #activate(n__x(X1,X2)) -> #x(activate(X1),activate(X2)) #6: #activate(n__x(X1,X2)) -> #activate(X1) #7: #activate(n__x(X1,X2)) -> #activate(X2) #8: #activate(n__and(X1,X2)) -> #and(activate(X1),X2) #9: #activate(n__and(X1,X2)) -> #activate(X1) #10: #U31(tt(),V1,V2) -> #U32(isNat(activate(V1)),activate(V2)) #11: #U31(tt(),V1,V2) -> #isNat(activate(V1)) #12: #U31(tt(),V1,V2) -> #activate(V1) #13: #U31(tt(),V1,V2) -> #activate(V2) #14: #and(tt(),X) -> #activate(X) #15: #U41(tt(),N) -> #activate(N) #16: #U61(tt()) -> #0() #17: #x(N,0()) -> #U61(and(isNat(N),n__isNatKind(N))) #18: #x(N,0()) -> #and(isNat(N),n__isNatKind(N)) #19: #x(N,0()) -> #isNat(N) #20: #plus(N,s(M)) -> #U51(and(and(isNat(M),n__isNatKind(M)),n__and(n__isNat(N),n__isNatKind(N))),M,N) #21: #plus(N,s(M)) -> #and(and(isNat(M),n__isNatKind(M)),n__and(n__isNat(N),n__isNatKind(N))) #22: #plus(N,s(M)) -> #and(isNat(M),n__isNatKind(M)) #23: #plus(N,s(M)) -> #isNat(M) #24: #U71(tt(),M,N) -> #plus(x(activate(N),activate(M)),activate(N)) #25: #U71(tt(),M,N) -> #x(activate(N),activate(M)) #26: #U71(tt(),M,N) -> #activate(N) #27: #U71(tt(),M,N) -> #activate(M) #28: #U71(tt(),M,N) -> #activate(N) #29: #x(N,s(M)) -> #U71(and(and(isNat(M),n__isNatKind(M)),n__and(n__isNat(N),n__isNatKind(N))),M,N) #30: #x(N,s(M)) -> #and(and(isNat(M),n__isNatKind(M)),n__and(n__isNat(N),n__isNatKind(N))) #31: #x(N,s(M)) -> #and(isNat(M),n__isNatKind(M)) #32: #x(N,s(M)) -> #isNat(M) #33: #isNatKind(n__s(V1)) -> #isNatKind(activate(V1)) #34: #isNatKind(n__s(V1)) -> #activate(V1) #35: #U32(tt(),V2) -> #U33(isNat(activate(V2))) #36: #U32(tt(),V2) -> #isNat(activate(V2)) #37: #U32(tt(),V2) -> #activate(V2) #38: #activate(n__isNat(X)) -> #isNat(X) #39: #U51(tt(),M,N) -> #s(plus(activate(N),activate(M))) #40: #U51(tt(),M,N) -> #plus(activate(N),activate(M)) #41: #U51(tt(),M,N) -> #activate(N) #42: #U51(tt(),M,N) -> #activate(M) #43: #activate(n__0()) -> #0() #44: #plus(N,0()) -> #U41(and(isNat(N),n__isNatKind(N)),N) #45: #plus(N,0()) -> #and(isNat(N),n__isNatKind(N)) #46: #plus(N,0()) -> #isNat(N) #47: #activate(n__plus(X1,X2)) -> #plus(activate(X1),activate(X2)) #48: #activate(n__plus(X1,X2)) -> #activate(X1)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472