Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS_Standard 2019-03-29 03.29 pair #432292192
details
property
value
status
complete
benchmark
z078.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n017.star.cs.uiowa.edu
space
Zantema_04
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
0.114442 seconds
cpu usage
0.081539
user time
0.03116
system time
0.050379
max virtual memory
113176.0
max residence set size
5548.0
stage attributes
key
value
starexec-result
YES
output
0.00/0.11 YES 0.00/0.11 0.00/0.11 Problem 1: 0.00/0.11 0.00/0.11 (VAR v_NonEmpty:S x1:S) 0.00/0.11 (RULES 0.00/0.11 d(0(x1:S)) -> 0(x1:S) 0.00/0.11 d(s(x1:S)) -> s(s(d(p(s(x1:S))))) 0.00/0.11 f(0(x1:S)) -> s(0(x1:S)) 0.00/0.11 f(s(x1:S)) -> d(f(p(s(x1:S)))) 0.00/0.11 p(s(x1:S)) -> x1:S 0.00/0.11 ) 0.00/0.11 0.00/0.11 Problem 1: 0.00/0.11 0.00/0.11 Innermost Equivalent Processor: 0.00/0.11 -> Rules: 0.00/0.11 d(0(x1:S)) -> 0(x1:S) 0.00/0.11 d(s(x1:S)) -> s(s(d(p(s(x1:S))))) 0.00/0.11 f(0(x1:S)) -> s(0(x1:S)) 0.00/0.11 f(s(x1:S)) -> d(f(p(s(x1:S)))) 0.00/0.11 p(s(x1:S)) -> x1:S 0.00/0.11 -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. 0.00/0.11 0.00/0.11 0.00/0.11 Problem 1: 0.00/0.11 0.00/0.11 Dependency Pairs Processor: 0.00/0.11 -> Pairs: 0.00/0.11 D(s(x1:S)) -> D(p(s(x1:S))) 0.00/0.11 D(s(x1:S)) -> P(s(x1:S)) 0.00/0.11 F(s(x1:S)) -> D(f(p(s(x1:S)))) 0.00/0.11 F(s(x1:S)) -> F(p(s(x1:S))) 0.00/0.11 F(s(x1:S)) -> P(s(x1:S)) 0.00/0.11 -> Rules: 0.00/0.11 d(0(x1:S)) -> 0(x1:S) 0.00/0.11 d(s(x1:S)) -> s(s(d(p(s(x1:S))))) 0.00/0.11 f(0(x1:S)) -> s(0(x1:S)) 0.00/0.11 f(s(x1:S)) -> d(f(p(s(x1:S)))) 0.00/0.11 p(s(x1:S)) -> x1:S 0.00/0.11 0.00/0.11 Problem 1: 0.00/0.11 0.00/0.11 SCC Processor: 0.00/0.11 -> Pairs: 0.00/0.11 D(s(x1:S)) -> D(p(s(x1:S))) 0.00/0.11 D(s(x1:S)) -> P(s(x1:S)) 0.00/0.11 F(s(x1:S)) -> D(f(p(s(x1:S)))) 0.00/0.11 F(s(x1:S)) -> F(p(s(x1:S))) 0.00/0.11 F(s(x1:S)) -> P(s(x1:S)) 0.00/0.11 -> Rules: 0.00/0.11 d(0(x1:S)) -> 0(x1:S) 0.00/0.11 d(s(x1:S)) -> s(s(d(p(s(x1:S))))) 0.00/0.11 f(0(x1:S)) -> s(0(x1:S)) 0.00/0.11 f(s(x1:S)) -> d(f(p(s(x1:S)))) 0.00/0.11 p(s(x1:S)) -> x1:S 0.00/0.11 ->Strongly Connected Components: 0.00/0.11 ->->Cycle: 0.00/0.11 ->->-> Pairs: 0.00/0.11 D(s(x1:S)) -> D(p(s(x1:S))) 0.00/0.11 ->->-> Rules: 0.00/0.11 d(0(x1:S)) -> 0(x1:S) 0.00/0.11 d(s(x1:S)) -> s(s(d(p(s(x1:S))))) 0.00/0.11 f(0(x1:S)) -> s(0(x1:S)) 0.00/0.11 f(s(x1:S)) -> d(f(p(s(x1:S)))) 0.00/0.11 p(s(x1:S)) -> x1:S 0.00/0.11 ->->Cycle: 0.00/0.11 ->->-> Pairs: 0.00/0.11 F(s(x1:S)) -> F(p(s(x1:S))) 0.00/0.11 ->->-> Rules: 0.00/0.11 d(0(x1:S)) -> 0(x1:S) 0.00/0.11 d(s(x1:S)) -> s(s(d(p(s(x1:S))))) 0.00/0.11 f(0(x1:S)) -> s(0(x1:S)) 0.00/0.11 f(s(x1:S)) -> d(f(p(s(x1:S)))) 0.00/0.11 p(s(x1:S)) -> x1:S 0.00/0.11 0.00/0.11 0.00/0.11 The problem is decomposed in 2 subproblems. 0.00/0.11 0.00/0.11 Problem 1.1: 0.00/0.11 0.00/0.11 Reduction Pairs Processor: 0.00/0.11 -> Pairs: 0.00/0.11 D(s(x1:S)) -> D(p(s(x1:S))) 0.00/0.11 -> Rules: 0.00/0.11 d(0(x1:S)) -> 0(x1:S) 0.00/0.11 d(s(x1:S)) -> s(s(d(p(s(x1:S))))) 0.00/0.11 f(0(x1:S)) -> s(0(x1:S)) 0.00/0.11 f(s(x1:S)) -> d(f(p(s(x1:S)))) 0.00/0.11 p(s(x1:S)) -> x1:S 0.00/0.11 -> Usable rules: 0.00/0.11 p(s(x1:S)) -> x1:S 0.00/0.11 ->Interpretation type: 0.00/0.11 Linear 0.00/0.11 ->Coefficients: 0.00/0.11 All rationals 0.00/0.11 ->Dimension: 0.00/0.11 1 0.00/0.11 ->Bound: 0.00/0.11 2
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS_Standard 2019-03-29 03.29