details

property	value
status	complete
benchmark	aabaababaab-aababaababaaba.srs.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n173.star.cs.uiowa.edu
space	Wenzel_16

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	203.352492809 seconds
cpu usage	755.932747191
max memory	1.5890014208E10

stage attributes

key	value
output-size	10681
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: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) DependencyPairsProof [EQUIVALENT, 29 ms] (2) QDP (3) DependencyGraphProof [EQUIVALENT, 1 ms] (4) QDP (5) SemLabProof [SOUND, 169 ms] (6) QDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) AND (9) QDP (10) UsableRulesReductionPairsProof [EQUIVALENT, 0 ms] (11) QDP (12) MRRProof [EQUIVALENT, 0 ms] (13) QDP (14) PisEmptyProof [EQUIVALENT, 0 ms] (15) YES (16) QDP (17) UsableRulesReductionPairsProof [EQUIVALENT, 2 ms] (18) QDP (19) MRRProof [EQUIVALENT, 6 ms] (20) QDP (21) PisEmptyProof [EQUIVALENT, 0 ms] (22) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(a(b(a(a(b(a(b(a(a(b(x1))))))))))) -> a(a(b(a(b(a(a(b(a(b(a(a(b(a(x1)))))))))))))) Q is empty. ---------------------------------------- (1) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. ---------------------------------------- (2) Obligation: Q DP problem: The TRS P consists of the following rules: A(a(b(a(a(b(a(b(a(a(b(x1))))))))))) -> A(a(b(a(b(a(a(b(a(b(a(a(b(a(x1)))))))))))))) A(a(b(a(a(b(a(b(a(a(b(x1))))))))))) -> A(b(a(b(a(a(b(a(b(a(a(b(a(x1))))))))))))) A(a(b(a(a(b(a(b(a(a(b(x1))))))))))) -> A(b(a(a(b(a(b(a(a(b(a(x1))))))))))) A(a(b(a(a(b(a(b(a(a(b(x1))))))))))) -> A(a(b(a(b(a(a(b(a(x1))))))))) A(a(b(a(a(b(a(b(a(a(b(x1))))))))))) -> A(b(a(b(a(a(b(a(x1)))))))) A(a(b(a(a(b(a(b(a(a(b(x1))))))))))) -> A(b(a(a(b(a(x1)))))) A(a(b(a(a(b(a(b(a(a(b(x1))))))))))) -> A(a(b(a(x1)))) A(a(b(a(a(b(a(b(a(a(b(x1))))))))))) -> A(b(a(x1))) A(a(b(a(a(b(a(b(a(a(b(x1))))))))))) -> A(x1) The TRS R consists of the following rules: a(a(b(a(a(b(a(b(a(a(b(x1))))))))))) -> a(a(b(a(b(a(a(b(a(b(a(a(b(a(x1)))))))))))))) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (3) DependencyGraphProof (EQUIVALENT) The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 7 less nodes. ---------------------------------------- (4) Obligation: Q DP problem: The TRS P consists of the following rules: A(a(b(a(a(b(a(b(a(a(b(x1))))))))))) -> A(x1) A(a(b(a(a(b(a(b(a(a(b(x1))))))))))) -> A(a(b(a(x1)))) The TRS R consists of the following rules: a(a(b(a(a(b(a(b(a(a(b(x1))))))))))) -> a(a(b(a(b(a(a(b(a(b(a(a(b(a(x1)))))))))))))) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (5) SemLabProof (SOUND) We found the following model for the rules of the TRSs R and P. popout

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

job log

popout

actions

all output return to SRS Standard