details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.50022 seconds
cpu usage	3.29506
user time	3.16171
system time	0.133348
max virtual memory	1.827634E7
max residence set size	219824.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) NonTerminationProof [COMPLETE, 0 ms] (2) NO ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: h(f(f(x))) -> h(f(g(f(x)))) f(g(f(x))) -> f(f(x)) Q is empty. ---------------------------------------- (1) NonTerminationProof (COMPLETE) We used the non-termination processor [OPPELT08] to show that the SRS problem is infinite. Found the self-embedding DerivationStructure: "h f f -> h f f" h f f -> h f f by OverlapClosure OC 2"h f f -> h f g f by original rule (OC 1)""f g f -> f f by original rule (OC 1)" ---------------------------------------- (2) NO popout

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

job log

popout

actions

all output return to TRS Standard