details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.0204579 seconds
cpu usage	0.020761
user time	0.00885
system time	0.011911
max virtual memory	113188.0
max residence set size	5300.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S x:S y:S) (RULES f(0) -> ttrue f(1) -> ffalse f(s(x:S)) -> f(x:S) g(x:S,c(y:S)) -> g(x:S,if(f(x:S),c(g(s(x:S),y:S)),c(y:S))) g(x:S,c(y:S)) -> c(g(x:S,y:S)) if(ffalse,s(x:S),s(y:S)) -> s(y:S) if(ttrue,s(x:S),s(y:S)) -> s(x:S) ) Problem 1: Dependency Pairs Processor: -> Pairs: F(s(x:S)) -> F(x:S) G(x:S,c(y:S)) -> F(x:S) G(x:S,c(y:S)) -> G(s(x:S),y:S) G(x:S,c(y:S)) -> G(x:S,if(f(x:S),c(g(s(x:S),y:S)),c(y:S))) G(x:S,c(y:S)) -> G(x:S,y:S) G(x:S,c(y:S)) -> IF(f(x:S),c(g(s(x:S),y:S)),c(y:S)) -> Rules: f(0) -> ttrue f(1) -> ffalse f(s(x:S)) -> f(x:S) g(x:S,c(y:S)) -> g(x:S,if(f(x:S),c(g(s(x:S),y:S)),c(y:S))) g(x:S,c(y:S)) -> c(g(x:S,y:S)) if(ffalse,s(x:S),s(y:S)) -> s(y:S) if(ttrue,s(x:S),s(y:S)) -> s(x:S) Problem 1: SCC Processor: -> Pairs: F(s(x:S)) -> F(x:S) G(x:S,c(y:S)) -> F(x:S) G(x:S,c(y:S)) -> G(s(x:S),y:S) G(x:S,c(y:S)) -> G(x:S,if(f(x:S),c(g(s(x:S),y:S)),c(y:S))) G(x:S,c(y:S)) -> G(x:S,y:S) G(x:S,c(y:S)) -> IF(f(x:S),c(g(s(x:S),y:S)),c(y:S)) -> Rules: f(0) -> ttrue f(1) -> ffalse f(s(x:S)) -> f(x:S) g(x:S,c(y:S)) -> g(x:S,if(f(x:S),c(g(s(x:S),y:S)),c(y:S))) g(x:S,c(y:S)) -> c(g(x:S,y:S)) if(ffalse,s(x:S),s(y:S)) -> s(y:S) if(ttrue,s(x:S),s(y:S)) -> s(x:S) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: F(s(x:S)) -> F(x:S) ->->-> Rules: f(0) -> ttrue f(1) -> ffalse f(s(x:S)) -> f(x:S) g(x:S,c(y:S)) -> g(x:S,if(f(x:S),c(g(s(x:S),y:S)),c(y:S))) g(x:S,c(y:S)) -> c(g(x:S,y:S)) if(ffalse,s(x:S),s(y:S)) -> s(y:S) if(ttrue,s(x:S),s(y:S)) -> s(x:S) ->->Cycle: ->->-> Pairs: G(x:S,c(y:S)) -> G(s(x:S),y:S) G(x:S,c(y:S)) -> G(x:S,y:S) ->->-> Rules: f(0) -> ttrue f(1) -> ffalse f(s(x:S)) -> f(x:S) g(x:S,c(y:S)) -> g(x:S,if(f(x:S),c(g(s(x:S),y:S)),c(y:S))) g(x:S,c(y:S)) -> c(g(x:S,y:S)) if(ffalse,s(x:S),s(y:S)) -> s(y:S) if(ttrue,s(x:S),s(y:S)) -> s(x:S) The problem is decomposed in 2 subproblems. Problem 1.1: Subterm Processor: -> Pairs: F(s(x:S)) -> F(x:S) -> Rules: f(0) -> ttrue f(1) -> ffalse f(s(x:S)) -> f(x:S) g(x:S,c(y:S)) -> g(x:S,if(f(x:S),c(g(s(x:S),y:S)),c(y:S))) g(x:S,c(y:S)) -> c(g(x:S,y:S)) if(ffalse,s(x:S),s(y:S)) -> s(y:S) if(ttrue,s(x:S),s(y:S)) -> s(x:S) ->Projection: pi(F) = 1 Problem 1.1: SCC Processor: -> Pairs: popout

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

job log

popout

actions

all output return to TRS Standard