↑ Up

Bliksem---1.12.SAT-Sat.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Bliksem---1.12
% Problem  : HWV034-2 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : bliksem %s

% Computer : n004.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 0s
% DateTime : Sat Jul 16 13:11:57 EDT 2022

% Result   : Satisfiable 0.49s 1.12s
% Output   : Saturation 0.49s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : HWV034-2 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.07/0.14  % Command  : bliksem %s
% 0.14/0.36  % Computer : n004.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % DateTime : Fri Jun 17 05:05:53 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 0.49/1.12  *** allocated 10000 integers for termspace/termends
% 0.49/1.12  *** allocated 10000 integers for clauses
% 0.49/1.12  *** allocated 10000 integers for justifications
% 0.49/1.12  Bliksem 1.12
% 0.49/1.12  
% 0.49/1.12  
% 0.49/1.12  Automatic Strategy Selection
% 0.49/1.12  
% 0.49/1.12  Clauses:
% 0.49/1.12  [
% 0.49/1.12     [ ~( connection( X, Y ) ), ~( zero( X ) ), zero( Y ) ],
% 0.49/1.12     [ ~( connection( X, Y ) ), ~( one( X ) ), one( Y ) ],
% 0.49/1.12     [ ~( connection( X, Y ) ), ~( zero( Y ) ), zero( X ) ],
% 0.49/1.12     [ ~( connection( X, Y ) ), ~( one( Y ) ), one( X ) ],
% 0.49/1.12     [ ~( zero( X ) ), ~( one( X ) ) ],
% 0.49/1.12     [ ~( 'and_ok'( X ) ), ~( zero( in1( X ) ) ), zero( out1( X ) ) ],
% 0.49/1.12     [ ~( 'and_ok'( X ) ), ~( zero( in2( X ) ) ), zero( out1( X ) ) ],
% 0.49/1.12     [ ~( 'and_ok'( X ) ), ~( one( in1( X ) ) ), ~( one( in2( X ) ) ), one( 
% 0.49/1.12    out1( X ) ) ],
% 0.49/1.12     [ ~( 'and_ok'( X ) ), ~( zero( out1( X ) ) ), zero( in1( X ) ), zero( 
% 0.49/1.12    in2( X ) ) ],
% 0.49/1.12     [ ~( 'and_ok'( X ) ), ~( one( out1( X ) ) ), one( in1( X ) ) ],
% 0.49/1.12     [ ~( 'and_ok'( X ) ), ~( one( out1( X ) ) ), one( in2( X ) ) ],
% 0.49/1.12     [ ~( 'and_ok'( X ) ), ~( abnormal( X ) ) ],
% 0.49/1.12     [ ~( 'logic_and'( X ) ), 'and_ok'( X ), abnormal( X ) ],
% 0.49/1.12     [ ~( 'or_ok'( X ) ), ~( one( in1( X ) ) ), one( out1( X ) ) ],
% 0.49/1.12     [ ~( 'or_ok'( X ) ), ~( one( in2( X ) ) ), one( out1( X ) ) ],
% 0.49/1.12     [ ~( 'or_ok'( X ) ), ~( zero( in1( X ) ) ), ~( zero( in2( X ) ) ), zero( 
% 0.49/1.12    out1( X ) ) ],
% 0.49/1.12     [ ~( 'or_ok'( X ) ), ~( one( out1( X ) ) ), one( in1( X ) ), one( in2( X
% 0.49/1.12     ) ) ],
% 0.49/1.12     [ ~( 'or_ok'( X ) ), ~( zero( out1( X ) ) ), zero( in1( X ) ) ],
% 0.49/1.12     [ ~( 'or_ok'( X ) ), ~( zero( out1( X ) ) ), zero( in2( X ) ) ],
% 0.49/1.12     [ ~( 'or_ok'( X ) ), ~( abnormal( X ) ) ],
% 0.49/1.12     [ ~( 'logic_or'( X ) ), 'or_ok'( X ), abnormal( X ) ],
% 0.49/1.12     [ ~( 'not_ok'( X ) ), ~( zero( in1( X ) ) ), one( out1( X ) ) ],
% 0.49/1.12     [ ~( 'not_ok'( X ) ), ~( one( in1( X ) ) ), zero( out1( X ) ) ],
% 0.49/1.12     [ ~( 'not_ok'( X ) ), ~( zero( out1( X ) ) ), one( in1( X ) ) ],
% 0.49/1.12     [ ~( 'not_ok'( X ) ), ~( one( out1( X ) ) ), zero( in1( X ) ) ],
% 0.49/1.12     [ ~( 'not_ok'( X ) ), ~( abnormal( X ) ) ],
% 0.49/1.12     [ ~( 'logic_not'( X ) ), 'not_ok'( X ), abnormal( X ) ]
% 0.49/1.12  ] .
% 0.49/1.12  
% 0.49/1.12  
% 0.49/1.12  percentage equality = 0.000000, percentage horn = 0.814815
% 0.49/1.12  This a non-horn, non-equality problem
% 0.49/1.12  
% 0.49/1.12  
% 0.49/1.12  Options Used:
% 0.49/1.12  
% 0.49/1.12  useres =            1
% 0.49/1.12  useparamod =        0
% 0.49/1.12  useeqrefl =         0
% 0.49/1.12  useeqfact =         0
% 0.49/1.12  usefactor =         1
% 0.49/1.12  usesimpsplitting =  0
% 0.49/1.12  usesimpdemod =      0
% 0.49/1.12  usesimpres =        3
% 0.49/1.12  
% 0.49/1.12  resimpinuse      =  1000
% 0.49/1.12  resimpclauses =     20000
% 0.49/1.12  substype =          standard
% 0.49/1.12  backwardsubs =      1
% 0.49/1.12  selectoldest =      5
% 0.49/1.12  
% 0.49/1.12  litorderings [0] =  split
% 0.49/1.12  litorderings [1] =  liftord
% 0.49/1.12  
% 0.49/1.12  termordering =      none
% 0.49/1.12  
% 0.49/1.12  litapriori =        1
% 0.49/1.12  termapriori =       0
% 0.49/1.12  litaposteriori =    0
% 0.49/1.12  termaposteriori =   0
% 0.49/1.12  demodaposteriori =  0
% 0.49/1.12  ordereqreflfact =   0
% 0.49/1.12  
% 0.49/1.12  litselect =         none
% 0.49/1.12  
% 0.49/1.12  maxweight =         15
% 0.49/1.12  maxdepth =          30000
% 0.49/1.12  maxlength =         115
% 0.49/1.12  maxnrvars =         195
% 0.49/1.12  excuselevel =       1
% 0.49/1.12  increasemaxweight = 1
% 0.49/1.12  
% 0.49/1.12  maxselected =       10000000
% 0.49/1.12  maxnrclauses =      10000000
% 0.49/1.12  
% 0.49/1.12  showgenerated =    0
% 0.49/1.12  showkept =         0
% 0.49/1.12  showselected =     0
% 0.49/1.12  showdeleted =      0
% 0.49/1.12  showresimp =       1
% 0.49/1.12  showstatus =       2000
% 0.49/1.12  
% 0.49/1.12  prologoutput =     1
% 0.49/1.12  nrgoals =          5000000
% 0.49/1.12  totalproof =       1
% 0.49/1.12  
% 0.49/1.12  Symbols occurring in the translation:
% 0.49/1.12  
% 0.49/1.12  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 0.49/1.12  .  [1, 2]      (w:1, o:30, a:1, s:1, b:0), 
% 0.49/1.12  !  [4, 1]      (w:0, o:13, a:1, s:1, b:0), 
% 0.49/1.12  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.49/1.12  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.49/1.12  connection  [41, 2]      (w:1, o:55, a:1, s:1, b:0), 
% 0.49/1.12  zero  [42, 1]      (w:1, o:18, a:1, s:1, b:0), 
% 0.49/1.12  one  [43, 1]      (w:1, o:20, a:1, s:1, b:0), 
% 0.49/1.12  'and_ok'  [46, 1]      (w:1, o:21, a:1, s:1, b:0), 
% 0.49/1.12  in1  [47, 1]      (w:1, o:22, a:1, s:1, b:0), 
% 0.49/1.12  out1  [48, 1]      (w:1, o:23, a:1, s:1, b:0), 
% 0.49/1.12  in2  [49, 1]      (w:1, o:24, a:1, s:1, b:0), 
% 0.49/1.12  abnormal  [50, 1]      (w:1, o:25, a:1, s:1, b:0), 
% 0.49/1.12  'logic_and'  [51, 1]      (w:1, o:26, a:1, s:1, b:0), 
% 0.49/1.12  'or_ok'  [52, 1]      (w:1, o:27, a:1, s:1, b:0), 
% 0.49/1.12  'logic_or'  [53, 1]      (w:1, o:29, a:1, s:1, b:0), 
% 0.49/1.12  'not_ok'  [54, 1]      (w:1, o:19, a:1, s:1, b:0), 
% 0.49/1.12  'logic_not'  [55, 1]      (w:1, o:28, a:1, s:1, b:0).
% 0.49/1.12  
% 0.49/1.12  
% 0.49/1.12  Starting Search:
% 0.49/1.12  
% 0.49/1.12  Resimplifying inuse:
% 0.49/1.12  Done
% 0.49/1.12  
% 0.49/1.12  
% 0.49/1.12  
% 0.49/1.12  found a saturation!
% 0.49/1.12  % SZS status Satisfiable
% 0.49/1.12  % SZS output start Saturation
% 0.49/1.12  
% 0.49/1.12  clause( 8, [ ~( zero( out1( X ) ) ), zero( in1( X ) ), zero( in2( X ) ), 
% 0.49/1.12    ~( 'and_ok'( X ) ) ] )
% 0.49/1.12  .
% 0.49/1.12  clause( 15, [ ~( zero( in1( X ) ) ), ~( zero( in2( X ) ) ), zero( out1( X )
% 0.49/1.12     ), ~( 'or_ok'( X ) ) ] )
% 0.49/1.12  .
% 0.49/1.12  clause( 7, [ ~( one( in1( X ) ) ), ~( one( in2( X ) ) ), one( out1( X ) ), 
% 0.49/1.12    ~( 'and_ok'( X ) ) ] )
% 0.49/1.12  .
% 0.49/1.12  clause( 16, [ ~( one( out1( X ) ) ), one( in1( X ) ), one( in2( X ) ), ~( 
% 0.49/1.12    'or_ok'( X ) ) ] )
% 0.49/1.12  .
% 0.49/1.12  clause( 9, [ ~( one( out1( X ) ) ), one( in1( X ) ), ~( 'and_ok'( X ) ) ]
% 0.49/1.12     )
% 0.49/1.12  .
% 0.49/1.12  clause( 10, [ ~( one( out1( X ) ) ), one( in2( X ) ), ~( 'and_ok'( X ) ) ]
% 0.49/1.12     )
% 0.49/1.12  .
% 0.49/1.12  clause( 13, [ ~( one( in1( X ) ) ), one( out1( X ) ), ~( 'or_ok'( X ) ) ]
% 0.49/1.12     )
% 0.49/1.12  .
% 0.49/1.12  clause( 6, [ ~( zero( in2( X ) ) ), zero( out1( X ) ), ~( 'and_ok'( X ) ) ]
% 0.49/1.12     )
% 0.49/1.12  .
% 0.49/1.12  clause( 14, [ ~( one( in2( X ) ) ), one( out1( X ) ), ~( 'or_ok'( X ) ) ]
% 0.49/1.12     )
% 0.49/1.12  .
% 0.49/1.12  clause( 17, [ ~( zero( out1( X ) ) ), zero( in1( X ) ), ~( 'or_ok'( X ) ) ]
% 0.49/1.12     )
% 0.49/1.12  .
% 0.49/1.12  clause( 18, [ ~( zero( out1( X ) ) ), zero( in2( X ) ), ~( 'or_ok'( X ) ) ]
% 0.49/1.12     )
% 0.49/1.12  .
% 0.49/1.12  clause( 21, [ ~( zero( in1( X ) ) ), ~( 'not_ok'( X ) ), one( out1( X ) ) ]
% 0.49/1.12     )
% 0.49/1.12  .
% 0.49/1.12  clause( 5, [ ~( zero( in1( X ) ) ), zero( out1( X ) ), ~( 'and_ok'( X ) ) ]
% 0.49/1.12     )
% 0.49/1.12  .
% 0.49/1.12  clause( 22, [ ~( 'not_ok'( X ) ), zero( out1( X ) ), ~( one( in1( X ) ) ) ]
% 0.49/1.12     )
% 0.49/1.12  .
% 0.49/1.12  clause( 27, [ ~( zero( out1( X ) ) ), ~( zero( in1( X ) ) ), ~( 'not_ok'( X
% 0.49/1.12     ) ) ] )
% 0.49/1.12  .
% 0.49/1.12  clause( 23, [ ~( zero( out1( X ) ) ), ~( 'not_ok'( X ) ), one( in1( X ) ) ]
% 0.49/1.12     )
% 0.49/1.12  .
% 0.49/1.12  clause( 24, [ ~( 'not_ok'( X ) ), zero( in1( X ) ), ~( one( out1( X ) ) ) ]
% 0.49/1.12     )
% 0.49/1.12  .
% 0.49/1.12  clause( 1, [ ~( one( X ) ), one( Y ), ~( connection( X, Y ) ) ] )
% 0.49/1.12  .
% 0.49/1.12  clause( 2, [ ~( zero( Y ) ), zero( X ), ~( connection( X, Y ) ) ] )
% 0.49/1.12  .
% 0.49/1.12  clause( 3, [ ~( one( Y ) ), one( X ), ~( connection( X, Y ) ) ] )
% 0.49/1.12  .
% 0.49/1.12  clause( 12, [ 'and_ok'( X ), abnormal( X ), ~( 'logic_and'( X ) ) ] )
% 0.49/1.12  .
% 0.49/1.12  clause( 20, [ 'or_ok'( X ), abnormal( X ), ~( 'logic_or'( X ) ) ] )
% 0.49/1.12  .
% 0.49/1.12  clause( 0, [ ~( zero( X ) ), zero( Y ), ~( connection( X, Y ) ) ] )
% 0.49/1.12  .
% 0.49/1.12  clause( 26, [ 'not_ok'( X ), abnormal( X ), ~( 'logic_not'( X ) ) ] )
% 0.49/1.12  .
% 0.49/1.12  clause( 4, [ ~( zero( X ) ), ~( one( X ) ) ] )
% 0.49/1.12  .
% 0.49/1.12  clause( 11, [ ~( 'and_ok'( X ) ), ~( abnormal( X ) ) ] )
% 0.49/1.12  .
% 0.49/1.12  clause( 19, [ ~( abnormal( X ) ), ~( 'or_ok'( X ) ) ] )
% 0.49/1.12  .
% 0.49/1.12  clause( 25, [ ~( 'not_ok'( X ) ), ~( abnormal( X ) ) ] )
% 0.49/1.12  .
% 0.49/1.12  
% 0.49/1.12  
% 0.49/1.12  % SZS output end Saturation
% 0.49/1.12  end of saturation!
% 0.49/1.12  
% 0.49/1.12  Memory use:
% 0.49/1.12  
% 0.49/1.12  space for terms:        999
% 0.49/1.12  space for clauses:      1526
% 0.49/1.12  
% 0.49/1.12  
% 0.49/1.12  clauses generated:      31
% 0.49/1.12  clauses kept:           28
% 0.49/1.12  clauses selected:       28
% 0.49/1.12  clauses deleted:        0
% 0.49/1.12  clauses inuse deleted:  0
% 0.49/1.12  
% 0.49/1.12  subsentry:          20
% 0.49/1.12  literals s-matched: 11
% 0.49/1.12  literals matched:   11
% 0.49/1.12  full subsumption:   0
% 0.49/1.12  
% 0.49/1.12  checksum:           -194037667
% 0.49/1.12  
% 0.49/1.12  
% 0.49/1.12  Bliksem ended
%------------------------------------------------------------------------------