↑ Up

Bliksem---1.12.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Bliksem---1.12
% Problem  : SET846-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : bliksem %s

% Computer : n007.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:52:42 EDT 2022

% Result   : Unsatisfiable 0.42s 1.06s
% Output   : Refutation 0.42s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : SET846-2 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12  % Command  : bliksem %s
% 0.11/0.33  % Computer : n007.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % DateTime : Mon Jul 11 03:56:17 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.42/1.06  *** allocated 10000 integers for termspace/termends
% 0.42/1.06  *** allocated 10000 integers for clauses
% 0.42/1.06  *** allocated 10000 integers for justifications
% 0.42/1.06  Bliksem 1.12
% 0.42/1.06  
% 0.42/1.06  
% 0.42/1.06  Automatic Strategy Selection
% 0.42/1.06  
% 0.42/1.06  Clauses:
% 0.42/1.06  [
% 0.42/1.06     [ ~( 'c_in'( X, Y, 'tc_set'( Z ) ) ), 'c_lessequals'( X, 'c_Union'( Y, Z
% 0.42/1.06     ), 'tc_set'( Z ) ) ],
% 0.42/1.06     [ 'c_lessequals'( X, X, 'tc_set'( Y ) ) ],
% 0.42/1.06     [ ~( 'c_in'( X, 'c_Zorn_OTFin'( Y, Z ), 'tc_set'( 'tc_set'( Z ) ) ) ), 
% 0.42/1.06    'c_in'( 'c_Zorn_Osucc'( Y, X, Z ), 'c_Zorn_OTFin'( Y, Z ), 'tc_set'( 
% 0.42/1.06    'tc_set'( Z ) ) ) ],
% 0.42/1.06     [ ~( 'c_lessequals'( X, 'c_Zorn_OTFin'( Y, Z ), 'tc_set'( 'tc_set'( 
% 0.42/1.06    'tc_set'( Z ) ) ) ) ), 'c_in'( 'c_Union'( X, 'tc_set'( Z ) ), 
% 0.42/1.06    'c_Zorn_OTFin'( Y, Z ), 'tc_set'( 'tc_set'( Z ) ) ) ],
% 0.42/1.06     [ ~( 'c_lessequals'( 'c_Zorn_Osucc'( 'v_S', 'c_Union'( 'c_Zorn_OTFin'( 
% 0.42/1.06    'v_S', 't_a' ), 'tc_set'( 't_a' ) ), 't_a' ), 'c_Union'( 'c_Zorn_OTFin'( 
% 0.42/1.06    'v_S', 't_a' ), 'tc_set'( 't_a' ) ), 'tc_set'( 'tc_set'( 't_a' ) ) ) ) ]
% 0.42/1.06    
% 0.42/1.06  ] .
% 0.42/1.06  
% 0.42/1.06  
% 0.42/1.06  percentage equality = 0.000000, percentage horn = 1.000000
% 0.42/1.06  This is a near-Horn, non-equality  problem
% 0.42/1.06  
% 0.42/1.06  
% 0.42/1.06  Options Used:
% 0.42/1.06  
% 0.42/1.06  useres =            1
% 0.42/1.06  useparamod =        0
% 0.42/1.06  useeqrefl =         0
% 0.42/1.06  useeqfact =         0
% 0.42/1.06  usefactor =         1
% 0.42/1.06  usesimpsplitting =  0
% 0.42/1.06  usesimpdemod =      0
% 0.42/1.06  usesimpres =        4
% 0.42/1.06  
% 0.42/1.06  resimpinuse      =  1000
% 0.42/1.06  resimpclauses =     20000
% 0.42/1.06  substype =          standard
% 0.42/1.06  backwardsubs =      1
% 0.42/1.06  selectoldest =      5
% 0.42/1.06  
% 0.42/1.06  litorderings [0] =  split
% 0.42/1.06  litorderings [1] =  liftord
% 0.42/1.06  
% 0.42/1.06  termordering =      none
% 0.42/1.06  
% 0.42/1.06  litapriori =        1
% 0.42/1.06  termapriori =       0
% 0.42/1.06  litaposteriori =    0
% 0.42/1.06  termaposteriori =   0
% 0.42/1.06  demodaposteriori =  0
% 0.42/1.06  ordereqreflfact =   0
% 0.42/1.06  
% 0.42/1.06  litselect =         negative
% 0.42/1.06  
% 0.42/1.06  maxweight =         30000
% 0.42/1.06  maxdepth =          30000
% 0.42/1.06  maxlength =         115
% 0.42/1.06  maxnrvars =         195
% 0.42/1.06  excuselevel =       0
% 0.42/1.06  increasemaxweight = 0
% 0.42/1.06  
% 0.42/1.06  maxselected =       10000000
% 0.42/1.06  maxnrclauses =      10000000
% 0.42/1.06  
% 0.42/1.06  showgenerated =    0
% 0.42/1.06  showkept =         0
% 0.42/1.06  showselected =     0
% 0.42/1.06  showdeleted =      0
% 0.42/1.06  showresimp =       1
% 0.42/1.06  showstatus =       2000
% 0.42/1.06  
% 0.42/1.06  prologoutput =     1
% 0.42/1.06  nrgoals =          5000000
% 0.42/1.06  totalproof =       1
% 0.42/1.06  
% 0.42/1.06  Symbols occurring in the translation:
% 0.42/1.06  
% 0.42/1.06  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 0.42/1.06  .  [1, 2]      (w:1, o:23, a:1, s:1, b:0), 
% 0.42/1.06  !  [4, 1]      (w:1, o:17, a:1, s:1, b:0), 
% 0.42/1.06  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.42/1.06  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.42/1.06  'tc_set'  [42, 1]      (w:1, o:22, a:1, s:1, b:0), 
% 0.42/1.06  'c_in'  [43, 3]      (w:1, o:50, a:1, s:1, b:0), 
% 0.42/1.06  'c_Union'  [44, 2]      (w:1, o:48, a:1, s:1, b:0), 
% 0.42/1.06  'c_lessequals'  [45, 3]      (w:1, o:51, a:1, s:1, b:0), 
% 0.42/1.06  'c_Zorn_OTFin'  [48, 2]      (w:1, o:49, a:1, s:1, b:0), 
% 0.42/1.06  'c_Zorn_Osucc'  [49, 3]      (w:1, o:52, a:1, s:1, b:0), 
% 0.42/1.06  'v_S'  [51, 0]      (w:1, o:15, a:1, s:1, b:0), 
% 0.42/1.06  't_a'  [52, 0]      (w:1, o:16, a:1, s:1, b:0).
% 0.42/1.06  
% 0.42/1.06  
% 0.42/1.06  Starting Search:
% 0.42/1.06  
% 0.42/1.06  
% 0.42/1.06  Bliksems!, er is een bewijs:
% 0.42/1.06  % SZS status Unsatisfiable
% 0.42/1.06  % SZS output start Refutation
% 0.42/1.06  
% 0.42/1.06  clause( 0, [ 'c_lessequals'( X, 'c_Union'( Y, Z ), 'tc_set'( Z ) ), ~( 
% 0.42/1.06    'c_in'( X, Y, 'tc_set'( Z ) ) ) ] )
% 0.42/1.06  .
% 0.42/1.06  clause( 1, [ 'c_lessequals'( X, X, 'tc_set'( Y ) ) ] )
% 0.42/1.06  .
% 0.42/1.06  clause( 2, [ 'c_in'( 'c_Zorn_Osucc'( Y, X, Z ), 'c_Zorn_OTFin'( Y, Z ), 
% 0.42/1.06    'tc_set'( 'tc_set'( Z ) ) ), ~( 'c_in'( X, 'c_Zorn_OTFin'( Y, Z ), 
% 0.42/1.06    'tc_set'( 'tc_set'( Z ) ) ) ) ] )
% 0.42/1.06  .
% 0.42/1.06  clause( 3, [ 'c_in'( 'c_Union'( X, 'tc_set'( Z ) ), 'c_Zorn_OTFin'( Y, Z )
% 0.42/1.06    , 'tc_set'( 'tc_set'( Z ) ) ), ~( 'c_lessequals'( X, 'c_Zorn_OTFin'( Y, Z
% 0.42/1.06     ), 'tc_set'( 'tc_set'( 'tc_set'( Z ) ) ) ) ) ] )
% 0.42/1.06  .
% 0.42/1.06  clause( 4, [ ~( 'c_lessequals'( 'c_Zorn_Osucc'( 'v_S', 'c_Union'( 
% 0.42/1.06    'c_Zorn_OTFin'( 'v_S', 't_a' ), 'tc_set'( 't_a' ) ), 't_a' ), 'c_Union'( 
% 0.42/1.06    'c_Zorn_OTFin'( 'v_S', 't_a' ), 'tc_set'( 't_a' ) ), 'tc_set'( 'tc_set'( 
% 0.42/1.06    't_a' ) ) ) ) ] )
% 0.42/1.06  .
% 0.42/1.06  clause( 5, [ 'c_in'( 'c_Union'( 'c_Zorn_OTFin'( X, Y ), 'tc_set'( Y ) ), 
% 0.42/1.06    'c_Zorn_OTFin'( X, Y ), 'tc_set'( 'tc_set'( Y ) ) ) ] )
% 0.42/1.06  .
% 0.42/1.06  clause( 6, [ 'c_in'( 'c_Zorn_Osucc'( X, 'c_Union'( 'c_Zorn_OTFin'( X, Y ), 
% 0.42/1.06    'tc_set'( Y ) ), Y ), 'c_Zorn_OTFin'( X, Y ), 'tc_set'( 'tc_set'( Y ) ) )
% 0.42/1.06     ] )
% 0.42/1.06  .
% 0.42/1.06  clause( 8, [ 'c_lessequals'( 'c_Zorn_Osucc'( X, 'c_Union'( 'c_Zorn_OTFin'( 
% 0.42/1.06    X, Y ), 'tc_set'( Y ) ), Y ), 'c_Union'( 'c_Zorn_OTFin'( X, Y ), 'tc_set'( 
% 0.42/1.06    Y ) ), 'tc_set'( 'tc_set'( Y ) ) ) ] )
% 0.42/1.06  .
% 0.42/1.06  clause( 9, [] )
% 0.42/1.06  .
% 0.42/1.06  
% 0.42/1.06  
% 0.42/1.06  % SZS output end Refutation
% 0.42/1.06  found a proof!
% 0.42/1.06  
% 0.42/1.06  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.42/1.06  
% 0.42/1.06  initialclauses(
% 0.42/1.06  [ clause( 11, [ ~( 'c_in'( X, Y, 'tc_set'( Z ) ) ), 'c_lessequals'( X, 
% 0.42/1.06    'c_Union'( Y, Z ), 'tc_set'( Z ) ) ] )
% 0.42/1.06  , clause( 12, [ 'c_lessequals'( X, X, 'tc_set'( Y ) ) ] )
% 0.42/1.06  , clause( 13, [ ~( 'c_in'( X, 'c_Zorn_OTFin'( Y, Z ), 'tc_set'( 'tc_set'( Z
% 0.42/1.06     ) ) ) ), 'c_in'( 'c_Zorn_Osucc'( Y, X, Z ), 'c_Zorn_OTFin'( Y, Z ), 
% 0.42/1.06    'tc_set'( 'tc_set'( Z ) ) ) ] )
% 0.42/1.06  , clause( 14, [ ~( 'c_lessequals'( X, 'c_Zorn_OTFin'( Y, Z ), 'tc_set'( 
% 0.42/1.06    'tc_set'( 'tc_set'( Z ) ) ) ) ), 'c_in'( 'c_Union'( X, 'tc_set'( Z ) ), 
% 0.42/1.06    'c_Zorn_OTFin'( Y, Z ), 'tc_set'( 'tc_set'( Z ) ) ) ] )
% 0.42/1.06  , clause( 15, [ ~( 'c_lessequals'( 'c_Zorn_Osucc'( 'v_S', 'c_Union'( 
% 0.42/1.06    'c_Zorn_OTFin'( 'v_S', 't_a' ), 'tc_set'( 't_a' ) ), 't_a' ), 'c_Union'( 
% 0.42/1.06    'c_Zorn_OTFin'( 'v_S', 't_a' ), 'tc_set'( 't_a' ) ), 'tc_set'( 'tc_set'( 
% 0.42/1.06    't_a' ) ) ) ) ] )
% 0.42/1.06  ] ).
% 0.42/1.06  
% 0.42/1.06  
% 0.42/1.06  
% 0.42/1.06  subsumption(
% 0.42/1.06  clause( 0, [ 'c_lessequals'( X, 'c_Union'( Y, Z ), 'tc_set'( Z ) ), ~( 
% 0.42/1.06    'c_in'( X, Y, 'tc_set'( Z ) ) ) ] )
% 0.42/1.06  , clause( 11, [ ~( 'c_in'( X, Y, 'tc_set'( Z ) ) ), 'c_lessequals'( X, 
% 0.42/1.06    'c_Union'( Y, Z ), 'tc_set'( Z ) ) ] )
% 0.42/1.06  , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ), 
% 0.42/1.06    permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.42/1.06  
% 0.42/1.06  
% 0.42/1.06  subsumption(
% 0.42/1.06  clause( 1, [ 'c_lessequals'( X, X, 'tc_set'( Y ) ) ] )
% 0.42/1.06  , clause( 12, [ 'c_lessequals'( X, X, 'tc_set'( Y ) ) ] )
% 0.42/1.06  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.42/1.06     )] ) ).
% 0.42/1.06  
% 0.42/1.06  
% 0.42/1.06  subsumption(
% 0.42/1.06  clause( 2, [ 'c_in'( 'c_Zorn_Osucc'( Y, X, Z ), 'c_Zorn_OTFin'( Y, Z ), 
% 0.42/1.06    'tc_set'( 'tc_set'( Z ) ) ), ~( 'c_in'( X, 'c_Zorn_OTFin'( Y, Z ), 
% 0.42/1.06    'tc_set'( 'tc_set'( Z ) ) ) ) ] )
% 0.42/1.06  , clause( 13, [ ~( 'c_in'( X, 'c_Zorn_OTFin'( Y, Z ), 'tc_set'( 'tc_set'( Z
% 0.42/1.06     ) ) ) ), 'c_in'( 'c_Zorn_Osucc'( Y, X, Z ), 'c_Zorn_OTFin'( Y, Z ), 
% 0.42/1.06    'tc_set'( 'tc_set'( Z ) ) ) ] )
% 0.42/1.06  , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ), 
% 0.42/1.06    permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.42/1.06  
% 0.42/1.06  
% 0.42/1.06  subsumption(
% 0.42/1.06  clause( 3, [ 'c_in'( 'c_Union'( X, 'tc_set'( Z ) ), 'c_Zorn_OTFin'( Y, Z )
% 0.42/1.06    , 'tc_set'( 'tc_set'( Z ) ) ), ~( 'c_lessequals'( X, 'c_Zorn_OTFin'( Y, Z
% 0.42/1.06     ), 'tc_set'( 'tc_set'( 'tc_set'( Z ) ) ) ) ) ] )
% 0.42/1.06  , clause( 14, [ ~( 'c_lessequals'( X, 'c_Zorn_OTFin'( Y, Z ), 'tc_set'( 
% 0.42/1.06    'tc_set'( 'tc_set'( Z ) ) ) ) ), 'c_in'( 'c_Union'( X, 'tc_set'( Z ) ), 
% 0.42/1.06    'c_Zorn_OTFin'( Y, Z ), 'tc_set'( 'tc_set'( Z ) ) ) ] )
% 0.42/1.06  , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ), 
% 0.42/1.06    permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.42/1.06  
% 0.42/1.06  
% 0.42/1.06  subsumption(
% 0.42/1.06  clause( 4, [ ~( 'c_lessequals'( 'c_Zorn_Osucc'( 'v_S', 'c_Union'( 
% 0.42/1.06    'c_Zorn_OTFin'( 'v_S', 't_a' ), 'tc_set'( 't_a' ) ), 't_a' ), 'c_Union'( 
% 0.42/1.06    'c_Zorn_OTFin'( 'v_S', 't_a' ), 'tc_set'( 't_a' ) ), 'tc_set'( 'tc_set'( 
% 0.42/1.06    't_a' ) ) ) ) ] )
% 0.42/1.06  , clause( 15, [ ~( 'c_lessequals'( 'c_Zorn_Osucc'( 'v_S', 'c_Union'( 
% 0.42/1.06    'c_Zorn_OTFin'( 'v_S', 't_a' ), 'tc_set'( 't_a' ) ), 't_a' ), 'c_Union'( 
% 0.42/1.06    'c_Zorn_OTFin'( 'v_S', 't_a' ), 'tc_set'( 't_a' ) ), 'tc_set'( 'tc_set'( 
% 0.42/1.06    't_a' ) ) ) ) ] )
% 0.42/1.06  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.42/1.06  
% 0.42/1.06  
% 0.42/1.06  resolution(
% 0.42/1.06  clause( 16, [ 'c_in'( 'c_Union'( 'c_Zorn_OTFin'( X, Y ), 'tc_set'( Y ) ), 
% 0.42/1.06    'c_Zorn_OTFin'( X, Y ), 'tc_set'( 'tc_set'( Y ) ) ) ] )
% 0.42/1.06  , clause( 3, [ 'c_in'( 'c_Union'( X, 'tc_set'( Z ) ), 'c_Zorn_OTFin'( Y, Z
% 0.42/1.06     ), 'tc_set'( 'tc_set'( Z ) ) ), ~( 'c_lessequals'( X, 'c_Zorn_OTFin'( Y
% 0.42/1.06    , Z ), 'tc_set'( 'tc_set'( 'tc_set'( Z ) ) ) ) ) ] )
% 0.42/1.06  , 1, clause( 1, [ 'c_lessequals'( X, X, 'tc_set'( Y ) ) ] )
% 0.42/1.06  , 0, substitution( 0, [ :=( X, 'c_Zorn_OTFin'( X, Y ) ), :=( Y, X ), :=( Z
% 0.42/1.06    , Y )] ), substitution( 1, [ :=( X, 'c_Zorn_OTFin'( X, Y ) ), :=( Y, 
% 0.42/1.06    'tc_set'( 'tc_set'( Y ) ) )] )).
% 0.42/1.06  
% 0.42/1.06  
% 0.42/1.06  subsumption(
% 0.42/1.06  clause( 5, [ 'c_in'( 'c_Union'( 'c_Zorn_OTFin'( X, Y ), 'tc_set'( Y ) ), 
% 0.42/1.06    'c_Zorn_OTFin'( X, Y ), 'tc_set'( 'tc_set'( Y ) ) ) ] )
% 0.42/1.06  , clause( 16, [ 'c_in'( 'c_Union'( 'c_Zorn_OTFin'( X, Y ), 'tc_set'( Y ) )
% 0.42/1.06    , 'c_Zorn_OTFin'( X, Y ), 'tc_set'( 'tc_set'( Y ) ) ) ] )
% 0.42/1.06  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.42/1.06     )] ) ).
% 0.42/1.06  
% 0.42/1.06  
% 0.42/1.06  resolution(
% 0.42/1.06  clause( 17, [ 'c_in'( 'c_Zorn_Osucc'( X, 'c_Union'( 'c_Zorn_OTFin'( X, Y )
% 0.42/1.06    , 'tc_set'( Y ) ), Y ), 'c_Zorn_OTFin'( X, Y ), 'tc_set'( 'tc_set'( Y ) )
% 0.42/1.06     ) ] )
% 0.42/1.06  , clause( 2, [ 'c_in'( 'c_Zorn_Osucc'( Y, X, Z ), 'c_Zorn_OTFin'( Y, Z ), 
% 0.42/1.06    'tc_set'( 'tc_set'( Z ) ) ), ~( 'c_in'( X, 'c_Zorn_OTFin'( Y, Z ), 
% 0.42/1.06    'tc_set'( 'tc_set'( Z ) ) ) ) ] )
% 0.42/1.06  , 1, clause( 5, [ 'c_in'( 'c_Union'( 'c_Zorn_OTFin'( X, Y ), 'tc_set'( Y )
% 0.42/1.06     ), 'c_Zorn_OTFin'( X, Y ), 'tc_set'( 'tc_set'( Y ) ) ) ] )
% 0.42/1.06  , 0, substitution( 0, [ :=( X, 'c_Union'( 'c_Zorn_OTFin'( X, Y ), 'tc_set'( 
% 0.42/1.06    Y ) ) ), :=( Y, X ), :=( Z, Y )] ), substitution( 1, [ :=( X, X ), :=( Y
% 0.42/1.06    , Y )] )).
% 0.42/1.06  
% 0.42/1.06  
% 0.42/1.06  subsumption(
% 0.42/1.06  clause( 6, [ 'c_in'( 'c_Zorn_Osucc'( X, 'c_Union'( 'c_Zorn_OTFin'( X, Y ), 
% 0.42/1.06    'tc_set'( Y ) ), Y ), 'c_Zorn_OTFin'( X, Y ), 'tc_set'( 'tc_set'( Y ) ) )
% 0.42/1.06     ] )
% 0.42/1.06  , clause( 17, [ 'c_in'( 'c_Zorn_Osucc'( X, 'c_Union'( 'c_Zorn_OTFin'( X, Y
% 0.42/1.06     ), 'tc_set'( Y ) ), Y ), 'c_Zorn_OTFin'( X, Y ), 'tc_set'( 'tc_set'( Y )
% 0.42/1.06     ) ) ] )
% 0.42/1.06  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.42/1.06     )] ) ).
% 0.42/1.06  
% 0.42/1.06  
% 0.42/1.06  resolution(
% 0.42/1.06  clause( 18, [ 'c_lessequals'( 'c_Zorn_Osucc'( X, 'c_Union'( 'c_Zorn_OTFin'( 
% 0.42/1.06    X, Y ), 'tc_set'( Y ) ), Y ), 'c_Union'( 'c_Zorn_OTFin'( X, Y ), 'tc_set'( 
% 0.42/1.06    Y ) ), 'tc_set'( 'tc_set'( Y ) ) ) ] )
% 0.42/1.06  , clause( 0, [ 'c_lessequals'( X, 'c_Union'( Y, Z ), 'tc_set'( Z ) ), ~( 
% 0.42/1.06    'c_in'( X, Y, 'tc_set'( Z ) ) ) ] )
% 0.42/1.06  , 1, clause( 6, [ 'c_in'( 'c_Zorn_Osucc'( X, 'c_Union'( 'c_Zorn_OTFin'( X, 
% 0.42/1.06    Y ), 'tc_set'( Y ) ), Y ), 'c_Zorn_OTFin'( X, Y ), 'tc_set'( 'tc_set'( Y
% 0.42/1.06     ) ) ) ] )
% 0.42/1.06  , 0, substitution( 0, [ :=( X, 'c_Zorn_Osucc'( X, 'c_Union'( 'c_Zorn_OTFin'( 
% 0.42/1.06    X, Y ), 'tc_set'( Y ) ), Y ) ), :=( Y, 'c_Zorn_OTFin'( X, Y ) ), :=( Z, 
% 0.42/1.06    'tc_set'( Y ) )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.42/1.06  
% 0.42/1.06  
% 0.42/1.06  subsumption(
% 0.42/1.06  clause( 8, [ 'c_lessequals'( 'c_Zorn_Osucc'( X, 'c_Union'( 'c_Zorn_OTFin'( 
% 0.42/1.06    X, Y ), 'tc_set'( Y ) ), Y ), 'c_Union'( 'c_Zorn_OTFin'( X, Y ), 'tc_set'( 
% 0.42/1.06    Y ) ), 'tc_set'( 'tc_set'( Y ) ) ) ] )
% 0.42/1.06  , clause( 18, [ 'c_lessequals'( 'c_Zorn_Osucc'( X, 'c_Union'( 
% 0.42/1.06    'c_Zorn_OTFin'( X, Y ), 'tc_set'( Y ) ), Y ), 'c_Union'( 'c_Zorn_OTFin'( 
% 0.42/1.06    X, Y ), 'tc_set'( Y ) ), 'tc_set'( 'tc_set'( Y ) ) ) ] )
% 0.42/1.06  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.42/1.06     )] ) ).
% 0.42/1.06  
% 0.42/1.06  
% 0.42/1.06  resolution(
% 0.42/1.06  clause( 19, [] )
% 0.42/1.06  , clause( 4, [ ~( 'c_lessequals'( 'c_Zorn_Osucc'( 'v_S', 'c_Union'( 
% 0.42/1.06    'c_Zorn_OTFin'( 'v_S', 't_a' ), 'tc_set'( 't_a' ) ), 't_a' ), 'c_Union'( 
% 0.42/1.06    'c_Zorn_OTFin'( 'v_S', 't_a' ), 'tc_set'( 't_a' ) ), 'tc_set'( 'tc_set'( 
% 0.42/1.06    't_a' ) ) ) ) ] )
% 0.42/1.06  , 0, clause( 8, [ 'c_lessequals'( 'c_Zorn_Osucc'( X, 'c_Union'( 
% 0.42/1.06    'c_Zorn_OTFin'( X, Y ), 'tc_set'( Y ) ), Y ), 'c_Union'( 'c_Zorn_OTFin'( 
% 0.42/1.06    X, Y ), 'tc_set'( Y ) ), 'tc_set'( 'tc_set'( Y ) ) ) ] )
% 0.42/1.06  , 0, substitution( 0, [] ), substitution( 1, [ :=( X, 'v_S' ), :=( Y, 't_a'
% 0.42/1.06     )] )).
% 0.42/1.06  
% 0.42/1.06  
% 0.42/1.06  subsumption(
% 0.42/1.06  clause( 9, [] )
% 0.42/1.06  , clause( 19, [] )
% 0.42/1.06  , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.42/1.06  
% 0.42/1.06  
% 0.42/1.06  end.
% 0.42/1.06  
% 0.42/1.06  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.42/1.06  
% 0.42/1.06  Memory use:
% 0.42/1.06  
% 0.42/1.06  space for terms:        337
% 0.42/1.06  space for clauses:      1318
% 0.42/1.06  
% 0.42/1.06  
% 0.42/1.06  clauses generated:      11
% 0.42/1.06  clauses kept:           10
% 0.42/1.06  clauses selected:       8
% 0.42/1.06  clauses deleted:        0
% 0.42/1.06  clauses inuse deleted:  0
% 0.42/1.06  
% 0.42/1.06  subsentry:          1
% 0.42/1.06  literals s-matched: 1
% 0.42/1.06  literals matched:   1
% 0.42/1.06  full subsumption:   0
% 0.42/1.06  
% 0.42/1.06  checksum:           -1658475951
% 0.42/1.06  
% 0.42/1.06  
% 0.42/1.06  Bliksem ended
%------------------------------------------------------------------------------