Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516965033
details
property
value
status
complete
benchmark
020.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n029.star.cs.uiowa.edu
space
AotoYamada_05
run statistics
property
value
solver
NaTT 2.1
configuration
default
runtime (wallclock)
0.120276927948 seconds
cpu usage
0.061377843
max memory
9007104.0
stage attributes
key
value
output-size
3739
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: app(app(plus(),0()),y) -> y 2: app(app(plus(),app(s(),x)),y) -> app(s(),app(app(plus(),x),y)) 3: app(app(times(),0()),y) -> 0() 4: app(app(times(),app(s(),x)),y) -> app(app(plus(),app(app(times(),x),y)),y) 5: app(app(app(comp(),f),g),x) -> app(f,app(g,x)) 6: app(twice(),f) -> app(app(comp(),f),f) Number of strict rules: 6 Direct poly ... failed. Freezing app 1: app❆2_plus(0(),y) -> y 2: app❆2_plus(app❆1_s(x),y) -> app❆1_s(app❆2_plus(x,y)) 3: app❆2_times(0(),y) -> 0() 4: app❆2_times(app❆1_s(x),y) -> app❆2_plus(app❆2_times(x,y),y) 5: app❆3_comp(f,g,x) -> app(f,app(g,x)) 6: app❆1_twice(f) -> app❆2_comp(f,f) 7: app(plus(),_1) ->= app❆1_plus(_1) 8: app(app❆1_plus(_1),_2) ->= app❆2_plus(_1,_2) 9: app(times(),_1) ->= app❆1_times(_1) 10: app(app❆1_times(_1),_2) ->= app❆2_times(_1,_2) 11: app(s(),_1) ->= app❆1_s(_1) 12: app(twice(),_1) ->= app❆1_twice(_1) 13: app(comp(),_1) ->= app❆1_comp(_1) 14: app(app❆1_comp(_1),_2) ->= app❆2_comp(_1,_2) 15: app(app❆2_comp(_1,_2),_3) ->= app❆3_comp(_1,_2,_3) Number of strict rules: 6 Direct poly ... failed. Dependency Pairs: #1: #app❆2_plus(app❆1_s(x),y) -> #app❆2_plus(x,y) #2: #app(twice(),_1) ->? #app❆1_twice(_1) #3: #app(app❆1_times(_1),_2) ->? #app❆2_times(_1,_2) #4: #app❆3_comp(f,g,x) -> #app(f,app(g,x)) #5: #app❆3_comp(f,g,x) -> #app(g,x) #6: #app(app❆1_plus(_1),_2) ->? #app❆2_plus(_1,_2) #7: #app(app❆2_comp(_1,_2),_3) ->? #app❆3_comp(_1,_2,_3) #8: #app❆2_times(app❆1_s(x),y) -> #app❆2_plus(app❆2_times(x,y),y) #9: #app❆2_times(app❆1_s(x),y) -> #app❆2_times(x,y) Number of SCCs: 3, DPs: 5 SCC { #9 } Sum... succeeded. s() w: (0) app❆1_plus(x1) w: (0) twice() w: (0) app❆2_comp(x1,x2) w: (0) app❆2_plus(x1,x2) w: (0) app❆1_comp(x1) w: (0) 0() w: (0) #app❆2_plus(x1,x2) w: (0) times() w: (0) #app(x1,x2) w: (0) #app❆3_comp(x1,x2,x3) w: (0) #app❆2_times(x1,x2) w: (x1) plus() w: (0) app❆2_times(x1,x2) w: (0) #app❆1_twice(x1) w: (0) app❆1_s(x1) w: (1 + x1) app❆3_comp(x1,x2,x3) w: (0) app❆1_twice(x1) w: (0) app❆1_times(x1) w: (0) comp() w: (0) app(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #9 Number of SCCs: 2, DPs: 4 SCC { #1 } Sum... succeeded. s() w: (0) app❆1_plus(x1) w: (0) twice() w: (0) app❆2_comp(x1,x2) w: (0) app❆2_plus(x1,x2) w: (0) app❆1_comp(x1) w: (0) 0() w: (0) #app❆2_plus(x1,x2) w: (x1) times() w: (0) #app(x1,x2) w: (0) #app❆3_comp(x1,x2,x3) w: (0) #app❆2_times(x1,x2) w: (0) plus() w: (0) app❆2_times(x1,x2) w: (0) #app❆1_twice(x1) w: (0) app❆1_s(x1) w: (1 + x1) app❆3_comp(x1,x2,x3) w: (0) app❆1_twice(x1) w: (0) app❆1_times(x1) w: (0) comp() w: (0) app(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #1 Number of SCCs: 1, DPs: 3 SCC { #4 #5 #7 } Sum... succeeded. s() w: (1)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard