TRS Stand 20472 pair #381711036

details

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

run statistics

property	value
solver	ttt2-1.17+nonreach
configuration	ttt2-1.17+nonreach
runtime (wallclock)	0.629878997803 seconds
cpu usage	1.327994379
max memory	1.74854144E8

stage attributes

key	value
output-size	2388
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


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


YES

Problem:
 -(x,0()) -> x
 -(0(),s(y)) -> 0()
 -(s(x),s(y)) -> -(x,y)
 f(0()) -> 0()
 f(s(x)) -> -(s(x),g(f(x)))
 g(0()) -> s(0())
 g(s(x)) -> -(s(x),f(g(x)))

Proof:
 Matrix Interpretation Processor: dim=1
  
  interpretation:
   [g](x0) = 2x0 + 1,
   
   [f](x0) = 2x0,
   
   [s](x0) = 4x0 + 1,
   
   [-](x0, x1) = x0 + x1,
   
   [0] = 0
  orientation:
   -(x,0()) = x >= x = x
   
   -(0(),s(y)) = 4y + 1 >= 0 = 0()
   
   -(s(x),s(y)) = 4x + 4y + 2 >= x + y = -(x,y)
   
   f(0()) = 0 >= 0 = 0()
   
   f(s(x)) = 8x + 2 >= 8x + 2 = -(s(x),g(f(x)))
   
   g(0()) = 1 >= 1 = s(0())
   
   g(s(x)) = 8x + 3 >= 8x + 3 = -(s(x),f(g(x)))
  problem:
   -(x,0()) -> x
   f(0()) -> 0()
   f(s(x)) -> -(s(x),g(f(x)))
   g(0()) -> s(0())
   g(s(x)) -> -(s(x),f(g(x)))
  Matrix Interpretation Processor: dim=1
   
   interpretation:
    [g](x0) = 4x0 + 4,
    
    [f](x0) = 4x0,
    
    [s](x0) = 7x0 + 4,
    
    [-](x0, x1) = x0 + x1,
    
    [0] = 0
   orientation:
    -(x,0()) = x >= x = x
    
    f(0()) = 0 >= 0 = 0()
    
    f(s(x)) = 28x + 16 >= 23x + 8 = -(s(x),g(f(x)))
    
    g(0()) = 4 >= 4 = s(0())
    
    g(s(x)) = 28x + 20 >= 23x + 20 = -(s(x),f(g(x)))
   problem:
    -(x,0()) -> x
    f(0()) -> 0()
    g(0()) -> s(0())
    g(s(x)) -> -(s(x),f(g(x)))
   Matrix Interpretation Processor: dim=1
    
    interpretation:
     [g](x0) = 2x0 + 4,
     
     [f](x0) = x0,
     
     [s](x0) = 2x0 + 4,
     
     [-](x0, x1) = x0 + x1 + 4,
     
     [0] = 1
    orientation:
     -(x,0()) = x + 5 >= x = x
     
     f(0()) = 1 >= 1 = 0()
     
     g(0()) = 6 >= 6 = s(0())
     
     g(s(x)) = 4x + 12 >= 4x + 12 = -(s(x),f(g(x)))
    problem:
     f(0()) -> 0()
     g(0()) -> s(0())

popout

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

job log

popout

actions all output return to TRS Stand 20472