Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381711161
details
property
value
status
complete
benchmark
#3.10.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n105.star.cs.uiowa.edu
space
Applicative_first_order_05
run statistics
property
value
solver
NaTT
configuration
Default
runtime (wallclock)
0.21318602562 seconds
cpu usage
0.241557277
max memory
1.1776E7
stage attributes
key
value
output-size
21303
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Input TRS: 1: app'(app'(eq(),0()),0()) -> true() 2: app'(app'(eq(),0()),app'(s(),x)) -> false() 3: app'(app'(eq(),app'(s(),x)),0()) -> false() 4: app'(app'(eq(),app'(s(),x)),app'(s(),y)) -> app'(app'(eq(),x),y) 5: app'(app'(le(),0()),y) -> true() 6: app'(app'(le(),app'(s(),x)),0()) -> false() 7: app'(app'(le(),app'(s(),x)),app'(s(),y)) -> app'(app'(le(),x),y) 8: app'(app'(app(),nil()),y) -> y 9: app'(app'(app(),app'(app'(add(),n),x)),y) -> app'(app'(add(),n),app'(app'(app(),x),y)) 10: app'(min(),app'(app'(add(),n),nil())) -> n 11: app'(min(),app'(app'(add(),n),app'(app'(add(),m),x))) -> app'(app'(if_min(),app'(app'(le(),n),m)),app'(app'(add(),n),app'(app'(add(),m),x))) 12: app'(app'(if_min(),true()),app'(app'(add(),n),app'(app'(add(),m),x))) -> app'(min(),app'(app'(add(),n),x)) 13: app'(app'(if_min(),false()),app'(app'(add(),n),app'(app'(add(),m),x))) -> app'(min(),app'(app'(add(),m),x)) 14: app'(app'(rm(),n),nil()) -> nil() 15: app'(app'(rm(),n),app'(app'(add(),m),x)) -> app'(app'(app'(if_rm(),app'(app'(eq(),n),m)),n),app'(app'(add(),m),x)) 16: app'(app'(app'(if_rm(),true()),n),app'(app'(add(),m),x)) -> app'(app'(rm(),n),x) 17: app'(app'(app'(if_rm(),false()),n),app'(app'(add(),m),x)) -> app'(app'(add(),m),app'(app'(rm(),n),x)) 18: app'(app'(minsort(),nil()),nil()) -> nil() 19: app'(app'(minsort(),app'(app'(add(),n),x)),y) -> app'(app'(app'(if_minsort(),app'(app'(eq(),n),app'(min(),app'(app'(add(),n),x)))),app'(app'(add(),n),x)),y) 20: app'(app'(app'(if_minsort(),true()),app'(app'(add(),n),x)),y) -> app'(app'(add(),n),app'(app'(minsort(),app'(app'(app(),app'(app'(rm(),n),x)),y)),nil())) 21: app'(app'(app'(if_minsort(),false()),app'(app'(add(),n),x)),y) -> app'(app'(minsort(),x),app'(app'(add(),n),y)) 22: app'(app'(map(),f),nil()) -> nil() 23: app'(app'(map(),f),app'(app'(add(),x),xs)) -> app'(app'(add(),app'(f,x)),app'(app'(map(),f),xs)) 24: app'(app'(filter(),f),nil()) -> nil() 25: app'(app'(filter(),f),app'(app'(add(),x),xs)) -> app'(app'(app'(app'(filter2(),app'(f,x)),f),x),xs) 26: app'(app'(app'(app'(filter2(),true()),f),x),xs) -> app'(app'(add(),x),app'(app'(filter(),f),xs)) 27: app'(app'(app'(app'(filter2(),false()),f),x),xs) -> app'(app'(filter(),f),xs) Number of strict rules: 27 Direct POLO(bPol) ... failed. Uncurrying app'^1_min app' 1: app'^2_eq(0(),0()) -> true() 2: app'^2_eq(0(),app'^1_s(x)) -> false() 3: app'^2_eq(app'^1_s(x),0()) -> false() 4: app'^2_eq(app'^1_s(x),app'^1_s(y)) -> app'^2_eq(x,y) 5: app'^2_le(0(),y) -> true() 6: app'^2_le(app'^1_s(x),0()) -> false() 7: app'^2_le(app'^1_s(x),app'^1_s(y)) -> app'^2_le(x,y) 8: app'^2_app(nil(),y) -> y 9: app'^2_app(app'^2_add(n,x),y) -> app'^2_add(n,app'^2_app(x,y)) 10: app'^1_min^1_app'^2_add(n,nil()) -> n 11: app'^1_min^1_app'^2_add(n,app'^2_add(m,x)) -> app'^2_if_min(app'^2_le(n,m),app'^2_add(n,app'^2_add(m,x))) 12: app'^2_if_min(true(),app'^2_add(n,app'^2_add(m,x))) -> app'^1_min^1_app'^2_add(n,x) 13: app'^2_if_min(false(),app'^2_add(n,app'^2_add(m,x))) -> app'^1_min^1_app'^2_add(m,x) 14: app'^2_rm(n,nil()) -> nil() 15: app'^2_rm(n,app'^2_add(m,x)) -> app'^3_if_rm(app'^2_eq(n,m),n,app'^2_add(m,x)) 16: app'^3_if_rm(true(),n,app'^2_add(m,x)) -> app'^2_rm(n,x) 17: app'^3_if_rm(false(),n,app'^2_add(m,x)) -> app'^2_add(m,app'^2_rm(n,x)) 18: app'^2_minsort(nil(),nil()) -> nil() 19: app'^2_minsort(app'^2_add(n,x),y) -> app'^3_if_minsort(app'^2_eq(n,app'^1_min^1_app'^2_add(n,x)),app'^2_add(n,x),y) 20: app'^3_if_minsort(true(),app'^2_add(n,x),y) -> app'^2_add(n,app'^2_minsort(app'^2_app(app'^2_rm(n,x),y),nil())) 21: app'^3_if_minsort(false(),app'^2_add(n,x),y) -> app'^2_minsort(x,app'^2_add(n,y)) 22: app'^2_map(f,nil()) -> nil() 23: app'^2_map(f,app'^2_add(x,xs)) -> app'^2_add(app'(f,x),app'^2_map(f,xs)) 24: app'^2_filter(f,nil()) -> nil() 25: app'^2_filter(f,app'^2_add(x,xs)) -> app'^4_filter2(app'(f,x),f,x,xs) 26: app'^4_filter2(true(),f,x,xs) -> app'^2_add(x,app'^2_filter(f,xs)) 27: app'^4_filter2(false(),f,x,xs) -> app'^2_filter(f,xs) 28: app'(eq(),_1) ->= app'^1_eq(_1) 29: app'(app'^1_eq(_1),_2) ->= app'^2_eq(_1,_2) 30: app'(min(),_1) ->= app'^1_min(_1) 31: app'(le(),_1) ->= app'^1_le(_1) 32: app'(app'^1_le(_1),_2) ->= app'^2_le(_1,_2) 33: app'(if_rm(),_1) ->= app'^1_if_rm(_1) 34: app'(app'^1_if_rm(_1),_2) ->= app'^2_if_rm(_1,_2) 35: app'(app'^2_if_rm(_1,_2),_3) ->= app'^3_if_rm(_1,_2,_3) 36: app'(add(),_1) ->= app'^1_add(_1) 37: app'(app'^1_add(_1),_2) ->= app'^2_add(_1,_2) 38: app'(if_min(),_1) ->= app'^1_if_min(_1) 39: app'(app'^1_if_min(_1),_2) ->= app'^2_if_min(_1,_2) 40: app'(s(),_1) ->= app'^1_s(_1) 41: app'(if_minsort(),_1) ->= app'^1_if_minsort(_1) 42: app'(app'^1_if_minsort(_1),_2) ->= app'^2_if_minsort(_1,_2) 43: app'(app'^2_if_minsort(_1,_2),_3) ->= app'^3_if_minsort(_1,_2,_3) 44: app'(filter(),_1) ->= app'^1_filter(_1) 45: app'(app'^1_filter(_1),_2) ->= app'^2_filter(_1,_2) 46: app'(minsort(),_1) ->= app'^1_minsort(_1) 47: app'(app'^1_minsort(_1),_2) ->= app'^2_minsort(_1,_2) 48: app'(map(),_1) ->= app'^1_map(_1) 49: app'(app'^1_map(_1),_2) ->= app'^2_map(_1,_2) 50: app'(filter2(),_1) ->= app'^1_filter2(_1) 51: app'(app'^1_filter2(_1),_2) ->= app'^2_filter2(_1,_2) 52: app'(app'^2_filter2(_1,_2),_3) ->= app'^3_filter2(_1,_2,_3) 53: app'(app'^3_filter2(_1,_2,_3),_4) ->= app'^4_filter2(_1,_2,_3,_4) 54: app'(rm(),_1) ->= app'^1_rm(_1) 55: app'(app'^1_rm(_1),_2) ->= app'^2_rm(_1,_2) 56: app'(app(),_1) ->= app'^1_app(_1) 57: app'(app'^1_app(_1),_2) ->= app'^2_app(_1,_2) 58: app'^1_min(app'^2_add(_1,_2)) ->= app'^1_min^1_app'^2_add(_1,_2) Number of strict rules: 27 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #app'(app'^2_if_minsort(_1,_2),_3) ->? #app'^3_if_minsort(_1,_2,_3)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472