details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.95918 seconds
cpu usage	8.21656
user time	7.83062
system time	0.385941
max virtual memory	7.837186E7
max residence set size	876724.0

stage attributes

key	value
starexec-result	NO

output

NO 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 disproven: (0) QTRS (1) QTRSRRRProof [EQUIVALENT, 41 ms] (2) QTRS (3) Overlay + Local Confluence [EQUIVALENT, 0 ms] (4) QTRS (5) DependencyPairsProof [EQUIVALENT, 10 ms] (6) QDP (7) DependencyGraphProof [EQUIVALENT, 1 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: c -> f(n__g(n__c)) f(n__g(X)) -> g(activate(X)) g(X) -> n__g(X) c -> n__c activate(n__g(X)) -> g(X) activate(n__c) -> c activate(X) -> X Q is empty. ---------------------------------------- (1) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(activate(x_1)) = 1 + x_1 POL(c) = 1 POL(f(x_1)) = 1 + x_1 POL(g(x_1)) = x_1 POL(n__c) = 0 POL(n__g(x_1)) = x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: c -> n__c activate(n__g(X)) -> g(X) activate(X) -> X ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: c -> f(n__g(n__c)) f(n__g(X)) -> g(activate(X)) g(X) -> n__g(X) activate(n__c) -> c Q is empty. ---------------------------------------- (3) Overlay + Local Confluence (EQUIVALENT) The TRS is overlay and locally confluent. By [NOC] we can switch to innermost. ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: c -> f(n__g(n__c)) f(n__g(X)) -> g(activate(X)) g(X) -> n__g(X) activate(n__c) -> c The set Q consists of the following terms: c f(n__g(x0)) g(x0) activate(n__c) popout

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

job log

popout

actions

all output return to TRS Standard