Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #516975136
details
property
value
status
complete
benchmark
size-12-alpha-2-num-4.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n145.star.cs.uiowa.edu
space
Waldmann_07_size12
run statistics
property
value
solver
AProVE21
configuration
standard
runtime (wallclock)
10.8371250629 seconds
cpu usage
37.495613917
max memory
1.702301696E9
stage attributes
key
value
output-size
5819
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: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished 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, 10 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) QDP (7) QDPOrderProof [EQUIVALENT, 202 ms] (8) QDP (9) QDPOrderProof [EQUIVALENT, 177 ms] (10) QDP (11) UsableRulesProof [EQUIVALENT, 2 ms] (12) QDP (13) QDPSizeChangeProof [EQUIVALENT, 0 ms] (14) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(a(x1)) -> x1 a(b(a(b(x1)))) -> b(a(b(b(a(a(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)) -> x1 b(a(b(a(x1)))) -> a(a(b(b(a(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: B(a(b(a(x1)))) -> A(a(b(b(a(b(x1)))))) B(a(b(a(x1)))) -> A(b(b(a(b(x1))))) B(a(b(a(x1)))) -> B(b(a(b(x1)))) B(a(b(a(x1)))) -> B(a(b(x1))) B(a(b(a(x1)))) -> A(b(x1)) B(a(b(a(x1)))) -> B(x1) The TRS R consists of the following rules: a(a(x1)) -> x1 b(a(b(a(x1)))) -> a(a(b(b(a(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 3 less nodes. ---------------------------------------- (6) Obligation: Q DP problem: The TRS P consists of the following rules: B(a(b(a(x1)))) -> B(a(b(x1))) B(a(b(a(x1)))) -> B(b(a(b(x1)))) B(a(b(a(x1)))) -> B(x1) The TRS R consists of the following rules:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard