TSTP Solution File: LCL218-10 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL218-10 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n013.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:51 EDT 2022
% Result : Unsatisfiable 11.82s 12.19s
% Output : Refutation 11.82s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LCL218-10 : TPTP v8.1.0. Released v7.3.0.
% 0.12/0.13 % Command : bliksem %s
% 0.12/0.34 % Computer : n013.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % DateTime : Mon Jul 4 18:00:29 EDT 2022
% 0.12/0.34 % CPUTime :
% 11.82/12.19 *** allocated 10000 integers for termspace/termends
% 11.82/12.19 *** allocated 10000 integers for clauses
% 11.82/12.19 *** allocated 10000 integers for justifications
% 11.82/12.19 Bliksem 1.12
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 Automatic Strategy Selection
% 11.82/12.19
% 11.82/12.19 Clauses:
% 11.82/12.19 [
% 11.82/12.19 [ =( ifeq( X, X, Y, Z ), Y ) ],
% 11.82/12.19 [ =( axiom( or( not( or( X, X ) ), X ) ), true ) ],
% 11.82/12.19 [ =( axiom( or( not( X ), or( Y, X ) ) ), true ) ],
% 11.82/12.19 [ =( axiom( or( not( or( X, Y ) ), or( Y, X ) ) ), true ) ],
% 11.82/12.19 [ =( axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) ),
% 11.82/12.19 true ) ],
% 11.82/12.19 [ =( axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) ), or( Z,
% 11.82/12.19 Y ) ) ) ), true ) ],
% 11.82/12.19 [ =( ifeq( axiom( X ), true, theorem( X ), true ), true ) ],
% 11.82/12.19 [ =( ifeq( theorem( X ), true, ifeq( axiom( or( not( X ), Y ) ), true,
% 11.82/12.19 theorem( Y ), true ), true ), true ) ],
% 11.82/12.19 [ =( ifeq( theorem( or( not( X ), Y ) ), true, ifeq( axiom( or( not( Z )
% 11.82/12.19 , X ) ), true, theorem( or( not( Z ), Y ) ), true ), true ), true ) ]
% 11.82/12.19 ,
% 11.82/12.19 [ ~( =( theorem( or( not( or( not( or( p, q ) ), q ) ), or( not( p ), q
% 11.82/12.19 ) ) ), true ) ) ]
% 11.82/12.19 ] .
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 percentage equality = 1.000000, percentage horn = 1.000000
% 11.82/12.19 This is a pure equality problem
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 Options Used:
% 11.82/12.19
% 11.82/12.19 useres = 1
% 11.82/12.19 useparamod = 1
% 11.82/12.19 useeqrefl = 1
% 11.82/12.19 useeqfact = 1
% 11.82/12.19 usefactor = 1
% 11.82/12.19 usesimpsplitting = 0
% 11.82/12.19 usesimpdemod = 5
% 11.82/12.19 usesimpres = 3
% 11.82/12.19
% 11.82/12.19 resimpinuse = 1000
% 11.82/12.19 resimpclauses = 20000
% 11.82/12.19 substype = eqrewr
% 11.82/12.19 backwardsubs = 1
% 11.82/12.19 selectoldest = 5
% 11.82/12.19
% 11.82/12.19 litorderings [0] = split
% 11.82/12.19 litorderings [1] = extend the termordering, first sorting on arguments
% 11.82/12.19
% 11.82/12.19 termordering = kbo
% 11.82/12.19
% 11.82/12.19 litapriori = 0
% 11.82/12.19 termapriori = 1
% 11.82/12.19 litaposteriori = 0
% 11.82/12.19 termaposteriori = 0
% 11.82/12.19 demodaposteriori = 0
% 11.82/12.19 ordereqreflfact = 0
% 11.82/12.19
% 11.82/12.19 litselect = negord
% 11.82/12.19
% 11.82/12.19 maxweight = 15
% 11.82/12.19 maxdepth = 30000
% 11.82/12.19 maxlength = 115
% 11.82/12.19 maxnrvars = 195
% 11.82/12.19 excuselevel = 1
% 11.82/12.19 increasemaxweight = 1
% 11.82/12.19
% 11.82/12.19 maxselected = 10000000
% 11.82/12.19 maxnrclauses = 10000000
% 11.82/12.19
% 11.82/12.19 showgenerated = 0
% 11.82/12.19 showkept = 0
% 11.82/12.19 showselected = 0
% 11.82/12.19 showdeleted = 0
% 11.82/12.19 showresimp = 1
% 11.82/12.19 showstatus = 2000
% 11.82/12.19
% 11.82/12.19 prologoutput = 1
% 11.82/12.19 nrgoals = 5000000
% 11.82/12.19 totalproof = 1
% 11.82/12.19
% 11.82/12.19 Symbols occurring in the translation:
% 11.82/12.19
% 11.82/12.19 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 11.82/12.19 . [1, 2] (w:1, o:26, a:1, s:1, b:0),
% 11.82/12.19 ! [4, 1] (w:0, o:18, a:1, s:1, b:0),
% 11.82/12.19 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 11.82/12.19 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 11.82/12.19 ifeq [42, 4] (w:1, o:52, a:1, s:1, b:0),
% 11.82/12.19 or [43, 2] (w:1, o:51, a:1, s:1, b:0),
% 11.82/12.19 not [44, 1] (w:1, o:23, a:1, s:1, b:0),
% 11.82/12.19 axiom [45, 1] (w:1, o:24, a:1, s:1, b:0),
% 11.82/12.19 true [46, 0] (w:1, o:12, a:1, s:1, b:0),
% 11.82/12.19 theorem [48, 1] (w:1, o:25, a:1, s:1, b:0),
% 11.82/12.19 p [51, 0] (w:1, o:16, a:1, s:1, b:0),
% 11.82/12.19 q [52, 0] (w:1, o:17, a:1, s:1, b:0).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 Starting Search:
% 11.82/12.19
% 11.82/12.19 Resimplifying inuse:
% 11.82/12.19 Done
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 Intermediate Status:
% 11.82/12.19 Generated: 1099914
% 11.82/12.19 Kept: 2001
% 11.82/12.19 Inuse: 1725
% 11.82/12.19 Deleted: 5
% 11.82/12.19 Deletedinuse: 0
% 11.82/12.19
% 11.82/12.19 Resimplifying inuse:
% 11.82/12.19 Done
% 11.82/12.19
% 11.82/12.19 Resimplifying inuse:
% 11.82/12.19 Done
% 11.82/12.19
% 11.82/12.19 Failed to find proof!
% 11.82/12.19 maxweight = 15
% 11.82/12.19 maxnrclauses = 10000000
% 11.82/12.19 Generated: 2440143
% 11.82/12.19 Kept: 2457
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 The strategy used was not complete!
% 11.82/12.19
% 11.82/12.19 Increased maxweight to 16
% 11.82/12.19
% 11.82/12.19 Starting Search:
% 11.82/12.19
% 11.82/12.19 Resimplifying inuse:
% 11.82/12.19 Done
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 Intermediate Status:
% 11.82/12.19 Generated: 1053719
% 11.82/12.19 Kept: 2000
% 11.82/12.19 Inuse: 1709
% 11.82/12.19 Deleted: 18
% 11.82/12.19 Deletedinuse: 0
% 11.82/12.19
% 11.82/12.19 Resimplifying inuse:
% 11.82/12.19 Done
% 11.82/12.19
% 11.82/12.19 Resimplifying inuse:
% 11.82/12.19 Done
% 11.82/12.19
% 11.82/12.19 Failed to find proof!
% 11.82/12.19 maxweight = 16
% 11.82/12.19 maxnrclauses = 10000000
% 11.82/12.19 Generated: 2466994
% 11.82/12.19 Kept: 2514
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 The strategy used was not complete!
% 11.82/12.19
% 11.82/12.19 Increased maxweight to 17
% 11.82/12.19
% 11.82/12.19 Starting Search:
% 11.82/12.19
% 11.82/12.19 Resimplifying inuse:
% 11.82/12.19 Done
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 Intermediate Status:
% 11.82/12.19 Generated: 206994
% 11.82/12.19 Kept: 2002
% 11.82/12.19 Inuse: 765
% 11.82/12.19 Deleted: 15
% 11.82/12.19 Deletedinuse: 0
% 11.82/12.19
% 11.82/12.19 Resimplifying inuse:
% 11.82/12.19 Done
% 11.82/12.19
% 11.82/12.19 Resimplifying inuse:
% 11.82/12.19 Done
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 Intermediate Status:
% 11.82/12.19 Generated: 1140167
% 11.82/12.19 Kept: 4007
% 11.82/12.19 Inuse: 1956
% 11.82/12.19 Deleted: 18
% 11.82/12.19 Deletedinuse: 0
% 11.82/12.19
% 11.82/12.19 Resimplifying inuse:
% 11.82/12.19 Done
% 11.82/12.19
% 11.82/12.19 Resimplifying inuse:
% 11.82/12.19 Done
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 Bliksems!, er is een bewijs:
% 11.82/12.19 % SZS status Unsatisfiable
% 11.82/12.19 % SZS output start Refutation
% 11.82/12.19
% 11.82/12.19 clause( 0, [ =( ifeq( X, X, Y, Z ), Y ) ] )
% 11.82/12.19 .
% 11.82/12.19 clause( 2, [ =( axiom( or( not( X ), or( Y, X ) ) ), true ) ] )
% 11.82/12.19 .
% 11.82/12.19 clause( 3, [ =( axiom( or( not( or( X, Y ) ), or( Y, X ) ) ), true ) ] )
% 11.82/12.19 .
% 11.82/12.19 clause( 4, [ =( axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) )
% 11.82/12.19 ) ), true ) ] )
% 11.82/12.19 .
% 11.82/12.19 clause( 6, [ =( ifeq( axiom( X ), true, theorem( X ), true ), true ) ] )
% 11.82/12.19 .
% 11.82/12.19 clause( 7, [ =( ifeq( theorem( X ), true, ifeq( axiom( or( not( X ), Y ) )
% 11.82/12.19 , true, theorem( Y ), true ), true ), true ) ] )
% 11.82/12.19 .
% 11.82/12.19 clause( 8, [ =( ifeq( theorem( or( not( X ), Y ) ), true, ifeq( axiom( or(
% 11.82/12.19 not( Z ), X ) ), true, theorem( or( not( Z ), Y ) ), true ), true ), true
% 11.82/12.19 ) ] )
% 11.82/12.19 .
% 11.82/12.19 clause( 9, [ ~( =( theorem( or( not( or( not( or( p, q ) ), q ) ), or( not(
% 11.82/12.19 p ), q ) ) ), true ) ) ] )
% 11.82/12.19 .
% 11.82/12.19 clause( 12, [ =( theorem( or( not( or( X, Y ) ), or( Y, X ) ) ), true ) ]
% 11.82/12.19 )
% 11.82/12.19 .
% 11.82/12.19 clause( 16, [ =( ifeq( theorem( or( X, or( Y, Z ) ) ), true, theorem( or( Y
% 11.82/12.19 , or( X, Z ) ) ), true ), true ) ] )
% 11.82/12.19 .
% 11.82/12.19 clause( 33, [ =( ifeq( theorem( or( not( or( Y, X ) ), Z ) ), true, theorem(
% 11.82/12.19 or( not( or( X, Y ) ), Z ) ), true ), true ) ] )
% 11.82/12.19 .
% 11.82/12.19 clause( 36, [ =( ifeq( theorem( or( not( or( Y, X ) ), Z ) ), true, theorem(
% 11.82/12.19 or( not( X ), Z ) ), true ), true ) ] )
% 11.82/12.19 .
% 11.82/12.19 clause( 57, [ =( theorem( or( Y, or( not( or( X, Y ) ), X ) ) ), true ) ]
% 11.82/12.19 )
% 11.82/12.19 .
% 11.82/12.19 clause( 230, [ =( theorem( or( not( or( Y, X ) ), or( not( or( Z, not( or(
% 11.82/12.19 X, Y ) ) ) ), Z ) ) ), true ) ] )
% 11.82/12.19 .
% 11.82/12.19 clause( 1735, [ =( theorem( or( not( Y ), or( not( or( Z, not( or( Y, X ) )
% 11.82/12.19 ) ), Z ) ) ), true ) ] )
% 11.82/12.19 .
% 11.82/12.19 clause( 5365, [ =( theorem( or( not( or( Y, not( or( X, Z ) ) ) ), or( not(
% 11.82/12.19 X ), Y ) ) ), true ) ] )
% 11.82/12.19 .
% 11.82/12.19 clause( 5368, [ =( theorem( or( not( or( not( or( Y, Z ) ), X ) ), or( not(
% 11.82/12.19 Y ), X ) ) ), true ) ] )
% 11.82/12.19 .
% 11.82/12.19 clause( 5371, [] )
% 11.82/12.19 .
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 % SZS output end Refutation
% 11.82/12.19 found a proof!
% 11.82/12.19
% 11.82/12.19 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 11.82/12.19
% 11.82/12.19 initialclauses(
% 11.82/12.19 [ clause( 5373, [ =( ifeq( X, X, Y, Z ), Y ) ] )
% 11.82/12.19 , clause( 5374, [ =( axiom( or( not( or( X, X ) ), X ) ), true ) ] )
% 11.82/12.19 , clause( 5375, [ =( axiom( or( not( X ), or( Y, X ) ) ), true ) ] )
% 11.82/12.19 , clause( 5376, [ =( axiom( or( not( or( X, Y ) ), or( Y, X ) ) ), true ) ]
% 11.82/12.19 )
% 11.82/12.19 , clause( 5377, [ =( axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z
% 11.82/12.19 ) ) ) ), true ) ] )
% 11.82/12.19 , clause( 5378, [ =( axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X
% 11.82/12.19 ) ), or( Z, Y ) ) ) ), true ) ] )
% 11.82/12.19 , clause( 5379, [ =( ifeq( axiom( X ), true, theorem( X ), true ), true ) ]
% 11.82/12.19 )
% 11.82/12.19 , clause( 5380, [ =( ifeq( theorem( X ), true, ifeq( axiom( or( not( X ), Y
% 11.82/12.19 ) ), true, theorem( Y ), true ), true ), true ) ] )
% 11.82/12.19 , clause( 5381, [ =( ifeq( theorem( or( not( X ), Y ) ), true, ifeq( axiom(
% 11.82/12.19 or( not( Z ), X ) ), true, theorem( or( not( Z ), Y ) ), true ), true ),
% 11.82/12.19 true ) ] )
% 11.82/12.19 , clause( 5382, [ ~( =( theorem( or( not( or( not( or( p, q ) ), q ) ), or(
% 11.82/12.19 not( p ), q ) ) ), true ) ) ] )
% 11.82/12.19 ] ).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 subsumption(
% 11.82/12.19 clause( 0, [ =( ifeq( X, X, Y, Z ), Y ) ] )
% 11.82/12.19 , clause( 5373, [ =( ifeq( X, X, Y, Z ), Y ) ] )
% 11.82/12.19 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 11.82/12.19 permutation( 0, [ ==>( 0, 0 )] ) ).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 subsumption(
% 11.82/12.19 clause( 2, [ =( axiom( or( not( X ), or( Y, X ) ) ), true ) ] )
% 11.82/12.19 , clause( 5375, [ =( axiom( or( not( X ), or( Y, X ) ) ), true ) ] )
% 11.82/12.19 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 11.82/12.19 )] ) ).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 subsumption(
% 11.82/12.19 clause( 3, [ =( axiom( or( not( or( X, Y ) ), or( Y, X ) ) ), true ) ] )
% 11.82/12.19 , clause( 5376, [ =( axiom( or( not( or( X, Y ) ), or( Y, X ) ) ), true ) ]
% 11.82/12.19 )
% 11.82/12.19 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 11.82/12.19 )] ) ).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 subsumption(
% 11.82/12.19 clause( 4, [ =( axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) )
% 11.82/12.19 ) ), true ) ] )
% 11.82/12.19 , clause( 5377, [ =( axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z
% 11.82/12.19 ) ) ) ), true ) ] )
% 11.82/12.19 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 11.82/12.19 permutation( 0, [ ==>( 0, 0 )] ) ).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 subsumption(
% 11.82/12.19 clause( 6, [ =( ifeq( axiom( X ), true, theorem( X ), true ), true ) ] )
% 11.82/12.19 , clause( 5379, [ =( ifeq( axiom( X ), true, theorem( X ), true ), true ) ]
% 11.82/12.19 )
% 11.82/12.19 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 subsumption(
% 11.82/12.19 clause( 7, [ =( ifeq( theorem( X ), true, ifeq( axiom( or( not( X ), Y ) )
% 11.82/12.19 , true, theorem( Y ), true ), true ), true ) ] )
% 11.82/12.19 , clause( 5380, [ =( ifeq( theorem( X ), true, ifeq( axiom( or( not( X ), Y
% 11.82/12.19 ) ), true, theorem( Y ), true ), true ), true ) ] )
% 11.82/12.19 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 11.82/12.19 )] ) ).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 subsumption(
% 11.82/12.19 clause( 8, [ =( ifeq( theorem( or( not( X ), Y ) ), true, ifeq( axiom( or(
% 11.82/12.19 not( Z ), X ) ), true, theorem( or( not( Z ), Y ) ), true ), true ), true
% 11.82/12.19 ) ] )
% 11.82/12.19 , clause( 5381, [ =( ifeq( theorem( or( not( X ), Y ) ), true, ifeq( axiom(
% 11.82/12.19 or( not( Z ), X ) ), true, theorem( or( not( Z ), Y ) ), true ), true ),
% 11.82/12.19 true ) ] )
% 11.82/12.19 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 11.82/12.19 permutation( 0, [ ==>( 0, 0 )] ) ).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 subsumption(
% 11.82/12.19 clause( 9, [ ~( =( theorem( or( not( or( not( or( p, q ) ), q ) ), or( not(
% 11.82/12.19 p ), q ) ) ), true ) ) ] )
% 11.82/12.19 , clause( 5382, [ ~( =( theorem( or( not( or( not( or( p, q ) ), q ) ), or(
% 11.82/12.19 not( p ), q ) ) ), true ) ) ] )
% 11.82/12.19 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 eqswap(
% 11.82/12.19 clause( 5431, [ =( true, ifeq( axiom( X ), true, theorem( X ), true ) ) ]
% 11.82/12.19 )
% 11.82/12.19 , clause( 6, [ =( ifeq( axiom( X ), true, theorem( X ), true ), true ) ] )
% 11.82/12.19 , 0, substitution( 0, [ :=( X, X )] )).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 paramod(
% 11.82/12.19 clause( 5433, [ =( true, ifeq( true, true, theorem( or( not( or( X, Y ) ),
% 11.82/12.19 or( Y, X ) ) ), true ) ) ] )
% 11.82/12.19 , clause( 3, [ =( axiom( or( not( or( X, Y ) ), or( Y, X ) ) ), true ) ] )
% 11.82/12.19 , 0, clause( 5431, [ =( true, ifeq( axiom( X ), true, theorem( X ), true )
% 11.82/12.19 ) ] )
% 11.82/12.19 , 0, 3, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [
% 11.82/12.19 :=( X, or( not( or( X, Y ) ), or( Y, X ) ) )] )).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 paramod(
% 11.82/12.19 clause( 5434, [ =( true, theorem( or( not( or( X, Y ) ), or( Y, X ) ) ) ) ]
% 11.82/12.19 )
% 11.82/12.19 , clause( 0, [ =( ifeq( X, X, Y, Z ), Y ) ] )
% 11.82/12.19 , 0, clause( 5433, [ =( true, ifeq( true, true, theorem( or( not( or( X, Y
% 11.82/12.19 ) ), or( Y, X ) ) ), true ) ) ] )
% 11.82/12.19 , 0, 2, substitution( 0, [ :=( X, true ), :=( Y, theorem( or( not( or( X, Y
% 11.82/12.19 ) ), or( Y, X ) ) ) ), :=( Z, true )] ), substitution( 1, [ :=( X, X ),
% 11.82/12.19 :=( Y, Y )] )).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 eqswap(
% 11.82/12.19 clause( 5435, [ =( theorem( or( not( or( X, Y ) ), or( Y, X ) ) ), true ) ]
% 11.82/12.19 )
% 11.82/12.19 , clause( 5434, [ =( true, theorem( or( not( or( X, Y ) ), or( Y, X ) ) ) )
% 11.82/12.19 ] )
% 11.82/12.19 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 subsumption(
% 11.82/12.19 clause( 12, [ =( theorem( or( not( or( X, Y ) ), or( Y, X ) ) ), true ) ]
% 11.82/12.19 )
% 11.82/12.19 , clause( 5435, [ =( theorem( or( not( or( X, Y ) ), or( Y, X ) ) ), true )
% 11.82/12.19 ] )
% 11.82/12.19 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 11.82/12.19 )] ) ).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 eqswap(
% 11.82/12.19 clause( 5437, [ =( true, ifeq( theorem( X ), true, ifeq( axiom( or( not( X
% 11.82/12.19 ), Y ) ), true, theorem( Y ), true ), true ) ) ] )
% 11.82/12.19 , clause( 7, [ =( ifeq( theorem( X ), true, ifeq( axiom( or( not( X ), Y )
% 11.82/12.19 ), true, theorem( Y ), true ), true ), true ) ] )
% 11.82/12.19 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 paramod(
% 11.82/12.19 clause( 5439, [ =( true, ifeq( theorem( or( X, or( Y, Z ) ) ), true, ifeq(
% 11.82/12.19 true, true, theorem( or( Y, or( X, Z ) ) ), true ), true ) ) ] )
% 11.82/12.19 , clause( 4, [ =( axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z )
% 11.82/12.19 ) ) ), true ) ] )
% 11.82/12.19 , 0, clause( 5437, [ =( true, ifeq( theorem( X ), true, ifeq( axiom( or(
% 11.82/12.19 not( X ), Y ) ), true, theorem( Y ), true ), true ) ) ] )
% 11.82/12.19 , 0, 11, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 11.82/12.19 substitution( 1, [ :=( X, or( X, or( Y, Z ) ) ), :=( Y, or( Y, or( X, Z )
% 11.82/12.19 ) )] )).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 paramod(
% 11.82/12.19 clause( 5440, [ =( true, ifeq( theorem( or( X, or( Y, Z ) ) ), true,
% 11.82/12.19 theorem( or( Y, or( X, Z ) ) ), true ) ) ] )
% 11.82/12.19 , clause( 0, [ =( ifeq( X, X, Y, Z ), Y ) ] )
% 11.82/12.19 , 0, clause( 5439, [ =( true, ifeq( theorem( or( X, or( Y, Z ) ) ), true,
% 11.82/12.19 ifeq( true, true, theorem( or( Y, or( X, Z ) ) ), true ), true ) ) ] )
% 11.82/12.19 , 0, 10, substitution( 0, [ :=( X, true ), :=( Y, theorem( or( Y, or( X, Z
% 11.82/12.19 ) ) ) ), :=( Z, true )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ),
% 11.82/12.19 :=( Z, Z )] )).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 eqswap(
% 11.82/12.19 clause( 5441, [ =( ifeq( theorem( or( X, or( Y, Z ) ) ), true, theorem( or(
% 11.82/12.19 Y, or( X, Z ) ) ), true ), true ) ] )
% 11.82/12.19 , clause( 5440, [ =( true, ifeq( theorem( or( X, or( Y, Z ) ) ), true,
% 11.82/12.19 theorem( or( Y, or( X, Z ) ) ), true ) ) ] )
% 11.82/12.19 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 subsumption(
% 11.82/12.19 clause( 16, [ =( ifeq( theorem( or( X, or( Y, Z ) ) ), true, theorem( or( Y
% 11.82/12.19 , or( X, Z ) ) ), true ), true ) ] )
% 11.82/12.19 , clause( 5441, [ =( ifeq( theorem( or( X, or( Y, Z ) ) ), true, theorem(
% 11.82/12.19 or( Y, or( X, Z ) ) ), true ), true ) ] )
% 11.82/12.19 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 11.82/12.19 permutation( 0, [ ==>( 0, 0 )] ) ).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 eqswap(
% 11.82/12.19 clause( 5443, [ =( true, ifeq( theorem( or( not( X ), Y ) ), true, ifeq(
% 11.82/12.19 axiom( or( not( Z ), X ) ), true, theorem( or( not( Z ), Y ) ), true ),
% 11.82/12.19 true ) ) ] )
% 11.82/12.19 , clause( 8, [ =( ifeq( theorem( or( not( X ), Y ) ), true, ifeq( axiom( or(
% 11.82/12.19 not( Z ), X ) ), true, theorem( or( not( Z ), Y ) ), true ), true ), true
% 11.82/12.19 ) ] )
% 11.82/12.19 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 paramod(
% 11.82/12.19 clause( 5445, [ =( true, ifeq( theorem( or( not( or( X, Y ) ), Z ) ), true
% 11.82/12.19 , ifeq( true, true, theorem( or( not( or( Y, X ) ), Z ) ), true ), true )
% 11.82/12.19 ) ] )
% 11.82/12.19 , clause( 3, [ =( axiom( or( not( or( X, Y ) ), or( Y, X ) ) ), true ) ] )
% 11.82/12.19 , 0, clause( 5443, [ =( true, ifeq( theorem( or( not( X ), Y ) ), true,
% 11.82/12.19 ifeq( axiom( or( not( Z ), X ) ), true, theorem( or( not( Z ), Y ) ),
% 11.82/12.19 true ), true ) ) ] )
% 11.82/12.19 , 0, 12, substitution( 0, [ :=( X, Y ), :=( Y, X )] ), substitution( 1, [
% 11.82/12.19 :=( X, or( X, Y ) ), :=( Y, Z ), :=( Z, or( Y, X ) )] )).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 paramod(
% 11.82/12.19 clause( 5446, [ =( true, ifeq( theorem( or( not( or( X, Y ) ), Z ) ), true
% 11.82/12.19 , theorem( or( not( or( Y, X ) ), Z ) ), true ) ) ] )
% 11.82/12.19 , clause( 0, [ =( ifeq( X, X, Y, Z ), Y ) ] )
% 11.82/12.19 , 0, clause( 5445, [ =( true, ifeq( theorem( or( not( or( X, Y ) ), Z ) ),
% 11.82/12.19 true, ifeq( true, true, theorem( or( not( or( Y, X ) ), Z ) ), true ),
% 11.82/12.19 true ) ) ] )
% 11.82/12.19 , 0, 11, substitution( 0, [ :=( X, true ), :=( Y, theorem( or( not( or( Y,
% 11.82/12.19 X ) ), Z ) ) ), :=( Z, true )] ), substitution( 1, [ :=( X, X ), :=( Y, Y
% 11.82/12.19 ), :=( Z, Z )] )).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 eqswap(
% 11.82/12.19 clause( 5447, [ =( ifeq( theorem( or( not( or( X, Y ) ), Z ) ), true,
% 11.82/12.19 theorem( or( not( or( Y, X ) ), Z ) ), true ), true ) ] )
% 11.82/12.19 , clause( 5446, [ =( true, ifeq( theorem( or( not( or( X, Y ) ), Z ) ),
% 11.82/12.19 true, theorem( or( not( or( Y, X ) ), Z ) ), true ) ) ] )
% 11.82/12.19 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 subsumption(
% 11.82/12.19 clause( 33, [ =( ifeq( theorem( or( not( or( Y, X ) ), Z ) ), true, theorem(
% 11.82/12.19 or( not( or( X, Y ) ), Z ) ), true ), true ) ] )
% 11.82/12.19 , clause( 5447, [ =( ifeq( theorem( or( not( or( X, Y ) ), Z ) ), true,
% 11.82/12.19 theorem( or( not( or( Y, X ) ), Z ) ), true ), true ) ] )
% 11.82/12.19 , substitution( 0, [ :=( X, Y ), :=( Y, X ), :=( Z, Z )] ),
% 11.82/12.19 permutation( 0, [ ==>( 0, 0 )] ) ).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 eqswap(
% 11.82/12.19 clause( 5449, [ =( true, ifeq( theorem( or( not( X ), Y ) ), true, ifeq(
% 11.82/12.19 axiom( or( not( Z ), X ) ), true, theorem( or( not( Z ), Y ) ), true ),
% 11.82/12.19 true ) ) ] )
% 11.82/12.19 , clause( 8, [ =( ifeq( theorem( or( not( X ), Y ) ), true, ifeq( axiom( or(
% 11.82/12.19 not( Z ), X ) ), true, theorem( or( not( Z ), Y ) ), true ), true ), true
% 11.82/12.19 ) ] )
% 11.82/12.19 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 paramod(
% 11.82/12.19 clause( 5451, [ =( true, ifeq( theorem( or( not( or( X, Y ) ), Z ) ), true
% 11.82/12.19 , ifeq( true, true, theorem( or( not( Y ), Z ) ), true ), true ) ) ] )
% 11.82/12.19 , clause( 2, [ =( axiom( or( not( X ), or( Y, X ) ) ), true ) ] )
% 11.82/12.19 , 0, clause( 5449, [ =( true, ifeq( theorem( or( not( X ), Y ) ), true,
% 11.82/12.19 ifeq( axiom( or( not( Z ), X ) ), true, theorem( or( not( Z ), Y ) ),
% 11.82/12.19 true ), true ) ) ] )
% 11.82/12.19 , 0, 12, substitution( 0, [ :=( X, Y ), :=( Y, X )] ), substitution( 1, [
% 11.82/12.19 :=( X, or( X, Y ) ), :=( Y, Z ), :=( Z, Y )] )).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 paramod(
% 11.82/12.19 clause( 5452, [ =( true, ifeq( theorem( or( not( or( X, Y ) ), Z ) ), true
% 11.82/12.19 , theorem( or( not( Y ), Z ) ), true ) ) ] )
% 11.82/12.19 , clause( 0, [ =( ifeq( X, X, Y, Z ), Y ) ] )
% 11.82/12.19 , 0, clause( 5451, [ =( true, ifeq( theorem( or( not( or( X, Y ) ), Z ) ),
% 11.82/12.19 true, ifeq( true, true, theorem( or( not( Y ), Z ) ), true ), true ) ) ]
% 11.82/12.19 )
% 11.82/12.19 , 0, 11, substitution( 0, [ :=( X, true ), :=( Y, theorem( or( not( Y ), Z
% 11.82/12.19 ) ) ), :=( Z, true )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ), :=(
% 11.82/12.19 Z, Z )] )).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 eqswap(
% 11.82/12.19 clause( 5453, [ =( ifeq( theorem( or( not( or( X, Y ) ), Z ) ), true,
% 11.82/12.19 theorem( or( not( Y ), Z ) ), true ), true ) ] )
% 11.82/12.19 , clause( 5452, [ =( true, ifeq( theorem( or( not( or( X, Y ) ), Z ) ),
% 11.82/12.19 true, theorem( or( not( Y ), Z ) ), true ) ) ] )
% 11.82/12.19 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 subsumption(
% 11.82/12.19 clause( 36, [ =( ifeq( theorem( or( not( or( Y, X ) ), Z ) ), true, theorem(
% 11.82/12.19 or( not( X ), Z ) ), true ), true ) ] )
% 11.82/12.19 , clause( 5453, [ =( ifeq( theorem( or( not( or( X, Y ) ), Z ) ), true,
% 11.82/12.19 theorem( or( not( Y ), Z ) ), true ), true ) ] )
% 11.82/12.19 , substitution( 0, [ :=( X, Y ), :=( Y, X ), :=( Z, Z )] ),
% 11.82/12.19 permutation( 0, [ ==>( 0, 0 )] ) ).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 eqswap(
% 11.82/12.19 clause( 5455, [ =( true, ifeq( theorem( or( X, or( Y, Z ) ) ), true,
% 11.82/12.19 theorem( or( Y, or( X, Z ) ) ), true ) ) ] )
% 11.82/12.19 , clause( 16, [ =( ifeq( theorem( or( X, or( Y, Z ) ) ), true, theorem( or(
% 11.82/12.19 Y, or( X, Z ) ) ), true ), true ) ] )
% 11.82/12.19 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 paramod(
% 11.82/12.19 clause( 5457, [ =( true, ifeq( true, true, theorem( or( Y, or( not( or( X,
% 11.82/12.19 Y ) ), X ) ) ), true ) ) ] )
% 11.82/12.19 , clause( 12, [ =( theorem( or( not( or( X, Y ) ), or( Y, X ) ) ), true ) ]
% 11.82/12.19 )
% 11.82/12.19 , 0, clause( 5455, [ =( true, ifeq( theorem( or( X, or( Y, Z ) ) ), true,
% 11.82/12.19 theorem( or( Y, or( X, Z ) ) ), true ) ) ] )
% 11.82/12.19 , 0, 3, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [
% 11.82/12.19 :=( X, not( or( X, Y ) ) ), :=( Y, Y ), :=( Z, X )] )).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 paramod(
% 11.82/12.19 clause( 5459, [ =( true, theorem( or( X, or( not( or( Y, X ) ), Y ) ) ) ) ]
% 11.82/12.19 )
% 11.82/12.19 , clause( 0, [ =( ifeq( X, X, Y, Z ), Y ) ] )
% 11.82/12.19 , 0, clause( 5457, [ =( true, ifeq( true, true, theorem( or( Y, or( not( or(
% 11.82/12.19 X, Y ) ), X ) ) ), true ) ) ] )
% 11.82/12.19 , 0, 2, substitution( 0, [ :=( X, true ), :=( Y, theorem( or( X, or( not(
% 11.82/12.19 or( Y, X ) ), Y ) ) ) ), :=( Z, true )] ), substitution( 1, [ :=( X, Y )
% 11.82/12.19 , :=( Y, X )] )).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 eqswap(
% 11.82/12.19 clause( 5460, [ =( theorem( or( X, or( not( or( Y, X ) ), Y ) ) ), true ) ]
% 11.82/12.19 )
% 11.82/12.19 , clause( 5459, [ =( true, theorem( or( X, or( not( or( Y, X ) ), Y ) ) ) )
% 11.82/12.19 ] )
% 11.82/12.19 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 subsumption(
% 11.82/12.19 clause( 57, [ =( theorem( or( Y, or( not( or( X, Y ) ), X ) ) ), true ) ]
% 11.82/12.19 )
% 11.82/12.19 , clause( 5460, [ =( theorem( or( X, or( not( or( Y, X ) ), Y ) ) ), true )
% 11.82/12.19 ] )
% 11.82/12.19 , substitution( 0, [ :=( X, Y ), :=( Y, X )] ), permutation( 0, [ ==>( 0, 0
% 11.82/12.19 )] ) ).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 eqswap(
% 11.82/12.19 clause( 5462, [ =( true, ifeq( theorem( or( not( or( X, Y ) ), Z ) ), true
% 11.82/12.19 , theorem( or( not( or( Y, X ) ), Z ) ), true ) ) ] )
% 11.82/12.19 , clause( 33, [ =( ifeq( theorem( or( not( or( Y, X ) ), Z ) ), true,
% 11.82/12.19 theorem( or( not( or( X, Y ) ), Z ) ), true ), true ) ] )
% 11.82/12.19 , 0, substitution( 0, [ :=( X, Y ), :=( Y, X ), :=( Z, Z )] )).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 paramod(
% 11.82/12.19 clause( 5464, [ =( true, ifeq( true, true, theorem( or( not( or( Y, X ) ),
% 11.82/12.19 or( not( or( Z, not( or( X, Y ) ) ) ), Z ) ) ), true ) ) ] )
% 11.82/12.19 , clause( 57, [ =( theorem( or( Y, or( not( or( X, Y ) ), X ) ) ), true ) ]
% 11.82/12.19 )
% 11.82/12.19 , 0, clause( 5462, [ =( true, ifeq( theorem( or( not( or( X, Y ) ), Z ) ),
% 11.82/12.19 true, theorem( or( not( or( Y, X ) ), Z ) ), true ) ) ] )
% 11.82/12.19 , 0, 3, substitution( 0, [ :=( X, Z ), :=( Y, not( or( X, Y ) ) )] ),
% 11.82/12.19 substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, or( not( or( Z, not( or(
% 11.82/12.19 X, Y ) ) ) ), Z ) )] )).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 paramod(
% 11.82/12.19 clause( 5466, [ =( true, theorem( or( not( or( X, Y ) ), or( not( or( Z,
% 11.82/12.19 not( or( Y, X ) ) ) ), Z ) ) ) ) ] )
% 11.82/12.19 , clause( 0, [ =( ifeq( X, X, Y, Z ), Y ) ] )
% 11.82/12.19 , 0, clause( 5464, [ =( true, ifeq( true, true, theorem( or( not( or( Y, X
% 11.82/12.19 ) ), or( not( or( Z, not( or( X, Y ) ) ) ), Z ) ) ), true ) ) ] )
% 11.82/12.19 , 0, 2, substitution( 0, [ :=( X, true ), :=( Y, theorem( or( not( or( X, Y
% 11.82/12.19 ) ), or( not( or( Z, not( or( Y, X ) ) ) ), Z ) ) ) ), :=( Z, true )] )
% 11.82/12.19 , substitution( 1, [ :=( X, Y ), :=( Y, X ), :=( Z, Z )] )).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 eqswap(
% 11.82/12.19 clause( 5467, [ =( theorem( or( not( or( X, Y ) ), or( not( or( Z, not( or(
% 11.82/12.19 Y, X ) ) ) ), Z ) ) ), true ) ] )
% 11.82/12.19 , clause( 5466, [ =( true, theorem( or( not( or( X, Y ) ), or( not( or( Z,
% 11.82/12.19 not( or( Y, X ) ) ) ), Z ) ) ) ) ] )
% 11.82/12.19 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 subsumption(
% 11.82/12.19 clause( 230, [ =( theorem( or( not( or( Y, X ) ), or( not( or( Z, not( or(
% 11.82/12.19 X, Y ) ) ) ), Z ) ) ), true ) ] )
% 11.82/12.19 , clause( 5467, [ =( theorem( or( not( or( X, Y ) ), or( not( or( Z, not(
% 11.82/12.19 or( Y, X ) ) ) ), Z ) ) ), true ) ] )
% 11.82/12.19 , substitution( 0, [ :=( X, Y ), :=( Y, X ), :=( Z, Z )] ),
% 11.82/12.19 permutation( 0, [ ==>( 0, 0 )] ) ).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 eqswap(
% 11.82/12.19 clause( 5469, [ =( true, ifeq( theorem( or( not( or( X, Y ) ), Z ) ), true
% 11.82/12.19 , theorem( or( not( Y ), Z ) ), true ) ) ] )
% 11.82/12.19 , clause( 36, [ =( ifeq( theorem( or( not( or( Y, X ) ), Z ) ), true,
% 11.82/12.19 theorem( or( not( X ), Z ) ), true ), true ) ] )
% 11.82/12.19 , 0, substitution( 0, [ :=( X, Y ), :=( Y, X ), :=( Z, Z )] )).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 paramod(
% 11.82/12.19 clause( 5471, [ =( true, ifeq( true, true, theorem( or( not( Y ), or( not(
% 11.82/12.19 or( Z, not( or( Y, X ) ) ) ), Z ) ) ), true ) ) ] )
% 11.82/12.19 , clause( 230, [ =( theorem( or( not( or( Y, X ) ), or( not( or( Z, not( or(
% 11.82/12.19 X, Y ) ) ) ), Z ) ) ), true ) ] )
% 11.82/12.19 , 0, clause( 5469, [ =( true, ifeq( theorem( or( not( or( X, Y ) ), Z ) ),
% 11.82/12.19 true, theorem( or( not( Y ), Z ) ), true ) ) ] )
% 11.82/12.19 , 0, 3, substitution( 0, [ :=( X, Y ), :=( Y, X ), :=( Z, Z )] ),
% 11.82/12.19 substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, or( not( or( Z, not( or(
% 11.82/12.19 Y, X ) ) ) ), Z ) )] )).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 paramod(
% 11.82/12.19 clause( 5473, [ =( true, theorem( or( not( X ), or( not( or( Y, not( or( X
% 11.82/12.19 , Z ) ) ) ), Y ) ) ) ) ] )
% 11.82/12.19 , clause( 0, [ =( ifeq( X, X, Y, Z ), Y ) ] )
% 11.82/12.19 , 0, clause( 5471, [ =( true, ifeq( true, true, theorem( or( not( Y ), or(
% 11.82/12.19 not( or( Z, not( or( Y, X ) ) ) ), Z ) ) ), true ) ) ] )
% 11.82/12.19 , 0, 2, substitution( 0, [ :=( X, true ), :=( Y, theorem( or( not( X ), or(
% 11.82/12.19 not( or( Y, not( or( X, Z ) ) ) ), Y ) ) ) ), :=( Z, true )] ),
% 11.82/12.19 substitution( 1, [ :=( X, Z ), :=( Y, X ), :=( Z, Y )] )).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 eqswap(
% 11.82/12.19 clause( 5474, [ =( theorem( or( not( X ), or( not( or( Y, not( or( X, Z ) )
% 11.82/12.19 ) ), Y ) ) ), true ) ] )
% 11.82/12.19 , clause( 5473, [ =( true, theorem( or( not( X ), or( not( or( Y, not( or(
% 11.82/12.19 X, Z ) ) ) ), Y ) ) ) ) ] )
% 11.82/12.19 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 subsumption(
% 11.82/12.19 clause( 1735, [ =( theorem( or( not( Y ), or( not( or( Z, not( or( Y, X ) )
% 11.82/12.19 ) ), Z ) ) ), true ) ] )
% 11.82/12.19 , clause( 5474, [ =( theorem( or( not( X ), or( not( or( Y, not( or( X, Z )
% 11.82/12.19 ) ) ), Y ) ) ), true ) ] )
% 11.82/12.19 , substitution( 0, [ :=( X, Y ), :=( Y, Z ), :=( Z, X )] ),
% 11.82/12.19 permutation( 0, [ ==>( 0, 0 )] ) ).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 eqswap(
% 11.82/12.19 clause( 5476, [ =( true, ifeq( theorem( or( X, or( Y, Z ) ) ), true,
% 11.82/12.19 theorem( or( Y, or( X, Z ) ) ), true ) ) ] )
% 11.82/12.19 , clause( 16, [ =( ifeq( theorem( or( X, or( Y, Z ) ) ), true, theorem( or(
% 11.82/12.19 Y, or( X, Z ) ) ), true ), true ) ] )
% 11.82/12.19 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 paramod(
% 11.82/12.19 clause( 5478, [ =( true, ifeq( true, true, theorem( or( not( or( Y, not( or(
% 11.82/12.19 X, Z ) ) ) ), or( not( X ), Y ) ) ), true ) ) ] )
% 11.82/12.19 , clause( 1735, [ =( theorem( or( not( Y ), or( not( or( Z, not( or( Y, X )
% 11.82/12.19 ) ) ), Z ) ) ), true ) ] )
% 11.82/12.19 , 0, clause( 5476, [ =( true, ifeq( theorem( or( X, or( Y, Z ) ) ), true,
% 11.82/12.19 theorem( or( Y, or( X, Z ) ) ), true ) ) ] )
% 11.82/12.19 , 0, 3, substitution( 0, [ :=( X, Z ), :=( Y, X ), :=( Z, Y )] ),
% 11.82/12.19 substitution( 1, [ :=( X, not( X ) ), :=( Y, not( or( Y, not( or( X, Z )
% 11.82/12.19 ) ) ) ), :=( Z, Y )] )).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 paramod(
% 11.82/12.19 clause( 5480, [ =( true, theorem( or( not( or( X, not( or( Y, Z ) ) ) ), or(
% 11.82/12.19 not( Y ), X ) ) ) ) ] )
% 11.82/12.19 , clause( 0, [ =( ifeq( X, X, Y, Z ), Y ) ] )
% 11.82/12.19 , 0, clause( 5478, [ =( true, ifeq( true, true, theorem( or( not( or( Y,
% 11.82/12.19 not( or( X, Z ) ) ) ), or( not( X ), Y ) ) ), true ) ) ] )
% 11.82/12.19 , 0, 2, substitution( 0, [ :=( X, true ), :=( Y, theorem( or( not( or( X,
% 11.82/12.19 not( or( Y, Z ) ) ) ), or( not( Y ), X ) ) ) ), :=( Z, true )] ),
% 11.82/12.19 substitution( 1, [ :=( X, Y ), :=( Y, X ), :=( Z, Z )] )).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 eqswap(
% 11.82/12.19 clause( 5481, [ =( theorem( or( not( or( X, not( or( Y, Z ) ) ) ), or( not(
% 11.82/12.19 Y ), X ) ) ), true ) ] )
% 11.82/12.19 , clause( 5480, [ =( true, theorem( or( not( or( X, not( or( Y, Z ) ) ) ),
% 11.82/12.19 or( not( Y ), X ) ) ) ) ] )
% 11.82/12.19 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 subsumption(
% 11.82/12.19 clause( 5365, [ =( theorem( or( not( or( Y, not( or( X, Z ) ) ) ), or( not(
% 11.82/12.19 X ), Y ) ) ), true ) ] )
% 11.82/12.19 , clause( 5481, [ =( theorem( or( not( or( X, not( or( Y, Z ) ) ) ), or(
% 11.82/12.19 not( Y ), X ) ) ), true ) ] )
% 11.82/12.19 , substitution( 0, [ :=( X, Y ), :=( Y, X ), :=( Z, Z )] ),
% 11.82/12.19 permutation( 0, [ ==>( 0, 0 )] ) ).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 eqswap(
% 11.82/12.19 clause( 5483, [ =( true, ifeq( theorem( or( not( or( X, Y ) ), Z ) ), true
% 11.82/12.19 , theorem( or( not( or( Y, X ) ), Z ) ), true ) ) ] )
% 11.82/12.19 , clause( 33, [ =( ifeq( theorem( or( not( or( Y, X ) ), Z ) ), true,
% 11.82/12.19 theorem( or( not( or( X, Y ) ), Z ) ), true ), true ) ] )
% 11.82/12.19 , 0, substitution( 0, [ :=( X, Y ), :=( Y, X ), :=( Z, Z )] )).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 paramod(
% 11.82/12.19 clause( 5485, [ =( true, ifeq( true, true, theorem( or( not( or( not( or( Y
% 11.82/12.19 , Z ) ), X ) ), or( not( Y ), X ) ) ), true ) ) ] )
% 11.82/12.19 , clause( 5365, [ =( theorem( or( not( or( Y, not( or( X, Z ) ) ) ), or(
% 11.82/12.19 not( X ), Y ) ) ), true ) ] )
% 11.82/12.19 , 0, clause( 5483, [ =( true, ifeq( theorem( or( not( or( X, Y ) ), Z ) ),
% 11.82/12.19 true, theorem( or( not( or( Y, X ) ), Z ) ), true ) ) ] )
% 11.82/12.19 , 0, 3, substitution( 0, [ :=( X, Y ), :=( Y, X ), :=( Z, Z )] ),
% 11.82/12.19 substitution( 1, [ :=( X, X ), :=( Y, not( or( Y, Z ) ) ), :=( Z, or( not(
% 11.82/12.19 Y ), X ) )] )).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 paramod(
% 11.82/12.19 clause( 5487, [ =( true, theorem( or( not( or( not( or( X, Y ) ), Z ) ), or(
% 11.82/12.19 not( X ), Z ) ) ) ) ] )
% 11.82/12.19 , clause( 0, [ =( ifeq( X, X, Y, Z ), Y ) ] )
% 11.82/12.19 , 0, clause( 5485, [ =( true, ifeq( true, true, theorem( or( not( or( not(
% 11.82/12.19 or( Y, Z ) ), X ) ), or( not( Y ), X ) ) ), true ) ) ] )
% 11.82/12.19 , 0, 2, substitution( 0, [ :=( X, true ), :=( Y, theorem( or( not( or( not(
% 11.82/12.19 or( X, Y ) ), Z ) ), or( not( X ), Z ) ) ) ), :=( Z, true )] ),
% 11.82/12.19 substitution( 1, [ :=( X, Z ), :=( Y, X ), :=( Z, Y )] )).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 eqswap(
% 11.82/12.19 clause( 5488, [ =( theorem( or( not( or( not( or( X, Y ) ), Z ) ), or( not(
% 11.82/12.19 X ), Z ) ) ), true ) ] )
% 11.82/12.19 , clause( 5487, [ =( true, theorem( or( not( or( not( or( X, Y ) ), Z ) ),
% 11.82/12.19 or( not( X ), Z ) ) ) ) ] )
% 11.82/12.19 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 subsumption(
% 11.82/12.19 clause( 5368, [ =( theorem( or( not( or( not( or( Y, Z ) ), X ) ), or( not(
% 11.82/12.19 Y ), X ) ) ), true ) ] )
% 11.82/12.19 , clause( 5488, [ =( theorem( or( not( or( not( or( X, Y ) ), Z ) ), or(
% 11.82/12.19 not( X ), Z ) ) ), true ) ] )
% 11.82/12.19 , substitution( 0, [ :=( X, Y ), :=( Y, Z ), :=( Z, X )] ),
% 11.82/12.19 permutation( 0, [ ==>( 0, 0 )] ) ).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 eqswap(
% 11.82/12.19 clause( 5489, [ =( true, theorem( or( not( or( not( or( X, Y ) ), Z ) ), or(
% 11.82/12.19 not( X ), Z ) ) ) ) ] )
% 11.82/12.19 , clause( 5368, [ =( theorem( or( not( or( not( or( Y, Z ) ), X ) ), or(
% 11.82/12.19 not( Y ), X ) ) ), true ) ] )
% 11.82/12.19 , 0, substitution( 0, [ :=( X, Z ), :=( Y, X ), :=( Z, Y )] )).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 eqswap(
% 11.82/12.19 clause( 5490, [ ~( =( true, theorem( or( not( or( not( or( p, q ) ), q ) )
% 11.82/12.19 , or( not( p ), q ) ) ) ) ) ] )
% 11.82/12.19 , clause( 9, [ ~( =( theorem( or( not( or( not( or( p, q ) ), q ) ), or(
% 11.82/12.19 not( p ), q ) ) ), true ) ) ] )
% 11.82/12.19 , 0, substitution( 0, [] )).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 resolution(
% 11.82/12.19 clause( 5491, [] )
% 11.82/12.19 , clause( 5490, [ ~( =( true, theorem( or( not( or( not( or( p, q ) ), q )
% 11.82/12.19 ), or( not( p ), q ) ) ) ) ) ] )
% 11.82/12.19 , 0, clause( 5489, [ =( true, theorem( or( not( or( not( or( X, Y ) ), Z )
% 11.82/12.19 ), or( not( X ), Z ) ) ) ) ] )
% 11.82/12.19 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, p ), :=( Y, q ), :=(
% 11.82/12.19 Z, q )] )).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 subsumption(
% 11.82/12.19 clause( 5371, [] )
% 11.82/12.19 , clause( 5491, [] )
% 11.82/12.19 , substitution( 0, [] ), permutation( 0, [] ) ).
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 end.
% 11.82/12.19
% 11.82/12.19 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 11.82/12.19
% 11.82/12.19 Memory use:
% 11.82/12.19
% 11.82/12.19 space for terms: 85359
% 11.82/12.19 space for clauses: 547123
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 clauses generated: 2530921
% 11.82/12.19 clauses kept: 5372
% 11.82/12.19 clauses selected: 2825
% 11.82/12.19 clauses deleted: 18
% 11.82/12.19 clauses inuse deleted: 0
% 11.82/12.19
% 11.82/12.19 subsentry: 419
% 11.82/12.19 literals s-matched: 197
% 11.82/12.19 literals matched: 197
% 11.82/12.19 full subsumption: 0
% 11.82/12.19
% 11.82/12.19 checksum: -91962748
% 11.82/12.19
% 11.82/12.19
% 11.82/12.19 Bliksem ended
%------------------------------------------------------------------------------