details

property	value
status	complete
benchmark	Ex1_GL02a_L.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n107.star.cs.uiowa.edu
space	Transformed_CSR_04

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.22810697556 seconds
cpu usage	5.179435747
max memory	3.69045504E8

stage attributes

key	value
output-size	4935
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) QTRSRRRProof [EQUIVALENT, 0 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 0 ms] (4) QTRS (5) AAECC Innermost [EQUIVALENT, 0 ms] (6) QTRS (7) DependencyPairsProof [EQUIVALENT, 0 ms] (8) QDP (9) UsableRulesProof [EQUIVALENT, 0 ms] (10) QDP (11) QReductionProof [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: eq -> true eq -> eq eq -> false inf(X) -> cons take(0, X) -> nil take(s, cons) -> cons length(nil) -> 0 length(cons) -> s Q is empty. ---------------------------------------- (1) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(0) = 0 POL(cons) = 0 POL(eq) = 2 POL(false) = 2 POL(inf(x_1)) = 1 + x_1 POL(length(x_1)) = x_1 POL(nil) = 0 POL(s) = 0 POL(take(x_1, x_2)) = 2*x_1 + x_2 POL(true) = 2 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: inf(X) -> cons ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: eq -> true eq -> eq eq -> false take(0, X) -> nil take(s, cons) -> cons length(nil) -> 0 length(cons) -> s Q is empty. ---------------------------------------- (3) QTRSRRRProof (EQUIVALENT) Used ordering: Knuth-Bendix order [KBO] with precedence:length_1 > cons > s > eq > false > nil > 0 > take_2 > true and weight map: eq=1 true=1 false=1 0=2 popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to TRS Stand 20472