Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381714850
details
property
value
status
complete
benchmark
ExAppendixB_AEL03_GM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n073.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
NaTT
configuration
Default
runtime (wallclock)
0.62656879425 seconds
cpu usage
0.754184901
max memory
2.7414528E7
stage attributes
key
value
output-size
8450
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_Default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Input TRS: 1: a__from(X) -> cons(mark(X),from(s(X))) 2: a__2ndspos(0(),Z) -> rnil() 3: a__2ndspos(s(N),cons(X,Z)) -> a__2ndspos(s(mark(N)),cons2(X,mark(Z))) 4: a__2ndspos(s(N),cons2(X,cons(Y,Z))) -> rcons(posrecip(mark(Y)),a__2ndsneg(mark(N),mark(Z))) 5: a__2ndsneg(0(),Z) -> rnil() 6: a__2ndsneg(s(N),cons(X,Z)) -> a__2ndsneg(s(mark(N)),cons2(X,mark(Z))) 7: a__2ndsneg(s(N),cons2(X,cons(Y,Z))) -> rcons(negrecip(mark(Y)),a__2ndspos(mark(N),mark(Z))) 8: a__pi(X) -> a__2ndspos(mark(X),a__from(0())) 9: a__plus(0(),Y) -> mark(Y) 10: a__plus(s(X),Y) -> s(a__plus(mark(X),mark(Y))) 11: a__times(0(),Y) -> 0() 12: a__times(s(X),Y) -> a__plus(mark(Y),a__times(mark(X),mark(Y))) 13: a__square(X) -> a__times(mark(X),mark(X)) 14: mark(from(X)) -> a__from(mark(X)) 15: mark(2ndspos(X1,X2)) -> a__2ndspos(mark(X1),mark(X2)) 16: mark(2ndsneg(X1,X2)) -> a__2ndsneg(mark(X1),mark(X2)) 17: mark(pi(X)) -> a__pi(mark(X)) 18: mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) 19: mark(times(X1,X2)) -> a__times(mark(X1),mark(X2)) 20: mark(square(X)) -> a__square(mark(X)) 21: mark(0()) -> 0() 22: mark(s(X)) -> s(mark(X)) 23: mark(posrecip(X)) -> posrecip(mark(X)) 24: mark(negrecip(X)) -> negrecip(mark(X)) 25: mark(nil()) -> nil() 26: mark(cons(X1,X2)) -> cons(mark(X1),X2) 27: mark(cons2(X1,X2)) -> cons2(X1,mark(X2)) 28: mark(rnil()) -> rnil() 29: mark(rcons(X1,X2)) -> rcons(mark(X1),mark(X2)) 30: a__from(X) -> from(X) 31: a__2ndspos(X1,X2) -> 2ndspos(X1,X2) 32: a__2ndsneg(X1,X2) -> 2ndsneg(X1,X2) 33: a__pi(X) -> pi(X) 34: a__plus(X1,X2) -> plus(X1,X2) 35: a__times(X1,X2) -> times(X1,X2) 36: a__square(X) -> square(X) Number of strict rules: 36 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #mark(rcons(X1,X2)) -> #mark(X1) #2: #mark(rcons(X1,X2)) -> #mark(X2) #3: #a__2ndsneg(s(N),cons(X,Z)) -> #a__2ndsneg(s(mark(N)),cons2(X,mark(Z))) #4: #a__2ndsneg(s(N),cons(X,Z)) -> #mark(N) #5: #a__2ndsneg(s(N),cons(X,Z)) -> #mark(Z) #6: #a__square(X) -> #a__times(mark(X),mark(X)) #7: #a__square(X) -> #mark(X) #8: #a__square(X) -> #mark(X) #9: #a__plus(0(),Y) -> #mark(Y) #10: #mark(negrecip(X)) -> #mark(X) #11: #mark(posrecip(X)) -> #mark(X) #12: #a__times(s(X),Y) -> #a__plus(mark(Y),a__times(mark(X),mark(Y))) #13: #a__times(s(X),Y) -> #mark(Y) #14: #a__times(s(X),Y) -> #a__times(mark(X),mark(Y)) #15: #a__times(s(X),Y) -> #mark(X) #16: #a__times(s(X),Y) -> #mark(Y) #17: #mark(from(X)) -> #a__from(mark(X)) #18: #mark(from(X)) -> #mark(X) #19: #mark(square(X)) -> #a__square(mark(X)) #20: #mark(square(X)) -> #mark(X) #21: #a__2ndsneg(s(N),cons2(X,cons(Y,Z))) -> #mark(Y) #22: #a__2ndsneg(s(N),cons2(X,cons(Y,Z))) -> #a__2ndspos(mark(N),mark(Z)) #23: #a__2ndsneg(s(N),cons2(X,cons(Y,Z))) -> #mark(N) #24: #a__2ndsneg(s(N),cons2(X,cons(Y,Z))) -> #mark(Z) #25: #a__plus(s(X),Y) -> #a__plus(mark(X),mark(Y)) #26: #a__plus(s(X),Y) -> #mark(X) #27: #a__plus(s(X),Y) -> #mark(Y) #28: #mark(s(X)) -> #mark(X) #29: #mark(cons2(X1,X2)) -> #mark(X2) #30: #mark(pi(X)) -> #a__pi(mark(X)) #31: #mark(pi(X)) -> #mark(X) #32: #mark(times(X1,X2)) -> #a__times(mark(X1),mark(X2)) #33: #mark(times(X1,X2)) -> #mark(X1) #34: #mark(times(X1,X2)) -> #mark(X2) #35: #mark(cons(X1,X2)) -> #mark(X1) #36: #mark(2ndsneg(X1,X2)) -> #a__2ndsneg(mark(X1),mark(X2)) #37: #mark(2ndsneg(X1,X2)) -> #mark(X1) #38: #mark(2ndsneg(X1,X2)) -> #mark(X2) #39: #a__2ndspos(s(N),cons(X,Z)) -> #a__2ndspos(s(mark(N)),cons2(X,mark(Z))) #40: #a__2ndspos(s(N),cons(X,Z)) -> #mark(N) #41: #a__2ndspos(s(N),cons(X,Z)) -> #mark(Z) #42: #a__from(X) -> #mark(X) #43: #a__pi(X) -> #a__2ndspos(mark(X),a__from(0())) #44: #a__pi(X) -> #mark(X) #45: #a__pi(X) -> #a__from(0()) #46: #mark(2ndspos(X1,X2)) -> #a__2ndspos(mark(X1),mark(X2)) #47: #mark(2ndspos(X1,X2)) -> #mark(X1) #48: #mark(2ndspos(X1,X2)) -> #mark(X2) #49: #a__2ndspos(s(N),cons2(X,cons(Y,Z))) -> #mark(Y) #50: #a__2ndspos(s(N),cons2(X,cons(Y,Z))) -> #a__2ndsneg(mark(N),mark(Z)) #51: #a__2ndspos(s(N),cons2(X,cons(Y,Z))) -> #mark(N) #52: #a__2ndspos(s(N),cons2(X,cons(Y,Z))) -> #mark(Z)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472