Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS_Standard 2019-03-29 03.29 pair #432295117
details
property
value
status
complete
benchmark
beans2.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n089.star.cs.uiowa.edu
space
Zantema_06
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
6.65393 seconds
cpu usage
16.6381
user time
15.8832
system time
0.754893
max virtual memory
8.2623176E7
max residence set size
2120632.0
stage attributes
key
value
starexec-result
YES
output
16.09/4.98 YES 16.09/4.99 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 16.09/4.99 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 16.09/4.99 16.09/4.99 16.09/4.99 Termination w.r.t. Q of the given QTRS could be proven: 16.09/4.99 16.09/4.99 (0) QTRS 16.09/4.99 (1) DependencyPairsProof [EQUIVALENT, 18 ms] 16.09/4.99 (2) QDP 16.09/4.99 (3) DependencyGraphProof [EQUIVALENT, 0 ms] 16.09/4.99 (4) AND 16.09/4.99 (5) QDP 16.09/4.99 (6) UsableRulesProof [EQUIVALENT, 0 ms] 16.09/4.99 (7) QDP 16.09/4.99 (8) MRRProof [EQUIVALENT, 42 ms] 16.09/4.99 (9) QDP 16.09/4.99 (10) DependencyGraphProof [EQUIVALENT, 0 ms] 16.09/4.99 (11) TRUE 16.09/4.99 (12) QDP 16.09/4.99 (13) MNOCProof [EQUIVALENT, 0 ms] 16.09/4.99 (14) QDP 16.09/4.99 (15) UsableRulesProof [EQUIVALENT, 0 ms] 16.09/4.99 (16) QDP 16.09/4.99 (17) QReductionProof [EQUIVALENT, 0 ms] 16.09/4.99 (18) QDP 16.09/4.99 (19) QDPOrderProof [EQUIVALENT, 33 ms] 16.09/4.99 (20) QDP 16.09/4.99 (21) PisEmptyProof [EQUIVALENT, 0 ms] 16.09/4.99 (22) YES 16.09/4.99 16.09/4.99 16.09/4.99 ---------------------------------------- 16.09/4.99 16.09/4.99 (0) 16.09/4.99 Obligation: 16.09/4.99 Q restricted rewrite system: 16.09/4.99 The TRS R consists of the following rules: 16.09/4.99 16.09/4.99 b(a(a(x1))) -> a(b(c(x1))) 16.09/4.99 c(a(x1)) -> a(c(x1)) 16.09/4.99 c(b(x1)) -> b(a(x1)) 16.09/4.99 L(a(a(x1))) -> L(a(b(c(x1)))) 16.09/4.99 c(R(x1)) -> b(a(R(x1))) 16.09/4.99 16.09/4.99 Q is empty. 16.09/4.99 16.09/4.99 ---------------------------------------- 16.09/4.99 16.09/4.99 (1) DependencyPairsProof (EQUIVALENT) 16.09/4.99 Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. 16.09/4.99 ---------------------------------------- 16.09/4.99 16.09/4.99 (2) 16.09/4.99 Obligation: 16.09/4.99 Q DP problem: 16.09/4.99 The TRS P consists of the following rules: 16.09/4.99 16.09/4.99 B(a(a(x1))) -> B(c(x1)) 16.09/4.99 B(a(a(x1))) -> C(x1) 16.09/4.99 C(a(x1)) -> C(x1) 16.09/4.99 C(b(x1)) -> B(a(x1)) 16.09/4.99 L^1(a(a(x1))) -> L^1(a(b(c(x1)))) 16.09/4.99 L^1(a(a(x1))) -> B(c(x1)) 16.09/4.99 L^1(a(a(x1))) -> C(x1) 16.09/4.99 C(R(x1)) -> B(a(R(x1))) 16.09/4.99 16.09/4.99 The TRS R consists of the following rules: 16.09/4.99 16.09/4.99 b(a(a(x1))) -> a(b(c(x1))) 16.09/4.99 c(a(x1)) -> a(c(x1)) 16.09/4.99 c(b(x1)) -> b(a(x1)) 16.09/4.99 L(a(a(x1))) -> L(a(b(c(x1)))) 16.09/4.99 c(R(x1)) -> b(a(R(x1))) 16.09/4.99 16.09/4.99 Q is empty. 16.09/4.99 We have to consider all minimal (P,Q,R)-chains. 16.09/4.99 ---------------------------------------- 16.09/4.99 16.09/4.99 (3) DependencyGraphProof (EQUIVALENT) 16.09/4.99 The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 2 SCCs with 3 less nodes. 16.09/4.99 ---------------------------------------- 16.09/4.99 16.09/4.99 (4) 16.09/4.99 Complex Obligation (AND) 16.09/4.99 16.09/4.99 ---------------------------------------- 16.09/4.99 16.09/4.99 (5) 16.09/4.99 Obligation: 16.09/4.99 Q DP problem: 16.09/4.99 The TRS P consists of the following rules: 16.09/4.99 16.09/4.99 B(a(a(x1))) -> C(x1) 16.09/4.99 C(a(x1)) -> C(x1) 16.09/4.99 C(b(x1)) -> B(a(x1)) 16.09/4.99 B(a(a(x1))) -> B(c(x1)) 16.09/4.99 16.09/4.99 The TRS R consists of the following rules: 16.09/4.99
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