details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	2.49449396133 seconds
cpu usage	6.300380928
max memory	4.84294656E8

stage attributes

key	value
output-size	4808
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) QTRSRRRProof [EQUIVALENT, 86 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 18 ms] (4) QTRS (5) QTRSRRRProof [EQUIVALENT, 8 ms] (6) QTRS (7) QTRSRRRProof [EQUIVALENT, 0 ms] (8) QTRS (9) RisEmptyProof [EQUIVALENT, 0 ms] (10) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a__f(X) -> a__if(mark(X), c, f(true)) a__if(true, X, Y) -> mark(X) a__if(false, X, Y) -> mark(Y) mark(f(X)) -> a__f(mark(X)) mark(if(X1, X2, X3)) -> a__if(mark(X1), mark(X2), X3) mark(c) -> c mark(true) -> true mark(false) -> false a__f(X) -> f(X) a__if(X1, X2, X3) -> if(X1, X2, X3) Q is empty. ---------------------------------------- (1) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(a__f(x_1)) = 2*x_1 POL(a__if(x_1, x_2, x_3)) = 2*x_1 + x_2 + 2*x_3 POL(c) = 0 POL(f(x_1)) = 2*x_1 POL(false) = 2 POL(if(x_1, x_2, x_3)) = 2*x_1 + x_2 + 2*x_3 POL(mark(x_1)) = x_1 POL(true) = 0 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: a__if(false, X, Y) -> mark(Y) ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a__f(X) -> a__if(mark(X), c, f(true)) a__if(true, X, Y) -> mark(X) mark(f(X)) -> a__f(mark(X)) mark(if(X1, X2, X3)) -> a__if(mark(X1), mark(X2), X3) mark(c) -> c mark(true) -> true mark(false) -> false a__f(X) -> f(X) a__if(X1, X2, X3) -> if(X1, X2, X3) Q is empty. ---------------------------------------- (3) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(a__f(x_1)) = 2*x_1 POL(a__if(x_1, x_2, x_3)) = x_1 + 2*x_2 + 2*x_3 POL(c) = 0 POL(f(x_1)) = 2*x_1 POL(false) = 2 POL(if(x_1, x_2, x_3)) = x_1 + 2*x_2 + 2*x_3 POL(mark(x_1)) = 2*x_1 POL(true) = 0 popout

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

job log

popout

actions

all output return to TRS Standard