details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.24002 seconds
cpu usage	6.08509
user time	5.8219
system time	0.263192
max virtual memory	1.9074552E7
max residence set size	710452.0

stage attributes

key	value
starexec-result	YES

output

YES 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 proven: (0) QTRS (1) QTRS Reverse [EQUIVALENT, 0 ms] (2) QTRS (3) FlatCCProof [EQUIVALENT, 0 ms] (4) QTRS (5) RootLabelingProof [EQUIVALENT, 0 ms] (6) QTRS (7) QTRSRRRProof [EQUIVALENT, 66 ms] (8) QTRS (9) DependencyPairsProof [EQUIVALENT, 1 ms] (10) QDP (11) DependencyGraphProof [EQUIVALENT, 0 ms] (12) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(a(x1)) -> b(x1) a(a(a(x1))) -> a(b(a(x1))) a(b(a(x1))) -> b(b(b(x1))) a(a(a(a(x1)))) -> a(a(b(a(a(x1))))) a(a(b(a(x1)))) -> a(b(b(a(b(x1))))) a(b(a(a(x1)))) -> b(a(b(b(a(x1))))) a(b(b(a(x1)))) -> b(b(b(b(b(x1))))) a(a(a(a(a(x1))))) -> a(a(a(b(a(a(a(x1))))))) a(a(a(b(a(x1))))) -> a(a(b(b(a(a(b(x1))))))) a(a(b(a(a(x1))))) -> a(b(a(b(a(b(a(x1))))))) a(a(b(b(a(x1))))) -> a(b(b(b(a(b(b(x1))))))) a(b(a(a(a(x1))))) -> b(a(a(b(b(a(a(x1))))))) a(b(a(b(a(x1))))) -> b(a(b(b(b(a(b(x1))))))) a(b(b(a(a(x1))))) -> b(b(a(b(b(b(a(x1))))))) a(b(b(b(a(x1))))) -> b(b(b(b(b(b(b(x1))))))) Q is empty. ---------------------------------------- (1) QTRS Reverse (EQUIVALENT) We applied the QTRS Reverse Processor [REVERSE]. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(a(x1)) -> b(x1) a(a(a(x1))) -> a(b(a(x1))) a(b(a(x1))) -> b(b(b(x1))) a(a(a(a(x1)))) -> a(a(b(a(a(x1))))) a(b(a(a(x1)))) -> b(a(b(b(a(x1))))) a(a(b(a(x1)))) -> a(b(b(a(b(x1))))) a(b(b(a(x1)))) -> b(b(b(b(b(x1))))) a(a(a(a(a(x1))))) -> a(a(a(b(a(a(a(x1))))))) a(b(a(a(a(x1))))) -> b(a(a(b(b(a(a(x1))))))) a(a(b(a(a(x1))))) -> a(b(a(b(a(b(a(x1))))))) a(b(b(a(a(x1))))) -> b(b(a(b(b(b(a(x1))))))) a(a(a(b(a(x1))))) -> a(a(b(b(a(a(b(x1))))))) a(b(a(b(a(x1))))) -> b(a(b(b(b(a(b(x1))))))) a(a(b(b(a(x1))))) -> a(b(b(b(a(b(b(x1))))))) a(b(b(b(a(x1))))) -> b(b(b(b(b(b(b(x1))))))) Q is empty. ---------------------------------------- (3) FlatCCProof (EQUIVALENT) We used flat context closure [ROOTLAB] As Q is empty the flat context closure was sound AND complete. ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(a(a(x1))) -> a(b(a(x1))) a(a(a(a(x1)))) -> a(a(b(a(a(x1))))) a(a(b(a(x1)))) -> a(b(b(a(b(x1))))) a(a(a(a(a(x1))))) -> a(a(a(b(a(a(a(x1))))))) a(a(b(a(a(x1))))) -> a(b(a(b(a(b(a(x1))))))) a(a(a(b(a(x1))))) -> a(a(b(b(a(a(b(x1))))))) a(a(b(b(a(x1))))) -> a(b(b(b(a(b(b(x1))))))) a(a(a(x1))) -> a(b(x1)) b(a(a(x1))) -> b(b(x1)) a(a(b(a(x1)))) -> a(b(b(b(x1)))) b(a(b(a(x1)))) -> b(b(b(b(x1)))) popout

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

job log

popout

actions

all output return to SRS Standard