Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381713709
details
property
value
status
complete
benchmark
emmes-nonloop-ex7_7.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n045.star.cs.uiowa.edu
space
EEG_IJCAR_12
run statistics
property
value
solver
NaTT
configuration
Default
runtime (wallclock)
0.427676916122 seconds
cpu usage
0.473764108
max memory
2.2315008E7
stage attributes
key
value
output-size
2884
starexec-result
MAYBE
output
/export/starexec/sandbox/solver/bin/starexec_run_Default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- MAYBE Input TRS: 1: f(true(),xs) -> f(eq(s(length(xs)),length(cons(a(),xs))),append(cons(b(),nil()),xs)) 2: length(nil()) -> 0() 3: length(cons(x,xs)) -> s(length(xs)) 4: eq(0(),0()) -> true() 5: eq(s(x),0()) -> false() 6: eq(0(),s(y)) -> false() 7: eq(s(x),s(y)) -> eq(x,y) 8: append(nil(),ys) -> ys 9: append(cons(x,xs),ys) -> cons(x,append(xs,ys)) Number of strict rules: 9 Direct POLO(bPol) ... failed. Uncurrying length append eq 1: f(true(),xs) -> f(eq^1_s(length(xs),length^1_cons(a(),xs)),append^1_cons(b(),nil(),xs)) 2: length^1_nil() -> 0() 3: length^1_cons(x,xs) -> s(length(xs)) 4: eq^1_0(0()) -> true() 5: eq^1_s(x,0()) -> false() 6: eq^1_0(s(y)) -> false() 7: eq^1_s(x,s(y)) -> eq(x,y) 8: append^1_nil(ys) -> ys 9: append^1_cons(x,xs,ys) -> cons(x,append(xs,ys)) 10: eq(0(),_1) ->= eq^1_0(_1) 11: eq(s(_1),_2) ->= eq^1_s(_1,_2) 12: append(cons(_1,_2),_3) ->= append^1_cons(_1,_2,_3) 13: append(nil(),_1) ->= append^1_nil(_1) 14: length(cons(_1,_2)) ->= length^1_cons(_1,_2) 15: length(nil()) ->= length^1_nil() Number of strict rules: 9 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #append(nil(),_1) ->? #append^1_nil(_1) #2: #append^1_cons(x,xs,ys) -> #append(xs,ys) #3: #eq(s(_1),_2) ->? #eq^1_s(_1,_2) #4: #append(cons(_1,_2),_3) ->? #append^1_cons(_1,_2,_3) #5: #length(cons(_1,_2)) ->? #length^1_cons(_1,_2) #6: #eq^1_s(x,s(y)) -> #eq(x,y) #7: #eq(0(),_1) ->? #eq^1_0(_1) #8: #length^1_cons(x,xs) -> #length(xs) #9: #f(true(),xs) -> #f(eq^1_s(length(xs),length^1_cons(a(),xs)),append^1_cons(b(),nil(),xs)) #10: #f(true(),xs) -> #eq^1_s(length(xs),length^1_cons(a(),xs)) #11: #f(true(),xs) -> #length(xs) #12: #f(true(),xs) -> #length^1_cons(a(),xs) #13: #f(true(),xs) -> #append^1_cons(b(),nil(),xs) #14: #length(nil()) ->? #length^1_nil() Number of SCCs: 4, DPs: 7 SCC { #5 #8 } POLO(Sum)... succeeded. a w: 0 append^1_cons w: 0 #eq^1_s w: 0 s w: 0 eq^1_s w: 0 length^1_nil w: 0 #append w: 0 b w: 0 #eq^1_0 w: 0 eq w: 0 #append^1_cons w: 0 false w: 0 #append^1_nil w: 0 #length^1_cons w: x2 + 1 true w: 0 f w: 0 #eq w: 0 append w: 0 0 w: 0 eq^1_0 w: 0 length^1_cons w: 0 nil w: 0 #f w: 0 #length^1_nil w: 0 cons w: x1 + x2 + 2 length w: 0 #length w: x1 append^1_nil w: 0 USABLE RULES: { } Removed DPs: #5 #8 Number of SCCs: 3, DPs: 5 SCC { #9 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed. Finding a loop... failed.
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472