Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Conte Sensi 17651 pair #381733369
details
property
value
status
complete
benchmark
Ex9_Luc06.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n077.star.cs.uiowa.edu
space
CSR_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.62017798424 seconds
cpu usage
3.571029862
max memory
2.08101376E8
stage attributes
key
value
output-size
3219
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination of the given CSR could be proven: (0) CSR (1) CSDependencyPairsProof [EQUIVALENT, 0 ms] (2) QCSDP (3) QCSDependencyGraphProof [EQUIVALENT, 0 ms] (4) QCSDP (5) QCSUsableRulesProof [EQUIVALENT, 0 ms] (6) QCSDP (7) QCSDPInstantiationProcessor [EQUIVALENT, 0 ms] (8) QCSDP (9) PIsEmptyProof [EQUIVALENT, 0 ms] (10) YES ---------------------------------------- (0) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: f(a, X, X) -> f(X, b, b) b -> a The replacement map contains the following entries: f: {2} a: empty set b: empty set ---------------------------------------- (1) CSDependencyPairsProof (EQUIVALENT) Using Improved CS-DPs [LPAR08] we result in the following initial Q-CSDP problem. ---------------------------------------- (2) Obligation: Q-restricted context-sensitive dependency pair problem: For all symbols f in {f_3, F_3} we have mu(f) = {2}. The ordinary context-sensitive dependency pairs DP_o are: F(a, X, X) -> F(X, b, b) F(a, X, X) -> B The TRS R consists of the following rules: f(a, X, X) -> f(X, b, b) b -> a Q is empty. ---------------------------------------- (3) QCSDependencyGraphProof (EQUIVALENT) The approximation of the Context-Sensitive Dependency Graph [LPAR08] contains 1 SCC with 1 less node. ---------------------------------------- (4) Obligation: Q-restricted context-sensitive dependency pair problem: For all symbols f in {f_3, F_3} we have mu(f) = {2}. The TRS P consists of the following rules: F(a, X, X) -> F(X, b, b) The TRS R consists of the following rules: f(a, X, X) -> f(X, b, b) b -> a Q is empty. ---------------------------------------- (5) QCSUsableRulesProof (EQUIVALENT) The following rules are not useable [DA_EMMES] and can be deleted: f(a, x0, x0) -> f(x0, b, b) ---------------------------------------- (6) Obligation: Q-restricted context-sensitive dependency pair problem: For all symbols f in {F_3} we have mu(f) = {2}.
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Conte Sensi 17651