details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	9.6818 seconds
cpu usage	20.2756
user time	19.4782
system time	0.797473
max virtual memory	8.374804E7
max residence set size	2291004.0

stage attributes

key	value
starexec-result	YES

output

19.86/6.06 YES 19.97/6.06 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 19.97/6.06 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 19.97/6.06 19.97/6.06 19.97/6.06 Termination w.r.t. Q of the given QTRS could be proven: 19.97/6.06 19.97/6.06 (0) QTRS 19.97/6.06 (1) QTRS Reverse [EQUIVALENT, 0 ms] 19.97/6.06 (2) QTRS 19.97/6.06 (3) QTRSRRRProof [EQUIVALENT, 16 ms] 19.97/6.06 (4) QTRS 19.97/6.06 (5) DependencyPairsProof [EQUIVALENT, 9 ms] 19.97/6.06 (6) QDP 19.97/6.06 (7) DependencyGraphProof [EQUIVALENT, 0 ms] 19.97/6.06 (8) AND 19.97/6.06 (9) QDP 19.97/6.06 (10) UsableRulesProof [EQUIVALENT, 0 ms] 19.97/6.06 (11) QDP 19.97/6.06 (12) QDPSizeChangeProof [EQUIVALENT, 0 ms] 19.97/6.06 (13) YES 19.97/6.06 (14) QDP 19.97/6.06 (15) UsableRulesProof [EQUIVALENT, 0 ms] 19.97/6.06 (16) QDP 19.97/6.06 (17) QDPSizeChangeProof [EQUIVALENT, 0 ms] 19.97/6.06 (18) YES 19.97/6.06 (19) QDP 19.97/6.06 (20) UsableRulesProof [EQUIVALENT, 0 ms] 19.97/6.06 (21) QDP 19.97/6.06 (22) QDPSizeChangeProof [EQUIVALENT, 0 ms] 19.97/6.06 (23) YES 19.97/6.06 (24) QDP 19.97/6.06 (25) UsableRulesProof [EQUIVALENT, 0 ms] 19.97/6.06 (26) QDP 19.97/6.06 (27) QDPOrderProof [EQUIVALENT, 0 ms] 19.97/6.06 (28) QDP 19.97/6.06 (29) PisEmptyProof [EQUIVALENT, 0 ms] 19.97/6.06 (30) YES 19.97/6.06 19.97/6.06 19.97/6.06 ---------------------------------------- 19.97/6.06 19.97/6.06 (0) 19.97/6.06 Obligation: 19.97/6.06 Q restricted rewrite system: 19.97/6.06 The TRS R consists of the following rules: 19.97/6.06 19.97/6.06 t(f(x1)) -> t(c(n(x1))) 19.97/6.06 n(f(x1)) -> f(n(x1)) 19.97/6.06 o(f(x1)) -> f(o(x1)) 19.97/6.06 n(s(x1)) -> f(s(x1)) 19.97/6.06 o(s(x1)) -> f(s(x1)) 19.97/6.06 c(f(x1)) -> f(c(x1)) 19.97/6.06 c(n(x1)) -> n(c(x1)) 19.97/6.06 c(o(x1)) -> o(c(x1)) 19.97/6.06 c(o(x1)) -> o(x1) 19.97/6.06 19.97/6.06 Q is empty. 19.97/6.06 19.97/6.06 ---------------------------------------- 19.97/6.06 19.97/6.06 (1) QTRS Reverse (EQUIVALENT) 19.97/6.06 We applied the QTRS Reverse Processor [REVERSE]. 19.97/6.06 ---------------------------------------- 19.97/6.06 19.97/6.06 (2) 19.97/6.06 Obligation: 19.97/6.06 Q restricted rewrite system: 19.97/6.06 The TRS R consists of the following rules: 19.97/6.06 19.97/6.06 f(t(x1)) -> n(c(t(x1))) 19.97/6.06 f(n(x1)) -> n(f(x1)) 19.97/6.06 f(o(x1)) -> o(f(x1)) 19.97/6.06 s(n(x1)) -> s(f(x1)) 19.97/6.06 s(o(x1)) -> s(f(x1)) 19.97/6.06 f(c(x1)) -> c(f(x1)) 19.97/6.06 n(c(x1)) -> c(n(x1)) 19.97/6.06 o(c(x1)) -> c(o(x1)) 19.97/6.06 o(c(x1)) -> o(x1) 19.97/6.06 19.97/6.06 Q is empty. 19.97/6.06 19.97/6.06 ---------------------------------------- 19.97/6.06 19.97/6.06 (3) QTRSRRRProof (EQUIVALENT) 19.97/6.06 Used ordering: 19.97/6.06 Polynomial interpretation [POLO]: 19.97/6.06 19.97/6.06 POL(c(x_1)) = x_1 19.97/6.06 POL(f(x_1)) = x_1 19.97/6.06 POL(n(x_1)) = x_1 19.97/6.06 POL(o(x_1)) = 1 + x_1 19.97/6.06 POL(s(x_1)) = x_1 19.97/6.06 POL(t(x_1)) = x_1 19.97/6.06 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: 19.97/6.06 19.97/6.06 s(o(x1)) -> s(f(x1)) 19.97/6.06 19.97/6.06 19.97/6.06 popout

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

job log

popout

actions

all output return to SRS_Standard 2019-03-29 03.29