details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.619881868362 seconds
cpu usage	0.628554145
max memory	1.1239424E7

stage attributes

key	value
output-size	145273
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR X X1 X2 X3 Y Z) (RULES active(add(s(X),Y)) -> mark(s(add(X,Y))) active(add(0,X)) -> mark(X) active(and(false,Y)) -> mark(false) active(and(true,X)) -> mark(X) active(first(s(X),cons(Y,Z))) -> mark(cons(Y,first(X,Z))) active(first(0,X)) -> mark(nil) active(from(X)) -> mark(cons(X,from(s(X)))) active(if(false,X,Y)) -> mark(Y) active(if(true,X,Y)) -> mark(X) add(active(X1),X2) -> add(X1,X2) add(mark(X1),X2) -> add(X1,X2) add(X1,active(X2)) -> add(X1,X2) add(X1,mark(X2)) -> add(X1,X2) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) cons(active(X1),X2) -> cons(X1,X2) cons(mark(X1),X2) -> cons(X1,X2) cons(X1,active(X2)) -> cons(X1,X2) cons(X1,mark(X2)) -> cons(X1,X2) first(active(X1),X2) -> first(X1,X2) first(mark(X1),X2) -> first(X1,X2) first(X1,active(X2)) -> first(X1,X2) first(X1,mark(X2)) -> first(X1,X2) from(active(X)) -> from(X) from(mark(X)) -> from(X) if(active(X1),X2,X3) -> if(X1,X2,X3) if(mark(X1),X2,X3) -> if(X1,X2,X3) if(X1,active(X2),X3) -> if(X1,X2,X3) if(X1,mark(X2),X3) -> if(X1,X2,X3) if(X1,X2,active(X3)) -> if(X1,X2,X3) if(X1,X2,mark(X3)) -> if(X1,X2,X3) mark(add(X1,X2)) -> active(add(mark(X1),X2)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(cons(X1,X2)) -> active(cons(X1,X2)) mark(first(X1,X2)) -> active(first(mark(X1),mark(X2))) mark(from(X)) -> active(from(X)) mark(if(X1,X2,X3)) -> active(if(mark(X1),X2,X3)) mark(s(X)) -> active(s(X)) mark(0) -> active(0) mark(false) -> active(false) mark(nil) -> active(nil) mark(true) -> active(true) s(active(X)) -> s(X) s(mark(X)) -> s(X) ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVE(add(s(X),Y)) -> ADD(X,Y) ACTIVE(add(s(X),Y)) -> MARK(s(add(X,Y))) ACTIVE(add(s(X),Y)) -> S(add(X,Y)) ACTIVE(add(0,X)) -> MARK(X) ACTIVE(and(false,Y)) -> MARK(false) ACTIVE(and(true,X)) -> MARK(X) ACTIVE(first(s(X),cons(Y,Z))) -> CONS(Y,first(X,Z)) ACTIVE(first(s(X),cons(Y,Z))) -> FIRST(X,Z) ACTIVE(first(s(X),cons(Y,Z))) -> MARK(cons(Y,first(X,Z))) ACTIVE(first(0,X)) -> MARK(nil) ACTIVE(from(X)) -> CONS(X,from(s(X))) ACTIVE(from(X)) -> FROM(s(X)) ACTIVE(from(X)) -> MARK(cons(X,from(s(X)))) ACTIVE(from(X)) -> S(X) ACTIVE(if(false,X,Y)) -> MARK(Y) ACTIVE(if(true,X,Y)) -> MARK(X) ADD(active(X1),X2) -> ADD(X1,X2) ADD(mark(X1),X2) -> ADD(X1,X2) ADD(X1,active(X2)) -> ADD(X1,X2) ADD(X1,mark(X2)) -> ADD(X1,X2) AND(active(X1),X2) -> AND(X1,X2) AND(mark(X1),X2) -> AND(X1,X2) AND(X1,active(X2)) -> AND(X1,X2) AND(X1,mark(X2)) -> AND(X1,X2) CONS(active(X1),X2) -> CONS(X1,X2) CONS(mark(X1),X2) -> CONS(X1,X2) CONS(X1,active(X2)) -> CONS(X1,X2) CONS(X1,mark(X2)) -> CONS(X1,X2) FIRST(active(X1),X2) -> FIRST(X1,X2) FIRST(mark(X1),X2) -> FIRST(X1,X2) FIRST(X1,active(X2)) -> FIRST(X1,X2) FIRST(X1,mark(X2)) -> FIRST(X1,X2) FROM(active(X)) -> FROM(X) FROM(mark(X)) -> FROM(X) IF(active(X1),X2,X3) -> IF(X1,X2,X3) popout

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

job log

popout

actions

all output return to TRS Inner 89993