TSTP Solution File: LCL301-3 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL301-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n021.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:36 EDT 2022
% Result : Unsatisfiable 1.22s 1.64s
% Output : Refutation 1.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : LCL301-3 : TPTP v8.1.0. Released v2.3.0.
% 0.06/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n021.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % DateTime : Mon Jul 4 17:32:17 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.22/1.64 *** allocated 10000 integers for termspace/termends
% 1.22/1.64 *** allocated 10000 integers for clauses
% 1.22/1.64 *** allocated 10000 integers for justifications
% 1.22/1.64 Bliksem 1.12
% 1.22/1.64
% 1.22/1.64
% 1.22/1.64 Automatic Strategy Selection
% 1.22/1.64
% 1.22/1.64 Clauses:
% 1.22/1.64 [
% 1.22/1.64 [ axiom( implies( or( X, X ), X ) ) ],
% 1.22/1.64 [ axiom( implies( X, or( Y, X ) ) ) ],
% 1.22/1.64 [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ],
% 1.22/1.64 [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) ) ) ) ],
% 1.22/1.64 [ axiom( implies( implies( X, Y ), implies( or( Z, X ), or( Z, Y ) ) ) )
% 1.22/1.64 ],
% 1.22/1.64 [ =( implies( X, Y ), or( not( X ), Y ) ) ],
% 1.22/1.64 [ theorem( X ), ~( axiom( X ) ) ],
% 1.22/1.64 [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y ) ) ]
% 1.22/1.64 ,
% 1.22/1.64 [ =( and( X, Y ), not( or( not( X ), not( Y ) ) ) ) ],
% 1.22/1.64 [ =( equivalent( X, Y ), and( implies( X, Y ), implies( Y, X ) ) ) ]
% 1.22/1.64 ,
% 1.22/1.64 [ ~( theorem( equivalent( not( implies( not( p ), not( q ) ) ), and( not(
% 1.22/1.64 p ), q ) ) ) ) ]
% 1.22/1.64 ] .
% 1.22/1.64
% 1.22/1.64
% 1.22/1.64 percentage equality = 0.214286, percentage horn = 1.000000
% 1.22/1.64 This is a problem with some equality
% 1.22/1.64
% 1.22/1.64
% 1.22/1.64
% 1.22/1.64 Options Used:
% 1.22/1.64
% 1.22/1.64 useres = 1
% 1.22/1.64 useparamod = 1
% 1.22/1.64 useeqrefl = 1
% 1.22/1.64 useeqfact = 1
% 1.22/1.64 usefactor = 1
% 1.22/1.64 usesimpsplitting = 0
% 1.22/1.64 usesimpdemod = 5
% 1.22/1.64 usesimpres = 3
% 1.22/1.64
% 1.22/1.64 resimpinuse = 1000
% 1.22/1.64 resimpclauses = 20000
% 1.22/1.64 substype = eqrewr
% 1.22/1.64 backwardsubs = 1
% 1.22/1.64 selectoldest = 5
% 1.22/1.64
% 1.22/1.64 litorderings [0] = split
% 1.22/1.64 litorderings [1] = extend the termordering, first sorting on arguments
% 1.22/1.64
% 1.22/1.64 termordering = kbo
% 1.22/1.64
% 1.22/1.64 litapriori = 0
% 1.22/1.64 termapriori = 1
% 1.22/1.64 litaposteriori = 0
% 1.22/1.64 termaposteriori = 0
% 1.22/1.64 demodaposteriori = 0
% 1.22/1.64 ordereqreflfact = 0
% 1.22/1.64
% 1.22/1.64 litselect = negord
% 1.22/1.64
% 1.22/1.64 maxweight = 15
% 1.22/1.64 maxdepth = 30000
% 1.22/1.64 maxlength = 115
% 1.22/1.64 maxnrvars = 195
% 1.22/1.64 excuselevel = 1
% 1.22/1.64 increasemaxweight = 1
% 1.22/1.64
% 1.22/1.64 maxselected = 10000000
% 1.22/1.64 maxnrclauses = 10000000
% 1.22/1.64
% 1.22/1.64 showgenerated = 0
% 1.22/1.64 showkept = 0
% 1.22/1.64 showselected = 0
% 1.22/1.64 showdeleted = 0
% 1.22/1.64 showresimp = 1
% 1.22/1.64 showstatus = 2000
% 1.22/1.64
% 1.22/1.64 prologoutput = 1
% 1.22/1.64 nrgoals = 5000000
% 1.22/1.64 totalproof = 1
% 1.22/1.64
% 1.22/1.64 Symbols occurring in the translation:
% 1.22/1.64
% 1.22/1.64 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 1.22/1.64 . [1, 2] (w:1, o:26, a:1, s:1, b:0),
% 1.22/1.64 ! [4, 1] (w:0, o:18, a:1, s:1, b:0),
% 1.22/1.64 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.22/1.64 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.22/1.64 or [40, 2] (w:1, o:51, a:1, s:1, b:0),
% 1.22/1.64 implies [41, 2] (w:1, o:52, a:1, s:1, b:0),
% 1.22/1.64 axiom [42, 1] (w:1, o:23, a:1, s:1, b:0),
% 1.22/1.64 not [47, 1] (w:1, o:24, a:1, s:1, b:0),
% 1.22/1.64 theorem [48, 1] (w:1, o:25, a:1, s:1, b:0),
% 1.22/1.64 and [51, 2] (w:1, o:53, a:1, s:1, b:0),
% 1.22/1.64 equivalent [52, 2] (w:1, o:54, a:1, s:1, b:0),
% 1.22/1.64 p [53, 0] (w:1, o:16, a:1, s:1, b:0),
% 1.22/1.64 q [54, 0] (w:1, o:17, a:1, s:1, b:0).
% 1.22/1.64
% 1.22/1.64
% 1.22/1.64 Starting Search:
% 1.22/1.64
% 1.22/1.64 Resimplifying inuse:
% 1.22/1.64 Done
% 1.22/1.64
% 1.22/1.64
% 1.22/1.64 Intermediate Status:
% 1.22/1.64 Generated: 3726
% 1.22/1.64 Kept: 2011
% 1.22/1.64 Inuse: 109
% 1.22/1.64 Deleted: 4
% 1.22/1.64 Deletedinuse: 4
% 1.22/1.64
% 1.22/1.64 Resimplifying inuse:
% 1.22/1.64 Done
% 1.22/1.64
% 1.22/1.64 Resimplifying inuse:
% 1.22/1.64 Done
% 1.22/1.64
% 1.22/1.64
% 1.22/1.64 Intermediate Status:
% 1.22/1.64 Generated: 7707
% 1.22/1.64 Kept: 4020
% 1.22/1.64 Inuse: 172
% 1.22/1.64 Deleted: 5
% 1.22/1.64 Deletedinuse: 4
% 1.22/1.64
% 1.22/1.64 Resimplifying inuse:
% 1.22/1.64 Done
% 1.22/1.64
% 1.22/1.64 Resimplifying inuse:
% 1.22/1.64 Done
% 1.22/1.64
% 1.22/1.64
% 1.22/1.64 Intermediate Status:
% 1.22/1.64 Generated: 12616
% 1.22/1.64 Kept: 6029
% 1.22/1.64 Inuse: 214
% 1.22/1.64 Deleted: 10
% 1.22/1.64 Deletedinuse: 4
% 1.22/1.64
% 1.22/1.64 Resimplifying inuse:
% 1.22/1.64 Done
% 1.22/1.64
% 1.22/1.64 Resimplifying inuse:
% 1.22/1.64 Done
% 1.22/1.64
% 1.22/1.64
% 1.22/1.64 Intermediate Status:
% 1.22/1.64 Generated: 17336
% 1.22/1.64 Kept: 8089
% 1.22/1.64 Inuse: 250
% 1.22/1.64 Deleted: 10
% 1.22/1.64 Deletedinuse: 4
% 1.22/1.64
% 1.22/1.64 Resimplifying inuse:
% 1.22/1.64 Done
% 1.22/1.64
% 1.22/1.64 Resimplifying inuse:
% 1.22/1.64 Done
% 1.22/1.64
% 1.22/1.64
% 1.22/1.64 Intermediate Status:
% 1.22/1.64 Generated: 22367
% 1.22/1.64 Kept: 10102
% 1.22/1.64 Inuse: 301
% 1.22/1.64 Deleted: 10
% 1.22/1.64 Deletedinuse: 4
% 1.22/1.64
% 1.22/1.64 Resimplifying inuse:
% 1.22/1.64 Done
% 1.22/1.64
% 1.22/1.64 Resimplifying inuse:
% 1.22/1.64 Done
% 1.22/1.64
% 1.22/1.64
% 1.22/1.64 Intermediate Status:
% 1.22/1.64 Generated: 28802
% 1.22/1.64 Kept: 12124
% 1.22/1.64 Inuse: 359
% 1.22/1.64 Deleted: 10
% 1.22/1.64 Deletedinuse: 4
% 1.22/1.64
% 1.22/1.64 Resimplifying inuse:
% 1.22/1.64 Done
% 1.22/1.64
% 1.22/1.64 Resimplifying inuse:
% 1.22/1.64 Done
% 1.22/1.64
% 1.22/1.64
% 1.22/1.64 Intermediate Status:
% 1.22/1.64 Generated: 34603
% 1.22/1.64 Kept: 14337
% 1.22/1.64 Inuse: 391
% 1.22/1.64 Deleted: 22
% 1.22/1.64 Deletedinuse: 4
% 1.22/1.64
% 1.22/1.64 Resimplifying inuse:
% 1.22/1.64 Done
% 1.22/1.64
% 1.22/1.64 Resimplifying inuse:
% 1.22/1.64 Done
% 1.22/1.64
% 1.22/1.64
% 1.22/1.64 Intermediate Status:
% 1.22/1.64 Generated: 39262
% 1.22/1.64 Kept: 16443
% 1.22/1.64 Inuse: 409
% 1.22/1.64 Deleted: 22
% 1.22/1.64 Deletedinuse: 4
% 1.22/1.64
% 1.22/1.64 Resimplifying inuse:
% 1.22/1.64 Done
% 1.22/1.64
% 1.22/1.64 Resimplifying inuse:
% 1.22/1.64
% 1.22/1.64 Bliksems!, er is een bewijs:
% 1.22/1.64 % SZS status Unsatisfiable
% 1.22/1.65 % SZS output start Refutation
% 1.22/1.65
% 1.22/1.65 clause( 0, [ axiom( implies( or( X, X ), X ) ) ] )
% 1.22/1.65 .
% 1.22/1.65 clause( 1, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 1.22/1.65 .
% 1.22/1.65 clause( 2, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 1.22/1.65 .
% 1.22/1.65 clause( 3, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) ) ) ) ]
% 1.22/1.65 )
% 1.22/1.65 .
% 1.22/1.65 clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.22/1.65 .
% 1.22/1.65 clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.22/1.65 .
% 1.22/1.65 clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y )
% 1.22/1.65 ) ] )
% 1.22/1.65 .
% 1.22/1.65 clause( 8, [ =( not( implies( X, not( Y ) ) ), and( X, Y ) ) ] )
% 1.22/1.65 .
% 1.22/1.65 clause( 9, [ =( and( implies( X, Y ), implies( Y, X ) ), equivalent( X, Y )
% 1.22/1.65 ) ] )
% 1.22/1.65 .
% 1.22/1.65 clause( 10, [ ~( theorem( equivalent( and( not( p ), q ), and( not( p ), q
% 1.22/1.65 ) ) ) ) ] )
% 1.22/1.65 .
% 1.22/1.65 clause( 11, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 1.22/1.65 .
% 1.22/1.65 clause( 12, [ theorem( implies( or( X, X ), X ) ) ] )
% 1.22/1.65 .
% 1.22/1.65 clause( 16, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 1.22/1.65 .
% 1.22/1.65 clause( 20, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X ) )
% 1.22/1.65 ) ] )
% 1.22/1.65 .
% 1.22/1.65 clause( 36, [ ~( theorem( or( X, X ) ) ), theorem( Y ), ~( theorem( implies(
% 1.22/1.65 X, Y ) ) ) ] )
% 1.22/1.65 .
% 1.22/1.65 clause( 66, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 1.22/1.65 .
% 1.22/1.65 clause( 68, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y ) ), X
% 1.22/1.65 ) ) ) ] )
% 1.22/1.65 .
% 1.22/1.65 clause( 126, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies( X
% 1.22/1.65 , Z ) ) ) ) ] )
% 1.22/1.65 .
% 1.22/1.65 clause( 133, [ theorem( implies( implies( X, not( X ) ), not( X ) ) ) ] )
% 1.22/1.65 .
% 1.22/1.65 clause( 168, [ =( implies( implies( X, not( Y ) ), Z ), or( and( X, Y ), Z
% 1.22/1.65 ) ) ] )
% 1.22/1.65 .
% 1.22/1.65 clause( 2630, [ theorem( or( and( X, X ), not( X ) ) ) ] )
% 1.22/1.65 .
% 1.22/1.65 clause( 2656, [ theorem( implies( X, and( X, X ) ) ) ] )
% 1.22/1.65 .
% 1.22/1.65 clause( 2661, [ ~( theorem( or( X, X ) ) ), theorem( and( X, X ) ) ] )
% 1.22/1.65 .
% 1.22/1.65 clause( 18114, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 1.22/1.65 .
% 1.22/1.65 clause( 18207, [ theorem( equivalent( X, X ) ) ] )
% 1.22/1.65 .
% 1.22/1.65 clause( 18239, [] )
% 1.22/1.65 .
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 % SZS output end Refutation
% 1.22/1.65 found a proof!
% 1.22/1.65
% 1.22/1.65 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 1.22/1.65
% 1.22/1.65 initialclauses(
% 1.22/1.65 [ clause( 18241, [ axiom( implies( or( X, X ), X ) ) ] )
% 1.22/1.65 , clause( 18242, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 1.22/1.65 , clause( 18243, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 1.22/1.65 , clause( 18244, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) )
% 1.22/1.65 ) ) ] )
% 1.22/1.65 , clause( 18245, [ axiom( implies( implies( X, Y ), implies( or( Z, X ), or(
% 1.22/1.65 Z, Y ) ) ) ) ] )
% 1.22/1.65 , clause( 18246, [ =( implies( X, Y ), or( not( X ), Y ) ) ] )
% 1.22/1.65 , clause( 18247, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.22/1.65 , clause( 18248, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~(
% 1.22/1.65 theorem( Y ) ) ] )
% 1.22/1.65 , clause( 18249, [ =( and( X, Y ), not( or( not( X ), not( Y ) ) ) ) ] )
% 1.22/1.65 , clause( 18250, [ =( equivalent( X, Y ), and( implies( X, Y ), implies( Y
% 1.22/1.65 , X ) ) ) ] )
% 1.22/1.65 , clause( 18251, [ ~( theorem( equivalent( not( implies( not( p ), not( q )
% 1.22/1.65 ) ), and( not( p ), q ) ) ) ) ] )
% 1.22/1.65 ] ).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 subsumption(
% 1.22/1.65 clause( 0, [ axiom( implies( or( X, X ), X ) ) ] )
% 1.22/1.65 , clause( 18241, [ axiom( implies( or( X, X ), X ) ) ] )
% 1.22/1.65 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 subsumption(
% 1.22/1.65 clause( 1, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 1.22/1.65 , clause( 18242, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 1.22/1.65 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.22/1.65 )] ) ).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 subsumption(
% 1.22/1.65 clause( 2, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 1.22/1.65 , clause( 18243, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 1.22/1.65 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.22/1.65 )] ) ).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 subsumption(
% 1.22/1.65 clause( 3, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) ) ) ) ]
% 1.22/1.65 )
% 1.22/1.65 , clause( 18244, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) )
% 1.22/1.65 ) ) ] )
% 1.22/1.65 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 1.22/1.65 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 eqswap(
% 1.22/1.65 clause( 18252, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.22/1.65 , clause( 18246, [ =( implies( X, Y ), or( not( X ), Y ) ) ] )
% 1.22/1.65 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 subsumption(
% 1.22/1.65 clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.22/1.65 , clause( 18252, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.22/1.65 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.22/1.65 )] ) ).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 subsumption(
% 1.22/1.65 clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.22/1.65 , clause( 18247, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.22/1.65 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 1.22/1.65 1 )] ) ).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 subsumption(
% 1.22/1.65 clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y )
% 1.22/1.65 ) ] )
% 1.22/1.65 , clause( 18248, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~(
% 1.22/1.65 theorem( Y ) ) ] )
% 1.22/1.65 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.22/1.65 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 paramod(
% 1.22/1.65 clause( 18268, [ =( and( X, Y ), not( implies( X, not( Y ) ) ) ) ] )
% 1.22/1.65 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.22/1.65 , 0, clause( 18249, [ =( and( X, Y ), not( or( not( X ), not( Y ) ) ) ) ]
% 1.22/1.65 )
% 1.22/1.65 , 0, 5, substitution( 0, [ :=( X, X ), :=( Y, not( Y ) )] ), substitution(
% 1.22/1.65 1, [ :=( X, X ), :=( Y, Y )] )).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 eqswap(
% 1.22/1.65 clause( 18269, [ =( not( implies( X, not( Y ) ) ), and( X, Y ) ) ] )
% 1.22/1.65 , clause( 18268, [ =( and( X, Y ), not( implies( X, not( Y ) ) ) ) ] )
% 1.22/1.65 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 subsumption(
% 1.22/1.65 clause( 8, [ =( not( implies( X, not( Y ) ) ), and( X, Y ) ) ] )
% 1.22/1.65 , clause( 18269, [ =( not( implies( X, not( Y ) ) ), and( X, Y ) ) ] )
% 1.22/1.65 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.22/1.65 )] ) ).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 eqswap(
% 1.22/1.65 clause( 18272, [ =( and( implies( X, Y ), implies( Y, X ) ), equivalent( X
% 1.22/1.65 , Y ) ) ] )
% 1.22/1.65 , clause( 18250, [ =( equivalent( X, Y ), and( implies( X, Y ), implies( Y
% 1.22/1.65 , X ) ) ) ] )
% 1.22/1.65 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 subsumption(
% 1.22/1.65 clause( 9, [ =( and( implies( X, Y ), implies( Y, X ) ), equivalent( X, Y )
% 1.22/1.65 ) ] )
% 1.22/1.65 , clause( 18272, [ =( and( implies( X, Y ), implies( Y, X ) ), equivalent(
% 1.22/1.65 X, Y ) ) ] )
% 1.22/1.65 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.22/1.65 )] ) ).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 paramod(
% 1.22/1.65 clause( 18287, [ ~( theorem( equivalent( and( not( p ), q ), and( not( p )
% 1.22/1.65 , q ) ) ) ) ] )
% 1.22/1.65 , clause( 8, [ =( not( implies( X, not( Y ) ) ), and( X, Y ) ) ] )
% 1.22/1.65 , 0, clause( 18251, [ ~( theorem( equivalent( not( implies( not( p ), not(
% 1.22/1.65 q ) ) ), and( not( p ), q ) ) ) ) ] )
% 1.22/1.65 , 0, 3, substitution( 0, [ :=( X, not( p ) ), :=( Y, q )] ), substitution(
% 1.22/1.65 1, [] )).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 subsumption(
% 1.22/1.65 clause( 10, [ ~( theorem( equivalent( and( not( p ), q ), and( not( p ), q
% 1.22/1.65 ) ) ) ) ] )
% 1.22/1.65 , clause( 18287, [ ~( theorem( equivalent( and( not( p ), q ), and( not( p
% 1.22/1.65 ), q ) ) ) ) ] )
% 1.22/1.65 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 resolution(
% 1.22/1.65 clause( 18288, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 1.22/1.65 , clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.22/1.65 , 1, clause( 1, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 1.22/1.65 , 0, substitution( 0, [ :=( X, implies( X, or( Y, X ) ) )] ),
% 1.22/1.65 substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 subsumption(
% 1.22/1.65 clause( 11, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 1.22/1.65 , clause( 18288, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 1.22/1.65 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.22/1.65 )] ) ).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 resolution(
% 1.22/1.65 clause( 18289, [ theorem( implies( or( X, X ), X ) ) ] )
% 1.22/1.65 , clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.22/1.65 , 1, clause( 0, [ axiom( implies( or( X, X ), X ) ) ] )
% 1.22/1.65 , 0, substitution( 0, [ :=( X, implies( or( X, X ), X ) )] ),
% 1.22/1.65 substitution( 1, [ :=( X, X )] )).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 subsumption(
% 1.22/1.65 clause( 12, [ theorem( implies( or( X, X ), X ) ) ] )
% 1.22/1.65 , clause( 18289, [ theorem( implies( or( X, X ), X ) ) ] )
% 1.22/1.65 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 resolution(
% 1.22/1.65 clause( 18290, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 1.22/1.65 , clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y
% 1.22/1.65 ) ) ] )
% 1.22/1.65 , 1, clause( 12, [ theorem( implies( or( X, X ), X ) ) ] )
% 1.22/1.65 , 0, substitution( 0, [ :=( X, X ), :=( Y, or( X, X ) )] ), substitution( 1
% 1.22/1.65 , [ :=( X, X )] )).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 subsumption(
% 1.22/1.65 clause( 16, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 1.22/1.65 , clause( 18290, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 1.22/1.65 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 1.22/1.65 1 )] ) ).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 resolution(
% 1.22/1.65 clause( 18292, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X )
% 1.22/1.65 ) ) ] )
% 1.22/1.65 , clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y
% 1.22/1.65 ) ) ] )
% 1.22/1.65 , 1, clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.22/1.65 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [ :=( X
% 1.22/1.65 , implies( Y, X ) )] )).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 subsumption(
% 1.22/1.65 clause( 20, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X ) )
% 1.22/1.65 ) ] )
% 1.22/1.65 , clause( 18292, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X
% 1.22/1.65 ) ) ) ] )
% 1.22/1.65 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.22/1.65 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 resolution(
% 1.22/1.65 clause( 18296, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem(
% 1.22/1.65 or( Y, Y ) ) ) ] )
% 1.22/1.65 , clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y
% 1.22/1.65 ) ) ] )
% 1.22/1.65 , 2, clause( 16, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 1.22/1.65 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [ :=( X
% 1.22/1.65 , Y )] )).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 subsumption(
% 1.22/1.65 clause( 36, [ ~( theorem( or( X, X ) ) ), theorem( Y ), ~( theorem( implies(
% 1.22/1.65 X, Y ) ) ) ] )
% 1.22/1.65 , clause( 18296, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~(
% 1.22/1.65 theorem( or( Y, Y ) ) ) ] )
% 1.22/1.65 , substitution( 0, [ :=( X, Y ), :=( Y, X )] ), permutation( 0, [ ==>( 0, 1
% 1.22/1.65 ), ==>( 1, 2 ), ==>( 2, 0 )] ) ).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 resolution(
% 1.22/1.65 clause( 18297, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 1.22/1.65 , clause( 20, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X )
% 1.22/1.65 ) ) ] )
% 1.22/1.65 , 2, clause( 2, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 1.22/1.65 , 0, substitution( 0, [ :=( X, or( X, Y ) ), :=( Y, or( Y, X ) )] ),
% 1.22/1.65 substitution( 1, [ :=( X, Y ), :=( Y, X )] )).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 subsumption(
% 1.22/1.65 clause( 66, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 1.22/1.65 , clause( 18297, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 1.22/1.65 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.22/1.65 ), ==>( 1, 1 )] ) ).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 resolution(
% 1.22/1.65 clause( 18298, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y ) )
% 1.22/1.65 , X ) ) ) ] )
% 1.22/1.65 , clause( 20, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X )
% 1.22/1.65 ) ) ] )
% 1.22/1.65 , 1, clause( 11, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 1.22/1.65 , 0, substitution( 0, [ :=( X, X ), :=( Y, implies( Y, or( Z, Y ) ) )] ),
% 1.22/1.65 substitution( 1, [ :=( X, Y ), :=( Y, Z )] )).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 subsumption(
% 1.22/1.65 clause( 68, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y ) ), X
% 1.22/1.65 ) ) ) ] )
% 1.22/1.65 , clause( 18298, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y )
% 1.22/1.65 ), X ) ) ) ] )
% 1.22/1.65 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 1.22/1.65 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 paramod(
% 1.22/1.65 clause( 18304, [ axiom( implies( or( not( X ), or( Y, Z ) ), or( Y, implies(
% 1.22/1.65 X, Z ) ) ) ) ] )
% 1.22/1.65 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.22/1.65 , 0, clause( 3, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) )
% 1.22/1.65 ) ) ] )
% 1.22/1.65 , 0, 10, substitution( 0, [ :=( X, X ), :=( Y, Z )] ), substitution( 1, [
% 1.22/1.65 :=( X, not( X ) ), :=( Y, Y ), :=( Z, Z )] )).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 paramod(
% 1.22/1.65 clause( 18307, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies(
% 1.22/1.65 X, Z ) ) ) ) ] )
% 1.22/1.65 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.22/1.65 , 0, clause( 18304, [ axiom( implies( or( not( X ), or( Y, Z ) ), or( Y,
% 1.22/1.65 implies( X, Z ) ) ) ) ] )
% 1.22/1.65 , 0, 2, substitution( 0, [ :=( X, X ), :=( Y, or( Y, Z ) )] ),
% 1.22/1.65 substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 subsumption(
% 1.22/1.65 clause( 126, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies( X
% 1.22/1.65 , Z ) ) ) ) ] )
% 1.22/1.65 , clause( 18307, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies(
% 1.22/1.65 X, Z ) ) ) ) ] )
% 1.22/1.65 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 1.22/1.65 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 paramod(
% 1.22/1.65 clause( 18309, [ theorem( implies( implies( X, not( X ) ), not( X ) ) ) ]
% 1.22/1.65 )
% 1.22/1.65 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.22/1.65 , 0, clause( 12, [ theorem( implies( or( X, X ), X ) ) ] )
% 1.22/1.65 , 0, 2, substitution( 0, [ :=( X, X ), :=( Y, not( X ) )] ), substitution(
% 1.22/1.65 1, [ :=( X, not( X ) )] )).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 subsumption(
% 1.22/1.65 clause( 133, [ theorem( implies( implies( X, not( X ) ), not( X ) ) ) ] )
% 1.22/1.65 , clause( 18309, [ theorem( implies( implies( X, not( X ) ), not( X ) ) ) ]
% 1.22/1.65 )
% 1.22/1.65 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 eqswap(
% 1.22/1.65 clause( 18311, [ =( implies( X, Y ), or( not( X ), Y ) ) ] )
% 1.22/1.65 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.22/1.65 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 paramod(
% 1.22/1.65 clause( 18312, [ =( implies( implies( X, not( Y ) ), Z ), or( and( X, Y ),
% 1.22/1.65 Z ) ) ] )
% 1.22/1.65 , clause( 8, [ =( not( implies( X, not( Y ) ) ), and( X, Y ) ) ] )
% 1.22/1.65 , 0, clause( 18311, [ =( implies( X, Y ), or( not( X ), Y ) ) ] )
% 1.22/1.65 , 0, 8, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [
% 1.22/1.65 :=( X, implies( X, not( Y ) ) ), :=( Y, Z )] )).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 subsumption(
% 1.22/1.65 clause( 168, [ =( implies( implies( X, not( Y ) ), Z ), or( and( X, Y ), Z
% 1.22/1.65 ) ) ] )
% 1.22/1.65 , clause( 18312, [ =( implies( implies( X, not( Y ) ), Z ), or( and( X, Y )
% 1.22/1.65 , Z ) ) ] )
% 1.22/1.65 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 1.22/1.65 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 paramod(
% 1.22/1.65 clause( 18315, [ theorem( or( and( X, X ), not( X ) ) ) ] )
% 1.22/1.65 , clause( 168, [ =( implies( implies( X, not( Y ) ), Z ), or( and( X, Y ),
% 1.22/1.65 Z ) ) ] )
% 1.22/1.65 , 0, clause( 133, [ theorem( implies( implies( X, not( X ) ), not( X ) ) )
% 1.22/1.65 ] )
% 1.22/1.65 , 0, 1, substitution( 0, [ :=( X, X ), :=( Y, X ), :=( Z, not( X ) )] ),
% 1.22/1.65 substitution( 1, [ :=( X, X )] )).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 subsumption(
% 1.22/1.65 clause( 2630, [ theorem( or( and( X, X ), not( X ) ) ) ] )
% 1.22/1.65 , clause( 18315, [ theorem( or( and( X, X ), not( X ) ) ) ] )
% 1.22/1.65 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 resolution(
% 1.22/1.65 clause( 18317, [ theorem( or( not( X ), and( X, X ) ) ) ] )
% 1.22/1.65 , clause( 66, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 1.22/1.65 , 1, clause( 2630, [ theorem( or( and( X, X ), not( X ) ) ) ] )
% 1.22/1.65 , 0, substitution( 0, [ :=( X, not( X ) ), :=( Y, and( X, X ) )] ),
% 1.22/1.65 substitution( 1, [ :=( X, X )] )).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 paramod(
% 1.22/1.65 clause( 18318, [ theorem( implies( X, and( X, X ) ) ) ] )
% 1.22/1.65 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.22/1.65 , 0, clause( 18317, [ theorem( or( not( X ), and( X, X ) ) ) ] )
% 1.22/1.65 , 0, 1, substitution( 0, [ :=( X, X ), :=( Y, and( X, X ) )] ),
% 1.22/1.65 substitution( 1, [ :=( X, X )] )).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 subsumption(
% 1.22/1.65 clause( 2656, [ theorem( implies( X, and( X, X ) ) ) ] )
% 1.22/1.65 , clause( 18318, [ theorem( implies( X, and( X, X ) ) ) ] )
% 1.22/1.65 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 resolution(
% 1.22/1.65 clause( 18319, [ ~( theorem( or( X, X ) ) ), theorem( and( X, X ) ) ] )
% 1.22/1.65 , clause( 36, [ ~( theorem( or( X, X ) ) ), theorem( Y ), ~( theorem(
% 1.22/1.65 implies( X, Y ) ) ) ] )
% 1.22/1.65 , 2, clause( 2656, [ theorem( implies( X, and( X, X ) ) ) ] )
% 1.22/1.65 , 0, substitution( 0, [ :=( X, X ), :=( Y, and( X, X ) )] ), substitution(
% 1.22/1.65 1, [ :=( X, X )] )).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 subsumption(
% 1.22/1.65 clause( 2661, [ ~( theorem( or( X, X ) ) ), theorem( and( X, X ) ) ] )
% 1.22/1.65 , clause( 18319, [ ~( theorem( or( X, X ) ) ), theorem( and( X, X ) ) ] )
% 1.22/1.65 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 1.22/1.65 1 )] ) ).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 resolution(
% 1.22/1.65 clause( 18320, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 1.22/1.65 , clause( 68, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y ) ),
% 1.22/1.65 X ) ) ) ] )
% 1.22/1.65 , 1, clause( 126, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y,
% 1.22/1.65 implies( X, Z ) ) ) ) ] )
% 1.22/1.65 , 0, substitution( 0, [ :=( X, or( X, implies( Y, Y ) ) ), :=( Y, Y ), :=(
% 1.22/1.65 Z, X )] ), substitution( 1, [ :=( X, Y ), :=( Y, X ), :=( Z, Y )] )).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 subsumption(
% 1.22/1.65 clause( 18114, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 1.22/1.65 , clause( 18320, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 1.22/1.65 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.22/1.65 )] ) ).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 resolution(
% 1.22/1.65 clause( 18322, [ theorem( and( implies( X, X ), implies( X, X ) ) ) ] )
% 1.22/1.65 , clause( 2661, [ ~( theorem( or( X, X ) ) ), theorem( and( X, X ) ) ] )
% 1.22/1.65 , 0, clause( 18114, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 1.22/1.65 , 0, substitution( 0, [ :=( X, implies( X, X ) )] ), substitution( 1, [
% 1.22/1.65 :=( X, implies( X, X ) ), :=( Y, X )] )).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 paramod(
% 1.22/1.65 clause( 18323, [ theorem( equivalent( X, X ) ) ] )
% 1.22/1.65 , clause( 9, [ =( and( implies( X, Y ), implies( Y, X ) ), equivalent( X, Y
% 1.22/1.65 ) ) ] )
% 1.22/1.65 , 0, clause( 18322, [ theorem( and( implies( X, X ), implies( X, X ) ) ) ]
% 1.22/1.65 )
% 1.22/1.65 , 0, 1, substitution( 0, [ :=( X, X ), :=( Y, X )] ), substitution( 1, [
% 1.22/1.65 :=( X, X )] )).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 subsumption(
% 1.22/1.65 clause( 18207, [ theorem( equivalent( X, X ) ) ] )
% 1.22/1.65 , clause( 18323, [ theorem( equivalent( X, X ) ) ] )
% 1.22/1.65 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 resolution(
% 1.22/1.65 clause( 18324, [] )
% 1.22/1.65 , clause( 10, [ ~( theorem( equivalent( and( not( p ), q ), and( not( p ),
% 1.22/1.65 q ) ) ) ) ] )
% 1.22/1.65 , 0, clause( 18207, [ theorem( equivalent( X, X ) ) ] )
% 1.22/1.65 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, and( not( p ), q ) )] )
% 1.22/1.65 ).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 subsumption(
% 1.22/1.65 clause( 18239, [] )
% 1.22/1.65 , clause( 18324, [] )
% 1.22/1.65 , substitution( 0, [] ), permutation( 0, [] ) ).
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 end.
% 1.22/1.65
% 1.22/1.65 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 1.22/1.65
% 1.22/1.65 Memory use:
% 1.22/1.65
% 1.22/1.65 space for terms: 284788
% 1.22/1.65 space for clauses: 829526
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 clauses generated: 43412
% 1.22/1.65 clauses kept: 18240
% 1.22/1.65 clauses selected: 430
% 1.22/1.65 clauses deleted: 56
% 1.22/1.65 clauses inuse deleted: 34
% 1.22/1.65
% 1.22/1.65 subsentry: 433536
% 1.22/1.65 literals s-matched: 229641
% 1.22/1.65 literals matched: 215509
% 1.22/1.65 full subsumption: 91294
% 1.22/1.65
% 1.22/1.65 checksum: 943482492
% 1.22/1.65
% 1.22/1.65
% 1.22/1.65 Bliksem ended
%------------------------------------------------------------------------------