TSTP Solution File: SET844-2 by Bliksem---1.12

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Bliksem---1.12
% Problem  : SET844-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : bliksem %s

% Computer : n005.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:40 EDT 2022

% Result   : Unsatisfiable 0.69s 1.07s
% Output   : Refutation 0.69s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SET844-2 : TPTP v8.1.0. Released v3.2.0.
% 0.10/0.12  % Command  : bliksem %s
% 0.13/0.33  % Computer : n005.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % DateTime : Sun Jul 10 23:07:07 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.69/1.07  *** allocated 10000 integers for termspace/termends
% 0.69/1.07  *** allocated 10000 integers for clauses
% 0.69/1.07  *** allocated 10000 integers for justifications
% 0.69/1.07  Bliksem 1.12
% 0.69/1.07  
% 0.69/1.07  
% 0.69/1.07  Automatic Strategy Selection
% 0.69/1.07  
% 0.69/1.07  Clauses:
% 0.69/1.07  [
% 0.69/1.07     [ 'c_lessequals'( X, X, 'tc_set'( Y ) ) ],
% 0.69/1.07     [ ~( 'c_lessequals'( X, 'c_Zorn_OTFin'( Y, Z ), 'tc_set'( 'tc_set'( 
% 0.69/1.07    'tc_set'( Z ) ) ) ) ), 'c_in'( 'c_Union'( X, 'tc_set'( Z ) ), 
% 0.69/1.07    'c_Zorn_OTFin'( Y, Z ), 'tc_set'( 'tc_set'( Z ) ) ) ],
% 0.69/1.07     [ ~( 'c_in'( X, 'c_Zorn_OTFin'( Y, Z ), 'tc_set'( 'tc_set'( Z ) ) ) ), 
% 0.69/1.07    ~( 'c_in'( T, 'c_Zorn_OTFin'( Y, Z ), 'tc_set'( 'tc_set'( Z ) ) ) ), ~( 
% 0.69/1.07    =( X, 'c_Zorn_Osucc'( Y, X, Z ) ) ), 'c_lessequals'( T, X, 'tc_set'( 
% 0.69/1.07    'tc_set'( Z ) ) ) ],
% 0.69/1.07     [ 'c_in'( 'v_m', 'c_Zorn_OTFin'( 'v_S', 't_a' ), 'tc_set'( 'tc_set'( 
% 0.69/1.07    't_a' ) ) ) ],
% 0.69/1.07     [ =( 'v_m', 'c_Zorn_Osucc'( 'v_S', 'v_m', 't_a' ) ) ],
% 0.69/1.07     [ ~( 'c_lessequals'( 'c_Union'( 'c_Zorn_OTFin'( 'v_S', 't_a' ), 'tc_set'( 
% 0.69/1.07    't_a' ) ), 'v_m', 'tc_set'( 'tc_set'( 't_a' ) ) ) ) ]
% 0.69/1.07  ] .
% 0.69/1.07  
% 0.69/1.07  
% 0.69/1.07  percentage equality = 0.200000, percentage horn = 1.000000
% 0.69/1.07  This is a problem with some equality
% 0.69/1.07  
% 0.69/1.07  
% 0.69/1.07  
% 0.69/1.07  Options Used:
% 0.69/1.07  
% 0.69/1.07  useres =            1
% 0.69/1.07  useparamod =        1
% 0.69/1.07  useeqrefl =         1
% 0.69/1.07  useeqfact =         1
% 0.69/1.07  usefactor =         1
% 0.69/1.07  usesimpsplitting =  0
% 0.69/1.07  usesimpdemod =      5
% 0.69/1.07  usesimpres =        3
% 0.69/1.07  
% 0.69/1.07  resimpinuse      =  1000
% 0.69/1.07  resimpclauses =     20000
% 0.69/1.07  substype =          eqrewr
% 0.69/1.07  backwardsubs =      1
% 0.69/1.07  selectoldest =      5
% 0.69/1.07  
% 0.69/1.07  litorderings [0] =  split
% 0.69/1.07  litorderings [1] =  extend the termordering, first sorting on arguments
% 0.69/1.07  
% 0.69/1.07  termordering =      kbo
% 0.69/1.07  
% 0.69/1.07  litapriori =        0
% 0.69/1.07  termapriori =       1
% 0.69/1.07  litaposteriori =    0
% 0.69/1.07  termaposteriori =   0
% 0.69/1.07  demodaposteriori =  0
% 0.69/1.07  ordereqreflfact =   0
% 0.69/1.07  
% 0.69/1.07  litselect =         negord
% 0.69/1.07  
% 0.69/1.07  maxweight =         15
% 0.69/1.07  maxdepth =          30000
% 0.69/1.07  maxlength =         115
% 0.69/1.07  maxnrvars =         195
% 0.69/1.07  excuselevel =       1
% 0.69/1.07  increasemaxweight = 1
% 0.69/1.07  
% 0.69/1.07  maxselected =       10000000
% 0.69/1.07  maxnrclauses =      10000000
% 0.69/1.07  
% 0.69/1.07  showgenerated =    0
% 0.69/1.07  showkept =         0
% 0.69/1.07  showselected =     0
% 0.69/1.07  showdeleted =      0
% 0.69/1.07  showresimp =       1
% 0.69/1.07  showstatus =       2000
% 0.69/1.07  
% 0.69/1.07  prologoutput =     1
% 0.69/1.07  nrgoals =          5000000
% 0.69/1.07  totalproof =       1
% 0.69/1.07  
% 0.69/1.07  Symbols occurring in the translation:
% 0.69/1.07  
% 0.69/1.07  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 0.69/1.07  .  [1, 2]      (w:1, o:24, a:1, s:1, b:0), 
% 0.69/1.07  !  [4, 1]      (w:0, o:18, a:1, s:1, b:0), 
% 0.69/1.07  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.69/1.07  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.69/1.07  'tc_set'  [41, 1]      (w:1, o:23, a:1, s:1, b:0), 
% 0.69/1.07  'c_lessequals'  [42, 3]      (w:1, o:51, a:1, s:1, b:0), 
% 0.69/1.07  'c_Zorn_OTFin'  [45, 2]      (w:1, o:49, a:1, s:1, b:0), 
% 0.69/1.07  'c_Union'  [46, 2]      (w:1, o:50, a:1, s:1, b:0), 
% 0.69/1.07  'c_in'  [47, 3]      (w:1, o:52, a:1, s:1, b:0), 
% 0.69/1.07  'c_Zorn_Osucc'  [50, 3]      (w:1, o:53, a:1, s:1, b:0), 
% 0.69/1.07  'v_m'  [51, 0]      (w:1, o:15, a:1, s:1, b:0), 
% 0.69/1.07  'v_S'  [52, 0]      (w:1, o:16, a:1, s:1, b:0), 
% 0.69/1.07  't_a'  [53, 0]      (w:1, o:17, a:1, s:1, b:0).
% 0.69/1.07  
% 0.69/1.07  
% 0.69/1.07  Starting Search:
% 0.69/1.07  
% 0.69/1.07  
% 0.69/1.07  Bliksems!, er is een bewijs:
% 0.69/1.07  % SZS status Unsatisfiable
% 0.69/1.07  % SZS output start Refutation
% 0.69/1.07  
% 0.69/1.07  clause( 0, [ 'c_lessequals'( X, X, 'tc_set'( Y ) ) ] )
% 0.69/1.07  .
% 0.69/1.07  clause( 1, [ ~( 'c_lessequals'( X, 'c_Zorn_OTFin'( Y, Z ), 'tc_set'( 
% 0.69/1.07    'tc_set'( 'tc_set'( Z ) ) ) ) ), 'c_in'( 'c_Union'( X, 'tc_set'( Z ) ), 
% 0.69/1.07    'c_Zorn_OTFin'( Y, Z ), 'tc_set'( 'tc_set'( Z ) ) ) ] )
% 0.69/1.07  .
% 0.69/1.07  clause( 2, [ ~( 'c_in'( X, 'c_Zorn_OTFin'( Y, Z ), 'tc_set'( 'tc_set'( Z )
% 0.69/1.07     ) ) ), ~( 'c_in'( T, 'c_Zorn_OTFin'( Y, Z ), 'tc_set'( 'tc_set'( Z ) ) )
% 0.69/1.07     ), ~( =( 'c_Zorn_Osucc'( Y, X, Z ), X ) ), 'c_lessequals'( T, X, 
% 0.69/1.07    'tc_set'( 'tc_set'( Z ) ) ) ] )
% 0.69/1.07  .
% 0.69/1.07  clause( 3, [ 'c_in'( 'v_m', 'c_Zorn_OTFin'( 'v_S', 't_a' ), 'tc_set'( 
% 0.69/1.07    'tc_set'( 't_a' ) ) ) ] )
% 0.69/1.07  .
% 0.69/1.07  clause( 4, [ =( 'c_Zorn_Osucc'( 'v_S', 'v_m', 't_a' ), 'v_m' ) ] )
% 0.69/1.07  .
% 0.69/1.07  clause( 5, [ ~( 'c_lessequals'( 'c_Union'( 'c_Zorn_OTFin'( 'v_S', 't_a' ), 
% 0.69/1.07    'tc_set'( 't_a' ) ), 'v_m', 'tc_set'( 'tc_set'( 't_a' ) ) ) ) ] )
% 0.69/1.07  .
% 0.69/1.07  clause( 6, [ 'c_in'( 'c_Union'( 'c_Zorn_OTFin'( X, Y ), 'tc_set'( Y ) ), 
% 0.69/1.07    'c_Zorn_OTFin'( X, Y ), 'tc_set'( 'tc_set'( Y ) ) ) ] )
% 0.69/1.07  .
% 0.69/1.07  clause( 11, [ ~( 'c_in'( X, 'c_Zorn_OTFin'( 'v_S', 't_a' ), 'tc_set'( 
% 0.69/1.07    'tc_set'( 't_a' ) ) ) ), 'c_lessequals'( X, 'v_m', 'tc_set'( 'tc_set'( 
% 0.69/1.07    't_a' ) ) ) ] )
% 0.69/1.07  .
% 0.69/1.07  clause( 13, [] )
% 0.69/1.07  .
% 0.69/1.07  
% 0.69/1.07  
% 0.69/1.07  % SZS output end Refutation
% 0.69/1.07  found a proof!
% 0.69/1.07  
% 0.69/1.07  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.69/1.07  
% 0.69/1.07  initialclauses(
% 0.69/1.07  [ clause( 15, [ 'c_lessequals'( X, X, 'tc_set'( Y ) ) ] )
% 0.69/1.07  , clause( 16, [ ~( 'c_lessequals'( X, 'c_Zorn_OTFin'( Y, Z ), 'tc_set'( 
% 0.69/1.07    'tc_set'( 'tc_set'( Z ) ) ) ) ), 'c_in'( 'c_Union'( X, 'tc_set'( Z ) ), 
% 0.69/1.07    'c_Zorn_OTFin'( Y, Z ), 'tc_set'( 'tc_set'( Z ) ) ) ] )
% 0.69/1.07  , clause( 17, [ ~( 'c_in'( X, 'c_Zorn_OTFin'( Y, Z ), 'tc_set'( 'tc_set'( Z
% 0.69/1.07     ) ) ) ), ~( 'c_in'( T, 'c_Zorn_OTFin'( Y, Z ), 'tc_set'( 'tc_set'( Z ) )
% 0.69/1.07     ) ), ~( =( X, 'c_Zorn_Osucc'( Y, X, Z ) ) ), 'c_lessequals'( T, X, 
% 0.69/1.07    'tc_set'( 'tc_set'( Z ) ) ) ] )
% 0.69/1.07  , clause( 18, [ 'c_in'( 'v_m', 'c_Zorn_OTFin'( 'v_S', 't_a' ), 'tc_set'( 
% 0.69/1.07    'tc_set'( 't_a' ) ) ) ] )
% 0.69/1.07  , clause( 19, [ =( 'v_m', 'c_Zorn_Osucc'( 'v_S', 'v_m', 't_a' ) ) ] )
% 0.69/1.07  , clause( 20, [ ~( 'c_lessequals'( 'c_Union'( 'c_Zorn_OTFin'( 'v_S', 't_a'
% 0.69/1.07     ), 'tc_set'( 't_a' ) ), 'v_m', 'tc_set'( 'tc_set'( 't_a' ) ) ) ) ] )
% 0.69/1.07  ] ).
% 0.69/1.07  
% 0.69/1.07  
% 0.69/1.07  
% 0.69/1.07  subsumption(
% 0.69/1.07  clause( 0, [ 'c_lessequals'( X, X, 'tc_set'( Y ) ) ] )
% 0.69/1.07  , clause( 15, [ 'c_lessequals'( X, X, 'tc_set'( Y ) ) ] )
% 0.69/1.07  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.69/1.07     )] ) ).
% 0.69/1.07  
% 0.69/1.07  
% 0.69/1.07  subsumption(
% 0.69/1.07  clause( 1, [ ~( 'c_lessequals'( X, 'c_Zorn_OTFin'( Y, Z ), 'tc_set'( 
% 0.69/1.07    'tc_set'( 'tc_set'( Z ) ) ) ) ), 'c_in'( 'c_Union'( X, 'tc_set'( Z ) ), 
% 0.69/1.07    'c_Zorn_OTFin'( Y, Z ), 'tc_set'( 'tc_set'( Z ) ) ) ] )
% 0.69/1.07  , clause( 16, [ ~( 'c_lessequals'( X, 'c_Zorn_OTFin'( Y, Z ), 'tc_set'( 
% 0.69/1.07    'tc_set'( 'tc_set'( Z ) ) ) ) ), 'c_in'( 'c_Union'( X, 'tc_set'( Z ) ), 
% 0.69/1.07    'c_Zorn_OTFin'( Y, Z ), 'tc_set'( 'tc_set'( Z ) ) ) ] )
% 0.69/1.07  , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ), 
% 0.69/1.07    permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.69/1.07  
% 0.69/1.07  
% 0.69/1.07  eqswap(
% 0.69/1.07  clause( 21, [ ~( =( 'c_Zorn_Osucc'( Y, X, Z ), X ) ), ~( 'c_in'( X, 
% 0.69/1.07    'c_Zorn_OTFin'( Y, Z ), 'tc_set'( 'tc_set'( Z ) ) ) ), ~( 'c_in'( T, 
% 0.69/1.07    'c_Zorn_OTFin'( Y, Z ), 'tc_set'( 'tc_set'( Z ) ) ) ), 'c_lessequals'( T
% 0.69/1.07    , X, 'tc_set'( 'tc_set'( Z ) ) ) ] )
% 0.69/1.07  , clause( 17, [ ~( 'c_in'( X, 'c_Zorn_OTFin'( Y, Z ), 'tc_set'( 'tc_set'( Z
% 0.69/1.07     ) ) ) ), ~( 'c_in'( T, 'c_Zorn_OTFin'( Y, Z ), 'tc_set'( 'tc_set'( Z ) )
% 0.69/1.07     ) ), ~( =( X, 'c_Zorn_Osucc'( Y, X, Z ) ) ), 'c_lessequals'( T, X, 
% 0.69/1.07    'tc_set'( 'tc_set'( Z ) ) ) ] )
% 0.69/1.07  , 2, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] )
% 0.69/1.07    ).
% 0.69/1.07  
% 0.69/1.07  
% 0.69/1.07  subsumption(
% 0.69/1.07  clause( 2, [ ~( 'c_in'( X, 'c_Zorn_OTFin'( Y, Z ), 'tc_set'( 'tc_set'( Z )
% 0.69/1.07     ) ) ), ~( 'c_in'( T, 'c_Zorn_OTFin'( Y, Z ), 'tc_set'( 'tc_set'( Z ) ) )
% 0.69/1.07     ), ~( =( 'c_Zorn_Osucc'( Y, X, Z ), X ) ), 'c_lessequals'( T, X, 
% 0.69/1.07    'tc_set'( 'tc_set'( Z ) ) ) ] )
% 0.69/1.07  , clause( 21, [ ~( =( 'c_Zorn_Osucc'( Y, X, Z ), X ) ), ~( 'c_in'( X, 
% 0.69/1.07    'c_Zorn_OTFin'( Y, Z ), 'tc_set'( 'tc_set'( Z ) ) ) ), ~( 'c_in'( T, 
% 0.69/1.07    'c_Zorn_OTFin'( Y, Z ), 'tc_set'( 'tc_set'( Z ) ) ) ), 'c_lessequals'( T
% 0.69/1.07    , X, 'tc_set'( 'tc_set'( Z ) ) ) ] )
% 0.69/1.07  , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ), 
% 0.69/1.07    permutation( 0, [ ==>( 0, 2 ), ==>( 1, 0 ), ==>( 2, 1 ), ==>( 3, 3 )] )
% 0.69/1.07     ).
% 0.69/1.07  
% 0.69/1.07  
% 0.69/1.07  subsumption(
% 0.69/1.07  clause( 3, [ 'c_in'( 'v_m', 'c_Zorn_OTFin'( 'v_S', 't_a' ), 'tc_set'( 
% 0.69/1.07    'tc_set'( 't_a' ) ) ) ] )
% 0.69/1.07  , clause( 18, [ 'c_in'( 'v_m', 'c_Zorn_OTFin'( 'v_S', 't_a' ), 'tc_set'( 
% 0.69/1.07    'tc_set'( 't_a' ) ) ) ] )
% 0.69/1.07  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.07  
% 0.69/1.07  
% 0.69/1.07  eqswap(
% 0.69/1.07  clause( 30, [ =( 'c_Zorn_Osucc'( 'v_S', 'v_m', 't_a' ), 'v_m' ) ] )
% 0.69/1.07  , clause( 19, [ =( 'v_m', 'c_Zorn_Osucc'( 'v_S', 'v_m', 't_a' ) ) ] )
% 0.69/1.07  , 0, substitution( 0, [] )).
% 0.69/1.07  
% 0.69/1.07  
% 0.69/1.07  subsumption(
% 0.69/1.07  clause( 4, [ =( 'c_Zorn_Osucc'( 'v_S', 'v_m', 't_a' ), 'v_m' ) ] )
% 0.69/1.07  , clause( 30, [ =( 'c_Zorn_Osucc'( 'v_S', 'v_m', 't_a' ), 'v_m' ) ] )
% 0.69/1.07  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.07  
% 0.69/1.07  
% 0.69/1.07  subsumption(
% 0.69/1.07  clause( 5, [ ~( 'c_lessequals'( 'c_Union'( 'c_Zorn_OTFin'( 'v_S', 't_a' ), 
% 0.69/1.07    'tc_set'( 't_a' ) ), 'v_m', 'tc_set'( 'tc_set'( 't_a' ) ) ) ) ] )
% 0.69/1.07  , clause( 20, [ ~( 'c_lessequals'( 'c_Union'( 'c_Zorn_OTFin'( 'v_S', 't_a'
% 0.69/1.07     ), 'tc_set'( 't_a' ) ), 'v_m', 'tc_set'( 'tc_set'( 't_a' ) ) ) ) ] )
% 0.69/1.07  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.07  
% 0.69/1.07  
% 0.69/1.07  resolution(
% 0.69/1.07  clause( 35, [ 'c_in'( 'c_Union'( 'c_Zorn_OTFin'( X, Y ), 'tc_set'( Y ) ), 
% 0.69/1.07    'c_Zorn_OTFin'( X, Y ), 'tc_set'( 'tc_set'( Y ) ) ) ] )
% 0.69/1.07  , clause( 1, [ ~( 'c_lessequals'( X, 'c_Zorn_OTFin'( Y, Z ), 'tc_set'( 
% 0.69/1.07    'tc_set'( 'tc_set'( Z ) ) ) ) ), 'c_in'( 'c_Union'( X, 'tc_set'( Z ) ), 
% 0.69/1.07    'c_Zorn_OTFin'( Y, Z ), 'tc_set'( 'tc_set'( Z ) ) ) ] )
% 0.69/1.07  , 0, clause( 0, [ 'c_lessequals'( X, X, 'tc_set'( Y ) ) ] )
% 0.69/1.07  , 0, substitution( 0, [ :=( X, 'c_Zorn_OTFin'( X, Y ) ), :=( Y, X ), :=( Z
% 0.69/1.07    , Y )] ), substitution( 1, [ :=( X, 'c_Zorn_OTFin'( X, Y ) ), :=( Y, 
% 0.69/1.07    'tc_set'( 'tc_set'( Y ) ) )] )).
% 0.69/1.07  
% 0.69/1.07  
% 0.69/1.07  subsumption(
% 0.69/1.07  clause( 6, [ 'c_in'( 'c_Union'( 'c_Zorn_OTFin'( X, Y ), 'tc_set'( Y ) ), 
% 0.69/1.07    'c_Zorn_OTFin'( X, Y ), 'tc_set'( 'tc_set'( Y ) ) ) ] )
% 0.69/1.07  , clause( 35, [ 'c_in'( 'c_Union'( 'c_Zorn_OTFin'( X, Y ), 'tc_set'( Y ) )
% 0.69/1.07    , 'c_Zorn_OTFin'( X, Y ), 'tc_set'( 'tc_set'( Y ) ) ) ] )
% 0.69/1.07  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.69/1.07     )] ) ).
% 0.69/1.07  
% 0.69/1.07  
% 0.69/1.07  eqswap(
% 0.69/1.07  clause( 36, [ ~( =( Y, 'c_Zorn_Osucc'( X, Y, Z ) ) ), ~( 'c_in'( Y, 
% 0.69/1.07    'c_Zorn_OTFin'( X, Z ), 'tc_set'( 'tc_set'( Z ) ) ) ), ~( 'c_in'( T, 
% 0.69/1.07    'c_Zorn_OTFin'( X, Z ), 'tc_set'( 'tc_set'( Z ) ) ) ), 'c_lessequals'( T
% 0.69/1.07    , Y, 'tc_set'( 'tc_set'( Z ) ) ) ] )
% 0.69/1.07  , clause( 2, [ ~( 'c_in'( X, 'c_Zorn_OTFin'( Y, Z ), 'tc_set'( 'tc_set'( Z
% 0.69/1.07     ) ) ) ), ~( 'c_in'( T, 'c_Zorn_OTFin'( Y, Z ), 'tc_set'( 'tc_set'( Z ) )
% 0.69/1.07     ) ), ~( =( 'c_Zorn_Osucc'( Y, X, Z ), X ) ), 'c_lessequals'( T, X, 
% 0.69/1.07    'tc_set'( 'tc_set'( Z ) ) ) ] )
% 0.69/1.07  , 2, substitution( 0, [ :=( X, Y ), :=( Y, X ), :=( Z, Z ), :=( T, T )] )
% 0.69/1.07    ).
% 0.69/1.07  
% 0.69/1.07  
% 0.69/1.07  resolution(
% 0.69/1.07  clause( 38, [ ~( =( 'v_m', 'c_Zorn_Osucc'( 'v_S', 'v_m', 't_a' ) ) ), ~( 
% 0.69/1.07    'c_in'( X, 'c_Zorn_OTFin'( 'v_S', 't_a' ), 'tc_set'( 'tc_set'( 't_a' ) )
% 0.69/1.07     ) ), 'c_lessequals'( X, 'v_m', 'tc_set'( 'tc_set'( 't_a' ) ) ) ] )
% 0.69/1.07  , clause( 36, [ ~( =( Y, 'c_Zorn_Osucc'( X, Y, Z ) ) ), ~( 'c_in'( Y, 
% 0.69/1.07    'c_Zorn_OTFin'( X, Z ), 'tc_set'( 'tc_set'( Z ) ) ) ), ~( 'c_in'( T, 
% 0.69/1.07    'c_Zorn_OTFin'( X, Z ), 'tc_set'( 'tc_set'( Z ) ) ) ), 'c_lessequals'( T
% 0.69/1.07    , Y, 'tc_set'( 'tc_set'( Z ) ) ) ] )
% 0.69/1.07  , 1, clause( 3, [ 'c_in'( 'v_m', 'c_Zorn_OTFin'( 'v_S', 't_a' ), 'tc_set'( 
% 0.69/1.07    'tc_set'( 't_a' ) ) ) ] )
% 0.69/1.07  , 0, substitution( 0, [ :=( X, 'v_S' ), :=( Y, 'v_m' ), :=( Z, 't_a' ), 
% 0.69/1.07    :=( T, X )] ), substitution( 1, [] )).
% 0.69/1.07  
% 0.69/1.07  
% 0.69/1.07  paramod(
% 0.69/1.07  clause( 40, [ ~( =( 'v_m', 'v_m' ) ), ~( 'c_in'( X, 'c_Zorn_OTFin'( 'v_S', 
% 0.69/1.07    't_a' ), 'tc_set'( 'tc_set'( 't_a' ) ) ) ), 'c_lessequals'( X, 'v_m', 
% 0.69/1.07    'tc_set'( 'tc_set'( 't_a' ) ) ) ] )
% 0.69/1.07  , clause( 4, [ =( 'c_Zorn_Osucc'( 'v_S', 'v_m', 't_a' ), 'v_m' ) ] )
% 0.69/1.07  , 0, clause( 38, [ ~( =( 'v_m', 'c_Zorn_Osucc'( 'v_S', 'v_m', 't_a' ) ) ), 
% 0.69/1.07    ~( 'c_in'( X, 'c_Zorn_OTFin'( 'v_S', 't_a' ), 'tc_set'( 'tc_set'( 't_a' )
% 0.69/1.07     ) ) ), 'c_lessequals'( X, 'v_m', 'tc_set'( 'tc_set'( 't_a' ) ) ) ] )
% 0.69/1.07  , 0, 3, substitution( 0, [] ), substitution( 1, [ :=( X, X )] )).
% 0.69/1.07  
% 0.69/1.07  
% 0.69/1.07  eqrefl(
% 0.69/1.07  clause( 41, [ ~( 'c_in'( X, 'c_Zorn_OTFin'( 'v_S', 't_a' ), 'tc_set'( 
% 0.69/1.07    'tc_set'( 't_a' ) ) ) ), 'c_lessequals'( X, 'v_m', 'tc_set'( 'tc_set'( 
% 0.69/1.07    't_a' ) ) ) ] )
% 0.69/1.07  , clause( 40, [ ~( =( 'v_m', 'v_m' ) ), ~( 'c_in'( X, 'c_Zorn_OTFin'( 'v_S'
% 0.69/1.07    , 't_a' ), 'tc_set'( 'tc_set'( 't_a' ) ) ) ), 'c_lessequals'( X, 'v_m', 
% 0.69/1.07    'tc_set'( 'tc_set'( 't_a' ) ) ) ] )
% 0.69/1.07  , 0, substitution( 0, [ :=( X, X )] )).
% 0.69/1.07  
% 0.69/1.07  
% 0.69/1.07  subsumption(
% 0.69/1.07  clause( 11, [ ~( 'c_in'( X, 'c_Zorn_OTFin'( 'v_S', 't_a' ), 'tc_set'( 
% 0.69/1.07    'tc_set'( 't_a' ) ) ) ), 'c_lessequals'( X, 'v_m', 'tc_set'( 'tc_set'( 
% 0.69/1.07    't_a' ) ) ) ] )
% 0.69/1.07  , clause( 41, [ ~( 'c_in'( X, 'c_Zorn_OTFin'( 'v_S', 't_a' ), 'tc_set'( 
% 0.69/1.07    'tc_set'( 't_a' ) ) ) ), 'c_lessequals'( X, 'v_m', 'tc_set'( 'tc_set'( 
% 0.69/1.07    't_a' ) ) ) ] )
% 0.69/1.07  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 
% 0.69/1.07    1 )] ) ).
% 0.69/1.07  
% 0.69/1.07  
% 0.69/1.07  resolution(
% 0.69/1.07  clause( 42, [ 'c_lessequals'( 'c_Union'( 'c_Zorn_OTFin'( 'v_S', 't_a' ), 
% 0.69/1.07    'tc_set'( 't_a' ) ), 'v_m', 'tc_set'( 'tc_set'( 't_a' ) ) ) ] )
% 0.69/1.07  , clause( 11, [ ~( 'c_in'( X, 'c_Zorn_OTFin'( 'v_S', 't_a' ), 'tc_set'( 
% 0.69/1.07    'tc_set'( 't_a' ) ) ) ), 'c_lessequals'( X, 'v_m', 'tc_set'( 'tc_set'( 
% 0.69/1.07    't_a' ) ) ) ] )
% 0.69/1.07  , 0, clause( 6, [ 'c_in'( 'c_Union'( 'c_Zorn_OTFin'( X, Y ), 'tc_set'( Y )
% 0.69/1.07     ), 'c_Zorn_OTFin'( X, Y ), 'tc_set'( 'tc_set'( Y ) ) ) ] )
% 0.69/1.07  , 0, substitution( 0, [ :=( X, 'c_Union'( 'c_Zorn_OTFin'( 'v_S', 't_a' ), 
% 0.69/1.07    'tc_set'( 't_a' ) ) )] ), substitution( 1, [ :=( X, 'v_S' ), :=( Y, 't_a'
% 0.69/1.07     )] )).
% 0.69/1.07  
% 0.69/1.07  
% 0.69/1.07  resolution(
% 0.69/1.07  clause( 43, [] )
% 0.69/1.07  , clause( 5, [ ~( 'c_lessequals'( 'c_Union'( 'c_Zorn_OTFin'( 'v_S', 't_a' )
% 0.69/1.07    , 'tc_set'( 't_a' ) ), 'v_m', 'tc_set'( 'tc_set'( 't_a' ) ) ) ) ] )
% 0.69/1.07  , 0, clause( 42, [ 'c_lessequals'( 'c_Union'( 'c_Zorn_OTFin'( 'v_S', 't_a'
% 0.69/1.07     ), 'tc_set'( 't_a' ) ), 'v_m', 'tc_set'( 'tc_set'( 't_a' ) ) ) ] )
% 0.69/1.07  , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.69/1.07  
% 0.69/1.07  
% 0.69/1.07  subsumption(
% 0.69/1.07  clause( 13, [] )
% 0.69/1.07  , clause( 43, [] )
% 0.69/1.07  , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.69/1.07  
% 0.69/1.07  
% 0.69/1.07  end.
% 0.69/1.07  
% 0.69/1.07  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.69/1.07  
% 0.69/1.07  Memory use:
% 0.69/1.07  
% 0.69/1.07  space for terms:        491
% 0.69/1.07  space for clauses:      1385
% 0.69/1.07  
% 0.69/1.07  
% 0.69/1.07  clauses generated:      22
% 0.69/1.07  clauses kept:           14
% 0.69/1.07  clauses selected:       8
% 0.69/1.07  clauses deleted:        0
% 0.69/1.07  clauses inuse deleted:  0
% 0.69/1.07  
% 0.69/1.07  subsentry:          54
% 0.69/1.07  literals s-matched: 25
% 0.69/1.07  literals matched:   25
% 0.69/1.07  full subsumption:   13
% 0.69/1.07  
% 0.69/1.07  checksum:           -1683513498
% 0.69/1.07  
% 0.69/1.07  
% 0.69/1.07  Bliksem ended
%------------------------------------------------------------------------------