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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Bliksem---1.12
% Problem  : LCL294-3 : TPTP v8.1.0. Released v2.3.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 : Sun Jul 17 07:52:34 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : LCL294-3 : TPTP v8.1.0. Released v2.3.0.
% 0.11/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 Jul  3 01:08:54 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.73/1.65  *** allocated 10000 integers for termspace/termends
% 0.73/1.65  *** allocated 10000 integers for clauses
% 0.73/1.65  *** allocated 10000 integers for justifications
% 0.73/1.65  Bliksem 1.12
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  Automatic Strategy Selection
% 0.73/1.65  
% 0.73/1.65  Clauses:
% 0.73/1.65  [
% 0.73/1.65     [ axiom( implies( or( X, X ), X ) ) ],
% 0.73/1.65     [ axiom( implies( X, or( Y, X ) ) ) ],
% 0.73/1.65     [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ],
% 0.73/1.65     [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) ) ) ) ],
% 0.73/1.65     [ axiom( implies( implies( X, Y ), implies( or( Z, X ), or( Z, Y ) ) ) )
% 0.73/1.65     ],
% 0.73/1.65     [ =( implies( X, Y ), or( not( X ), Y ) ) ],
% 0.73/1.65     [ theorem( X ), ~( axiom( X ) ) ],
% 0.73/1.65     [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y ) ) ]
% 0.73/1.65    ,
% 0.73/1.65     [ =( and( X, Y ), not( or( not( X ), not( Y ) ) ) ) ],
% 0.73/1.65     [ =( equivalent( X, Y ), and( implies( X, Y ), implies( Y, X ) ) ) ]
% 0.73/1.65    ,
% 0.73/1.65     [ ~( theorem( equivalent( implies( p, q ), or( not( p ), q ) ) ) ) ]
% 0.73/1.65  ] .
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  percentage equality = 0.214286, percentage horn = 1.000000
% 0.73/1.65  This is a problem with some equality
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  Options Used:
% 0.73/1.65  
% 0.73/1.65  useres =            1
% 0.73/1.65  useparamod =        1
% 0.73/1.65  useeqrefl =         1
% 0.73/1.65  useeqfact =         1
% 0.73/1.65  usefactor =         1
% 0.73/1.65  usesimpsplitting =  0
% 0.73/1.65  usesimpdemod =      5
% 0.73/1.65  usesimpres =        3
% 0.73/1.65  
% 0.73/1.65  resimpinuse      =  1000
% 0.73/1.65  resimpclauses =     20000
% 0.73/1.65  substype =          eqrewr
% 0.73/1.65  backwardsubs =      1
% 0.73/1.65  selectoldest =      5
% 0.73/1.65  
% 0.73/1.65  litorderings [0] =  split
% 0.73/1.65  litorderings [1] =  extend the termordering, first sorting on arguments
% 0.73/1.65  
% 0.73/1.65  termordering =      kbo
% 0.73/1.65  
% 0.73/1.65  litapriori =        0
% 0.73/1.65  termapriori =       1
% 0.73/1.65  litaposteriori =    0
% 0.73/1.65  termaposteriori =   0
% 0.73/1.65  demodaposteriori =  0
% 0.73/1.65  ordereqreflfact =   0
% 0.73/1.65  
% 0.73/1.65  litselect =         negord
% 0.73/1.65  
% 0.73/1.65  maxweight =         15
% 0.73/1.65  maxdepth =          30000
% 0.73/1.65  maxlength =         115
% 0.73/1.65  maxnrvars =         195
% 0.73/1.65  excuselevel =       1
% 0.73/1.65  increasemaxweight = 1
% 0.73/1.65  
% 0.73/1.65  maxselected =       10000000
% 0.73/1.65  maxnrclauses =      10000000
% 0.73/1.65  
% 0.73/1.65  showgenerated =    0
% 0.73/1.65  showkept =         0
% 0.73/1.65  showselected =     0
% 0.73/1.65  showdeleted =      0
% 0.73/1.65  showresimp =       1
% 0.73/1.65  showstatus =       2000
% 0.73/1.65  
% 0.73/1.65  prologoutput =     1
% 0.73/1.65  nrgoals =          5000000
% 0.73/1.65  totalproof =       1
% 0.73/1.65  
% 0.73/1.65  Symbols occurring in the translation:
% 0.73/1.65  
% 0.73/1.65  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 0.73/1.65  .  [1, 2]      (w:1, o:26, a:1, s:1, b:0), 
% 0.73/1.65  !  [4, 1]      (w:0, o:18, a:1, s:1, b:0), 
% 0.73/1.65  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.73/1.65  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.73/1.65  or  [40, 2]      (w:1, o:51, a:1, s:1, b:0), 
% 0.73/1.65  implies  [41, 2]      (w:1, o:52, a:1, s:1, b:0), 
% 0.73/1.65  axiom  [42, 1]      (w:1, o:23, a:1, s:1, b:0), 
% 0.73/1.65  not  [47, 1]      (w:1, o:24, a:1, s:1, b:0), 
% 0.73/1.65  theorem  [48, 1]      (w:1, o:25, a:1, s:1, b:0), 
% 0.73/1.65  and  [51, 2]      (w:1, o:53, a:1, s:1, b:0), 
% 0.73/1.65  equivalent  [52, 2]      (w:1, o:54, a:1, s:1, b:0), 
% 0.73/1.65  p  [53, 0]      (w:1, o:16, a:1, s:1, b:0), 
% 0.73/1.65  q  [54, 0]      (w:1, o:17, a:1, s:1, b:0).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  Starting Search:
% 0.73/1.65  
% 0.73/1.65  Resimplifying inuse:
% 0.73/1.65  Done
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  Intermediate Status:
% 0.73/1.65  Generated:    3749
% 0.73/1.65  Kept:         2035
% 0.73/1.65  Inuse:        111
% 0.73/1.65  Deleted:      4
% 0.73/1.65  Deletedinuse: 4
% 0.73/1.65  
% 0.73/1.65  Resimplifying inuse:
% 0.73/1.65  Done
% 0.73/1.65  
% 0.73/1.65  Resimplifying inuse:
% 0.73/1.65  Done
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  Intermediate Status:
% 0.73/1.65  Generated:    7720
% 0.73/1.65  Kept:         4126
% 0.73/1.65  Inuse:        179
% 0.73/1.65  Deleted:      5
% 0.73/1.65  Deletedinuse: 4
% 0.73/1.65  
% 0.73/1.65  Resimplifying inuse:
% 0.73/1.65  Done
% 0.73/1.65  
% 0.73/1.65  Resimplifying inuse:
% 0.73/1.65  Done
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  Intermediate Status:
% 0.73/1.65  Generated:    12477
% 0.73/1.65  Kept:         6179
% 0.73/1.65  Inuse:        226
% 0.73/1.65  Deleted:      5
% 0.73/1.65  Deletedinuse: 4
% 0.73/1.65  
% 0.73/1.65  Resimplifying inuse:
% 0.73/1.65  Done
% 0.73/1.65  
% 0.73/1.65  Resimplifying inuse:
% 0.73/1.65  Done
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  Intermediate Status:
% 0.73/1.65  Generated:    16697
% 0.73/1.65  Kept:         8232
% 0.73/1.65  Inuse:        257
% 0.73/1.65  Deleted:      5
% 0.73/1.65  Deletedinuse: 4
% 0.73/1.65  
% 0.73/1.65  Resimplifying inuse:
% 0.73/1.65  Done
% 0.73/1.65  
% 0.73/1.65  Resimplifying inuse:
% 0.73/1.65  Done
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  Intermediate Status:
% 0.73/1.65  Generated:    22133
% 0.73/1.65  Kept:         10240
% 0.73/1.65  Inuse:        313
% 0.73/1.65  Deleted:      6
% 0.73/1.65  Deletedinuse: 4
% 0.73/1.65  
% 0.73/1.65  Resimplifying inuse:
% 0.73/1.65  Done
% 0.73/1.65  
% 0.73/1.65  Resimplifying inuse:
% 0.73/1.65  Done
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  Intermediate Status:
% 0.73/1.65  Generated:    27508
% 0.73/1.65  Kept:         12392
% 0.73/1.65  Inuse:        350
% 0.73/1.65  Deleted:      10
% 0.73/1.65  Deletedinuse: 4
% 0.73/1.65  
% 0.73/1.65  Resimplifying inuse:
% 0.73/1.65  Done
% 0.73/1.65  
% 0.73/1.65  Resimplifying inuse:
% 0.73/1.65  Done
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  Intermediate Status:
% 0.73/1.65  Generated:    32476
% 0.73/1.65  Kept:         14651
% 0.73/1.65  Inuse:        385
% 0.73/1.65  Deleted:      10
% 0.73/1.65  Deletedinuse: 4
% 0.73/1.65  
% 0.73/1.65  Resimplifying inuse:
% 0.73/1.65  Done
% 0.73/1.65  
% 0.73/1.65  Resimplifying inuse:
% 0.73/1.65  Done
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  Intermediate Status:
% 0.73/1.65  Generated:    37620
% 0.73/1.65  Kept:         16667
% 0.73/1.65  Inuse:        422
% 0.73/1.65  Deleted:      10
% 0.73/1.65  Deletedinuse: 4
% 0.73/1.65  
% 0.73/1.65  Resimplifying inuse:
% 0.73/1.65  Done
% 0.73/1.65  
% 0.73/1.65  Resimplifying inuse:
% 0.73/1.65  Done
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  Intermediate Status:
% 0.73/1.65  Generated:    42259
% 0.73/1.65  Kept:         18759
% 0.73/1.65  Inuse:        458
% 0.73/1.65  Deleted:      10
% 0.73/1.65  Deletedinuse: 4
% 0.73/1.65  
% 0.73/1.65  Resimplifying inuse:
% 0.73/1.65  Done
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  Bliksems!, er is een bewijs:
% 0.73/1.65  % SZS status Unsatisfiable
% 0.73/1.65  % SZS output start Refutation
% 0.73/1.65  
% 0.73/1.65  clause( 0, [ axiom( implies( or( X, X ), X ) ) ] )
% 0.73/1.65  .
% 0.73/1.65  clause( 1, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 0.73/1.65  .
% 0.73/1.65  clause( 2, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 0.73/1.65  .
% 0.73/1.65  clause( 3, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) ) ) ) ]
% 0.73/1.65     )
% 0.73/1.65  .
% 0.73/1.65  clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.73/1.65  .
% 0.73/1.65  clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.73/1.65  .
% 0.73/1.65  clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y )
% 0.73/1.65     ) ] )
% 0.73/1.65  .
% 0.73/1.65  clause( 8, [ =( not( implies( X, not( Y ) ) ), and( X, Y ) ) ] )
% 0.73/1.65  .
% 0.73/1.65  clause( 9, [ =( and( implies( X, Y ), implies( Y, X ) ), equivalent( X, Y )
% 0.73/1.65     ) ] )
% 0.73/1.65  .
% 0.73/1.65  clause( 10, [ ~( theorem( equivalent( implies( p, q ), implies( p, q ) ) )
% 0.73/1.65     ) ] )
% 0.73/1.65  .
% 0.73/1.65  clause( 11, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 0.73/1.65  .
% 0.73/1.65  clause( 12, [ theorem( implies( or( X, X ), X ) ) ] )
% 0.73/1.65  .
% 0.73/1.65  clause( 16, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 0.73/1.65  .
% 0.73/1.65  clause( 20, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X ) )
% 0.73/1.65     ) ] )
% 0.73/1.65  .
% 0.73/1.65  clause( 36, [ ~( theorem( or( X, X ) ) ), theorem( Y ), ~( theorem( implies( 
% 0.73/1.65    X, Y ) ) ) ] )
% 0.73/1.65  .
% 0.73/1.65  clause( 66, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 0.73/1.65  .
% 0.73/1.65  clause( 68, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y ) ), X
% 0.73/1.65     ) ) ) ] )
% 0.73/1.65  .
% 0.73/1.65  clause( 126, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies( X
% 0.73/1.65    , Z ) ) ) ) ] )
% 0.73/1.65  .
% 0.73/1.65  clause( 133, [ theorem( implies( implies( X, not( X ) ), not( X ) ) ) ] )
% 0.73/1.65  .
% 0.73/1.65  clause( 168, [ =( implies( implies( X, not( Y ) ), Z ), or( and( X, Y ), Z
% 0.73/1.65     ) ) ] )
% 0.73/1.65  .
% 0.73/1.65  clause( 2527, [ theorem( or( and( X, X ), not( X ) ) ) ] )
% 0.73/1.65  .
% 0.73/1.65  clause( 2552, [ theorem( implies( X, and( X, X ) ) ) ] )
% 0.73/1.65  .
% 0.73/1.65  clause( 2556, [ ~( theorem( or( X, X ) ) ), theorem( and( X, X ) ) ] )
% 0.73/1.65  .
% 0.73/1.65  clause( 19018, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 0.73/1.65  .
% 0.73/1.65  clause( 19113, [ theorem( equivalent( X, X ) ) ] )
% 0.73/1.65  .
% 0.73/1.65  clause( 19259, [] )
% 0.73/1.65  .
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  % SZS output end Refutation
% 0.73/1.65  found a proof!
% 0.73/1.65  
% 0.73/1.65  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.73/1.65  
% 0.73/1.65  initialclauses(
% 0.73/1.65  [ clause( 19261, [ axiom( implies( or( X, X ), X ) ) ] )
% 0.73/1.65  , clause( 19262, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 0.73/1.65  , clause( 19263, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 0.73/1.65  , clause( 19264, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) )
% 0.73/1.65     ) ) ] )
% 0.73/1.65  , clause( 19265, [ axiom( implies( implies( X, Y ), implies( or( Z, X ), or( 
% 0.73/1.65    Z, Y ) ) ) ) ] )
% 0.73/1.65  , clause( 19266, [ =( implies( X, Y ), or( not( X ), Y ) ) ] )
% 0.73/1.65  , clause( 19267, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.73/1.65  , clause( 19268, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( 
% 0.73/1.65    theorem( Y ) ) ] )
% 0.73/1.65  , clause( 19269, [ =( and( X, Y ), not( or( not( X ), not( Y ) ) ) ) ] )
% 0.73/1.65  , clause( 19270, [ =( equivalent( X, Y ), and( implies( X, Y ), implies( Y
% 0.73/1.65    , X ) ) ) ] )
% 0.73/1.65  , clause( 19271, [ ~( theorem( equivalent( implies( p, q ), or( not( p ), q
% 0.73/1.65     ) ) ) ) ] )
% 0.73/1.65  ] ).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  subsumption(
% 0.73/1.65  clause( 0, [ axiom( implies( or( X, X ), X ) ) ] )
% 0.73/1.65  , clause( 19261, [ axiom( implies( or( X, X ), X ) ) ] )
% 0.73/1.65  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  subsumption(
% 0.73/1.65  clause( 1, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 0.73/1.65  , clause( 19262, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 0.73/1.65  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.73/1.65     )] ) ).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  subsumption(
% 0.73/1.65  clause( 2, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 0.73/1.65  , clause( 19263, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 0.73/1.65  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.73/1.65     )] ) ).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  subsumption(
% 0.73/1.65  clause( 3, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) ) ) ) ]
% 0.73/1.65     )
% 0.73/1.65  , clause( 19264, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) )
% 0.73/1.65     ) ) ] )
% 0.73/1.65  , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ), 
% 0.73/1.65    permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  eqswap(
% 0.73/1.65  clause( 19272, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.73/1.65  , clause( 19266, [ =( implies( X, Y ), or( not( X ), Y ) ) ] )
% 0.73/1.65  , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  subsumption(
% 0.73/1.65  clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.73/1.65  , clause( 19272, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.73/1.65  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.73/1.65     )] ) ).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  subsumption(
% 0.73/1.65  clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.73/1.65  , clause( 19267, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.73/1.65  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 
% 0.73/1.65    1 )] ) ).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  subsumption(
% 0.73/1.65  clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y )
% 0.73/1.65     ) ] )
% 0.73/1.65  , clause( 19268, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( 
% 0.73/1.65    theorem( Y ) ) ] )
% 0.73/1.65  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.73/1.65     ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  paramod(
% 0.73/1.65  clause( 19288, [ =( and( X, Y ), not( implies( X, not( Y ) ) ) ) ] )
% 0.73/1.65  , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.73/1.65  , 0, clause( 19269, [ =( and( X, Y ), not( or( not( X ), not( Y ) ) ) ) ]
% 0.73/1.65     )
% 0.73/1.65  , 0, 5, substitution( 0, [ :=( X, X ), :=( Y, not( Y ) )] ), substitution( 
% 0.73/1.65    1, [ :=( X, X ), :=( Y, Y )] )).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  eqswap(
% 0.73/1.65  clause( 19289, [ =( not( implies( X, not( Y ) ) ), and( X, Y ) ) ] )
% 0.73/1.65  , clause( 19288, [ =( and( X, Y ), not( implies( X, not( Y ) ) ) ) ] )
% 0.73/1.65  , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  subsumption(
% 0.73/1.65  clause( 8, [ =( not( implies( X, not( Y ) ) ), and( X, Y ) ) ] )
% 0.73/1.65  , clause( 19289, [ =( not( implies( X, not( Y ) ) ), and( X, Y ) ) ] )
% 0.73/1.65  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.73/1.65     )] ) ).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  eqswap(
% 0.73/1.65  clause( 19292, [ =( and( implies( X, Y ), implies( Y, X ) ), equivalent( X
% 0.73/1.65    , Y ) ) ] )
% 0.73/1.65  , clause( 19270, [ =( equivalent( X, Y ), and( implies( X, Y ), implies( Y
% 0.73/1.65    , X ) ) ) ] )
% 0.73/1.65  , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  subsumption(
% 0.73/1.65  clause( 9, [ =( and( implies( X, Y ), implies( Y, X ) ), equivalent( X, Y )
% 0.73/1.65     ) ] )
% 0.73/1.65  , clause( 19292, [ =( and( implies( X, Y ), implies( Y, X ) ), equivalent( 
% 0.73/1.65    X, Y ) ) ] )
% 0.73/1.65  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.73/1.65     )] ) ).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  paramod(
% 0.73/1.65  clause( 19313, [ ~( theorem( equivalent( implies( p, q ), implies( p, q ) )
% 0.73/1.65     ) ) ] )
% 0.73/1.65  , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.73/1.65  , 0, clause( 19271, [ ~( theorem( equivalent( implies( p, q ), or( not( p )
% 0.73/1.65    , q ) ) ) ) ] )
% 0.73/1.65  , 0, 6, substitution( 0, [ :=( X, p ), :=( Y, q )] ), substitution( 1, [] )
% 0.73/1.65    ).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  subsumption(
% 0.73/1.65  clause( 10, [ ~( theorem( equivalent( implies( p, q ), implies( p, q ) ) )
% 0.73/1.65     ) ] )
% 0.73/1.65  , clause( 19313, [ ~( theorem( equivalent( implies( p, q ), implies( p, q )
% 0.73/1.65     ) ) ) ] )
% 0.73/1.65  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  resolution(
% 0.73/1.65  clause( 19314, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 0.73/1.65  , clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.73/1.65  , 1, clause( 1, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 0.73/1.65  , 0, substitution( 0, [ :=( X, implies( X, or( Y, X ) ) )] ), 
% 0.73/1.65    substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  subsumption(
% 0.73/1.65  clause( 11, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 0.73/1.65  , clause( 19314, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 0.73/1.65  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.73/1.65     )] ) ).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  resolution(
% 0.73/1.65  clause( 19315, [ theorem( implies( or( X, X ), X ) ) ] )
% 0.73/1.65  , clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.73/1.65  , 1, clause( 0, [ axiom( implies( or( X, X ), X ) ) ] )
% 0.73/1.65  , 0, substitution( 0, [ :=( X, implies( or( X, X ), X ) )] ), 
% 0.73/1.65    substitution( 1, [ :=( X, X )] )).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  subsumption(
% 0.73/1.65  clause( 12, [ theorem( implies( or( X, X ), X ) ) ] )
% 0.73/1.65  , clause( 19315, [ theorem( implies( or( X, X ), X ) ) ] )
% 0.73/1.65  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  resolution(
% 0.73/1.65  clause( 19316, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 0.73/1.65  , clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y
% 0.73/1.65     ) ) ] )
% 0.73/1.65  , 1, clause( 12, [ theorem( implies( or( X, X ), X ) ) ] )
% 0.73/1.65  , 0, substitution( 0, [ :=( X, X ), :=( Y, or( X, X ) )] ), substitution( 1
% 0.73/1.65    , [ :=( X, X )] )).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  subsumption(
% 0.73/1.65  clause( 16, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 0.73/1.65  , clause( 19316, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 0.73/1.65  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 
% 0.73/1.65    1 )] ) ).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  resolution(
% 0.73/1.65  clause( 19318, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X )
% 0.73/1.65     ) ) ] )
% 0.73/1.65  , clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y
% 0.73/1.65     ) ) ] )
% 0.73/1.65  , 1, clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.73/1.65  , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [ :=( X
% 0.73/1.65    , implies( Y, X ) )] )).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  subsumption(
% 0.73/1.65  clause( 20, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X ) )
% 0.73/1.65     ) ] )
% 0.73/1.65  , clause( 19318, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X
% 0.73/1.65     ) ) ) ] )
% 0.73/1.65  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.73/1.65     ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  resolution(
% 0.73/1.65  clause( 19322, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( 
% 0.73/1.65    or( Y, Y ) ) ) ] )
% 0.73/1.65  , clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y
% 0.73/1.65     ) ) ] )
% 0.73/1.65  , 2, clause( 16, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 0.73/1.65  , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [ :=( X
% 0.73/1.65    , Y )] )).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  subsumption(
% 0.73/1.65  clause( 36, [ ~( theorem( or( X, X ) ) ), theorem( Y ), ~( theorem( implies( 
% 0.73/1.65    X, Y ) ) ) ] )
% 0.73/1.65  , clause( 19322, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( 
% 0.73/1.65    theorem( or( Y, Y ) ) ) ] )
% 0.73/1.65  , substitution( 0, [ :=( X, Y ), :=( Y, X )] ), permutation( 0, [ ==>( 0, 1
% 0.73/1.65     ), ==>( 1, 2 ), ==>( 2, 0 )] ) ).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  resolution(
% 0.73/1.65  clause( 19323, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 0.73/1.65  , clause( 20, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X )
% 0.73/1.65     ) ) ] )
% 0.73/1.65  , 2, clause( 2, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 0.73/1.65  , 0, substitution( 0, [ :=( X, or( X, Y ) ), :=( Y, or( Y, X ) )] ), 
% 0.73/1.65    substitution( 1, [ :=( X, Y ), :=( Y, X )] )).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  subsumption(
% 0.73/1.65  clause( 66, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 0.73/1.65  , clause( 19323, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 0.73/1.65  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.73/1.65     ), ==>( 1, 1 )] ) ).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  resolution(
% 0.73/1.65  clause( 19324, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y ) )
% 0.73/1.65    , X ) ) ) ] )
% 0.73/1.65  , clause( 20, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X )
% 0.73/1.65     ) ) ] )
% 0.73/1.65  , 1, clause( 11, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 0.73/1.65  , 0, substitution( 0, [ :=( X, X ), :=( Y, implies( Y, or( Z, Y ) ) )] ), 
% 0.73/1.65    substitution( 1, [ :=( X, Y ), :=( Y, Z )] )).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  subsumption(
% 0.73/1.65  clause( 68, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y ) ), X
% 0.73/1.65     ) ) ) ] )
% 0.73/1.65  , clause( 19324, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y )
% 0.73/1.65     ), X ) ) ) ] )
% 0.73/1.65  , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ), 
% 0.73/1.65    permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  paramod(
% 0.73/1.65  clause( 19330, [ axiom( implies( or( not( X ), or( Y, Z ) ), or( Y, implies( 
% 0.73/1.65    X, Z ) ) ) ) ] )
% 0.73/1.65  , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.73/1.65  , 0, clause( 3, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) )
% 0.73/1.65     ) ) ] )
% 0.73/1.65  , 0, 10, substitution( 0, [ :=( X, X ), :=( Y, Z )] ), substitution( 1, [ 
% 0.73/1.65    :=( X, not( X ) ), :=( Y, Y ), :=( Z, Z )] )).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  paramod(
% 0.73/1.65  clause( 19333, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies( 
% 0.73/1.65    X, Z ) ) ) ) ] )
% 0.73/1.65  , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.73/1.65  , 0, clause( 19330, [ axiom( implies( or( not( X ), or( Y, Z ) ), or( Y, 
% 0.73/1.65    implies( X, Z ) ) ) ) ] )
% 0.73/1.65  , 0, 2, substitution( 0, [ :=( X, X ), :=( Y, or( Y, Z ) )] ), 
% 0.73/1.65    substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  subsumption(
% 0.73/1.65  clause( 126, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies( X
% 0.73/1.65    , Z ) ) ) ) ] )
% 0.73/1.65  , clause( 19333, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies( 
% 0.73/1.65    X, Z ) ) ) ) ] )
% 0.73/1.65  , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ), 
% 0.73/1.65    permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  paramod(
% 0.73/1.65  clause( 19335, [ theorem( implies( implies( X, not( X ) ), not( X ) ) ) ]
% 0.73/1.65     )
% 0.73/1.65  , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.73/1.65  , 0, clause( 12, [ theorem( implies( or( X, X ), X ) ) ] )
% 0.73/1.65  , 0, 2, substitution( 0, [ :=( X, X ), :=( Y, not( X ) )] ), substitution( 
% 0.73/1.65    1, [ :=( X, not( X ) )] )).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  subsumption(
% 0.73/1.65  clause( 133, [ theorem( implies( implies( X, not( X ) ), not( X ) ) ) ] )
% 0.73/1.65  , clause( 19335, [ theorem( implies( implies( X, not( X ) ), not( X ) ) ) ]
% 0.73/1.65     )
% 0.73/1.65  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  eqswap(
% 0.73/1.65  clause( 19337, [ =( implies( X, Y ), or( not( X ), Y ) ) ] )
% 0.73/1.65  , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.73/1.65  , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  paramod(
% 0.73/1.65  clause( 19338, [ =( implies( implies( X, not( Y ) ), Z ), or( and( X, Y ), 
% 0.73/1.65    Z ) ) ] )
% 0.73/1.65  , clause( 8, [ =( not( implies( X, not( Y ) ) ), and( X, Y ) ) ] )
% 0.73/1.65  , 0, clause( 19337, [ =( implies( X, Y ), or( not( X ), Y ) ) ] )
% 0.73/1.65  , 0, 8, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [ 
% 0.73/1.65    :=( X, implies( X, not( Y ) ) ), :=( Y, Z )] )).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  subsumption(
% 0.73/1.65  clause( 168, [ =( implies( implies( X, not( Y ) ), Z ), or( and( X, Y ), Z
% 0.73/1.65     ) ) ] )
% 0.73/1.65  , clause( 19338, [ =( implies( implies( X, not( Y ) ), Z ), or( and( X, Y )
% 0.73/1.65    , Z ) ) ] )
% 0.73/1.65  , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ), 
% 0.73/1.65    permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  paramod(
% 0.73/1.65  clause( 19341, [ theorem( or( and( X, X ), not( X ) ) ) ] )
% 0.73/1.65  , clause( 168, [ =( implies( implies( X, not( Y ) ), Z ), or( and( X, Y ), 
% 0.73/1.65    Z ) ) ] )
% 0.73/1.65  , 0, clause( 133, [ theorem( implies( implies( X, not( X ) ), not( X ) ) )
% 0.73/1.65     ] )
% 0.73/1.65  , 0, 1, substitution( 0, [ :=( X, X ), :=( Y, X ), :=( Z, not( X ) )] ), 
% 0.73/1.65    substitution( 1, [ :=( X, X )] )).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  subsumption(
% 0.73/1.65  clause( 2527, [ theorem( or( and( X, X ), not( X ) ) ) ] )
% 0.73/1.65  , clause( 19341, [ theorem( or( and( X, X ), not( X ) ) ) ] )
% 0.73/1.65  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  resolution(
% 0.73/1.65  clause( 19343, [ theorem( or( not( X ), and( X, X ) ) ) ] )
% 0.73/1.65  , clause( 66, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 0.73/1.65  , 1, clause( 2527, [ theorem( or( and( X, X ), not( X ) ) ) ] )
% 0.73/1.65  , 0, substitution( 0, [ :=( X, not( X ) ), :=( Y, and( X, X ) )] ), 
% 0.73/1.65    substitution( 1, [ :=( X, X )] )).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  paramod(
% 0.73/1.65  clause( 19344, [ theorem( implies( X, and( X, X ) ) ) ] )
% 0.73/1.65  , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.73/1.65  , 0, clause( 19343, [ theorem( or( not( X ), and( X, X ) ) ) ] )
% 0.73/1.65  , 0, 1, substitution( 0, [ :=( X, X ), :=( Y, and( X, X ) )] ), 
% 0.73/1.65    substitution( 1, [ :=( X, X )] )).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  subsumption(
% 0.73/1.65  clause( 2552, [ theorem( implies( X, and( X, X ) ) ) ] )
% 0.73/1.65  , clause( 19344, [ theorem( implies( X, and( X, X ) ) ) ] )
% 0.73/1.65  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  resolution(
% 0.73/1.65  clause( 19345, [ ~( theorem( or( X, X ) ) ), theorem( and( X, X ) ) ] )
% 0.73/1.65  , clause( 36, [ ~( theorem( or( X, X ) ) ), theorem( Y ), ~( theorem( 
% 0.73/1.65    implies( X, Y ) ) ) ] )
% 0.73/1.65  , 2, clause( 2552, [ theorem( implies( X, and( X, X ) ) ) ] )
% 0.73/1.65  , 0, substitution( 0, [ :=( X, X ), :=( Y, and( X, X ) )] ), substitution( 
% 0.73/1.65    1, [ :=( X, X )] )).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  subsumption(
% 0.73/1.65  clause( 2556, [ ~( theorem( or( X, X ) ) ), theorem( and( X, X ) ) ] )
% 0.73/1.65  , clause( 19345, [ ~( theorem( or( X, X ) ) ), theorem( and( X, X ) ) ] )
% 0.73/1.65  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 
% 0.73/1.65    1 )] ) ).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  resolution(
% 0.73/1.65  clause( 19346, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 0.73/1.65  , clause( 68, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y ) ), 
% 0.73/1.65    X ) ) ) ] )
% 0.73/1.65  , 1, clause( 126, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, 
% 0.73/1.65    implies( X, Z ) ) ) ) ] )
% 0.73/1.65  , 0, substitution( 0, [ :=( X, or( X, implies( Y, Y ) ) ), :=( Y, Y ), :=( 
% 0.73/1.65    Z, X )] ), substitution( 1, [ :=( X, Y ), :=( Y, X ), :=( Z, Y )] )).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  subsumption(
% 0.73/1.65  clause( 19018, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 0.73/1.65  , clause( 19346, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 0.73/1.65  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.73/1.65     )] ) ).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  resolution(
% 0.73/1.65  clause( 19348, [ theorem( and( implies( X, X ), implies( X, X ) ) ) ] )
% 0.73/1.65  , clause( 2556, [ ~( theorem( or( X, X ) ) ), theorem( and( X, X ) ) ] )
% 0.73/1.65  , 0, clause( 19018, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 0.73/1.65  , 0, substitution( 0, [ :=( X, implies( X, X ) )] ), substitution( 1, [ 
% 0.73/1.65    :=( X, implies( X, X ) ), :=( Y, X )] )).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  paramod(
% 0.73/1.65  clause( 19349, [ theorem( equivalent( X, X ) ) ] )
% 0.73/1.65  , clause( 9, [ =( and( implies( X, Y ), implies( Y, X ) ), equivalent( X, Y
% 0.73/1.65     ) ) ] )
% 0.73/1.65  , 0, clause( 19348, [ theorem( and( implies( X, X ), implies( X, X ) ) ) ]
% 0.73/1.65     )
% 0.73/1.65  , 0, 1, substitution( 0, [ :=( X, X ), :=( Y, X )] ), substitution( 1, [ 
% 0.73/1.65    :=( X, X )] )).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  subsumption(
% 0.73/1.65  clause( 19113, [ theorem( equivalent( X, X ) ) ] )
% 0.73/1.65  , clause( 19349, [ theorem( equivalent( X, X ) ) ] )
% 0.73/1.65  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  resolution(
% 0.73/1.65  clause( 19350, [] )
% 0.73/1.65  , clause( 10, [ ~( theorem( equivalent( implies( p, q ), implies( p, q ) )
% 0.73/1.65     ) ) ] )
% 0.73/1.65  , 0, clause( 19113, [ theorem( equivalent( X, X ) ) ] )
% 0.73/1.65  , 0, substitution( 0, [] ), substitution( 1, [ :=( X, implies( p, q ) )] )
% 0.73/1.65    ).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  subsumption(
% 0.73/1.65  clause( 19259, [] )
% 0.73/1.65  , clause( 19350, [] )
% 0.73/1.65  , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  end.
% 0.73/1.65  
% 0.73/1.65  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.73/1.65  
% 0.73/1.65  Memory use:
% 0.73/1.65  
% 0.73/1.65  space for terms:        292657
% 0.73/1.65  space for clauses:      877650
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  clauses generated:      43108
% 0.73/1.65  clauses kept:           19260
% 0.73/1.65  clauses selected:       467
% 0.73/1.65  clauses deleted:        10
% 0.73/1.65  clauses inuse deleted:  4
% 0.73/1.65  
% 0.73/1.65  subsentry:          391610
% 0.73/1.65  literals s-matched: 198479
% 0.73/1.65  literals matched:   187743
% 0.73/1.65  full subsumption:   73099
% 0.73/1.65  
% 0.73/1.65  checksum:           -1844681175
% 0.73/1.65  
% 0.73/1.65  
% 0.73/1.65  Bliksem ended
%------------------------------------------------------------------------------