Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS_Standard 2019-03-29 03.29 pair #432293917
details
property
value
status
complete
benchmark
10.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n097.star.cs.uiowa.edu
space
Secret_06_SRS
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
6.081 seconds
cpu usage
20.2939
user time
19.37
system time
0.923906
max virtual memory
4.0216716E7
max residence set size
2647272.0
stage attributes
key
value
starexec-result
YES
output
19.81/5.97 YES 20.05/5.99 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 20.05/5.99 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 20.05/5.99 20.05/5.99 20.05/5.99 Termination w.r.t. Q of the given QTRS could be proven: 20.05/5.99 20.05/5.99 (0) QTRS 20.05/5.99 (1) DependencyPairsProof [EQUIVALENT, 2 ms] 20.05/5.99 (2) QDP 20.05/5.99 (3) QDPOrderProof [EQUIVALENT, 117 ms] 20.05/5.99 (4) QDP 20.05/5.99 (5) QDPOrderProof [EQUIVALENT, 53 ms] 20.05/5.99 (6) QDP 20.05/5.99 (7) PisEmptyProof [EQUIVALENT, 0 ms] 20.05/5.99 (8) YES 20.05/5.99 20.05/5.99 20.05/5.99 ---------------------------------------- 20.05/5.99 20.05/5.99 (0) 20.05/5.99 Obligation: 20.05/5.99 Q restricted rewrite system: 20.05/5.99 The TRS R consists of the following rules: 20.05/5.99 20.05/5.99 a(b(b(x1))) -> b(b(a(a(x1)))) 20.05/5.99 a(b(a(x1))) -> b(b(x1)) 20.05/5.99 20.05/5.99 Q is empty. 20.05/5.99 20.05/5.99 ---------------------------------------- 20.05/5.99 20.05/5.99 (1) DependencyPairsProof (EQUIVALENT) 20.05/5.99 Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. 20.05/5.99 ---------------------------------------- 20.05/5.99 20.05/5.99 (2) 20.05/5.99 Obligation: 20.05/5.99 Q DP problem: 20.05/5.99 The TRS P consists of the following rules: 20.05/5.99 20.05/5.99 A(b(b(x1))) -> A(a(x1)) 20.05/5.99 A(b(b(x1))) -> A(x1) 20.05/5.99 20.05/5.99 The TRS R consists of the following rules: 20.05/5.99 20.05/5.99 a(b(b(x1))) -> b(b(a(a(x1)))) 20.05/5.99 a(b(a(x1))) -> b(b(x1)) 20.05/5.99 20.05/5.99 Q is empty. 20.05/5.99 We have to consider all minimal (P,Q,R)-chains. 20.05/5.99 ---------------------------------------- 20.05/5.99 20.05/5.99 (3) QDPOrderProof (EQUIVALENT) 20.05/5.99 We use the reduction pair processor [LPAR04,JAR06]. 20.05/5.99 20.05/5.99 20.05/5.99 The following pairs can be oriented strictly and are deleted. 20.05/5.99 20.05/5.99 A(b(b(x1))) -> A(x1) 20.05/5.99 The remaining pairs can at least be oriented weakly. 20.05/5.99 Used ordering: Matrix interpretation [MATRO] with arctic natural numbers [ARCTIC]: 20.05/5.99 20.05/5.99 <<< 20.05/5.99 POL(A(x_1)) = [[0A]] + [[1A, 0A, -I]] * x_1 20.05/5.99 >>> 20.05/5.99 20.05/5.99 <<< 20.05/5.99 POL(b(x_1)) = [[-I], [0A], [-I]] + [[0A, 0A, 0A], [0A, -I, 0A], [1A, 0A, 0A]] * x_1 20.05/5.99 >>> 20.05/5.99 20.05/5.99 <<< 20.05/5.99 POL(a(x_1)) = [[-I], [-I], [-I]] + [[0A, 0A, 0A], [0A, 0A, 0A], [0A, 0A, 0A]] * x_1 20.05/5.99 >>> 20.05/5.99 20.05/5.99 20.05/5.99 The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented: 20.05/5.99 20.05/5.99 a(b(b(x1))) -> b(b(a(a(x1)))) 20.05/5.99 a(b(a(x1))) -> b(b(x1)) 20.05/5.99 20.05/5.99 20.05/5.99 ---------------------------------------- 20.05/5.99 20.05/5.99 (4) 20.05/5.99 Obligation: 20.05/5.99 Q DP problem: 20.05/5.99 The TRS P consists of the following rules: 20.05/5.99 20.05/5.99 A(b(b(x1))) -> A(a(x1)) 20.05/5.99 20.05/5.99 The TRS R consists of the following rules: 20.05/5.99 20.05/5.99 a(b(b(x1))) -> b(b(a(a(x1)))) 20.05/5.99 a(b(a(x1))) -> b(b(x1)) 20.05/5.99 20.05/5.99 Q is empty. 20.05/5.99 We have to consider all minimal (P,Q,R)-chains. 20.05/5.99 ---------------------------------------- 20.05/5.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