details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.33253312111 seconds
cpu usage	6.10460069
max memory	4.04795392E8

stage attributes

key	value
output-size	15905
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/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, 60 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 3 ms] (4) QTRS (5) DependencyPairsProof [EQUIVALENT, 37 ms] (6) QDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) AND (9) QDP (10) UsableRulesProof [EQUIVALENT, 0 ms] (11) QDP (12) QDPSizeChangeProof [EQUIVALENT, 0 ms] (13) YES (14) QDP (15) UsableRulesProof [EQUIVALENT, 0 ms] (16) QDP (17) QDPSizeChangeProof [EQUIVALENT, 0 ms] (18) YES (19) QDP (20) MRRProof [EQUIVALENT, 0 ms] (21) QDP (22) QDPOrderProof [EQUIVALENT, 77 ms] (23) QDP (24) DependencyGraphProof [EQUIVALENT, 0 ms] (25) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: active(f(X)) -> mark(if(X, c, f(true))) active(if(true, X, Y)) -> mark(X) active(if(false, X, Y)) -> mark(Y) mark(f(X)) -> active(f(mark(X))) mark(if(X1, X2, X3)) -> active(if(mark(X1), mark(X2), X3)) mark(c) -> active(c) mark(true) -> active(true) mark(false) -> active(false) f(mark(X)) -> f(X) f(active(X)) -> f(X) if(mark(X1), X2, X3) -> if(X1, X2, X3) if(X1, mark(X2), X3) -> if(X1, X2, X3) if(X1, X2, mark(X3)) -> if(X1, X2, X3) if(active(X1), X2, X3) -> if(X1, X2, X3) if(X1, active(X2), X3) -> if(X1, X2, X3) if(X1, X2, active(X3)) -> if(X1, X2, X3) Q is empty. ---------------------------------------- (1) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(active(x_1)) = x_1 POL(c) = 0 POL(f(x_1)) = x_1 POL(false) = 1 POL(if(x_1, x_2, x_3)) = x_1 + x_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: active(if(false, X, Y)) -> mark(Y) ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: active(f(X)) -> mark(if(X, c, f(true))) active(if(true, X, Y)) -> mark(X) mark(f(X)) -> active(f(mark(X))) mark(if(X1, X2, X3)) -> active(if(mark(X1), mark(X2), X3)) mark(c) -> active(c) mark(true) -> active(true) popout

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

job log

popout

actions

all output return to TRS Stand 20472