details

property	value
status	complete
benchmark	size-12-alpha-3-num-204.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n069.star.cs.uiowa.edu
space	Waldmann_07_size12

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.63074803352 seconds
cpu usage	19.241084784
max memory	2.643017728E9

stage attributes

key	value
output-size	21374
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) QTRS Reverse [EQUIVALENT, 0 ms] (2) QTRS (3) FlatCCProof [EQUIVALENT, 0 ms] (4) QTRS (5) RootLabelingProof [EQUIVALENT, 0 ms] (6) QTRS (7) QTRSRRRProof [EQUIVALENT, 46 ms] (8) QTRS (9) DependencyPairsProof [EQUIVALENT, 34 ms] (10) QDP (11) DependencyGraphProof [EQUIVALENT, 0 ms] (12) QDP (13) QDPOrderProof [EQUIVALENT, 352 ms] (14) QDP (15) DependencyGraphProof [EQUIVALENT, 0 ms] (16) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(x1) -> x1 a(b(x1)) -> b(b(a(c(x1)))) b(b(x1)) -> a(x1) c(c(x1)) -> 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(x1) -> x1 b(a(x1)) -> c(a(b(b(x1)))) b(b(x1)) -> a(x1) c(c(x1)) -> 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(x1)) -> a(x1) b(a(x1)) -> b(x1) c(a(x1)) -> c(x1) a(b(a(x1))) -> a(c(a(b(b(x1))))) b(b(a(x1))) -> b(c(a(b(b(x1))))) c(b(a(x1))) -> c(c(a(b(b(x1))))) a(b(b(x1))) -> a(a(x1)) b(b(b(x1))) -> b(a(x1)) c(b(b(x1))) -> c(a(x1)) a(c(c(x1))) -> a(x1) b(c(c(x1))) -> b(x1) c(c(c(x1))) -> c(x1) Q is empty. ---------------------------------------- (5) 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