details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	20.9303 seconds
cpu usage	60.8144
user time	58.8093
system time	2.0051
max virtual memory	1.8592332E7
max residence set size	4183552.0

stage attributes

key	value
starexec-result	NO

output

NO proof of /export/starexec/sandbox2/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) QDPOrderProof [EQUIVALENT, 126 ms] (6) QDP (7) QDPOrderProof [EQUIVALENT, 104 ms] (8) QDP (9) QDPOrderProof [EQUIVALENT, 99 ms] (10) QDP (11) QDPOrderProof [EQUIVALENT, 100 ms] (12) QDP (13) QDPOrderProof [EQUIVALENT, 48 ms] (14) QDP (15) QDPOrderProof [EQUIVALENT, 125 ms] (16) QDP (17) QDPOrderProof [EQUIVALENT, 32 ms] (18) QDP (19) QDPOrderProof [EQUIVALENT, 19 ms] (20) QDP (21) QDPOrderProof [EQUIVALENT, 49 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) TransformationProof [EQUIVALENT, 0 ms] (32) QDP (33) DependencyGraphProof [EQUIVALENT, 0 ms] (34) QDP (35) TransformationProof [EQUIVALENT, 0 ms] (36) QDP (37) TransformationProof [EQUIVALENT, 0 ms] (38) QDP (39) TransformationProof [EQUIVALENT, 0 ms] (40) QDP (41) TransformationProof [EQUIVALENT, 6 ms] (42) QDP (43) DependencyGraphProof [EQUIVALENT, 0 ms] (44) QDP (45) TransformationProof [EQUIVALENT, 0 ms] (46) QDP (47) DependencyGraphProof [EQUIVALENT, 0 ms] (48) QDP (49) TransformationProof [EQUIVALENT, 30 ms] (50) QDP (51) DependencyGraphProof [EQUIVALENT, 0 ms] (52) QDP (53) TransformationProof [EQUIVALENT, 0 ms] (54) QDP (55) DependencyGraphProof [EQUIVALENT, 0 ms] (56) QDP (57) TransformationProof [EQUIVALENT, 10 ms] (58) QDP (59) DependencyGraphProof [EQUIVALENT, 0 ms] (60) QDP (61) TransformationProof [EQUIVALENT, 42 ms] (62) QDP (63) DependencyGraphProof [EQUIVALENT, 0 ms] (64) QDP (65) QDPOrderProof [EQUIVALENT, 164 ms] (66) QDP (67) QDPOrderProof [EQUIVALENT, 128 ms] (68) QDP (69) NonTerminationLoopProof [COMPLETE, 5754 ms] (70) NO ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: app(nil, YS) -> YS app(cons(X, XS), YS) -> cons(X, n__app(activate(XS), YS)) from(X) -> cons(X, n__from(n__s(X))) zWadr(nil, YS) -> nil zWadr(XS, nil) -> nil zWadr(cons(X, XS), cons(Y, YS)) -> cons(app(Y, cons(X, n__nil)), n__zWadr(activate(XS), activate(YS))) prefix(L) -> cons(nil, n__zWadr(L, n__prefix(L))) app(X1, X2) -> n__app(X1, X2) from(X) -> n__from(X) s(X) -> n__s(X) nil -> n__nil zWadr(X1, X2) -> n__zWadr(X1, X2) prefix(X) -> n__prefix(X) popout

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

job log

popout

actions

all output return to TRS Standard