details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.17539 seconds
cpu usage	5.0366
user time	4.78207
system time	0.254527
max virtual memory	1.8477752E7
max residence set size	350692.0

stage attributes

key	value
starexec-result	NO

output

NO proof of /export/starexec/sandbox2/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, 52 ms] (2) QTRS (3) AAECC Innermost [EQUIVALENT, 0 ms] (4) QTRS (5) DependencyPairsProof [EQUIVALENT, 0 ms] (6) QDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) QDP (9) UsableRulesProof [EQUIVALENT, 0 ms] (10) QDP (11) QReductionProof [EQUIVALENT, 0 ms] (12) QDP (13) TransformationProof [EQUIVALENT, 0 ms] (14) QDP (15) TransformationProof [EQUIVALENT, 0 ms] (16) QDP (17) UsableRulesProof [EQUIVALENT, 0 ms] (18) QDP (19) QReductionProof [EQUIVALENT, 0 ms] (20) QDP (21) TransformationProof [EQUIVALENT, 0 ms] (22) QDP (23) TransformationProof [EQUIVALENT, 0 ms] (24) QDP (25) TransformationProof [EQUIVALENT, 0 ms] (26) QDP (27) TransformationProof [EQUIVALENT, 0 ms] (28) QDP (29) NonTerminationLoopProof [COMPLETE, 0 ms] (30) NO ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(x, x) -> f(i(x), g(g(x))) f(x, y) -> x g(x) -> i(x) f(x, i(x)) -> f(x, x) f(i(x), i(g(x))) -> a Q is empty. ---------------------------------------- (1) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(a) = 0 POL(f(x_1, x_2)) = 1 + 2*x_1 + 2*x_2 POL(g(x_1)) = x_1 POL(i(x_1)) = x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: f(x, y) -> x f(i(x), i(g(x))) -> a ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(x, x) -> f(i(x), g(g(x))) g(x) -> i(x) f(x, i(x)) -> f(x, x) Q is empty. ---------------------------------------- (3) AAECC Innermost (EQUIVALENT) We have applied [NOC,AAECCNOC] to switch to innermost. The TRS R 1 is g(x) -> i(x) The TRS R 2 is f(x, x) -> f(i(x), g(g(x))) f(x, i(x)) -> f(x, x) The signature Sigma is {f_2} ---------------------------------------- (4) popout

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

job log

popout

actions

all output return to TRS Standard