details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.77932 seconds
cpu usage	16.816
user time	16.2905
system time	0.525458
max virtual memory	1.8491388E7
max residence set size	986692.0

stage attributes

key	value
starexec-result	YES

output

YES proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) AAECC Innermost [EQUIVALENT, 11 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) UsableRulesProof [EQUIVALENT, 0 ms] (16) QDP (17) QReductionProof [EQUIVALENT, 0 ms] (18) QDP (19) QDPQMonotonicMRRProof [EQUIVALENT, 33 ms] (20) QDP (21) QDPQMonotonicMRRProof [EQUIVALENT, 32 ms] (22) QDP (23) QDPOrderProof [EQUIVALENT, 79 ms] (24) QDP (25) QDPOrderProof [EQUIVALENT, 19 ms] (26) QDP (27) UsableRulesProof [EQUIVALENT, 0 ms] (28) QDP (29) QReductionProof [EQUIVALENT, 0 ms] (30) QDP (31) NonInfProof [EQUIVALENT, 12 ms] (32) QDP (33) DependencyGraphProof [EQUIVALENT, 0 ms] (34) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: cond1(true, x, y, z) -> cond2(gr(x, 0), x, y, z) cond2(true, x, y, z) -> cond1(or(gr(x, z), gr(y, z)), p(x), y, z) cond2(false, x, y, z) -> cond3(gr(y, 0), x, y, z) cond3(true, x, y, z) -> cond1(or(gr(x, z), gr(y, z)), x, p(y), z) cond3(false, x, y, z) -> cond1(or(gr(x, z), gr(y, z)), x, y, z) gr(0, x) -> false gr(s(x), 0) -> true gr(s(x), s(y)) -> gr(x, y) or(false, false) -> false or(true, x) -> true or(x, true) -> true p(0) -> 0 p(s(x)) -> x Q is empty. ---------------------------------------- (1) AAECC Innermost (EQUIVALENT) We have applied [NOC,AAECCNOC] to switch to innermost. The TRS R 1 is gr(0, x) -> false gr(s(x), 0) -> true gr(s(x), s(y)) -> gr(x, y) or(false, false) -> false or(true, x) -> true or(x, true) -> true p(0) -> 0 p(s(x)) -> x The TRS R 2 is cond1(true, x, y, z) -> cond2(gr(x, 0), x, y, z) cond2(true, x, y, z) -> cond1(or(gr(x, z), gr(y, z)), p(x), y, z) cond2(false, x, y, z) -> cond3(gr(y, 0), x, y, z) cond3(true, x, y, z) -> cond1(or(gr(x, z), gr(y, z)), x, p(y), z) cond3(false, x, y, z) -> cond1(or(gr(x, z), gr(y, z)), x, y, z) The signature Sigma is {cond1_4, cond2_4, cond3_4} ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: cond1(true, x, y, z) -> cond2(gr(x, 0), x, y, z) cond2(true, x, y, z) -> cond1(or(gr(x, z), gr(y, z)), p(x), y, z) cond2(false, x, y, z) -> cond3(gr(y, 0), x, y, z) cond3(true, x, y, z) -> cond1(or(gr(x, z), gr(y, z)), x, p(y), z) cond3(false, x, y, z) -> cond1(or(gr(x, z), gr(y, z)), x, y, z) popout

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

job log

popout

actions

all output return to TRS Standard