Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Stand 10685 pair #381722393
details
property
value
status
complete
benchmark
size-12-alpha-3-num-360.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n042.star.cs.uiowa.edu
space
Waldmann_07_size12
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
5.46651005745 seconds
cpu usage
18.405995718
max memory
2.558017536E9
stage attributes
key
value
output-size
3834
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, 23 ms] (2) QDP (3) MRRProof [EQUIVALENT, 27 ms] (4) QDP (5) QDPOrderProof [EQUIVALENT, 82 ms] (6) QDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(x1) -> b(x1) a(b(b(x1))) -> c(x1) c(c(x1)) -> a(b(c(a(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(b(b(x1))) -> C(x1) C(c(x1)) -> A(b(c(a(x1)))) C(c(x1)) -> C(a(x1)) C(c(x1)) -> A(x1) The TRS R consists of the following rules: a(x1) -> b(x1) a(b(b(x1))) -> c(x1) c(c(x1)) -> a(b(c(a(x1)))) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (3) MRRProof (EQUIVALENT) By using the rule removal processor [LPAR04] with the following ordering, at least one Dependency Pair or term rewrite system rule of this QDP problem can be strictly oriented. Strictly oriented dependency pairs: C(c(x1)) -> C(a(x1)) C(c(x1)) -> A(x1) Used ordering: Polynomial interpretation [POLO]: POL(A(x_1)) = x_1 POL(C(x_1)) = 2 + x_1 POL(a(x_1)) = 1 + x_1 POL(b(x_1)) = 1 + x_1 POL(c(x_1)) = 3 + x_1 ---------------------------------------- (4) Obligation: Q DP problem: The TRS P consists of the following rules: A(b(b(x1))) -> C(x1) C(c(x1)) -> A(b(c(a(x1)))) The TRS R consists of the following rules: a(x1) -> b(x1) a(b(b(x1))) -> c(x1) c(c(x1)) -> a(b(c(a(x1)))) Q is empty. We have to consider all minimal (P,Q,R)-chains. ----------------------------------------
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Stand 10685