details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	2.749117136 seconds
cpu usage	7.55575853
max memory	5.52677376E8

stage attributes

key	value
output-size	15759
starexec-result	MAYBE

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished Quasi decreasingness of the given CTRS could not be shown: (0) CTRS (1) CTRSToQTRSProof [SOUND, 0 ms] (2) QTRS (3) DependencyPairsProof [EQUIVALENT, 0 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) QDP (7) UsableRulesProof [EQUIVALENT, 0 ms] (8) QDP (9) MNOCProof [EQUIVALENT, 0 ms] (10) QDP (11) TransformationProof [EQUIVALENT, 0 ms] (12) QDP (13) UsableRulesProof [EQUIVALENT, 0 ms] (14) QDP (15) QReductionProof [EQUIVALENT, 0 ms] (16) QDP (17) TransformationProof [EQUIVALENT, 0 ms] (18) QDP (19) TransformationProof [EQUIVALENT, 0 ms] (20) QDP (21) DependencyGraphProof [EQUIVALENT, 0 ms] (22) QDP (23) TransformationProof [EQUIVALENT, 0 ms] (24) QDP (25) TransformationProof [EQUIVALENT, 0 ms] (26) QDP (27) TransformationProof [EQUIVALENT, 0 ms] (28) QDP (29) TransformationProof [EQUIVALENT, 0 ms] (30) QDP (31) DependencyGraphProof [EQUIVALENT, 0 ms] (32) AND (33) QDP (34) TransformationProof [EQUIVALENT, 0 ms] (35) QDP (36) TransformationProof [EQUIVALENT, 0 ms] (37) QDP (38) NonTerminationLoopProof [COMPLETE, 0 ms] (39) NO (40) QDP (41) TransformationProof [EQUIVALENT, 0 ms] (42) QDP (43) TransformationProof [EQUIVALENT, 0 ms] (44) QDP ---------------------------------------- (0) Obligation: Conditional term rewrite system: The TRS R consists of the following rules: a -> b The conditional TRS C consists of the following conditional rules: f(x', x'') -> h(x, f(x, b)) <= x' -> x, x'' -> x f(g(y'), y'') -> h(y, f(g(y), a)) <= y' -> y, y'' -> y ---------------------------------------- (1) CTRSToQTRSProof (SOUND) The conditional rules have been transormed into unconditional rules according to [CTRS,AAECCNOC]. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(x', x'') -> U1(x', x'') U1(x, x'') -> U2(x'', x) U2(x, x) -> h(x, f(x, b)) f(g(y'), y'') -> U3(y', y'') U3(y, y'') -> U4(y'', y) U4(y, y) -> h(y, f(g(y), a)) a -> b Q is empty. ---------------------------------------- (3) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. popout

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

job log

popout

actions

all output return to TRS Conditional