Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381716637
details
property
value
status
complete
benchmark
PALINDROME_nosorts_noand_iGM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n021.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.9857609272 seconds
cpu usage
4.960933514
max memory
3.0117888E8
stage attributes
key
value
output-size
8086
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/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, 106 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 34 ms] (4) QTRS (5) QTRSRRRProof [EQUIVALENT, 0 ms] (6) QTRS (7) QTRSRRRProof [EQUIVALENT, 2 ms] (8) QTRS (9) QTRSRRRProof [EQUIVALENT, 0 ms] (10) QTRS (11) QTRSRRRProof [EQUIVALENT, 0 ms] (12) QTRS (13) RisEmptyProof [EQUIVALENT, 0 ms] (14) 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(U11(tt)) -> mark(U12(tt)) active(U12(tt)) -> mark(tt) active(isNePal(__(I, __(P, I)))) -> mark(U11(tt)) mark(__(X1, X2)) -> active(__(mark(X1), mark(X2))) mark(nil) -> active(nil) mark(U11(X)) -> active(U11(mark(X))) mark(tt) -> active(tt) mark(U12(X)) -> active(U12(mark(X))) 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) U11(mark(X)) -> U11(X) U11(active(X)) -> U11(X) U12(mark(X)) -> U12(X) U12(active(X)) -> U12(X) isNePal(mark(X)) -> isNePal(X) isNePal(active(X)) -> isNePal(X) Q is empty. ---------------------------------------- (1) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(U11(x_1)) = 2 + x_1 POL(U12(x_1)) = 2*x_1 POL(__(x_1, x_2)) = 2 + x_1 + x_2 POL(active(x_1)) = x_1 POL(isNePal(x_1)) = x_1 POL(mark(x_1)) = x_1 POL(nil) = 0 POL(tt) = 1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: active(__(X, nil)) -> mark(X) active(__(nil, X)) -> mark(X) active(U11(tt)) -> mark(U12(tt)) active(U12(tt)) -> mark(tt) active(isNePal(__(I, __(P, I)))) -> mark(U11(tt)) ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: active(__(__(X, Y), Z)) -> mark(__(X, __(Y, Z))) mark(__(X1, X2)) -> active(__(mark(X1), mark(X2))) mark(nil) -> active(nil) mark(U11(X)) -> active(U11(mark(X))) mark(tt) -> active(tt) mark(U12(X)) -> active(U12(mark(X)))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472