Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381712205
details
property
value
status
complete
benchmark
Ex3_3_25_Bor03.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n084.star.cs.uiowa.edu
space
Strategy_removed_CSR_05
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.48164010048 seconds
cpu usage
5.987416475
max memory
3.95710464E8
stage attributes
key
value
output-size
15050
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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination w.r.t. Q of the given QTRS could be disproven: (0) QTRS (1) Overlay + Local Confluence [EQUIVALENT, 0 ms] (2) QTRS (3) DependencyPairsProof [EQUIVALENT, 18 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) AND (7) QDP (8) UsableRulesProof [EQUIVALENT, 0 ms] (9) QDP (10) QReductionProof [EQUIVALENT, 0 ms] (11) QDP (12) TransformationProof [EQUIVALENT, 0 ms] (13) QDP (14) TransformationProof [EQUIVALENT, 0 ms] (15) QDP (16) NonTerminationLoopProof [COMPLETE, 0 ms] (17) NO (18) QDP (19) UsableRulesProof [EQUIVALENT, 0 ms] (20) QDP (21) QReductionProof [EQUIVALENT, 0 ms] (22) QDP (23) QDPSizeChangeProof [EQUIVALENT, 0 ms] (24) YES (25) QDP (26) UsableRulesProof [EQUIVALENT, 0 ms] (27) QDP (28) QReductionProof [EQUIVALENT, 0 ms] (29) QDP (30) QDPSizeChangeProof [EQUIVALENT, 0 ms] (31) YES (32) QDP (33) UsableRulesProof [EQUIVALENT, 0 ms] (34) QDP (35) QReductionProof [EQUIVALENT, 0 ms] (36) QDP (37) NonTerminationLoopProof [COMPLETE, 0 ms] (38) 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, app(XS, YS)) from(X) -> cons(X, from(s(X))) zWadr(nil, YS) -> nil zWadr(XS, nil) -> nil zWadr(cons(X, XS), cons(Y, YS)) -> cons(app(Y, cons(X, nil)), zWadr(XS, YS)) prefix(L) -> cons(nil, zWadr(L, prefix(L))) Q is empty. ---------------------------------------- (1) Overlay + Local Confluence (EQUIVALENT) The TRS is overlay and locally confluent. By [NOC] we can switch to innermost. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: app(nil, YS) -> YS app(cons(X, XS), YS) -> cons(X, app(XS, YS)) from(X) -> cons(X, from(s(X))) zWadr(nil, YS) -> nil zWadr(XS, nil) -> nil zWadr(cons(X, XS), cons(Y, YS)) -> cons(app(Y, cons(X, nil)), zWadr(XS, YS)) prefix(L) -> cons(nil, zWadr(L, prefix(L))) The set Q consists of the following terms: app(nil, x0) app(cons(x0, x1), x2) from(x0) zWadr(nil, x0) zWadr(x0, nil) zWadr(cons(x0, x1), cons(x2, x3)) prefix(x0)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472