Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381713197
details
property
value
status
complete
benchmark
enger-nonloop-swapXY.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n103.star.cs.uiowa.edu
space
EEG_IJCAR_12
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
12.1919271946 seconds
cpu usage
37.71908383
max memory
3.836542976E9
stage attributes
key
value
output-size
8049
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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 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, 0 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) AND (7) QDP (8) UsableRulesProof [EQUIVALENT, 0 ms] (9) QDP (10) QReductionProof [EQUIVALENT, 0 ms] (11) QDP (12) QDPSizeChangeProof [EQUIVALENT, 0 ms] (13) YES (14) QDP (15) MNOCProof [EQUIVALENT, 0 ms] (16) QDP (17) NonLoopProof [COMPLETE, 50 ms] (18) NO ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: g(tt, x, y) -> g(swap(x, y), s(x), s(y)) swap(0, y) -> tt swap(s(x), y) -> swap(x, s(y)) Q is empty. ---------------------------------------- (1) AAECC Innermost (EQUIVALENT) We have applied [NOC,AAECCNOC] to switch to innermost. The TRS R 1 is swap(0, y) -> tt swap(s(x), y) -> swap(x, s(y)) The TRS R 2 is g(tt, x, y) -> g(swap(x, y), s(x), s(y)) The signature Sigma is {g_3} ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: g(tt, x, y) -> g(swap(x, y), s(x), s(y)) swap(0, y) -> tt swap(s(x), y) -> swap(x, s(y)) The set Q consists of the following terms: g(tt, x0, x1) swap(0, x0) swap(s(x0), x1) ---------------------------------------- (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(tt, x, y) -> G(swap(x, y), s(x), s(y)) G(tt, x, y) -> SWAP(x, y) SWAP(s(x), y) -> SWAP(x, s(y)) The TRS R consists of the following rules: g(tt, x, y) -> g(swap(x, y), s(x), s(y)) swap(0, y) -> tt swap(s(x), y) -> swap(x, s(y)) The set Q consists of the following terms: g(tt, x0, x1)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472