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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Bliksem---1.12
% Problem  : LCL178-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : bliksem %s

% Computer : n026.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:51:17 EDT 2022

% Result   : Unsatisfiable 0.74s 1.55s
% Output   : Refutation 0.74s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : LCL178-3 : TPTP v8.1.0. Released v2.3.0.
% 0.12/0.14  % Command  : bliksem %s
% 0.13/0.35  % Computer : n026.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % DateTime : Mon Jul  4 13:00:52 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.74/1.55  *** allocated 10000 integers for termspace/termends
% 0.74/1.55  *** allocated 10000 integers for clauses
% 0.74/1.55  *** allocated 10000 integers for justifications
% 0.74/1.55  Bliksem 1.12
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  Automatic Strategy Selection
% 0.74/1.55  
% 0.74/1.55  Clauses:
% 0.74/1.55  [
% 0.74/1.55     [ axiom( implies( or( X, X ), X ) ) ],
% 0.74/1.55     [ axiom( implies( X, or( Y, X ) ) ) ],
% 0.74/1.55     [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ],
% 0.74/1.55     [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) ) ) ) ],
% 0.74/1.55     [ axiom( implies( implies( X, Y ), implies( or( Z, X ), or( Z, Y ) ) ) )
% 0.74/1.55     ],
% 0.74/1.55     [ =( implies( X, Y ), or( not( X ), Y ) ) ],
% 0.74/1.55     [ theorem( X ), ~( axiom( X ) ) ],
% 0.74/1.55     [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y ) ) ]
% 0.74/1.55    ,
% 0.74/1.55     [ ~( theorem( implies( p, not( not( p ) ) ) ) ) ]
% 0.74/1.55  ] .
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  percentage equality = 0.083333, percentage horn = 1.000000
% 0.74/1.55  This is a problem with some equality
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  Options Used:
% 0.74/1.55  
% 0.74/1.55  useres =            1
% 0.74/1.55  useparamod =        1
% 0.74/1.55  useeqrefl =         1
% 0.74/1.55  useeqfact =         1
% 0.74/1.55  usefactor =         1
% 0.74/1.55  usesimpsplitting =  0
% 0.74/1.55  usesimpdemod =      5
% 0.74/1.55  usesimpres =        3
% 0.74/1.55  
% 0.74/1.55  resimpinuse      =  1000
% 0.74/1.55  resimpclauses =     20000
% 0.74/1.55  substype =          eqrewr
% 0.74/1.55  backwardsubs =      1
% 0.74/1.55  selectoldest =      5
% 0.74/1.55  
% 0.74/1.55  litorderings [0] =  split
% 0.74/1.55  litorderings [1] =  extend the termordering, first sorting on arguments
% 0.74/1.55  
% 0.74/1.55  termordering =      kbo
% 0.74/1.55  
% 0.74/1.55  litapriori =        0
% 0.74/1.55  termapriori =       1
% 0.74/1.55  litaposteriori =    0
% 0.74/1.55  termaposteriori =   0
% 0.74/1.55  demodaposteriori =  0
% 0.74/1.55  ordereqreflfact =   0
% 0.74/1.55  
% 0.74/1.55  litselect =         negord
% 0.74/1.55  
% 0.74/1.55  maxweight =         15
% 0.74/1.55  maxdepth =          30000
% 0.74/1.55  maxlength =         115
% 0.74/1.55  maxnrvars =         195
% 0.74/1.55  excuselevel =       1
% 0.74/1.55  increasemaxweight = 1
% 0.74/1.55  
% 0.74/1.55  maxselected =       10000000
% 0.74/1.55  maxnrclauses =      10000000
% 0.74/1.55  
% 0.74/1.55  showgenerated =    0
% 0.74/1.55  showkept =         0
% 0.74/1.55  showselected =     0
% 0.74/1.55  showdeleted =      0
% 0.74/1.55  showresimp =       1
% 0.74/1.55  showstatus =       2000
% 0.74/1.55  
% 0.74/1.55  prologoutput =     1
% 0.74/1.55  nrgoals =          5000000
% 0.74/1.55  totalproof =       1
% 0.74/1.55  
% 0.74/1.55  Symbols occurring in the translation:
% 0.74/1.55  
% 0.74/1.55  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 0.74/1.55  .  [1, 2]      (w:1, o:23, a:1, s:1, b:0), 
% 0.74/1.55  !  [4, 1]      (w:0, o:15, a:1, s:1, b:0), 
% 0.74/1.55  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.74/1.55  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.74/1.55  or  [40, 2]      (w:1, o:48, a:1, s:1, b:0), 
% 0.74/1.55  implies  [41, 2]      (w:1, o:49, a:1, s:1, b:0), 
% 0.74/1.55  axiom  [42, 1]      (w:1, o:20, a:1, s:1, b:0), 
% 0.74/1.55  not  [47, 1]      (w:1, o:21, a:1, s:1, b:0), 
% 0.74/1.55  theorem  [48, 1]      (w:1, o:22, a:1, s:1, b:0), 
% 0.74/1.55  p  [49, 0]      (w:1, o:14, a:1, s:1, b:0).
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  Starting Search:
% 0.74/1.55  
% 0.74/1.55  Resimplifying inuse:
% 0.74/1.55  Done
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  Intermediate Status:
% 0.74/1.55  Generated:    3679
% 0.74/1.55  Kept:         2061
% 0.74/1.55  Inuse:        109
% 0.74/1.55  Deleted:      3
% 0.74/1.55  Deletedinuse: 1
% 0.74/1.55  
% 0.74/1.55  Resimplifying inuse:
% 0.74/1.55  Done
% 0.74/1.55  
% 0.74/1.55  Resimplifying inuse:
% 0.74/1.55  Done
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  Intermediate Status:
% 0.74/1.55  Generated:    8117
% 0.74/1.55  Kept:         4125
% 0.74/1.55  Inuse:        177
% 0.74/1.55  Deleted:      6
% 0.74/1.55  Deletedinuse: 1
% 0.74/1.55  
% 0.74/1.55  Resimplifying inuse:
% 0.74/1.55  Done
% 0.74/1.55  
% 0.74/1.55  Resimplifying inuse:
% 0.74/1.55  Done
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  Intermediate Status:
% 0.74/1.55  Generated:    13740
% 0.74/1.55  Kept:         6164
% 0.74/1.55  Inuse:        236
% 0.74/1.55  Deleted:      6
% 0.74/1.55  Deletedinuse: 1
% 0.74/1.55  
% 0.74/1.55  Resimplifying inuse:
% 0.74/1.55  Done
% 0.74/1.55  
% 0.74/1.55  Resimplifying inuse:
% 0.74/1.55  Done
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  Intermediate Status:
% 0.74/1.55  Generated:    18616
% 0.74/1.55  Kept:         8365
% 0.74/1.55  Inuse:        269
% 0.74/1.55  Deleted:      12
% 0.74/1.55  Deletedinuse: 1
% 0.74/1.55  
% 0.74/1.55  Resimplifying inuse:
% 0.74/1.55  Done
% 0.74/1.55  
% 0.74/1.55  Resimplifying inuse:
% 0.74/1.55  Done
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  Intermediate Status:
% 0.74/1.55  Generated:    22442
% 0.74/1.55  Kept:         10416
% 0.74/1.55  Inuse:        285
% 0.74/1.55  Deleted:      12
% 0.74/1.55  Deletedinuse: 1
% 0.74/1.55  
% 0.74/1.55  Resimplifying inuse:
% 0.74/1.55  Done
% 0.74/1.55  
% 0.74/1.55  Resimplifying inuse:
% 0.74/1.55  Done
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  Intermediate Status:
% 0.74/1.55  Generated:    28182
% 0.74/1.55  Kept:         12457
% 0.74/1.55  Inuse:        333
% 0.74/1.55  Deleted:      12
% 0.74/1.55  Deletedinuse: 1
% 0.74/1.55  
% 0.74/1.55  Resimplifying inuse:
% 0.74/1.55  Done
% 0.74/1.55  
% 0.74/1.55  Resimplifying inuse:
% 0.74/1.55  Done
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  Intermediate Status:
% 0.74/1.55  Generated:    32319
% 0.74/1.55  Kept:         14515
% 0.74/1.55  Inuse:        360
% 0.74/1.55  Deleted:      12
% 0.74/1.55  Deletedinuse: 1
% 0.74/1.55  
% 0.74/1.55  Resimplifying inuse:
% 0.74/1.55  Done
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  Bliksems!, er is een bewijs:
% 0.74/1.55  % SZS status Unsatisfiable
% 0.74/1.55  % SZS output start Refutation
% 0.74/1.55  
% 0.74/1.55  clause( 0, [ axiom( implies( or( X, X ), X ) ) ] )
% 0.74/1.55  .
% 0.74/1.55  clause( 1, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 0.74/1.55  .
% 0.74/1.55  clause( 2, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 0.74/1.55  .
% 0.74/1.55  clause( 3, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) ) ) ) ]
% 0.74/1.55     )
% 0.74/1.55  .
% 0.74/1.55  clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.74/1.55  .
% 0.74/1.55  clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.74/1.55  .
% 0.74/1.55  clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y )
% 0.74/1.55     ) ] )
% 0.74/1.55  .
% 0.74/1.55  clause( 8, [ ~( theorem( implies( p, not( not( p ) ) ) ) ) ] )
% 0.74/1.55  .
% 0.74/1.55  clause( 9, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 0.74/1.55  .
% 0.74/1.55  clause( 10, [ theorem( implies( or( X, X ), X ) ) ] )
% 0.74/1.55  .
% 0.74/1.55  clause( 16, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 0.74/1.55  .
% 0.74/1.55  clause( 20, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X ) )
% 0.74/1.55     ) ] )
% 0.74/1.55  .
% 0.74/1.55  clause( 72, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 0.74/1.55  .
% 0.74/1.55  clause( 74, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y ) ), X
% 0.74/1.55     ) ) ) ] )
% 0.74/1.55  .
% 0.74/1.55  clause( 99, [ theorem( implies( X, Y ) ), ~( theorem( or( Y, not( X ) ) ) )
% 0.74/1.55     ] )
% 0.74/1.55  .
% 0.74/1.55  clause( 109, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies( X
% 0.74/1.55    , Z ) ) ) ) ] )
% 0.74/1.55  .
% 0.74/1.55  clause( 6023, [ ~( theorem( implies( not( p ), not( p ) ) ) ) ] )
% 0.74/1.55  .
% 0.74/1.55  clause( 15394, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 0.74/1.55  .
% 0.74/1.55  clause( 15539, [ theorem( implies( X, X ) ) ] )
% 0.74/1.55  .
% 0.74/1.55  clause( 15580, [] )
% 0.74/1.55  .
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  % SZS output end Refutation
% 0.74/1.55  found a proof!
% 0.74/1.55  
% 0.74/1.55  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.74/1.55  
% 0.74/1.55  initialclauses(
% 0.74/1.55  [ clause( 15582, [ axiom( implies( or( X, X ), X ) ) ] )
% 0.74/1.55  , clause( 15583, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 0.74/1.55  , clause( 15584, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 0.74/1.55  , clause( 15585, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) )
% 0.74/1.55     ) ) ] )
% 0.74/1.55  , clause( 15586, [ axiom( implies( implies( X, Y ), implies( or( Z, X ), or( 
% 0.74/1.55    Z, Y ) ) ) ) ] )
% 0.74/1.55  , clause( 15587, [ =( implies( X, Y ), or( not( X ), Y ) ) ] )
% 0.74/1.55  , clause( 15588, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.74/1.55  , clause( 15589, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( 
% 0.74/1.55    theorem( Y ) ) ] )
% 0.74/1.55  , clause( 15590, [ ~( theorem( implies( p, not( not( p ) ) ) ) ) ] )
% 0.74/1.55  ] ).
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  subsumption(
% 0.74/1.55  clause( 0, [ axiom( implies( or( X, X ), X ) ) ] )
% 0.74/1.55  , clause( 15582, [ axiom( implies( or( X, X ), X ) ) ] )
% 0.74/1.55  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  subsumption(
% 0.74/1.55  clause( 1, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 0.74/1.55  , clause( 15583, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 0.74/1.55  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.74/1.55     )] ) ).
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  subsumption(
% 0.74/1.55  clause( 2, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 0.74/1.55  , clause( 15584, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 0.74/1.55  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.74/1.55     )] ) ).
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  subsumption(
% 0.74/1.55  clause( 3, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) ) ) ) ]
% 0.74/1.55     )
% 0.74/1.55  , clause( 15585, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) )
% 0.74/1.55     ) ) ] )
% 0.74/1.55  , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ), 
% 0.74/1.55    permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  eqswap(
% 0.74/1.55  clause( 15591, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.74/1.55  , clause( 15587, [ =( implies( X, Y ), or( not( X ), Y ) ) ] )
% 0.74/1.55  , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  subsumption(
% 0.74/1.55  clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.74/1.55  , clause( 15591, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.74/1.55  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.74/1.55     )] ) ).
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  subsumption(
% 0.74/1.55  clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.74/1.55  , clause( 15588, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.74/1.55  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 
% 0.74/1.55    1 )] ) ).
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  subsumption(
% 0.74/1.55  clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y )
% 0.74/1.55     ) ] )
% 0.74/1.55  , clause( 15589, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( 
% 0.74/1.55    theorem( Y ) ) ] )
% 0.74/1.55  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.74/1.55     ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  subsumption(
% 0.74/1.55  clause( 8, [ ~( theorem( implies( p, not( not( p ) ) ) ) ) ] )
% 0.74/1.55  , clause( 15590, [ ~( theorem( implies( p, not( not( p ) ) ) ) ) ] )
% 0.74/1.55  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  resolution(
% 0.74/1.55  clause( 15595, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 0.74/1.55  , clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.74/1.55  , 1, clause( 1, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 0.74/1.55  , 0, substitution( 0, [ :=( X, implies( X, or( Y, X ) ) )] ), 
% 0.74/1.55    substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  subsumption(
% 0.74/1.55  clause( 9, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 0.74/1.55  , clause( 15595, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 0.74/1.55  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.74/1.55     )] ) ).
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  resolution(
% 0.74/1.55  clause( 15596, [ theorem( implies( or( X, X ), X ) ) ] )
% 0.74/1.55  , clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.74/1.55  , 1, clause( 0, [ axiom( implies( or( X, X ), X ) ) ] )
% 0.74/1.55  , 0, substitution( 0, [ :=( X, implies( or( X, X ), X ) )] ), 
% 0.74/1.55    substitution( 1, [ :=( X, X )] )).
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  subsumption(
% 0.74/1.55  clause( 10, [ theorem( implies( or( X, X ), X ) ) ] )
% 0.74/1.55  , clause( 15596, [ theorem( implies( or( X, X ), X ) ) ] )
% 0.74/1.55  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  resolution(
% 0.74/1.55  clause( 15597, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 0.74/1.55  , clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y
% 0.74/1.55     ) ) ] )
% 0.74/1.55  , 1, clause( 10, [ theorem( implies( or( X, X ), X ) ) ] )
% 0.74/1.55  , 0, substitution( 0, [ :=( X, X ), :=( Y, or( X, X ) )] ), substitution( 1
% 0.74/1.55    , [ :=( X, X )] )).
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  subsumption(
% 0.74/1.55  clause( 16, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 0.74/1.55  , clause( 15597, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 0.74/1.55  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 
% 0.74/1.55    1 )] ) ).
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  resolution(
% 0.74/1.55  clause( 15599, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X )
% 0.74/1.55     ) ) ] )
% 0.74/1.55  , clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y
% 0.74/1.55     ) ) ] )
% 0.74/1.55  , 1, clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.74/1.55  , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [ :=( X
% 0.74/1.55    , implies( Y, X ) )] )).
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  subsumption(
% 0.74/1.55  clause( 20, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X ) )
% 0.74/1.55     ) ] )
% 0.74/1.55  , clause( 15599, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X
% 0.74/1.55     ) ) ) ] )
% 0.74/1.55  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.74/1.55     ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  resolution(
% 0.74/1.55  clause( 15601, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 0.74/1.55  , clause( 20, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X )
% 0.74/1.55     ) ) ] )
% 0.74/1.55  , 2, clause( 2, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 0.74/1.55  , 0, substitution( 0, [ :=( X, or( X, Y ) ), :=( Y, or( Y, X ) )] ), 
% 0.74/1.55    substitution( 1, [ :=( X, Y ), :=( Y, X )] )).
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  subsumption(
% 0.74/1.55  clause( 72, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 0.74/1.55  , clause( 15601, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 0.74/1.55  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.74/1.55     ), ==>( 1, 1 )] ) ).
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  resolution(
% 0.74/1.55  clause( 15602, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y ) )
% 0.74/1.55    , X ) ) ) ] )
% 0.74/1.55  , clause( 20, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X )
% 0.74/1.55     ) ) ] )
% 0.74/1.55  , 1, clause( 9, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 0.74/1.55  , 0, substitution( 0, [ :=( X, X ), :=( Y, implies( Y, or( Z, Y ) ) )] ), 
% 0.74/1.55    substitution( 1, [ :=( X, Y ), :=( Y, Z )] )).
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  subsumption(
% 0.74/1.55  clause( 74, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y ) ), X
% 0.74/1.55     ) ) ) ] )
% 0.74/1.55  , clause( 15602, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y )
% 0.74/1.55     ), X ) ) ) ] )
% 0.74/1.55  , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ), 
% 0.74/1.55    permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  paramod(
% 0.74/1.55  clause( 15604, [ theorem( implies( X, Y ) ), ~( theorem( or( Y, not( X ) )
% 0.74/1.55     ) ) ] )
% 0.74/1.55  , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.74/1.55  , 0, clause( 72, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 0.74/1.55  , 0, 1, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [ 
% 0.74/1.55    :=( X, not( X ) ), :=( Y, Y )] )).
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  subsumption(
% 0.74/1.55  clause( 99, [ theorem( implies( X, Y ) ), ~( theorem( or( Y, not( X ) ) ) )
% 0.74/1.55     ] )
% 0.74/1.55  , clause( 15604, [ theorem( implies( X, Y ) ), ~( theorem( or( Y, not( X )
% 0.74/1.55     ) ) ) ] )
% 0.74/1.55  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.74/1.55     ), ==>( 1, 1 )] ) ).
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  paramod(
% 0.74/1.55  clause( 15611, [ axiom( implies( or( not( X ), or( Y, Z ) ), or( Y, implies( 
% 0.74/1.55    X, Z ) ) ) ) ] )
% 0.74/1.55  , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.74/1.55  , 0, clause( 3, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) )
% 0.74/1.55     ) ) ] )
% 0.74/1.55  , 0, 10, substitution( 0, [ :=( X, X ), :=( Y, Z )] ), substitution( 1, [ 
% 0.74/1.55    :=( X, not( X ) ), :=( Y, Y ), :=( Z, Z )] )).
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  paramod(
% 0.74/1.55  clause( 15614, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies( 
% 0.74/1.55    X, Z ) ) ) ) ] )
% 0.74/1.55  , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.74/1.55  , 0, clause( 15611, [ axiom( implies( or( not( X ), or( Y, Z ) ), or( Y, 
% 0.74/1.55    implies( X, Z ) ) ) ) ] )
% 0.74/1.55  , 0, 2, substitution( 0, [ :=( X, X ), :=( Y, or( Y, Z ) )] ), 
% 0.74/1.55    substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  subsumption(
% 0.74/1.55  clause( 109, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies( X
% 0.74/1.55    , Z ) ) ) ) ] )
% 0.74/1.55  , clause( 15614, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies( 
% 0.74/1.55    X, Z ) ) ) ) ] )
% 0.74/1.55  , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ), 
% 0.74/1.55    permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  resolution(
% 0.74/1.55  clause( 15616, [ ~( theorem( or( not( not( p ) ), not( p ) ) ) ) ] )
% 0.74/1.55  , clause( 8, [ ~( theorem( implies( p, not( not( p ) ) ) ) ) ] )
% 0.74/1.55  , 0, clause( 99, [ theorem( implies( X, Y ) ), ~( theorem( or( Y, not( X )
% 0.74/1.55     ) ) ) ] )
% 0.74/1.55  , 0, substitution( 0, [] ), substitution( 1, [ :=( X, p ), :=( Y, not( not( 
% 0.74/1.55    p ) ) )] )).
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  paramod(
% 0.74/1.55  clause( 15617, [ ~( theorem( implies( not( p ), not( p ) ) ) ) ] )
% 0.74/1.55  , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.74/1.55  , 0, clause( 15616, [ ~( theorem( or( not( not( p ) ), not( p ) ) ) ) ] )
% 0.74/1.55  , 0, 2, substitution( 0, [ :=( X, not( p ) ), :=( Y, not( p ) )] ), 
% 0.74/1.55    substitution( 1, [] )).
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  subsumption(
% 0.74/1.55  clause( 6023, [ ~( theorem( implies( not( p ), not( p ) ) ) ) ] )
% 0.74/1.55  , clause( 15617, [ ~( theorem( implies( not( p ), not( p ) ) ) ) ] )
% 0.74/1.55  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  resolution(
% 0.74/1.55  clause( 15618, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 0.74/1.55  , clause( 74, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y ) ), 
% 0.74/1.55    X ) ) ) ] )
% 0.74/1.55  , 1, clause( 109, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, 
% 0.74/1.55    implies( X, Z ) ) ) ) ] )
% 0.74/1.55  , 0, substitution( 0, [ :=( X, or( X, implies( Y, Y ) ) ), :=( Y, Y ), :=( 
% 0.74/1.55    Z, X )] ), substitution( 1, [ :=( X, Y ), :=( Y, X ), :=( Z, Y )] )).
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  subsumption(
% 0.74/1.55  clause( 15394, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 0.74/1.55  , clause( 15618, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 0.74/1.55  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.74/1.55     )] ) ).
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  resolution(
% 0.74/1.55  clause( 15619, [ theorem( implies( X, X ) ) ] )
% 0.74/1.55  , clause( 16, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 0.74/1.55  , 1, clause( 15394, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 0.74/1.55  , 0, substitution( 0, [ :=( X, implies( X, X ) )] ), substitution( 1, [ 
% 0.74/1.55    :=( X, implies( X, X ) ), :=( Y, X )] )).
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  subsumption(
% 0.74/1.55  clause( 15539, [ theorem( implies( X, X ) ) ] )
% 0.74/1.55  , clause( 15619, [ theorem( implies( X, X ) ) ] )
% 0.74/1.55  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  resolution(
% 0.74/1.55  clause( 15620, [] )
% 0.74/1.55  , clause( 6023, [ ~( theorem( implies( not( p ), not( p ) ) ) ) ] )
% 0.74/1.55  , 0, clause( 15539, [ theorem( implies( X, X ) ) ] )
% 0.74/1.55  , 0, substitution( 0, [] ), substitution( 1, [ :=( X, not( p ) )] )).
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  subsumption(
% 0.74/1.55  clause( 15580, [] )
% 0.74/1.55  , clause( 15620, [] )
% 0.74/1.55  , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  end.
% 0.74/1.55  
% 0.74/1.55  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.74/1.55  
% 0.74/1.55  Memory use:
% 0.74/1.55  
% 0.74/1.55  space for terms:        241021
% 0.74/1.55  space for clauses:      742670
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  clauses generated:      34473
% 0.74/1.55  clauses kept:           15581
% 0.74/1.55  clauses selected:       375
% 0.74/1.55  clauses deleted:        14
% 0.74/1.55  clauses inuse deleted:  1
% 0.74/1.55  
% 0.74/1.55  subsentry:          407522
% 0.74/1.55  literals s-matched: 181591
% 0.74/1.55  literals matched:   171717
% 0.74/1.55  full subsumption:   77616
% 0.74/1.55  
% 0.74/1.55  checksum:           108538903
% 0.74/1.55  
% 0.74/1.55  
% 0.74/1.55  Bliksem ended
%------------------------------------------------------------------------------