details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	1.48861 seconds
cpu usage	1.3126
user time	1.08296
system time	0.229643
max virtual memory	711552.0
max residence set size	8332.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S X:S X1:S X2:S X3:S Y:S) (RULES a__f(X:S) -> a__if(mark(X:S),c,f(ttrue)) a__f(X:S) -> f(X:S) a__if(ffalse,X:S,Y:S) -> mark(Y:S) a__if(ttrue,X:S,Y:S) -> mark(X:S) a__if(X1:S,X2:S,X3:S) -> if(X1:S,X2:S,X3:S) mark(c) -> c mark(f(X:S)) -> a__f(mark(X:S)) mark(ffalse) -> ffalse mark(if(X1:S,X2:S,X3:S)) -> a__if(mark(X1:S),mark(X2:S),X3:S) mark(ttrue) -> ttrue ) Problem 1: Dependency Pairs Processor: -> Pairs: A__F(X:S) -> A__IF(mark(X:S),c,f(ttrue)) A__F(X:S) -> MARK(X:S) A__IF(ffalse,X:S,Y:S) -> MARK(Y:S) A__IF(ttrue,X:S,Y:S) -> MARK(X:S) MARK(f(X:S)) -> A__F(mark(X:S)) MARK(f(X:S)) -> MARK(X:S) MARK(if(X1:S,X2:S,X3:S)) -> A__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: a__f(X:S) -> a__if(mark(X:S),c,f(ttrue)) a__f(X:S) -> f(X:S) a__if(ffalse,X:S,Y:S) -> mark(Y:S) a__if(ttrue,X:S,Y:S) -> mark(X:S) a__if(X1:S,X2:S,X3:S) -> if(X1:S,X2:S,X3:S) mark(c) -> c mark(f(X:S)) -> a__f(mark(X:S)) mark(ffalse) -> ffalse mark(if(X1:S,X2:S,X3:S)) -> a__if(mark(X1:S),mark(X2:S),X3:S) mark(ttrue) -> ttrue Problem 1: SCC Processor: -> Pairs: A__F(X:S) -> A__IF(mark(X:S),c,f(ttrue)) A__F(X:S) -> MARK(X:S) A__IF(ffalse,X:S,Y:S) -> MARK(Y:S) A__IF(ttrue,X:S,Y:S) -> MARK(X:S) MARK(f(X:S)) -> A__F(mark(X:S)) MARK(f(X:S)) -> MARK(X:S) MARK(if(X1:S,X2:S,X3:S)) -> A__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: a__f(X:S) -> a__if(mark(X:S),c,f(ttrue)) a__f(X:S) -> f(X:S) a__if(ffalse,X:S,Y:S) -> mark(Y:S) a__if(ttrue,X:S,Y:S) -> mark(X:S) a__if(X1:S,X2:S,X3:S) -> if(X1:S,X2:S,X3:S) mark(c) -> c mark(f(X:S)) -> a__f(mark(X:S)) mark(ffalse) -> ffalse mark(if(X1:S,X2:S,X3:S)) -> a__if(mark(X1:S),mark(X2:S),X3:S) mark(ttrue) -> ttrue ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A__F(X:S) -> A__IF(mark(X:S),c,f(ttrue)) A__F(X:S) -> MARK(X:S) A__IF(ffalse,X:S,Y:S) -> MARK(Y:S) A__IF(ttrue,X:S,Y:S) -> MARK(X:S) MARK(f(X:S)) -> A__F(mark(X:S)) MARK(f(X:S)) -> MARK(X:S) MARK(if(X1:S,X2:S,X3:S)) -> A__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: a__f(X:S) -> a__if(mark(X:S),c,f(ttrue)) a__f(X:S) -> f(X:S) a__if(ffalse,X:S,Y:S) -> mark(Y:S) a__if(ttrue,X:S,Y:S) -> mark(X:S) a__if(X1:S,X2:S,X3:S) -> if(X1:S,X2:S,X3:S) mark(c) -> c mark(f(X:S)) -> a__f(mark(X:S)) mark(ffalse) -> ffalse mark(if(X1:S,X2:S,X3:S)) -> a__if(mark(X1:S),mark(X2:S),X3:S) mark(ttrue) -> ttrue Problem 1: Reduction Pair Processor: -> Pairs: A__F(X:S) -> A__IF(mark(X:S),c,f(ttrue)) A__F(X:S) -> MARK(X:S) A__IF(ffalse,X:S,Y:S) -> MARK(Y:S) A__IF(ttrue,X:S,Y:S) -> MARK(X:S) MARK(f(X:S)) -> A__F(mark(X:S)) popout

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

job log

popout

actions

all output return to TRS Standard