Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516965108
details
property
value
status
complete
benchmark
Ex5TermProof.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n074.star.cs.uiowa.edu
space
AotoYamada_05
run statistics
property
value
solver
NaTT 2.1
configuration
default
runtime (wallclock)
0.607749938965 seconds
cpu usage
0.671995197
max memory
3.442688E7
stage attributes
key
value
output-size
3952
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: app(app(add(),0()),y) -> y 2: app(app(add(),app(s(),x)),y) -> app(s(),app(app(add(),x),y)) 3: app(app(mult(),0()),y) -> 0() 4: app(app(mult(),app(s(),x)),y) -> app(app(add(),app(app(mult(),x),y)),y) 5: app(app(app(rec(),f),x),0()) -> x 6: app(app(app(rec(),f),x),app(s(),y)) -> app(app(f,app(s(),y)),app(app(app(rec(),f),x),y)) 7: fact() -> app(app(rec(),mult()),app(s(),0())) Number of strict rules: 7 Direct poly ... failed. Freezing app 1: app❆2_add(0(),y) -> y 2: app❆2_add(app❆1_s(x),y) -> app❆1_s(app❆2_add(x,y)) 3: app❆2_mult(0(),y) -> 0() 4: app❆2_mult(app❆1_s(x),y) -> app❆2_add(app❆2_mult(x,y),y) 5: app❆3_rec(f,x,0()) -> x 6: app❆3_rec(f,x,app❆1_s(y)) -> app(app(f,app❆1_s(y)),app❆3_rec(f,x,y)) 7: fact() -> app❆2_rec(mult(),app❆1_s(0())) 8: app(rec(),_1) ->= app❆1_rec(_1) 9: app(app❆1_rec(_1),_2) ->= app❆2_rec(_1,_2) 10: app(app❆2_rec(_1,_2),_3) ->= app❆3_rec(_1,_2,_3) 11: app(s(),_1) ->= app❆1_s(_1) 12: app(add(),_1) ->= app❆1_add(_1) 13: app(app❆1_add(_1),_2) ->= app❆2_add(_1,_2) 14: app(mult(),_1) ->= app❆1_mult(_1) 15: app(app❆1_mult(_1),_2) ->= app❆2_mult(_1,_2) Number of strict rules: 7 Direct poly ... failed. Dependency Pairs: #1: #app❆2_add(app❆1_s(x),y) -> #app❆2_add(x,y) #2: #app❆3_rec(f,x,app❆1_s(y)) -> #app(app(f,app❆1_s(y)),app❆3_rec(f,x,y)) #3: #app❆3_rec(f,x,app❆1_s(y)) -> #app(f,app❆1_s(y)) #4: #app❆3_rec(f,x,app❆1_s(y)) -> #app❆3_rec(f,x,y) #5: #app(app❆1_add(_1),_2) ->? #app❆2_add(_1,_2) #6: #app(app❆2_rec(_1,_2),_3) ->? #app❆3_rec(_1,_2,_3) #7: #app(app❆1_mult(_1),_2) ->? #app❆2_mult(_1,_2) #8: #app❆2_mult(app❆1_s(x),y) -> #app❆2_add(app❆2_mult(x,y),y) #9: #app❆2_mult(app❆1_s(x),y) -> #app❆2_mult(x,y) Number of SCCs: 3, DPs: 6 SCC { #9 } Sum... succeeded. #app❆3_rec(x1,x2,x3) w: (0) app❆2_rec(x1,x2) w: (0) s() w: (0) app❆3_rec(x1,x2,x3) w: (0) app❆2_mult(x1,x2) w: (0) app❆2_add(x1,x2) w: (0) #fact() w: (0) mult() w: (0) 0() w: (0) rec() w: (0) #app❆2_mult(x1,x2) w: (x1) fact() w: (0) app❆1_rec(x1) w: (0) #app(x1,x2) w: (0) #app❆2_add(x1,x2) w: (0) add() w: (0) app❆1_add(x1) w: (0) app❆1_s(x1) w: (1 + x1) app❆1_mult(x1) w: (0) app(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #9 Number of SCCs: 2, DPs: 5 SCC { #1 } Sum... succeeded. #app❆3_rec(x1,x2,x3) w: (0) app❆2_rec(x1,x2) w: (0) s() w: (0) app❆3_rec(x1,x2,x3) w: (0) app❆2_mult(x1,x2) w: (0) app❆2_add(x1,x2) w: (0) #fact() w: (0) mult() w: (0) 0() w: (0) rec() w: (0) #app❆2_mult(x1,x2) w: (0) fact() w: (0) app❆1_rec(x1) w: (0) #app(x1,x2) w: (0) #app❆2_add(x1,x2) w: (x1) add() w: (0) app❆1_add(x1) w: (0) app❆1_s(x1) w: (1 + x1) app❆1_mult(x1) w: (0) app(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #1 Number of SCCs: 1, DPs: 4 SCC { #2..4 #6 } Sum... Max... succeeded. #app❆3_rec(x1,x2,x3) w: (max{0, 1 + x2, 20539 + x1}) app❆2_rec(x1,x2) w: (max{x2, 20538 + x1})
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard