TSTP Solution File: LCL268-3 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL268-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n010.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:23 EDT 2022
% Result : Unsatisfiable 1.77s 2.14s
% Output : Refutation 1.77s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : LCL268-3 : TPTP v8.1.0. Released v2.3.0.
% 0.10/0.12 % Command : bliksem %s
% 0.11/0.33 % Computer : n010.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % DateTime : Sun Jul 3 21:10:33 EDT 2022
% 0.11/0.33 % CPUTime :
% 1.77/2.14 *** allocated 10000 integers for termspace/termends
% 1.77/2.14 *** allocated 10000 integers for clauses
% 1.77/2.14 *** allocated 10000 integers for justifications
% 1.77/2.14 Bliksem 1.12
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 Automatic Strategy Selection
% 1.77/2.14
% 1.77/2.14 Clauses:
% 1.77/2.14 [
% 1.77/2.14 [ axiom( implies( or( X, X ), X ) ) ],
% 1.77/2.14 [ axiom( implies( X, or( Y, X ) ) ) ],
% 1.77/2.14 [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ],
% 1.77/2.14 [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) ) ) ) ],
% 1.77/2.14 [ axiom( implies( implies( X, Y ), implies( or( Z, X ), or( Z, Y ) ) ) )
% 1.77/2.14 ],
% 1.77/2.14 [ =( implies( X, Y ), or( not( X ), Y ) ) ],
% 1.77/2.14 [ theorem( X ), ~( axiom( X ) ) ],
% 1.77/2.14 [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y ) ) ]
% 1.77/2.14 ,
% 1.77/2.14 [ =( and( X, Y ), not( or( not( X ), not( Y ) ) ) ) ],
% 1.77/2.14 [ =( equivalent( X, Y ), and( implies( X, Y ), implies( Y, X ) ) ) ]
% 1.77/2.14 ,
% 1.77/2.14 [ ~( theorem( equivalent( p, p ) ) ) ]
% 1.77/2.14 ] .
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 percentage equality = 0.214286, percentage horn = 1.000000
% 1.77/2.14 This is a problem with some equality
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 Options Used:
% 1.77/2.14
% 1.77/2.14 useres = 1
% 1.77/2.14 useparamod = 1
% 1.77/2.14 useeqrefl = 1
% 1.77/2.14 useeqfact = 1
% 1.77/2.14 usefactor = 1
% 1.77/2.14 usesimpsplitting = 0
% 1.77/2.14 usesimpdemod = 5
% 1.77/2.14 usesimpres = 3
% 1.77/2.14
% 1.77/2.14 resimpinuse = 1000
% 1.77/2.14 resimpclauses = 20000
% 1.77/2.14 substype = eqrewr
% 1.77/2.14 backwardsubs = 1
% 1.77/2.14 selectoldest = 5
% 1.77/2.14
% 1.77/2.14 litorderings [0] = split
% 1.77/2.14 litorderings [1] = extend the termordering, first sorting on arguments
% 1.77/2.14
% 1.77/2.14 termordering = kbo
% 1.77/2.14
% 1.77/2.14 litapriori = 0
% 1.77/2.14 termapriori = 1
% 1.77/2.14 litaposteriori = 0
% 1.77/2.14 termaposteriori = 0
% 1.77/2.14 demodaposteriori = 0
% 1.77/2.14 ordereqreflfact = 0
% 1.77/2.14
% 1.77/2.14 litselect = negord
% 1.77/2.14
% 1.77/2.14 maxweight = 15
% 1.77/2.14 maxdepth = 30000
% 1.77/2.14 maxlength = 115
% 1.77/2.14 maxnrvars = 195
% 1.77/2.14 excuselevel = 1
% 1.77/2.14 increasemaxweight = 1
% 1.77/2.14
% 1.77/2.14 maxselected = 10000000
% 1.77/2.14 maxnrclauses = 10000000
% 1.77/2.14
% 1.77/2.14 showgenerated = 0
% 1.77/2.14 showkept = 0
% 1.77/2.14 showselected = 0
% 1.77/2.14 showdeleted = 0
% 1.77/2.14 showresimp = 1
% 1.77/2.14 showstatus = 2000
% 1.77/2.14
% 1.77/2.14 prologoutput = 1
% 1.77/2.14 nrgoals = 5000000
% 1.77/2.14 totalproof = 1
% 1.77/2.14
% 1.77/2.14 Symbols occurring in the translation:
% 1.77/2.14
% 1.77/2.14 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 1.77/2.14 . [1, 2] (w:1, o:25, a:1, s:1, b:0),
% 1.77/2.14 ! [4, 1] (w:0, o:17, a:1, s:1, b:0),
% 1.77/2.14 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.77/2.14 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.77/2.14 or [40, 2] (w:1, o:50, a:1, s:1, b:0),
% 1.77/2.14 implies [41, 2] (w:1, o:51, a:1, s:1, b:0),
% 1.77/2.14 axiom [42, 1] (w:1, o:22, a:1, s:1, b:0),
% 1.77/2.14 not [47, 1] (w:1, o:23, a:1, s:1, b:0),
% 1.77/2.14 theorem [48, 1] (w:1, o:24, a:1, s:1, b:0),
% 1.77/2.14 and [51, 2] (w:1, o:52, a:1, s:1, b:0),
% 1.77/2.14 equivalent [52, 2] (w:1, o:53, a:1, s:1, b:0),
% 1.77/2.14 p [53, 0] (w:1, o:16, a:1, s:1, b:0).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 Starting Search:
% 1.77/2.14
% 1.77/2.14 Resimplifying inuse:
% 1.77/2.14 Done
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 Intermediate Status:
% 1.77/2.14 Generated: 3530
% 1.77/2.14 Kept: 2001
% 1.77/2.14 Inuse: 107
% 1.77/2.14 Deleted: 5
% 1.77/2.14 Deletedinuse: 2
% 1.77/2.14
% 1.77/2.14 Resimplifying inuse:
% 1.77/2.14 Done
% 1.77/2.14
% 1.77/2.14 Resimplifying inuse:
% 1.77/2.14 Done
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 Intermediate Status:
% 1.77/2.14 Generated: 7525
% 1.77/2.14 Kept: 4025
% 1.77/2.14 Inuse: 174
% 1.77/2.14 Deleted: 6
% 1.77/2.14 Deletedinuse: 2
% 1.77/2.14
% 1.77/2.14 Resimplifying inuse:
% 1.77/2.14 Done
% 1.77/2.14
% 1.77/2.14 Resimplifying inuse:
% 1.77/2.14 Done
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 Intermediate Status:
% 1.77/2.14 Generated: 12122
% 1.77/2.14 Kept: 6105
% 1.77/2.14 Inuse: 222
% 1.77/2.14 Deleted: 6
% 1.77/2.14 Deletedinuse: 2
% 1.77/2.14
% 1.77/2.14 Resimplifying inuse:
% 1.77/2.14 Done
% 1.77/2.14
% 1.77/2.14 Resimplifying inuse:
% 1.77/2.14 Done
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 Intermediate Status:
% 1.77/2.14 Generated: 16323
% 1.77/2.14 Kept: 8148
% 1.77/2.14 Inuse: 252
% 1.77/2.14 Deleted: 6
% 1.77/2.14 Deletedinuse: 2
% 1.77/2.14
% 1.77/2.14 Resimplifying inuse:
% 1.77/2.14 Done
% 1.77/2.14
% 1.77/2.14 Resimplifying inuse:
% 1.77/2.14 Done
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 Intermediate Status:
% 1.77/2.14 Generated: 21684
% 1.77/2.14 Kept: 10263
% 1.77/2.14 Inuse: 297
% 1.77/2.14 Deleted: 7
% 1.77/2.14 Deletedinuse: 2
% 1.77/2.14
% 1.77/2.14 Resimplifying inuse:
% 1.77/2.14 Done
% 1.77/2.14
% 1.77/2.14 Resimplifying inuse:
% 1.77/2.14 Done
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 Intermediate Status:
% 1.77/2.14 Generated: 26719
% 1.77/2.14 Kept: 12290
% 1.77/2.14 Inuse: 335
% 1.77/2.14 Deleted: 11
% 1.77/2.14 Deletedinuse: 2
% 1.77/2.14
% 1.77/2.14 Resimplifying inuse:
% 1.77/2.14 Done
% 1.77/2.14
% 1.77/2.14 Resimplifying inuse:
% 1.77/2.14 Done
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 Intermediate Status:
% 1.77/2.14 Generated: 31161
% 1.77/2.14 Kept: 14317
% 1.77/2.14 Inuse: 364
% 1.77/2.14 Deleted: 11
% 1.77/2.14 Deletedinuse: 2
% 1.77/2.14
% 1.77/2.14 Resimplifying inuse:
% 1.77/2.14 Done
% 1.77/2.14
% 1.77/2.14 Resimplifying inuse:
% 1.77/2.14 Done
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 Intermediate Status:
% 1.77/2.14 Generated: 37051
% 1.77/2.14 Kept: 16397
% 1.77/2.14 Inuse: 414
% 1.77/2.14 Deleted: 11
% 1.77/2.14 Deletedinuse: 2
% 1.77/2.14
% 1.77/2.14 Resimplifying inuse:
% 1.77/2.14 Done
% 1.77/2.14
% 1.77/2.14 Resimplifying inuse:
% 1.77/2.14 Done
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 Intermediate Status:
% 1.77/2.14 Generated: 43593
% 1.77/2.14 Kept: 18491
% 1.77/2.14 Inuse: 463
% 1.77/2.14 Deleted: 11
% 1.77/2.14 Deletedinuse: 2
% 1.77/2.14
% 1.77/2.14 Resimplifying inuse:
% 1.77/2.14 Done
% 1.77/2.14
% 1.77/2.14 Resimplifying inuse:
% 1.77/2.14 Done
% 1.77/2.14
% 1.77/2.14 Resimplifying clauses:
% 1.77/2.14 Done
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 Intermediate Status:
% 1.77/2.14 Generated: 48245
% 1.77/2.14 Kept: 20544
% 1.77/2.14 Inuse: 495
% 1.77/2.14 Deleted: 140
% 1.77/2.14 Deletedinuse: 2
% 1.77/2.14
% 1.77/2.14 Resimplifying inuse:
% 1.77/2.14 Done
% 1.77/2.14
% 1.77/2.14 Resimplifying inuse:
% 1.77/2.14 Done
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 Intermediate Status:
% 1.77/2.14 Generated: 54998
% 1.77/2.14 Kept: 22660
% 1.77/2.14 Inuse: 527
% 1.77/2.14 Deleted: 140
% 1.77/2.14 Deletedinuse: 2
% 1.77/2.14
% 1.77/2.14 Resimplifying inuse:
% 1.77/2.14 Done
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 Bliksems!, er is een bewijs:
% 1.77/2.14 % SZS status Unsatisfiable
% 1.77/2.14 % SZS output start Refutation
% 1.77/2.14
% 1.77/2.14 clause( 0, [ axiom( implies( or( X, X ), X ) ) ] )
% 1.77/2.14 .
% 1.77/2.14 clause( 1, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 1.77/2.14 .
% 1.77/2.14 clause( 2, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 1.77/2.14 .
% 1.77/2.14 clause( 3, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) ) ) ) ]
% 1.77/2.14 )
% 1.77/2.14 .
% 1.77/2.14 clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.77/2.14 .
% 1.77/2.14 clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.77/2.14 .
% 1.77/2.14 clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y )
% 1.77/2.14 ) ] )
% 1.77/2.14 .
% 1.77/2.14 clause( 8, [ =( not( implies( X, not( Y ) ) ), and( X, Y ) ) ] )
% 1.77/2.14 .
% 1.77/2.14 clause( 9, [ =( and( implies( X, Y ), implies( Y, X ) ), equivalent( X, Y )
% 1.77/2.14 ) ] )
% 1.77/2.14 .
% 1.77/2.14 clause( 10, [ ~( theorem( equivalent( p, p ) ) ) ] )
% 1.77/2.14 .
% 1.77/2.14 clause( 12, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 1.77/2.14 .
% 1.77/2.14 clause( 13, [ theorem( implies( or( X, X ), X ) ) ] )
% 1.77/2.14 .
% 1.77/2.14 clause( 16, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 1.77/2.14 .
% 1.77/2.14 clause( 21, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X ) )
% 1.77/2.14 ) ] )
% 1.77/2.14 .
% 1.77/2.14 clause( 64, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 1.77/2.14 .
% 1.77/2.14 clause( 72, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y ) ), X
% 1.77/2.14 ) ) ) ] )
% 1.77/2.14 .
% 1.77/2.14 clause( 151, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies( X
% 1.77/2.14 , Z ) ) ) ) ] )
% 1.77/2.14 .
% 1.77/2.14 clause( 163, [ theorem( implies( implies( X, not( X ) ), not( X ) ) ) ] )
% 1.77/2.14 .
% 1.77/2.14 clause( 201, [ =( implies( implies( X, not( Y ) ), Z ), or( and( X, Y ), Z
% 1.77/2.14 ) ) ] )
% 1.77/2.14 .
% 1.77/2.14 clause( 2842, [ theorem( or( and( X, X ), not( X ) ) ) ] )
% 1.77/2.14 .
% 1.77/2.14 clause( 2870, [ theorem( implies( X, and( X, X ) ) ) ] )
% 1.77/2.14 .
% 1.77/2.14 clause( 2915, [ theorem( and( X, X ) ), ~( theorem( X ) ) ] )
% 1.77/2.14 .
% 1.77/2.14 clause( 3056, [ theorem( equivalent( X, X ) ), ~( theorem( implies( X, X )
% 1.77/2.14 ) ) ] )
% 1.77/2.14 .
% 1.77/2.14 clause( 3444, [ ~( theorem( implies( p, p ) ) ) ] )
% 1.77/2.14 .
% 1.77/2.14 clause( 3468, [ ~( theorem( or( implies( p, p ), implies( p, p ) ) ) ) ] )
% 1.77/2.14 .
% 1.77/2.14 clause( 23226, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 1.77/2.14 .
% 1.77/2.14 clause( 23336, [] )
% 1.77/2.14 .
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 % SZS output end Refutation
% 1.77/2.14 found a proof!
% 1.77/2.14
% 1.77/2.14 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 1.77/2.14
% 1.77/2.14 initialclauses(
% 1.77/2.14 [ clause( 23338, [ axiom( implies( or( X, X ), X ) ) ] )
% 1.77/2.14 , clause( 23339, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 1.77/2.14 , clause( 23340, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 1.77/2.14 , clause( 23341, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) )
% 1.77/2.14 ) ) ] )
% 1.77/2.14 , clause( 23342, [ axiom( implies( implies( X, Y ), implies( or( Z, X ), or(
% 1.77/2.14 Z, Y ) ) ) ) ] )
% 1.77/2.14 , clause( 23343, [ =( implies( X, Y ), or( not( X ), Y ) ) ] )
% 1.77/2.14 , clause( 23344, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.77/2.14 , clause( 23345, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~(
% 1.77/2.14 theorem( Y ) ) ] )
% 1.77/2.14 , clause( 23346, [ =( and( X, Y ), not( or( not( X ), not( Y ) ) ) ) ] )
% 1.77/2.14 , clause( 23347, [ =( equivalent( X, Y ), and( implies( X, Y ), implies( Y
% 1.77/2.14 , X ) ) ) ] )
% 1.77/2.14 , clause( 23348, [ ~( theorem( equivalent( p, p ) ) ) ] )
% 1.77/2.14 ] ).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 subsumption(
% 1.77/2.14 clause( 0, [ axiom( implies( or( X, X ), X ) ) ] )
% 1.77/2.14 , clause( 23338, [ axiom( implies( or( X, X ), X ) ) ] )
% 1.77/2.14 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 subsumption(
% 1.77/2.14 clause( 1, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 1.77/2.14 , clause( 23339, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 1.77/2.14 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.77/2.14 )] ) ).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 subsumption(
% 1.77/2.14 clause( 2, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 1.77/2.14 , clause( 23340, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 1.77/2.14 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.77/2.14 )] ) ).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 subsumption(
% 1.77/2.14 clause( 3, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) ) ) ) ]
% 1.77/2.14 )
% 1.77/2.14 , clause( 23341, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) )
% 1.77/2.14 ) ) ] )
% 1.77/2.14 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 1.77/2.14 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 eqswap(
% 1.77/2.14 clause( 23349, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.77/2.14 , clause( 23343, [ =( implies( X, Y ), or( not( X ), Y ) ) ] )
% 1.77/2.14 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 subsumption(
% 1.77/2.14 clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.77/2.14 , clause( 23349, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.77/2.14 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.77/2.14 )] ) ).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 subsumption(
% 1.77/2.14 clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.77/2.14 , clause( 23344, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.77/2.14 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 1.77/2.14 1 )] ) ).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 subsumption(
% 1.77/2.14 clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y )
% 1.77/2.14 ) ] )
% 1.77/2.14 , clause( 23345, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~(
% 1.77/2.14 theorem( Y ) ) ] )
% 1.77/2.14 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.77/2.14 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 paramod(
% 1.77/2.14 clause( 23365, [ =( and( X, Y ), not( implies( X, not( Y ) ) ) ) ] )
% 1.77/2.14 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.77/2.14 , 0, clause( 23346, [ =( and( X, Y ), not( or( not( X ), not( Y ) ) ) ) ]
% 1.77/2.14 )
% 1.77/2.14 , 0, 5, substitution( 0, [ :=( X, X ), :=( Y, not( Y ) )] ), substitution(
% 1.77/2.14 1, [ :=( X, X ), :=( Y, Y )] )).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 eqswap(
% 1.77/2.14 clause( 23366, [ =( not( implies( X, not( Y ) ) ), and( X, Y ) ) ] )
% 1.77/2.14 , clause( 23365, [ =( and( X, Y ), not( implies( X, not( Y ) ) ) ) ] )
% 1.77/2.14 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 subsumption(
% 1.77/2.14 clause( 8, [ =( not( implies( X, not( Y ) ) ), and( X, Y ) ) ] )
% 1.77/2.14 , clause( 23366, [ =( not( implies( X, not( Y ) ) ), and( X, Y ) ) ] )
% 1.77/2.14 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.77/2.14 )] ) ).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 eqswap(
% 1.77/2.14 clause( 23369, [ =( and( implies( X, Y ), implies( Y, X ) ), equivalent( X
% 1.77/2.14 , Y ) ) ] )
% 1.77/2.14 , clause( 23347, [ =( equivalent( X, Y ), and( implies( X, Y ), implies( Y
% 1.77/2.14 , X ) ) ) ] )
% 1.77/2.14 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 subsumption(
% 1.77/2.14 clause( 9, [ =( and( implies( X, Y ), implies( Y, X ) ), equivalent( X, Y )
% 1.77/2.14 ) ] )
% 1.77/2.14 , clause( 23369, [ =( and( implies( X, Y ), implies( Y, X ) ), equivalent(
% 1.77/2.14 X, Y ) ) ] )
% 1.77/2.14 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.77/2.14 )] ) ).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 subsumption(
% 1.77/2.14 clause( 10, [ ~( theorem( equivalent( p, p ) ) ) ] )
% 1.77/2.14 , clause( 23348, [ ~( theorem( equivalent( p, p ) ) ) ] )
% 1.77/2.14 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 resolution(
% 1.77/2.14 clause( 23373, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 1.77/2.14 , clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.77/2.14 , 1, clause( 1, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 1.77/2.14 , 0, substitution( 0, [ :=( X, implies( X, or( Y, X ) ) )] ),
% 1.77/2.14 substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 subsumption(
% 1.77/2.14 clause( 12, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 1.77/2.14 , clause( 23373, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 1.77/2.14 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.77/2.14 )] ) ).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 resolution(
% 1.77/2.14 clause( 23374, [ theorem( implies( or( X, X ), X ) ) ] )
% 1.77/2.14 , clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.77/2.14 , 1, clause( 0, [ axiom( implies( or( X, X ), X ) ) ] )
% 1.77/2.14 , 0, substitution( 0, [ :=( X, implies( or( X, X ), X ) )] ),
% 1.77/2.14 substitution( 1, [ :=( X, X )] )).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 subsumption(
% 1.77/2.14 clause( 13, [ theorem( implies( or( X, X ), X ) ) ] )
% 1.77/2.14 , clause( 23374, [ theorem( implies( or( X, X ), X ) ) ] )
% 1.77/2.14 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 resolution(
% 1.77/2.14 clause( 23375, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 1.77/2.14 , clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y
% 1.77/2.14 ) ) ] )
% 1.77/2.14 , 1, clause( 13, [ theorem( implies( or( X, X ), X ) ) ] )
% 1.77/2.14 , 0, substitution( 0, [ :=( X, X ), :=( Y, or( X, X ) )] ), substitution( 1
% 1.77/2.14 , [ :=( X, X )] )).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 subsumption(
% 1.77/2.14 clause( 16, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 1.77/2.14 , clause( 23375, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 1.77/2.14 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 1.77/2.14 1 )] ) ).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 resolution(
% 1.77/2.14 clause( 23377, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X )
% 1.77/2.14 ) ) ] )
% 1.77/2.14 , clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y
% 1.77/2.14 ) ) ] )
% 1.77/2.14 , 1, clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.77/2.14 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [ :=( X
% 1.77/2.14 , implies( Y, X ) )] )).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 subsumption(
% 1.77/2.14 clause( 21, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X ) )
% 1.77/2.14 ) ] )
% 1.77/2.14 , clause( 23377, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X
% 1.77/2.14 ) ) ) ] )
% 1.77/2.14 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.77/2.14 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 resolution(
% 1.77/2.14 clause( 23379, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 1.77/2.14 , clause( 21, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X )
% 1.77/2.14 ) ) ] )
% 1.77/2.14 , 2, clause( 2, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 1.77/2.14 , 0, substitution( 0, [ :=( X, or( X, Y ) ), :=( Y, or( Y, X ) )] ),
% 1.77/2.14 substitution( 1, [ :=( X, Y ), :=( Y, X )] )).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 subsumption(
% 1.77/2.14 clause( 64, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 1.77/2.14 , clause( 23379, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 1.77/2.14 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.77/2.14 ), ==>( 1, 1 )] ) ).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 resolution(
% 1.77/2.14 clause( 23380, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y ) )
% 1.77/2.14 , X ) ) ) ] )
% 1.77/2.14 , clause( 21, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X )
% 1.77/2.14 ) ) ] )
% 1.77/2.14 , 1, clause( 12, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 1.77/2.14 , 0, substitution( 0, [ :=( X, X ), :=( Y, implies( Y, or( Z, Y ) ) )] ),
% 1.77/2.14 substitution( 1, [ :=( X, Y ), :=( Y, Z )] )).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 subsumption(
% 1.77/2.14 clause( 72, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y ) ), X
% 1.77/2.14 ) ) ) ] )
% 1.77/2.14 , clause( 23380, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y )
% 1.77/2.14 ), X ) ) ) ] )
% 1.77/2.14 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 1.77/2.14 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 paramod(
% 1.77/2.14 clause( 23386, [ axiom( implies( or( not( X ), or( Y, Z ) ), or( Y, implies(
% 1.77/2.14 X, Z ) ) ) ) ] )
% 1.77/2.14 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.77/2.14 , 0, clause( 3, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) )
% 1.77/2.14 ) ) ] )
% 1.77/2.14 , 0, 10, substitution( 0, [ :=( X, X ), :=( Y, Z )] ), substitution( 1, [
% 1.77/2.14 :=( X, not( X ) ), :=( Y, Y ), :=( Z, Z )] )).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 paramod(
% 1.77/2.14 clause( 23389, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies(
% 1.77/2.14 X, Z ) ) ) ) ] )
% 1.77/2.14 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.77/2.14 , 0, clause( 23386, [ axiom( implies( or( not( X ), or( Y, Z ) ), or( Y,
% 1.77/2.14 implies( X, Z ) ) ) ) ] )
% 1.77/2.14 , 0, 2, substitution( 0, [ :=( X, X ), :=( Y, or( Y, Z ) )] ),
% 1.77/2.14 substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 subsumption(
% 1.77/2.14 clause( 151, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies( X
% 1.77/2.14 , Z ) ) ) ) ] )
% 1.77/2.14 , clause( 23389, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies(
% 1.77/2.14 X, Z ) ) ) ) ] )
% 1.77/2.14 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 1.77/2.14 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 paramod(
% 1.77/2.14 clause( 23391, [ theorem( implies( implies( X, not( X ) ), not( X ) ) ) ]
% 1.77/2.14 )
% 1.77/2.14 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.77/2.14 , 0, clause( 13, [ theorem( implies( or( X, X ), X ) ) ] )
% 1.77/2.14 , 0, 2, substitution( 0, [ :=( X, X ), :=( Y, not( X ) )] ), substitution(
% 1.77/2.14 1, [ :=( X, not( X ) )] )).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 subsumption(
% 1.77/2.14 clause( 163, [ theorem( implies( implies( X, not( X ) ), not( X ) ) ) ] )
% 1.77/2.14 , clause( 23391, [ theorem( implies( implies( X, not( X ) ), not( X ) ) ) ]
% 1.77/2.14 )
% 1.77/2.14 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 eqswap(
% 1.77/2.14 clause( 23393, [ =( implies( X, Y ), or( not( X ), Y ) ) ] )
% 1.77/2.14 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.77/2.14 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 paramod(
% 1.77/2.14 clause( 23394, [ =( implies( implies( X, not( Y ) ), Z ), or( and( X, Y ),
% 1.77/2.14 Z ) ) ] )
% 1.77/2.14 , clause( 8, [ =( not( implies( X, not( Y ) ) ), and( X, Y ) ) ] )
% 1.77/2.14 , 0, clause( 23393, [ =( implies( X, Y ), or( not( X ), Y ) ) ] )
% 1.77/2.14 , 0, 8, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [
% 1.77/2.14 :=( X, implies( X, not( Y ) ) ), :=( Y, Z )] )).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 subsumption(
% 1.77/2.14 clause( 201, [ =( implies( implies( X, not( Y ) ), Z ), or( and( X, Y ), Z
% 1.77/2.14 ) ) ] )
% 1.77/2.14 , clause( 23394, [ =( implies( implies( X, not( Y ) ), Z ), or( and( X, Y )
% 1.77/2.14 , Z ) ) ] )
% 1.77/2.14 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 1.77/2.14 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 paramod(
% 1.77/2.14 clause( 23397, [ theorem( or( and( X, X ), not( X ) ) ) ] )
% 1.77/2.14 , clause( 201, [ =( implies( implies( X, not( Y ) ), Z ), or( and( X, Y ),
% 1.77/2.14 Z ) ) ] )
% 1.77/2.14 , 0, clause( 163, [ theorem( implies( implies( X, not( X ) ), not( X ) ) )
% 1.77/2.14 ] )
% 1.77/2.14 , 0, 1, substitution( 0, [ :=( X, X ), :=( Y, X ), :=( Z, not( X ) )] ),
% 1.77/2.14 substitution( 1, [ :=( X, X )] )).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 subsumption(
% 1.77/2.14 clause( 2842, [ theorem( or( and( X, X ), not( X ) ) ) ] )
% 1.77/2.14 , clause( 23397, [ theorem( or( and( X, X ), not( X ) ) ) ] )
% 1.77/2.14 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 resolution(
% 1.77/2.14 clause( 23399, [ theorem( or( not( X ), and( X, X ) ) ) ] )
% 1.77/2.14 , clause( 64, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 1.77/2.14 , 1, clause( 2842, [ theorem( or( and( X, X ), not( X ) ) ) ] )
% 1.77/2.14 , 0, substitution( 0, [ :=( X, not( X ) ), :=( Y, and( X, X ) )] ),
% 1.77/2.14 substitution( 1, [ :=( X, X )] )).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 paramod(
% 1.77/2.14 clause( 23400, [ theorem( implies( X, and( X, X ) ) ) ] )
% 1.77/2.14 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.77/2.14 , 0, clause( 23399, [ theorem( or( not( X ), and( X, X ) ) ) ] )
% 1.77/2.14 , 0, 1, substitution( 0, [ :=( X, X ), :=( Y, and( X, X ) )] ),
% 1.77/2.14 substitution( 1, [ :=( X, X )] )).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 subsumption(
% 1.77/2.14 clause( 2870, [ theorem( implies( X, and( X, X ) ) ) ] )
% 1.77/2.14 , clause( 23400, [ theorem( implies( X, and( X, X ) ) ) ] )
% 1.77/2.14 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 resolution(
% 1.77/2.14 clause( 23401, [ theorem( and( X, X ) ), ~( theorem( X ) ) ] )
% 1.77/2.14 , clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y
% 1.77/2.14 ) ) ] )
% 1.77/2.14 , 1, clause( 2870, [ theorem( implies( X, and( X, X ) ) ) ] )
% 1.77/2.14 , 0, substitution( 0, [ :=( X, and( X, X ) ), :=( Y, X )] ), substitution(
% 1.77/2.14 1, [ :=( X, X )] )).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 subsumption(
% 1.77/2.14 clause( 2915, [ theorem( and( X, X ) ), ~( theorem( X ) ) ] )
% 1.77/2.14 , clause( 23401, [ theorem( and( X, X ) ), ~( theorem( X ) ) ] )
% 1.77/2.14 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 1.77/2.14 1 )] ) ).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 paramod(
% 1.77/2.14 clause( 23404, [ theorem( equivalent( X, X ) ), ~( theorem( implies( X, X )
% 1.77/2.14 ) ) ] )
% 1.77/2.14 , clause( 9, [ =( and( implies( X, Y ), implies( Y, X ) ), equivalent( X, Y
% 1.77/2.14 ) ) ] )
% 1.77/2.14 , 0, clause( 2915, [ theorem( and( X, X ) ), ~( theorem( X ) ) ] )
% 1.77/2.14 , 0, 1, substitution( 0, [ :=( X, X ), :=( Y, X )] ), substitution( 1, [
% 1.77/2.14 :=( X, implies( X, X ) )] )).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 subsumption(
% 1.77/2.14 clause( 3056, [ theorem( equivalent( X, X ) ), ~( theorem( implies( X, X )
% 1.77/2.14 ) ) ] )
% 1.77/2.14 , clause( 23404, [ theorem( equivalent( X, X ) ), ~( theorem( implies( X, X
% 1.77/2.14 ) ) ) ] )
% 1.77/2.14 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 1.77/2.14 1 )] ) ).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 resolution(
% 1.77/2.14 clause( 23405, [ ~( theorem( implies( p, p ) ) ) ] )
% 1.77/2.14 , clause( 10, [ ~( theorem( equivalent( p, p ) ) ) ] )
% 1.77/2.14 , 0, clause( 3056, [ theorem( equivalent( X, X ) ), ~( theorem( implies( X
% 1.77/2.14 , X ) ) ) ] )
% 1.77/2.14 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, p )] )).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 subsumption(
% 1.77/2.14 clause( 3444, [ ~( theorem( implies( p, p ) ) ) ] )
% 1.77/2.14 , clause( 23405, [ ~( theorem( implies( p, p ) ) ) ] )
% 1.77/2.14 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 resolution(
% 1.77/2.14 clause( 23406, [ ~( theorem( or( implies( p, p ), implies( p, p ) ) ) ) ]
% 1.77/2.14 )
% 1.77/2.14 , clause( 3444, [ ~( theorem( implies( p, p ) ) ) ] )
% 1.77/2.14 , 0, clause( 16, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 1.77/2.14 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, implies( p, p ) )] )
% 1.77/2.14 ).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 subsumption(
% 1.77/2.14 clause( 3468, [ ~( theorem( or( implies( p, p ), implies( p, p ) ) ) ) ] )
% 1.77/2.14 , clause( 23406, [ ~( theorem( or( implies( p, p ), implies( p, p ) ) ) ) ]
% 1.77/2.14 )
% 1.77/2.14 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 resolution(
% 1.77/2.14 clause( 23407, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 1.77/2.14 , clause( 72, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y ) ),
% 1.77/2.14 X ) ) ) ] )
% 1.77/2.14 , 1, clause( 151, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y,
% 1.77/2.14 implies( X, Z ) ) ) ) ] )
% 1.77/2.14 , 0, substitution( 0, [ :=( X, or( X, implies( Y, Y ) ) ), :=( Y, Y ), :=(
% 1.77/2.14 Z, X )] ), substitution( 1, [ :=( X, Y ), :=( Y, X ), :=( Z, Y )] )).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 subsumption(
% 1.77/2.14 clause( 23226, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 1.77/2.14 , clause( 23407, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 1.77/2.14 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.77/2.14 )] ) ).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 resolution(
% 1.77/2.14 clause( 23408, [] )
% 1.77/2.14 , clause( 3468, [ ~( theorem( or( implies( p, p ), implies( p, p ) ) ) ) ]
% 1.77/2.14 )
% 1.77/2.14 , 0, clause( 23226, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 1.77/2.14 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, implies( p, p ) ),
% 1.77/2.14 :=( Y, p )] )).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 subsumption(
% 1.77/2.14 clause( 23336, [] )
% 1.77/2.14 , clause( 23408, [] )
% 1.77/2.14 , substitution( 0, [] ), permutation( 0, [] ) ).
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 end.
% 1.77/2.14
% 1.77/2.14 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 1.77/2.14
% 1.77/2.14 Memory use:
% 1.77/2.14
% 1.77/2.14 space for terms: 360789
% 1.77/2.14 space for clauses: 1049292
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 clauses generated: 56880
% 1.77/2.14 clauses kept: 23337
% 1.77/2.14 clauses selected: 543
% 1.77/2.14 clauses deleted: 140
% 1.77/2.14 clauses inuse deleted: 2
% 1.77/2.14
% 1.77/2.14 subsentry: 952280
% 1.77/2.14 literals s-matched: 483575
% 1.77/2.14 literals matched: 445722
% 1.77/2.14 full subsumption: 192379
% 1.77/2.14
% 1.77/2.14 checksum: 2143025212
% 1.77/2.14
% 1.77/2.14
% 1.77/2.14 Bliksem ended
%------------------------------------------------------------------------------