Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381713617
details
property
value
status
complete
benchmark
thiemann41.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n020.star.cs.uiowa.edu
space
AProVE_07
run statistics
property
value
solver
NaTT
configuration
Default
runtime (wallclock)
0.158849000931 seconds
cpu usage
0.189571227
max memory
1.8010112E7
stage attributes
key
value
output-size
2846
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: times(x,y) -> sum(generate(x,y)) 2: generate(x,y) -> gen(x,y,0()) 3: gen(x,y,z) -> if(ge(z,x),x,y,z) 4: if(true(),x,y,z) -> nil() 5: if(false(),x,y,z) -> cons(y,gen(x,y,s(z))) 6: sum(nil()) -> 0() 7: sum(cons(0(),xs)) -> sum(xs) 8: sum(cons(s(x),xs)) -> s(sum(cons(x,xs))) 9: ge(x,0()) -> true() 10: ge(0(),s(y)) -> false() 11: ge(s(x),s(y)) -> ge(x,y) Number of strict rules: 11 Direct POLO(bPol) ... failed. Uncurrying sum 1: times(x,y) -> sum(generate(x,y)) 2: generate(x,y) -> gen(x,y,0()) 3: gen(x,y,z) -> if(ge(z,x),x,y,z) 4: if(true(),x,y,z) -> nil() 5: if(false(),x,y,z) -> cons(y,gen(x,y,s(z))) 6: sum^1_nil() -> 0() 7: sum^1_cons(0(),xs) -> sum(xs) 8: sum^1_cons(s(x),xs) -> s(sum^1_cons(x,xs)) 9: ge(x,0()) -> true() 10: ge(0(),s(y)) -> false() 11: ge(s(x),s(y)) -> ge(x,y) 12: sum(cons(_1,_2)) ->= sum^1_cons(_1,_2) 13: sum(nil()) ->= sum^1_nil() Number of strict rules: 11 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #generate(x,y) -> #gen(x,y,0()) #2: #sum(nil()) ->? #sum^1_nil() #3: #ge(s(x),s(y)) -> #ge(x,y) #4: #sum(cons(_1,_2)) ->? #sum^1_cons(_1,_2) #5: #sum^1_cons(0(),xs) -> #sum(xs) #6: #if(false(),x,y,z) -> #gen(x,y,s(z)) #7: #gen(x,y,z) -> #if(ge(z,x),x,y,z) #8: #gen(x,y,z) -> #ge(z,x) #9: #times(x,y) -> #sum(generate(x,y)) #10: #times(x,y) -> #generate(x,y) #11: #sum^1_cons(s(x),xs) -> #sum^1_cons(x,xs) Number of SCCs: 3, DPs: 6 SCC { #3 } POLO(Sum)... succeeded. s w: x1 + 1 #generate w: 0 sum^1_cons w: 0 #sum^1_nil w: 0 false w: 0 #ge w: x1 + x2 true w: 0 sum w: 0 #times w: 0 0 w: 0 if w: 0 ge w: 0 times w: 0 sum^1_nil w: 0 nil w: 0 #gen w: 0 #sum^1_cons w: 0 gen w: 0 generate w: 0 cons w: 0 #if w: 0 #sum w: 0 USABLE RULES: { } Removed DPs: #3 Number of SCCs: 2, DPs: 5 SCC { #4 #5 #11 } POLO(Sum)... succeeded. s w: x1 + 1 #generate w: 0 sum^1_cons w: 0 #sum^1_nil w: 0 false w: 0 #ge w: 0 true w: 0 sum w: 0 #times w: 0 0 w: 1 if w: 0 ge w: 0 times w: 0 sum^1_nil w: 0 nil w: 0 #gen w: 0 #sum^1_cons w: x1 + x2 + 1 gen w: 0 generate w: 0 cons w: x1 + x2 + 2 #if w: 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472