Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516966060
details
property
value
status
complete
benchmark
Ex1_Zan97.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n063.star.cs.uiowa.edu
space
Strategy_removed_CSR_05
run statistics
property
value
solver
AProVE21
configuration
standard
runtime (wallclock)
4.92099094391 seconds
cpu usage
16.309846631
max memory
1.270788096E9
stage attributes
key
value
output-size
4923
starexec-result
NO
output
/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO 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 disproven: (0) QTRS (1) AAECC Innermost [EQUIVALENT, 0 ms] (2) QTRS (3) DependencyPairsProof [EQUIVALENT, 3 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) QDP (7) UsableRulesProof [EQUIVALENT, 0 ms] (8) QDP (9) QReductionProof [EQUIVALENT, 0 ms] (10) QDP (11) MNOCProof [EQUIVALENT, 0 ms] (12) QDP (13) NonTerminationLoopProof [COMPLETE, 0 ms] (14) NO ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: g(X) -> h(X) c -> d h(d) -> g(c) Q is empty. ---------------------------------------- (1) AAECC Innermost (EQUIVALENT) We have applied [NOC,AAECCNOC] to switch to innermost. The TRS R 1 is c -> d The TRS R 2 is g(X) -> h(X) h(d) -> g(c) The signature Sigma is {g_1, h_1} ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: g(X) -> h(X) c -> d h(d) -> g(c) The set Q consists of the following terms: g(x0) c h(d) ---------------------------------------- (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: G(X) -> H(X) H(d) -> G(c) H(d) -> C The TRS R consists of the following rules: g(X) -> h(X) c -> d h(d) -> g(c) The set Q consists of the following terms: g(x0) c h(d) 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 TRS Standard