details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	31.1058900356 seconds
cpu usage	111.592868059
max memory	5.951074304E9

stage attributes

key	value
output-size	153191
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/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, 180 ms] (8) QTRS (9) DependencyPairsProof [EQUIVALENT, 232 ms] (10) QDP (11) DependencyGraphProof [EQUIVALENT, 0 ms] (12) QDP (13) UsableRulesProof [EQUIVALENT, 0 ms] (14) QDP (15) QDPOrderProof [EQUIVALENT, 260 ms] (16) QDP (17) DependencyGraphProof [EQUIVALENT, 1 ms] (18) QDP (19) QDPOrderProof [EQUIVALENT, 111 ms] (20) QDP (21) QDPOrderProof [EQUIVALENT, 97 ms] (22) QDP (23) DependencyGraphProof [EQUIVALENT, 0 ms] (24) QDP (25) QDPOrderProof [EQUIVALENT, 55 ms] (26) QDP (27) DependencyGraphProof [EQUIVALENT, 0 ms] (28) QDP (29) QDPOrderProof [EQUIVALENT, 3867 ms] (30) QDP (31) PisEmptyProof [EQUIVALENT, 0 ms] (32) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: b(b(d(d(b(b(x1)))))) -> c(c(d(d(b(b(x1)))))) b(b(a(a(c(c(x1)))))) -> b(b(c(c(x1)))) a(a(d(d(x1)))) -> d(d(c(c(x1)))) b(b(b(b(b(b(x1)))))) -> a(a(b(b(c(c(x1)))))) d(d(c(c(x1)))) -> b(b(d(d(x1)))) d(d(c(c(x1)))) -> d(d(b(b(d(d(x1)))))) d(d(a(a(c(c(x1)))))) -> 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: b(b(d(d(b(b(x1)))))) -> b(b(d(d(c(c(x1)))))) c(c(a(a(b(b(x1)))))) -> c(c(b(b(x1)))) d(d(a(a(x1)))) -> c(c(d(d(x1)))) b(b(b(b(b(b(x1)))))) -> c(c(b(b(a(a(x1)))))) c(c(d(d(x1)))) -> d(d(b(b(x1)))) c(c(d(d(x1)))) -> d(d(b(b(d(d(x1)))))) c(c(a(a(d(d(x1)))))) -> 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: b(b(d(d(b(b(x1)))))) -> b(b(d(d(c(c(x1)))))) popout

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

job log

popout

actions

all output return to SRS Standard