details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.168314218521 seconds
cpu usage	0.169327462
max memory	6242304.0

stage attributes

key	value
output-size	20873
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 Problem 1: (VAR X X1 X2 X3 Y Z) (RULES a__add(0,X) -> mark(X) a__add(s(X),Y) -> s(add(X,Y)) a__add(X1,X2) -> add(X1,X2) a__and(false,Y) -> false a__and(true,X) -> mark(X) a__and(X1,X2) -> and(X1,X2) a__first(0,X) -> nil a__first(s(X),cons(Y,Z)) -> cons(Y,first(X,Z)) a__first(X1,X2) -> first(X1,X2) a__from(X) -> cons(X,from(s(X))) a__from(X) -> from(X) a__if(false,X,Y) -> mark(Y) a__if(true,X,Y) -> mark(X) a__if(X1,X2,X3) -> if(X1,X2,X3) mark(0) -> 0 mark(add(X1,X2)) -> a__add(mark(X1),X2) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(cons(X1,X2)) -> cons(X1,X2) mark(false) -> false mark(first(X1,X2)) -> a__first(mark(X1),mark(X2)) mark(from(X)) -> a__from(X) mark(if(X1,X2,X3)) -> a__if(mark(X1),X2,X3) mark(nil) -> nil mark(s(X)) -> s(X) mark(true) -> true ) Problem 1: Dependency Pairs Processor: -> Pairs: A__ADD(0,X) -> MARK(X) A__AND(true,X) -> MARK(X) A__IF(false,X,Y) -> MARK(Y) A__IF(true,X,Y) -> MARK(X) MARK(add(X1,X2)) -> A__ADD(mark(X1),X2) MARK(add(X1,X2)) -> MARK(X1) MARK(and(X1,X2)) -> A__AND(mark(X1),X2) MARK(and(X1,X2)) -> MARK(X1) MARK(first(X1,X2)) -> A__FIRST(mark(X1),mark(X2)) MARK(first(X1,X2)) -> MARK(X1) MARK(first(X1,X2)) -> MARK(X2) MARK(from(X)) -> A__FROM(X) MARK(if(X1,X2,X3)) -> A__IF(mark(X1),X2,X3) MARK(if(X1,X2,X3)) -> MARK(X1) -> Rules: a__add(0,X) -> mark(X) a__add(s(X),Y) -> s(add(X,Y)) a__add(X1,X2) -> add(X1,X2) a__and(false,Y) -> false a__and(true,X) -> mark(X) a__and(X1,X2) -> and(X1,X2) a__first(0,X) -> nil a__first(s(X),cons(Y,Z)) -> cons(Y,first(X,Z)) a__first(X1,X2) -> first(X1,X2) a__from(X) -> cons(X,from(s(X))) a__from(X) -> from(X) a__if(false,X,Y) -> mark(Y) a__if(true,X,Y) -> mark(X) a__if(X1,X2,X3) -> if(X1,X2,X3) mark(0) -> 0 mark(add(X1,X2)) -> a__add(mark(X1),X2) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(cons(X1,X2)) -> cons(X1,X2) mark(false) -> false mark(first(X1,X2)) -> a__first(mark(X1),mark(X2)) mark(from(X)) -> a__from(X) mark(if(X1,X2,X3)) -> a__if(mark(X1),X2,X3) mark(nil) -> nil mark(s(X)) -> s(X) mark(true) -> true Problem 1: SCC Processor: -> Pairs: A__ADD(0,X) -> MARK(X) A__AND(true,X) -> MARK(X) A__IF(false,X,Y) -> MARK(Y) A__IF(true,X,Y) -> MARK(X) MARK(add(X1,X2)) -> A__ADD(mark(X1),X2) MARK(add(X1,X2)) -> MARK(X1) MARK(and(X1,X2)) -> A__AND(mark(X1),X2) MARK(and(X1,X2)) -> MARK(X1) MARK(first(X1,X2)) -> A__FIRST(mark(X1),mark(X2)) MARK(first(X1,X2)) -> MARK(X1) MARK(first(X1,X2)) -> MARK(X2) MARK(from(X)) -> A__FROM(X) popout

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

job log

popout

actions

all output return to TRS Stand 20472