Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
HRS 58631 pair #381918922
details
property
value
status
complete
benchmark
prefixshuffle.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n034.star.cs.uiowa.edu
space
Mixed_HO_12
run statistics
property
value
solver
sol 37957
configuration
hrs
runtime (wallclock)
0.0940020084381 seconds
cpu usage
0.086122658
max memory
7933952.0
stage attributes
key
value
output-size
11007
starexec-result
MAYBE
output
/export/starexec/sandbox2/solver/bin/starexec_run_hrs /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE 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: app(nil(),L) -> L 2: app(cons(N,L),Y) -> cons(N,app(L,Y)) 3: reverse(nil()) -> nil() 4: reverse(cons(N,L)) -> app(reverse(L),cons(N,nil())) 5: shuffle(nil()) -> nil() 6: shuffle(cons(N,L)) -> cons(N,shuffle(reverse(L))) 7: fst(p(X,Y)) -> X 8: pshuffle(L) -> p(L,shuffle(L)) 9: _(X1,X2) -> X1 10: _(X1,X2) -> X2 Number of strict rules: 10 Direct POLO(bPol) ... removes: 8 5 10 7 9 fst w: 2 * x1 + 1 reverse w: x1 _ w: 2 * x1 + 2 * x2 + 1 shuffle w: x1 + 1641 p w: x1 + x2 + 4214 pshuffle w: 2 * x1 + 5856 nil w: 0 cons w: x1 + x2 + 1889 app w: x1 + x2 Number of strict rules: 5 Direct POLO(bPol) ... removes: 3 6 fst w: 2 * x1 + 1 reverse w: x1 + 9726 _ w: 2 * x1 + 2 * x2 + 1 shuffle w: 2 * x1 + 1641 p w: x1 + x2 + 4214 pshuffle w: 2 * x1 + 5856 nil w: 0 cons w: x1 + x2 + 20293 app w: x1 + x2 Number of strict rules: 3 Direct POLO(bPol) ... removes: 4 1 fst w: 2 * x1 + 1 reverse w: 2 * x1 + 1 _ w: 2 * x1 + 2 * x2 + 1 shuffle w: 2 * x1 + 1641 p w: x1 + x2 + 4214 pshuffle w: 2 * x1 + 5856 nil w: 1 cons w: x1 + x2 + 3 app w: x1 + x2 + 1 Number of strict rules: 1 Direct POLO(bPol) ... removes: 2 fst w: 2 * x1 + 1 reverse w: 2 * x1 + 419 _ w: 2 * x1 + 2 * x2 + 1 shuffle w: 2 * x1 + 1641 p w: x1 + x2 + 4214 pshuffle w: 2 * x1 + 5856 nil w: 2332 cons w: x1 + x2 + 1912 app w: 2 * x1 + 2 * x2 + 1651 Number of strict rules: 0 ... Input TRS: 1: app(nil(),L) -> L 2: app(cons(N,L),Y) -> cons(N,app(L,Y)) 3: reverse(nil()) -> nil() 4: reverse(cons(N,L)) -> app(reverse(L),cons(N,nil())) 5: shuffle(nil()) -> nil() 6: shuffle(cons(N,L)) -> cons(N,shuffle(reverse(L))) 7: fst(p(X,Y)) -> X 8: pshuffle(L) -> p(L,shuffle(L)) 9: _(X1,X2) -> X1 10: _(X1,X2) -> X2 Number of strict rules: 10 Direct POLO(bPol) ... removes: 8 5 10 7 9 fst w: 2 * x1 + 1 reverse w: x1 _ w: 2 * x1 + 2 * x2 + 1 shuffle w: x1 + 1641 p w: x1 + x2 + 4214 pshuffle w: 2 * x1 + 5856 nil w: 0 cons w: x1 + x2 + 1889 app w: x1 + x2 Number of strict rules: 5 Direct POLO(bPol) ... removes: 3 6 fst w: 2 * x1 + 1 reverse w: x1 + 9726 _ w: 2 * x1 + 2 * x2 + 1 shuffle w: 2 * x1 + 1641 p w: x1 + x2 + 4214 pshuffle w: 2 * x1 + 5856
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to HRS 58631