details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	4.12176084518 seconds
cpu usage	3.991186209
max memory	4.161536E7

stage attributes

key	value
output-size	36604
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 v_NonEmpty:S X:S X1:S X2:S X3:S Y:S) (RULES active(f(X:S)) -> mark(if(X:S,c,f(ttrue))) active(if(ffalse,X:S,Y:S)) -> mark(Y:S) active(if(ttrue,X:S,Y:S)) -> mark(X:S) f(active(X:S)) -> f(X:S) f(mark(X:S)) -> f(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(f(X:S)) -> active(f(mark(X:S))) mark(if(X1:S,X2:S,X3:S)) -> active(if(mark(X1:S),mark(X2:S),X3:S)) mark(c) -> active(c) mark(ffalse) -> active(ffalse) mark(ttrue) -> active(ttrue) ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVE(f(X:S)) -> IF(X:S,c,f(ttrue)) ACTIVE(f(X:S)) -> MARK(if(X:S,c,f(ttrue))) ACTIVE(if(ffalse,X:S,Y:S)) -> MARK(Y:S) ACTIVE(if(ttrue,X:S,Y:S)) -> MARK(X:S) F(active(X:S)) -> F(X:S) F(mark(X:S)) -> F(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(f(X:S)) -> ACTIVE(f(mark(X:S))) MARK(f(X:S)) -> F(mark(X:S)) MARK(f(X:S)) -> MARK(X:S) MARK(if(X1:S,X2:S,X3:S)) -> ACTIVE(if(mark(X1:S),mark(X2:S),X3:S)) MARK(if(X1:S,X2:S,X3:S)) -> IF(mark(X1:S),mark(X2:S),X3:S) MARK(if(X1:S,X2:S,X3:S)) -> MARK(X1:S) MARK(if(X1:S,X2:S,X3:S)) -> MARK(X2:S) -> Rules: active(f(X:S)) -> mark(if(X:S,c,f(ttrue))) active(if(ffalse,X:S,Y:S)) -> mark(Y:S) active(if(ttrue,X:S,Y:S)) -> mark(X:S) f(active(X:S)) -> f(X:S) f(mark(X:S)) -> f(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(f(X:S)) -> active(f(mark(X:S))) mark(if(X1:S,X2:S,X3:S)) -> active(if(mark(X1:S),mark(X2:S),X3:S)) mark(c) -> active(c) mark(ffalse) -> active(ffalse) mark(ttrue) -> active(ttrue) Problem 1: SCC Processor: -> Pairs: ACTIVE(f(X:S)) -> IF(X:S,c,f(ttrue)) ACTIVE(f(X:S)) -> MARK(if(X:S,c,f(ttrue))) ACTIVE(if(ffalse,X:S,Y:S)) -> MARK(Y:S) ACTIVE(if(ttrue,X:S,Y:S)) -> MARK(X:S) F(active(X:S)) -> F(X:S) F(mark(X:S)) -> F(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(f(X:S)) -> ACTIVE(f(mark(X:S))) MARK(f(X:S)) -> F(mark(X:S)) MARK(f(X:S)) -> MARK(X:S) MARK(if(X1:S,X2:S,X3:S)) -> ACTIVE(if(mark(X1:S),mark(X2:S),X3:S)) MARK(if(X1:S,X2:S,X3:S)) -> IF(mark(X1:S),mark(X2:S),X3:S) MARK(if(X1:S,X2:S,X3:S)) -> MARK(X1:S) MARK(if(X1:S,X2:S,X3:S)) -> MARK(X2:S) -> Rules: active(f(X:S)) -> mark(if(X:S,c,f(ttrue))) active(if(ffalse,X:S,Y:S)) -> mark(Y:S) active(if(ttrue,X:S,Y:S)) -> mark(X:S) f(active(X:S)) -> f(X:S) popout

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

job log

popout

actions

all output return to TRS Innermost