details

property	value
status	complete
benchmark	h20.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n035.star.cs.uiowa.edu
space	Hamana_Kikuchi_18

run statistics

property	value
solver	sol 37957
configuration	default
runtime (wallclock)	1.25159811974 seconds
cpu usage	1.479027426
max memory	4.2496E7

stage attributes

key	value
output-size	36119
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 We split firstr-order part and higher-order part, and do modular checking by a general modularity. ******** FO SN check ******** Check SN using NaTT (Nagoya Termination Tool) Input TRS: 1: active(from(X)) -> mark(cons(X,from(s(X)))) 2: active(sel(0(),cons(Y,U))) -> mark(Y) 3: active(sel(s(V),cons(W,P))) -> mark(sel(V,P)) 4: active(minus(X1,0())) -> mark(0()) 5: active(minus(s(Y1),s(U1))) -> mark(minus(Y1,U1)) 6: active(quot(0(),s(V1))) -> mark(0()) 7: active(quot(s(W1),s(P1))) -> mark(s(quot(minus(W1,P1),s(P1)))) 8: active(zWquot(X2,nil())) -> mark(nil()) 9: active(zWquot(nil(),Y2)) -> mark(nil()) 10: active(zWquot(cons(U2,V2),cons(W2,P2))) -> mark(cons(quot(U2,W2),zWquot(V2,P2))) 11: mark(from(X3)) -> active(from(mark(X3))) 12: mark(cons(Y3,U3)) -> active(cons(mark(Y3),U3)) 13: mark(s(V3)) -> active(s(mark(V3))) 14: mark(sel(W3,P3)) -> active(sel(mark(W3),mark(P3))) 15: mark(0()) -> active(0()) 16: mark(minus(X4,Y4)) -> active(minus(mark(X4),mark(Y4))) 17: mark(quot(U4,V4)) -> active(quot(mark(U4),mark(V4))) 18: mark(zWquot(W4,P4)) -> active(zWquot(mark(W4),mark(P4))) 19: mark(nil()) -> active(nil()) 20: from(mark(X5)) -> from(X5) 21: from(active(Y5)) -> from(Y5) 22: cons(mark(U5),V5) -> cons(U5,V5) 23: cons(W5,mark(P5)) -> cons(W5,P5) 24: cons(active(X6),Y6) -> cons(X6,Y6) 25: cons(U6,active(V6)) -> cons(U6,V6) 26: s(mark(W6)) -> s(W6) 27: s(active(P6)) -> s(P6) 28: sel(mark(X7),Y7) -> sel(X7,Y7) 29: sel(U7,mark(V7)) -> sel(U7,V7) 30: sel(active(W7),P7) -> sel(W7,P7) 31: sel(X8,active(Y8)) -> sel(X8,Y8) 32: minus(mark(U8),V8) -> minus(U8,V8) 33: minus(W8,mark(P8)) -> minus(W8,P8) 34: minus(active(X9),Y9) -> minus(X9,Y9) 35: minus(U9,active(V9)) -> minus(U9,V9) 36: quot(mark(W9),P9) -> quot(W9,P9) 37: quot(X10,mark(Y10)) -> quot(X10,Y10) 38: quot(active(U10),V10) -> quot(U10,V10) 39: quot(W10,active(P10)) -> quot(W10,P10) 40: zWquot(mark(X11),Y11) -> zWquot(X11,Y11) 41: zWquot(U11,mark(V11)) -> zWquot(U11,V11) 42: zWquot(active(W11),P11) -> zWquot(W11,P11) 43: zWquot(X12,active(Y12)) -> zWquot(X12,Y12) 44: _(X1,X2) -> X1 45: _(X1,X2) -> X2 Number of strict rules: 45 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #active(sel(0(),cons(Y,U))) -> #mark(Y) #2: #zWquot(X12,active(Y12)) -> #zWquot(X12,Y12) #3: #sel(U7,mark(V7)) -> #sel(U7,V7) #4: #minus(U9,active(V9)) -> #minus(U9,V9) #5: #zWquot(active(W11),P11) -> #zWquot(W11,P11) #6: #zWquot(U11,mark(V11)) -> #zWquot(U11,V11) #7: #quot(X10,mark(Y10)) -> #quot(X10,Y10) #8: #quot(active(U10),V10) -> #quot(U10,V10) #9: #active(quot(0(),s(V1))) -> #mark(0()) #10: #zWquot(mark(X11),Y11) -> #zWquot(X11,Y11) #11: #mark(s(V3)) -> #active(s(mark(V3))) #12: #mark(s(V3)) -> #s(mark(V3)) #13: #mark(s(V3)) -> #mark(V3) #14: #active(zWquot(nil(),Y2)) -> #mark(nil()) #15: #mark(from(X3)) -> #active(from(mark(X3))) #16: #mark(from(X3)) -> #from(mark(X3)) #17: #mark(from(X3)) -> #mark(X3) #18: #cons(active(X6),Y6) -> #cons(X6,Y6) #19: #cons(W5,mark(P5)) -> #cons(W5,P5) #20: #mark(cons(Y3,U3)) -> #active(cons(mark(Y3),U3)) #21: #mark(cons(Y3,U3)) -> #cons(mark(Y3),U3) #22: #mark(cons(Y3,U3)) -> #mark(Y3) #23: #sel(X8,active(Y8)) -> #sel(X8,Y8) #24: #mark(sel(W3,P3)) -> #active(sel(mark(W3),mark(P3))) #25: #mark(sel(W3,P3)) -> #sel(mark(W3),mark(P3)) #26: #mark(sel(W3,P3)) -> #mark(W3) #27: #mark(sel(W3,P3)) -> #mark(P3) #28: #sel(active(W7),P7) -> #sel(W7,P7) #29: #cons(U6,active(V6)) -> #cons(U6,V6) #30: #from(mark(X5)) -> #from(X5) #31: #active(quot(s(W1),s(P1))) -> #mark(s(quot(minus(W1,P1),s(P1)))) #32: #active(quot(s(W1),s(P1))) -> #s(quot(minus(W1,P1),s(P1))) #33: #active(quot(s(W1),s(P1))) -> #quot(minus(W1,P1),s(P1)) #34: #active(quot(s(W1),s(P1))) -> #minus(W1,P1) #35: #quot(W10,active(P10)) -> #quot(W10,P10) #36: #active(zWquot(cons(U2,V2),cons(W2,P2))) -> #mark(cons(quot(U2,W2),zWquot(V2,P2))) #37: #active(zWquot(cons(U2,V2),cons(W2,P2))) -> #cons(quot(U2,W2),zWquot(V2,P2)) #38: #active(zWquot(cons(U2,V2),cons(W2,P2))) -> #quot(U2,W2) popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to HRS union beta 16688