Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381712988
details
property
value
status
complete
benchmark
double.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n070.star.cs.uiowa.edu
space
Secret_06_TRS
run statistics
property
value
solver
NaTT
configuration
Default
runtime (wallclock)
0.182559013367 seconds
cpu usage
0.230190064
max memory
2.3543808E7
stage attributes
key
value
output-size
3461
starexec-result
MAYBE
output
/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE Input TRS: 1: double(x) -> permute(x,x,a()) 2: permute(x,y,a()) -> permute(isZero(x),x,b()) 3: permute(false(),x,b()) -> permute(ack(x,x),p(x),c()) 4: permute(true(),x,b()) -> 0() 5: permute(y,x,c()) -> s(s(permute(x,y,a()))) 6: p(0()) -> 0() 7: p(s(x)) -> x 8: ack(0(),x) -> plus(x,s(0())) 9: ack(s(x),0()) -> ack(x,s(0())) 10: ack(s(x),s(y)) -> ack(x,ack(s(x),y)) 11: plus(0(),y) -> y 12: plus(s(x),y) -> plus(x,s(y)) 13: plus(x,s(s(y))) -> s(plus(s(x),y)) 14: plus(x,s(0())) -> s(x) 15: plus(x,0()) -> x 16: isZero(0()) -> true() 17: isZero(s(x)) -> false() Number of strict rules: 17 Direct POLO(bPol) ... failed. Uncurrying ack 1: double(x) -> permute(x,x,a()) 2: permute(x,y,a()) -> permute(isZero(x),x,b()) 3: permute(false(),x,b()) -> permute(ack(x,x),p(x),c()) 4: permute(true(),x,b()) -> 0() 5: permute(y,x,c()) -> s(s(permute(x,y,a()))) 6: p(0()) -> 0() 7: p(s(x)) -> x 8: ack^1_0(x) -> plus(x,s(0())) 9: ack^1_s(x,0()) -> ack(x,s(0())) 10: ack^1_s(x,s(y)) -> ack(x,ack^1_s(x,y)) 11: plus(0(),y) -> y 12: plus(s(x),y) -> plus(x,s(y)) 13: plus(x,s(s(y))) -> s(plus(s(x),y)) 14: plus(x,s(0())) -> s(x) 15: plus(x,0()) -> x 16: isZero(0()) -> true() 17: isZero(s(x)) -> false() 18: ack(0(),_1) ->= ack^1_0(_1) 19: ack(s(_1),_2) ->= ack^1_s(_1,_2) Number of strict rules: 17 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #permute(x,y,a()) -> #permute(isZero(x),x,b()) #2: #permute(x,y,a()) -> #isZero(x) #3: #plus(x,s(s(y))) -> #plus(s(x),y) #4: #ack^1_s(x,0()) -> #ack(x,s(0())) #5: #plus(s(x),y) -> #plus(x,s(y)) #6: #ack^1_s(x,s(y)) -> #ack(x,ack^1_s(x,y)) #7: #ack^1_s(x,s(y)) -> #ack^1_s(x,y) #8: #permute(y,x,c()) -> #permute(x,y,a()) #9: #ack(s(_1),_2) ->? #ack^1_s(_1,_2) #10: #permute(false(),x,b()) -> #permute(ack(x,x),p(x),c()) #11: #permute(false(),x,b()) -> #ack(x,x) #12: #permute(false(),x,b()) -> #p(x) #13: #double(x) -> #permute(x,x,a()) #14: #ack^1_0(x) -> #plus(x,s(0())) #15: #ack(0(),_1) ->? #ack^1_0(_1) Number of SCCs: 3, DPs: 9 SCC { #3 #5 } POLO(Sum)... succeeded. a w: 0 s w: x1 + 2 #ack^1_s w: 0 #isZero w: 0 #ack^1_0 w: 0 permute w: 0 b w: 0 ack w: 0 #plus w: x1 + x2 false w: 0 c w: 0 #p w: 0 true w: 0 p w: 0 0 w: 0 #double w: 0 double w: 0 ack^1_0 w: 0 plus w: 0 #ack w: 0 ack^1_s w: 0 #permute w: 0 isZero w: 0 USABLE RULES: { } Removed DPs: #3 Number of SCCs: 3, DPs: 8 SCC { #5 } POLO(Sum)... succeeded. a w: 0 s w: x1 + 1 #ack^1_s w: 0 #isZero w: 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472