Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516963000
details
property
value
status
complete
benchmark
OvConsOS_nosorts_GM.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
Transformed_CSR_04
run statistics
property
value
solver
AProVE21
configuration
standard
runtime (wallclock)
6.53398799896 seconds
cpu usage
15.094883993
max memory
7.42477824E8
stage attributes
key
value
output-size
28653
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: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished Termination w.r.t. Q of the given QTRS could be disproven: (0) QTRS (1) QTRSRRRProof [EQUIVALENT, 118 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 32 ms] (4) QTRS (5) DependencyPairsProof [EQUIVALENT, 19 ms] (6) QDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) QDP (9) MRRProof [EQUIVALENT, 30 ms] (10) QDP (11) MRRProof [EQUIVALENT, 33 ms] (12) QDP (13) DependencyGraphProof [EQUIVALENT, 0 ms] (14) AND (15) QDP (16) UsableRulesProof [EQUIVALENT, 0 ms] (17) QDP (18) QDPSizeChangeProof [EQUIVALENT, 0 ms] (19) YES (20) QDP (21) TransformationProof [EQUIVALENT, 0 ms] (22) QDP (23) DependencyGraphProof [EQUIVALENT, 0 ms] (24) QDP (25) TransformationProof [EQUIVALENT, 0 ms] (26) QDP (27) DependencyGraphProof [EQUIVALENT, 0 ms] (28) AND (29) QDP (30) UsableRulesProof [EQUIVALENT, 0 ms] (31) QDP (32) TransformationProof [EQUIVALENT, 0 ms] (33) QDP (34) NonTerminationLoopProof [COMPLETE, 0 ms] (35) NO (36) QDP (37) MRRProof [EQUIVALENT, 21 ms] (38) QDP (39) QDPOrderProof [EQUIVALENT, 34 ms] (40) QDP ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a__zeros -> cons(0, zeros) a__and(tt, X) -> mark(X) a__length(nil) -> 0 a__length(cons(N, L)) -> s(a__length(mark(L))) a__take(0, IL) -> nil a__take(s(M), cons(N, IL)) -> cons(mark(N), take(M, IL)) mark(zeros) -> a__zeros mark(and(X1, X2)) -> a__and(mark(X1), X2) mark(length(X)) -> a__length(mark(X)) mark(take(X1, X2)) -> a__take(mark(X1), mark(X2)) mark(cons(X1, X2)) -> cons(mark(X1), X2) mark(0) -> 0 mark(tt) -> tt mark(nil) -> nil mark(s(X)) -> s(mark(X)) a__zeros -> zeros a__and(X1, X2) -> and(X1, X2) a__length(X) -> length(X) a__take(X1, X2) -> take(X1, X2) Q is empty. ---------------------------------------- (1) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(0) = 0 POL(a__and(x_1, x_2)) = x_1 + 2*x_2 POL(a__length(x_1)) = x_1 POL(a__take(x_1, x_2)) = x_1 + 2*x_2 POL(a__zeros) = 0 POL(and(x_1, x_2)) = x_1 + 2*x_2 POL(cons(x_1, x_2)) = x_1 + x_2 POL(length(x_1)) = x_1 POL(mark(x_1)) = x_1
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard