TSTP Solution File: LCL191-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL191-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n028.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:51:29 EDT 2022
% Result : Unsatisfiable 2.48s 2.84s
% Output : Refutation 2.48s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LCL191-1 : TPTP v8.1.0. Released v1.1.0.
% 0.04/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n028.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % DateTime : Mon Jul 4 20:10:20 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.48/2.84 *** allocated 10000 integers for termspace/termends
% 2.48/2.84 *** allocated 10000 integers for clauses
% 2.48/2.84 *** allocated 10000 integers for justifications
% 2.48/2.84 Bliksem 1.12
% 2.48/2.84
% 2.48/2.84
% 2.48/2.84 Automatic Strategy Selection
% 2.48/2.84
% 2.48/2.84 Clauses:
% 2.48/2.84 [
% 2.48/2.84 [ axiom( or( not( or( X, X ) ), X ) ) ],
% 2.48/2.84 [ axiom( or( not( X ), or( Y, X ) ) ) ],
% 2.48/2.84 [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ],
% 2.48/2.84 [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) ) ],
% 2.48/2.84 [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) ), or( Z, Y )
% 2.48/2.84 ) ) ) ],
% 2.48/2.84 [ theorem( X ), ~( axiom( X ) ) ],
% 2.48/2.84 [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~( theorem( Y ) ) ]
% 2.48/2.84 ,
% 2.48/2.84 [ theorem( or( not( X ), Y ) ), ~( axiom( or( not( X ), Z ) ) ), ~(
% 2.48/2.84 theorem( or( not( Z ), Y ) ) ) ],
% 2.48/2.84 [ ~( theorem( or( not( or( p, or( q, r ) ) ), or( or( p, q ), r ) ) ) )
% 2.48/2.84 ]
% 2.48/2.84 ] .
% 2.48/2.84
% 2.48/2.84
% 2.48/2.84 percentage equality = 0.000000, percentage horn = 1.000000
% 2.48/2.84 This is a near-Horn, non-equality problem
% 2.48/2.84
% 2.48/2.84
% 2.48/2.84 Options Used:
% 2.48/2.84
% 2.48/2.84 useres = 1
% 2.48/2.84 useparamod = 0
% 2.48/2.84 useeqrefl = 0
% 2.48/2.84 useeqfact = 0
% 2.48/2.84 usefactor = 1
% 2.48/2.84 usesimpsplitting = 0
% 2.48/2.84 usesimpdemod = 0
% 2.48/2.84 usesimpres = 4
% 2.48/2.84
% 2.48/2.84 resimpinuse = 1000
% 2.48/2.84 resimpclauses = 20000
% 2.48/2.84 substype = standard
% 2.48/2.84 backwardsubs = 1
% 2.48/2.84 selectoldest = 5
% 2.48/2.84
% 2.48/2.84 litorderings [0] = split
% 2.48/2.84 litorderings [1] = liftord
% 2.48/2.84
% 2.48/2.84 termordering = none
% 2.48/2.84
% 2.48/2.84 litapriori = 1
% 2.48/2.84 termapriori = 0
% 2.48/2.84 litaposteriori = 0
% 2.48/2.84 termaposteriori = 0
% 2.48/2.84 demodaposteriori = 0
% 2.48/2.84 ordereqreflfact = 0
% 2.48/2.84
% 2.48/2.84 litselect = negative
% 2.48/2.84
% 2.48/2.84 maxweight = 30000
% 2.48/2.84 maxdepth = 30000
% 2.48/2.84 maxlength = 115
% 2.48/2.84 maxnrvars = 195
% 2.48/2.84 excuselevel = 0
% 2.48/2.84 increasemaxweight = 0
% 2.48/2.84
% 2.48/2.84 maxselected = 10000000
% 2.48/2.84 maxnrclauses = 10000000
% 2.48/2.84
% 2.48/2.84 showgenerated = 0
% 2.48/2.84 showkept = 0
% 2.48/2.84 showselected = 0
% 2.48/2.84 showdeleted = 0
% 2.48/2.84 showresimp = 1
% 2.48/2.84 showstatus = 2000
% 2.48/2.84
% 2.48/2.84 prologoutput = 1
% 2.48/2.84 nrgoals = 5000000
% 2.48/2.84 totalproof = 1
% 2.48/2.84
% 2.48/2.84 Symbols occurring in the translation:
% 2.48/2.84
% 2.48/2.84 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 2.48/2.84 . [1, 2] (w:1, o:26, a:1, s:1, b:0),
% 2.48/2.84 ! [4, 1] (w:1, o:18, a:1, s:1, b:0),
% 2.48/2.84 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 2.48/2.84 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 2.48/2.84 or [40, 2] (w:1, o:51, a:1, s:1, b:0),
% 2.48/2.84 not [41, 1] (w:1, o:23, a:1, s:1, b:0),
% 2.48/2.84 axiom [42, 1] (w:1, o:24, a:1, s:1, b:0),
% 2.48/2.84 theorem [46, 1] (w:1, o:25, a:1, s:1, b:0),
% 2.48/2.84 p [49, 0] (w:1, o:15, a:1, s:1, b:0),
% 2.48/2.84 q [50, 0] (w:1, o:16, a:1, s:1, b:0),
% 2.48/2.84 r [51, 0] (w:1, o:17, a:1, s:1, b:0).
% 2.48/2.84
% 2.48/2.84
% 2.48/2.84 Starting Search:
% 2.48/2.84
% 2.48/2.84 Resimplifying inuse:
% 2.48/2.84 Done
% 2.48/2.84
% 2.48/2.84
% 2.48/2.84 Intermediate Status:
% 2.48/2.84 Generated: 3552
% 2.48/2.84 Kept: 2003
% 2.48/2.84 Inuse: 579
% 2.48/2.84 Deleted: 7
% 2.48/2.84 Deletedinuse: 0
% 2.48/2.84
% 2.48/2.84 Resimplifying inuse:
% 2.48/2.84 Done
% 2.48/2.84
% 2.48/2.84 Resimplifying inuse:
% 2.48/2.84 Done
% 2.48/2.84
% 2.48/2.84
% 2.48/2.84 Intermediate Status:
% 2.48/2.84 Generated: 7011
% 2.48/2.84 Kept: 4004
% 2.48/2.84 Inuse: 1159
% 2.48/2.84 Deleted: 22
% 2.48/2.84 Deletedinuse: 0
% 2.48/2.84
% 2.48/2.84 Resimplifying inuse:
% 2.48/2.84 Done
% 2.48/2.84
% 2.48/2.84 Resimplifying inuse:
% 2.48/2.84 Done
% 2.48/2.84
% 2.48/2.84
% 2.48/2.84 Intermediate Status:
% 2.48/2.84 Generated: 10535
% 2.48/2.84 Kept: 6005
% 2.48/2.84 Inuse: 1749
% 2.48/2.84 Deleted: 36
% 2.48/2.84 Deletedinuse: 0
% 2.48/2.84
% 2.48/2.84 Resimplifying inuse:
% 2.48/2.84 Done
% 2.48/2.84
% 2.48/2.84 Resimplifying inuse:
% 2.48/2.84 Done
% 2.48/2.84
% 2.48/2.84
% 2.48/2.84 Intermediate Status:
% 2.48/2.84 Generated: 13970
% 2.48/2.84 Kept: 8008
% 2.48/2.84 Inuse: 2286
% 2.48/2.84 Deleted: 54
% 2.48/2.84 Deletedinuse: 0
% 2.48/2.84
% 2.48/2.84 Resimplifying inuse:
% 2.48/2.84 Done
% 2.48/2.84
% 2.48/2.84 Resimplifying inuse:
% 2.48/2.84 Done
% 2.48/2.84
% 2.48/2.84
% 2.48/2.84 Intermediate Status:
% 2.48/2.84 Generated: 17352
% 2.48/2.84 Kept: 10008
% 2.48/2.84 Inuse: 2812
% 2.48/2.84 Deleted: 63
% 2.48/2.84 Deletedinuse: 0
% 2.48/2.84
% 2.48/2.84 Resimplifying inuse:
% 2.48/2.84 Done
% 2.48/2.84
% 2.48/2.84 Resimplifying inuse:
% 2.48/2.84 Done
% 2.48/2.84
% 2.48/2.84
% 2.48/2.84 Intermediate Status:
% 2.48/2.84 Generated: 20537
% 2.48/2.84 Kept: 12010
% 2.48/2.84 Inuse: 3393
% 2.48/2.84 Deleted: 83
% 2.48/2.84 Deletedinuse: 0
% 2.48/2.84
% 2.48/2.84 Resimplifying inuse:
% 2.48/2.84 Done
% 2.48/2.84
% 2.48/2.84 Resimplifying inuse:
% 2.48/2.84 Done
% 2.48/2.84
% 2.48/2.84
% 2.48/2.84 Intermediate Status:
% 2.48/2.84 Generated: 24245
% 2.48/2.84 Kept: 14010
% 2.48/2.84 Inuse: 4013
% 2.48/2.84 Deleted: 89
% 2.48/2.84 Deletedinuse: 0
% 2.48/2.84
% 2.48/2.84 Resimplifying inuse:
% 2.48/2.84 Done
% 2.48/2.84
% 2.48/2.84 Resimplifying inuse:
% 2.48/2.84 Done
% 2.48/2.84
% 2.48/2.84
% 2.48/2.84 Intermediate Status:
% 2.48/2.84 Generated: 27742
% 2.48/2.84 Kept: 16011
% 2.48/2.84 Inuse: 4575
% 2.48/2.84 Deleted: 95
% 2.48/2.84 Deletedinuse: 0
% 2.48/2.84
% 2.48/2.84 Resimplifying inuse:
% 2.48/2.84 Done
% 2.48/2.84
% 2.48/2.84 Resimplifying inuse:
% 2.48/2.84 Done
% 2.48/2.84
% 2.48/2.84
% 2.48/2.84 Intermediate Status:
% 2.48/2.84 Generated: 31389
% 2.48/2.84 Kept: 18016
% 2.48/2.84 Inuse: 5173
% 2.48/2.84 Deleted: 107
% 2.48/2.84 Deletedinuse: 0
% 2.48/2.84
% 2.48/2.84 Resimplifying inuse:
% 2.48/2.84 Done
% 2.48/2.84
% 2.48/2.84 Resimplifying inuse:
% 2.48/2.84 Done
% 2.48/2.84
% 2.48/2.84 Resimplifying clauses:
% 2.48/2.84 Done
% 2.48/2.84
% 2.48/2.84
% 2.48/2.84 Intermediate Status:
% 2.48/2.84 Generated: 35129
% 2.48/2.84 Kept: 20020
% 2.48/2.84 Inuse: 5808
% 2.48/2.84 Deleted: 1058
% 2.48/2.84 Deletedinuse: 0
% 2.48/2.84
% 2.48/2.84 Resimplifying inuse:
% 2.48/2.84 Done
% 2.48/2.84
% 2.48/2.84 Resimplifying inuse:
% 2.48/2.84 Done
% 2.48/2.84
% 2.48/2.84
% 2.48/2.84 Intermediate Status:
% 2.48/2.84 Generated: 38407
% 2.48/2.84 Kept: 22020
% 2.48/2.84 Inuse: 6379
% 2.48/2.84 Deleted: 1058
% 2.48/2.84 Deletedinuse: 0
% 2.48/2.84
% 2.48/2.84 Resimplifying inuse:
% 2.48/2.84 Done
% 2.48/2.84
% 2.48/2.84
% 2.48/2.84 Bliksems!, er is een bewijs:
% 2.48/2.84 % SZS status Unsatisfiable
% 2.48/2.84 % SZS output start Refutation
% 2.48/2.84
% 2.48/2.84 clause( 0, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 2.48/2.84 .
% 2.48/2.84 clause( 1, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 2.48/2.84 .
% 2.48/2.84 clause( 2, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 2.48/2.84 .
% 2.48/2.84 clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) )
% 2.48/2.84 ] )
% 2.48/2.84 .
% 2.48/2.84 clause( 4, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) ), or(
% 2.48/2.84 Z, Y ) ) ) ) ] )
% 2.48/2.84 .
% 2.48/2.84 clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 2.48/2.84 .
% 2.48/2.84 clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X ) )
% 2.48/2.84 ) ] )
% 2.48/2.84 .
% 2.48/2.84 clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y ) )
% 2.48/2.84 ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 2.48/2.84 .
% 2.48/2.84 clause( 8, [ ~( theorem( or( not( or( p, or( q, r ) ) ), or( or( p, q ), r
% 2.48/2.84 ) ) ) ) ] )
% 2.48/2.84 .
% 2.48/2.84 clause( 11, [ theorem( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 2.48/2.84 .
% 2.48/2.84 clause( 12, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 2.48/2.84 .
% 2.48/2.84 clause( 13, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 2.48/2.84 .
% 2.48/2.84 clause( 14, [ theorem( or( X, Y ) ), ~( theorem( Y ) ) ] )
% 2.48/2.84 .
% 2.48/2.84 clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z )
% 2.48/2.84 ) ) ) ] )
% 2.48/2.84 .
% 2.48/2.84 clause( 27, [ theorem( or( not( or( X, Y ) ), or( X, Z ) ) ), ~( theorem(
% 2.48/2.84 or( not( Y ), Z ) ) ) ] )
% 2.48/2.84 .
% 2.48/2.84 clause( 35, [ theorem( or( not( or( X, or( Y, Z ) ) ), T ) ), ~( theorem(
% 2.48/2.84 or( not( or( Y, or( X, Z ) ) ), T ) ) ) ] )
% 2.48/2.84 .
% 2.48/2.84 clause( 36, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 2.48/2.84 or( Y, X ) ), Z ) ) ) ] )
% 2.48/2.84 .
% 2.48/2.84 clause( 38, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( or( Z, X )
% 2.48/2.84 ), Y ) ) ) ] )
% 2.48/2.84 .
% 2.48/2.84 clause( 220, [ theorem( or( not( X ), or( X, Y ) ) ) ] )
% 2.48/2.84 .
% 2.48/2.84 clause( 223, [ theorem( or( not( or( X, Y ) ), or( or( Y, X ), Z ) ) ) ] )
% 2.48/2.84 .
% 2.48/2.84 clause( 371, [ theorem( or( not( X ), or( or( X, Y ), Z ) ) ) ] )
% 2.48/2.84 .
% 2.48/2.84 clause( 384, [ theorem( or( not( or( X, Y ) ), or( X, or( or( Y, Z ), T ) )
% 2.48/2.84 ) ) ] )
% 2.48/2.84 .
% 2.48/2.84 clause( 2697, [ theorem( or( X, or( not( or( X, Y ) ), or( or( Y, Z ), T )
% 2.48/2.84 ) ) ) ] )
% 2.48/2.84 .
% 2.48/2.84 clause( 2732, [ theorem( or( or( not( or( X, Y ) ), or( or( Y, Z ), T ) ),
% 2.48/2.84 X ) ) ] )
% 2.48/2.84 .
% 2.48/2.84 clause( 2735, [ theorem( or( X, or( or( not( or( Y, Z ) ), or( or( Z, T ),
% 2.48/2.84 U ) ), Y ) ) ) ] )
% 2.48/2.84 .
% 2.48/2.84 clause( 14317, [ theorem( or( or( not( or( X, Y ) ), or( or( Y, Z ), T ) )
% 2.48/2.84 , or( U, X ) ) ) ] )
% 2.48/2.84 .
% 2.48/2.84 clause( 14320, [ theorem( or( or( X, Y ), or( not( or( Y, Z ) ), or( or( Z
% 2.48/2.84 , T ), U ) ) ) ) ] )
% 2.48/2.84 .
% 2.48/2.84 clause( 14323, [ theorem( or( not( or( X, Y ) ), or( or( Z, X ), or( or( Y
% 2.48/2.84 , T ), U ) ) ) ) ] )
% 2.48/2.84 .
% 2.48/2.84 clause( 14326, [ theorem( or( not( or( X, Y ) ), or( or( Z, Y ), or( or( X
% 2.48/2.84 , T ), U ) ) ) ) ] )
% 2.48/2.84 .
% 2.48/2.84 clause( 14343, [ theorem( or( or( X, Y ), or( not( or( Z, Y ) ), or( or( Z
% 2.48/2.84 , T ), U ) ) ) ) ] )
% 2.48/2.84 .
% 2.48/2.84 clause( 14347, [ theorem( or( not( or( X, or( or( X, Y ), Z ) ) ), or( or(
% 2.48/2.84 X, Y ), Z ) ) ) ] )
% 2.48/2.84 .
% 2.48/2.84 clause( 21004, [ theorem( or( not( or( or( X, Y ), or( X, Z ) ) ), or( or(
% 2.48/2.84 X, Y ), Z ) ) ) ] )
% 2.48/2.84 .
% 2.48/2.84 clause( 21011, [ theorem( or( not( or( or( X, Y ), or( X, Z ) ) ), or( or(
% 2.48/2.84 X, Z ), Y ) ) ) ] )
% 2.48/2.84 .
% 2.48/2.84 clause( 21676, [ theorem( or( not( or( X, or( or( X, Y ), Z ) ) ), or( or(
% 2.48/2.84 X, Z ), Y ) ) ) ] )
% 2.48/2.84 .
% 2.48/2.84 clause( 22413, [ theorem( or( not( or( or( X, Y ), Z ) ), or( or( X, Z ), Y
% 2.48/2.84 ) ) ) ] )
% 2.48/2.84 .
% 2.48/2.84 clause( 22421, [ theorem( or( not( or( X, or( Y, Z ) ) ), or( or( Y, X ), Z
% 2.48/2.84 ) ) ) ] )
% 2.48/2.84 .
% 2.48/2.84 clause( 22428, [ theorem( or( not( or( X, or( Y, Z ) ) ), or( or( X, Y ), Z
% 2.48/2.84 ) ) ) ] )
% 2.48/2.84 .
% 2.48/2.84 clause( 22446, [] )
% 2.48/2.84 .
% 2.48/2.84
% 2.48/2.84
% 2.48/2.84 % SZS output end Refutation
% 2.48/2.84 found a proof!
% 2.48/2.84
% 2.48/2.84 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 2.48/2.84
% 2.48/2.84 initialclauses(
% 2.48/2.84 [ clause( 22448, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 2.48/2.84 , clause( 22449, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 2.48/2.84 , clause( 22450, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 2.48/2.84 , clause( 22451, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z )
% 2.48/2.84 ) ) ) ] )
% 2.48/2.84 , clause( 22452, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X )
% 2.48/2.84 ), or( Z, Y ) ) ) ) ] )
% 2.48/2.84 , clause( 22453, [ theorem( X ), ~( axiom( X ) ) ] )
% 2.48/2.84 , clause( 22454, [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~(
% 2.48/2.84 theorem( Y ) ) ] )
% 2.48/2.84 , clause( 22455, [ theorem( or( not( X ), Y ) ), ~( axiom( or( not( X ), Z
% 2.48/2.84 ) ) ), ~( theorem( or( not( Z ), Y ) ) ) ] )
% 2.48/2.84 , clause( 22456, [ ~( theorem( or( not( or( p, or( q, r ) ) ), or( or( p, q
% 2.48/2.84 ), r ) ) ) ) ] )
% 2.48/2.84 ] ).
% 2.48/2.84
% 2.48/2.84
% 2.48/2.84
% 2.48/2.84 subsumption(
% 2.48/2.84 clause( 0, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 2.48/2.84 , clause( 22448, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 2.48/2.84 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.48/2.84
% 2.48/2.84
% 2.48/2.84 subsumption(
% 2.48/2.84 clause( 1, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 2.48/2.84 , clause( 22449, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 2.48/2.84 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 2.48/2.84 )] ) ).
% 2.48/2.84
% 2.48/2.84
% 2.48/2.84 subsumption(
% 2.48/2.84 clause( 2, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 2.48/2.84 , clause( 22450, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 2.48/2.84 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 2.48/2.84 )] ) ).
% 2.48/2.84
% 2.48/2.84
% 2.48/2.84 subsumption(
% 2.48/2.84 clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) )
% 2.48/2.84 ] )
% 2.48/2.84 , clause( 22451, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z )
% 2.48/2.84 ) ) ) ] )
% 2.48/2.84 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 2.48/2.84 permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.48/2.84
% 2.48/2.84
% 2.48/2.84 subsumption(
% 2.48/2.84 clause( 4, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) ), or(
% 2.48/2.84 Z, Y ) ) ) ) ] )
% 2.48/2.84 , clause( 22452, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X )
% 2.48/2.84 ), or( Z, Y ) ) ) ) ] )
% 2.48/2.84 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 2.48/2.84 permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.48/2.84
% 2.48/2.84
% 2.48/2.84 subsumption(
% 2.48/2.84 clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 2.48/2.84 , clause( 22453, [ theorem( X ), ~( axiom( X ) ) ] )
% 2.48/2.84 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 2.48/2.84 1 )] ) ).
% 2.48/2.84
% 2.48/2.84
% 2.48/2.84 subsumption(
% 2.48/2.84 clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X ) )
% 2.48/2.84 ) ] )
% 2.48/2.84 , clause( 22454, [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~(
% 2.48/2.84 theorem( Y ) ) ] )
% 2.48/2.84 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 2.48/2.84 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 2.48/2.84
% 2.48/2.84
% 2.48/2.84 subsumption(
% 2.48/2.84 clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y ) )
% 2.48/2.84 ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 2.48/2.84 , clause( 22455, [ theorem( or( not( X ), Y ) ), ~( axiom( or( not( X ), Z
% 2.48/2.84 ) ) ), ~( theorem( or( not( Z ), Y ) ) ) ] )
% 2.48/2.84 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 2.48/2.84 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 2.48/2.84
% 2.48/2.84
% 2.48/2.84 subsumption(
% 2.48/2.84 clause( 8, [ ~( theorem( or( not( or( p, or( q, r ) ) ), or( or( p, q ), r
% 2.48/2.84 ) ) ) ) ] )
% 2.48/2.84 , clause( 22456, [ ~( theorem( or( not( or( p, or( q, r ) ) ), or( or( p, q
% 2.48/2.84 ), r ) ) ) ) ] )
% 2.48/2.84 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.48/2.84
% 2.48/2.84
% 2.48/2.84 resolution(
% 2.48/2.84 clause( 22457, [ theorem( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 2.48/2.84 , clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 2.48/2.84 , 1, clause( 2, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 2.48/2.84 , 0, substitution( 0, [ :=( X, or( not( or( X, Y ) ), or( Y, X ) ) )] ),
% 2.48/2.84 substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 2.48/2.84
% 2.48/2.84
% 2.48/2.84 subsumption(
% 2.48/2.84 clause( 11, [ theorem( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 2.48/2.84 , clause( 22457, [ theorem( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 2.48/2.84 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 2.48/2.84 )] ) ).
% 2.48/2.84
% 2.48/2.84
% 2.48/2.84 resolution(
% 2.48/2.84 clause( 22458, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 2.48/2.84 , clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X )
% 2.48/2.84 ) ) ] )
% 2.48/2.84 , 2, clause( 2, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 2.48/2.84 , 0, substitution( 0, [ :=( X, or( X, Y ) ), :=( Y, or( Y, X ) )] ),
% 2.48/2.84 substitution( 1, [ :=( X, Y ), :=( Y, X )] )).
% 2.48/2.84
% 2.48/2.84
% 2.48/2.84 subsumption(
% 2.48/2.84 clause( 12, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 2.48/2.84 , clause( 22458, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 2.48/2.84 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 2.48/2.84 ), ==>( 1, 1 )] ) ).
% 2.48/2.84
% 2.48/2.84
% 2.48/2.84 resolution(
% 2.48/2.84 clause( 22459, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 2.48/2.84 , clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X )
% 2.48/2.84 ) ) ] )
% 2.48/2.84 , 2, clause( 0, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 2.48/2.84 , 0, substitution( 0, [ :=( X, X ), :=( Y, or( X, X ) )] ), substitution( 1
% 2.48/2.84 , [ :=( X, X )] )).
% 2.48/2.84
% 2.48/2.84
% 2.48/2.84 subsumption(
% 2.48/2.84 clause( 13, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 2.48/2.84 , clause( 22459, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 2.48/2.84 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 2.48/2.84 1 )] ) ).
% 2.48/2.84
% 2.48/2.84
% 2.48/2.84 resolution(
% 2.48/2.84 clause( 22460, [ theorem( or( X, Y ) ), ~( theorem( Y ) ) ] )
% 2.48/2.84 , clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X )
% 2.48/2.84 ) ) ] )
% 2.48/2.84 , 2, clause( 1, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 2.48/2.84 , 0, substitution( 0, [ :=( X, or( X, Y ) ), :=( Y, Y )] ), substitution( 1
% 2.48/2.84 , [ :=( X, Y ), :=( Y, X )] )).
% 2.48/2.84
% 2.48/2.84
% 2.48/2.84 subsumption(
% 2.48/2.84 clause( 14, [ theorem( or( X, Y ) ), ~( theorem( Y ) ) ] )
% 2.48/2.84 , clause( 22460, [ theorem( or( X, Y ) ), ~( theorem( Y ) ) ] )
% 2.48/2.84 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 2.48/2.84 ), ==>( 1, 1 )] ) ).
% 2.48/2.84
% 2.48/2.84
% 2.48/2.84 resolution(
% 2.48/2.84 clause( 22461, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X,
% 2.48/2.84 Z ) ) ) ) ] )
% 2.48/2.84 , clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X )
% 2.48/2.84 ) ) ] )
% 2.48/2.84 , 2, clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z )
% 2.48/2.84 ) ) ) ] )
% 2.48/2.84 , 0, substitution( 0, [ :=( X, or( X, or( Y, Z ) ) ), :=( Y, or( Y, or( X,
% 2.48/2.84 Z ) ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, X ), :=( Z, Z )] )).
% 2.48/2.84
% 2.48/2.84
% 2.48/2.84 subsumption(
% 2.48/2.84 clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z )
% 2.48/2.84 ) ) ) ] )
% 2.48/2.84 , clause( 22461, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X
% 2.48/2.84 , Z ) ) ) ) ] )
% 2.48/2.84 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 2.48/2.84 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 2.48/2.84
% 2.48/2.84
% 2.48/2.84 resolution(
% 2.48/2.84 clause( 22462, [ theorem( or( not( or( X, Y ) ), or( X, Z ) ) ), ~( theorem(
% 2.48/2.84 or( not( Y ), Z ) ) ) ] )
% 2.48/2.84 , clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X )
% 2.48/2.84 ) ) ] )
% 2.48/2.84 , 2, clause( 4, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X )
% 2.48/2.84 ), or( Z, Y ) ) ) ) ] )
% 2.48/2.84 , 0, substitution( 0, [ :=( X, or( not( or( X, Y ) ), or( X, Z ) ) ), :=( Y
% 2.48/2.84 , or( not( Y ), Z ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, Z ), :=(
% 2.48/2.84 Z, X )] )).
% 2.48/2.84
% 2.48/2.84
% 2.48/2.84 subsumption(
% 2.48/2.84 clause( 27, [ theorem( or( not( or( X, Y ) ), or( X, Z ) ) ), ~( theorem(
% 2.48/2.84 or( not( Y ), Z ) ) ) ] )
% 2.48/2.84 , clause( 22462, [ theorem( or( not( or( X, Y ) ), or( X, Z ) ) ), ~(
% 2.48/2.84 theorem( or( not( Y ), Z ) ) ) ] )
% 2.48/2.84 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 2.48/2.84 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 2.48/2.84
% 2.48/2.84
% 2.48/2.84 resolution(
% 2.48/2.84 clause( 22463, [ theorem( or( not( or( X, or( Y, Z ) ) ), T ) ), ~( theorem(
% 2.48/2.84 or( not( or( Y, or( X, Z ) ) ), T ) ) ) ] )
% 2.48/2.84 , clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y )
% 2.48/2.84 ) ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 2.48/2.84 , 2, clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z )
% 2.48/2.84 ) ) ) ] )
% 2.48/2.84 , 0, substitution( 0, [ :=( X, or( X, or( Y, Z ) ) ), :=( Y, T ), :=( Z, or(
% 2.48/2.84 Y, or( X, Z ) ) )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z
% 2.48/2.84 )] )).
% 2.48/2.84
% 2.48/2.84
% 2.48/2.84 subsumption(
% 2.48/2.84 clause( 35, [ theorem( or( not( or( X, or( Y, Z ) ) ), T ) ), ~( theorem(
% 2.48/2.84 or( not( or( Y, or( X, Z ) ) ), T ) ) ) ] )
% 2.48/2.84 , clause( 22463, [ theorem( or( not( or( X, or( Y, Z ) ) ), T ) ), ~(
% 2.48/2.84 theorem( or( not( or( Y, or( X, Z ) ) ), T ) ) ) ] )
% 2.48/2.84 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 2.48/2.84 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 2.48/2.84
% 2.48/2.84
% 2.48/2.84 resolution(
% 2.48/2.84 clause( 22464, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 2.48/2.84 or( Y, X ) ), Z ) ) ) ] )
% 2.48/2.84 , clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y )
% 2.48/2.84 ) ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 2.48/2.84 , 2, clause( 2, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 2.48/2.84 , 0, substitution( 0, [ :=( X, or( X, Y ) ), :=( Y, Z ), :=( Z, or( Y, X )
% 2.48/2.84 )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 2.48/2.84
% 2.48/2.84
% 2.48/2.84 subsumption(
% 2.48/2.84 clause( 36, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 2.48/2.84 or( Y, X ) ), Z ) ) ) ] )
% 2.48/2.84 , clause( 22464, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or(
% 2.48/2.84 not( or( Y, X ) ), Z ) ) ) ] )
% 2.48/2.84 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 2.48/2.85 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 2.48/2.85
% 2.48/2.85
% 2.48/2.85 resolution(
% 2.48/2.85 clause( 22465, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( or( Z,
% 2.48/2.85 X ) ), Y ) ) ) ] )
% 2.48/2.85 , clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y )
% 2.48/2.85 ) ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 2.48/2.85 , 2, clause( 1, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 2.48/2.85 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, or( Z, X ) )] ),
% 2.48/2.85 substitution( 1, [ :=( X, X ), :=( Y, Z )] )).
% 2.48/2.85
% 2.48/2.85
% 2.48/2.85 subsumption(
% 2.48/2.85 clause( 38, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( or( Z, X )
% 2.48/2.85 ), Y ) ) ) ] )
% 2.48/2.85 , clause( 22465, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( or( Z
% 2.48/2.85 , X ) ), Y ) ) ) ] )
% 2.48/2.85 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 2.48/2.85 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 2.48/2.85
% 2.48/2.85
% 2.48/2.85 resolution(
% 2.48/2.85 clause( 22466, [ theorem( or( not( X ), or( X, Y ) ) ) ] )
% 2.48/2.85 , clause( 38, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( or( Z, X
% 2.48/2.85 ) ), Y ) ) ) ] )
% 2.48/2.85 , 1, clause( 11, [ theorem( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 2.48/2.85 , 0, substitution( 0, [ :=( X, X ), :=( Y, or( X, Y ) ), :=( Z, Y )] ),
% 2.48/2.85 substitution( 1, [ :=( X, Y ), :=( Y, X )] )).
% 2.48/2.85
% 2.48/2.85
% 2.48/2.85 subsumption(
% 2.48/2.85 clause( 220, [ theorem( or( not( X ), or( X, Y ) ) ) ] )
% 2.48/2.85 , clause( 22466, [ theorem( or( not( X ), or( X, Y ) ) ) ] )
% 2.48/2.85 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 2.48/2.85 )] ) ).
% 2.48/2.85
% 2.48/2.85
% 2.48/2.85 resolution(
% 2.48/2.85 clause( 22467, [ theorem( or( not( or( X, Y ) ), or( or( Y, X ), Z ) ) ) ]
% 2.48/2.85 )
% 2.48/2.85 , clause( 36, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 2.48/2.85 or( Y, X ) ), Z ) ) ) ] )
% 2.48/2.85 , 1, clause( 220, [ theorem( or( not( X ), or( X, Y ) ) ) ] )
% 2.48/2.85 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, or( or( Y, X ), Z )
% 2.48/2.85 )] ), substitution( 1, [ :=( X, or( Y, X ) ), :=( Y, Z )] )).
% 2.48/2.85
% 2.48/2.85
% 2.48/2.85 subsumption(
% 2.48/2.85 clause( 223, [ theorem( or( not( or( X, Y ) ), or( or( Y, X ), Z ) ) ) ] )
% 2.48/2.85 , clause( 22467, [ theorem( or( not( or( X, Y ) ), or( or( Y, X ), Z ) ) )
% 2.48/2.85 ] )
% 2.48/2.85 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 2.48/2.85 permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.48/2.85
% 2.48/2.85
% 2.48/2.85 resolution(
% 2.48/2.85 clause( 22468, [ theorem( or( not( X ), or( or( X, Y ), Z ) ) ) ] )
% 2.48/2.85 , clause( 38, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( or( Z, X
% 2.48/2.85 ) ), Y ) ) ) ] )
% 2.48/2.85 , 1, clause( 223, [ theorem( or( not( or( X, Y ) ), or( or( Y, X ), Z ) ) )
% 2.48/2.85 ] )
% 2.48/2.85 , 0, substitution( 0, [ :=( X, X ), :=( Y, or( or( X, Y ), Z ) ), :=( Z, Y
% 2.48/2.85 )] ), substitution( 1, [ :=( X, Y ), :=( Y, X ), :=( Z, Z )] )).
% 2.48/2.85
% 2.48/2.85
% 2.48/2.85 subsumption(
% 2.48/2.85 clause( 371, [ theorem( or( not( X ), or( or( X, Y ), Z ) ) ) ] )
% 2.48/2.85 , clause( 22468, [ theorem( or( not( X ), or( or( X, Y ), Z ) ) ) ] )
% 2.48/2.85 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 2.48/2.85 permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.48/2.85
% 2.48/2.85
% 2.48/2.85 resolution(
% 2.48/2.85 clause( 22469, [ theorem( or( not( or( X, Y ) ), or( X, or( or( Y, Z ), T )
% 2.48/2.85 ) ) ) ] )
% 2.48/2.85 , clause( 27, [ theorem( or( not( or( X, Y ) ), or( X, Z ) ) ), ~( theorem(
% 2.48/2.85 or( not( Y ), Z ) ) ) ] )
% 2.48/2.85 , 1, clause( 371, [ theorem( or( not( X ), or( or( X, Y ), Z ) ) ) ] )
% 2.48/2.85 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, or( or( Y, Z ), T )
% 2.48/2.85 )] ), substitution( 1, [ :=( X, Y ), :=( Y, Z ), :=( Z, T )] )).
% 2.48/2.85
% 2.48/2.85
% 2.48/2.85 subsumption(
% 2.48/2.85 clause( 384, [ theorem( or( not( or( X, Y ) ), or( X, or( or( Y, Z ), T ) )
% 2.48/2.85 ) ) ] )
% 2.48/2.85 , clause( 22469, [ theorem( or( not( or( X, Y ) ), or( X, or( or( Y, Z ), T
% 2.48/2.85 ) ) ) ) ] )
% 2.48/2.85 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 2.48/2.85 permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.48/2.85
% 2.48/2.85
% 2.48/2.85 resolution(
% 2.48/2.85 clause( 22470, [ theorem( or( X, or( not( or( X, Y ) ), or( or( Y, Z ), T )
% 2.48/2.85 ) ) ) ] )
% 2.48/2.85 , clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z
% 2.48/2.85 ) ) ) ) ] )
% 2.48/2.85 , 1, clause( 384, [ theorem( or( not( or( X, Y ) ), or( X, or( or( Y, Z ),
% 2.48/2.85 T ) ) ) ) ] )
% 2.48/2.85 , 0, substitution( 0, [ :=( X, X ), :=( Y, not( or( X, Y ) ) ), :=( Z, or(
% 2.48/2.85 or( Y, Z ), T ) )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z
% 2.48/2.85 ), :=( T, T )] )).
% 2.48/2.85
% 2.48/2.85
% 2.48/2.85 subsumption(
% 2.48/2.85 clause( 2697, [ theorem( or( X, or( not( or( X, Y ) ), or( or( Y, Z ), T )
% 2.48/2.85 ) ) ) ] )
% 2.48/2.85 , clause( 22470, [ theorem( or( X, or( not( or( X, Y ) ), or( or( Y, Z ), T
% 2.48/2.85 ) ) ) ) ] )
% 2.48/2.85 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 2.48/2.85 permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.48/2.85
% 2.48/2.85
% 2.48/2.85 resolution(
% 2.48/2.85 clause( 22471, [ theorem( or( or( not( or( X, Y ) ), or( or( Y, Z ), T ) )
% 2.48/2.85 , X ) ) ] )
% 2.48/2.85 , clause( 12, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 2.48/2.85 , 1, clause( 2697, [ theorem( or( X, or( not( or( X, Y ) ), or( or( Y, Z )
% 2.48/2.85 , T ) ) ) ) ] )
% 2.48/2.85 , 0, substitution( 0, [ :=( X, or( not( or( X, Y ) ), or( or( Y, Z ), T ) )
% 2.48/2.85 ), :=( Y, X )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )
% 2.48/2.85 , :=( T, T )] )).
% 2.48/2.85
% 2.48/2.85
% 2.48/2.85 subsumption(
% 2.48/2.85 clause( 2732, [ theorem( or( or( not( or( X, Y ) ), or( or( Y, Z ), T ) ),
% 2.48/2.85 X ) ) ] )
% 2.48/2.85 , clause( 22471, [ theorem( or( or( not( or( X, Y ) ), or( or( Y, Z ), T )
% 2.48/2.85 ), X ) ) ] )
% 2.48/2.85 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 2.48/2.85 permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.48/2.85
% 2.48/2.85
% 2.48/2.85 resolution(
% 2.48/2.85 clause( 22472, [ theorem( or( X, or( or( not( or( Y, Z ) ), or( or( Z, T )
% 2.48/2.85 , U ) ), Y ) ) ) ] )
% 2.48/2.85 , clause( 14, [ theorem( or( X, Y ) ), ~( theorem( Y ) ) ] )
% 2.48/2.85 , 1, clause( 2732, [ theorem( or( or( not( or( X, Y ) ), or( or( Y, Z ), T
% 2.48/2.85 ) ), X ) ) ] )
% 2.48/2.85 , 0, substitution( 0, [ :=( X, X ), :=( Y, or( or( not( or( Y, Z ) ), or(
% 2.48/2.85 or( Z, T ), U ) ), Y ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, Z ),
% 2.48/2.85 :=( Z, T ), :=( T, U )] )).
% 2.48/2.85
% 2.48/2.85
% 2.48/2.85 subsumption(
% 2.48/2.85 clause( 2735, [ theorem( or( X, or( or( not( or( Y, Z ) ), or( or( Z, T ),
% 2.48/2.85 U ) ), Y ) ) ) ] )
% 2.48/2.85 , clause( 22472, [ theorem( or( X, or( or( not( or( Y, Z ) ), or( or( Z, T
% 2.48/2.85 ), U ) ), Y ) ) ) ] )
% 2.48/2.85 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 2.48/2.85 , U )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.48/2.85
% 2.48/2.85
% 2.48/2.85 resolution(
% 2.48/2.85 clause( 22473, [ theorem( or( or( not( or( X, Y ) ), or( or( Y, Z ), T ) )
% 2.48/2.85 , or( U, X ) ) ) ] )
% 2.48/2.85 , clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z
% 2.48/2.85 ) ) ) ) ] )
% 2.48/2.85 , 1, clause( 2735, [ theorem( or( X, or( or( not( or( Y, Z ) ), or( or( Z,
% 2.48/2.85 T ), U ) ), Y ) ) ) ] )
% 2.48/2.85 , 0, substitution( 0, [ :=( X, or( not( or( X, Y ) ), or( or( Y, Z ), T ) )
% 2.48/2.85 ), :=( Y, U ), :=( Z, X )] ), substitution( 1, [ :=( X, U ), :=( Y, X )
% 2.48/2.85 , :=( Z, Y ), :=( T, Z ), :=( U, T )] )).
% 2.48/2.85
% 2.48/2.85
% 2.48/2.85 subsumption(
% 2.48/2.85 clause( 14317, [ theorem( or( or( not( or( X, Y ) ), or( or( Y, Z ), T ) )
% 2.48/2.85 , or( U, X ) ) ) ] )
% 2.48/2.85 , clause( 22473, [ theorem( or( or( not( or( X, Y ) ), or( or( Y, Z ), T )
% 2.48/2.85 ), or( U, X ) ) ) ] )
% 2.48/2.85 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 2.48/2.85 , U )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.48/2.85
% 2.48/2.85
% 2.48/2.85 resolution(
% 2.48/2.85 clause( 22474, [ theorem( or( or( X, Y ), or( not( or( Y, Z ) ), or( or( Z
% 2.48/2.85 , T ), U ) ) ) ) ] )
% 2.48/2.85 , clause( 12, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 2.48/2.85 , 1, clause( 14317, [ theorem( or( or( not( or( X, Y ) ), or( or( Y, Z ), T
% 2.48/2.85 ) ), or( U, X ) ) ) ] )
% 2.48/2.85 , 0, substitution( 0, [ :=( X, or( X, Y ) ), :=( Y, or( not( or( Y, Z ) ),
% 2.48/2.85 or( or( Z, T ), U ) ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, Z ),
% 2.48/2.85 :=( Z, T ), :=( T, U ), :=( U, X )] )).
% 2.48/2.85
% 2.48/2.85
% 2.48/2.85 subsumption(
% 2.48/2.85 clause( 14320, [ theorem( or( or( X, Y ), or( not( or( Y, Z ) ), or( or( Z
% 2.48/2.85 , T ), U ) ) ) ) ] )
% 2.48/2.85 , clause( 22474, [ theorem( or( or( X, Y ), or( not( or( Y, Z ) ), or( or(
% 2.48/2.85 Z, T ), U ) ) ) ) ] )
% 2.48/2.85 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 2.48/2.85 , U )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.48/2.85
% 2.48/2.85
% 2.48/2.85 resolution(
% 2.48/2.85 clause( 22475, [ theorem( or( not( or( X, Y ) ), or( or( Z, X ), or( or( Y
% 2.48/2.85 , T ), U ) ) ) ) ] )
% 2.48/2.85 , clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z
% 2.48/2.85 ) ) ) ) ] )
% 2.48/2.85 , 1, clause( 14320, [ theorem( or( or( X, Y ), or( not( or( Y, Z ) ), or(
% 2.48/2.85 or( Z, T ), U ) ) ) ) ] )
% 2.48/2.85 , 0, substitution( 0, [ :=( X, not( or( X, Y ) ) ), :=( Y, or( Z, X ) ),
% 2.48/2.85 :=( Z, or( or( Y, T ), U ) )] ), substitution( 1, [ :=( X, Z ), :=( Y, X
% 2.48/2.85 ), :=( Z, Y ), :=( T, T ), :=( U, U )] )).
% 2.48/2.85
% 2.48/2.85
% 2.48/2.85 subsumption(
% 2.48/2.85 clause( 14323, [ theorem( or( not( or( X, Y ) ), or( or( Z, X ), or( or( Y
% 2.48/2.85 , T ), U ) ) ) ) ] )
% 2.48/2.85 , clause( 22475, [ theorem( or( not( or( X, Y ) ), or( or( Z, X ), or( or(
% 2.48/2.85 Y, T ), U ) ) ) ) ] )
% 2.48/2.85 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 2.48/2.85 , U )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.48/2.85
% 2.48/2.85
% 2.48/2.85 resolution(
% 2.48/2.85 clause( 22476, [ theorem( or( not( or( X, Y ) ), or( or( Z, Y ), or( or( X
% 2.48/2.85 , T ), U ) ) ) ) ] )
% 2.48/2.85 , clause( 36, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 2.48/2.85 or( Y, X ) ), Z ) ) ) ] )
% 2.48/2.85 , 1, clause( 14323, [ theorem( or( not( or( X, Y ) ), or( or( Z, X ), or(
% 2.48/2.85 or( Y, T ), U ) ) ) ) ] )
% 2.48/2.85 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, or( or( Z, Y ), or(
% 2.48/2.85 or( X, T ), U ) ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, X ), :=( Z
% 2.48/2.85 , Z ), :=( T, T ), :=( U, U )] )).
% 2.48/2.85
% 2.48/2.85
% 2.48/2.85 subsumption(
% 2.48/2.85 clause( 14326, [ theorem( or( not( or( X, Y ) ), or( or( Z, Y ), or( or( X
% 2.48/2.85 , T ), U ) ) ) ) ] )
% 2.48/2.85 , clause( 22476, [ theorem( or( not( or( X, Y ) ), or( or( Z, Y ), or( or(
% 2.48/2.85 X, T ), U ) ) ) ) ] )
% 2.48/2.85 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 2.48/2.85 , U )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.48/2.85
% 2.48/2.85
% 2.48/2.85 resolution(
% 2.48/2.85 clause( 22477, [ theorem( or( or( X, Y ), or( not( or( Z, Y ) ), or( or( Z
% 2.48/2.85 , T ), U ) ) ) ) ] )
% 2.48/2.85 , clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z
% 2.48/2.85 ) ) ) ) ] )
% 2.48/2.85 , 1, clause( 14326, [ theorem( or( not( or( X, Y ) ), or( or( Z, Y ), or(
% 2.48/2.85 or( X, T ), U ) ) ) ) ] )
% 2.48/2.85 , 0, substitution( 0, [ :=( X, or( X, Y ) ), :=( Y, not( or( Z, Y ) ) ),
% 2.48/2.85 :=( Z, or( or( Z, T ), U ) )] ), substitution( 1, [ :=( X, Z ), :=( Y, Y
% 2.48/2.85 ), :=( Z, X ), :=( T, T ), :=( U, U )] )).
% 2.48/2.85
% 2.48/2.85
% 2.48/2.85 subsumption(
% 2.48/2.85 clause( 14343, [ theorem( or( or( X, Y ), or( not( or( Z, Y ) ), or( or( Z
% 2.48/2.85 , T ), U ) ) ) ) ] )
% 2.48/2.85 , clause( 22477, [ theorem( or( or( X, Y ), or( not( or( Z, Y ) ), or( or(
% 2.48/2.85 Z, T ), U ) ) ) ) ] )
% 2.48/2.85 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 2.48/2.85 , U )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.48/2.85
% 2.48/2.85
% 2.48/2.85 resolution(
% 2.48/2.85 clause( 22478, [ theorem( or( not( or( X, or( or( X, Y ), Z ) ) ), or( or(
% 2.48/2.85 X, Y ), Z ) ) ) ] )
% 2.48/2.85 , clause( 13, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 2.48/2.85 , 1, clause( 14343, [ theorem( or( or( X, Y ), or( not( or( Z, Y ) ), or(
% 2.48/2.85 or( Z, T ), U ) ) ) ) ] )
% 2.48/2.85 , 0, substitution( 0, [ :=( X, or( not( or( X, or( or( X, Y ), Z ) ) ), or(
% 2.48/2.85 or( X, Y ), Z ) ) )] ), substitution( 1, [ :=( X, not( or( X, or( or( X,
% 2.48/2.85 Y ), Z ) ) ) ), :=( Y, or( or( X, Y ), Z ) ), :=( Z, X ), :=( T, Y ),
% 2.48/2.85 :=( U, Z )] )).
% 2.48/2.85
% 2.48/2.85
% 2.48/2.85 subsumption(
% 2.48/2.85 clause( 14347, [ theorem( or( not( or( X, or( or( X, Y ), Z ) ) ), or( or(
% 2.48/2.85 X, Y ), Z ) ) ) ] )
% 2.48/2.85 , clause( 22478, [ theorem( or( not( or( X, or( or( X, Y ), Z ) ) ), or( or(
% 2.48/2.85 X, Y ), Z ) ) ) ] )
% 2.48/2.85 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 2.48/2.85 permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.48/2.85
% 2.48/2.85
% 2.48/2.85 resolution(
% 2.48/2.85 clause( 22479, [ theorem( or( not( or( or( X, Y ), or( X, Z ) ) ), or( or(
% 2.48/2.85 X, Y ), Z ) ) ) ] )
% 2.48/2.85 , clause( 35, [ theorem( or( not( or( X, or( Y, Z ) ) ), T ) ), ~( theorem(
% 2.48/2.85 or( not( or( Y, or( X, Z ) ) ), T ) ) ) ] )
% 2.48/2.85 , 1, clause( 14347, [ theorem( or( not( or( X, or( or( X, Y ), Z ) ) ), or(
% 2.48/2.85 or( X, Y ), Z ) ) ) ] )
% 2.48/2.85 , 0, substitution( 0, [ :=( X, or( X, Y ) ), :=( Y, X ), :=( Z, Z ), :=( T
% 2.48/2.85 , or( or( X, Y ), Z ) )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ),
% 2.48/2.85 :=( Z, Z )] )).
% 2.48/2.85
% 2.48/2.85
% 2.48/2.85 subsumption(
% 2.48/2.85 clause( 21004, [ theorem( or( not( or( or( X, Y ), or( X, Z ) ) ), or( or(
% 2.48/2.85 X, Y ), Z ) ) ) ] )
% 2.48/2.85 , clause( 22479, [ theorem( or( not( or( or( X, Y ), or( X, Z ) ) ), or( or(
% 2.48/2.85 X, Y ), Z ) ) ) ] )
% 2.48/2.85 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 2.48/2.85 permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.48/2.85
% 2.48/2.85
% 2.48/2.85 resolution(
% 2.48/2.85 clause( 22480, [ theorem( or( not( or( or( X, Y ), or( X, Z ) ) ), or( or(
% 2.48/2.85 X, Z ), Y ) ) ) ] )
% 2.48/2.85 , clause( 36, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 2.48/2.85 or( Y, X ) ), Z ) ) ) ] )
% 2.48/2.85 , 1, clause( 21004, [ theorem( or( not( or( or( X, Y ), or( X, Z ) ) ), or(
% 2.48/2.85 or( X, Y ), Z ) ) ) ] )
% 2.48/2.85 , 0, substitution( 0, [ :=( X, or( X, Y ) ), :=( Y, or( X, Z ) ), :=( Z, or(
% 2.48/2.85 or( X, Z ), Y ) )] ), substitution( 1, [ :=( X, X ), :=( Y, Z ), :=( Z, Y
% 2.48/2.85 )] )).
% 2.48/2.85
% 2.48/2.85
% 2.48/2.85 subsumption(
% 2.48/2.85 clause( 21011, [ theorem( or( not( or( or( X, Y ), or( X, Z ) ) ), or( or(
% 2.48/2.85 X, Z ), Y ) ) ) ] )
% 2.48/2.85 , clause( 22480, [ theorem( or( not( or( or( X, Y ), or( X, Z ) ) ), or( or(
% 2.48/2.85 X, Z ), Y ) ) ) ] )
% 2.48/2.85 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 2.48/2.85 permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.48/2.85
% 2.48/2.85
% 2.48/2.85 resolution(
% 2.48/2.85 clause( 22481, [ theorem( or( not( or( X, or( or( X, Y ), Z ) ) ), or( or(
% 2.48/2.85 X, Z ), Y ) ) ) ] )
% 2.48/2.85 , clause( 35, [ theorem( or( not( or( X, or( Y, Z ) ) ), T ) ), ~( theorem(
% 2.48/2.85 or( not( or( Y, or( X, Z ) ) ), T ) ) ) ] )
% 2.48/2.85 , 1, clause( 21011, [ theorem( or( not( or( or( X, Y ), or( X, Z ) ) ), or(
% 2.48/2.85 or( X, Z ), Y ) ) ) ] )
% 2.48/2.85 , 0, substitution( 0, [ :=( X, X ), :=( Y, or( X, Y ) ), :=( Z, Z ), :=( T
% 2.48/2.85 , or( or( X, Z ), Y ) )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ),
% 2.48/2.85 :=( Z, Z )] )).
% 2.48/2.85
% 2.48/2.85
% 2.48/2.85 subsumption(
% 2.48/2.85 clause( 21676, [ theorem( or( not( or( X, or( or( X, Y ), Z ) ) ), or( or(
% 2.48/2.85 X, Z ), Y ) ) ) ] )
% 2.48/2.85 , clause( 22481, [ theorem( or( not( or( X, or( or( X, Y ), Z ) ) ), or( or(
% 2.48/2.85 X, Z ), Y ) ) ) ] )
% 2.48/2.85 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 2.48/2.85 permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.48/2.85
% 2.48/2.85
% 2.48/2.85 resolution(
% 2.48/2.85 clause( 22482, [ theorem( or( not( or( or( X, Y ), Z ) ), or( or( X, Z ), Y
% 2.48/2.85 ) ) ) ] )
% 2.48/2.85 , clause( 38, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( or( Z, X
% 2.48/2.85 ) ), Y ) ) ) ] )
% 2.48/2.85 , 1, clause( 21676, [ theorem( or( not( or( X, or( or( X, Y ), Z ) ) ), or(
% 2.48/2.85 or( X, Z ), Y ) ) ) ] )
% 2.48/2.85 , 0, substitution( 0, [ :=( X, or( or( X, Y ), Z ) ), :=( Y, or( or( X, Z )
% 2.48/2.85 , Y ) ), :=( Z, X )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z
% 2.48/2.85 , Z )] )).
% 2.48/2.85
% 2.48/2.85
% 2.48/2.85 subsumption(
% 2.48/2.85 clause( 22413, [ theorem( or( not( or( or( X, Y ), Z ) ), or( or( X, Z ), Y
% 2.48/2.85 ) ) ) ] )
% 2.48/2.85 , clause( 22482, [ theorem( or( not( or( or( X, Y ), Z ) ), or( or( X, Z )
% 2.48/2.85 , Y ) ) ) ] )
% 2.48/2.85 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 2.48/2.85 permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.48/2.85
% 2.48/2.85
% 2.48/2.85 resolution(
% 2.48/2.85 clause( 22483, [ theorem( or( not( or( X, or( Y, Z ) ) ), or( or( Y, X ), Z
% 2.48/2.85 ) ) ) ] )
% 2.48/2.85 , clause( 36, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 2.48/2.85 or( Y, X ) ), Z ) ) ) ] )
% 2.48/2.85 , 1, clause( 22413, [ theorem( or( not( or( or( X, Y ), Z ) ), or( or( X, Z
% 2.48/2.85 ), Y ) ) ) ] )
% 2.48/2.85 , 0, substitution( 0, [ :=( X, X ), :=( Y, or( Y, Z ) ), :=( Z, or( or( Y,
% 2.48/2.85 X ), Z ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, Z ), :=( Z, X )] )
% 2.48/2.85 ).
% 2.48/2.85
% 2.48/2.85
% 2.48/2.85 subsumption(
% 2.48/2.85 clause( 22421, [ theorem( or( not( or( X, or( Y, Z ) ) ), or( or( Y, X ), Z
% 2.48/2.85 ) ) ) ] )
% 2.48/2.85 , clause( 22483, [ theorem( or( not( or( X, or( Y, Z ) ) ), or( or( Y, X )
% 2.48/2.85 , Z ) ) ) ] )
% 2.48/2.85 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 2.48/2.85 permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.48/2.85
% 2.48/2.85
% 2.48/2.85 resolution(
% 2.48/2.85 clause( 22484, [ theorem( or( not( or( X, or( Y, Z ) ) ), or( or( X, Y ), Z
% 2.48/2.85 ) ) ) ] )
% 2.48/2.85 , clause( 35, [ theorem( or( not( or( X, or( Y, Z ) ) ), T ) ), ~( theorem(
% 2.48/2.85 or( not( or( Y, or( X, Z ) ) ), T ) ) ) ] )
% 2.48/2.85 , 1, clause( 22421, [ theorem( or( not( or( X, or( Y, Z ) ) ), or( or( Y, X
% 2.48/2.85 ), Z ) ) ) ] )
% 2.48/2.85 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, or( or(
% 2.48/2.85 X, Y ), Z ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, X ), :=( Z, Z )] )
% 2.48/2.85 ).
% 2.48/2.85
% 2.48/2.85
% 2.48/2.85 subsumption(
% 2.48/2.85 clause( 22428, [ theorem( or( not( or( X, or( Y, Z ) ) ), or( or( X, Y ), Z
% 2.48/2.85 ) ) ) ] )
% 2.48/2.85 , clause( 22484, [ theorem( or( not( or( X, or( Y, Z ) ) ), or( or( X, Y )
% 2.48/2.85 , Z ) ) ) ] )
% 2.48/2.85 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 2.48/2.85 permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.48/2.85
% 2.48/2.85
% 2.48/2.85 resolution(
% 2.48/2.85 clause( 22485, [] )
% 2.48/2.85 , clause( 8, [ ~( theorem( or( not( or( p, or( q, r ) ) ), or( or( p, q ),
% 2.48/2.85 r ) ) ) ) ] )
% 2.48/2.85 , 0, clause( 22428, [ theorem( or( not( or( X, or( Y, Z ) ) ), or( or( X, Y
% 2.48/2.85 ), Z ) ) ) ] )
% 2.48/2.85 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, p ), :=( Y, q ), :=(
% 2.48/2.85 Z, r )] )).
% 2.48/2.85
% 2.48/2.85
% 2.48/2.85 subsumption(
% 2.48/2.85 clause( 22446, [] )
% 2.48/2.85 , clause( 22485, [] )
% 2.48/2.85 , substitution( 0, [] ), permutation( 0, [] ) ).
% 2.48/2.85
% 2.48/2.85
% 2.48/2.85 end.
% 2.48/2.85
% 2.48/2.85 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 2.48/2.85
% 2.48/2.85 Memory use:
% 2.48/2.85
% 2.48/2.85 space for terms: 408673
% 2.48/2.85 space for clauses: 1783955
% 2.48/2.85
% 2.48/2.85
% 2.48/2.85 clauses generated: 39144
% 2.48/2.85 clauses kept: 22447
% 2.48/2.85 clauses selected: 6494
% 2.48/2.85 clauses deleted: 1058
% 2.48/2.85 clauses inuse deleted: 0
% 2.48/2.85
% 2.48/2.85 subsentry: 18347
% 2.48/2.85 literals s-matched: 18347
% 2.48/2.85 literals matched: 18347
% 2.48/2.85 full subsumption: 0
% 2.48/2.85
% 2.48/2.85 checksum: -1311792816
% 2.48/2.85
% 2.48/2.85
% 2.48/2.85 Bliksem ended
%------------------------------------------------------------------------------