↑ Up

Bliksem---1.12.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Bliksem---1.12
% Problem  : SYN047-1 : TPTP v8.1.0. Released v1.0.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 : Thu Jul 21 02:47:02 EDT 2022

% Result   : Unsatisfiable 0.73s 1.11s
% Output   : Refutation 0.73s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SYN047-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13  % Command  : bliksem %s
% 0.13/0.34  % Computer : n004.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % DateTime : Tue Jul 12 08:35:52 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.73/1.11  *** allocated 10000 integers for termspace/termends
% 0.73/1.11  *** allocated 10000 integers for clauses
% 0.73/1.11  *** allocated 10000 integers for justifications
% 0.73/1.11  Bliksem 1.12
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  Automatic Strategy Selection
% 0.73/1.11  
% 0.73/1.11  Clauses:
% 0.73/1.11  [
% 0.73/1.11     [ p ],
% 0.73/1.11     [ ~( p ), q, s ],
% 0.73/1.11     [ ~( p ), ~( r ), s ],
% 0.73/1.11     [ ~( s ) ],
% 0.73/1.11     [ ~( q ), r ]
% 0.73/1.11  ] .
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  percentage equality = 0.000000, percentage horn = 0.800000
% 0.73/1.11  This a non-horn, non-equality problem
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  Options Used:
% 0.73/1.11  
% 0.73/1.11  useres =            1
% 0.73/1.11  useparamod =        0
% 0.73/1.11  useeqrefl =         0
% 0.73/1.11  useeqfact =         0
% 0.73/1.11  usefactor =         1
% 0.73/1.11  usesimpsplitting =  0
% 0.73/1.11  usesimpdemod =      0
% 0.73/1.11  usesimpres =        3
% 0.73/1.11  
% 0.73/1.11  resimpinuse      =  1000
% 0.73/1.11  resimpclauses =     20000
% 0.73/1.11  substype =          standard
% 0.73/1.11  backwardsubs =      1
% 0.73/1.11  selectoldest =      5
% 0.73/1.11  
% 0.73/1.11  litorderings [0] =  split
% 0.73/1.11  litorderings [1] =  liftord
% 0.73/1.11  
% 0.73/1.11  termordering =      none
% 0.73/1.11  
% 0.73/1.11  litapriori =        1
% 0.73/1.11  termapriori =       0
% 0.73/1.11  litaposteriori =    0
% 0.73/1.11  termaposteriori =   0
% 0.73/1.11  demodaposteriori =  0
% 0.73/1.11  ordereqreflfact =   0
% 0.73/1.11  
% 0.73/1.11  litselect =         none
% 0.73/1.11  
% 0.73/1.11  maxweight =         15
% 0.73/1.11  maxdepth =          30000
% 0.73/1.11  maxlength =         115
% 0.73/1.11  maxnrvars =         195
% 0.73/1.11  excuselevel =       1
% 0.73/1.11  increasemaxweight = 1
% 0.73/1.11  
% 0.73/1.11  maxselected =       10000000
% 0.73/1.11  maxnrclauses =      10000000
% 0.73/1.11  
% 0.73/1.11  showgenerated =    0
% 0.73/1.11  showkept =         0
% 0.73/1.11  showselected =     0
% 0.73/1.11  showdeleted =      0
% 0.73/1.11  showresimp =       1
% 0.73/1.11  showstatus =       2000
% 0.73/1.11  
% 0.73/1.11  prologoutput =     1
% 0.73/1.11  nrgoals =          5000000
% 0.73/1.11  totalproof =       1
% 0.73/1.11  
% 0.73/1.11  Symbols occurring in the translation:
% 0.73/1.11  
% 0.73/1.11  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 0.73/1.11  .  [1, 2]      (w:1, o:18, a:1, s:1, b:0), 
% 0.73/1.11  !  [4, 1]      (w:0, o:13, a:1, s:1, b:0), 
% 0.73/1.11  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.73/1.11  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.73/1.11  p  [39, 0]      (w:1, o:11, a:1, s:1, b:0), 
% 0.73/1.11  q  [40, 0]      (w:1, o:12, a:1, s:1, b:0), 
% 0.73/1.11  s  [41, 0]      (w:1, o:6, a:1, s:1, b:0), 
% 0.73/1.11  r  [42, 0]      (w:1, o:5, a:1, s:1, b:0).
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  Starting Search:
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  Bliksems!, er is een bewijs:
% 0.73/1.11  % SZS status Unsatisfiable
% 0.73/1.11  % SZS output start Refutation
% 0.73/1.11  
% 0.73/1.11  clause( 0, [ p ] )
% 0.73/1.11  .
% 0.73/1.11  clause( 1, [ s, q ] )
% 0.73/1.11  .
% 0.73/1.11  clause( 2, [ s, ~( r ) ] )
% 0.73/1.11  .
% 0.73/1.11  clause( 3, [ ~( s ) ] )
% 0.73/1.11  .
% 0.73/1.11  clause( 4, [ r, ~( q ) ] )
% 0.73/1.11  .
% 0.73/1.11  clause( 5, [ ~( r ) ] )
% 0.73/1.11  .
% 0.73/1.11  clause( 6, [ q ] )
% 0.73/1.11  .
% 0.73/1.11  clause( 7, [] )
% 0.73/1.11  .
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  % SZS output end Refutation
% 0.73/1.11  found a proof!
% 0.73/1.11  
% 0.73/1.11  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.73/1.11  
% 0.73/1.11  initialclauses(
% 0.73/1.11  [ clause( 9, [ p ] )
% 0.73/1.11  , clause( 10, [ ~( p ), q, s ] )
% 0.73/1.11  , clause( 11, [ ~( p ), ~( r ), s ] )
% 0.73/1.11  , clause( 12, [ ~( s ) ] )
% 0.73/1.11  , clause( 13, [ ~( q ), r ] )
% 0.73/1.11  ] ).
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  subsumption(
% 0.73/1.11  clause( 0, [ p ] )
% 0.73/1.11  , clause( 9, [ p ] )
% 0.73/1.11  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  resolution(
% 0.73/1.11  clause( 14, [ q, s ] )
% 0.73/1.11  , clause( 10, [ ~( p ), q, s ] )
% 0.73/1.11  , 0, clause( 0, [ p ] )
% 0.73/1.11  , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  subsumption(
% 0.73/1.11  clause( 1, [ s, q ] )
% 0.73/1.11  , clause( 14, [ q, s ] )
% 0.73/1.11  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] )
% 0.73/1.11     ).
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  resolution(
% 0.73/1.11  clause( 16, [ ~( r ), s ] )
% 0.73/1.11  , clause( 11, [ ~( p ), ~( r ), s ] )
% 0.73/1.11  , 0, clause( 0, [ p ] )
% 0.73/1.11  , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  subsumption(
% 0.73/1.11  clause( 2, [ s, ~( r ) ] )
% 0.73/1.11  , clause( 16, [ ~( r ), s ] )
% 0.73/1.11  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] )
% 0.73/1.11     ).
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  subsumption(
% 0.73/1.11  clause( 3, [ ~( s ) ] )
% 0.73/1.11  , clause( 12, [ ~( s ) ] )
% 0.73/1.11  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  subsumption(
% 0.73/1.11  clause( 4, [ r, ~( q ) ] )
% 0.73/1.11  , clause( 13, [ ~( q ), r ] )
% 0.73/1.11  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] )
% 0.73/1.11     ).
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  resolution(
% 0.73/1.11  clause( 17, [ ~( r ) ] )
% 0.73/1.11  , clause( 3, [ ~( s ) ] )
% 0.73/1.11  , 0, clause( 2, [ s, ~( r ) ] )
% 0.73/1.11  , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  subsumption(
% 0.73/1.11  clause( 5, [ ~( r ) ] )
% 0.73/1.11  , clause( 17, [ ~( r ) ] )
% 0.73/1.11  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  resolution(
% 0.73/1.11  clause( 18, [ q ] )
% 0.73/1.11  , clause( 3, [ ~( s ) ] )
% 0.73/1.11  , 0, clause( 1, [ s, q ] )
% 0.73/1.11  , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  subsumption(
% 0.73/1.11  clause( 6, [ q ] )
% 0.73/1.11  , clause( 18, [ q ] )
% 0.73/1.11  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  resolution(
% 0.73/1.11  clause( 19, [ r ] )
% 0.73/1.11  , clause( 4, [ r, ~( q ) ] )
% 0.73/1.11  , 1, clause( 6, [ q ] )
% 0.73/1.11  , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  resolution(
% 0.73/1.11  clause( 20, [] )
% 0.73/1.11  , clause( 5, [ ~( r ) ] )
% 0.73/1.11  , 0, clause( 19, [ r ] )
% 0.73/1.11  , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  subsumption(
% 0.73/1.11  clause( 7, [] )
% 0.73/1.11  , clause( 20, [] )
% 0.73/1.11  , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  end.
% 0.73/1.11  
% 0.73/1.11  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.73/1.11  
% 0.73/1.11  Memory use:
% 0.73/1.11  
% 0.73/1.11  space for terms:        81
% 0.73/1.11  space for clauses:      337
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  clauses generated:      8
% 0.73/1.11  clauses kept:           8
% 0.73/1.11  clauses selected:       5
% 0.73/1.11  clauses deleted:        2
% 0.73/1.11  clauses inuse deleted:  0
% 0.73/1.11  
% 0.73/1.11  subsentry:          0
% 0.73/1.11  literals s-matched: 0
% 0.73/1.11  literals matched:   0
% 0.73/1.11  full subsumption:   0
% 0.73/1.11  
% 0.73/1.11  checksum:           -13463
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  Bliksem ended
%------------------------------------------------------------------------------