details

property	value
status	complete
benchmark	Applicative_first_order_05__13.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n036.star.cs.uiowa.edu
space	Uncurried_Applicative_11

run statistics

property	value
solver	sol 37957
configuration	hrs
runtime (wallclock)	15.2772459984 seconds
cpu usage	27.456062254
max memory	3.870183424E9

stage attributes

key	value
output-size	21120
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_hrs /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES We split firstr-order part and higher-order part, and do modular checking by a general modularity. ******** FO SN check ******** Check SN using AProVE (RWTH Aachen University) proof of tmp48717.trs # AProVE Commit ID: 240871ee8d33536d563834eff18151406a8bc3fe ffrohn 20170821 unpublished Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) DependencyPairsProof [EQUIVALENT, 0 ms] (2) QDP (3) DependencyGraphProof [EQUIVALENT, 3 ms] (4) AND (5) QDP (6) UsableRulesProof [EQUIVALENT, 0 ms] (7) QDP (8) QDPSizeChangeProof [EQUIVALENT, 0 ms] (9) YES (10) QDP (11) QDPOrderProof [EQUIVALENT, 21 ms] (12) QDP (13) QDPSizeChangeProof [EQUIVALENT, 0 ms] (14) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: xbtimes(X, xbplus(Y, U)) -> xbplus(xbtimes(X, Y), xbtimes(X, U)) xbtimes(xbplus(W, P), V) -> xbplus(xbtimes(V, W), xbtimes(V, P)) xbtimes(xbtimes(X1, Y1), U1) -> xbtimes(X1, xbtimes(Y1, U1)) xbplus(xbplus(V1, W1), P1) -> xbplus(V1, xbplus(W1, P1)) _(X1, X2) -> X1 _(X1, X2) -> X2 Q is empty. ---------------------------------------- (1) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. ---------------------------------------- (2) Obligation: Q DP problem: The TRS P consists of the following rules: XBTIMES(X, xbplus(Y, U)) -> XBPLUS(xbtimes(X, Y), xbtimes(X, U)) XBTIMES(X, xbplus(Y, U)) -> XBTIMES(X, Y) XBTIMES(X, xbplus(Y, U)) -> XBTIMES(X, U) XBTIMES(xbplus(W, P), V) -> XBPLUS(xbtimes(V, W), xbtimes(V, P)) XBTIMES(xbplus(W, P), V) -> XBTIMES(V, W) XBTIMES(xbplus(W, P), V) -> XBTIMES(V, P) XBTIMES(xbtimes(X1, Y1), U1) -> XBTIMES(X1, xbtimes(Y1, U1)) XBTIMES(xbtimes(X1, Y1), U1) -> XBTIMES(Y1, U1) XBPLUS(xbplus(V1, W1), P1) -> XBPLUS(V1, xbplus(W1, P1)) XBPLUS(xbplus(V1, W1), P1) -> XBPLUS(W1, P1) The TRS R consists of the following rules: xbtimes(X, xbplus(Y, U)) -> xbplus(xbtimes(X, Y), xbtimes(X, U)) xbtimes(xbplus(W, P), V) -> xbplus(xbtimes(V, W), xbtimes(V, P)) xbtimes(xbtimes(X1, Y1), U1) -> xbtimes(X1, xbtimes(Y1, U1)) xbplus(xbplus(V1, W1), P1) -> xbplus(V1, xbplus(W1, P1)) _(X1, X2) -> X1 _(X1, X2) -> X2 Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (3) DependencyGraphProof (EQUIVALENT) The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 2 SCCs with 2 less nodes. ---------------------------------------- (4) Complex Obligation (AND) ---------------------------------------- (5) Obligation: Q DP problem: The TRS P consists of the following rules: popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to HRS 58631