Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS_Conditional 2019-03-28 22.59 pair #432272596
details
property
value
status
complete
benchmark
272.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n039.star.cs.uiowa.edu
space
COPS
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
0.021887 seconds
cpu usage
0.022394
user time
0.011224
system time
0.01117
max virtual memory
113176.0
max residence set size
7120.0
stage attributes
key
value
starexec-result
YES
output
0.00/0.01 YES 0.00/0.01 0.00/0.01 Problem 1: 0.00/0.01 0.00/0.01 (VAR v_NonEmpty:S l:S m:S n:S) 0.00/0.01 (RULES 0.00/0.01 insert(cons(n:S,l:S),m:S) -> cons(m:S,cons(n:S,l:S)) | lte(m:S,n:S) ->* ttrue 0.00/0.01 insert(cons(n:S,l:S),m:S) -> cons(n:S,insert(l:S,m:S)) | lte(m:S,n:S) ->* ffalse 0.00/0.01 insert(nil,m:S) -> cons(m:S,nil) 0.00/0.01 lte(0,n:S) -> ttrue 0.00/0.01 lte(s(m:S),0) -> ffalse 0.00/0.01 lte(s(m:S),s(n:S)) -> lte(m:S,n:S) 0.00/0.01 ordered(cons(m:S,cons(n:S,l:S))) -> ordered(cons(n:S,l:S)) | lte(m:S,n:S) ->* ttrue 0.00/0.01 ordered(cons(m:S,cons(n:S,l:S))) -> ffalse | lte(m:S,n:S) ->* ffalse 0.00/0.01 ordered(cons(m:S,nil)) -> ttrue 0.00/0.01 ordered(nil) -> ttrue 0.00/0.01 ) 0.00/0.01 0.00/0.01 Problem 1: 0.00/0.01 Valid CTRS Processor: 0.00/0.01 -> Rules: 0.00/0.01 insert(cons(n:S,l:S),m:S) -> cons(m:S,cons(n:S,l:S)) | lte(m:S,n:S) ->* ttrue 0.00/0.01 insert(cons(n:S,l:S),m:S) -> cons(n:S,insert(l:S,m:S)) | lte(m:S,n:S) ->* ffalse 0.00/0.01 insert(nil,m:S) -> cons(m:S,nil) 0.00/0.01 lte(0,n:S) -> ttrue 0.00/0.01 lte(s(m:S),0) -> ffalse 0.00/0.01 lte(s(m:S),s(n:S)) -> lte(m:S,n:S) 0.00/0.01 ordered(cons(m:S,cons(n:S,l:S))) -> ordered(cons(n:S,l:S)) | lte(m:S,n:S) ->* ttrue 0.00/0.01 ordered(cons(m:S,cons(n:S,l:S))) -> ffalse | lte(m:S,n:S) ->* ffalse 0.00/0.01 ordered(cons(m:S,nil)) -> ttrue 0.00/0.01 ordered(nil) -> ttrue 0.00/0.01 -> The system is a deterministic 3-CTRS. 0.00/0.01 0.00/0.01 Problem 1: 0.00/0.01 0.00/0.01 Dependency Pairs Processor: 0.00/0.01 0.00/0.01 Conditional Termination Problem 1: 0.00/0.01 -> Pairs: 0.00/0.01 INSERT(cons(n:S,l:S),m:S) -> INSERT(l:S,m:S) | lte(m:S,n:S) ->* ffalse 0.00/0.01 LTE(s(m:S),s(n:S)) -> LTE(m:S,n:S) 0.00/0.01 ORDERED(cons(m:S,cons(n:S,l:S))) -> ORDERED(cons(n:S,l:S)) | lte(m:S,n:S) ->* ttrue 0.00/0.01 -> QPairs: 0.00/0.01 Empty 0.00/0.01 -> Rules: 0.00/0.01 insert(cons(n:S,l:S),m:S) -> cons(m:S,cons(n:S,l:S)) | lte(m:S,n:S) ->* ttrue 0.00/0.01 insert(cons(n:S,l:S),m:S) -> cons(n:S,insert(l:S,m:S)) | lte(m:S,n:S) ->* ffalse 0.00/0.01 insert(nil,m:S) -> cons(m:S,nil) 0.00/0.01 lte(0,n:S) -> ttrue 0.00/0.01 lte(s(m:S),0) -> ffalse 0.00/0.01 lte(s(m:S),s(n:S)) -> lte(m:S,n:S) 0.00/0.01 ordered(cons(m:S,cons(n:S,l:S))) -> ordered(cons(n:S,l:S)) | lte(m:S,n:S) ->* ttrue 0.00/0.01 ordered(cons(m:S,cons(n:S,l:S))) -> ffalse | lte(m:S,n:S) ->* ffalse 0.00/0.01 ordered(cons(m:S,nil)) -> ttrue 0.00/0.01 ordered(nil) -> ttrue 0.00/0.01 0.00/0.01 Conditional Termination Problem 2: 0.00/0.01 -> Pairs: 0.00/0.01 INSERT(cons(n:S,l:S),m:S) -> LTE(m:S,n:S) 0.00/0.01 ORDERED(cons(m:S,cons(n:S,l:S))) -> LTE(m:S,n:S) 0.00/0.01 -> QPairs: 0.00/0.02 LTE(s(m:S),s(n:S)) -> LTE(m:S,n:S) 0.00/0.02 -> Rules: 0.00/0.02 insert(cons(n:S,l:S),m:S) -> cons(m:S,cons(n:S,l:S)) | lte(m:S,n:S) ->* ttrue 0.00/0.02 insert(cons(n:S,l:S),m:S) -> cons(n:S,insert(l:S,m:S)) | lte(m:S,n:S) ->* ffalse 0.00/0.02 insert(nil,m:S) -> cons(m:S,nil) 0.00/0.02 lte(0,n:S) -> ttrue 0.00/0.02 lte(s(m:S),0) -> ffalse 0.00/0.02 lte(s(m:S),s(n:S)) -> lte(m:S,n:S) 0.00/0.02 ordered(cons(m:S,cons(n:S,l:S))) -> ordered(cons(n:S,l:S)) | lte(m:S,n:S) ->* ttrue 0.00/0.02 ordered(cons(m:S,cons(n:S,l:S))) -> ffalse | lte(m:S,n:S) ->* ffalse 0.00/0.02 ordered(cons(m:S,nil)) -> ttrue 0.00/0.02 ordered(nil) -> ttrue 0.00/0.02 0.00/0.02 0.00/0.02 The problem is decomposed in 2 subproblems. 0.00/0.02 0.00/0.02 Problem 1.1: 0.00/0.02 0.00/0.02 SCC Processor: 0.00/0.02 -> Pairs: 0.00/0.02 INSERT(cons(n:S,l:S),m:S) -> INSERT(l:S,m:S) | lte(m:S,n:S) ->* ffalse 0.00/0.02 LTE(s(m:S),s(n:S)) -> LTE(m:S,n:S) 0.00/0.02 ORDERED(cons(m:S,cons(n:S,l:S))) -> ORDERED(cons(n:S,l:S)) | lte(m:S,n:S) ->* ttrue 0.00/0.02 -> QPairs: 0.00/0.02 Empty 0.00/0.02 -> Rules: 0.00/0.02 insert(cons(n:S,l:S),m:S) -> cons(m:S,cons(n:S,l:S)) | lte(m:S,n:S) ->* ttrue 0.00/0.02 insert(cons(n:S,l:S),m:S) -> cons(n:S,insert(l:S,m:S)) | lte(m:S,n:S) ->* ffalse 0.00/0.02 insert(nil,m:S) -> cons(m:S,nil) 0.00/0.02 lte(0,n:S) -> ttrue 0.00/0.02 lte(s(m:S),0) -> ffalse 0.00/0.02 lte(s(m:S),s(n:S)) -> lte(m:S,n:S) 0.00/0.02 ordered(cons(m:S,cons(n:S,l:S))) -> ordered(cons(n:S,l:S)) | lte(m:S,n:S) ->* ttrue 0.00/0.02 ordered(cons(m:S,cons(n:S,l:S))) -> ffalse | lte(m:S,n:S) ->* ffalse 0.00/0.02 ordered(cons(m:S,nil)) -> ttrue 0.00/0.02 ordered(nil) -> ttrue 0.00/0.02 ->Strongly Connected Components: 0.00/0.02 ->->Cycle: 0.00/0.02 ->->-> Pairs:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS_Conditional 2019-03-28 22.59
