details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	9.92880296707 seconds
cpu usage	35.462828744
max memory	5.070340096E9

stage attributes

key	value
output-size	9953
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) DependencyPairsProof [EQUIVALENT, 52 ms] (2) QDP (3) DependencyGraphProof [EQUIVALENT, 1 ms] (4) AND (5) QDP (6) UsableRulesProof [EQUIVALENT, 0 ms] (7) QDP (8) QDPSizeChangeProof [EQUIVALENT, 0 ms] (9) YES (10) QDP (11) MNOCProof [EQUIVALENT, 0 ms] (12) QDP (13) UsableRulesProof [EQUIVALENT, 0 ms] (14) QDP (15) QDPOrderProof [EQUIVALENT, 324 ms] (16) QDP (17) DependencyGraphProof [EQUIVALENT, 0 ms] (18) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: foo(0(x1)) -> 0(s(p(p(p(s(s(s(p(s(x1)))))))))) foo(s(x1)) -> p(s(p(p(p(s(s(p(s(s(p(s(foo(p(p(s(s(p(s(bar(p(p(s(s(p(s(x1)))))))))))))))))))))))))) bar(0(x1)) -> 0(p(s(s(s(x1))))) bar(s(x1)) -> p(s(p(p(s(s(foo(s(p(p(s(s(x1)))))))))))) p(p(s(x1))) -> p(x1) p(s(x1)) -> x1 p(0(x1)) -> 0(s(s(s(s(x1))))) 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: FOO(0(x1)) -> P(p(p(s(s(s(p(s(x1)))))))) FOO(0(x1)) -> P(p(s(s(s(p(s(x1))))))) FOO(0(x1)) -> P(s(s(s(p(s(x1)))))) FOO(0(x1)) -> P(s(x1)) FOO(s(x1)) -> P(s(p(p(p(s(s(p(s(s(p(s(foo(p(p(s(s(p(s(bar(p(p(s(s(p(s(x1)))))))))))))))))))))))))) FOO(s(x1)) -> P(p(p(s(s(p(s(s(p(s(foo(p(p(s(s(p(s(bar(p(p(s(s(p(s(x1)))))))))))))))))))))))) FOO(s(x1)) -> P(p(s(s(p(s(s(p(s(foo(p(p(s(s(p(s(bar(p(p(s(s(p(s(x1))))))))))))))))))))))) FOO(s(x1)) -> P(s(s(p(s(s(p(s(foo(p(p(s(s(p(s(bar(p(p(s(s(p(s(x1)))))))))))))))))))))) FOO(s(x1)) -> P(s(s(p(s(foo(p(p(s(s(p(s(bar(p(p(s(s(p(s(x1))))))))))))))))))) FOO(s(x1)) -> P(s(foo(p(p(s(s(p(s(bar(p(p(s(s(p(s(x1)))))))))))))))) FOO(s(x1)) -> FOO(p(p(s(s(p(s(bar(p(p(s(s(p(s(x1)))))))))))))) FOO(s(x1)) -> P(p(s(s(p(s(bar(p(p(s(s(p(s(x1))))))))))))) FOO(s(x1)) -> P(s(s(p(s(bar(p(p(s(s(p(s(x1)))))))))))) FOO(s(x1)) -> P(s(bar(p(p(s(s(p(s(x1))))))))) FOO(s(x1)) -> BAR(p(p(s(s(p(s(x1))))))) FOO(s(x1)) -> P(p(s(s(p(s(x1)))))) FOO(s(x1)) -> P(s(s(p(s(x1))))) FOO(s(x1)) -> P(s(x1)) BAR(0(x1)) -> P(s(s(s(x1)))) BAR(s(x1)) -> P(s(p(p(s(s(foo(s(p(p(s(s(x1)))))))))))) BAR(s(x1)) -> P(p(s(s(foo(s(p(p(s(s(x1)))))))))) BAR(s(x1)) -> P(s(s(foo(s(p(p(s(s(x1))))))))) BAR(s(x1)) -> FOO(s(p(p(s(s(x1)))))) BAR(s(x1)) -> P(p(s(s(x1)))) BAR(s(x1)) -> P(s(s(x1))) P(p(s(x1))) -> P(x1) The TRS R consists of the following rules: foo(0(x1)) -> 0(s(p(p(p(s(s(s(p(s(x1)))))))))) foo(s(x1)) -> p(s(p(p(p(s(s(p(s(s(p(s(foo(p(p(s(s(p(s(bar(p(p(s(s(p(s(x1)))))))))))))))))))))))))) bar(0(x1)) -> 0(p(s(s(s(x1))))) bar(s(x1)) -> p(s(p(p(s(s(foo(s(p(p(s(s(x1)))))))))))) p(p(s(x1))) -> p(x1) p(s(x1)) -> x1 p(0(x1)) -> 0(s(s(s(s(x1))))) Q is empty. popout

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

job log

popout

actions

all output return to SRS Stand 10685