details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.12167596817 seconds
cpu usage	4.682449298
max memory	3.14908672E8

stage attributes

key	value
output-size	6117
starexec-result	NO

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO 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 disproven: (0) QTRS (1) DependencyPairsProof [EQUIVALENT, 0 ms] (2) QDP (3) DependencyGraphProof [EQUIVALENT, 0 ms] (4) QDP (5) UsableRulesProof [EQUIVALENT, 0 ms] (6) QDP (7) TransformationProof [EQUIVALENT, 0 ms] (8) QDP (9) DependencyGraphProof [EQUIVALENT, 0 ms] (10) QDP (11) UsableRulesProof [EQUIVALENT, 0 ms] (12) QDP (13) QReductionProof [EQUIVALENT, 0 ms] (14) QDP (15) NonTerminationLoopProof [COMPLETE, 4 ms] (16) NO ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: *(X, +(Y, 1)) -> +(*(X, +(Y, *(1, 0))), X) *(X, 1) -> X *(X, 0) -> X *(X, 0) -> 0 The set Q consists of the following terms: *(x0, +(x1, 1)) *(x0, 1) *(x0, 0) ---------------------------------------- (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: *^1(X, +(Y, 1)) -> *^1(X, +(Y, *(1, 0))) *^1(X, +(Y, 1)) -> *^1(1, 0) The TRS R consists of the following rules: *(X, +(Y, 1)) -> +(*(X, +(Y, *(1, 0))), X) *(X, 1) -> X *(X, 0) -> X *(X, 0) -> 0 The set Q consists of the following terms: *(x0, +(x1, 1)) *(x0, 1) *(x0, 0) 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 1 less node. ---------------------------------------- (4) Obligation: Q DP problem: The TRS P consists of the following rules: *^1(X, +(Y, 1)) -> *^1(X, +(Y, *(1, 0))) The TRS R consists of the following rules: *(X, +(Y, 1)) -> +(*(X, +(Y, *(1, 0))), X) *(X, 1) -> X *(X, 0) -> X *(X, 0) -> 0 The set Q consists of the following terms: popout

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

job log

popout

actions

all output return to TRS Innermost