Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Stand 10685 pair #381719319
details
property
value
status
complete
benchmark
size-12-alpha-3-num-551.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n013.star.cs.uiowa.edu
space
Waldmann_07_size12
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
6.85773992538 seconds
cpu usage
23.529132005
max memory
2.612236288E9
stage attributes
key
value
output-size
2613
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) DependencyPairsProof [EQUIVALENT, 13 ms] (2) QDP (3) QDPOrderProof [EQUIVALENT, 90 ms] (4) QDP (5) PisEmptyProof [EQUIVALENT, 1 ms] (6) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(b(x1)) -> x1 a(c(x1)) -> b(c(c(a(x1)))) b(c(x1)) -> a(b(x1)) Q is empty. ---------------------------------------- (1) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. ---------------------------------------- (2) Obligation: Q DP problem: The TRS P consists of the following rules: A(c(x1)) -> B(c(c(a(x1)))) A(c(x1)) -> A(x1) B(c(x1)) -> A(b(x1)) B(c(x1)) -> B(x1) The TRS R consists of the following rules: a(b(x1)) -> x1 a(c(x1)) -> b(c(c(a(x1)))) b(c(x1)) -> a(b(x1)) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (3) QDPOrderProof (EQUIVALENT) We use the reduction pair processor [LPAR04,JAR06]. The following pairs can be oriented strictly and are deleted. A(c(x1)) -> B(c(c(a(x1)))) A(c(x1)) -> A(x1) B(c(x1)) -> A(b(x1)) B(c(x1)) -> B(x1) The remaining pairs can at least be oriented weakly. Used ordering: Polynomial interpretation [POLO,RATPOLO]: POL(A(x_1)) = [7/4] + [2]x_1 POL(B(x_1)) = [1/2]x_1 POL(a(x_1)) = [3/2] + [2]x_1 POL(b(x_1)) = [1/2]x_1 POL(c(x_1)) = [4] + [2]x_1 The value of delta used in the strict ordering is 1/4. The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented: a(b(x1)) -> x1 a(c(x1)) -> b(c(c(a(x1)))) b(c(x1)) -> a(b(x1)) ---------------------------------------- (4) Obligation: Q DP problem: P is empty. The TRS R consists of the following rules: a(b(x1)) -> x1 a(c(x1)) -> b(c(c(a(x1)))) b(c(x1)) -> a(b(x1)) Q is empty.
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Stand 10685