TSTP Solution File: LCL297-3 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL297-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n020.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:35 EDT 2022
% Result : Unsatisfiable 1.24s 1.69s
% Output : Refutation 1.24s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL297-3 : TPTP v8.1.0. Released v2.3.0.
% 0.11/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n020.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.34 % CPULimit : 300
% 0.12/0.34 % DateTime : Sun Jul 3 16:08:15 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.24/1.69 *** allocated 10000 integers for termspace/termends
% 1.24/1.69 *** allocated 10000 integers for clauses
% 1.24/1.69 *** allocated 10000 integers for justifications
% 1.24/1.69 Bliksem 1.12
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 Automatic Strategy Selection
% 1.24/1.69
% 1.24/1.69 Clauses:
% 1.24/1.69 [
% 1.24/1.69 [ axiom( implies( or( X, X ), X ) ) ],
% 1.24/1.69 [ axiom( implies( X, or( Y, X ) ) ) ],
% 1.24/1.69 [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ],
% 1.24/1.69 [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) ) ) ) ],
% 1.24/1.69 [ axiom( implies( implies( X, Y ), implies( or( Z, X ), or( Z, Y ) ) ) )
% 1.24/1.69 ],
% 1.24/1.69 [ =( implies( X, Y ), or( not( X ), Y ) ) ],
% 1.24/1.69 [ theorem( X ), ~( axiom( X ) ) ],
% 1.24/1.69 [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y ) ) ]
% 1.24/1.69 ,
% 1.24/1.69 [ =( and( X, Y ), not( or( not( X ), not( Y ) ) ) ) ],
% 1.24/1.69 [ =( equivalent( X, Y ), and( implies( X, Y ), implies( Y, X ) ) ) ]
% 1.24/1.69 ,
% 1.24/1.69 [ ~( theorem( equivalent( not( implies( p, not( q ) ) ), and( p, q ) ) )
% 1.24/1.69 ) ]
% 1.24/1.69 ] .
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 percentage equality = 0.214286, percentage horn = 1.000000
% 1.24/1.69 This is a problem with some equality
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 Options Used:
% 1.24/1.69
% 1.24/1.69 useres = 1
% 1.24/1.69 useparamod = 1
% 1.24/1.69 useeqrefl = 1
% 1.24/1.69 useeqfact = 1
% 1.24/1.69 usefactor = 1
% 1.24/1.69 usesimpsplitting = 0
% 1.24/1.69 usesimpdemod = 5
% 1.24/1.69 usesimpres = 3
% 1.24/1.69
% 1.24/1.69 resimpinuse = 1000
% 1.24/1.69 resimpclauses = 20000
% 1.24/1.69 substype = eqrewr
% 1.24/1.69 backwardsubs = 1
% 1.24/1.69 selectoldest = 5
% 1.24/1.69
% 1.24/1.69 litorderings [0] = split
% 1.24/1.69 litorderings [1] = extend the termordering, first sorting on arguments
% 1.24/1.69
% 1.24/1.69 termordering = kbo
% 1.24/1.69
% 1.24/1.69 litapriori = 0
% 1.24/1.69 termapriori = 1
% 1.24/1.69 litaposteriori = 0
% 1.24/1.69 termaposteriori = 0
% 1.24/1.69 demodaposteriori = 0
% 1.24/1.69 ordereqreflfact = 0
% 1.24/1.69
% 1.24/1.69 litselect = negord
% 1.24/1.69
% 1.24/1.69 maxweight = 15
% 1.24/1.69 maxdepth = 30000
% 1.24/1.69 maxlength = 115
% 1.24/1.69 maxnrvars = 195
% 1.24/1.69 excuselevel = 1
% 1.24/1.69 increasemaxweight = 1
% 1.24/1.69
% 1.24/1.69 maxselected = 10000000
% 1.24/1.69 maxnrclauses = 10000000
% 1.24/1.69
% 1.24/1.69 showgenerated = 0
% 1.24/1.69 showkept = 0
% 1.24/1.69 showselected = 0
% 1.24/1.69 showdeleted = 0
% 1.24/1.69 showresimp = 1
% 1.24/1.69 showstatus = 2000
% 1.24/1.69
% 1.24/1.69 prologoutput = 1
% 1.24/1.69 nrgoals = 5000000
% 1.24/1.69 totalproof = 1
% 1.24/1.69
% 1.24/1.69 Symbols occurring in the translation:
% 1.24/1.69
% 1.24/1.69 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 1.24/1.69 . [1, 2] (w:1, o:26, a:1, s:1, b:0),
% 1.24/1.69 ! [4, 1] (w:0, o:18, a:1, s:1, b:0),
% 1.24/1.69 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.24/1.69 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.24/1.69 or [40, 2] (w:1, o:51, a:1, s:1, b:0),
% 1.24/1.69 implies [41, 2] (w:1, o:52, a:1, s:1, b:0),
% 1.24/1.69 axiom [42, 1] (w:1, o:23, a:1, s:1, b:0),
% 1.24/1.69 not [47, 1] (w:1, o:24, a:1, s:1, b:0),
% 1.24/1.69 theorem [48, 1] (w:1, o:25, a:1, s:1, b:0),
% 1.24/1.69 and [51, 2] (w:1, o:53, a:1, s:1, b:0),
% 1.24/1.69 equivalent [52, 2] (w:1, o:54, a:1, s:1, b:0),
% 1.24/1.69 p [53, 0] (w:1, o:16, a:1, s:1, b:0),
% 1.24/1.69 q [54, 0] (w:1, o:17, a:1, s:1, b:0).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 Starting Search:
% 1.24/1.69
% 1.24/1.69 Resimplifying inuse:
% 1.24/1.69 Done
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 Intermediate Status:
% 1.24/1.69 Generated: 3749
% 1.24/1.69 Kept: 2035
% 1.24/1.69 Inuse: 111
% 1.24/1.69 Deleted: 4
% 1.24/1.69 Deletedinuse: 4
% 1.24/1.69
% 1.24/1.69 Resimplifying inuse:
% 1.24/1.69 Done
% 1.24/1.69
% 1.24/1.69 Resimplifying inuse:
% 1.24/1.69 Done
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 Intermediate Status:
% 1.24/1.69 Generated: 7771
% 1.24/1.69 Kept: 4052
% 1.24/1.69 Inuse: 177
% 1.24/1.69 Deleted: 5
% 1.24/1.69 Deletedinuse: 4
% 1.24/1.69
% 1.24/1.69 Resimplifying inuse:
% 1.24/1.69 Done
% 1.24/1.69
% 1.24/1.69 Resimplifying inuse:
% 1.24/1.69 Done
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 Intermediate Status:
% 1.24/1.69 Generated: 12612
% 1.24/1.69 Kept: 6134
% 1.24/1.69 Inuse: 218
% 1.24/1.69 Deleted: 7
% 1.24/1.69 Deletedinuse: 4
% 1.24/1.69
% 1.24/1.69 Resimplifying inuse:
% 1.24/1.69 Done
% 1.24/1.69
% 1.24/1.69 Resimplifying inuse:
% 1.24/1.69 Done
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 Intermediate Status:
% 1.24/1.69 Generated: 17422
% 1.24/1.69 Kept: 8161
% 1.24/1.69 Inuse: 256
% 1.24/1.69 Deleted: 10
% 1.24/1.69 Deletedinuse: 4
% 1.24/1.69
% 1.24/1.69 Resimplifying inuse:
% 1.24/1.69 Done
% 1.24/1.69
% 1.24/1.69 Resimplifying inuse:
% 1.24/1.69 Done
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 Intermediate Status:
% 1.24/1.69 Generated: 22635
% 1.24/1.69 Kept: 10262
% 1.24/1.69 Inuse: 306
% 1.24/1.69 Deleted: 10
% 1.24/1.69 Deletedinuse: 4
% 1.24/1.69
% 1.24/1.69 Resimplifying inuse:
% 1.24/1.69 Done
% 1.24/1.69
% 1.24/1.69 Resimplifying inuse:
% 1.24/1.69 Done
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 Intermediate Status:
% 1.24/1.69 Generated: 28561
% 1.24/1.69 Kept: 12301
% 1.24/1.69 Inuse: 357
% 1.24/1.69 Deleted: 10
% 1.24/1.69 Deletedinuse: 4
% 1.24/1.69
% 1.24/1.69 Resimplifying inuse:
% 1.24/1.69 Done
% 1.24/1.69
% 1.24/1.69 Resimplifying inuse:
% 1.24/1.69 Done
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 Intermediate Status:
% 1.24/1.69 Generated: 33447
% 1.24/1.69 Kept: 14354
% 1.24/1.69 Inuse: 390
% 1.24/1.69 Deleted: 10
% 1.24/1.69 Deletedinuse: 4
% 1.24/1.69
% 1.24/1.69 Resimplifying inuse:
% 1.24/1.69 Done
% 1.24/1.69
% 1.24/1.69 Resimplifying inuse:
% 1.24/1.69 Done
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 Intermediate Status:
% 1.24/1.69 Generated: 39615
% 1.24/1.69 Kept: 16391
% 1.24/1.69 Inuse: 421
% 1.24/1.69 Deleted: 22
% 1.24/1.69 Deletedinuse: 4
% 1.24/1.69
% 1.24/1.69 Resimplifying inuse:
% 1.24/1.69 Done
% 1.24/1.69
% 1.24/1.69 Resimplifying inuse:
% 1.24/1.69 Done
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 Intermediate Status:
% 1.24/1.69 Generated: 43192
% 1.24/1.69 Kept: 18461
% 1.24/1.69 Inuse: 432
% 1.24/1.69 Deleted: 22
% 1.24/1.69 Deletedinuse: 4
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 Bliksems!, er is een bewijs:
% 1.24/1.69 % SZS status Unsatisfiable
% 1.24/1.69 % SZS output start Refutation
% 1.24/1.69
% 1.24/1.69 clause( 0, [ axiom( implies( or( X, X ), X ) ) ] )
% 1.24/1.69 .
% 1.24/1.69 clause( 1, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 1.24/1.69 .
% 1.24/1.69 clause( 2, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 1.24/1.69 .
% 1.24/1.69 clause( 3, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) ) ) ) ]
% 1.24/1.69 )
% 1.24/1.69 .
% 1.24/1.69 clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.24/1.69 .
% 1.24/1.69 clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.24/1.69 .
% 1.24/1.69 clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y )
% 1.24/1.69 ) ] )
% 1.24/1.69 .
% 1.24/1.69 clause( 8, [ =( not( implies( X, not( Y ) ) ), and( X, Y ) ) ] )
% 1.24/1.69 .
% 1.24/1.69 clause( 9, [ =( and( implies( X, Y ), implies( Y, X ) ), equivalent( X, Y )
% 1.24/1.69 ) ] )
% 1.24/1.69 .
% 1.24/1.69 clause( 10, [ ~( theorem( equivalent( and( p, q ), and( p, q ) ) ) ) ] )
% 1.24/1.69 .
% 1.24/1.69 clause( 11, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 1.24/1.69 .
% 1.24/1.69 clause( 12, [ theorem( implies( or( X, X ), X ) ) ] )
% 1.24/1.69 .
% 1.24/1.69 clause( 16, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 1.24/1.69 .
% 1.24/1.69 clause( 20, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X ) )
% 1.24/1.69 ) ] )
% 1.24/1.69 .
% 1.24/1.69 clause( 36, [ ~( theorem( or( X, X ) ) ), theorem( Y ), ~( theorem( implies(
% 1.24/1.69 X, Y ) ) ) ] )
% 1.24/1.69 .
% 1.24/1.69 clause( 66, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 1.24/1.69 .
% 1.24/1.69 clause( 68, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y ) ), X
% 1.24/1.69 ) ) ) ] )
% 1.24/1.69 .
% 1.24/1.69 clause( 126, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies( X
% 1.24/1.69 , Z ) ) ) ) ] )
% 1.24/1.69 .
% 1.24/1.69 clause( 133, [ theorem( implies( implies( X, not( X ) ), not( X ) ) ) ] )
% 1.24/1.69 .
% 1.24/1.69 clause( 168, [ =( implies( implies( X, not( Y ) ), Z ), or( and( X, Y ), Z
% 1.24/1.69 ) ) ] )
% 1.24/1.69 .
% 1.24/1.69 clause( 2527, [ theorem( or( and( X, X ), not( X ) ) ) ] )
% 1.24/1.69 .
% 1.24/1.69 clause( 2552, [ theorem( implies( X, and( X, X ) ) ) ] )
% 1.24/1.69 .
% 1.24/1.69 clause( 2556, [ ~( theorem( or( X, X ) ) ), theorem( and( X, X ) ) ] )
% 1.24/1.69 .
% 1.24/1.69 clause( 18854, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 1.24/1.69 .
% 1.24/1.69 clause( 18953, [ theorem( equivalent( X, X ) ) ] )
% 1.24/1.69 .
% 1.24/1.69 clause( 19075, [] )
% 1.24/1.69 .
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 % SZS output end Refutation
% 1.24/1.69 found a proof!
% 1.24/1.69
% 1.24/1.69 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 1.24/1.69
% 1.24/1.69 initialclauses(
% 1.24/1.69 [ clause( 19077, [ axiom( implies( or( X, X ), X ) ) ] )
% 1.24/1.69 , clause( 19078, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 1.24/1.69 , clause( 19079, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 1.24/1.69 , clause( 19080, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) )
% 1.24/1.69 ) ) ] )
% 1.24/1.69 , clause( 19081, [ axiom( implies( implies( X, Y ), implies( or( Z, X ), or(
% 1.24/1.69 Z, Y ) ) ) ) ] )
% 1.24/1.69 , clause( 19082, [ =( implies( X, Y ), or( not( X ), Y ) ) ] )
% 1.24/1.69 , clause( 19083, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.24/1.69 , clause( 19084, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~(
% 1.24/1.69 theorem( Y ) ) ] )
% 1.24/1.69 , clause( 19085, [ =( and( X, Y ), not( or( not( X ), not( Y ) ) ) ) ] )
% 1.24/1.69 , clause( 19086, [ =( equivalent( X, Y ), and( implies( X, Y ), implies( Y
% 1.24/1.69 , X ) ) ) ] )
% 1.24/1.69 , clause( 19087, [ ~( theorem( equivalent( not( implies( p, not( q ) ) ),
% 1.24/1.69 and( p, q ) ) ) ) ] )
% 1.24/1.69 ] ).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 subsumption(
% 1.24/1.69 clause( 0, [ axiom( implies( or( X, X ), X ) ) ] )
% 1.24/1.69 , clause( 19077, [ axiom( implies( or( X, X ), X ) ) ] )
% 1.24/1.69 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 subsumption(
% 1.24/1.69 clause( 1, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 1.24/1.69 , clause( 19078, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 1.24/1.69 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.24/1.69 )] ) ).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 subsumption(
% 1.24/1.69 clause( 2, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 1.24/1.69 , clause( 19079, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 1.24/1.69 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.24/1.69 )] ) ).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 subsumption(
% 1.24/1.69 clause( 3, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) ) ) ) ]
% 1.24/1.69 )
% 1.24/1.69 , clause( 19080, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) )
% 1.24/1.69 ) ) ] )
% 1.24/1.69 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 1.24/1.69 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 eqswap(
% 1.24/1.69 clause( 19088, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.24/1.69 , clause( 19082, [ =( implies( X, Y ), or( not( X ), Y ) ) ] )
% 1.24/1.69 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 subsumption(
% 1.24/1.69 clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.24/1.69 , clause( 19088, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.24/1.69 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.24/1.69 )] ) ).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 subsumption(
% 1.24/1.69 clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.24/1.69 , clause( 19083, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.24/1.69 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 1.24/1.69 1 )] ) ).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 subsumption(
% 1.24/1.69 clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y )
% 1.24/1.69 ) ] )
% 1.24/1.69 , clause( 19084, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~(
% 1.24/1.69 theorem( Y ) ) ] )
% 1.24/1.69 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.24/1.69 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 paramod(
% 1.24/1.69 clause( 19104, [ =( and( X, Y ), not( implies( X, not( Y ) ) ) ) ] )
% 1.24/1.69 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.24/1.69 , 0, clause( 19085, [ =( and( X, Y ), not( or( not( X ), not( Y ) ) ) ) ]
% 1.24/1.69 )
% 1.24/1.69 , 0, 5, substitution( 0, [ :=( X, X ), :=( Y, not( Y ) )] ), substitution(
% 1.24/1.69 1, [ :=( X, X ), :=( Y, Y )] )).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 eqswap(
% 1.24/1.69 clause( 19105, [ =( not( implies( X, not( Y ) ) ), and( X, Y ) ) ] )
% 1.24/1.69 , clause( 19104, [ =( and( X, Y ), not( implies( X, not( Y ) ) ) ) ] )
% 1.24/1.69 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 subsumption(
% 1.24/1.69 clause( 8, [ =( not( implies( X, not( Y ) ) ), and( X, Y ) ) ] )
% 1.24/1.69 , clause( 19105, [ =( not( implies( X, not( Y ) ) ), and( X, Y ) ) ] )
% 1.24/1.69 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.24/1.69 )] ) ).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 eqswap(
% 1.24/1.69 clause( 19108, [ =( and( implies( X, Y ), implies( Y, X ) ), equivalent( X
% 1.24/1.69 , Y ) ) ] )
% 1.24/1.69 , clause( 19086, [ =( equivalent( X, Y ), and( implies( X, Y ), implies( Y
% 1.24/1.69 , X ) ) ) ] )
% 1.24/1.69 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 subsumption(
% 1.24/1.69 clause( 9, [ =( and( implies( X, Y ), implies( Y, X ) ), equivalent( X, Y )
% 1.24/1.69 ) ] )
% 1.24/1.69 , clause( 19108, [ =( and( implies( X, Y ), implies( Y, X ) ), equivalent(
% 1.24/1.69 X, Y ) ) ] )
% 1.24/1.69 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.24/1.69 )] ) ).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 paramod(
% 1.24/1.69 clause( 19123, [ ~( theorem( equivalent( and( p, q ), and( p, q ) ) ) ) ]
% 1.24/1.69 )
% 1.24/1.69 , clause( 8, [ =( not( implies( X, not( Y ) ) ), and( X, Y ) ) ] )
% 1.24/1.69 , 0, clause( 19087, [ ~( theorem( equivalent( not( implies( p, not( q ) ) )
% 1.24/1.69 , and( p, q ) ) ) ) ] )
% 1.24/1.69 , 0, 3, substitution( 0, [ :=( X, p ), :=( Y, q )] ), substitution( 1, [] )
% 1.24/1.69 ).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 subsumption(
% 1.24/1.69 clause( 10, [ ~( theorem( equivalent( and( p, q ), and( p, q ) ) ) ) ] )
% 1.24/1.69 , clause( 19123, [ ~( theorem( equivalent( and( p, q ), and( p, q ) ) ) ) ]
% 1.24/1.69 )
% 1.24/1.69 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 resolution(
% 1.24/1.69 clause( 19124, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 1.24/1.69 , clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.24/1.69 , 1, clause( 1, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 1.24/1.69 , 0, substitution( 0, [ :=( X, implies( X, or( Y, X ) ) )] ),
% 1.24/1.69 substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 subsumption(
% 1.24/1.69 clause( 11, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 1.24/1.69 , clause( 19124, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 1.24/1.69 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.24/1.69 )] ) ).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 resolution(
% 1.24/1.69 clause( 19125, [ theorem( implies( or( X, X ), X ) ) ] )
% 1.24/1.69 , clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.24/1.69 , 1, clause( 0, [ axiom( implies( or( X, X ), X ) ) ] )
% 1.24/1.69 , 0, substitution( 0, [ :=( X, implies( or( X, X ), X ) )] ),
% 1.24/1.69 substitution( 1, [ :=( X, X )] )).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 subsumption(
% 1.24/1.69 clause( 12, [ theorem( implies( or( X, X ), X ) ) ] )
% 1.24/1.69 , clause( 19125, [ theorem( implies( or( X, X ), X ) ) ] )
% 1.24/1.69 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 resolution(
% 1.24/1.69 clause( 19126, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 1.24/1.69 , clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y
% 1.24/1.69 ) ) ] )
% 1.24/1.69 , 1, clause( 12, [ theorem( implies( or( X, X ), X ) ) ] )
% 1.24/1.69 , 0, substitution( 0, [ :=( X, X ), :=( Y, or( X, X ) )] ), substitution( 1
% 1.24/1.69 , [ :=( X, X )] )).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 subsumption(
% 1.24/1.69 clause( 16, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 1.24/1.69 , clause( 19126, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 1.24/1.69 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 1.24/1.69 1 )] ) ).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 resolution(
% 1.24/1.69 clause( 19128, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X )
% 1.24/1.69 ) ) ] )
% 1.24/1.69 , clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y
% 1.24/1.69 ) ) ] )
% 1.24/1.69 , 1, clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.24/1.69 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [ :=( X
% 1.24/1.69 , implies( Y, X ) )] )).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 subsumption(
% 1.24/1.69 clause( 20, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X ) )
% 1.24/1.69 ) ] )
% 1.24/1.69 , clause( 19128, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X
% 1.24/1.69 ) ) ) ] )
% 1.24/1.69 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.24/1.69 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 resolution(
% 1.24/1.69 clause( 19132, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem(
% 1.24/1.69 or( Y, Y ) ) ) ] )
% 1.24/1.69 , clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y
% 1.24/1.69 ) ) ] )
% 1.24/1.69 , 2, clause( 16, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 1.24/1.69 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [ :=( X
% 1.24/1.69 , Y )] )).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 subsumption(
% 1.24/1.69 clause( 36, [ ~( theorem( or( X, X ) ) ), theorem( Y ), ~( theorem( implies(
% 1.24/1.69 X, Y ) ) ) ] )
% 1.24/1.69 , clause( 19132, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~(
% 1.24/1.69 theorem( or( Y, Y ) ) ) ] )
% 1.24/1.69 , substitution( 0, [ :=( X, Y ), :=( Y, X )] ), permutation( 0, [ ==>( 0, 1
% 1.24/1.69 ), ==>( 1, 2 ), ==>( 2, 0 )] ) ).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 resolution(
% 1.24/1.69 clause( 19133, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 1.24/1.69 , clause( 20, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X )
% 1.24/1.69 ) ) ] )
% 1.24/1.69 , 2, clause( 2, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 1.24/1.69 , 0, substitution( 0, [ :=( X, or( X, Y ) ), :=( Y, or( Y, X ) )] ),
% 1.24/1.69 substitution( 1, [ :=( X, Y ), :=( Y, X )] )).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 subsumption(
% 1.24/1.69 clause( 66, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 1.24/1.69 , clause( 19133, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 1.24/1.69 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.24/1.69 ), ==>( 1, 1 )] ) ).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 resolution(
% 1.24/1.69 clause( 19134, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y ) )
% 1.24/1.69 , X ) ) ) ] )
% 1.24/1.69 , clause( 20, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X )
% 1.24/1.69 ) ) ] )
% 1.24/1.69 , 1, clause( 11, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 1.24/1.69 , 0, substitution( 0, [ :=( X, X ), :=( Y, implies( Y, or( Z, Y ) ) )] ),
% 1.24/1.69 substitution( 1, [ :=( X, Y ), :=( Y, Z )] )).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 subsumption(
% 1.24/1.69 clause( 68, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y ) ), X
% 1.24/1.69 ) ) ) ] )
% 1.24/1.69 , clause( 19134, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y )
% 1.24/1.69 ), X ) ) ) ] )
% 1.24/1.69 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 1.24/1.69 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 paramod(
% 1.24/1.69 clause( 19140, [ axiom( implies( or( not( X ), or( Y, Z ) ), or( Y, implies(
% 1.24/1.69 X, Z ) ) ) ) ] )
% 1.24/1.69 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.24/1.69 , 0, clause( 3, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) )
% 1.24/1.69 ) ) ] )
% 1.24/1.69 , 0, 10, substitution( 0, [ :=( X, X ), :=( Y, Z )] ), substitution( 1, [
% 1.24/1.69 :=( X, not( X ) ), :=( Y, Y ), :=( Z, Z )] )).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 paramod(
% 1.24/1.69 clause( 19143, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies(
% 1.24/1.69 X, Z ) ) ) ) ] )
% 1.24/1.69 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.24/1.69 , 0, clause( 19140, [ axiom( implies( or( not( X ), or( Y, Z ) ), or( Y,
% 1.24/1.69 implies( X, Z ) ) ) ) ] )
% 1.24/1.69 , 0, 2, substitution( 0, [ :=( X, X ), :=( Y, or( Y, Z ) )] ),
% 1.24/1.69 substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 subsumption(
% 1.24/1.69 clause( 126, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies( X
% 1.24/1.69 , Z ) ) ) ) ] )
% 1.24/1.69 , clause( 19143, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies(
% 1.24/1.69 X, Z ) ) ) ) ] )
% 1.24/1.69 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 1.24/1.69 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 paramod(
% 1.24/1.69 clause( 19145, [ theorem( implies( implies( X, not( X ) ), not( X ) ) ) ]
% 1.24/1.69 )
% 1.24/1.69 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.24/1.69 , 0, clause( 12, [ theorem( implies( or( X, X ), X ) ) ] )
% 1.24/1.69 , 0, 2, substitution( 0, [ :=( X, X ), :=( Y, not( X ) )] ), substitution(
% 1.24/1.69 1, [ :=( X, not( X ) )] )).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 subsumption(
% 1.24/1.69 clause( 133, [ theorem( implies( implies( X, not( X ) ), not( X ) ) ) ] )
% 1.24/1.69 , clause( 19145, [ theorem( implies( implies( X, not( X ) ), not( X ) ) ) ]
% 1.24/1.69 )
% 1.24/1.69 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 eqswap(
% 1.24/1.69 clause( 19147, [ =( implies( X, Y ), or( not( X ), Y ) ) ] )
% 1.24/1.69 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.24/1.69 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 paramod(
% 1.24/1.69 clause( 19148, [ =( implies( implies( X, not( Y ) ), Z ), or( and( X, Y ),
% 1.24/1.69 Z ) ) ] )
% 1.24/1.69 , clause( 8, [ =( not( implies( X, not( Y ) ) ), and( X, Y ) ) ] )
% 1.24/1.69 , 0, clause( 19147, [ =( implies( X, Y ), or( not( X ), Y ) ) ] )
% 1.24/1.69 , 0, 8, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [
% 1.24/1.69 :=( X, implies( X, not( Y ) ) ), :=( Y, Z )] )).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 subsumption(
% 1.24/1.69 clause( 168, [ =( implies( implies( X, not( Y ) ), Z ), or( and( X, Y ), Z
% 1.24/1.69 ) ) ] )
% 1.24/1.69 , clause( 19148, [ =( implies( implies( X, not( Y ) ), Z ), or( and( X, Y )
% 1.24/1.69 , Z ) ) ] )
% 1.24/1.69 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 1.24/1.69 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 paramod(
% 1.24/1.69 clause( 19151, [ theorem( or( and( X, X ), not( X ) ) ) ] )
% 1.24/1.69 , clause( 168, [ =( implies( implies( X, not( Y ) ), Z ), or( and( X, Y ),
% 1.24/1.69 Z ) ) ] )
% 1.24/1.69 , 0, clause( 133, [ theorem( implies( implies( X, not( X ) ), not( X ) ) )
% 1.24/1.69 ] )
% 1.24/1.69 , 0, 1, substitution( 0, [ :=( X, X ), :=( Y, X ), :=( Z, not( X ) )] ),
% 1.24/1.69 substitution( 1, [ :=( X, X )] )).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 subsumption(
% 1.24/1.69 clause( 2527, [ theorem( or( and( X, X ), not( X ) ) ) ] )
% 1.24/1.69 , clause( 19151, [ theorem( or( and( X, X ), not( X ) ) ) ] )
% 1.24/1.69 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 resolution(
% 1.24/1.69 clause( 19153, [ theorem( or( not( X ), and( X, X ) ) ) ] )
% 1.24/1.69 , clause( 66, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 1.24/1.69 , 1, clause( 2527, [ theorem( or( and( X, X ), not( X ) ) ) ] )
% 1.24/1.69 , 0, substitution( 0, [ :=( X, not( X ) ), :=( Y, and( X, X ) )] ),
% 1.24/1.69 substitution( 1, [ :=( X, X )] )).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 paramod(
% 1.24/1.69 clause( 19154, [ theorem( implies( X, and( X, X ) ) ) ] )
% 1.24/1.69 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.24/1.69 , 0, clause( 19153, [ theorem( or( not( X ), and( X, X ) ) ) ] )
% 1.24/1.69 , 0, 1, substitution( 0, [ :=( X, X ), :=( Y, and( X, X ) )] ),
% 1.24/1.69 substitution( 1, [ :=( X, X )] )).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 subsumption(
% 1.24/1.69 clause( 2552, [ theorem( implies( X, and( X, X ) ) ) ] )
% 1.24/1.69 , clause( 19154, [ theorem( implies( X, and( X, X ) ) ) ] )
% 1.24/1.69 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 resolution(
% 1.24/1.69 clause( 19155, [ ~( theorem( or( X, X ) ) ), theorem( and( X, X ) ) ] )
% 1.24/1.69 , clause( 36, [ ~( theorem( or( X, X ) ) ), theorem( Y ), ~( theorem(
% 1.24/1.69 implies( X, Y ) ) ) ] )
% 1.24/1.69 , 2, clause( 2552, [ theorem( implies( X, and( X, X ) ) ) ] )
% 1.24/1.69 , 0, substitution( 0, [ :=( X, X ), :=( Y, and( X, X ) )] ), substitution(
% 1.24/1.69 1, [ :=( X, X )] )).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 subsumption(
% 1.24/1.69 clause( 2556, [ ~( theorem( or( X, X ) ) ), theorem( and( X, X ) ) ] )
% 1.24/1.69 , clause( 19155, [ ~( theorem( or( X, X ) ) ), theorem( and( X, X ) ) ] )
% 1.24/1.69 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 1.24/1.69 1 )] ) ).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 resolution(
% 1.24/1.69 clause( 19156, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 1.24/1.69 , clause( 68, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y ) ),
% 1.24/1.69 X ) ) ) ] )
% 1.24/1.69 , 1, clause( 126, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y,
% 1.24/1.69 implies( X, Z ) ) ) ) ] )
% 1.24/1.69 , 0, substitution( 0, [ :=( X, or( X, implies( Y, Y ) ) ), :=( Y, Y ), :=(
% 1.24/1.69 Z, X )] ), substitution( 1, [ :=( X, Y ), :=( Y, X ), :=( Z, Y )] )).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 subsumption(
% 1.24/1.69 clause( 18854, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 1.24/1.69 , clause( 19156, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 1.24/1.69 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.24/1.69 )] ) ).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 resolution(
% 1.24/1.69 clause( 19158, [ theorem( and( implies( X, X ), implies( X, X ) ) ) ] )
% 1.24/1.69 , clause( 2556, [ ~( theorem( or( X, X ) ) ), theorem( and( X, X ) ) ] )
% 1.24/1.69 , 0, clause( 18854, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 1.24/1.69 , 0, substitution( 0, [ :=( X, implies( X, X ) )] ), substitution( 1, [
% 1.24/1.69 :=( X, implies( X, X ) ), :=( Y, X )] )).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 paramod(
% 1.24/1.69 clause( 19159, [ theorem( equivalent( X, X ) ) ] )
% 1.24/1.69 , clause( 9, [ =( and( implies( X, Y ), implies( Y, X ) ), equivalent( X, Y
% 1.24/1.69 ) ) ] )
% 1.24/1.69 , 0, clause( 19158, [ theorem( and( implies( X, X ), implies( X, X ) ) ) ]
% 1.24/1.69 )
% 1.24/1.69 , 0, 1, substitution( 0, [ :=( X, X ), :=( Y, X )] ), substitution( 1, [
% 1.24/1.69 :=( X, X )] )).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 subsumption(
% 1.24/1.69 clause( 18953, [ theorem( equivalent( X, X ) ) ] )
% 1.24/1.69 , clause( 19159, [ theorem( equivalent( X, X ) ) ] )
% 1.24/1.69 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 resolution(
% 1.24/1.69 clause( 19160, [] )
% 1.24/1.69 , clause( 10, [ ~( theorem( equivalent( and( p, q ), and( p, q ) ) ) ) ] )
% 1.24/1.69 , 0, clause( 18953, [ theorem( equivalent( X, X ) ) ] )
% 1.24/1.69 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, and( p, q ) )] )).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 subsumption(
% 1.24/1.69 clause( 19075, [] )
% 1.24/1.69 , clause( 19160, [] )
% 1.24/1.69 , substitution( 0, [] ), permutation( 0, [] ) ).
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 end.
% 1.24/1.69
% 1.24/1.69 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 1.24/1.69
% 1.24/1.69 Memory use:
% 1.24/1.69
% 1.24/1.69 space for terms: 297645
% 1.24/1.69 space for clauses: 857597
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 clauses generated: 44304
% 1.24/1.69 clauses kept: 19076
% 1.24/1.69 clauses selected: 438
% 1.24/1.69 clauses deleted: 24
% 1.24/1.69 clauses inuse deleted: 4
% 1.24/1.69
% 1.24/1.69 subsentry: 439453
% 1.24/1.69 literals s-matched: 232803
% 1.24/1.69 literals matched: 218222
% 1.24/1.69 full subsumption: 92746
% 1.24/1.69
% 1.24/1.69 checksum: 1224040695
% 1.24/1.69
% 1.24/1.69
% 1.24/1.69 Bliksem ended
%------------------------------------------------------------------------------