SRS_Standard 2019-03-29 03.29 pair #432292290

details

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

run statistics

property	value
solver	ttt2-1.19
configuration	ttt2
runtime (wallclock)	1.5811 seconds
cpu usage	5.00696
user time	3.88081
system time	1.12616
max virtual memory	3580432.0
max residence set size	67692.0

stage attributes

key	value
starexec-result	YES

output

4.97/1.57	YES
4.97/1.57	
4.97/1.57	Problem:
4.97/1.57	 P(x1) -> Q(Q(p(x1)))
4.97/1.57	 p(p(x1)) -> q(q(x1))
4.97/1.57	 p(Q(Q(x1))) -> Q(Q(p(x1)))
4.97/1.57	 Q(p(q(x1))) -> q(p(Q(x1)))
4.97/1.57	 q(q(p(x1))) -> p(q(q(x1)))
4.97/1.57	 q(Q(x1)) -> x1
4.97/1.57	 Q(q(x1)) -> x1
4.97/1.57	 p(P(x1)) -> x1
4.97/1.57	 P(p(x1)) -> x1
4.97/1.57	
4.97/1.57	Proof:
4.97/1.57	 String Reversal Processor:
4.97/1.57	  P(x1) -> p(Q(Q(x1)))
4.97/1.57	  p(p(x1)) -> q(q(x1))
4.97/1.57	  Q(Q(p(x1))) -> p(Q(Q(x1)))
4.97/1.57	  q(p(Q(x1))) -> Q(p(q(x1)))
4.97/1.57	  p(q(q(x1))) -> q(q(p(x1)))
4.97/1.57	  Q(q(x1)) -> x1
4.97/1.57	  q(Q(x1)) -> x1
4.97/1.57	  P(p(x1)) -> x1
4.97/1.57	  p(P(x1)) -> x1
4.97/1.57	  Matrix Interpretation Processor: dim=1
4.97/1.57	   
4.97/1.57	   interpretation:
4.97/1.57	    [q](x0) = 2x0 + 2,
4.97/1.57	    
4.97/1.57	    [Q](x0) = x0,
4.97/1.57	    
4.97/1.57	    [p](x0) = 4x0 + 6,
4.97/1.57	    
4.97/1.57	    [P](x0) = 4x0 + 6
4.97/1.57	   orientation:
4.97/1.57	    P(x1) = 4x1 + 6 >= 4x1 + 6 = p(Q(Q(x1)))
4.97/1.57	    
4.97/1.57	    p(p(x1)) = 16x1 + 30 >= 4x1 + 6 = q(q(x1))
4.97/1.57	    
4.97/1.57	    Q(Q(p(x1))) = 4x1 + 6 >= 4x1 + 6 = p(Q(Q(x1)))
4.97/1.57	    
4.97/1.57	    q(p(Q(x1))) = 8x1 + 14 >= 8x1 + 14 = Q(p(q(x1)))
4.97/1.57	    
4.97/1.57	    p(q(q(x1))) = 16x1 + 30 >= 16x1 + 30 = q(q(p(x1)))
4.97/1.57	    
4.97/1.57	    Q(q(x1)) = 2x1 + 2 >= x1 = x1
4.97/1.57	    
4.97/1.57	    q(Q(x1)) = 2x1 + 2 >= x1 = x1
4.97/1.57	    
4.97/1.57	    P(p(x1)) = 16x1 + 30 >= x1 = x1
4.97/1.57	    
4.97/1.57	    p(P(x1)) = 16x1 + 30 >= x1 = x1
4.97/1.57	   problem:
4.97/1.57	    P(x1) -> p(Q(Q(x1)))
4.97/1.57	    Q(Q(p(x1))) -> p(Q(Q(x1)))
4.97/1.57	    q(p(Q(x1))) -> Q(p(q(x1)))
4.97/1.57	    p(q(q(x1))) -> q(q(p(x1)))
4.97/1.57	   String Reversal Processor:
4.97/1.57	    P(x1) -> Q(Q(p(x1)))
4.97/1.57	    p(Q(Q(x1))) -> Q(Q(p(x1)))
4.97/1.57	    Q(p(q(x1))) -> q(p(Q(x1)))
4.97/1.57	    q(q(p(x1))) -> p(q(q(x1)))
4.97/1.57	    Bounds Processor:
4.97/1.57	     bound: 0
4.97/1.57	     enrichment: match
4.97/1.57	     automaton:
4.97/1.57	      final states: {8,5,1}
4.97/1.57	      transitions:
4.97/1.57	       f40() -> 2*
4.97/1.57	       Q0(2) -> 6*
4.97/1.57	       Q0(4) -> 1*
4.97/1.57	       Q0(3) -> 4*
4.97/1.57	       p0(10) -> 8*
4.97/1.57	       p0(2) -> 3*
4.97/1.57	       p0(6) -> 7*
4.97/1.57	       q0(7) -> 5*
4.97/1.57	       q0(2) -> 9*
4.97/1.57	       q0(9) -> 10*
4.97/1.57	       1 -> 3,7
4.97/1.57	       5 -> 6,4
4.97/1.57	       8 -> 9,10
4.97/1.57	     problem:
4.97/1.57	      
4.97/1.57	     Qed
4.97/1.58	EOF

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