details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.138545 seconds
cpu usage	0.143753
user time	0.104966
system time	0.038787
max virtual memory	113176.0
max residence set size	10168.0

stage attributes

key	value
starexec-result	YES

output

0.00/0.13 YES 0.00/0.13 0.00/0.13 Problem 1: 0.00/0.13 0.00/0.13 (VAR v_NonEmpty:S X:S X1:S X2:S Y:S Z:S) 0.00/0.13 (RULES 0.00/0.13 2nd(mark(X:S)) -> mark(2nd(X:S)) 0.00/0.13 2nd(ok(X:S)) -> ok(2nd(X:S)) 0.00/0.13 active(2nd(cons(X:S,X1:S))) -> mark(2nd(cons1(X:S,X1:S))) 0.00/0.13 active(2nd(cons1(X:S,cons(Y:S,Z:S)))) -> mark(Y:S) 0.00/0.13 active(2nd(X:S)) -> 2nd(active(X:S)) 0.00/0.13 active(cons(X1:S,X2:S)) -> cons(active(X1:S),X2:S) 0.00/0.13 active(cons1(X1:S,X2:S)) -> cons1(active(X1:S),X2:S) 0.00/0.13 active(cons1(X1:S,X2:S)) -> cons1(X1:S,active(X2:S)) 0.00/0.13 active(from(X:S)) -> from(active(X:S)) 0.00/0.13 active(from(X:S)) -> mark(cons(X:S,from(s(X:S)))) 0.00/0.13 active(s(X:S)) -> s(active(X:S)) 0.00/0.13 cons(mark(X1:S),X2:S) -> mark(cons(X1:S,X2:S)) 0.00/0.13 cons(ok(X1:S),ok(X2:S)) -> ok(cons(X1:S,X2:S)) 0.00/0.13 cons1(mark(X1:S),X2:S) -> mark(cons1(X1:S,X2:S)) 0.00/0.13 cons1(ok(X1:S),ok(X2:S)) -> ok(cons1(X1:S,X2:S)) 0.00/0.13 cons1(X1:S,mark(X2:S)) -> mark(cons1(X1:S,X2:S)) 0.00/0.13 from(mark(X:S)) -> mark(from(X:S)) 0.00/0.13 from(ok(X:S)) -> ok(from(X:S)) 0.00/0.13 proper(2nd(X:S)) -> 2nd(proper(X:S)) 0.00/0.13 proper(cons(X1:S,X2:S)) -> cons(proper(X1:S),proper(X2:S)) 0.00/0.13 proper(cons1(X1:S,X2:S)) -> cons1(proper(X1:S),proper(X2:S)) 0.00/0.13 proper(from(X:S)) -> from(proper(X:S)) 0.00/0.13 proper(s(X:S)) -> s(proper(X:S)) 0.00/0.13 s(mark(X:S)) -> mark(s(X:S)) 0.00/0.13 s(ok(X:S)) -> ok(s(X:S)) 0.00/0.13 top(mark(X:S)) -> top(proper(X:S)) 0.00/0.13 top(ok(X:S)) -> top(active(X:S)) 0.00/0.13 ) 0.00/0.13 (STRATEGY INNERMOST) 0.00/0.13 0.00/0.13 Problem 1: 0.00/0.13 0.00/0.13 Dependency Pairs Processor: 0.00/0.13 -> Pairs: 0.00/0.13 2ND(mark(X:S)) -> 2ND(X:S) 0.00/0.13 2ND(ok(X:S)) -> 2ND(X:S) 0.00/0.13 ACTIVE(2nd(cons(X:S,X1:S))) -> 2ND(cons1(X:S,X1:S)) 0.00/0.13 ACTIVE(2nd(cons(X:S,X1:S))) -> CONS1(X:S,X1:S) 0.00/0.13 ACTIVE(2nd(X:S)) -> 2ND(active(X:S)) 0.00/0.13 ACTIVE(2nd(X:S)) -> ACTIVE(X:S) 0.00/0.13 ACTIVE(cons(X1:S,X2:S)) -> ACTIVE(X1:S) 0.00/0.13 ACTIVE(cons(X1:S,X2:S)) -> CONS(active(X1:S),X2:S) 0.00/0.13 ACTIVE(cons1(X1:S,X2:S)) -> ACTIVE(X1:S) 0.00/0.13 ACTIVE(cons1(X1:S,X2:S)) -> ACTIVE(X2:S) 0.00/0.13 ACTIVE(cons1(X1:S,X2:S)) -> CONS1(active(X1:S),X2:S) 0.00/0.13 ACTIVE(cons1(X1:S,X2:S)) -> CONS1(X1:S,active(X2:S)) 0.00/0.13 ACTIVE(from(X:S)) -> ACTIVE(X:S) 0.00/0.13 ACTIVE(from(X:S)) -> CONS(X:S,from(s(X:S))) 0.00/0.13 ACTIVE(from(X:S)) -> FROM(active(X:S)) 0.00/0.13 ACTIVE(from(X:S)) -> FROM(s(X:S)) 0.00/0.13 ACTIVE(from(X:S)) -> S(X:S) 0.00/0.13 ACTIVE(s(X:S)) -> ACTIVE(X:S) 0.00/0.13 ACTIVE(s(X:S)) -> S(active(X:S)) 0.00/0.13 CONS(mark(X1:S),X2:S) -> CONS(X1:S,X2:S) 0.00/0.13 CONS(ok(X1:S),ok(X2:S)) -> CONS(X1:S,X2:S) 0.00/0.13 CONS1(mark(X1:S),X2:S) -> CONS1(X1:S,X2:S) 0.00/0.13 CONS1(ok(X1:S),ok(X2:S)) -> CONS1(X1:S,X2:S) 0.00/0.13 CONS1(X1:S,mark(X2:S)) -> CONS1(X1:S,X2:S) 0.00/0.13 FROM(mark(X:S)) -> FROM(X:S) 0.00/0.13 FROM(ok(X:S)) -> FROM(X:S) 0.00/0.13 PROPER(2nd(X:S)) -> 2ND(proper(X:S)) 0.00/0.13 PROPER(2nd(X:S)) -> PROPER(X:S) 0.00/0.13 PROPER(cons(X1:S,X2:S)) -> CONS(proper(X1:S),proper(X2:S)) 0.00/0.13 PROPER(cons(X1:S,X2:S)) -> PROPER(X1:S) 0.00/0.13 PROPER(cons(X1:S,X2:S)) -> PROPER(X2:S) 0.00/0.13 PROPER(cons1(X1:S,X2:S)) -> CONS1(proper(X1:S),proper(X2:S)) 0.00/0.13 PROPER(cons1(X1:S,X2:S)) -> PROPER(X1:S) 0.00/0.13 PROPER(cons1(X1:S,X2:S)) -> PROPER(X2:S) 0.00/0.13 PROPER(from(X:S)) -> FROM(proper(X:S)) 0.00/0.13 PROPER(from(X:S)) -> PROPER(X:S) 0.00/0.13 PROPER(s(X:S)) -> PROPER(X:S) 0.00/0.13 PROPER(s(X:S)) -> S(proper(X:S)) 0.00/0.13 S(mark(X:S)) -> S(X:S) 0.00/0.13 S(ok(X:S)) -> S(X:S) 0.00/0.13 TOP(mark(X:S)) -> PROPER(X:S) 0.00/0.13 TOP(mark(X:S)) -> TOP(proper(X:S)) 0.00/0.13 TOP(ok(X:S)) -> ACTIVE(X:S) 0.00/0.13 TOP(ok(X:S)) -> TOP(active(X:S)) 0.00/0.13 -> Rules: 0.00/0.13 2nd(mark(X:S)) -> mark(2nd(X:S)) 0.00/0.13 2nd(ok(X:S)) -> ok(2nd(X:S)) 0.00/0.13 active(2nd(cons(X:S,X1:S))) -> mark(2nd(cons1(X:S,X1:S))) 0.00/0.13 active(2nd(cons1(X:S,cons(Y:S,Z:S)))) -> mark(Y:S) 0.00/0.13 active(2nd(X:S)) -> 2nd(active(X:S)) 0.00/0.13 active(cons(X1:S,X2:S)) -> cons(active(X1:S),X2:S) 0.00/0.13 active(cons1(X1:S,X2:S)) -> cons1(active(X1:S),X2:S) 0.00/0.13 active(cons1(X1:S,X2:S)) -> cons1(X1:S,active(X2:S)) 0.00/0.13 active(from(X:S)) -> from(active(X:S)) 0.00/0.13 active(from(X:S)) -> mark(cons(X:S,from(s(X:S)))) 0.00/0.13 active(s(X:S)) -> s(active(X:S)) 0.00/0.13 cons(mark(X1:S),X2:S) -> mark(cons(X1:S,X2:S)) 0.00/0.13 cons(ok(X1:S),ok(X2:S)) -> ok(cons(X1:S,X2:S)) 0.00/0.13 cons1(mark(X1:S),X2:S) -> mark(cons1(X1:S,X2:S)) 0.00/0.13 cons1(ok(X1:S),ok(X2:S)) -> ok(cons1(X1:S,X2:S)) popout

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

job log

popout

actions

all output return to TRS_Innermost 2019-03-28 22.12