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	n059.star.cs.uiowa.edu
space	Transformed_CSR_04

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.675065040588 seconds
cpu usage	0.63328927
max memory	1.3725696E7

stage attributes

key	value
output-size	174912
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 v_NonEmpty:S X:S X1:S X2:S X3:S Y:S Z:S) (RULES active(add(s(X:S),Y:S)) -> mark(s(add(X:S,Y:S))) active(add(0,X:S)) -> mark(X:S) active(and(ffalse,Y:S)) -> mark(ffalse) active(and(ttrue,X:S)) -> mark(X:S) active(first(s(X:S),cons(Y:S,Z:S))) -> mark(cons(Y:S,first(X:S,Z:S))) active(first(0,X:S)) -> mark(nil) active(from(X:S)) -> mark(cons(X:S,from(s(X:S)))) active(if(ffalse,X:S,Y:S)) -> mark(Y:S) active(if(ttrue,X:S,Y:S)) -> mark(X:S) add(active(X1:S),X2:S) -> add(X1:S,X2:S) add(mark(X1:S),X2:S) -> add(X1:S,X2:S) add(X1:S,active(X2:S)) -> add(X1:S,X2:S) add(X1:S,mark(X2:S)) -> add(X1:S,X2:S) and(active(X1:S),X2:S) -> and(X1:S,X2:S) and(mark(X1:S),X2:S) -> and(X1:S,X2:S) and(X1:S,active(X2:S)) -> and(X1:S,X2:S) and(X1:S,mark(X2:S)) -> and(X1:S,X2:S) cons(active(X1:S),X2:S) -> cons(X1:S,X2:S) cons(mark(X1:S),X2:S) -> cons(X1:S,X2:S) cons(X1:S,active(X2:S)) -> cons(X1:S,X2:S) cons(X1:S,mark(X2:S)) -> cons(X1:S,X2:S) first(active(X1:S),X2:S) -> first(X1:S,X2:S) first(mark(X1:S),X2:S) -> first(X1:S,X2:S) first(X1:S,active(X2:S)) -> first(X1:S,X2:S) first(X1:S,mark(X2:S)) -> first(X1:S,X2:S) from(active(X:S)) -> from(X:S) from(mark(X:S)) -> from(X:S) if(active(X1:S),X2:S,X3:S) -> if(X1:S,X2:S,X3:S) if(mark(X1:S),X2:S,X3:S) -> if(X1:S,X2:S,X3:S) if(X1:S,active(X2:S),X3:S) -> if(X1:S,X2:S,X3:S) if(X1:S,mark(X2:S),X3:S) -> if(X1:S,X2:S,X3:S) if(X1:S,X2:S,active(X3:S)) -> if(X1:S,X2:S,X3:S) if(X1:S,X2:S,mark(X3:S)) -> if(X1:S,X2:S,X3:S) mark(add(X1:S,X2:S)) -> active(add(mark(X1:S),X2:S)) mark(and(X1:S,X2:S)) -> active(and(mark(X1:S),X2:S)) mark(cons(X1:S,X2:S)) -> active(cons(X1:S,X2:S)) mark(first(X1:S,X2:S)) -> active(first(mark(X1:S),mark(X2:S))) mark(from(X:S)) -> active(from(X:S)) mark(if(X1:S,X2:S,X3:S)) -> active(if(mark(X1:S),X2:S,X3:S)) mark(s(X:S)) -> active(s(X:S)) mark(0) -> active(0) mark(ffalse) -> active(ffalse) mark(nil) -> active(nil) mark(ttrue) -> active(ttrue) s(active(X:S)) -> s(X:S) s(mark(X:S)) -> s(X:S) ) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVE(add(s(X:S),Y:S)) -> ADD(X:S,Y:S) ACTIVE(add(s(X:S),Y:S)) -> MARK(s(add(X:S,Y:S))) ACTIVE(add(s(X:S),Y:S)) -> S(add(X:S,Y:S)) ACTIVE(add(0,X:S)) -> MARK(X:S) ACTIVE(and(ffalse,Y:S)) -> MARK(ffalse) ACTIVE(and(ttrue,X:S)) -> MARK(X:S) ACTIVE(first(s(X:S),cons(Y:S,Z:S))) -> CONS(Y:S,first(X:S,Z:S)) ACTIVE(first(s(X:S),cons(Y:S,Z:S))) -> FIRST(X:S,Z:S) ACTIVE(first(s(X:S),cons(Y:S,Z:S))) -> MARK(cons(Y:S,first(X:S,Z:S))) ACTIVE(first(0,X:S)) -> MARK(nil) ACTIVE(from(X:S)) -> CONS(X:S,from(s(X:S))) ACTIVE(from(X:S)) -> FROM(s(X:S)) ACTIVE(from(X:S)) -> MARK(cons(X:S,from(s(X:S)))) ACTIVE(from(X:S)) -> S(X:S) ACTIVE(if(ffalse,X:S,Y:S)) -> MARK(Y:S) ACTIVE(if(ttrue,X:S,Y:S)) -> MARK(X:S) ADD(active(X1:S),X2:S) -> ADD(X1:S,X2:S) ADD(mark(X1:S),X2:S) -> ADD(X1:S,X2:S) ADD(X1:S,active(X2:S)) -> ADD(X1:S,X2:S) ADD(X1:S,mark(X2:S)) -> ADD(X1:S,X2:S) AND(active(X1:S),X2:S) -> AND(X1:S,X2:S) AND(mark(X1:S),X2:S) -> AND(X1:S,X2:S) AND(X1:S,active(X2:S)) -> AND(X1:S,X2:S) AND(X1:S,mark(X2:S)) -> AND(X1:S,X2:S) CONS(active(X1:S),X2:S) -> CONS(X1:S,X2:S) CONS(mark(X1:S),X2:S) -> CONS(X1:S,X2:S) CONS(X1:S,active(X2:S)) -> CONS(X1:S,X2:S) CONS(X1:S,mark(X2:S)) -> CONS(X1:S,X2:S) FIRST(active(X1:S),X2:S) -> FIRST(X1:S,X2:S) FIRST(mark(X1:S),X2:S) -> FIRST(X1:S,X2:S) FIRST(X1:S,active(X2:S)) -> FIRST(X1:S,X2:S) FIRST(X1:S,mark(X2:S)) -> FIRST(X1:S,X2:S) FROM(active(X:S)) -> FROM(X:S) FROM(mark(X:S)) -> FROM(X:S) IF(active(X1:S),X2:S,X3:S) -> IF(X1:S,X2:S,X3:S) IF(mark(X1:S),X2:S,X3:S) -> IF(X1:S,X2:S,X3:S) popout

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

job log

popout

actions

all output return to TRS Standard