TSTP Solution File: CAT006-3 by Bliksem---1.12

View Problem - Process Solution

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

% Computer : n027.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 14 23:54:10 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : CAT006-3 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13  % Command  : bliksem %s
% 0.12/0.34  % Computer : n027.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % DateTime : Sun May 29 18:09:45 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.71/1.11  *** allocated 10000 integers for termspace/termends
% 0.71/1.11  *** allocated 10000 integers for clauses
% 0.71/1.11  *** allocated 10000 integers for justifications
% 0.71/1.11  Bliksem 1.12
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  Automatic Strategy Selection
% 0.71/1.11  
% 0.71/1.11  Clauses:
% 0.71/1.11  [
% 0.71/1.11     [ ~( equivalent( X, Y ) ), 'there_exists'( X ) ],
% 0.71/1.11     [ ~( equivalent( X, Y ) ), =( X, Y ) ],
% 0.71/1.11     [ ~( 'there_exists'( X ) ), ~( =( X, Y ) ), equivalent( X, Y ) ],
% 0.71/1.11     [ ~( 'there_exists'( domain( X ) ) ), 'there_exists'( X ) ],
% 0.71/1.11     [ ~( 'there_exists'( codomain( X ) ) ), 'there_exists'( X ) ],
% 0.71/1.11     [ ~( 'there_exists'( compose( X, Y ) ) ), 'there_exists'( domain( X ) )
% 0.71/1.11     ],
% 0.71/1.11     [ ~( 'there_exists'( compose( X, Y ) ) ), =( domain( X ), codomain( Y )
% 0.71/1.11     ) ],
% 0.71/1.11     [ ~( 'there_exists'( domain( X ) ) ), ~( =( domain( X ), codomain( Y ) )
% 0.71/1.11     ), 'there_exists'( compose( X, Y ) ) ],
% 0.71/1.11     [ =( compose( X, compose( Y, Z ) ), compose( compose( X, Y ), Z ) ) ]
% 0.71/1.11    ,
% 0.71/1.11     [ =( compose( X, domain( X ) ), X ) ],
% 0.71/1.11     [ =( compose( codomain( X ), X ), X ) ],
% 0.71/1.11     [ ~( equivalent( X, Y ) ), 'there_exists'( Y ) ],
% 0.71/1.11     [ ~( 'there_exists'( X ) ), ~( 'there_exists'( Y ) ), ~( =( X, Y ) ), 
% 0.71/1.11    equivalent( X, Y ) ],
% 0.71/1.11     [ ~( 'there_exists'( compose( X, Y ) ) ), 'there_exists'( codomain( X )
% 0.71/1.11     ) ],
% 0.71/1.11     [ 'there_exists'( f1( X, Y ) ), =( X, Y ) ],
% 0.71/1.11     [ =( X, f1( X, Y ) ), =( Y, f1( X, Y ) ), =( X, Y ) ],
% 0.71/1.11     [ ~( =( X, f1( X, Y ) ) ), ~( =( Y, f1( X, Y ) ) ), =( X, Y ) ],
% 0.71/1.11     [ 'there_exists'( compose( d, a ) ) ],
% 0.71/1.11     [ ~( 'there_exists'( compose( X, d ) ) ), =( compose( X, d ), X ) ],
% 0.71/1.11     [ ~( 'there_exists'( compose( d, X ) ) ), =( compose( d, X ), X ) ],
% 0.71/1.11     [ ~( =( codomain( a ), d ) ) ]
% 0.71/1.11  ] .
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  percentage equality = 0.435897, percentage horn = 0.900000
% 0.71/1.11  This is a problem with some equality
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  Options Used:
% 0.71/1.11  
% 0.71/1.11  useres =            1
% 0.71/1.11  useparamod =        1
% 0.71/1.11  useeqrefl =         1
% 0.71/1.11  useeqfact =         1
% 0.71/1.11  usefactor =         1
% 0.71/1.11  usesimpsplitting =  0
% 0.71/1.11  usesimpdemod =      5
% 0.71/1.11  usesimpres =        3
% 0.71/1.11  
% 0.71/1.11  resimpinuse      =  1000
% 0.71/1.11  resimpclauses =     20000
% 0.71/1.11  substype =          eqrewr
% 0.71/1.11  backwardsubs =      1
% 0.71/1.11  selectoldest =      5
% 0.71/1.11  
% 0.71/1.11  litorderings [0] =  split
% 0.71/1.11  litorderings [1] =  extend the termordering, first sorting on arguments
% 0.71/1.11  
% 0.71/1.11  termordering =      kbo
% 0.71/1.11  
% 0.71/1.11  litapriori =        0
% 0.71/1.11  termapriori =       1
% 0.71/1.11  litaposteriori =    0
% 0.71/1.11  termaposteriori =   0
% 0.71/1.11  demodaposteriori =  0
% 0.71/1.11  ordereqreflfact =   0
% 0.71/1.11  
% 0.71/1.11  litselect =         negord
% 0.71/1.11  
% 0.71/1.11  maxweight =         15
% 0.71/1.11  maxdepth =          30000
% 0.71/1.11  maxlength =         115
% 0.71/1.11  maxnrvars =         195
% 0.71/1.11  excuselevel =       1
% 0.71/1.11  increasemaxweight = 1
% 0.71/1.11  
% 0.71/1.11  maxselected =       10000000
% 0.71/1.11  maxnrclauses =      10000000
% 0.71/1.11  
% 0.71/1.11  showgenerated =    0
% 0.71/1.11  showkept =         0
% 0.71/1.11  showselected =     0
% 0.71/1.11  showdeleted =      0
% 0.71/1.11  showresimp =       1
% 0.71/1.11  showstatus =       2000
% 0.71/1.11  
% 0.71/1.11  prologoutput =     1
% 0.71/1.11  nrgoals =          5000000
% 0.71/1.11  totalproof =       1
% 0.71/1.11  
% 0.71/1.11  Symbols occurring in the translation:
% 0.71/1.11  
% 0.71/1.11  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 0.71/1.11  .  [1, 2]      (w:1, o:22, a:1, s:1, b:0), 
% 0.71/1.11  !  [4, 1]      (w:0, o:14, a:1, s:1, b:0), 
% 0.71/1.11  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.71/1.11  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.71/1.11  equivalent  [41, 2]      (w:1, o:47, a:1, s:1, b:0), 
% 0.71/1.11  'there_exists'  [42, 1]      (w:1, o:19, a:1, s:1, b:0), 
% 0.71/1.11  domain  [43, 1]      (w:1, o:21, a:1, s:1, b:0), 
% 0.71/1.11  codomain  [44, 1]      (w:1, o:20, a:1, s:1, b:0), 
% 0.71/1.11  compose  [45, 2]      (w:1, o:48, a:1, s:1, b:0), 
% 0.71/1.11  f1  [47, 2]      (w:1, o:49, a:1, s:1, b:0), 
% 0.71/1.11  d  [48, 0]      (w:1, o:12, a:1, s:1, b:0), 
% 0.71/1.11  a  [49, 0]      (w:1, o:13, a:1, s:1, b:0).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  Starting Search:
% 0.71/1.11  
% 0.71/1.11  Resimplifying inuse:
% 0.71/1.11  Done
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  Bliksems!, er is een bewijs:
% 0.71/1.11  % SZS status Unsatisfiable
% 0.71/1.11  % SZS output start Refutation
% 0.71/1.11  
% 0.71/1.11  clause( 3, [ ~( 'there_exists'( domain( X ) ) ), 'there_exists'( X ) ] )
% 0.71/1.11  .
% 0.71/1.11  clause( 5, [ ~( 'there_exists'( compose( X, Y ) ) ), 'there_exists'( domain( 
% 0.71/1.11    X ) ) ] )
% 0.71/1.11  .
% 0.71/1.11  clause( 6, [ ~( 'there_exists'( compose( X, Y ) ) ), =( domain( X ), 
% 0.71/1.11    codomain( Y ) ) ] )
% 0.71/1.11  .
% 0.71/1.11  clause( 10, [ =( compose( codomain( X ), X ), X ) ] )
% 0.71/1.11  .
% 0.71/1.11  clause( 16, [ 'there_exists'( compose( d, a ) ) ] )
% 0.71/1.11  .
% 0.71/1.11  clause( 17, [ ~( 'there_exists'( compose( X, d ) ) ), =( compose( X, d ), X
% 0.71/1.11     ) ] )
% 0.71/1.11  .
% 0.71/1.11  clause( 19, [ ~( =( codomain( a ), d ) ) ] )
% 0.71/1.11  .
% 0.71/1.11  clause( 78, [ 'there_exists'( domain( d ) ) ] )
% 0.71/1.11  .
% 0.71/1.11  clause( 80, [ 'there_exists'( d ) ] )
% 0.71/1.11  .
% 0.71/1.11  clause( 95, [ =( domain( d ), codomain( a ) ) ] )
% 0.71/1.11  .
% 0.71/1.11  clause( 1131, [ =( codomain( d ), d ) ] )
% 0.71/1.11  .
% 0.71/1.11  clause( 1144, [ =( compose( d, d ), d ) ] )
% 0.71/1.11  .
% 0.71/1.11  clause( 1158, [ =( codomain( a ), d ) ] )
% 0.71/1.11  .
% 0.71/1.11  clause( 1163, [] )
% 0.71/1.11  .
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  % SZS output end Refutation
% 0.71/1.11  found a proof!
% 0.71/1.11  
% 0.71/1.11  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.71/1.11  
% 0.71/1.11  initialclauses(
% 0.71/1.11  [ clause( 1165, [ ~( equivalent( X, Y ) ), 'there_exists'( X ) ] )
% 0.71/1.11  , clause( 1166, [ ~( equivalent( X, Y ) ), =( X, Y ) ] )
% 0.71/1.11  , clause( 1167, [ ~( 'there_exists'( X ) ), ~( =( X, Y ) ), equivalent( X, 
% 0.71/1.11    Y ) ] )
% 0.71/1.11  , clause( 1168, [ ~( 'there_exists'( domain( X ) ) ), 'there_exists'( X ) ]
% 0.71/1.11     )
% 0.71/1.11  , clause( 1169, [ ~( 'there_exists'( codomain( X ) ) ), 'there_exists'( X )
% 0.71/1.11     ] )
% 0.71/1.11  , clause( 1170, [ ~( 'there_exists'( compose( X, Y ) ) ), 'there_exists'( 
% 0.71/1.11    domain( X ) ) ] )
% 0.71/1.11  , clause( 1171, [ ~( 'there_exists'( compose( X, Y ) ) ), =( domain( X ), 
% 0.71/1.11    codomain( Y ) ) ] )
% 0.71/1.11  , clause( 1172, [ ~( 'there_exists'( domain( X ) ) ), ~( =( domain( X ), 
% 0.71/1.11    codomain( Y ) ) ), 'there_exists'( compose( X, Y ) ) ] )
% 0.71/1.11  , clause( 1173, [ =( compose( X, compose( Y, Z ) ), compose( compose( X, Y
% 0.71/1.11     ), Z ) ) ] )
% 0.71/1.11  , clause( 1174, [ =( compose( X, domain( X ) ), X ) ] )
% 0.71/1.11  , clause( 1175, [ =( compose( codomain( X ), X ), X ) ] )
% 0.71/1.11  , clause( 1176, [ ~( equivalent( X, Y ) ), 'there_exists'( Y ) ] )
% 0.71/1.11  , clause( 1177, [ ~( 'there_exists'( X ) ), ~( 'there_exists'( Y ) ), ~( 
% 0.71/1.11    =( X, Y ) ), equivalent( X, Y ) ] )
% 0.71/1.11  , clause( 1178, [ ~( 'there_exists'( compose( X, Y ) ) ), 'there_exists'( 
% 0.71/1.11    codomain( X ) ) ] )
% 0.71/1.11  , clause( 1179, [ 'there_exists'( f1( X, Y ) ), =( X, Y ) ] )
% 0.71/1.11  , clause( 1180, [ =( X, f1( X, Y ) ), =( Y, f1( X, Y ) ), =( X, Y ) ] )
% 0.71/1.11  , clause( 1181, [ ~( =( X, f1( X, Y ) ) ), ~( =( Y, f1( X, Y ) ) ), =( X, Y
% 0.71/1.11     ) ] )
% 0.71/1.11  , clause( 1182, [ 'there_exists'( compose( d, a ) ) ] )
% 0.71/1.11  , clause( 1183, [ ~( 'there_exists'( compose( X, d ) ) ), =( compose( X, d
% 0.71/1.11     ), X ) ] )
% 0.71/1.11  , clause( 1184, [ ~( 'there_exists'( compose( d, X ) ) ), =( compose( d, X
% 0.71/1.11     ), X ) ] )
% 0.71/1.11  , clause( 1185, [ ~( =( codomain( a ), d ) ) ] )
% 0.71/1.11  ] ).
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  
% 0.71/1.11  subsumption(
% 0.71/1.11  clause( 3, [ ~( 'there_exists'( domain( X ) ) ), 'there_exists'( X ) ] )
% 0.71/1.11  , clause( 1168, [ ~( 'there_exists'( domain( X ) ) ), 'there_exists'( X ) ]
% 0.71/1.12     )
% 0.71/1.12  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 
% 0.71/1.12    1 )] ) ).
% 0.71/1.12  
% 0.71/1.12  
% 0.71/1.12  subsumption(
% 0.71/1.12  clause( 5, [ ~( 'there_exists'( compose( X, Y ) ) ), 'there_exists'( domain( 
% 0.71/1.12    X ) ) ] )
% 0.71/1.12  , clause( 1170, [ ~( 'there_exists'( compose( X, Y ) ) ), 'there_exists'( 
% 0.71/1.12    domain( X ) ) ] )
% 0.71/1.12  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.12     ), ==>( 1, 1 )] ) ).
% 0.71/1.12  
% 0.71/1.12  
% 0.71/1.12  subsumption(
% 0.71/1.12  clause( 6, [ ~( 'there_exists'( compose( X, Y ) ) ), =( domain( X ), 
% 0.71/1.12    codomain( Y ) ) ] )
% 0.71/1.12  , clause( 1171, [ ~( 'there_exists'( compose( X, Y ) ) ), =( domain( X ), 
% 0.71/1.12    codomain( Y ) ) ] )
% 0.71/1.12  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.12     ), ==>( 1, 1 )] ) ).
% 0.71/1.12  
% 0.71/1.12  
% 0.71/1.12  subsumption(
% 0.71/1.12  clause( 10, [ =( compose( codomain( X ), X ), X ) ] )
% 0.71/1.12  , clause( 1175, [ =( compose( codomain( X ), X ), X ) ] )
% 0.71/1.12  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.12  
% 0.71/1.12  
% 0.71/1.12  subsumption(
% 0.71/1.12  clause( 16, [ 'there_exists'( compose( d, a ) ) ] )
% 0.71/1.12  , clause( 1182, [ 'there_exists'( compose( d, a ) ) ] )
% 0.71/1.12  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.12  
% 0.71/1.12  
% 0.71/1.12  subsumption(
% 0.71/1.12  clause( 17, [ ~( 'there_exists'( compose( X, d ) ) ), =( compose( X, d ), X
% 0.71/1.12     ) ] )
% 0.71/1.12  , clause( 1183, [ ~( 'there_exists'( compose( X, d ) ) ), =( compose( X, d
% 0.71/1.12     ), X ) ] )
% 0.71/1.12  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 
% 0.71/1.12    1 )] ) ).
% 0.71/1.12  
% 0.71/1.12  
% 0.71/1.12  subsumption(
% 0.71/1.12  clause( 19, [ ~( =( codomain( a ), d ) ) ] )
% 0.71/1.12  , clause( 1185, [ ~( =( codomain( a ), d ) ) ] )
% 0.71/1.12  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.12  
% 0.71/1.12  
% 0.71/1.12  resolution(
% 0.71/1.12  clause( 1288, [ 'there_exists'( domain( d ) ) ] )
% 0.71/1.12  , clause( 5, [ ~( 'there_exists'( compose( X, Y ) ) ), 'there_exists'( 
% 0.71/1.12    domain( X ) ) ] )
% 0.71/1.12  , 0, clause( 16, [ 'there_exists'( compose( d, a ) ) ] )
% 0.71/1.12  , 0, substitution( 0, [ :=( X, d ), :=( Y, a )] ), substitution( 1, [] )
% 0.71/1.12    ).
% 0.71/1.12  
% 0.71/1.12  
% 0.71/1.12  subsumption(
% 0.71/1.12  clause( 78, [ 'there_exists'( domain( d ) ) ] )
% 0.71/1.12  , clause( 1288, [ 'there_exists'( domain( d ) ) ] )
% 0.71/1.12  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.12  
% 0.71/1.12  
% 0.71/1.12  resolution(
% 0.71/1.12  clause( 1289, [ 'there_exists'( d ) ] )
% 0.71/1.12  , clause( 3, [ ~( 'there_exists'( domain( X ) ) ), 'there_exists'( X ) ] )
% 0.71/1.12  , 0, clause( 78, [ 'there_exists'( domain( d ) ) ] )
% 0.71/1.12  , 0, substitution( 0, [ :=( X, d )] ), substitution( 1, [] )).
% 0.71/1.12  
% 0.71/1.12  
% 0.71/1.12  subsumption(
% 0.71/1.12  clause( 80, [ 'there_exists'( d ) ] )
% 0.71/1.12  , clause( 1289, [ 'there_exists'( d ) ] )
% 0.71/1.12  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.12  
% 0.71/1.12  
% 0.71/1.12  eqswap(
% 0.71/1.12  clause( 1290, [ =( codomain( Y ), domain( X ) ), ~( 'there_exists'( compose( 
% 0.71/1.12    X, Y ) ) ) ] )
% 0.71/1.12  , clause( 6, [ ~( 'there_exists'( compose( X, Y ) ) ), =( domain( X ), 
% 0.71/1.12    codomain( Y ) ) ] )
% 0.71/1.12  , 1, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.71/1.12  
% 0.71/1.12  
% 0.71/1.12  resolution(
% 0.71/1.12  clause( 1291, [ =( codomain( a ), domain( d ) ) ] )
% 0.71/1.12  , clause( 1290, [ =( codomain( Y ), domain( X ) ), ~( 'there_exists'( 
% 0.71/1.12    compose( X, Y ) ) ) ] )
% 0.71/1.12  , 1, clause( 16, [ 'there_exists'( compose( d, a ) ) ] )
% 0.71/1.12  , 0, substitution( 0, [ :=( X, d ), :=( Y, a )] ), substitution( 1, [] )
% 0.71/1.12    ).
% 0.71/1.12  
% 0.71/1.12  
% 0.71/1.12  eqswap(
% 0.71/1.12  clause( 1292, [ =( domain( d ), codomain( a ) ) ] )
% 0.71/1.12  , clause( 1291, [ =( codomain( a ), domain( d ) ) ] )
% 0.71/1.12  , 0, substitution( 0, [] )).
% 0.71/1.12  
% 0.71/1.12  
% 0.71/1.12  subsumption(
% 0.71/1.12  clause( 95, [ =( domain( d ), codomain( a ) ) ] )
% 0.71/1.12  , clause( 1292, [ =( domain( d ), codomain( a ) ) ] )
% 0.71/1.12  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.12  
% 0.71/1.12  
% 0.71/1.12  eqswap(
% 0.71/1.12  clause( 1294, [ =( X, compose( X, d ) ), ~( 'there_exists'( compose( X, d )
% 0.71/1.12     ) ) ] )
% 0.71/1.12  , clause( 17, [ ~( 'there_exists'( compose( X, d ) ) ), =( compose( X, d )
% 0.71/1.12    , X ) ] )
% 0.71/1.12  , 1, substitution( 0, [ :=( X, X )] )).
% 0.71/1.12  
% 0.71/1.12  
% 0.71/1.12  paramod(
% 0.71/1.12  clause( 1307, [ ~( 'there_exists'( d ) ), =( codomain( d ), compose( 
% 0.71/1.12    codomain( d ), d ) ) ] )
% 0.71/1.12  , clause( 10, [ =( compose( codomain( X ), X ), X ) ] )
% 0.71/1.12  , 0, clause( 1294, [ =( X, compose( X, d ) ), ~( 'there_exists'( compose( X
% 0.71/1.12    , d ) ) ) ] )
% 0.71/1.12  , 1, 2, substitution( 0, [ :=( X, d )] ), substitution( 1, [ :=( X, 
% 0.71/1.12    codomain( d ) )] )).
% 0.71/1.12  
% 0.71/1.12  
% 0.71/1.12  paramod(
% 0.71/1.12  clause( 1308, [ =( codomain( d ), d ), ~( 'there_exists'( d ) ) ] )
% 0.71/1.12  , clause( 10, [ =( compose( codomain( X ), X ), X ) ] )
% 0.71/1.12  , 0, clause( 1307, [ ~( 'there_exists'( d ) ), =( codomain( d ), compose( 
% 0.71/1.12    codomain( d ), d ) ) ] )
% 0.71/1.12  , 1, 3, substitution( 0, [ :=( X, d )] ), substitution( 1, [] )).
% 0.71/1.12  
% 0.71/1.12  
% 0.71/1.12  resolution(
% 0.71/1.12  clause( 1311, [ =( codomain( d ), d ) ] )
% 0.71/1.12  , clause( 1308, [ =( codomain( d ), d ), ~( 'there_exists'( d ) ) ] )
% 0.71/1.12  , 1, clause( 80, [ 'there_exists'( d ) ] )
% 0.71/1.12  , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.71/1.12  
% 0.71/1.12  
% 0.71/1.12  subsumption(
% 0.71/1.12  clause( 1131, [ =( codomain( d ), d ) ] )
% 0.71/1.12  , clause( 1311, [ =( codomain( d ), d ) ] )
% 0.71/1.12  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.12  
% 0.71/1.12  
% 0.71/1.12  eqswap(
% 0.71/1.12  clause( 1314, [ =( X, compose( codomain( X ), X ) ) ] )
% 0.71/1.12  , clause( 10, [ =( compose( codomain( X ), X ), X ) ] )
% 0.71/1.12  , 0, substitution( 0, [ :=( X, X )] )).
% 0.71/1.12  
% 0.71/1.12  
% 0.71/1.12  paramod(
% 0.71/1.12  clause( 1315, [ =( d, compose( d, d ) ) ] )
% 0.71/1.12  , clause( 1131, [ =( codomain( d ), d ) ] )
% 0.71/1.12  , 0, clause( 1314, [ =( X, compose( codomain( X ), X ) ) ] )
% 0.71/1.12  , 0, 3, substitution( 0, [] ), substitution( 1, [ :=( X, d )] )).
% 0.71/1.12  
% 0.71/1.12  
% 0.71/1.12  eqswap(
% 0.71/1.12  clause( 1316, [ =( compose( d, d ), d ) ] )
% 0.71/1.12  , clause( 1315, [ =( d, compose( d, d ) ) ] )
% 0.71/1.12  , 0, substitution( 0, [] )).
% 0.71/1.12  
% 0.71/1.12  
% 0.71/1.12  subsumption(
% 0.71/1.12  clause( 1144, [ =( compose( d, d ), d ) ] )
% 0.71/1.12  , clause( 1316, [ =( compose( d, d ), d ) ] )
% 0.71/1.12  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.12  
% 0.71/1.12  
% 0.71/1.12  eqswap(
% 0.71/1.12  clause( 1318, [ =( codomain( Y ), domain( X ) ), ~( 'there_exists'( compose( 
% 0.71/1.12    X, Y ) ) ) ] )
% 0.71/1.12  , clause( 6, [ ~( 'there_exists'( compose( X, Y ) ) ), =( domain( X ), 
% 0.71/1.12    codomain( Y ) ) ] )
% 0.71/1.12  , 1, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.71/1.12  
% 0.71/1.12  
% 0.71/1.12  paramod(
% 0.71/1.12  clause( 1321, [ ~( 'there_exists'( d ) ), =( codomain( d ), domain( d ) ) ]
% 0.71/1.12     )
% 0.71/1.12  , clause( 1144, [ =( compose( d, d ), d ) ] )
% 0.71/1.12  , 0, clause( 1318, [ =( codomain( Y ), domain( X ) ), ~( 'there_exists'( 
% 0.71/1.12    compose( X, Y ) ) ) ] )
% 0.71/1.12  , 1, 2, substitution( 0, [] ), substitution( 1, [ :=( X, d ), :=( Y, d )] )
% 0.71/1.12    ).
% 0.71/1.12  
% 0.71/1.12  
% 0.71/1.12  paramod(
% 0.71/1.12  clause( 1322, [ =( codomain( d ), codomain( a ) ), ~( 'there_exists'( d ) )
% 0.71/1.12     ] )
% 0.71/1.12  , clause( 95, [ =( domain( d ), codomain( a ) ) ] )
% 0.71/1.12  , 0, clause( 1321, [ ~( 'there_exists'( d ) ), =( codomain( d ), domain( d
% 0.71/1.12     ) ) ] )
% 0.71/1.12  , 1, 3, substitution( 0, [] ), substitution( 1, [] )).
% 0.71/1.12  
% 0.71/1.12  
% 0.71/1.12  paramod(
% 0.71/1.12  clause( 1323, [ =( d, codomain( a ) ), ~( 'there_exists'( d ) ) ] )
% 0.71/1.12  , clause( 1131, [ =( codomain( d ), d ) ] )
% 0.71/1.12  , 0, clause( 1322, [ =( codomain( d ), codomain( a ) ), ~( 'there_exists'( 
% 0.71/1.12    d ) ) ] )
% 0.71/1.12  , 0, 1, substitution( 0, [] ), substitution( 1, [] )).
% 0.71/1.12  
% 0.71/1.12  
% 0.71/1.12  resolution(
% 0.71/1.12  clause( 1324, [ =( d, codomain( a ) ) ] )
% 0.71/1.12  , clause( 1323, [ =( d, codomain( a ) ), ~( 'there_exists'( d ) ) ] )
% 0.71/1.12  , 1, clause( 80, [ 'there_exists'( d ) ] )
% 0.71/1.12  , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.71/1.12  
% 0.71/1.12  
% 0.71/1.12  eqswap(
% 0.71/1.12  clause( 1325, [ =( codomain( a ), d ) ] )
% 0.71/1.12  , clause( 1324, [ =( d, codomain( a ) ) ] )
% 0.71/1.12  , 0, substitution( 0, [] )).
% 0.71/1.12  
% 0.71/1.12  
% 0.71/1.12  subsumption(
% 0.71/1.12  clause( 1158, [ =( codomain( a ), d ) ] )
% 0.71/1.12  , clause( 1325, [ =( codomain( a ), d ) ] )
% 0.71/1.12  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.12  
% 0.71/1.12  
% 0.71/1.12  resolution(
% 0.71/1.12  clause( 1328, [] )
% 0.71/1.12  , clause( 19, [ ~( =( codomain( a ), d ) ) ] )
% 0.71/1.12  , 0, clause( 1158, [ =( codomain( a ), d ) ] )
% 0.71/1.12  , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.71/1.12  
% 0.71/1.12  
% 0.71/1.12  subsumption(
% 0.71/1.12  clause( 1163, [] )
% 0.71/1.12  , clause( 1328, [] )
% 0.71/1.12  , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.71/1.12  
% 0.71/1.12  
% 0.71/1.12  end.
% 0.71/1.12  
% 0.71/1.12  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.71/1.12  
% 0.71/1.12  Memory use:
% 0.71/1.12  
% 0.71/1.12  space for terms:        14464
% 0.71/1.12  space for clauses:      60006
% 0.71/1.12  
% 0.71/1.12  
% 0.71/1.12  clauses generated:      3089
% 0.71/1.12  clauses kept:           1164
% 0.71/1.12  clauses selected:       68
% 0.71/1.12  clauses deleted:        3
% 0.71/1.12  clauses inuse deleted:  2
% 0.71/1.12  
% 0.71/1.12  subsentry:          7139
% 0.71/1.12  literals s-matched: 5853
% 0.71/1.12  literals matched:   5347
% 0.71/1.12  full subsumption:   1937
% 0.71/1.12  
% 0.71/1.12  checksum:           -1032444416
% 0.71/1.12  
% 0.71/1.12  
% 0.71/1.12  Bliksem ended
%------------------------------------------------------------------------------