details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	289.411168814 seconds
cpu usage	288.444383406
max memory	2.8123136E8

stage attributes

key	value
output-size	64130
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 y:S z:S) (RULES div(div(x:S,y:S),z:S) -> div(x:S,times(zero(y:S),z:S)) div(0,y:S) -> 0 div(x:S,y:S) -> quot(x:S,y:S,y:S) divides(y:S,x:S) -> eq(x:S,times(div(x:S,y:S),y:S)) eq(0,0) -> ttrue eq(0,s(y:S)) -> ffalse eq(s(x:S),0) -> ffalse eq(s(x:S),s(y:S)) -> eq(x:S,y:S) if(ffalse,x:S,y:S) -> pr(x:S,y:S) if(ttrue,x:S,y:S) -> ffalse p(0) -> 0 p(s(x:S)) -> x:S plus(0,y:S) -> y:S plus(s(x:S),y:S) -> s(plus(p(s(x:S)),y:S)) plus(s(x:S),y:S) -> s(plus(x:S,y:S)) plus(x:S,0) -> x:S plus(x:S,s(y:S)) -> s(plus(x:S,p(s(y:S)))) pr(x:S,s(0)) -> ttrue pr(x:S,s(s(y:S))) -> if(divides(s(s(y:S)),x:S),x:S,s(y:S)) prime(s(s(x:S))) -> pr(s(s(x:S)),s(x:S)) quot(zero(y:S),s(y:S),z:S) -> 0 quot(s(x:S),s(y:S),z:S) -> quot(x:S,y:S,z:S) quot(x:S,0,s(z:S)) -> s(div(x:S,s(z:S))) times(0,y:S) -> 0 times(s(0),y:S) -> y:S times(s(x:S),y:S) -> plus(y:S,times(x:S,y:S)) zero(div(x:S,x:S)) -> x:S zero(divides(x:S,x:S)) -> x:S zero(quot(x:S,x:S,x:S)) -> x:S zero(times(x:S,x:S)) -> x:S zero(s(x:S)) -> if(eq(x:S,s(0)),plus(zero(0),0),s(plus(0,zero(0)))) ) Problem 1: Dependency Pairs Processor: -> Pairs: DIV(div(x:S,y:S),z:S) -> DIV(x:S,times(zero(y:S),z:S)) DIV(div(x:S,y:S),z:S) -> TIMES(zero(y:S),z:S) DIV(div(x:S,y:S),z:S) -> ZERO(y:S) DIV(x:S,y:S) -> QUOT(x:S,y:S,y:S) DIVIDES(y:S,x:S) -> DIV(x:S,y:S) DIVIDES(y:S,x:S) -> EQ(x:S,times(div(x:S,y:S),y:S)) DIVIDES(y:S,x:S) -> TIMES(div(x:S,y:S),y:S) EQ(s(x:S),s(y:S)) -> EQ(x:S,y:S) IF(ffalse,x:S,y:S) -> PR(x:S,y:S) PLUS(s(x:S),y:S) -> P(s(x:S)) PLUS(s(x:S),y:S) -> PLUS(p(s(x:S)),y:S) PLUS(s(x:S),y:S) -> PLUS(x:S,y:S) PLUS(x:S,s(y:S)) -> P(s(y:S)) PLUS(x:S,s(y:S)) -> PLUS(x:S,p(s(y:S))) PR(x:S,s(s(y:S))) -> DIVIDES(s(s(y:S)),x:S) PR(x:S,s(s(y:S))) -> IF(divides(s(s(y:S)),x:S),x:S,s(y:S)) PRIME(s(s(x:S))) -> PR(s(s(x:S)),s(x:S)) QUOT(s(x:S),s(y:S),z:S) -> QUOT(x:S,y:S,z:S) QUOT(x:S,0,s(z:S)) -> DIV(x:S,s(z:S)) TIMES(s(x:S),y:S) -> PLUS(y:S,times(x:S,y:S)) TIMES(s(x:S),y:S) -> TIMES(x:S,y:S) ZERO(s(x:S)) -> EQ(x:S,s(0)) ZERO(s(x:S)) -> IF(eq(x:S,s(0)),plus(zero(0),0),s(plus(0,zero(0)))) ZERO(s(x:S)) -> PLUS(zero(0),0) ZERO(s(x:S)) -> PLUS(0,zero(0)) -> Rules: div(div(x:S,y:S),z:S) -> div(x:S,times(zero(y:S),z:S)) div(0,y:S) -> 0 div(x:S,y:S) -> quot(x:S,y:S,y:S) divides(y:S,x:S) -> eq(x:S,times(div(x:S,y:S),y:S)) eq(0,0) -> ttrue eq(0,s(y:S)) -> ffalse eq(s(x:S),0) -> ffalse eq(s(x:S),s(y:S)) -> eq(x:S,y:S) if(ffalse,x:S,y:S) -> pr(x:S,y:S) if(ttrue,x:S,y:S) -> ffalse p(0) -> 0 p(s(x:S)) -> x:S plus(0,y:S) -> y:S plus(s(x:S),y:S) -> s(plus(p(s(x:S)),y:S)) plus(s(x:S),y:S) -> s(plus(x:S,y:S)) plus(x:S,0) -> x:S plus(x:S,s(y:S)) -> s(plus(x:S,p(s(y:S)))) pr(x:S,s(0)) -> ttrue pr(x:S,s(s(y:S))) -> if(divides(s(s(y:S)),x:S),x:S,s(y:S)) prime(s(s(x:S))) -> pr(s(s(x:S)),s(x:S)) quot(zero(y:S),s(y:S),z:S) -> 0 quot(s(x:S),s(y:S),z:S) -> quot(x:S,y:S,z:S) quot(x:S,0,s(z:S)) -> s(div(x:S,s(z:S))) times(0,y:S) -> 0 times(s(0),y:S) -> y:S popout

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

job log

popout

actions

all output return to TRS Standard