Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS_Innermost 2019-03-28 22.12 pair #432271110
details
property
value
status
complete
benchmark
Ex18_Luc06_iGM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n081.star.cs.uiowa.edu
space
Transformed_CSR_innermost_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.68824 seconds
cpu usage
3.47653
user time
3.32398
system time
0.152554
max virtual memory
1.8277356E7
max residence set size
243236.0
stage attributes
key
value
starexec-result
YES
output
3.27/1.63 YES 3.27/1.64 proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml 3.27/1.64 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 3.27/1.64 3.27/1.64 3.27/1.64 Termination w.r.t. Q of the given QTRS could be proven: 3.27/1.64 3.27/1.64 (0) QTRS 3.27/1.64 (1) RFCMatchBoundsTRSProof [EQUIVALENT, 0 ms] 3.27/1.64 (2) YES 3.27/1.64 3.27/1.64 3.27/1.64 ---------------------------------------- 3.27/1.64 3.27/1.64 (0) 3.27/1.64 Obligation: 3.27/1.64 Q restricted rewrite system: 3.27/1.64 The TRS R consists of the following rules: 3.27/1.64 3.27/1.64 active(f(f(a))) -> mark(f(g(f(a)))) 3.27/1.64 mark(f(X)) -> active(f(mark(X))) 3.27/1.64 mark(a) -> active(a) 3.27/1.64 mark(g(X)) -> active(g(X)) 3.27/1.64 f(mark(X)) -> f(X) 3.27/1.64 f(active(X)) -> f(X) 3.27/1.64 g(mark(X)) -> g(X) 3.27/1.64 g(active(X)) -> g(X) 3.27/1.64 3.27/1.64 The set Q consists of the following terms: 3.27/1.64 3.27/1.64 active(f(f(a))) 3.27/1.64 mark(f(x0)) 3.27/1.64 mark(a) 3.27/1.64 mark(g(x0)) 3.27/1.64 f(mark(x0)) 3.27/1.64 f(active(x0)) 3.27/1.64 g(mark(x0)) 3.27/1.64 g(active(x0)) 3.27/1.64 3.27/1.64 3.27/1.64 ---------------------------------------- 3.27/1.64 3.27/1.64 (1) RFCMatchBoundsTRSProof (EQUIVALENT) 3.27/1.64 Termination of the TRS R could be shown with a Match Bound [MATCHBOUNDS1,MATCHBOUNDS2] of 4. This implies Q-termination of R. 3.27/1.64 The following rules were used to construct the certificate: 3.27/1.64 3.27/1.64 active(f(f(a))) -> mark(f(g(f(a)))) 3.27/1.64 mark(f(X)) -> active(f(mark(X))) 3.27/1.64 mark(a) -> active(a) 3.27/1.64 mark(g(X)) -> active(g(X)) 3.27/1.64 f(mark(X)) -> f(X) 3.27/1.64 f(active(X)) -> f(X) 3.27/1.64 g(mark(X)) -> g(X) 3.27/1.64 g(active(X)) -> g(X) 3.27/1.64 3.27/1.64 The certificate found is represented by the following graph. 3.27/1.64 The certificate consists of the following enumerated nodes: 3.27/1.64 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27 3.27/1.64 3.27/1.64 Node 1 is start node and node 2 is final node. 3.27/1.64 3.27/1.64 Those nodes are connected through the following edges: 3.27/1.64 3.27/1.64 * 1 to 3 labelled mark_1(0)* 1 to 7 labelled active_1(0)* 1 to 6 labelled active_1(0)* 1 to 2 labelled f_1(0), g_1(0), f_1(1), g_1(1)* 1 to 9 labelled active_1(1)* 1 to 14 labelled mark_1(1)* 1 to 18 labelled active_1(2)* 2 to 2 labelled #_1(0)* 3 to 4 labelled f_1(0)* 4 to 5 labelled g_1(0)* 5 to 6 labelled f_1(0)* 6 to 2 labelled a(0)* 7 to 8 labelled f_1(0)* 7 to 2 labelled g_1(0), g_1(1), f_1(1)* 7 to 11 labelled f_1(1)* 7 to 7 labelled f_1(1)* 7 to 14 labelled f_1(1)* 7 to 18 labelled f_1(1)* 7 to 20 labelled f_1(1)* 7 to 24 labelled f_1(1)* 8 to 2 labelled mark_1(0)* 8 to 11 labelled active_1(1)* 8 to 7 labelled active_1(1)* 8 to 14 labelled mark_1(1)* 8 to 18 labelled active_1(2)* 8 to 20 labelled mark_1(2)* 8 to 24 labelled active_1(3)* 9 to 10 labelled f_1(1)* 9 to 4 labelled f_1(2)* 9 to 13 labelled f_1(2)* 10 to 4 labelled mark_1(1)* 10 to 13 labelled active_1(1)* 11 to 12 labelled f_1(1)* 11 to 2 labelled a(1), f_1(2), f_1(1)* 11 to 11 labelled f_1(2)* 11 to 7 labelled f_1(2)* 11 to 14 labelled f_1(2)* 11 to 20 labelled f_1(2)* 11 to 18 labelled f_1(2)* 11 to 24 labelled f_1(2)* 12 to 2 labelled mark_1(1)* 12 to 11 labelled active_1(1)* 12 to 7 labelled active_1(1)* 12 to 14 labelled mark_1(1)* 12 to 20 labelled mark_1(2)* 12 to 18 labelled active_1(2)* 12 to 24 labelled active_1(3)* 13 to 5 labelled g_1(1)* 14 to 15 labelled f_1(1)* 15 to 16 labelled g_1(1)* 16 to 17 labelled f_1(1)* 17 to 2 labelled a(1)* 18 to 19 labelled f_1(2)* 18 to 15 labelled f_1(3)* 18 to 26 labelled f_1(3)* 19 to 15 labelled mark_1(2)* 19 to 26 labelled active_1(2)* 20 to 21 labelled f_1(2)* 21 to 22 labelled g_1(2)* 22 to 23 labelled f_1(2)* 23 to 2 labelled a(2)* 24 to 25 labelled f_1(3)* 24 to 21 labelled f_1(4)* 24 to 27 labelled f_1(4)* 25 to 21 labelled mark_1(3)* 25 to 27 labelled active_1(3)* 26 to 16 labelled g_1(2)* 27 to 22 labelled g_1(3) 3.27/1.64 3.27/1.64 3.27/1.64 ---------------------------------------- 3.27/1.64 3.27/1.64 (2) 3.27/1.64 YES 3.27/1.68 EOF
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