TSTP Solution File: SET001-1 by Bliksem---1.12

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Bliksem---1.12
% Problem  : SET001-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : bliksem %s

% Computer : n008.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 : Mon Jul 18 22:45:05 EDT 2022

% Result   : Unsatisfiable 0.72s 1.10s
% Output   : Refutation 0.72s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET001-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13  % Command  : bliksem %s
% 0.13/0.34  % Computer : n008.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 : Mon Jul 11 02:50:08 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.72/1.09  *** allocated 10000 integers for termspace/termends
% 0.72/1.09  *** allocated 10000 integers for clauses
% 0.72/1.09  *** allocated 10000 integers for justifications
% 0.72/1.09  Bliksem 1.12
% 0.72/1.09  
% 0.72/1.09  
% 0.72/1.09  Automatic Strategy Selection
% 0.72/1.09  
% 0.72/1.09  Clauses:
% 0.72/1.09  [
% 0.72/1.09     [ ~( member( X, Y ) ), ~( subset( Y, Z ) ), member( X, Z ) ],
% 0.72/1.09     [ subset( X, Y ), member( 'member_of_1_not_of_2'( X, Y ), X ) ],
% 0.72/1.09     [ ~( member( 'member_of_1_not_of_2'( X, Y ), Y ) ), subset( X, Y ) ]
% 0.72/1.09    ,
% 0.72/1.09     [ ~( 'equal_sets'( X, Y ) ), subset( X, Y ) ],
% 0.72/1.09     [ ~( 'equal_sets'( X, Y ) ), subset( Y, X ) ],
% 0.72/1.09     [ ~( subset( X, Y ) ), ~( subset( Y, X ) ), 'equal_sets'( Y, X ) ],
% 0.72/1.09     [ 'equal_sets'( b, bb ) ],
% 0.72/1.09     [ member( 'element_of_b', b ) ],
% 0.72/1.09     [ ~( member( 'element_of_b', bb ) ) ]
% 0.72/1.09  ] .
% 0.72/1.09  
% 0.72/1.09  
% 0.72/1.09  percentage equality = 0.000000, percentage horn = 0.888889
% 0.72/1.09  This a non-horn, non-equality problem
% 0.72/1.09  
% 0.72/1.09  
% 0.72/1.09  Options Used:
% 0.72/1.09  
% 0.72/1.09  useres =            1
% 0.72/1.09  useparamod =        0
% 0.72/1.09  useeqrefl =         0
% 0.72/1.09  useeqfact =         0
% 0.72/1.09  usefactor =         1
% 0.72/1.09  usesimpsplitting =  0
% 0.72/1.09  usesimpdemod =      0
% 0.72/1.09  usesimpres =        3
% 0.72/1.09  
% 0.72/1.09  resimpinuse      =  1000
% 0.72/1.09  resimpclauses =     20000
% 0.72/1.09  substype =          standard
% 0.72/1.09  backwardsubs =      1
% 0.72/1.09  selectoldest =      5
% 0.72/1.09  
% 0.72/1.09  litorderings [0] =  split
% 0.72/1.09  litorderings [1] =  liftord
% 0.72/1.09  
% 0.72/1.09  termordering =      none
% 0.72/1.09  
% 0.72/1.09  litapriori =        1
% 0.72/1.09  termapriori =       0
% 0.72/1.09  litaposteriori =    0
% 0.72/1.09  termaposteriori =   0
% 0.72/1.09  demodaposteriori =  0
% 0.72/1.09  ordereqreflfact =   0
% 0.72/1.09  
% 0.72/1.09  litselect =         none
% 0.72/1.09  
% 0.72/1.09  maxweight =         15
% 0.72/1.09  maxdepth =          30000
% 0.72/1.09  maxlength =         115
% 0.72/1.09  maxnrvars =         195
% 0.72/1.09  excuselevel =       1
% 0.72/1.09  increasemaxweight = 1
% 0.72/1.09  
% 0.72/1.09  maxselected =       10000000
% 0.72/1.09  maxnrclauses =      10000000
% 0.72/1.09  
% 0.72/1.09  showgenerated =    0
% 0.72/1.09  showkept =         0
% 0.72/1.09  showselected =     0
% 0.72/1.09  showdeleted =      0
% 0.72/1.09  showresimp =       1
% 0.72/1.09  showstatus =       2000
% 0.72/1.09  
% 0.72/1.09  prologoutput =     1
% 0.72/1.09  nrgoals =          5000000
% 0.72/1.09  totalproof =       1
% 0.72/1.09  
% 0.72/1.09  Symbols occurring in the translation:
% 0.72/1.09  
% 0.72/1.09  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 0.72/1.09  .  [1, 2]      (w:1, o:22, a:1, s:1, b:0), 
% 0.72/1.09  !  [4, 1]      (w:0, o:17, a:1, s:1, b:0), 
% 0.72/1.09  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.72/1.09  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.72/1.09  member  [41, 2]      (w:1, o:47, a:1, s:1, b:0), 
% 0.72/1.10  subset  [43, 2]      (w:1, o:48, a:1, s:1, b:0), 
% 0.72/1.10  'member_of_1_not_of_2'  [44, 2]      (w:1, o:49, a:1, s:1, b:0), 
% 0.72/1.10  'equal_sets'  [45, 2]      (w:1, o:50, a:1, s:1, b:0), 
% 0.72/1.10  b  [48, 0]      (w:1, o:14, a:1, s:1, b:0), 
% 0.72/1.10  bb  [49, 0]      (w:1, o:15, a:1, s:1, b:0), 
% 0.72/1.10  'element_of_b'  [50, 0]      (w:1, o:16, a:1, s:1, b:0).
% 0.72/1.10  
% 0.72/1.10  
% 0.72/1.10  Starting Search:
% 0.72/1.10  
% 0.72/1.10  
% 0.72/1.10  Bliksems!, er is een bewijs:
% 0.72/1.10  % SZS status Unsatisfiable
% 0.72/1.10  % SZS output start Refutation
% 0.72/1.10  
% 0.72/1.10  clause( 0, [ ~( member( X, Y ) ), member( X, Z ), ~( subset( Y, Z ) ) ] )
% 0.72/1.10  .
% 0.72/1.10  clause( 3, [ subset( X, Y ), ~( 'equal_sets'( X, Y ) ) ] )
% 0.72/1.10  .
% 0.72/1.10  clause( 6, [ 'equal_sets'( b, bb ) ] )
% 0.72/1.10  .
% 0.72/1.10  clause( 7, [ member( 'element_of_b', b ) ] )
% 0.72/1.10  .
% 0.72/1.10  clause( 8, [ ~( member( 'element_of_b', bb ) ) ] )
% 0.72/1.10  .
% 0.72/1.10  clause( 12, [ subset( b, bb ) ] )
% 0.72/1.10  .
% 0.72/1.10  clause( 13, [ ~( member( X, b ) ), member( X, bb ) ] )
% 0.72/1.10  .
% 0.72/1.10  clause( 14, [] )
% 0.72/1.10  .
% 0.72/1.10  
% 0.72/1.10  
% 0.72/1.10  % SZS output end Refutation
% 0.72/1.10  found a proof!
% 0.72/1.10  
% 0.72/1.10  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.72/1.10  
% 0.72/1.10  initialclauses(
% 0.72/1.10  [ clause( 16, [ ~( member( X, Y ) ), ~( subset( Y, Z ) ), member( X, Z ) ]
% 0.72/1.10     )
% 0.72/1.10  , clause( 17, [ subset( X, Y ), member( 'member_of_1_not_of_2'( X, Y ), X )
% 0.72/1.10     ] )
% 0.72/1.10  , clause( 18, [ ~( member( 'member_of_1_not_of_2'( X, Y ), Y ) ), subset( X
% 0.72/1.10    , Y ) ] )
% 0.72/1.10  , clause( 19, [ ~( 'equal_sets'( X, Y ) ), subset( X, Y ) ] )
% 0.72/1.10  , clause( 20, [ ~( 'equal_sets'( X, Y ) ), subset( Y, X ) ] )
% 0.72/1.10  , clause( 21, [ ~( subset( X, Y ) ), ~( subset( Y, X ) ), 'equal_sets'( Y, 
% 0.72/1.10    X ) ] )
% 0.72/1.10  , clause( 22, [ 'equal_sets'( b, bb ) ] )
% 0.72/1.10  , clause( 23, [ member( 'element_of_b', b ) ] )
% 0.72/1.10  , clause( 24, [ ~( member( 'element_of_b', bb ) ) ] )
% 0.72/1.10  ] ).
% 0.72/1.10  
% 0.72/1.10  
% 0.72/1.10  
% 0.72/1.10  subsumption(
% 0.72/1.10  clause( 0, [ ~( member( X, Y ) ), member( X, Z ), ~( subset( Y, Z ) ) ] )
% 0.72/1.10  , clause( 16, [ ~( member( X, Y ) ), ~( subset( Y, Z ) ), member( X, Z ) ]
% 0.72/1.10     )
% 0.72/1.10  , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ), 
% 0.72/1.10    permutation( 0, [ ==>( 0, 0 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.72/1.10  
% 0.72/1.10  
% 0.72/1.10  subsumption(
% 0.72/1.10  clause( 3, [ subset( X, Y ), ~( 'equal_sets'( X, Y ) ) ] )
% 0.72/1.10  , clause( 19, [ ~( 'equal_sets'( X, Y ) ), subset( X, Y ) ] )
% 0.72/1.10  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.72/1.10     ), ==>( 1, 0 )] ) ).
% 0.72/1.10  
% 0.72/1.10  
% 0.72/1.10  subsumption(
% 0.72/1.10  clause( 6, [ 'equal_sets'( b, bb ) ] )
% 0.72/1.10  , clause( 22, [ 'equal_sets'( b, bb ) ] )
% 0.72/1.10  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.10  
% 0.72/1.10  
% 0.72/1.10  subsumption(
% 0.72/1.10  clause( 7, [ member( 'element_of_b', b ) ] )
% 0.72/1.10  , clause( 23, [ member( 'element_of_b', b ) ] )
% 0.72/1.10  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.10  
% 0.72/1.10  
% 0.72/1.10  subsumption(
% 0.72/1.10  clause( 8, [ ~( member( 'element_of_b', bb ) ) ] )
% 0.72/1.10  , clause( 24, [ ~( member( 'element_of_b', bb ) ) ] )
% 0.72/1.10  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.10  
% 0.72/1.10  
% 0.72/1.10  resolution(
% 0.72/1.10  clause( 28, [ subset( b, bb ) ] )
% 0.72/1.10  , clause( 3, [ subset( X, Y ), ~( 'equal_sets'( X, Y ) ) ] )
% 0.72/1.10  , 1, clause( 6, [ 'equal_sets'( b, bb ) ] )
% 0.72/1.10  , 0, substitution( 0, [ :=( X, b ), :=( Y, bb )] ), substitution( 1, [] )
% 0.72/1.10    ).
% 0.72/1.10  
% 0.72/1.10  
% 0.72/1.10  subsumption(
% 0.72/1.10  clause( 12, [ subset( b, bb ) ] )
% 0.72/1.10  , clause( 28, [ subset( b, bb ) ] )
% 0.72/1.10  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.10  
% 0.72/1.10  
% 0.72/1.10  resolution(
% 0.72/1.10  clause( 29, [ ~( member( X, b ) ), member( X, bb ) ] )
% 0.72/1.10  , clause( 0, [ ~( member( X, Y ) ), member( X, Z ), ~( subset( Y, Z ) ) ]
% 0.72/1.10     )
% 0.72/1.10  , 2, clause( 12, [ subset( b, bb ) ] )
% 0.72/1.10  , 0, substitution( 0, [ :=( X, X ), :=( Y, b ), :=( Z, bb )] ), 
% 0.72/1.10    substitution( 1, [] )).
% 0.72/1.10  
% 0.72/1.10  
% 0.72/1.10  subsumption(
% 0.72/1.10  clause( 13, [ ~( member( X, b ) ), member( X, bb ) ] )
% 0.72/1.10  , clause( 29, [ ~( member( X, b ) ), member( X, bb ) ] )
% 0.72/1.10  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 
% 0.72/1.10    1 )] ) ).
% 0.72/1.10  
% 0.72/1.10  
% 0.72/1.10  resolution(
% 0.72/1.10  clause( 30, [ ~( member( 'element_of_b', b ) ) ] )
% 0.72/1.10  , clause( 8, [ ~( member( 'element_of_b', bb ) ) ] )
% 0.72/1.10  , 0, clause( 13, [ ~( member( X, b ) ), member( X, bb ) ] )
% 0.72/1.10  , 1, substitution( 0, [] ), substitution( 1, [ :=( X, 'element_of_b' )] )
% 0.72/1.10    ).
% 0.72/1.10  
% 0.72/1.10  
% 0.72/1.10  resolution(
% 0.72/1.10  clause( 31, [] )
% 0.72/1.10  , clause( 30, [ ~( member( 'element_of_b', b ) ) ] )
% 0.72/1.10  , 0, clause( 7, [ member( 'element_of_b', b ) ] )
% 0.72/1.10  , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.72/1.10  
% 0.72/1.10  
% 0.72/1.10  subsumption(
% 0.72/1.10  clause( 14, [] )
% 0.72/1.10  , clause( 31, [] )
% 0.72/1.10  , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.72/1.10  
% 0.72/1.10  
% 0.72/1.10  end.
% 0.72/1.10  
% 0.72/1.10  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.72/1.10  
% 0.72/1.10  Memory use:
% 0.72/1.10  
% 0.72/1.10  space for terms:        275
% 0.72/1.10  space for clauses:      857
% 0.72/1.10  
% 0.72/1.10  
% 0.72/1.10  clauses generated:      15
% 0.72/1.10  clauses kept:           15
% 0.72/1.10  clauses selected:       9
% 0.72/1.10  clauses deleted:        0
% 0.72/1.10  clauses inuse deleted:  0
% 0.72/1.10  
% 0.72/1.10  subsentry:          4
% 0.72/1.10  literals s-matched: 3
% 0.72/1.10  literals matched:   3
% 0.72/1.10  full subsumption:   0
% 0.72/1.10  
% 0.72/1.10  checksum:           10003150
% 0.72/1.10  
% 0.72/1.10  
% 0.72/1.10  Bliksem ended
%------------------------------------------------------------------------------