details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.496616 seconds
cpu usage	0.208504
user time	0.169237
system time	0.039267
max virtual memory	113176.0
max residence set size	11792.0

stage attributes

key	value
starexec-result	YES

output

0.00/0.49 YES 0.00/0.49 0.00/0.49 Problem 1: 0.00/0.49 0.00/0.49 (VAR v_NonEmpty:S X:S X1:S X2:S X3:S Y:S Z:S) 0.00/0.49 (RULES 0.00/0.49 active(add(s(X:S),Y:S)) -> mark(s(add(X:S,Y:S))) 0.00/0.49 active(add(0,X:S)) -> mark(X:S) 0.00/0.49 active(add(X1:S,X2:S)) -> add(active(X1:S),X2:S) 0.00/0.49 active(and(ffalse,Y:S)) -> mark(ffalse) 0.00/0.49 active(and(ttrue,X:S)) -> mark(X:S) 0.00/0.49 active(and(X1:S,X2:S)) -> and(active(X1:S),X2:S) 0.00/0.49 active(first(s(X:S),cons(Y:S,Z:S))) -> mark(cons(Y:S,first(X:S,Z:S))) 0.00/0.49 active(first(0,X:S)) -> mark(nil) 0.00/0.49 active(first(X1:S,X2:S)) -> first(active(X1:S),X2:S) 0.00/0.49 active(first(X1:S,X2:S)) -> first(X1:S,active(X2:S)) 0.00/0.49 active(from(X:S)) -> mark(cons(X:S,from(s(X:S)))) 0.00/0.49 active(if(ffalse,X:S,Y:S)) -> mark(Y:S) 0.00/0.49 active(if(ttrue,X:S,Y:S)) -> mark(X:S) 0.00/0.49 active(if(X1:S,X2:S,X3:S)) -> if(active(X1:S),X2:S,X3:S) 0.00/0.49 add(mark(X1:S),X2:S) -> mark(add(X1:S,X2:S)) 0.00/0.49 add(ok(X1:S),ok(X2:S)) -> ok(add(X1:S,X2:S)) 0.00/0.49 and(mark(X1:S),X2:S) -> mark(and(X1:S,X2:S)) 0.00/0.49 and(ok(X1:S),ok(X2:S)) -> ok(and(X1:S,X2:S)) 0.00/0.49 cons(ok(X1:S),ok(X2:S)) -> ok(cons(X1:S,X2:S)) 0.00/0.49 first(mark(X1:S),X2:S) -> mark(first(X1:S,X2:S)) 0.00/0.49 first(ok(X1:S),ok(X2:S)) -> ok(first(X1:S,X2:S)) 0.00/0.49 first(X1:S,mark(X2:S)) -> mark(first(X1:S,X2:S)) 0.00/0.49 from(ok(X:S)) -> ok(from(X:S)) 0.00/0.49 if(mark(X1:S),X2:S,X3:S) -> mark(if(X1:S,X2:S,X3:S)) 0.00/0.49 if(ok(X1:S),ok(X2:S),ok(X3:S)) -> ok(if(X1:S,X2:S,X3:S)) 0.00/0.49 proper(add(X1:S,X2:S)) -> add(proper(X1:S),proper(X2:S)) 0.00/0.49 proper(and(X1:S,X2:S)) -> and(proper(X1:S),proper(X2:S)) 0.00/0.49 proper(cons(X1:S,X2:S)) -> cons(proper(X1:S),proper(X2:S)) 0.00/0.49 proper(first(X1:S,X2:S)) -> first(proper(X1:S),proper(X2:S)) 0.00/0.49 proper(from(X:S)) -> from(proper(X:S)) 0.00/0.49 proper(if(X1:S,X2:S,X3:S)) -> if(proper(X1:S),proper(X2:S),proper(X3:S)) 0.00/0.49 proper(s(X:S)) -> s(proper(X:S)) 0.00/0.49 proper(0) -> ok(0) 0.00/0.49 proper(ffalse) -> ok(ffalse) 0.00/0.49 proper(nil) -> ok(nil) 0.00/0.49 proper(ttrue) -> ok(ttrue) 0.00/0.49 s(ok(X:S)) -> ok(s(X:S)) 0.00/0.49 top(mark(X:S)) -> top(proper(X:S)) 0.00/0.49 top(ok(X:S)) -> top(active(X:S)) 0.00/0.49 ) 0.00/0.49 (STRATEGY INNERMOST) 0.00/0.49 0.00/0.49 Problem 1: 0.00/0.49 0.00/0.49 Dependency Pairs Processor: 0.00/0.49 -> Pairs: 0.00/0.49 ACTIVE(add(s(X:S),Y:S)) -> ADD(X:S,Y:S) 0.00/0.49 ACTIVE(add(s(X:S),Y:S)) -> S(add(X:S,Y:S)) 0.00/0.49 ACTIVE(add(X1:S,X2:S)) -> ACTIVE(X1:S) 0.00/0.49 ACTIVE(add(X1:S,X2:S)) -> ADD(active(X1:S),X2:S) 0.00/0.49 ACTIVE(and(X1:S,X2:S)) -> ACTIVE(X1:S) 0.00/0.49 ACTIVE(and(X1:S,X2:S)) -> AND(active(X1:S),X2:S) 0.00/0.49 ACTIVE(first(s(X:S),cons(Y:S,Z:S))) -> CONS(Y:S,first(X:S,Z:S)) 0.00/0.49 ACTIVE(first(s(X:S),cons(Y:S,Z:S))) -> FIRST(X:S,Z:S) 0.00/0.49 ACTIVE(first(X1:S,X2:S)) -> ACTIVE(X1:S) 0.00/0.49 ACTIVE(first(X1:S,X2:S)) -> ACTIVE(X2:S) 0.00/0.49 ACTIVE(first(X1:S,X2:S)) -> FIRST(active(X1:S),X2:S) 0.00/0.49 ACTIVE(first(X1:S,X2:S)) -> FIRST(X1:S,active(X2:S)) 0.00/0.49 ACTIVE(from(X:S)) -> CONS(X:S,from(s(X:S))) 0.00/0.49 ACTIVE(from(X:S)) -> FROM(s(X:S)) 0.00/0.49 ACTIVE(from(X:S)) -> S(X:S) 0.00/0.49 ACTIVE(if(X1:S,X2:S,X3:S)) -> ACTIVE(X1:S) 0.00/0.49 ACTIVE(if(X1:S,X2:S,X3:S)) -> IF(active(X1:S),X2:S,X3:S) 0.00/0.49 ADD(mark(X1:S),X2:S) -> ADD(X1:S,X2:S) 0.00/0.49 ADD(ok(X1:S),ok(X2:S)) -> ADD(X1:S,X2:S) 0.00/0.49 AND(mark(X1:S),X2:S) -> AND(X1:S,X2:S) 0.00/0.49 AND(ok(X1:S),ok(X2:S)) -> AND(X1:S,X2:S) 0.00/0.49 CONS(ok(X1:S),ok(X2:S)) -> CONS(X1:S,X2:S) 0.00/0.49 FIRST(mark(X1:S),X2:S) -> FIRST(X1:S,X2:S) 0.00/0.49 FIRST(ok(X1:S),ok(X2:S)) -> FIRST(X1:S,X2:S) 0.00/0.49 FIRST(X1:S,mark(X2:S)) -> FIRST(X1:S,X2:S) 0.00/0.49 FROM(ok(X:S)) -> FROM(X:S) 0.00/0.49 IF(mark(X1:S),X2:S,X3:S) -> IF(X1:S,X2:S,X3:S) 0.00/0.49 IF(ok(X1:S),ok(X2:S),ok(X3:S)) -> IF(X1:S,X2:S,X3:S) 0.00/0.49 PROPER(add(X1:S,X2:S)) -> ADD(proper(X1:S),proper(X2:S)) 0.00/0.49 PROPER(add(X1:S,X2:S)) -> PROPER(X1:S) 0.00/0.49 PROPER(add(X1:S,X2:S)) -> PROPER(X2:S) 0.00/0.49 PROPER(and(X1:S,X2:S)) -> AND(proper(X1:S),proper(X2:S)) 0.00/0.49 PROPER(and(X1:S,X2:S)) -> PROPER(X1:S) 0.00/0.49 PROPER(and(X1:S,X2:S)) -> PROPER(X2:S) 0.00/0.49 PROPER(cons(X1:S,X2:S)) -> CONS(proper(X1:S),proper(X2:S)) 0.00/0.49 PROPER(cons(X1:S,X2:S)) -> PROPER(X1:S) 0.00/0.49 PROPER(cons(X1:S,X2:S)) -> PROPER(X2:S) 0.00/0.49 PROPER(first(X1:S,X2:S)) -> FIRST(proper(X1:S),proper(X2:S)) 0.00/0.49 PROPER(first(X1:S,X2:S)) -> PROPER(X1:S) 0.00/0.49 PROPER(first(X1:S,X2:S)) -> PROPER(X2:S) 0.00/0.49 PROPER(from(X:S)) -> FROM(proper(X:S)) 0.00/0.49 PROPER(from(X:S)) -> PROPER(X:S) 0.00/0.49 PROPER(if(X1:S,X2:S,X3:S)) -> IF(proper(X1:S),proper(X2:S),proper(X3:S)) 0.00/0.49 PROPER(if(X1:S,X2:S,X3:S)) -> PROPER(X1:S) 0.00/0.49 PROPER(if(X1:S,X2:S,X3:S)) -> PROPER(X2:S) 0.00/0.49 PROPER(if(X1:S,X2:S,X3:S)) -> PROPER(X3:S) 0.00/0.49 PROPER(s(X:S)) -> PROPER(X:S) 0.00/0.49 PROPER(s(X:S)) -> S(proper(X: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