details

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

run statistics

property	value
solver	NTI-TC20-firstrun
configuration	Default 200
runtime (wallclock)	0.953493 seconds
cpu usage	0.345814
user time	0.307793
system time	0.038021
max virtual memory	113188.0
max residence set size	55928.0

stage attributes

key	value
starexec-result	NO

output

NO Prover = TRS(tech=GUIDED_UNF, nb_unfoldings=unlimited, unfold_variables=true, strategy=LEFTMOST_NE) ** BEGIN proof argument ** The following rule was generated while unfolding the analyzed TRS: [iteration = 1] pairNs -> pairNs Let l be the left-hand side and r be the right-hand side of this rule. Let p = epsilon, theta1 = {} and theta2 = {}. We have r|p = pairNs and theta2(theta1(l)) = theta1(r|p). Hence, the term theta1(l) = pairNs loops w.r.t. the analyzed TRS. ** END proof argument ** ** BEGIN proof description ** ## Searching for a generalized rewrite rule (a rule whose right-hand side contains a variable that does not occur in the left-hand side)... No generalized rewrite rule found! ## Searching for a loop by unfolding (unfolding of variable subterms: ON)... # Iteration 0: no loop detected, 11 unfolded rules generated. # Iteration 1: loop detected, 1 unfolded rule generated. Here is the successful unfolding. Let IR be the TRS under analysis. L0 = [pairNs^# -> oddNs^#, oddNs^# -> pairNs^#] is in U_IR^0. We merge the first and the second rule of L0. ==> L1 = pairNs^# -> pairNs^# is in U_IR^1. ** END proof description ** Proof stopped at iteration 1 Number of unfolded rules generated by this proof = 12 Number of unfolded rules generated by all the parallel proofs = 16 popout

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

job log

popout

actions

all output return to TRS Standard