Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS_Standard 2019-03-29 03.29 pair #432291625
details
property
value
status
complete
benchmark
size-11-alpha-3-num-17.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
Waldmann_07_size11
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
9.67171 seconds
cpu usage
33.9833
user time
32.6887
system time
1.29463
max virtual memory
6.2820736E7
max residence set size
4037948.0
stage attributes
key
value
starexec-result
YES
output
33.20/9.45 YES 33.41/9.53 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 33.41/9.53 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 33.41/9.53 33.41/9.53 33.41/9.53 Termination w.r.t. Q of the given QTRS could be proven: 33.41/9.53 33.41/9.53 (0) QTRS 33.41/9.53 (1) QTRS Reverse [EQUIVALENT, 0 ms] 33.41/9.53 (2) QTRS 33.41/9.53 (3) DependencyPairsProof [EQUIVALENT, 6 ms] 33.41/9.53 (4) QDP 33.41/9.53 (5) DependencyGraphProof [EQUIVALENT, 0 ms] 33.41/9.53 (6) QDP 33.41/9.53 (7) QDPOrderProof [EQUIVALENT, 84 ms] 33.41/9.53 (8) QDP 33.41/9.53 (9) DependencyGraphProof [EQUIVALENT, 0 ms] 33.41/9.53 (10) QDP 33.41/9.53 (11) UsableRulesProof [EQUIVALENT, 0 ms] 33.41/9.53 (12) QDP 33.41/9.53 (13) QDPSizeChangeProof [EQUIVALENT, 0 ms] 33.41/9.53 (14) YES 33.41/9.53 33.41/9.53 33.41/9.53 ---------------------------------------- 33.41/9.53 33.41/9.53 (0) 33.41/9.53 Obligation: 33.41/9.53 Q restricted rewrite system: 33.41/9.53 The TRS R consists of the following rules: 33.41/9.53 33.41/9.53 a(x1) -> x1 33.41/9.53 a(b(x1)) -> b(a(c(x1))) 33.41/9.53 b(x1) -> x1 33.41/9.53 c(c(x1)) -> b(a(x1)) 33.41/9.53 33.41/9.53 Q is empty. 33.41/9.53 33.41/9.53 ---------------------------------------- 33.41/9.53 33.41/9.53 (1) QTRS Reverse (EQUIVALENT) 33.41/9.53 We applied the QTRS Reverse Processor [REVERSE]. 33.41/9.53 ---------------------------------------- 33.41/9.53 33.41/9.53 (2) 33.41/9.53 Obligation: 33.41/9.53 Q restricted rewrite system: 33.41/9.53 The TRS R consists of the following rules: 33.41/9.53 33.41/9.53 a(x1) -> x1 33.41/9.53 b(a(x1)) -> c(a(b(x1))) 33.41/9.53 b(x1) -> x1 33.41/9.53 c(c(x1)) -> a(b(x1)) 33.41/9.53 33.41/9.53 Q is empty. 33.41/9.53 33.41/9.53 ---------------------------------------- 33.41/9.53 33.41/9.53 (3) DependencyPairsProof (EQUIVALENT) 33.41/9.53 Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. 33.41/9.53 ---------------------------------------- 33.41/9.53 33.41/9.53 (4) 33.41/9.53 Obligation: 33.41/9.53 Q DP problem: 33.41/9.53 The TRS P consists of the following rules: 33.41/9.53 33.41/9.53 B(a(x1)) -> C(a(b(x1))) 33.41/9.53 B(a(x1)) -> A(b(x1)) 33.41/9.53 B(a(x1)) -> B(x1) 33.41/9.53 C(c(x1)) -> A(b(x1)) 33.41/9.53 C(c(x1)) -> B(x1) 33.41/9.53 33.41/9.53 The TRS R consists of the following rules: 33.41/9.53 33.41/9.53 a(x1) -> x1 33.41/9.53 b(a(x1)) -> c(a(b(x1))) 33.41/9.53 b(x1) -> x1 33.41/9.53 c(c(x1)) -> a(b(x1)) 33.41/9.53 33.41/9.53 Q is empty. 33.41/9.53 We have to consider all minimal (P,Q,R)-chains. 33.41/9.53 ---------------------------------------- 33.41/9.53 33.41/9.53 (5) DependencyGraphProof (EQUIVALENT) 33.41/9.53 The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 2 less nodes. 33.41/9.53 ---------------------------------------- 33.41/9.53 33.41/9.53 (6) 33.41/9.53 Obligation: 33.41/9.53 Q DP problem: 33.41/9.53 The TRS P consists of the following rules: 33.41/9.53 33.41/9.53 C(c(x1)) -> B(x1) 33.41/9.53 B(a(x1)) -> C(a(b(x1))) 33.41/9.53 B(a(x1)) -> B(x1) 33.41/9.53 33.41/9.53 The TRS R consists of the following rules: 33.41/9.53 33.41/9.53 a(x1) -> x1
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