Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS_Standard 2019-03-29 03.29 pair #432291745
details
property
value
status
complete
benchmark
z011.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n052.star.cs.uiowa.edu
space
Zantema_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.72174 seconds
cpu usage
14.7273
user time
13.9982
system time
0.729125
max virtual memory
4.1227048E7
max residence set size
2048768.0
stage attributes
key
value
starexec-result
YES
output
14.47/4.62 YES 14.47/4.65 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 14.47/4.65 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 14.47/4.65 14.47/4.65 14.47/4.65 Termination w.r.t. Q of the given QTRS could be proven: 14.47/4.65 14.47/4.65 (0) QTRS 14.47/4.65 (1) QTRS Reverse [EQUIVALENT, 0 ms] 14.47/4.65 (2) QTRS 14.47/4.65 (3) DependencyPairsProof [EQUIVALENT, 22 ms] 14.47/4.65 (4) QDP 14.47/4.65 (5) QDPOrderProof [EQUIVALENT, 21 ms] 14.47/4.65 (6) QDP 14.47/4.65 (7) DependencyGraphProof [EQUIVALENT, 0 ms] 14.47/4.65 (8) AND 14.47/4.65 (9) QDP 14.47/4.65 (10) UsableRulesProof [EQUIVALENT, 0 ms] 14.47/4.65 (11) QDP 14.47/4.65 (12) QDPSizeChangeProof [EQUIVALENT, 0 ms] 14.47/4.65 (13) YES 14.47/4.65 (14) QDP 14.47/4.65 (15) UsableRulesProof [EQUIVALENT, 0 ms] 14.47/4.65 (16) QDP 14.47/4.65 (17) QDPSizeChangeProof [EQUIVALENT, 0 ms] 14.47/4.65 (18) YES 14.47/4.65 14.47/4.65 14.47/4.65 ---------------------------------------- 14.47/4.65 14.47/4.65 (0) 14.47/4.65 Obligation: 14.47/4.65 Q restricted rewrite system: 14.47/4.65 The TRS R consists of the following rules: 14.47/4.65 14.47/4.65 a(b(x1)) -> b(b(a(x1))) 14.47/4.65 b(c(x1)) -> c(b(b(x1))) 14.47/4.65 c(a(x1)) -> a(c(c(x1))) 14.47/4.65 14.47/4.65 Q is empty. 14.47/4.65 14.47/4.65 ---------------------------------------- 14.47/4.65 14.47/4.65 (1) QTRS Reverse (EQUIVALENT) 14.47/4.65 We applied the QTRS Reverse Processor [REVERSE]. 14.47/4.65 ---------------------------------------- 14.47/4.65 14.47/4.65 (2) 14.47/4.65 Obligation: 14.47/4.65 Q restricted rewrite system: 14.47/4.65 The TRS R consists of the following rules: 14.47/4.65 14.47/4.65 b(a(x1)) -> a(b(b(x1))) 14.47/4.65 c(b(x1)) -> b(b(c(x1))) 14.47/4.65 a(c(x1)) -> c(c(a(x1))) 14.47/4.65 14.47/4.65 Q is empty. 14.47/4.65 14.47/4.65 ---------------------------------------- 14.47/4.65 14.47/4.65 (3) DependencyPairsProof (EQUIVALENT) 14.47/4.65 Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. 14.47/4.65 ---------------------------------------- 14.47/4.65 14.47/4.65 (4) 14.47/4.65 Obligation: 14.47/4.65 Q DP problem: 14.47/4.65 The TRS P consists of the following rules: 14.47/4.65 14.47/4.65 B(a(x1)) -> A(b(b(x1))) 14.47/4.65 B(a(x1)) -> B(b(x1)) 14.47/4.65 B(a(x1)) -> B(x1) 14.47/4.65 C(b(x1)) -> B(b(c(x1))) 14.47/4.65 C(b(x1)) -> B(c(x1)) 14.47/4.65 C(b(x1)) -> C(x1) 14.47/4.65 A(c(x1)) -> C(c(a(x1))) 14.47/4.65 A(c(x1)) -> C(a(x1)) 14.47/4.65 A(c(x1)) -> A(x1) 14.47/4.65 14.47/4.65 The TRS R consists of the following rules: 14.47/4.65 14.47/4.65 b(a(x1)) -> a(b(b(x1))) 14.47/4.65 c(b(x1)) -> b(b(c(x1))) 14.47/4.65 a(c(x1)) -> c(c(a(x1))) 14.47/4.65 14.47/4.65 Q is empty. 14.47/4.65 We have to consider all minimal (P,Q,R)-chains. 14.47/4.65 ---------------------------------------- 14.47/4.65 14.47/4.65 (5) QDPOrderProof (EQUIVALENT) 14.47/4.65 We use the reduction pair processor [LPAR04,JAR06]. 14.47/4.65 14.47/4.65 14.47/4.65 The following pairs can be oriented strictly and are deleted. 14.47/4.65 14.47/4.65 B(a(x1)) -> A(b(b(x1))) 14.47/4.65 B(a(x1)) -> B(b(x1)) 14.47/4.65 B(a(x1)) -> B(x1) 14.47/4.65 The remaining pairs can at least be oriented weakly. 14.47/4.65 Used ordering: Polynomial interpretation [POLO]:
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