Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS_Standard 2019-03-29 03.29 pair #432291067
details
property
value
status
complete
benchmark
size-12-alpha-3-num-465.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n105.star.cs.uiowa.edu
space
Waldmann_07_size12
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.39294 seconds
cpu usage
13.6873
user time
13.1094
system time
0.577904
max virtual memory
1.9814352E7
max residence set size
1713160.0
stage attributes
key
value
starexec-result
YES
output
13.12/4.31 YES 13.12/4.32 proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml 13.12/4.32 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 13.12/4.32 13.12/4.32 13.12/4.32 Termination w.r.t. Q of the given QTRS could be proven: 13.12/4.32 13.12/4.32 (0) QTRS 13.12/4.32 (1) DependencyPairsProof [EQUIVALENT, 25 ms] 13.12/4.32 (2) QDP 13.12/4.32 (3) DependencyGraphProof [EQUIVALENT, 0 ms] 13.12/4.32 (4) QDP 13.12/4.32 (5) QDPOrderProof [EQUIVALENT, 131 ms] 13.12/4.32 (6) QDP 13.12/4.32 (7) UsableRulesProof [EQUIVALENT, 0 ms] 13.12/4.32 (8) QDP 13.12/4.32 (9) QDPSizeChangeProof [EQUIVALENT, 0 ms] 13.12/4.32 (10) YES 13.12/4.32 13.12/4.32 13.12/4.32 ---------------------------------------- 13.12/4.32 13.12/4.32 (0) 13.12/4.32 Obligation: 13.12/4.32 Q restricted rewrite system: 13.12/4.32 The TRS R consists of the following rules: 13.12/4.32 13.12/4.32 a(x1) -> b(c(b(x1))) 13.12/4.32 a(b(x1)) -> x1 13.12/4.32 c(c(b(x1))) -> a(c(c(x1))) 13.12/4.32 13.12/4.32 Q is empty. 13.12/4.32 13.12/4.32 ---------------------------------------- 13.12/4.32 13.12/4.32 (1) DependencyPairsProof (EQUIVALENT) 13.12/4.32 Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. 13.12/4.32 ---------------------------------------- 13.12/4.32 13.12/4.32 (2) 13.12/4.32 Obligation: 13.12/4.32 Q DP problem: 13.12/4.32 The TRS P consists of the following rules: 13.12/4.32 13.12/4.32 A(x1) -> C(b(x1)) 13.12/4.32 C(c(b(x1))) -> A(c(c(x1))) 13.12/4.32 C(c(b(x1))) -> C(c(x1)) 13.12/4.32 C(c(b(x1))) -> C(x1) 13.12/4.32 13.12/4.32 The TRS R consists of the following rules: 13.12/4.32 13.12/4.32 a(x1) -> b(c(b(x1))) 13.12/4.32 a(b(x1)) -> x1 13.12/4.32 c(c(b(x1))) -> a(c(c(x1))) 13.12/4.32 13.12/4.32 Q is empty. 13.12/4.32 We have to consider all minimal (P,Q,R)-chains. 13.12/4.32 ---------------------------------------- 13.12/4.32 13.12/4.32 (3) DependencyGraphProof (EQUIVALENT) 13.12/4.32 The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 2 less nodes. 13.12/4.32 ---------------------------------------- 13.12/4.32 13.12/4.32 (4) 13.12/4.32 Obligation: 13.12/4.32 Q DP problem: 13.12/4.32 The TRS P consists of the following rules: 13.12/4.32 13.12/4.32 C(c(b(x1))) -> C(x1) 13.12/4.32 C(c(b(x1))) -> C(c(x1)) 13.12/4.32 13.12/4.32 The TRS R consists of the following rules: 13.12/4.32 13.12/4.32 a(x1) -> b(c(b(x1))) 13.12/4.32 a(b(x1)) -> x1 13.12/4.32 c(c(b(x1))) -> a(c(c(x1))) 13.12/4.32 13.12/4.32 Q is empty. 13.12/4.32 We have to consider all minimal (P,Q,R)-chains. 13.12/4.32 ---------------------------------------- 13.12/4.32 13.12/4.32 (5) QDPOrderProof (EQUIVALENT) 13.12/4.32 We use the reduction pair processor [LPAR04,JAR06]. 13.12/4.32 13.12/4.32 13.12/4.32 The following pairs can be oriented strictly and are deleted. 13.12/4.32 13.12/4.32 C(c(b(x1))) -> C(c(x1)) 13.12/4.32 The remaining pairs can at least be oriented weakly. 13.12/4.32 Used ordering: Matrix interpretation [MATRO] with arctic natural numbers [ARCTIC]: 13.12/4.32 13.12/4.32 <<< 13.12/4.32 POL(C(x_1)) = [[0A]] + [[0A, -I, 0A]] * x_1 13.12/4.32 >>> 13.12/4.32 13.12/4.32 <<< 13.12/4.32 POL(c(x_1)) = [[0A], [0A], [0A]] + [[-I, 0A, -I], [0A, -I, 0A], [-I, 0A, -I]] * x_1 13.12/4.32 >>> 13.12/4.32 13.12/4.32 <<<
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