Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Innermost pair #487093122
details
property
value
status
complete
benchmark
Ex49_GM04_GM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n145.star.cs.uiowa.edu
space
Transformed_CSR_innermost_04
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
0.163162 seconds
cpu usage
0.168988
user time
0.135617
system time
0.033371
max virtual memory
113188.0
max residence set size
9176.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__div(0,s(Y:S)) -> 0 a__div(s(X:S),s(Y:S)) -> a__if(a__geq(X:S,Y:S),s(div(minus(X:S,Y:S),s(Y:S))),0) a__div(X1:S,X2:S) -> div(X1:S,X2:S) a__geq(0,s(Y:S)) -> ffalse a__geq(s(X:S),s(Y:S)) -> a__geq(X:S,Y:S) a__geq(X:S,0) -> ttrue a__geq(X1:S,X2:S) -> geq(X1:S,X2: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) a__minus(0,Y:S) -> 0 a__minus(s(X:S),s(Y:S)) -> a__minus(X:S,Y:S) a__minus(X1:S,X2:S) -> minus(X1:S,X2:S) mark(0) -> 0 mark(div(X1:S,X2:S)) -> a__div(mark(X1:S),X2:S) mark(ffalse) -> ffalse mark(geq(X1:S,X2:S)) -> a__geq(X1:S,X2:S) mark(if(X1:S,X2:S,X3:S)) -> a__if(mark(X1:S),X2:S,X3:S) mark(minus(X1:S,X2:S)) -> a__minus(X1:S,X2:S) mark(s(X:S)) -> s(mark(X:S)) mark(ttrue) -> ttrue ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: A__DIV(s(X:S),s(Y:S)) -> A__GEQ(X:S,Y:S) A__DIV(s(X:S),s(Y:S)) -> A__IF(a__geq(X:S,Y:S),s(div(minus(X:S,Y:S),s(Y:S))),0) A__GEQ(s(X:S),s(Y:S)) -> A__GEQ(X:S,Y:S) A__IF(ffalse,X:S,Y:S) -> MARK(Y:S) A__IF(ttrue,X:S,Y:S) -> MARK(X:S) A__MINUS(s(X:S),s(Y:S)) -> A__MINUS(X:S,Y:S) MARK(div(X1:S,X2:S)) -> A__DIV(mark(X1:S),X2:S) MARK(div(X1:S,X2:S)) -> MARK(X1:S) MARK(geq(X1:S,X2:S)) -> A__GEQ(X1:S,X2:S) MARK(if(X1:S,X2:S,X3:S)) -> A__IF(mark(X1:S),X2:S,X3:S) MARK(if(X1:S,X2:S,X3:S)) -> MARK(X1:S) MARK(minus(X1:S,X2:S)) -> A__MINUS(X1:S,X2:S) MARK(s(X:S)) -> MARK(X:S) -> Rules: a__div(0,s(Y:S)) -> 0 a__div(s(X:S),s(Y:S)) -> a__if(a__geq(X:S,Y:S),s(div(minus(X:S,Y:S),s(Y:S))),0) a__div(X1:S,X2:S) -> div(X1:S,X2:S) a__geq(0,s(Y:S)) -> ffalse a__geq(s(X:S),s(Y:S)) -> a__geq(X:S,Y:S) a__geq(X:S,0) -> ttrue a__geq(X1:S,X2:S) -> geq(X1:S,X2: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) a__minus(0,Y:S) -> 0 a__minus(s(X:S),s(Y:S)) -> a__minus(X:S,Y:S) a__minus(X1:S,X2:S) -> minus(X1:S,X2:S) mark(0) -> 0 mark(div(X1:S,X2:S)) -> a__div(mark(X1:S),X2:S) mark(ffalse) -> ffalse mark(geq(X1:S,X2:S)) -> a__geq(X1:S,X2:S) mark(if(X1:S,X2:S,X3:S)) -> a__if(mark(X1:S),X2:S,X3:S) mark(minus(X1:S,X2:S)) -> a__minus(X1:S,X2:S) mark(s(X:S)) -> s(mark(X:S)) mark(ttrue) -> ttrue Problem 1: SCC Processor: -> Pairs: A__DIV(s(X:S),s(Y:S)) -> A__GEQ(X:S,Y:S) A__DIV(s(X:S),s(Y:S)) -> A__IF(a__geq(X:S,Y:S),s(div(minus(X:S,Y:S),s(Y:S))),0) A__GEQ(s(X:S),s(Y:S)) -> A__GEQ(X:S,Y:S) A__IF(ffalse,X:S,Y:S) -> MARK(Y:S) A__IF(ttrue,X:S,Y:S) -> MARK(X:S) A__MINUS(s(X:S),s(Y:S)) -> A__MINUS(X:S,Y:S) MARK(div(X1:S,X2:S)) -> A__DIV(mark(X1:S),X2:S) MARK(div(X1:S,X2:S)) -> MARK(X1:S) MARK(geq(X1:S,X2:S)) -> A__GEQ(X1:S,X2:S) MARK(if(X1:S,X2:S,X3:S)) -> A__IF(mark(X1:S),X2:S,X3:S) MARK(if(X1:S,X2:S,X3:S)) -> MARK(X1:S) MARK(minus(X1:S,X2:S)) -> A__MINUS(X1:S,X2:S) MARK(s(X:S)) -> MARK(X:S) -> Rules: a__div(0,s(Y:S)) -> 0 a__div(s(X:S),s(Y:S)) -> a__if(a__geq(X:S,Y:S),s(div(minus(X:S,Y:S),s(Y:S))),0) a__div(X1:S,X2:S) -> div(X1:S,X2:S) a__geq(0,s(Y:S)) -> ffalse a__geq(s(X:S),s(Y:S)) -> a__geq(X:S,Y:S) a__geq(X:S,0) -> ttrue a__geq(X1:S,X2:S) -> geq(X1:S,X2: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) a__minus(0,Y:S) -> 0 a__minus(s(X:S),s(Y:S)) -> a__minus(X:S,Y:S)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Innermost