Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381713802
details
property
value
status
complete
benchmark
ExAppendixB_AEL03_Z.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n024.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
NaTT
configuration
Default
runtime (wallclock)
0.0709109306335 seconds
cpu usage
0.0807291
max memory
1.2808192E7
stage attributes
key
value
output-size
5205
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: from(X) -> cons(X,n__from(s(X))) 2: 2ndspos(0(),Z) -> rnil() 3: 2ndspos(s(N),cons(X,Z)) -> 2ndspos(s(N),cons2(X,activate(Z))) 4: 2ndspos(s(N),cons2(X,cons(Y,Z))) -> rcons(posrecip(Y),2ndsneg(N,activate(Z))) 5: 2ndsneg(0(),Z) -> rnil() 6: 2ndsneg(s(N),cons(X,Z)) -> 2ndsneg(s(N),cons2(X,activate(Z))) 7: 2ndsneg(s(N),cons2(X,cons(Y,Z))) -> rcons(negrecip(Y),2ndspos(N,activate(Z))) 8: pi(X) -> 2ndspos(X,from(0())) 9: plus(0(),Y) -> Y 10: plus(s(X),Y) -> s(plus(X,Y)) 11: times(0(),Y) -> 0() 12: times(s(X),Y) -> plus(Y,times(X,Y)) 13: square(X) -> times(X,X) 14: from(X) -> n__from(X) 15: activate(n__from(X)) -> from(X) 16: activate(X) -> X Number of strict rules: 16 Direct POLO(bPol) ... failed. Uncurrying 2ndsneg 2ndspos 1: from(X) -> cons(X,n__from(s(X))) 2: 2ndspos^1_0(Z) -> rnil() 3: 2ndspos^1_s(N,cons(X,Z)) -> 2ndspos^1_s(N,cons2(X,activate(Z))) 4: 2ndspos^1_s(N,cons2(X,cons(Y,Z))) -> rcons(posrecip(Y),2ndsneg(N,activate(Z))) 5: 2ndsneg^1_0(Z) -> rnil() 6: 2ndsneg^1_s(N,cons(X,Z)) -> 2ndsneg^1_s(N,cons2(X,activate(Z))) 7: 2ndsneg^1_s(N,cons2(X,cons(Y,Z))) -> rcons(negrecip(Y),2ndspos(N,activate(Z))) 8: pi(X) -> 2ndspos(X,from(0())) 9: plus(0(),Y) -> Y 10: plus(s(X),Y) -> s(plus(X,Y)) 11: times(0(),Y) -> 0() 12: times(s(X),Y) -> plus(Y,times(X,Y)) 13: square(X) -> times(X,X) 14: from(X) -> n__from(X) 15: activate(n__from(X)) -> from(X) 16: activate(X) -> X 17: 2ndspos(0(),_1) ->= 2ndspos^1_0(_1) 18: 2ndspos(s(_1),_2) ->= 2ndspos^1_s(_1,_2) 19: 2ndsneg(0(),_1) ->= 2ndsneg^1_0(_1) 20: 2ndsneg(s(_1),_2) ->= 2ndsneg^1_s(_1,_2) Number of strict rules: 16 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #2ndsneg^1_s(N,cons(X,Z)) -> #2ndsneg^1_s(N,cons2(X,activate(Z))) #2: #2ndsneg^1_s(N,cons(X,Z)) -> #activate(Z) #3: #square(X) -> #times(X,X) #4: #times(s(X),Y) -> #plus(Y,times(X,Y)) #5: #times(s(X),Y) -> #times(X,Y) #6: #2ndsneg(s(_1),_2) ->? #2ndsneg^1_s(_1,_2) #7: #2ndsneg^1_s(N,cons2(X,cons(Y,Z))) -> #2ndspos(N,activate(Z)) #8: #2ndsneg^1_s(N,cons2(X,cons(Y,Z))) -> #activate(Z) #9: #plus(s(X),Y) -> #plus(X,Y) #10: #2ndspos(0(),_1) ->? #2ndspos^1_0(_1) #11: #2ndsneg(0(),_1) ->? #2ndsneg^1_0(_1) #12: #2ndspos^1_s(N,cons(X,Z)) -> #2ndspos^1_s(N,cons2(X,activate(Z))) #13: #2ndspos^1_s(N,cons(X,Z)) -> #activate(Z) #14: #pi(X) -> #2ndspos(X,from(0())) #15: #pi(X) -> #from(0()) #16: #activate(n__from(X)) -> #from(X) #17: #2ndspos^1_s(N,cons2(X,cons(Y,Z))) -> #2ndsneg(N,activate(Z)) #18: #2ndspos^1_s(N,cons2(X,cons(Y,Z))) -> #activate(Z) #19: #2ndspos(s(_1),_2) ->? #2ndspos^1_s(_1,_2) Number of SCCs: 3, DPs: 8 SCC { #5 } POLO(Sum)... succeeded. negrecip w: 0 s w: x1 + 1 2ndsneg^1_0 w: 0 2ndspos w: 0 activate w: 0 rnil w: 0 #plus w: 0 n__from w: 0 square w: 0 #activate w: 0 2ndspos^1_s w: 0 #square w: 0 pi w: 0 2ndsneg^1_s w: 0 rcons w: 0 2ndspos^1_0 w: 0 #times w: x1 0 w: 0 #2ndspos^1_0 w: 0 from w: 0 times w: 0 2ndsneg w: 0 plus w: 0 #2ndspos w: 0 cons2 w: 0 #from w: 0 #2ndspos^1_s w: 0 cons w: 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472