TSTP Solution File: LCL296-3 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL296-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n019.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.27s 1.65s
% Output : Refutation 1.27s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LCL296-3 : TPTP v8.1.0. Released v2.3.0.
% 0.12/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n019.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 : Sat Jul 2 12:41:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.27/1.65 *** allocated 10000 integers for termspace/termends
% 1.27/1.65 *** allocated 10000 integers for clauses
% 1.27/1.65 *** allocated 10000 integers for justifications
% 1.27/1.65 Bliksem 1.12
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 Automatic Strategy Selection
% 1.27/1.65
% 1.27/1.65 Clauses:
% 1.27/1.65 [
% 1.27/1.65 [ axiom( implies( or( X, X ), X ) ) ],
% 1.27/1.65 [ axiom( implies( X, or( Y, X ) ) ) ],
% 1.27/1.65 [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ],
% 1.27/1.65 [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) ) ) ) ],
% 1.27/1.65 [ axiom( implies( implies( X, Y ), implies( or( Z, X ), or( Z, Y ) ) ) )
% 1.27/1.65 ],
% 1.27/1.65 [ =( implies( X, Y ), or( not( X ), Y ) ) ],
% 1.27/1.65 [ theorem( X ), ~( axiom( X ) ) ],
% 1.27/1.65 [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y ) ) ]
% 1.27/1.65 ,
% 1.27/1.65 [ =( and( X, Y ), not( or( not( X ), not( Y ) ) ) ) ],
% 1.27/1.65 [ =( equivalent( X, Y ), and( implies( X, Y ), implies( Y, X ) ) ) ]
% 1.27/1.65 ,
% 1.27/1.65 [ ~( theorem( equivalent( implies( p, not( q ) ), or( not( p ), not( q )
% 1.27/1.65 ) ) ) ) ]
% 1.27/1.65 ] .
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 percentage equality = 0.214286, percentage horn = 1.000000
% 1.27/1.65 This is a problem with some equality
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 Options Used:
% 1.27/1.65
% 1.27/1.65 useres = 1
% 1.27/1.65 useparamod = 1
% 1.27/1.65 useeqrefl = 1
% 1.27/1.65 useeqfact = 1
% 1.27/1.65 usefactor = 1
% 1.27/1.65 usesimpsplitting = 0
% 1.27/1.65 usesimpdemod = 5
% 1.27/1.65 usesimpres = 3
% 1.27/1.65
% 1.27/1.65 resimpinuse = 1000
% 1.27/1.65 resimpclauses = 20000
% 1.27/1.65 substype = eqrewr
% 1.27/1.65 backwardsubs = 1
% 1.27/1.65 selectoldest = 5
% 1.27/1.65
% 1.27/1.65 litorderings [0] = split
% 1.27/1.65 litorderings [1] = extend the termordering, first sorting on arguments
% 1.27/1.65
% 1.27/1.65 termordering = kbo
% 1.27/1.65
% 1.27/1.65 litapriori = 0
% 1.27/1.65 termapriori = 1
% 1.27/1.65 litaposteriori = 0
% 1.27/1.65 termaposteriori = 0
% 1.27/1.65 demodaposteriori = 0
% 1.27/1.65 ordereqreflfact = 0
% 1.27/1.65
% 1.27/1.65 litselect = negord
% 1.27/1.65
% 1.27/1.65 maxweight = 15
% 1.27/1.65 maxdepth = 30000
% 1.27/1.65 maxlength = 115
% 1.27/1.65 maxnrvars = 195
% 1.27/1.65 excuselevel = 1
% 1.27/1.65 increasemaxweight = 1
% 1.27/1.65
% 1.27/1.65 maxselected = 10000000
% 1.27/1.65 maxnrclauses = 10000000
% 1.27/1.65
% 1.27/1.65 showgenerated = 0
% 1.27/1.65 showkept = 0
% 1.27/1.65 showselected = 0
% 1.27/1.65 showdeleted = 0
% 1.27/1.65 showresimp = 1
% 1.27/1.65 showstatus = 2000
% 1.27/1.65
% 1.27/1.65 prologoutput = 1
% 1.27/1.65 nrgoals = 5000000
% 1.27/1.65 totalproof = 1
% 1.27/1.65
% 1.27/1.65 Symbols occurring in the translation:
% 1.27/1.65
% 1.27/1.65 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 1.27/1.65 . [1, 2] (w:1, o:26, a:1, s:1, b:0),
% 1.27/1.65 ! [4, 1] (w:0, o:18, a:1, s:1, b:0),
% 1.27/1.65 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.27/1.65 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.27/1.65 or [40, 2] (w:1, o:51, a:1, s:1, b:0),
% 1.27/1.65 implies [41, 2] (w:1, o:52, a:1, s:1, b:0),
% 1.27/1.65 axiom [42, 1] (w:1, o:23, a:1, s:1, b:0),
% 1.27/1.65 not [47, 1] (w:1, o:24, a:1, s:1, b:0),
% 1.27/1.65 theorem [48, 1] (w:1, o:25, a:1, s:1, b:0),
% 1.27/1.65 and [51, 2] (w:1, o:53, a:1, s:1, b:0),
% 1.27/1.65 equivalent [52, 2] (w:1, o:54, a:1, s:1, b:0),
% 1.27/1.65 p [53, 0] (w:1, o:16, a:1, s:1, b:0),
% 1.27/1.65 q [54, 0] (w:1, o:17, a:1, s:1, b:0).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 Starting Search:
% 1.27/1.65
% 1.27/1.65 Resimplifying inuse:
% 1.27/1.65 Done
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 Intermediate Status:
% 1.27/1.65 Generated: 3726
% 1.27/1.65 Kept: 2011
% 1.27/1.65 Inuse: 109
% 1.27/1.65 Deleted: 4
% 1.27/1.65 Deletedinuse: 4
% 1.27/1.65
% 1.27/1.65 Resimplifying inuse:
% 1.27/1.65 Done
% 1.27/1.65
% 1.27/1.65 Resimplifying inuse:
% 1.27/1.65 Done
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 Intermediate Status:
% 1.27/1.65 Generated: 7658
% 1.27/1.65 Kept: 4018
% 1.27/1.65 Inuse: 178
% 1.27/1.65 Deleted: 5
% 1.27/1.65 Deletedinuse: 4
% 1.27/1.65
% 1.27/1.65 Resimplifying inuse:
% 1.27/1.65 Done
% 1.27/1.65
% 1.27/1.65 Resimplifying inuse:
% 1.27/1.65 Done
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 Intermediate Status:
% 1.27/1.65 Generated: 12133
% 1.27/1.65 Kept: 6037
% 1.27/1.65 Inuse: 218
% 1.27/1.65 Deleted: 5
% 1.27/1.65 Deletedinuse: 4
% 1.27/1.65
% 1.27/1.65 Resimplifying inuse:
% 1.27/1.65 Done
% 1.27/1.65
% 1.27/1.65 Resimplifying inuse:
% 1.27/1.65 Done
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 Intermediate Status:
% 1.27/1.65 Generated: 16408
% 1.27/1.65 Kept: 8166
% 1.27/1.65 Inuse: 245
% 1.27/1.65 Deleted: 10
% 1.27/1.65 Deletedinuse: 4
% 1.27/1.65
% 1.27/1.65 Resimplifying inuse:
% 1.27/1.65 Done
% 1.27/1.65
% 1.27/1.65 Resimplifying inuse:
% 1.27/1.65 Done
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 Intermediate Status:
% 1.27/1.65 Generated: 21204
% 1.27/1.65 Kept: 10237
% 1.27/1.65 Inuse: 284
% 1.27/1.65 Deleted: 10
% 1.27/1.65 Deletedinuse: 4
% 1.27/1.65
% 1.27/1.65 Resimplifying inuse:
% 1.27/1.65 Done
% 1.27/1.65
% 1.27/1.65 Resimplifying inuse:
% 1.27/1.65 Done
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 Intermediate Status:
% 1.27/1.65 Generated: 26861
% 1.27/1.65 Kept: 12330
% 1.27/1.65 Inuse: 332
% 1.27/1.65 Deleted: 10
% 1.27/1.65 Deletedinuse: 4
% 1.27/1.65
% 1.27/1.65 Resimplifying inuse:
% 1.27/1.65 Done
% 1.27/1.65
% 1.27/1.65 Resimplifying inuse:
% 1.27/1.65 Done
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 Intermediate Status:
% 1.27/1.65 Generated: 30618
% 1.27/1.65 Kept: 14397
% 1.27/1.65 Inuse: 364
% 1.27/1.65 Deleted: 10
% 1.27/1.65 Deletedinuse: 4
% 1.27/1.65
% 1.27/1.65 Resimplifying inuse:
% 1.27/1.65 Done
% 1.27/1.65
% 1.27/1.65 Resimplifying inuse:
% 1.27/1.65 Done
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 Intermediate Status:
% 1.27/1.65 Generated: 36529
% 1.27/1.65 Kept: 16533
% 1.27/1.65 Inuse: 404
% 1.27/1.65 Deleted: 10
% 1.27/1.65 Deletedinuse: 4
% 1.27/1.65
% 1.27/1.65 Resimplifying inuse:
% 1.27/1.65 Done
% 1.27/1.65
% 1.27/1.65 Resimplifying inuse:
% 1.27/1.65 Done
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 Intermediate Status:
% 1.27/1.65 Generated: 42449
% 1.27/1.65 Kept: 18584
% 1.27/1.65 Inuse: 446
% 1.27/1.65 Deleted: 10
% 1.27/1.65 Deletedinuse: 4
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 Bliksems!, er is een bewijs:
% 1.27/1.65 % SZS status Unsatisfiable
% 1.27/1.65 % SZS output start Refutation
% 1.27/1.65
% 1.27/1.65 clause( 0, [ axiom( implies( or( X, X ), X ) ) ] )
% 1.27/1.65 .
% 1.27/1.65 clause( 1, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 1.27/1.65 .
% 1.27/1.65 clause( 2, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 1.27/1.65 .
% 1.27/1.65 clause( 3, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) ) ) ) ]
% 1.27/1.65 )
% 1.27/1.65 .
% 1.27/1.65 clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.27/1.65 .
% 1.27/1.65 clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.27/1.65 .
% 1.27/1.65 clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y )
% 1.27/1.65 ) ] )
% 1.27/1.65 .
% 1.27/1.65 clause( 8, [ =( not( implies( X, not( Y ) ) ), and( X, Y ) ) ] )
% 1.27/1.65 .
% 1.27/1.65 clause( 9, [ =( and( implies( X, Y ), implies( Y, X ) ), equivalent( X, Y )
% 1.27/1.65 ) ] )
% 1.27/1.65 .
% 1.27/1.65 clause( 10, [ ~( theorem( equivalent( implies( p, not( q ) ), implies( p,
% 1.27/1.65 not( q ) ) ) ) ) ] )
% 1.27/1.65 .
% 1.27/1.65 clause( 11, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 1.27/1.65 .
% 1.27/1.65 clause( 12, [ theorem( implies( or( X, X ), X ) ) ] )
% 1.27/1.65 .
% 1.27/1.65 clause( 16, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 1.27/1.65 .
% 1.27/1.65 clause( 20, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X ) )
% 1.27/1.65 ) ] )
% 1.27/1.65 .
% 1.27/1.65 clause( 36, [ ~( theorem( or( X, X ) ) ), theorem( Y ), ~( theorem( implies(
% 1.27/1.65 X, Y ) ) ) ] )
% 1.27/1.65 .
% 1.27/1.65 clause( 66, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 1.27/1.65 .
% 1.27/1.65 clause( 68, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y ) ), X
% 1.27/1.65 ) ) ) ] )
% 1.27/1.65 .
% 1.27/1.65 clause( 126, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies( X
% 1.27/1.65 , Z ) ) ) ) ] )
% 1.27/1.65 .
% 1.27/1.65 clause( 133, [ theorem( implies( implies( X, not( X ) ), not( X ) ) ) ] )
% 1.27/1.65 .
% 1.27/1.65 clause( 168, [ =( implies( implies( X, not( Y ) ), Z ), or( and( X, Y ), Z
% 1.27/1.65 ) ) ] )
% 1.27/1.65 .
% 1.27/1.65 clause( 2630, [ theorem( or( and( X, X ), not( X ) ) ) ] )
% 1.27/1.65 .
% 1.27/1.65 clause( 2656, [ theorem( implies( X, and( X, X ) ) ) ] )
% 1.27/1.65 .
% 1.27/1.65 clause( 2661, [ ~( theorem( or( X, X ) ) ), theorem( and( X, X ) ) ] )
% 1.27/1.65 .
% 1.27/1.65 clause( 18439, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 1.27/1.65 .
% 1.27/1.65 clause( 18544, [ theorem( equivalent( X, X ) ) ] )
% 1.27/1.65 .
% 1.27/1.65 clause( 18682, [] )
% 1.27/1.65 .
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 % SZS output end Refutation
% 1.27/1.65 found a proof!
% 1.27/1.65
% 1.27/1.65 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 1.27/1.65
% 1.27/1.65 initialclauses(
% 1.27/1.65 [ clause( 18684, [ axiom( implies( or( X, X ), X ) ) ] )
% 1.27/1.65 , clause( 18685, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 1.27/1.65 , clause( 18686, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 1.27/1.65 , clause( 18687, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) )
% 1.27/1.65 ) ) ] )
% 1.27/1.65 , clause( 18688, [ axiom( implies( implies( X, Y ), implies( or( Z, X ), or(
% 1.27/1.65 Z, Y ) ) ) ) ] )
% 1.27/1.65 , clause( 18689, [ =( implies( X, Y ), or( not( X ), Y ) ) ] )
% 1.27/1.65 , clause( 18690, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.27/1.65 , clause( 18691, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~(
% 1.27/1.65 theorem( Y ) ) ] )
% 1.27/1.65 , clause( 18692, [ =( and( X, Y ), not( or( not( X ), not( Y ) ) ) ) ] )
% 1.27/1.65 , clause( 18693, [ =( equivalent( X, Y ), and( implies( X, Y ), implies( Y
% 1.27/1.65 , X ) ) ) ] )
% 1.27/1.65 , clause( 18694, [ ~( theorem( equivalent( implies( p, not( q ) ), or( not(
% 1.27/1.65 p ), not( q ) ) ) ) ) ] )
% 1.27/1.65 ] ).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 subsumption(
% 1.27/1.65 clause( 0, [ axiom( implies( or( X, X ), X ) ) ] )
% 1.27/1.65 , clause( 18684, [ axiom( implies( or( X, X ), X ) ) ] )
% 1.27/1.65 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 subsumption(
% 1.27/1.65 clause( 1, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 1.27/1.65 , clause( 18685, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 1.27/1.65 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.27/1.65 )] ) ).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 subsumption(
% 1.27/1.65 clause( 2, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 1.27/1.65 , clause( 18686, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 1.27/1.65 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.27/1.65 )] ) ).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 subsumption(
% 1.27/1.65 clause( 3, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) ) ) ) ]
% 1.27/1.65 )
% 1.27/1.65 , clause( 18687, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) )
% 1.27/1.65 ) ) ] )
% 1.27/1.65 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 1.27/1.65 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 eqswap(
% 1.27/1.65 clause( 18695, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.27/1.65 , clause( 18689, [ =( implies( X, Y ), or( not( X ), Y ) ) ] )
% 1.27/1.65 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 subsumption(
% 1.27/1.65 clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.27/1.65 , clause( 18695, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.27/1.65 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.27/1.65 )] ) ).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 subsumption(
% 1.27/1.65 clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.27/1.65 , clause( 18690, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.27/1.65 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 1.27/1.65 1 )] ) ).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 subsumption(
% 1.27/1.65 clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y )
% 1.27/1.65 ) ] )
% 1.27/1.65 , clause( 18691, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~(
% 1.27/1.65 theorem( Y ) ) ] )
% 1.27/1.65 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.27/1.65 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 paramod(
% 1.27/1.65 clause( 18711, [ =( and( X, Y ), not( implies( X, not( Y ) ) ) ) ] )
% 1.27/1.65 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.27/1.65 , 0, clause( 18692, [ =( and( X, Y ), not( or( not( X ), not( Y ) ) ) ) ]
% 1.27/1.65 )
% 1.27/1.65 , 0, 5, substitution( 0, [ :=( X, X ), :=( Y, not( Y ) )] ), substitution(
% 1.27/1.65 1, [ :=( X, X ), :=( Y, Y )] )).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 eqswap(
% 1.27/1.65 clause( 18712, [ =( not( implies( X, not( Y ) ) ), and( X, Y ) ) ] )
% 1.27/1.65 , clause( 18711, [ =( and( X, Y ), not( implies( X, not( Y ) ) ) ) ] )
% 1.27/1.65 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 subsumption(
% 1.27/1.65 clause( 8, [ =( not( implies( X, not( Y ) ) ), and( X, Y ) ) ] )
% 1.27/1.65 , clause( 18712, [ =( not( implies( X, not( Y ) ) ), and( X, Y ) ) ] )
% 1.27/1.65 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.27/1.65 )] ) ).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 eqswap(
% 1.27/1.65 clause( 18715, [ =( and( implies( X, Y ), implies( Y, X ) ), equivalent( X
% 1.27/1.65 , Y ) ) ] )
% 1.27/1.65 , clause( 18693, [ =( equivalent( X, Y ), and( implies( X, Y ), implies( Y
% 1.27/1.65 , X ) ) ) ] )
% 1.27/1.65 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 subsumption(
% 1.27/1.65 clause( 9, [ =( and( implies( X, Y ), implies( Y, X ) ), equivalent( X, Y )
% 1.27/1.65 ) ] )
% 1.27/1.65 , clause( 18715, [ =( and( implies( X, Y ), implies( Y, X ) ), equivalent(
% 1.27/1.65 X, Y ) ) ] )
% 1.27/1.65 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.27/1.65 )] ) ).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 paramod(
% 1.27/1.65 clause( 18736, [ ~( theorem( equivalent( implies( p, not( q ) ), implies( p
% 1.27/1.65 , not( q ) ) ) ) ) ] )
% 1.27/1.65 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.27/1.65 , 0, clause( 18694, [ ~( theorem( equivalent( implies( p, not( q ) ), or(
% 1.27/1.65 not( p ), not( q ) ) ) ) ) ] )
% 1.27/1.65 , 0, 7, substitution( 0, [ :=( X, p ), :=( Y, not( q ) )] ), substitution(
% 1.27/1.65 1, [] )).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 subsumption(
% 1.27/1.65 clause( 10, [ ~( theorem( equivalent( implies( p, not( q ) ), implies( p,
% 1.27/1.65 not( q ) ) ) ) ) ] )
% 1.27/1.65 , clause( 18736, [ ~( theorem( equivalent( implies( p, not( q ) ), implies(
% 1.27/1.65 p, not( q ) ) ) ) ) ] )
% 1.27/1.65 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 resolution(
% 1.27/1.65 clause( 18737, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 1.27/1.65 , clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.27/1.65 , 1, clause( 1, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 1.27/1.65 , 0, substitution( 0, [ :=( X, implies( X, or( Y, X ) ) )] ),
% 1.27/1.65 substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 subsumption(
% 1.27/1.65 clause( 11, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 1.27/1.65 , clause( 18737, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 1.27/1.65 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.27/1.65 )] ) ).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 resolution(
% 1.27/1.65 clause( 18738, [ theorem( implies( or( X, X ), X ) ) ] )
% 1.27/1.65 , clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.27/1.65 , 1, clause( 0, [ axiom( implies( or( X, X ), X ) ) ] )
% 1.27/1.65 , 0, substitution( 0, [ :=( X, implies( or( X, X ), X ) )] ),
% 1.27/1.65 substitution( 1, [ :=( X, X )] )).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 subsumption(
% 1.27/1.65 clause( 12, [ theorem( implies( or( X, X ), X ) ) ] )
% 1.27/1.65 , clause( 18738, [ theorem( implies( or( X, X ), X ) ) ] )
% 1.27/1.65 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 resolution(
% 1.27/1.65 clause( 18739, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 1.27/1.65 , clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y
% 1.27/1.65 ) ) ] )
% 1.27/1.65 , 1, clause( 12, [ theorem( implies( or( X, X ), X ) ) ] )
% 1.27/1.65 , 0, substitution( 0, [ :=( X, X ), :=( Y, or( X, X ) )] ), substitution( 1
% 1.27/1.65 , [ :=( X, X )] )).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 subsumption(
% 1.27/1.65 clause( 16, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 1.27/1.65 , clause( 18739, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 1.27/1.65 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 1.27/1.65 1 )] ) ).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 resolution(
% 1.27/1.65 clause( 18741, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X )
% 1.27/1.65 ) ) ] )
% 1.27/1.65 , clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y
% 1.27/1.65 ) ) ] )
% 1.27/1.65 , 1, clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.27/1.65 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [ :=( X
% 1.27/1.65 , implies( Y, X ) )] )).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 subsumption(
% 1.27/1.65 clause( 20, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X ) )
% 1.27/1.65 ) ] )
% 1.27/1.65 , clause( 18741, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X
% 1.27/1.65 ) ) ) ] )
% 1.27/1.65 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.27/1.65 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 resolution(
% 1.27/1.65 clause( 18745, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem(
% 1.27/1.65 or( Y, Y ) ) ) ] )
% 1.27/1.65 , clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y
% 1.27/1.65 ) ) ] )
% 1.27/1.65 , 2, clause( 16, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 1.27/1.65 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [ :=( X
% 1.27/1.65 , Y )] )).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 subsumption(
% 1.27/1.65 clause( 36, [ ~( theorem( or( X, X ) ) ), theorem( Y ), ~( theorem( implies(
% 1.27/1.65 X, Y ) ) ) ] )
% 1.27/1.65 , clause( 18745, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~(
% 1.27/1.65 theorem( or( Y, Y ) ) ) ] )
% 1.27/1.65 , substitution( 0, [ :=( X, Y ), :=( Y, X )] ), permutation( 0, [ ==>( 0, 1
% 1.27/1.65 ), ==>( 1, 2 ), ==>( 2, 0 )] ) ).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 resolution(
% 1.27/1.65 clause( 18746, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 1.27/1.65 , clause( 20, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X )
% 1.27/1.65 ) ) ] )
% 1.27/1.65 , 2, clause( 2, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 1.27/1.65 , 0, substitution( 0, [ :=( X, or( X, Y ) ), :=( Y, or( Y, X ) )] ),
% 1.27/1.65 substitution( 1, [ :=( X, Y ), :=( Y, X )] )).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 subsumption(
% 1.27/1.65 clause( 66, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 1.27/1.65 , clause( 18746, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 1.27/1.65 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.27/1.65 ), ==>( 1, 1 )] ) ).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 resolution(
% 1.27/1.65 clause( 18747, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y ) )
% 1.27/1.65 , X ) ) ) ] )
% 1.27/1.65 , clause( 20, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X )
% 1.27/1.65 ) ) ] )
% 1.27/1.65 , 1, clause( 11, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 1.27/1.65 , 0, substitution( 0, [ :=( X, X ), :=( Y, implies( Y, or( Z, Y ) ) )] ),
% 1.27/1.65 substitution( 1, [ :=( X, Y ), :=( Y, Z )] )).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 subsumption(
% 1.27/1.65 clause( 68, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y ) ), X
% 1.27/1.65 ) ) ) ] )
% 1.27/1.65 , clause( 18747, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y )
% 1.27/1.65 ), X ) ) ) ] )
% 1.27/1.65 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 1.27/1.65 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 paramod(
% 1.27/1.65 clause( 18753, [ axiom( implies( or( not( X ), or( Y, Z ) ), or( Y, implies(
% 1.27/1.65 X, Z ) ) ) ) ] )
% 1.27/1.65 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.27/1.65 , 0, clause( 3, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) )
% 1.27/1.65 ) ) ] )
% 1.27/1.65 , 0, 10, substitution( 0, [ :=( X, X ), :=( Y, Z )] ), substitution( 1, [
% 1.27/1.65 :=( X, not( X ) ), :=( Y, Y ), :=( Z, Z )] )).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 paramod(
% 1.27/1.65 clause( 18756, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies(
% 1.27/1.65 X, Z ) ) ) ) ] )
% 1.27/1.65 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.27/1.65 , 0, clause( 18753, [ axiom( implies( or( not( X ), or( Y, Z ) ), or( Y,
% 1.27/1.65 implies( X, Z ) ) ) ) ] )
% 1.27/1.65 , 0, 2, substitution( 0, [ :=( X, X ), :=( Y, or( Y, Z ) )] ),
% 1.27/1.65 substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 subsumption(
% 1.27/1.65 clause( 126, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies( X
% 1.27/1.65 , Z ) ) ) ) ] )
% 1.27/1.65 , clause( 18756, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies(
% 1.27/1.65 X, Z ) ) ) ) ] )
% 1.27/1.65 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 1.27/1.65 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 paramod(
% 1.27/1.65 clause( 18758, [ theorem( implies( implies( X, not( X ) ), not( X ) ) ) ]
% 1.27/1.65 )
% 1.27/1.65 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.27/1.65 , 0, clause( 12, [ theorem( implies( or( X, X ), X ) ) ] )
% 1.27/1.65 , 0, 2, substitution( 0, [ :=( X, X ), :=( Y, not( X ) )] ), substitution(
% 1.27/1.65 1, [ :=( X, not( X ) )] )).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 subsumption(
% 1.27/1.65 clause( 133, [ theorem( implies( implies( X, not( X ) ), not( X ) ) ) ] )
% 1.27/1.65 , clause( 18758, [ theorem( implies( implies( X, not( X ) ), not( X ) ) ) ]
% 1.27/1.65 )
% 1.27/1.65 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 eqswap(
% 1.27/1.65 clause( 18760, [ =( implies( X, Y ), or( not( X ), Y ) ) ] )
% 1.27/1.65 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.27/1.65 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 paramod(
% 1.27/1.65 clause( 18761, [ =( implies( implies( X, not( Y ) ), Z ), or( and( X, Y ),
% 1.27/1.65 Z ) ) ] )
% 1.27/1.65 , clause( 8, [ =( not( implies( X, not( Y ) ) ), and( X, Y ) ) ] )
% 1.27/1.65 , 0, clause( 18760, [ =( implies( X, Y ), or( not( X ), Y ) ) ] )
% 1.27/1.65 , 0, 8, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [
% 1.27/1.65 :=( X, implies( X, not( Y ) ) ), :=( Y, Z )] )).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 subsumption(
% 1.27/1.65 clause( 168, [ =( implies( implies( X, not( Y ) ), Z ), or( and( X, Y ), Z
% 1.27/1.65 ) ) ] )
% 1.27/1.65 , clause( 18761, [ =( implies( implies( X, not( Y ) ), Z ), or( and( X, Y )
% 1.27/1.65 , Z ) ) ] )
% 1.27/1.65 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 1.27/1.65 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 paramod(
% 1.27/1.65 clause( 18764, [ theorem( or( and( X, X ), not( X ) ) ) ] )
% 1.27/1.65 , clause( 168, [ =( implies( implies( X, not( Y ) ), Z ), or( and( X, Y ),
% 1.27/1.65 Z ) ) ] )
% 1.27/1.65 , 0, clause( 133, [ theorem( implies( implies( X, not( X ) ), not( X ) ) )
% 1.27/1.65 ] )
% 1.27/1.65 , 0, 1, substitution( 0, [ :=( X, X ), :=( Y, X ), :=( Z, not( X ) )] ),
% 1.27/1.65 substitution( 1, [ :=( X, X )] )).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 subsumption(
% 1.27/1.65 clause( 2630, [ theorem( or( and( X, X ), not( X ) ) ) ] )
% 1.27/1.65 , clause( 18764, [ theorem( or( and( X, X ), not( X ) ) ) ] )
% 1.27/1.65 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 resolution(
% 1.27/1.65 clause( 18766, [ theorem( or( not( X ), and( X, X ) ) ) ] )
% 1.27/1.65 , clause( 66, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 1.27/1.65 , 1, clause( 2630, [ theorem( or( and( X, X ), not( X ) ) ) ] )
% 1.27/1.65 , 0, substitution( 0, [ :=( X, not( X ) ), :=( Y, and( X, X ) )] ),
% 1.27/1.65 substitution( 1, [ :=( X, X )] )).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 paramod(
% 1.27/1.65 clause( 18767, [ theorem( implies( X, and( X, X ) ) ) ] )
% 1.27/1.65 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.27/1.65 , 0, clause( 18766, [ theorem( or( not( X ), and( X, X ) ) ) ] )
% 1.27/1.65 , 0, 1, substitution( 0, [ :=( X, X ), :=( Y, and( X, X ) )] ),
% 1.27/1.65 substitution( 1, [ :=( X, X )] )).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 subsumption(
% 1.27/1.65 clause( 2656, [ theorem( implies( X, and( X, X ) ) ) ] )
% 1.27/1.65 , clause( 18767, [ theorem( implies( X, and( X, X ) ) ) ] )
% 1.27/1.65 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 resolution(
% 1.27/1.65 clause( 18768, [ ~( theorem( or( X, X ) ) ), theorem( and( X, X ) ) ] )
% 1.27/1.65 , clause( 36, [ ~( theorem( or( X, X ) ) ), theorem( Y ), ~( theorem(
% 1.27/1.65 implies( X, Y ) ) ) ] )
% 1.27/1.65 , 2, clause( 2656, [ theorem( implies( X, and( X, X ) ) ) ] )
% 1.27/1.65 , 0, substitution( 0, [ :=( X, X ), :=( Y, and( X, X ) )] ), substitution(
% 1.27/1.65 1, [ :=( X, X )] )).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 subsumption(
% 1.27/1.65 clause( 2661, [ ~( theorem( or( X, X ) ) ), theorem( and( X, X ) ) ] )
% 1.27/1.65 , clause( 18768, [ ~( theorem( or( X, X ) ) ), theorem( and( X, X ) ) ] )
% 1.27/1.65 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 1.27/1.65 1 )] ) ).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 resolution(
% 1.27/1.65 clause( 18769, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 1.27/1.65 , clause( 68, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y ) ),
% 1.27/1.65 X ) ) ) ] )
% 1.27/1.65 , 1, clause( 126, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y,
% 1.27/1.65 implies( X, Z ) ) ) ) ] )
% 1.27/1.65 , 0, substitution( 0, [ :=( X, or( X, implies( Y, Y ) ) ), :=( Y, Y ), :=(
% 1.27/1.65 Z, X )] ), substitution( 1, [ :=( X, Y ), :=( Y, X ), :=( Z, Y )] )).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 subsumption(
% 1.27/1.65 clause( 18439, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 1.27/1.65 , clause( 18769, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 1.27/1.65 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.27/1.65 )] ) ).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 resolution(
% 1.27/1.65 clause( 18771, [ theorem( and( implies( X, X ), implies( X, X ) ) ) ] )
% 1.27/1.65 , clause( 2661, [ ~( theorem( or( X, X ) ) ), theorem( and( X, X ) ) ] )
% 1.27/1.65 , 0, clause( 18439, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 1.27/1.65 , 0, substitution( 0, [ :=( X, implies( X, X ) )] ), substitution( 1, [
% 1.27/1.65 :=( X, implies( X, X ) ), :=( Y, X )] )).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 paramod(
% 1.27/1.65 clause( 18772, [ theorem( equivalent( X, X ) ) ] )
% 1.27/1.65 , clause( 9, [ =( and( implies( X, Y ), implies( Y, X ) ), equivalent( X, Y
% 1.27/1.65 ) ) ] )
% 1.27/1.65 , 0, clause( 18771, [ theorem( and( implies( X, X ), implies( X, X ) ) ) ]
% 1.27/1.65 )
% 1.27/1.65 , 0, 1, substitution( 0, [ :=( X, X ), :=( Y, X )] ), substitution( 1, [
% 1.27/1.65 :=( X, X )] )).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 subsumption(
% 1.27/1.65 clause( 18544, [ theorem( equivalent( X, X ) ) ] )
% 1.27/1.65 , clause( 18772, [ theorem( equivalent( X, X ) ) ] )
% 1.27/1.65 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 resolution(
% 1.27/1.65 clause( 18773, [] )
% 1.27/1.65 , clause( 10, [ ~( theorem( equivalent( implies( p, not( q ) ), implies( p
% 1.27/1.65 , not( q ) ) ) ) ) ] )
% 1.27/1.65 , 0, clause( 18544, [ theorem( equivalent( X, X ) ) ] )
% 1.27/1.65 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, implies( p, not( q )
% 1.27/1.65 ) )] )).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 subsumption(
% 1.27/1.65 clause( 18682, [] )
% 1.27/1.65 , clause( 18773, [] )
% 1.27/1.65 , substitution( 0, [] ), permutation( 0, [] ) ).
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 end.
% 1.27/1.65
% 1.27/1.65 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 1.27/1.65
% 1.27/1.65 Memory use:
% 1.27/1.65
% 1.27/1.65 space for terms: 286887
% 1.27/1.65 space for clauses: 845415
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 clauses generated: 42555
% 1.27/1.65 clauses kept: 18683
% 1.27/1.65 clauses selected: 447
% 1.27/1.65 clauses deleted: 10
% 1.27/1.65 clauses inuse deleted: 4
% 1.27/1.65
% 1.27/1.65 subsentry: 435970
% 1.27/1.65 literals s-matched: 210698
% 1.27/1.65 literals matched: 199711
% 1.27/1.65 full subsumption: 79608
% 1.27/1.65
% 1.27/1.65 checksum: 506759929
% 1.27/1.65
% 1.27/1.65
% 1.27/1.65 Bliksem ended
%------------------------------------------------------------------------------