Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS_Innermost 2019-03-28 22.12 pair #432270761
details
property
value
status
complete
benchmark
wiehe13.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n154.star.cs.uiowa.edu
space
Mixed_innermost
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
0.424384 seconds
cpu usage
0.419264
user time
0.324658
system time
0.094606
max virtual memory
113176.0
max residence set size
9036.0
stage attributes
key
value
starexec-result
YES
output
0.00/0.42 YES 0.00/0.42 0.00/0.42 Problem 1: 0.00/0.42 0.00/0.42 (VAR v_NonEmpty:S x:S y:S z:S) 0.00/0.42 (RULES 0.00/0.42 gt(s(x:S),s(y:S)) -> gt(x:S,y:S) 0.00/0.42 gt(s(x:S),zero) -> ttrue 0.00/0.42 gt(zero,y:S) -> ffalse 0.00/0.42 id(x:S) -> x:S 0.00/0.42 if(ffalse,x:S,y:S) -> y:S 0.00/0.42 if(ttrue,x:S,y:S) -> x:S 0.00/0.42 not(x:S) -> if(x:S,ffalse,ttrue) 0.00/0.42 plus(id(x:S),s(y:S)) -> s(plus(x:S,if(gt(s(y:S),y:S),y:S,s(y:S)))) 0.00/0.42 plus(s(x:S),s(y:S)) -> s(s(plus(if(gt(x:S,y:S),x:S,y:S),if(not(gt(x:S,y:S)),id(x:S),id(y:S))))) 0.00/0.42 plus(s(x:S),x:S) -> plus(if(gt(x:S,x:S),id(x:S),id(x:S)),s(x:S)) 0.00/0.42 plus(zero,y:S) -> y:S 0.00/0.42 quot(0,s(y:S),s(z:S)) -> 0 0.00/0.42 quot(s(x:S),s(y:S),z:S) -> quot(x:S,y:S,z:S) 0.00/0.42 quot(x:S,0,s(z:S)) -> s(quot(x:S,plus(z:S,s(0)),s(z:S))) 0.00/0.42 ) 0.00/0.42 (STRATEGY INNERMOST) 0.00/0.42 0.00/0.42 Problem 1: 0.00/0.42 0.00/0.42 Dependency Pairs Processor: 0.00/0.42 -> Pairs: 0.00/0.42 GT(s(x:S),s(y:S)) -> GT(x:S,y:S) 0.00/0.42 NOT(x:S) -> IF(x:S,ffalse,ttrue) 0.00/0.42 PLUS(s(x:S),s(y:S)) -> GT(x:S,y:S) 0.00/0.42 PLUS(s(x:S),s(y:S)) -> ID(x:S) 0.00/0.42 PLUS(s(x:S),s(y:S)) -> ID(y:S) 0.00/0.42 PLUS(s(x:S),s(y:S)) -> IF(gt(x:S,y:S),x:S,y:S) 0.00/0.42 PLUS(s(x:S),s(y:S)) -> IF(not(gt(x:S,y:S)),id(x:S),id(y:S)) 0.00/0.42 PLUS(s(x:S),s(y:S)) -> NOT(gt(x:S,y:S)) 0.00/0.42 PLUS(s(x:S),s(y:S)) -> PLUS(if(gt(x:S,y:S),x:S,y:S),if(not(gt(x:S,y:S)),id(x:S),id(y:S))) 0.00/0.42 PLUS(s(x:S),x:S) -> GT(x:S,x:S) 0.00/0.42 PLUS(s(x:S),x:S) -> ID(x:S) 0.00/0.42 PLUS(s(x:S),x:S) -> IF(gt(x:S,x:S),id(x:S),id(x:S)) 0.00/0.42 PLUS(s(x:S),x:S) -> PLUS(if(gt(x:S,x:S),id(x:S),id(x:S)),s(x:S)) 0.00/0.42 QUOT(s(x:S),s(y:S),z:S) -> QUOT(x:S,y:S,z:S) 0.00/0.42 QUOT(x:S,0,s(z:S)) -> PLUS(z:S,s(0)) 0.00/0.42 QUOT(x:S,0,s(z:S)) -> QUOT(x:S,plus(z:S,s(0)),s(z:S)) 0.00/0.42 -> Rules: 0.00/0.42 gt(s(x:S),s(y:S)) -> gt(x:S,y:S) 0.00/0.42 gt(s(x:S),zero) -> ttrue 0.00/0.42 gt(zero,y:S) -> ffalse 0.00/0.42 id(x:S) -> x:S 0.00/0.42 if(ffalse,x:S,y:S) -> y:S 0.00/0.42 if(ttrue,x:S,y:S) -> x:S 0.00/0.42 not(x:S) -> if(x:S,ffalse,ttrue) 0.00/0.42 plus(id(x:S),s(y:S)) -> s(plus(x:S,if(gt(s(y:S),y:S),y:S,s(y:S)))) 0.00/0.42 plus(s(x:S),s(y:S)) -> s(s(plus(if(gt(x:S,y:S),x:S,y:S),if(not(gt(x:S,y:S)),id(x:S),id(y:S))))) 0.00/0.42 plus(s(x:S),x:S) -> plus(if(gt(x:S,x:S),id(x:S),id(x:S)),s(x:S)) 0.00/0.42 plus(zero,y:S) -> y:S 0.00/0.42 quot(0,s(y:S),s(z:S)) -> 0 0.00/0.42 quot(s(x:S),s(y:S),z:S) -> quot(x:S,y:S,z:S) 0.00/0.42 quot(x:S,0,s(z:S)) -> s(quot(x:S,plus(z:S,s(0)),s(z:S))) 0.00/0.42 0.00/0.42 Problem 1: 0.00/0.42 0.00/0.42 SCC Processor: 0.00/0.42 -> Pairs: 0.00/0.42 GT(s(x:S),s(y:S)) -> GT(x:S,y:S) 0.00/0.42 NOT(x:S) -> IF(x:S,ffalse,ttrue) 0.00/0.42 PLUS(s(x:S),s(y:S)) -> GT(x:S,y:S) 0.00/0.42 PLUS(s(x:S),s(y:S)) -> ID(x:S) 0.00/0.42 PLUS(s(x:S),s(y:S)) -> ID(y:S) 0.00/0.42 PLUS(s(x:S),s(y:S)) -> IF(gt(x:S,y:S),x:S,y:S) 0.00/0.42 PLUS(s(x:S),s(y:S)) -> IF(not(gt(x:S,y:S)),id(x:S),id(y:S)) 0.00/0.42 PLUS(s(x:S),s(y:S)) -> NOT(gt(x:S,y:S)) 0.00/0.42 PLUS(s(x:S),s(y:S)) -> PLUS(if(gt(x:S,y:S),x:S,y:S),if(not(gt(x:S,y:S)),id(x:S),id(y:S))) 0.00/0.42 PLUS(s(x:S),x:S) -> GT(x:S,x:S) 0.00/0.42 PLUS(s(x:S),x:S) -> ID(x:S) 0.00/0.42 PLUS(s(x:S),x:S) -> IF(gt(x:S,x:S),id(x:S),id(x:S)) 0.00/0.42 PLUS(s(x:S),x:S) -> PLUS(if(gt(x:S,x:S),id(x:S),id(x:S)),s(x:S)) 0.00/0.42 QUOT(s(x:S),s(y:S),z:S) -> QUOT(x:S,y:S,z:S) 0.00/0.42 QUOT(x:S,0,s(z:S)) -> PLUS(z:S,s(0)) 0.00/0.42 QUOT(x:S,0,s(z:S)) -> QUOT(x:S,plus(z:S,s(0)),s(z:S)) 0.00/0.42 -> Rules: 0.00/0.42 gt(s(x:S),s(y:S)) -> gt(x:S,y:S) 0.00/0.42 gt(s(x:S),zero) -> ttrue 0.00/0.42 gt(zero,y:S) -> ffalse 0.00/0.42 id(x:S) -> x:S 0.00/0.42 if(ffalse,x:S,y:S) -> y:S 0.00/0.42 if(ttrue,x:S,y:S) -> x:S 0.00/0.42 not(x:S) -> if(x:S,ffalse,ttrue) 0.00/0.42 plus(id(x:S),s(y:S)) -> s(plus(x:S,if(gt(s(y:S),y:S),y:S,s(y:S)))) 0.00/0.42 plus(s(x:S),s(y:S)) -> s(s(plus(if(gt(x:S,y:S),x:S,y:S),if(not(gt(x:S,y:S)),id(x:S),id(y:S))))) 0.00/0.42 plus(s(x:S),x:S) -> plus(if(gt(x:S,x:S),id(x:S),id(x:S)),s(x:S)) 0.00/0.42 plus(zero,y:S) -> y:S 0.00/0.42 quot(0,s(y:S),s(z:S)) -> 0 0.00/0.42 quot(s(x:S),s(y:S),z:S) -> quot(x:S,y:S,z:S) 0.00/0.42 quot(x:S,0,s(z:S)) -> s(quot(x:S,plus(z:S,s(0)),s(z:S))) 0.00/0.42 ->Strongly Connected Components: 0.00/0.42 ->->Cycle: 0.00/0.42 ->->-> Pairs: 0.00/0.42 GT(s(x:S),s(y:S)) -> GT(x:S,y:S) 0.00/0.42 ->->-> Rules: 0.00/0.42 gt(s(x:S),s(y:S)) -> gt(x:S,y:S)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS_Innermost 2019-03-28 22.12
