Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Inner 89993 pair #381733484
details
property
value
status
complete
benchmark
PEANO_nosorts_noand_iGM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n087.star.cs.uiowa.edu
space
Transformed_CSR_innermost_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.21624994278 seconds
cpu usage
5.997905208
max memory
3.86502656E8
stage attributes
key
value
output-size
18061
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, 112 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 31 ms] (4) QTRS (5) QTRSRRRProof [EQUIVALENT, 18 ms] (6) QTRS (7) QTRSRRRProof [EQUIVALENT, 20 ms] (8) QTRS (9) QTRSRRRProof [EQUIVALENT, 18 ms] (10) QTRS (11) QTRSRRRProof [EQUIVALENT, 0 ms] (12) QTRS (13) QTRSRRRProof [EQUIVALENT, 6 ms] (14) QTRS (15) RisEmptyProof [EQUIVALENT, 0 ms] (16) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: active(U11(tt, M, N)) -> mark(U12(tt, M, N)) active(U12(tt, M, N)) -> mark(s(plus(N, M))) active(plus(N, 0)) -> mark(N) active(plus(N, s(M))) -> mark(U11(tt, M, N)) mark(U11(X1, X2, X3)) -> active(U11(mark(X1), X2, X3)) mark(tt) -> active(tt) mark(U12(X1, X2, X3)) -> active(U12(mark(X1), X2, X3)) mark(s(X)) -> active(s(mark(X))) mark(plus(X1, X2)) -> active(plus(mark(X1), mark(X2))) mark(0) -> active(0) U11(mark(X1), X2, X3) -> U11(X1, X2, X3) U11(X1, mark(X2), X3) -> U11(X1, X2, X3) U11(X1, X2, mark(X3)) -> U11(X1, X2, X3) U11(active(X1), X2, X3) -> U11(X1, X2, X3) U11(X1, active(X2), X3) -> U11(X1, X2, X3) U11(X1, X2, active(X3)) -> U11(X1, X2, X3) U12(mark(X1), X2, X3) -> U12(X1, X2, X3) U12(X1, mark(X2), X3) -> U12(X1, X2, X3) U12(X1, X2, mark(X3)) -> U12(X1, X2, X3) U12(active(X1), X2, X3) -> U12(X1, X2, X3) U12(X1, active(X2), X3) -> U12(X1, X2, X3) U12(X1, X2, active(X3)) -> U12(X1, X2, X3) s(mark(X)) -> s(X) s(active(X)) -> s(X) plus(mark(X1), X2) -> plus(X1, X2) plus(X1, mark(X2)) -> plus(X1, X2) plus(active(X1), X2) -> plus(X1, X2) plus(X1, active(X2)) -> plus(X1, X2) The set Q consists of the following terms: active(U11(tt, x0, x1)) active(U12(tt, x0, x1)) active(plus(x0, 0)) active(plus(x0, s(x1))) mark(U11(x0, x1, x2)) mark(tt) mark(U12(x0, x1, x2)) mark(s(x0)) mark(plus(x0, x1)) mark(0) U11(mark(x0), x1, x2) U11(x0, mark(x1), x2) U11(x0, x1, mark(x2)) U11(active(x0), x1, x2) U11(x0, active(x1), x2) U11(x0, x1, active(x2)) U12(mark(x0), x1, x2) U12(x0, mark(x1), x2) U12(x0, x1, mark(x2)) U12(active(x0), x1, x2) U12(x0, active(x1), x2) U12(x0, x1, active(x2)) s(mark(x0)) s(active(x0)) plus(mark(x0), x1) plus(x0, mark(x1)) plus(active(x0), x1) plus(x0, active(x1))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Inner 89993