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	n106.star.cs.uiowa.edu
space	Zantema_06

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.41827106476 seconds
cpu usage	6.727787588
max memory	8.42600448E8

stage attributes

key	value
output-size	17576
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) FlatCCProof [EQUIVALENT, 0 ms] (2) QTRS (3) RootLabelingProof [EQUIVALENT, 0 ms] (4) QTRS (5) QTRSRRRProof [EQUIVALENT, 55 ms] (6) QTRS (7) DependencyPairsProof [EQUIVALENT, 18 ms] (8) QDP (9) DependencyGraphProof [EQUIVALENT, 0 ms] (10) 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) FlatCCProof (EQUIVALENT) We used flat context closure [ROOTLAB] As Q is empty the flat context closure was sound AND complete. ---------------------------------------- (2) 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(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(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)))) a(a(b(a(a(x1))))) -> a(b(a(b(b(a(x1)))))) b(a(b(a(a(x1))))) -> b(b(a(b(b(a(x1)))))) a(a(b(b(a(x1))))) -> a(b(b(b(b(b(x1)))))) b(a(b(b(a(x1))))) -> b(b(b(b(b(b(x1)))))) a(a(b(a(a(a(x1)))))) -> a(b(a(a(b(b(a(a(x1)))))))) b(a(b(a(a(a(x1)))))) -> b(b(a(a(b(b(a(a(x1)))))))) a(a(b(a(b(a(x1)))))) -> a(b(a(b(b(b(a(b(x1)))))))) b(a(b(a(b(a(x1)))))) -> b(b(a(b(b(b(a(b(x1)))))))) a(a(b(b(a(a(x1)))))) -> a(b(b(a(b(b(b(a(x1)))))))) b(a(b(b(a(a(x1)))))) -> b(b(b(a(b(b(b(a(x1)))))))) a(a(b(b(b(a(x1)))))) -> a(b(b(b(b(b(b(b(x1)))))))) b(a(b(b(b(a(x1)))))) -> b(b(b(b(b(b(b(b(x1)))))))) Q is empty. ---------------------------------------- (3) RootLabelingProof (EQUIVALENT) We used plain root labeling [ROOTLAB] with the following heuristic: LabelAll: All function symbols get labeled As Q is empty the root labeling was sound AND complete. ---------------------------------------- popout

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

job log

popout

actions

all output return to SRS Stand 10685