Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Inner 89993 pair #381733755
details
property
value
status
complete
benchmark
PALINDROME_nosorts_iGM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n047.star.cs.uiowa.edu
space
Transformed_CSR_innermost_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.04975795746 seconds
cpu usage
4.99969601
max memory
2.60251648E8
stage attributes
key
value
output-size
10687
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRSRRRProof [EQUIVALENT, 84 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 6 ms] (4) QTRS (5) QTRSRRRProof [EQUIVALENT, 19 ms] (6) QTRS (7) QTRSRRRProof [EQUIVALENT, 23 ms] (8) QTRS (9) QTRSRRRProof [EQUIVALENT, 0 ms] (10) QTRS (11) RisEmptyProof [EQUIVALENT, 0 ms] (12) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: active(__(__(X, Y), Z)) -> mark(__(X, __(Y, Z))) active(__(X, nil)) -> mark(X) active(__(nil, X)) -> mark(X) active(and(tt, X)) -> mark(X) active(isNePal(__(I, __(P, I)))) -> mark(tt) mark(__(X1, X2)) -> active(__(mark(X1), mark(X2))) mark(nil) -> active(nil) mark(and(X1, X2)) -> active(and(mark(X1), X2)) mark(tt) -> active(tt) mark(isNePal(X)) -> active(isNePal(mark(X))) __(mark(X1), X2) -> __(X1, X2) __(X1, mark(X2)) -> __(X1, X2) __(active(X1), X2) -> __(X1, X2) __(X1, active(X2)) -> __(X1, X2) and(mark(X1), X2) -> and(X1, X2) and(X1, mark(X2)) -> and(X1, X2) and(active(X1), X2) -> and(X1, X2) and(X1, active(X2)) -> and(X1, X2) isNePal(mark(X)) -> isNePal(X) isNePal(active(X)) -> isNePal(X) The set Q consists of the following terms: active(__(__(x0, x1), x2)) active(__(x0, nil)) active(__(nil, x0)) active(and(tt, x0)) active(isNePal(__(x0, __(x1, x0)))) mark(__(x0, x1)) mark(nil) mark(and(x0, x1)) mark(tt) mark(isNePal(x0)) __(mark(x0), x1) __(x0, mark(x1)) __(active(x0), x1) __(x0, active(x1)) and(mark(x0), x1) and(x0, mark(x1)) and(active(x0), x1) and(x0, active(x1)) isNePal(mark(x0)) isNePal(active(x0)) ---------------------------------------- (1) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(__(x_1, x_2)) = x_1 + x_2 POL(active(x_1)) = x_1 POL(and(x_1, x_2)) = 1 + x_1 + 2*x_2 POL(isNePal(x_1)) = x_1 POL(mark(x_1)) = x_1 POL(nil) = 0 POL(tt) = 0 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: active(and(tt, X)) -> mark(X)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Inner 89993