TRS Standard pair #516963284

details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	0.46496796608 seconds
cpu usage	0.786165405
max memory	1.40660736E8

stage attributes

key	value
output-size	3270
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_ttt2 /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


YES

Problem:
 2nd(cons(X,n__cons(Y,Z))) -> activate(Y)
 from(X) -> cons(X,n__from(s(X)))
 cons(X1,X2) -> n__cons(X1,X2)
 from(X) -> n__from(X)
 activate(n__cons(X1,X2)) -> cons(X1,X2)
 activate(n__from(X)) -> from(X)
 activate(X) -> X

Proof:
 Matrix Interpretation Processor: dim=1
  
  interpretation:
   [from](x0) = 2x0,
   
   [cons](x0, x1) = x0 + x1,
   
   [activate](x0) = 2x0,
   
   [s](x0) = x0,
   
   [n__cons](x0, x1) = x0 + x1,
   
   [n__from](x0) = x0,
   
   [2nd](x0) = 2x0 + 1
  orientation:
   2nd(cons(X,n__cons(Y,Z))) = 2X + 2Y + 2Z + 1 >= 2Y = activate(Y)
   
   from(X) = 2X >= 2X = cons(X,n__from(s(X)))
   
   cons(X1,X2) = X1 + X2 >= X1 + X2 = n__cons(X1,X2)
   
   from(X) = 2X >= X = n__from(X)
   
   activate(n__cons(X1,X2)) = 2X1 + 2X2 >= X1 + X2 = cons(X1,X2)
   
   activate(n__from(X)) = 2X >= 2X = from(X)
   
   activate(X) = 2X >= X = X
  problem:
   from(X) -> cons(X,n__from(s(X)))
   cons(X1,X2) -> n__cons(X1,X2)
   from(X) -> n__from(X)
   activate(n__cons(X1,X2)) -> cons(X1,X2)
   activate(n__from(X)) -> from(X)
   activate(X) -> X
  Matrix Interpretation Processor: dim=1
   
   interpretation:
    [from](x0) = 5x0 + 7,
    
    [cons](x0, x1) = x0 + x1 + 3,
    
    [activate](x0) = 6x0 + 7,
    
    [s](x0) = x0 + 1,
    
    [n__cons](x0, x1) = x0 + x1 + 3,
    
    [n__from](x0) = 4x0
   orientation:
    from(X) = 5X + 7 >= 5X + 7 = cons(X,n__from(s(X)))
    
    cons(X1,X2) = X1 + X2 + 3 >= X1 + X2 + 3 = n__cons(X1,X2)
    
    from(X) = 5X + 7 >= 4X = n__from(X)
    
    activate(n__cons(X1,X2)) = 6X1 + 6X2 + 25 >= X1 + X2 + 3 = cons(X1,X2)
    
    activate(n__from(X)) = 24X + 7 >= 5X + 7 = from(X)
    
    activate(X) = 6X + 7 >= X = X
   problem:
    from(X) -> cons(X,n__from(s(X)))
    cons(X1,X2) -> n__cons(X1,X2)
    activate(n__from(X)) -> from(X)
   Matrix Interpretation Processor: dim=1
    
    interpretation:
     [from](x0) = 4x0 + 4,
     
     [cons](x0, x1) = 2x0 + 2x1,
     
     [activate](x0) = 5x0 + 3,
     
     [s](x0) = x0,
     
     [n__cons](x0, x1) = x0 + x1,
     
     [n__from](x0) = x0 + 1
    orientation:

popout

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

job log

popout

actions all output return to TRS Standard