details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	7.73392009735 seconds
cpu usage	27.206436923
max memory	3.427381248E9

stage attributes

key	value
output-size	10577
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) QTRS Reverse [EQUIVALENT, 0 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 11 ms] (4) QTRS (5) DependencyPairsProof [EQUIVALENT, 31 ms] (6) QDP (7) DependencyGraphProof [EQUIVALENT, 1 ms] (8) AND (9) QDP (10) UsableRulesProof [EQUIVALENT, 2 ms] (11) QDP (12) QDPSizeChangeProof [EQUIVALENT, 0 ms] (13) YES (14) QDP (15) UsableRulesProof [EQUIVALENT, 0 ms] (16) QDP (17) QDPSizeChangeProof [EQUIVALENT, 0 ms] (18) YES (19) QDP (20) MRRProof [EQUIVALENT, 38 ms] (21) QDP (22) QDPOrderProof [EQUIVALENT, 0 ms] (23) QDP (24) DependencyGraphProof [EQUIVALENT, 0 ms] (25) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(f(X)) -> c(n__f(n__g(n__f(X)))) c(X) -> d(activate(X)) h(X) -> c(n__d(X)) f(X) -> n__f(X) g(X) -> n__g(X) d(X) -> n__d(X) activate(n__f(X)) -> f(activate(X)) activate(n__g(X)) -> g(X) activate(n__d(X)) -> d(X) activate(X) -> X Q is empty. ---------------------------------------- (1) QTRS Reverse (EQUIVALENT) We applied the QTRS Reverse Processor [REVERSE]. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(f(X)) -> n__f(n__g(n__f(c(X)))) c(X) -> activate(d(X)) h(X) -> n__d(c(X)) f(X) -> n__f(X) g(X) -> n__g(X) d(X) -> n__d(X) n__f(activate(X)) -> activate(f(X)) n__g(activate(X)) -> g(X) n__d(activate(X)) -> d(X) activate(X) -> X Q is empty. ---------------------------------------- (3) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(activate(x_1)) = x_1 POL(c(x_1)) = x_1 POL(d(x_1)) = x_1 POL(f(x_1)) = x_1 POL(g(x_1)) = x_1 POL(h(x_1)) = 1 + x_1 POL(n__d(x_1)) = x_1 POL(n__f(x_1)) = x_1 POL(n__g(x_1)) = x_1 popout

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

job log

popout

actions

all output return to TRS Stand 20472