details

property	value
status	complete
benchmark	enger-nonloop-isTrueList.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n143.star.cs.uiowa.edu
space	EEG_IJCAR_12

run statistics

property	value
solver	AProVE23
configuration	standard
runtime (wallclock)	11.7288529873 seconds
cpu usage	29.951869331
max memory	8.17012736E8

stage attributes

key	value
output-size	7755
starexec-result	"NO"

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 363435ff5b19173ec8a83b45cfdec073678dabcc jan-christoph 20230815 unpublished Termination w.r.t. Q of the given QTRS could be disproven: (0) QTRS (1) AAECC Innermost [EQUIVALENT, 0 ms] (2) QTRS (3) DependencyPairsProof [EQUIVALENT, 0 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) AND (7) QDP (8) UsableRulesProof [EQUIVALENT, 0 ms] (9) QDP (10) QReductionProof [EQUIVALENT, 0 ms] (11) QDP (12) QDPSizeChangeProof [EQUIVALENT, 0 ms] (13) YES (14) QDP (15) MNOCProof [EQUIVALENT, 0 ms] (16) QDP (17) NonLoopProof [COMPLETE, 0 ms] (18) NO ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(tt, x) -> f(isList(x), Cons(tt, x)) isList(Cons(tt, xs)) -> isList(xs) isList(nil) -> tt Q is empty. ---------------------------------------- (1) AAECC Innermost (EQUIVALENT) We have applied [NOC,AAECCNOC] to switch to innermost. The TRS R 1 is isList(Cons(tt, xs)) -> isList(xs) isList(nil) -> tt The TRS R 2 is f(tt, x) -> f(isList(x), Cons(tt, x)) The signature Sigma is {f_2} ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(tt, x) -> f(isList(x), Cons(tt, x)) isList(Cons(tt, xs)) -> isList(xs) isList(nil) -> tt The set Q consists of the following terms: f(tt, x0) isList(Cons(tt, x0)) isList(nil) ---------------------------------------- (3) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. ---------------------------------------- (4) Obligation: Q DP problem: The TRS P consists of the following rules: F(tt, x) -> F(isList(x), Cons(tt, x)) F(tt, x) -> ISLIST(x) ISLIST(Cons(tt, xs)) -> ISLIST(xs) The TRS R consists of the following rules: f(tt, x) -> f(isList(x), Cons(tt, x)) isList(Cons(tt, xs)) -> isList(xs) isList(nil) -> tt The set Q consists of the following terms: f(tt, x0) popout

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

job log

popout

actions

all output return to TRS Standard