TSTP Solution File: LCL287-3 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL287-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n015.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:30 EDT 2022
% Result : Unsatisfiable 1.34s 1.75s
% Output : Refutation 1.34s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL287-3 : TPTP v8.1.0. Released v2.3.0.
% 0.11/0.13 % Command : bliksem %s
% 0.14/0.33 % Computer : n015.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % DateTime : Sat Jul 2 15:58:29 EDT 2022
% 0.14/0.34 % CPUTime :
% 1.34/1.75 *** allocated 10000 integers for termspace/termends
% 1.34/1.75 *** allocated 10000 integers for clauses
% 1.34/1.75 *** allocated 10000 integers for justifications
% 1.34/1.75 Bliksem 1.12
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 Automatic Strategy Selection
% 1.34/1.75
% 1.34/1.75 Clauses:
% 1.34/1.75 [
% 1.34/1.75 [ axiom( implies( or( X, X ), X ) ) ],
% 1.34/1.75 [ axiom( implies( X, or( Y, X ) ) ) ],
% 1.34/1.75 [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ],
% 1.34/1.75 [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) ) ) ) ],
% 1.34/1.75 [ axiom( implies( implies( X, Y ), implies( or( Z, X ), or( Z, Y ) ) ) )
% 1.34/1.75 ],
% 1.34/1.75 [ =( implies( X, Y ), or( not( X ), Y ) ) ],
% 1.34/1.75 [ theorem( X ), ~( axiom( X ) ) ],
% 1.34/1.75 [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y ) ) ]
% 1.34/1.75 ,
% 1.34/1.75 [ =( and( X, Y ), not( or( not( X ), not( Y ) ) ) ) ],
% 1.34/1.75 [ =( equivalent( X, Y ), and( implies( X, Y ), implies( Y, X ) ) ) ]
% 1.34/1.75 ,
% 1.34/1.75 [ ~( theorem( equivalent( and( p, q ), not( or( not( p ), not( q ) ) ) )
% 1.34/1.75 ) ) ]
% 1.34/1.75 ] .
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 percentage equality = 0.214286, percentage horn = 1.000000
% 1.34/1.75 This is a problem with some equality
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 Options Used:
% 1.34/1.75
% 1.34/1.75 useres = 1
% 1.34/1.75 useparamod = 1
% 1.34/1.75 useeqrefl = 1
% 1.34/1.75 useeqfact = 1
% 1.34/1.75 usefactor = 1
% 1.34/1.75 usesimpsplitting = 0
% 1.34/1.75 usesimpdemod = 5
% 1.34/1.75 usesimpres = 3
% 1.34/1.75
% 1.34/1.75 resimpinuse = 1000
% 1.34/1.75 resimpclauses = 20000
% 1.34/1.75 substype = eqrewr
% 1.34/1.75 backwardsubs = 1
% 1.34/1.75 selectoldest = 5
% 1.34/1.75
% 1.34/1.75 litorderings [0] = split
% 1.34/1.75 litorderings [1] = extend the termordering, first sorting on arguments
% 1.34/1.75
% 1.34/1.75 termordering = kbo
% 1.34/1.75
% 1.34/1.75 litapriori = 0
% 1.34/1.75 termapriori = 1
% 1.34/1.75 litaposteriori = 0
% 1.34/1.75 termaposteriori = 0
% 1.34/1.75 demodaposteriori = 0
% 1.34/1.75 ordereqreflfact = 0
% 1.34/1.75
% 1.34/1.75 litselect = negord
% 1.34/1.75
% 1.34/1.75 maxweight = 15
% 1.34/1.75 maxdepth = 30000
% 1.34/1.75 maxlength = 115
% 1.34/1.75 maxnrvars = 195
% 1.34/1.75 excuselevel = 1
% 1.34/1.75 increasemaxweight = 1
% 1.34/1.75
% 1.34/1.75 maxselected = 10000000
% 1.34/1.75 maxnrclauses = 10000000
% 1.34/1.75
% 1.34/1.75 showgenerated = 0
% 1.34/1.75 showkept = 0
% 1.34/1.75 showselected = 0
% 1.34/1.75 showdeleted = 0
% 1.34/1.75 showresimp = 1
% 1.34/1.75 showstatus = 2000
% 1.34/1.75
% 1.34/1.75 prologoutput = 1
% 1.34/1.75 nrgoals = 5000000
% 1.34/1.75 totalproof = 1
% 1.34/1.75
% 1.34/1.75 Symbols occurring in the translation:
% 1.34/1.75
% 1.34/1.75 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 1.34/1.75 . [1, 2] (w:1, o:26, a:1, s:1, b:0),
% 1.34/1.75 ! [4, 1] (w:0, o:18, a:1, s:1, b:0),
% 1.34/1.75 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.34/1.75 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.34/1.75 or [40, 2] (w:1, o:51, a:1, s:1, b:0),
% 1.34/1.75 implies [41, 2] (w:1, o:52, a:1, s:1, b:0),
% 1.34/1.75 axiom [42, 1] (w:1, o:23, a:1, s:1, b:0),
% 1.34/1.75 not [47, 1] (w:1, o:24, a:1, s:1, b:0),
% 1.34/1.75 theorem [48, 1] (w:1, o:25, a:1, s:1, b:0),
% 1.34/1.75 and [51, 2] (w:1, o:53, a:1, s:1, b:0),
% 1.34/1.75 equivalent [52, 2] (w:1, o:54, a:1, s:1, b:0),
% 1.34/1.75 p [53, 0] (w:1, o:16, a:1, s:1, b:0),
% 1.34/1.75 q [54, 0] (w:1, o:17, a:1, s:1, b:0).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 Starting Search:
% 1.34/1.75
% 1.34/1.75 Resimplifying inuse:
% 1.34/1.75 Done
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 Intermediate Status:
% 1.34/1.75 Generated: 3749
% 1.34/1.75 Kept: 2035
% 1.34/1.75 Inuse: 111
% 1.34/1.75 Deleted: 4
% 1.34/1.75 Deletedinuse: 4
% 1.34/1.75
% 1.34/1.75 Resimplifying inuse:
% 1.34/1.75 Done
% 1.34/1.75
% 1.34/1.75 Resimplifying inuse:
% 1.34/1.75 Done
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 Intermediate Status:
% 1.34/1.75 Generated: 7771
% 1.34/1.75 Kept: 4052
% 1.34/1.75 Inuse: 177
% 1.34/1.75 Deleted: 5
% 1.34/1.75 Deletedinuse: 4
% 1.34/1.75
% 1.34/1.75 Resimplifying inuse:
% 1.34/1.75 Done
% 1.34/1.75
% 1.34/1.75 Resimplifying inuse:
% 1.34/1.75 Done
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 Intermediate Status:
% 1.34/1.75 Generated: 12612
% 1.34/1.75 Kept: 6134
% 1.34/1.75 Inuse: 218
% 1.34/1.75 Deleted: 7
% 1.34/1.75 Deletedinuse: 4
% 1.34/1.75
% 1.34/1.75 Resimplifying inuse:
% 1.34/1.75 Done
% 1.34/1.75
% 1.34/1.75 Resimplifying inuse:
% 1.34/1.75 Done
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 Intermediate Status:
% 1.34/1.75 Generated: 17422
% 1.34/1.75 Kept: 8161
% 1.34/1.75 Inuse: 256
% 1.34/1.75 Deleted: 10
% 1.34/1.75 Deletedinuse: 4
% 1.34/1.75
% 1.34/1.75 Resimplifying inuse:
% 1.34/1.75 Done
% 1.34/1.75
% 1.34/1.75 Resimplifying inuse:
% 1.34/1.75 Done
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 Intermediate Status:
% 1.34/1.75 Generated: 22635
% 1.34/1.75 Kept: 10262
% 1.34/1.75 Inuse: 306
% 1.34/1.75 Deleted: 10
% 1.34/1.75 Deletedinuse: 4
% 1.34/1.75
% 1.34/1.75 Resimplifying inuse:
% 1.34/1.75 Done
% 1.34/1.75
% 1.34/1.75 Resimplifying inuse:
% 1.34/1.75 Done
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 Intermediate Status:
% 1.34/1.75 Generated: 28561
% 1.34/1.75 Kept: 12301
% 1.34/1.75 Inuse: 357
% 1.34/1.75 Deleted: 10
% 1.34/1.75 Deletedinuse: 4
% 1.34/1.75
% 1.34/1.75 Resimplifying inuse:
% 1.34/1.75 Done
% 1.34/1.75
% 1.34/1.75 Resimplifying inuse:
% 1.34/1.75 Done
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 Intermediate Status:
% 1.34/1.75 Generated: 33447
% 1.34/1.75 Kept: 14354
% 1.34/1.75 Inuse: 390
% 1.34/1.75 Deleted: 10
% 1.34/1.75 Deletedinuse: 4
% 1.34/1.75
% 1.34/1.75 Resimplifying inuse:
% 1.34/1.75 Done
% 1.34/1.75
% 1.34/1.75 Resimplifying inuse:
% 1.34/1.75 Done
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 Intermediate Status:
% 1.34/1.75 Generated: 39615
% 1.34/1.75 Kept: 16391
% 1.34/1.75 Inuse: 421
% 1.34/1.75 Deleted: 22
% 1.34/1.75 Deletedinuse: 4
% 1.34/1.75
% 1.34/1.75 Resimplifying inuse:
% 1.34/1.75 Done
% 1.34/1.75
% 1.34/1.75 Resimplifying inuse:
% 1.34/1.75 Done
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 Intermediate Status:
% 1.34/1.75 Generated: 43192
% 1.34/1.75 Kept: 18461
% 1.34/1.75 Inuse: 432
% 1.34/1.75 Deleted: 22
% 1.34/1.75 Deletedinuse: 4
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 Bliksems!, er is een bewijs:
% 1.34/1.75 % SZS status Unsatisfiable
% 1.34/1.75 % SZS output start Refutation
% 1.34/1.75
% 1.34/1.75 clause( 0, [ axiom( implies( or( X, X ), X ) ) ] )
% 1.34/1.75 .
% 1.34/1.75 clause( 1, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 1.34/1.75 .
% 1.34/1.75 clause( 2, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 1.34/1.75 .
% 1.34/1.75 clause( 3, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) ) ) ) ]
% 1.34/1.75 )
% 1.34/1.75 .
% 1.34/1.75 clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.34/1.75 .
% 1.34/1.75 clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.34/1.75 .
% 1.34/1.75 clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y )
% 1.34/1.75 ) ] )
% 1.34/1.75 .
% 1.34/1.75 clause( 8, [ =( not( implies( X, not( Y ) ) ), and( X, Y ) ) ] )
% 1.34/1.75 .
% 1.34/1.75 clause( 9, [ =( and( implies( X, Y ), implies( Y, X ) ), equivalent( X, Y )
% 1.34/1.75 ) ] )
% 1.34/1.75 .
% 1.34/1.75 clause( 10, [ ~( theorem( equivalent( and( p, q ), and( p, q ) ) ) ) ] )
% 1.34/1.75 .
% 1.34/1.75 clause( 11, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 1.34/1.75 .
% 1.34/1.75 clause( 12, [ theorem( implies( or( X, X ), X ) ) ] )
% 1.34/1.75 .
% 1.34/1.75 clause( 16, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 1.34/1.75 .
% 1.34/1.75 clause( 20, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X ) )
% 1.34/1.75 ) ] )
% 1.34/1.75 .
% 1.34/1.75 clause( 36, [ ~( theorem( or( X, X ) ) ), theorem( Y ), ~( theorem( implies(
% 1.34/1.75 X, Y ) ) ) ] )
% 1.34/1.75 .
% 1.34/1.75 clause( 66, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 1.34/1.75 .
% 1.34/1.75 clause( 68, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y ) ), X
% 1.34/1.75 ) ) ) ] )
% 1.34/1.75 .
% 1.34/1.75 clause( 126, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies( X
% 1.34/1.75 , Z ) ) ) ) ] )
% 1.34/1.75 .
% 1.34/1.75 clause( 133, [ theorem( implies( implies( X, not( X ) ), not( X ) ) ) ] )
% 1.34/1.75 .
% 1.34/1.75 clause( 168, [ =( implies( implies( X, not( Y ) ), Z ), or( and( X, Y ), Z
% 1.34/1.75 ) ) ] )
% 1.34/1.75 .
% 1.34/1.75 clause( 2527, [ theorem( or( and( X, X ), not( X ) ) ) ] )
% 1.34/1.75 .
% 1.34/1.75 clause( 2552, [ theorem( implies( X, and( X, X ) ) ) ] )
% 1.34/1.75 .
% 1.34/1.75 clause( 2556, [ ~( theorem( or( X, X ) ) ), theorem( and( X, X ) ) ] )
% 1.34/1.75 .
% 1.34/1.75 clause( 18854, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 1.34/1.75 .
% 1.34/1.75 clause( 18953, [ theorem( equivalent( X, X ) ) ] )
% 1.34/1.75 .
% 1.34/1.75 clause( 19075, [] )
% 1.34/1.75 .
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 % SZS output end Refutation
% 1.34/1.75 found a proof!
% 1.34/1.75
% 1.34/1.75 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 1.34/1.75
% 1.34/1.75 initialclauses(
% 1.34/1.75 [ clause( 19077, [ axiom( implies( or( X, X ), X ) ) ] )
% 1.34/1.75 , clause( 19078, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 1.34/1.75 , clause( 19079, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 1.34/1.75 , clause( 19080, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) )
% 1.34/1.75 ) ) ] )
% 1.34/1.75 , clause( 19081, [ axiom( implies( implies( X, Y ), implies( or( Z, X ), or(
% 1.34/1.75 Z, Y ) ) ) ) ] )
% 1.34/1.75 , clause( 19082, [ =( implies( X, Y ), or( not( X ), Y ) ) ] )
% 1.34/1.75 , clause( 19083, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.34/1.75 , clause( 19084, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~(
% 1.34/1.75 theorem( Y ) ) ] )
% 1.34/1.75 , clause( 19085, [ =( and( X, Y ), not( or( not( X ), not( Y ) ) ) ) ] )
% 1.34/1.75 , clause( 19086, [ =( equivalent( X, Y ), and( implies( X, Y ), implies( Y
% 1.34/1.75 , X ) ) ) ] )
% 1.34/1.75 , clause( 19087, [ ~( theorem( equivalent( and( p, q ), not( or( not( p ),
% 1.34/1.75 not( q ) ) ) ) ) ) ] )
% 1.34/1.75 ] ).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 subsumption(
% 1.34/1.75 clause( 0, [ axiom( implies( or( X, X ), X ) ) ] )
% 1.34/1.75 , clause( 19077, [ axiom( implies( or( X, X ), X ) ) ] )
% 1.34/1.75 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 subsumption(
% 1.34/1.75 clause( 1, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 1.34/1.75 , clause( 19078, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 1.34/1.75 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.34/1.75 )] ) ).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 subsumption(
% 1.34/1.75 clause( 2, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 1.34/1.75 , clause( 19079, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 1.34/1.75 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.34/1.75 )] ) ).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 subsumption(
% 1.34/1.75 clause( 3, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) ) ) ) ]
% 1.34/1.75 )
% 1.34/1.75 , clause( 19080, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) )
% 1.34/1.75 ) ) ] )
% 1.34/1.75 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 1.34/1.75 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 eqswap(
% 1.34/1.75 clause( 19088, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.34/1.75 , clause( 19082, [ =( implies( X, Y ), or( not( X ), Y ) ) ] )
% 1.34/1.75 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 subsumption(
% 1.34/1.75 clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.34/1.75 , clause( 19088, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.34/1.75 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.34/1.75 )] ) ).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 subsumption(
% 1.34/1.75 clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.34/1.75 , clause( 19083, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.34/1.75 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 1.34/1.75 1 )] ) ).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 subsumption(
% 1.34/1.75 clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y )
% 1.34/1.75 ) ] )
% 1.34/1.75 , clause( 19084, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~(
% 1.34/1.75 theorem( Y ) ) ] )
% 1.34/1.75 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.34/1.75 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 paramod(
% 1.34/1.75 clause( 19104, [ =( and( X, Y ), not( implies( X, not( Y ) ) ) ) ] )
% 1.34/1.75 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.34/1.75 , 0, clause( 19085, [ =( and( X, Y ), not( or( not( X ), not( Y ) ) ) ) ]
% 1.34/1.75 )
% 1.34/1.75 , 0, 5, substitution( 0, [ :=( X, X ), :=( Y, not( Y ) )] ), substitution(
% 1.34/1.75 1, [ :=( X, X ), :=( Y, Y )] )).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 eqswap(
% 1.34/1.75 clause( 19105, [ =( not( implies( X, not( Y ) ) ), and( X, Y ) ) ] )
% 1.34/1.75 , clause( 19104, [ =( and( X, Y ), not( implies( X, not( Y ) ) ) ) ] )
% 1.34/1.75 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 subsumption(
% 1.34/1.75 clause( 8, [ =( not( implies( X, not( Y ) ) ), and( X, Y ) ) ] )
% 1.34/1.75 , clause( 19105, [ =( not( implies( X, not( Y ) ) ), and( X, Y ) ) ] )
% 1.34/1.75 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.34/1.75 )] ) ).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 eqswap(
% 1.34/1.75 clause( 19108, [ =( and( implies( X, Y ), implies( Y, X ) ), equivalent( X
% 1.34/1.75 , Y ) ) ] )
% 1.34/1.75 , clause( 19086, [ =( equivalent( X, Y ), and( implies( X, Y ), implies( Y
% 1.34/1.75 , X ) ) ) ] )
% 1.34/1.75 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 subsumption(
% 1.34/1.75 clause( 9, [ =( and( implies( X, Y ), implies( Y, X ) ), equivalent( X, Y )
% 1.34/1.75 ) ] )
% 1.34/1.75 , clause( 19108, [ =( and( implies( X, Y ), implies( Y, X ) ), equivalent(
% 1.34/1.75 X, Y ) ) ] )
% 1.34/1.75 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.34/1.75 )] ) ).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 paramod(
% 1.34/1.75 clause( 19140, [ ~( theorem( equivalent( and( p, q ), not( implies( p, not(
% 1.34/1.75 q ) ) ) ) ) ) ] )
% 1.34/1.75 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.34/1.75 , 0, clause( 19087, [ ~( theorem( equivalent( and( p, q ), not( or( not( p
% 1.34/1.75 ), not( q ) ) ) ) ) ) ] )
% 1.34/1.75 , 0, 7, substitution( 0, [ :=( X, p ), :=( Y, not( q ) )] ), substitution(
% 1.34/1.75 1, [] )).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 paramod(
% 1.34/1.75 clause( 19141, [ ~( theorem( equivalent( and( p, q ), and( p, q ) ) ) ) ]
% 1.34/1.75 )
% 1.34/1.75 , clause( 8, [ =( not( implies( X, not( Y ) ) ), and( X, Y ) ) ] )
% 1.34/1.75 , 0, clause( 19140, [ ~( theorem( equivalent( and( p, q ), not( implies( p
% 1.34/1.75 , not( q ) ) ) ) ) ) ] )
% 1.34/1.75 , 0, 6, substitution( 0, [ :=( X, p ), :=( Y, q )] ), substitution( 1, [] )
% 1.34/1.75 ).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 subsumption(
% 1.34/1.75 clause( 10, [ ~( theorem( equivalent( and( p, q ), and( p, q ) ) ) ) ] )
% 1.34/1.75 , clause( 19141, [ ~( theorem( equivalent( and( p, q ), and( p, q ) ) ) ) ]
% 1.34/1.75 )
% 1.34/1.75 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 resolution(
% 1.34/1.75 clause( 19142, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 1.34/1.75 , clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.34/1.75 , 1, clause( 1, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 1.34/1.75 , 0, substitution( 0, [ :=( X, implies( X, or( Y, X ) ) )] ),
% 1.34/1.75 substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 subsumption(
% 1.34/1.75 clause( 11, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 1.34/1.75 , clause( 19142, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 1.34/1.75 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.34/1.75 )] ) ).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 resolution(
% 1.34/1.75 clause( 19143, [ theorem( implies( or( X, X ), X ) ) ] )
% 1.34/1.75 , clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.34/1.75 , 1, clause( 0, [ axiom( implies( or( X, X ), X ) ) ] )
% 1.34/1.75 , 0, substitution( 0, [ :=( X, implies( or( X, X ), X ) )] ),
% 1.34/1.75 substitution( 1, [ :=( X, X )] )).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 subsumption(
% 1.34/1.75 clause( 12, [ theorem( implies( or( X, X ), X ) ) ] )
% 1.34/1.75 , clause( 19143, [ theorem( implies( or( X, X ), X ) ) ] )
% 1.34/1.75 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 resolution(
% 1.34/1.75 clause( 19144, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 1.34/1.75 , clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y
% 1.34/1.75 ) ) ] )
% 1.34/1.75 , 1, clause( 12, [ theorem( implies( or( X, X ), X ) ) ] )
% 1.34/1.75 , 0, substitution( 0, [ :=( X, X ), :=( Y, or( X, X ) )] ), substitution( 1
% 1.34/1.75 , [ :=( X, X )] )).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 subsumption(
% 1.34/1.75 clause( 16, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 1.34/1.75 , clause( 19144, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 1.34/1.75 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 1.34/1.75 1 )] ) ).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 resolution(
% 1.34/1.75 clause( 19146, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X )
% 1.34/1.75 ) ) ] )
% 1.34/1.75 , clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y
% 1.34/1.75 ) ) ] )
% 1.34/1.75 , 1, clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.34/1.75 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [ :=( X
% 1.34/1.75 , implies( Y, X ) )] )).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 subsumption(
% 1.34/1.75 clause( 20, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X ) )
% 1.34/1.75 ) ] )
% 1.34/1.75 , clause( 19146, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X
% 1.34/1.75 ) ) ) ] )
% 1.34/1.75 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.34/1.75 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 resolution(
% 1.34/1.75 clause( 19150, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem(
% 1.34/1.75 or( Y, Y ) ) ) ] )
% 1.34/1.75 , clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y
% 1.34/1.75 ) ) ] )
% 1.34/1.75 , 2, clause( 16, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 1.34/1.75 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [ :=( X
% 1.34/1.75 , Y )] )).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 subsumption(
% 1.34/1.75 clause( 36, [ ~( theorem( or( X, X ) ) ), theorem( Y ), ~( theorem( implies(
% 1.34/1.75 X, Y ) ) ) ] )
% 1.34/1.75 , clause( 19150, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~(
% 1.34/1.75 theorem( or( Y, Y ) ) ) ] )
% 1.34/1.75 , substitution( 0, [ :=( X, Y ), :=( Y, X )] ), permutation( 0, [ ==>( 0, 1
% 1.34/1.75 ), ==>( 1, 2 ), ==>( 2, 0 )] ) ).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 resolution(
% 1.34/1.75 clause( 19151, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 1.34/1.75 , clause( 20, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X )
% 1.34/1.75 ) ) ] )
% 1.34/1.75 , 2, clause( 2, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 1.34/1.75 , 0, substitution( 0, [ :=( X, or( X, Y ) ), :=( Y, or( Y, X ) )] ),
% 1.34/1.75 substitution( 1, [ :=( X, Y ), :=( Y, X )] )).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 subsumption(
% 1.34/1.75 clause( 66, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 1.34/1.75 , clause( 19151, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 1.34/1.75 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.34/1.75 ), ==>( 1, 1 )] ) ).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 resolution(
% 1.34/1.75 clause( 19152, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y ) )
% 1.34/1.75 , X ) ) ) ] )
% 1.34/1.75 , clause( 20, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X )
% 1.34/1.75 ) ) ] )
% 1.34/1.75 , 1, clause( 11, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 1.34/1.75 , 0, substitution( 0, [ :=( X, X ), :=( Y, implies( Y, or( Z, Y ) ) )] ),
% 1.34/1.75 substitution( 1, [ :=( X, Y ), :=( Y, Z )] )).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 subsumption(
% 1.34/1.75 clause( 68, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y ) ), X
% 1.34/1.75 ) ) ) ] )
% 1.34/1.75 , clause( 19152, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y )
% 1.34/1.75 ), X ) ) ) ] )
% 1.34/1.75 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 1.34/1.75 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 paramod(
% 1.34/1.75 clause( 19158, [ axiom( implies( or( not( X ), or( Y, Z ) ), or( Y, implies(
% 1.34/1.75 X, Z ) ) ) ) ] )
% 1.34/1.75 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.34/1.75 , 0, clause( 3, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) )
% 1.34/1.75 ) ) ] )
% 1.34/1.75 , 0, 10, substitution( 0, [ :=( X, X ), :=( Y, Z )] ), substitution( 1, [
% 1.34/1.75 :=( X, not( X ) ), :=( Y, Y ), :=( Z, Z )] )).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 paramod(
% 1.34/1.75 clause( 19161, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies(
% 1.34/1.75 X, Z ) ) ) ) ] )
% 1.34/1.75 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.34/1.75 , 0, clause( 19158, [ axiom( implies( or( not( X ), or( Y, Z ) ), or( Y,
% 1.34/1.75 implies( X, Z ) ) ) ) ] )
% 1.34/1.75 , 0, 2, substitution( 0, [ :=( X, X ), :=( Y, or( Y, Z ) )] ),
% 1.34/1.75 substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 subsumption(
% 1.34/1.75 clause( 126, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies( X
% 1.34/1.75 , Z ) ) ) ) ] )
% 1.34/1.75 , clause( 19161, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies(
% 1.34/1.75 X, Z ) ) ) ) ] )
% 1.34/1.75 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 1.34/1.75 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 paramod(
% 1.34/1.75 clause( 19163, [ theorem( implies( implies( X, not( X ) ), not( X ) ) ) ]
% 1.34/1.75 )
% 1.34/1.75 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.34/1.75 , 0, clause( 12, [ theorem( implies( or( X, X ), X ) ) ] )
% 1.34/1.75 , 0, 2, substitution( 0, [ :=( X, X ), :=( Y, not( X ) )] ), substitution(
% 1.34/1.75 1, [ :=( X, not( X ) )] )).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 subsumption(
% 1.34/1.75 clause( 133, [ theorem( implies( implies( X, not( X ) ), not( X ) ) ) ] )
% 1.34/1.75 , clause( 19163, [ theorem( implies( implies( X, not( X ) ), not( X ) ) ) ]
% 1.34/1.75 )
% 1.34/1.75 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 eqswap(
% 1.34/1.75 clause( 19165, [ =( implies( X, Y ), or( not( X ), Y ) ) ] )
% 1.34/1.75 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.34/1.75 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 paramod(
% 1.34/1.75 clause( 19166, [ =( implies( implies( X, not( Y ) ), Z ), or( and( X, Y ),
% 1.34/1.75 Z ) ) ] )
% 1.34/1.75 , clause( 8, [ =( not( implies( X, not( Y ) ) ), and( X, Y ) ) ] )
% 1.34/1.75 , 0, clause( 19165, [ =( implies( X, Y ), or( not( X ), Y ) ) ] )
% 1.34/1.75 , 0, 8, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [
% 1.34/1.75 :=( X, implies( X, not( Y ) ) ), :=( Y, Z )] )).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 subsumption(
% 1.34/1.75 clause( 168, [ =( implies( implies( X, not( Y ) ), Z ), or( and( X, Y ), Z
% 1.34/1.75 ) ) ] )
% 1.34/1.75 , clause( 19166, [ =( implies( implies( X, not( Y ) ), Z ), or( and( X, Y )
% 1.34/1.75 , Z ) ) ] )
% 1.34/1.75 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 1.34/1.75 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 paramod(
% 1.34/1.75 clause( 19169, [ theorem( or( and( X, X ), not( X ) ) ) ] )
% 1.34/1.75 , clause( 168, [ =( implies( implies( X, not( Y ) ), Z ), or( and( X, Y ),
% 1.34/1.75 Z ) ) ] )
% 1.34/1.75 , 0, clause( 133, [ theorem( implies( implies( X, not( X ) ), not( X ) ) )
% 1.34/1.75 ] )
% 1.34/1.75 , 0, 1, substitution( 0, [ :=( X, X ), :=( Y, X ), :=( Z, not( X ) )] ),
% 1.34/1.75 substitution( 1, [ :=( X, X )] )).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 subsumption(
% 1.34/1.75 clause( 2527, [ theorem( or( and( X, X ), not( X ) ) ) ] )
% 1.34/1.75 , clause( 19169, [ theorem( or( and( X, X ), not( X ) ) ) ] )
% 1.34/1.75 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 resolution(
% 1.34/1.75 clause( 19171, [ theorem( or( not( X ), and( X, X ) ) ) ] )
% 1.34/1.75 , clause( 66, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 1.34/1.75 , 1, clause( 2527, [ theorem( or( and( X, X ), not( X ) ) ) ] )
% 1.34/1.75 , 0, substitution( 0, [ :=( X, not( X ) ), :=( Y, and( X, X ) )] ),
% 1.34/1.75 substitution( 1, [ :=( X, X )] )).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 paramod(
% 1.34/1.75 clause( 19172, [ theorem( implies( X, and( X, X ) ) ) ] )
% 1.34/1.75 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.34/1.75 , 0, clause( 19171, [ theorem( or( not( X ), and( X, X ) ) ) ] )
% 1.34/1.75 , 0, 1, substitution( 0, [ :=( X, X ), :=( Y, and( X, X ) )] ),
% 1.34/1.75 substitution( 1, [ :=( X, X )] )).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 subsumption(
% 1.34/1.75 clause( 2552, [ theorem( implies( X, and( X, X ) ) ) ] )
% 1.34/1.75 , clause( 19172, [ theorem( implies( X, and( X, X ) ) ) ] )
% 1.34/1.75 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 resolution(
% 1.34/1.75 clause( 19173, [ ~( theorem( or( X, X ) ) ), theorem( and( X, X ) ) ] )
% 1.34/1.75 , clause( 36, [ ~( theorem( or( X, X ) ) ), theorem( Y ), ~( theorem(
% 1.34/1.75 implies( X, Y ) ) ) ] )
% 1.34/1.75 , 2, clause( 2552, [ theorem( implies( X, and( X, X ) ) ) ] )
% 1.34/1.75 , 0, substitution( 0, [ :=( X, X ), :=( Y, and( X, X ) )] ), substitution(
% 1.34/1.75 1, [ :=( X, X )] )).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 subsumption(
% 1.34/1.75 clause( 2556, [ ~( theorem( or( X, X ) ) ), theorem( and( X, X ) ) ] )
% 1.34/1.75 , clause( 19173, [ ~( theorem( or( X, X ) ) ), theorem( and( X, X ) ) ] )
% 1.34/1.75 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 1.34/1.75 1 )] ) ).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 resolution(
% 1.34/1.75 clause( 19174, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 1.34/1.75 , clause( 68, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y ) ),
% 1.34/1.75 X ) ) ) ] )
% 1.34/1.75 , 1, clause( 126, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y,
% 1.34/1.75 implies( X, Z ) ) ) ) ] )
% 1.34/1.75 , 0, substitution( 0, [ :=( X, or( X, implies( Y, Y ) ) ), :=( Y, Y ), :=(
% 1.34/1.75 Z, X )] ), substitution( 1, [ :=( X, Y ), :=( Y, X ), :=( Z, Y )] )).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 subsumption(
% 1.34/1.75 clause( 18854, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 1.34/1.75 , clause( 19174, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 1.34/1.75 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.34/1.75 )] ) ).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 resolution(
% 1.34/1.75 clause( 19176, [ theorem( and( implies( X, X ), implies( X, X ) ) ) ] )
% 1.34/1.75 , clause( 2556, [ ~( theorem( or( X, X ) ) ), theorem( and( X, X ) ) ] )
% 1.34/1.75 , 0, clause( 18854, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 1.34/1.75 , 0, substitution( 0, [ :=( X, implies( X, X ) )] ), substitution( 1, [
% 1.34/1.75 :=( X, implies( X, X ) ), :=( Y, X )] )).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 paramod(
% 1.34/1.75 clause( 19177, [ theorem( equivalent( X, X ) ) ] )
% 1.34/1.75 , clause( 9, [ =( and( implies( X, Y ), implies( Y, X ) ), equivalent( X, Y
% 1.34/1.75 ) ) ] )
% 1.34/1.75 , 0, clause( 19176, [ theorem( and( implies( X, X ), implies( X, X ) ) ) ]
% 1.34/1.75 )
% 1.34/1.75 , 0, 1, substitution( 0, [ :=( X, X ), :=( Y, X )] ), substitution( 1, [
% 1.34/1.75 :=( X, X )] )).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 subsumption(
% 1.34/1.75 clause( 18953, [ theorem( equivalent( X, X ) ) ] )
% 1.34/1.75 , clause( 19177, [ theorem( equivalent( X, X ) ) ] )
% 1.34/1.75 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 resolution(
% 1.34/1.75 clause( 19178, [] )
% 1.34/1.75 , clause( 10, [ ~( theorem( equivalent( and( p, q ), and( p, q ) ) ) ) ] )
% 1.34/1.75 , 0, clause( 18953, [ theorem( equivalent( X, X ) ) ] )
% 1.34/1.75 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, and( p, q ) )] )).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 subsumption(
% 1.34/1.75 clause( 19075, [] )
% 1.34/1.75 , clause( 19178, [] )
% 1.34/1.75 , substitution( 0, [] ), permutation( 0, [] ) ).
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 end.
% 1.34/1.75
% 1.34/1.75 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 1.34/1.75
% 1.34/1.75 Memory use:
% 1.34/1.75
% 1.34/1.75 space for terms: 297647
% 1.34/1.75 space for clauses: 857599
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 clauses generated: 44304
% 1.34/1.75 clauses kept: 19076
% 1.34/1.75 clauses selected: 438
% 1.34/1.75 clauses deleted: 24
% 1.34/1.75 clauses inuse deleted: 4
% 1.34/1.75
% 1.34/1.75 subsentry: 439488
% 1.34/1.75 literals s-matched: 232816
% 1.34/1.75 literals matched: 218235
% 1.34/1.75 full subsumption: 92746
% 1.34/1.75
% 1.34/1.75 checksum: -1224053206
% 1.34/1.75
% 1.34/1.75
% 1.34/1.75 Bliksem ended
%------------------------------------------------------------------------------