Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Stand 10685 pair #381717533
details
property
value
status
complete
benchmark
x05.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n096.star.cs.uiowa.edu
space
Secret_07_SRS
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.48586583138 seconds
cpu usage
13.789550887
max memory
1.400389632E9
stage attributes
key
value
output-size
7457
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) QTRS Reverse [EQUIVALENT, 0 ms] (2) QTRS (3) DependencyPairsProof [EQUIVALENT, 13 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) QDP (7) UsableRulesProof [EQUIVALENT, 2 ms] (8) QDP (9) MNOCProof [EQUIVALENT, 0 ms] (10) QDP (11) QDPOrderProof [EQUIVALENT, 101 ms] (12) QDP (13) QDPOrderProof [EQUIVALENT, 37 ms] (14) QDP (15) DependencyGraphProof [EQUIVALENT, 0 ms] (16) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(a(x1)) -> b(b(x1)) c(c(b(x1))) -> d(c(a(x1))) a(x1) -> d(c(c(x1))) c(d(x1)) -> b(c(x1)) Q is empty. ---------------------------------------- (1) QTRS Reverse (EQUIVALENT) We applied the QTRS Reverse Processor [REVERSE]. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(a(x1)) -> b(b(x1)) b(c(c(x1))) -> a(c(d(x1))) a(x1) -> c(c(d(x1))) d(c(x1)) -> c(b(x1)) Q is empty. ---------------------------------------- (3) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. ---------------------------------------- (4) Obligation: Q DP problem: The TRS P consists of the following rules: A(a(x1)) -> B(b(x1)) A(a(x1)) -> B(x1) B(c(c(x1))) -> A(c(d(x1))) B(c(c(x1))) -> D(x1) A(x1) -> D(x1) D(c(x1)) -> B(x1) The TRS R consists of the following rules: a(a(x1)) -> b(b(x1)) b(c(c(x1))) -> a(c(d(x1))) a(x1) -> c(c(d(x1))) d(c(x1)) -> c(b(x1)) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (5) DependencyGraphProof (EQUIVALENT) The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 2 less nodes. ---------------------------------------- (6) Obligation: Q DP problem:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Stand 10685