details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.7119948864 seconds
cpu usage	3.788657379
max memory	1.98782976E8

stage attributes

key	value
output-size	4067
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) QTRSRRRProof [EQUIVALENT, 58 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 0 ms] (4) QTRS (5) QTRSRRRProof [EQUIVALENT, 0 ms] (6) QTRS (7) AAECC Innermost [EQUIVALENT, 0 ms] (8) QTRS (9) DependencyPairsProof [EQUIVALENT, 0 ms] (10) QDP (11) DependencyGraphProof [EQUIVALENT, 0 ms] (12) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(s(X)) -> f(X) g(cons(0, Y)) -> g(Y) g(cons(s(X), Y)) -> s(X) h(cons(X, Y)) -> h(g(cons(X, Y))) Q is empty. ---------------------------------------- (1) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(0) = 2 POL(cons(x_1, x_2)) = x_1 + x_2 POL(f(x_1)) = 2*x_1 POL(g(x_1)) = x_1 POL(h(x_1)) = 2*x_1 POL(s(x_1)) = 2*x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: g(cons(0, Y)) -> g(Y) ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(s(X)) -> f(X) g(cons(s(X), Y)) -> s(X) h(cons(X, Y)) -> h(g(cons(X, Y))) Q is empty. ---------------------------------------- (3) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(cons(x_1, x_2)) = x_1 + 2*x_2 POL(f(x_1)) = 2*x_1 POL(g(x_1)) = x_1 POL(h(x_1)) = x_1 POL(s(x_1)) = 1 + x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: f(s(X)) -> f(X) ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: g(cons(s(X), Y)) -> s(X) popout

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

job log

popout

actions

all output return to TRS Stand 20472