Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS_Innermost 2019-03-28 22.12 pair #432271397
details
property
value
status
complete
benchmark
#4.27.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n120.star.cs.uiowa.edu
space
AG01_innermost
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
0.0633749 seconds
cpu usage
0.057131
user time
0.028091
system time
0.02904
max virtual memory
113176.0
max residence set size
5384.0
stage attributes
key
value
starexec-result
YES
output
0.00/0.06 YES 0.00/0.06 0.00/0.06 Problem 1: 0.00/0.06 0.00/0.06 (VAR v_NonEmpty:S x:S y:S) 0.00/0.06 (RULES 0.00/0.06 if(ffalse,x:S,y:S) -> y:S 0.00/0.06 if(ttrue,x:S,y:S) -> x:S 0.00/0.06 le(0,y:S) -> ttrue 0.00/0.06 le(s(x:S),0) -> ffalse 0.00/0.06 le(s(x:S),s(y:S)) -> le(x:S,y:S) 0.00/0.06 minus(x:S,0) -> x:S 0.00/0.06 minus(x:S,s(y:S)) -> if(le(x:S,s(y:S)),0,p(minus(x:S,p(s(y:S))))) 0.00/0.06 p(0) -> 0 0.00/0.06 p(s(x:S)) -> x:S 0.00/0.06 ) 0.00/0.06 (STRATEGY INNERMOST) 0.00/0.06 0.00/0.06 Problem 1: 0.00/0.06 0.00/0.06 Dependency Pairs Processor: 0.00/0.06 -> Pairs: 0.00/0.06 LE(s(x:S),s(y:S)) -> LE(x:S,y:S) 0.00/0.06 MINUS(x:S,s(y:S)) -> IF(le(x:S,s(y:S)),0,p(minus(x:S,p(s(y:S))))) 0.00/0.06 MINUS(x:S,s(y:S)) -> LE(x:S,s(y:S)) 0.00/0.06 MINUS(x:S,s(y:S)) -> MINUS(x:S,p(s(y:S))) 0.00/0.06 MINUS(x:S,s(y:S)) -> P(minus(x:S,p(s(y:S)))) 0.00/0.06 MINUS(x:S,s(y:S)) -> P(s(y:S)) 0.00/0.06 -> Rules: 0.00/0.06 if(ffalse,x:S,y:S) -> y:S 0.00/0.06 if(ttrue,x:S,y:S) -> x:S 0.00/0.06 le(0,y:S) -> ttrue 0.00/0.06 le(s(x:S),0) -> ffalse 0.00/0.06 le(s(x:S),s(y:S)) -> le(x:S,y:S) 0.00/0.06 minus(x:S,0) -> x:S 0.00/0.06 minus(x:S,s(y:S)) -> if(le(x:S,s(y:S)),0,p(minus(x:S,p(s(y:S))))) 0.00/0.06 p(0) -> 0 0.00/0.06 p(s(x:S)) -> x:S 0.00/0.06 0.00/0.06 Problem 1: 0.00/0.06 0.00/0.06 SCC Processor: 0.00/0.06 -> Pairs: 0.00/0.06 LE(s(x:S),s(y:S)) -> LE(x:S,y:S) 0.00/0.06 MINUS(x:S,s(y:S)) -> IF(le(x:S,s(y:S)),0,p(minus(x:S,p(s(y:S))))) 0.00/0.06 MINUS(x:S,s(y:S)) -> LE(x:S,s(y:S)) 0.00/0.06 MINUS(x:S,s(y:S)) -> MINUS(x:S,p(s(y:S))) 0.00/0.06 MINUS(x:S,s(y:S)) -> P(minus(x:S,p(s(y:S)))) 0.00/0.06 MINUS(x:S,s(y:S)) -> P(s(y:S)) 0.00/0.06 -> Rules: 0.00/0.06 if(ffalse,x:S,y:S) -> y:S 0.00/0.06 if(ttrue,x:S,y:S) -> x:S 0.00/0.06 le(0,y:S) -> ttrue 0.00/0.06 le(s(x:S),0) -> ffalse 0.00/0.06 le(s(x:S),s(y:S)) -> le(x:S,y:S) 0.00/0.06 minus(x:S,0) -> x:S 0.00/0.06 minus(x:S,s(y:S)) -> if(le(x:S,s(y:S)),0,p(minus(x:S,p(s(y:S))))) 0.00/0.06 p(0) -> 0 0.00/0.06 p(s(x:S)) -> x:S 0.00/0.06 ->Strongly Connected Components: 0.00/0.06 ->->Cycle: 0.00/0.06 ->->-> Pairs: 0.00/0.06 LE(s(x:S),s(y:S)) -> LE(x:S,y:S) 0.00/0.06 ->->-> Rules: 0.00/0.06 if(ffalse,x:S,y:S) -> y:S 0.00/0.06 if(ttrue,x:S,y:S) -> x:S 0.00/0.06 le(0,y:S) -> ttrue 0.00/0.06 le(s(x:S),0) -> ffalse 0.00/0.06 le(s(x:S),s(y:S)) -> le(x:S,y:S) 0.00/0.06 minus(x:S,0) -> x:S 0.00/0.06 minus(x:S,s(y:S)) -> if(le(x:S,s(y:S)),0,p(minus(x:S,p(s(y:S))))) 0.00/0.06 p(0) -> 0 0.00/0.06 p(s(x:S)) -> x:S 0.00/0.06 ->->Cycle: 0.00/0.06 ->->-> Pairs: 0.00/0.06 MINUS(x:S,s(y:S)) -> MINUS(x:S,p(s(y:S))) 0.00/0.06 ->->-> Rules: 0.00/0.06 if(ffalse,x:S,y:S) -> y:S 0.00/0.06 if(ttrue,x:S,y:S) -> x:S 0.00/0.06 le(0,y:S) -> ttrue 0.00/0.06 le(s(x:S),0) -> ffalse 0.00/0.06 le(s(x:S),s(y:S)) -> le(x:S,y:S) 0.00/0.06 minus(x:S,0) -> x:S 0.00/0.06 minus(x:S,s(y:S)) -> if(le(x:S,s(y:S)),0,p(minus(x:S,p(s(y:S))))) 0.00/0.06 p(0) -> 0 0.00/0.06 p(s(x:S)) -> x:S 0.00/0.06 0.00/0.06 0.00/0.06 The problem is decomposed in 2 subproblems. 0.00/0.06 0.00/0.06 Problem 1.1: 0.00/0.06 0.00/0.06 Subterm Processor: 0.00/0.06 -> Pairs: 0.00/0.06 LE(s(x:S),s(y:S)) -> LE(x:S,y:S) 0.00/0.06 -> Rules: 0.00/0.06 if(ffalse,x:S,y:S) -> y:S 0.00/0.06 if(ttrue,x:S,y:S) -> x:S 0.00/0.06 le(0,y:S) -> ttrue 0.00/0.06 le(s(x:S),0) -> ffalse
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