details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	12.0213060379 seconds
cpu usage	36.974282358
max memory	1.862893568E9

stage attributes

key	value
output-size	7953
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: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRSRRRProof [EQUIVALENT, 87 ms] (2) QTRS (3) DependencyPairsProof [EQUIVALENT, 36 ms] (4) QDP (5) QDPOrderProof [EQUIVALENT, 242 ms] (6) QDP (7) QDPOrderProof [EQUIVALENT, 21 ms] (8) QDP (9) MRRProof [EQUIVALENT, 15 ms] (10) QDP (11) PisEmptyProof [EQUIVALENT, 0 ms] (12) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: 0(0(*(*(x1)))) -> *(*(1(1(x1)))) 1(1(*(*(x1)))) -> 0(0(#(#(x1)))) #(#(0(0(x1)))) -> 0(0(#(#(x1)))) #(#(1(1(x1)))) -> 1(1(#(#(x1)))) #(#($($(x1)))) -> *(*($($(x1)))) #(#(#(#(x1)))) -> #(#(x1)) #(#(*(*(x1)))) -> *(*(x1)) Q is empty. ---------------------------------------- (1) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(#(x_1)) = 1 + x_1 POL($(x_1)) = x_1 POL(*(x_1)) = 1 + x_1 POL(0(x_1)) = x_1 POL(1(x_1)) = x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: #(#(#(#(x1)))) -> #(#(x1)) #(#(*(*(x1)))) -> *(*(x1)) ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: 0(0(*(*(x1)))) -> *(*(1(1(x1)))) 1(1(*(*(x1)))) -> 0(0(#(#(x1)))) #(#(0(0(x1)))) -> 0(0(#(#(x1)))) #(#(1(1(x1)))) -> 1(1(#(#(x1)))) #(#($($(x1)))) -> *(*($($(x1)))) Q is empty. ---------------------------------------- (3) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. ---------------------------------------- (4) Obligation: Q DP problem: The TRS P consists of the following rules: 0^1(0(*(*(x1)))) -> 1^1(1(x1)) 0^1(0(*(*(x1)))) -> 1^1(x1) 1^1(1(*(*(x1)))) -> 0^1(0(#(#(x1)))) 1^1(1(*(*(x1)))) -> 0^1(#(#(x1))) 1^1(1(*(*(x1)))) -> #^1(#(x1)) 1^1(1(*(*(x1)))) -> #^1(x1) #^1(#(0(0(x1)))) -> 0^1(0(#(#(x1)))) #^1(#(0(0(x1)))) -> 0^1(#(#(x1))) #^1(#(0(0(x1)))) -> #^1(#(x1)) #^1(#(0(0(x1)))) -> #^1(x1) popout

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

job log

popout

actions

all output return to SRS Standard