TSTP Solution File: LCL250-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL250-1 : TPTP v8.1.0. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n029.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:14 EDT 2022
% Result : Unsatisfiable 3.41s 3.80s
% Output : Refutation 3.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL250-1 : TPTP v8.1.0. Bugfixed v2.3.0.
% 0.03/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % DateTime : Sun Jul 3 04:06:25 EDT 2022
% 0.13/0.34 % CPUTime :
% 3.41/3.80 *** allocated 10000 integers for termspace/termends
% 3.41/3.80 *** allocated 10000 integers for clauses
% 3.41/3.80 *** allocated 10000 integers for justifications
% 3.41/3.80 Bliksem 1.12
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 Automatic Strategy Selection
% 3.41/3.80
% 3.41/3.80 Clauses:
% 3.41/3.80 [
% 3.41/3.80 [ axiom( or( not( or( X, X ) ), X ) ) ],
% 3.41/3.80 [ axiom( or( not( X ), or( Y, X ) ) ) ],
% 3.41/3.80 [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ],
% 3.41/3.80 [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) ) ],
% 3.41/3.80 [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) ), or( Z, Y )
% 3.41/3.80 ) ) ) ],
% 3.41/3.80 [ theorem( X ), ~( axiom( X ) ) ],
% 3.41/3.80 [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~( theorem( Y ) ) ]
% 3.41/3.80 ,
% 3.41/3.80 [ theorem( or( not( X ), Y ) ), ~( axiom( or( not( X ), Z ) ) ), ~(
% 3.41/3.80 theorem( or( not( Z ), Y ) ) ) ],
% 3.41/3.80 [ ~( theorem( or( not( or( not( q ), r ) ), or( not( not( or( not( p ),
% 3.41/3.80 not( q ) ) ) ), r ) ) ) ) ]
% 3.41/3.80 ] .
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 percentage equality = 0.000000, percentage horn = 1.000000
% 3.41/3.80 This is a near-Horn, non-equality problem
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 Options Used:
% 3.41/3.80
% 3.41/3.80 useres = 1
% 3.41/3.80 useparamod = 0
% 3.41/3.80 useeqrefl = 0
% 3.41/3.80 useeqfact = 0
% 3.41/3.80 usefactor = 1
% 3.41/3.80 usesimpsplitting = 0
% 3.41/3.80 usesimpdemod = 0
% 3.41/3.80 usesimpres = 4
% 3.41/3.80
% 3.41/3.80 resimpinuse = 1000
% 3.41/3.80 resimpclauses = 20000
% 3.41/3.80 substype = standard
% 3.41/3.80 backwardsubs = 1
% 3.41/3.80 selectoldest = 5
% 3.41/3.80
% 3.41/3.80 litorderings [0] = split
% 3.41/3.80 litorderings [1] = liftord
% 3.41/3.80
% 3.41/3.80 termordering = none
% 3.41/3.80
% 3.41/3.80 litapriori = 1
% 3.41/3.80 termapriori = 0
% 3.41/3.80 litaposteriori = 0
% 3.41/3.80 termaposteriori = 0
% 3.41/3.80 demodaposteriori = 0
% 3.41/3.80 ordereqreflfact = 0
% 3.41/3.80
% 3.41/3.80 litselect = negative
% 3.41/3.80
% 3.41/3.80 maxweight = 30000
% 3.41/3.80 maxdepth = 30000
% 3.41/3.80 maxlength = 115
% 3.41/3.80 maxnrvars = 195
% 3.41/3.80 excuselevel = 0
% 3.41/3.80 increasemaxweight = 0
% 3.41/3.80
% 3.41/3.80 maxselected = 10000000
% 3.41/3.80 maxnrclauses = 10000000
% 3.41/3.80
% 3.41/3.80 showgenerated = 0
% 3.41/3.80 showkept = 0
% 3.41/3.80 showselected = 0
% 3.41/3.80 showdeleted = 0
% 3.41/3.80 showresimp = 1
% 3.41/3.80 showstatus = 2000
% 3.41/3.80
% 3.41/3.80 prologoutput = 1
% 3.41/3.80 nrgoals = 5000000
% 3.41/3.80 totalproof = 1
% 3.41/3.80
% 3.41/3.80 Symbols occurring in the translation:
% 3.41/3.80
% 3.41/3.80 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 3.41/3.80 . [1, 2] (w:1, o:26, a:1, s:1, b:0),
% 3.41/3.80 ! [4, 1] (w:1, o:18, a:1, s:1, b:0),
% 3.41/3.80 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 3.41/3.80 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 3.41/3.80 or [40, 2] (w:1, o:51, a:1, s:1, b:0),
% 3.41/3.80 not [41, 1] (w:1, o:23, a:1, s:1, b:0),
% 3.41/3.80 axiom [42, 1] (w:1, o:24, a:1, s:1, b:0),
% 3.41/3.80 theorem [46, 1] (w:1, o:25, a:1, s:1, b:0),
% 3.41/3.80 q [49, 0] (w:1, o:16, a:1, s:1, b:0),
% 3.41/3.80 r [50, 0] (w:1, o:17, a:1, s:1, b:0),
% 3.41/3.80 p [51, 0] (w:1, o:15, a:1, s:1, b:0).
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 Starting Search:
% 3.41/3.80
% 3.41/3.80 Resimplifying inuse:
% 3.41/3.80 Done
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 Intermediate Status:
% 3.41/3.80 Generated: 3552
% 3.41/3.80 Kept: 2003
% 3.41/3.80 Inuse: 579
% 3.41/3.80 Deleted: 7
% 3.41/3.80 Deletedinuse: 0
% 3.41/3.80
% 3.41/3.80 Resimplifying inuse:
% 3.41/3.80 Done
% 3.41/3.80
% 3.41/3.80 Resimplifying inuse:
% 3.41/3.80 Done
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 Intermediate Status:
% 3.41/3.80 Generated: 7011
% 3.41/3.80 Kept: 4004
% 3.41/3.80 Inuse: 1159
% 3.41/3.80 Deleted: 22
% 3.41/3.80 Deletedinuse: 0
% 3.41/3.80
% 3.41/3.80 Resimplifying inuse:
% 3.41/3.80 Done
% 3.41/3.80
% 3.41/3.80 Resimplifying inuse:
% 3.41/3.80 Done
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 Intermediate Status:
% 3.41/3.80 Generated: 10535
% 3.41/3.80 Kept: 6005
% 3.41/3.80 Inuse: 1749
% 3.41/3.80 Deleted: 36
% 3.41/3.80 Deletedinuse: 0
% 3.41/3.80
% 3.41/3.80 Resimplifying inuse:
% 3.41/3.80 Done
% 3.41/3.80
% 3.41/3.80 Resimplifying inuse:
% 3.41/3.80 Done
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 Intermediate Status:
% 3.41/3.80 Generated: 13970
% 3.41/3.80 Kept: 8008
% 3.41/3.80 Inuse: 2286
% 3.41/3.80 Deleted: 54
% 3.41/3.80 Deletedinuse: 0
% 3.41/3.80
% 3.41/3.80 Resimplifying inuse:
% 3.41/3.80 Done
% 3.41/3.80
% 3.41/3.80 Resimplifying inuse:
% 3.41/3.80 Done
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 Intermediate Status:
% 3.41/3.80 Generated: 17352
% 3.41/3.80 Kept: 10008
% 3.41/3.80 Inuse: 2812
% 3.41/3.80 Deleted: 63
% 3.41/3.80 Deletedinuse: 0
% 3.41/3.80
% 3.41/3.80 Resimplifying inuse:
% 3.41/3.80 Done
% 3.41/3.80
% 3.41/3.80 Resimplifying inuse:
% 3.41/3.80 Done
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 Intermediate Status:
% 3.41/3.80 Generated: 20537
% 3.41/3.80 Kept: 12010
% 3.41/3.80 Inuse: 3393
% 3.41/3.80 Deleted: 83
% 3.41/3.80 Deletedinuse: 0
% 3.41/3.80
% 3.41/3.80 Resimplifying inuse:
% 3.41/3.80 Done
% 3.41/3.80
% 3.41/3.80 Resimplifying inuse:
% 3.41/3.80 Done
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 Intermediate Status:
% 3.41/3.80 Generated: 24245
% 3.41/3.80 Kept: 14010
% 3.41/3.80 Inuse: 4013
% 3.41/3.80 Deleted: 89
% 3.41/3.80 Deletedinuse: 0
% 3.41/3.80
% 3.41/3.80 Resimplifying inuse:
% 3.41/3.80 Done
% 3.41/3.80
% 3.41/3.80 Resimplifying inuse:
% 3.41/3.80 Done
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 Intermediate Status:
% 3.41/3.80 Generated: 27742
% 3.41/3.80 Kept: 16011
% 3.41/3.80 Inuse: 4575
% 3.41/3.80 Deleted: 95
% 3.41/3.80 Deletedinuse: 0
% 3.41/3.80
% 3.41/3.80 Resimplifying inuse:
% 3.41/3.80 Done
% 3.41/3.80
% 3.41/3.80 Resimplifying inuse:
% 3.41/3.80 Done
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 Intermediate Status:
% 3.41/3.80 Generated: 31389
% 3.41/3.80 Kept: 18016
% 3.41/3.80 Inuse: 5173
% 3.41/3.80 Deleted: 107
% 3.41/3.80 Deletedinuse: 0
% 3.41/3.80
% 3.41/3.80 Resimplifying inuse:
% 3.41/3.80 Done
% 3.41/3.80
% 3.41/3.80 Resimplifying inuse:
% 3.41/3.80 Done
% 3.41/3.80
% 3.41/3.80 Resimplifying clauses:
% 3.41/3.80 Done
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 Intermediate Status:
% 3.41/3.80 Generated: 35129
% 3.41/3.80 Kept: 20020
% 3.41/3.80 Inuse: 5808
% 3.41/3.80 Deleted: 1058
% 3.41/3.80 Deletedinuse: 0
% 3.41/3.80
% 3.41/3.80 Resimplifying inuse:
% 3.41/3.80 Done
% 3.41/3.80
% 3.41/3.80 Resimplifying inuse:
% 3.41/3.80 Done
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 Intermediate Status:
% 3.41/3.80 Generated: 38407
% 3.41/3.80 Kept: 22020
% 3.41/3.80 Inuse: 6379
% 3.41/3.80 Deleted: 1058
% 3.41/3.80 Deletedinuse: 0
% 3.41/3.80
% 3.41/3.80 Resimplifying inuse:
% 3.41/3.80 Done
% 3.41/3.80
% 3.41/3.80 Resimplifying inuse:
% 3.41/3.80 Done
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 Intermediate Status:
% 3.41/3.80 Generated: 41584
% 3.41/3.80 Kept: 24023
% 3.41/3.80 Inuse: 6938
% 3.41/3.80 Deleted: 1058
% 3.41/3.80 Deletedinuse: 0
% 3.41/3.80
% 3.41/3.80 Resimplifying inuse:
% 3.41/3.80 Done
% 3.41/3.80
% 3.41/3.80 Resimplifying inuse:
% 3.41/3.80 Done
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 Intermediate Status:
% 3.41/3.80 Generated: 44451
% 3.41/3.80 Kept: 26028
% 3.41/3.80 Inuse: 7447
% 3.41/3.80 Deleted: 1058
% 3.41/3.80 Deletedinuse: 0
% 3.41/3.80
% 3.41/3.80 Resimplifying inuse:
% 3.41/3.80 Done
% 3.41/3.80
% 3.41/3.80 Resimplifying inuse:
% 3.41/3.80 Done
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 Intermediate Status:
% 3.41/3.80 Generated: 47635
% 3.41/3.80 Kept: 28030
% 3.41/3.80 Inuse: 7999
% 3.41/3.80 Deleted: 1058
% 3.41/3.80 Deletedinuse: 0
% 3.41/3.80
% 3.41/3.80 Resimplifying inuse:
% 3.41/3.80 Done
% 3.41/3.80
% 3.41/3.80 Resimplifying inuse:
% 3.41/3.80 Done
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 Bliksems!, er is een bewijs:
% 3.41/3.80 % SZS status Unsatisfiable
% 3.41/3.80 % SZS output start Refutation
% 3.41/3.80
% 3.41/3.80 clause( 0, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 3.41/3.80 .
% 3.41/3.80 clause( 1, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 3.41/3.80 .
% 3.41/3.80 clause( 2, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 3.41/3.80 .
% 3.41/3.80 clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) )
% 3.41/3.80 ] )
% 3.41/3.80 .
% 3.41/3.80 clause( 4, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) ), or(
% 3.41/3.80 Z, Y ) ) ) ) ] )
% 3.41/3.80 .
% 3.41/3.80 clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 3.41/3.80 .
% 3.41/3.80 clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X ) )
% 3.41/3.80 ) ] )
% 3.41/3.80 .
% 3.41/3.80 clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y ) )
% 3.41/3.80 ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 3.41/3.80 .
% 3.41/3.80 clause( 8, [ ~( theorem( or( not( or( not( q ), r ) ), or( not( not( or(
% 3.41/3.80 not( p ), not( q ) ) ) ), r ) ) ) ) ] )
% 3.41/3.80 .
% 3.41/3.80 clause( 10, [ theorem( or( not( or( X, X ) ), X ) ) ] )
% 3.41/3.80 .
% 3.41/3.80 clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z )
% 3.41/3.80 ) ) ) ] )
% 3.41/3.80 .
% 3.41/3.80 clause( 27, [ theorem( or( not( or( X, Y ) ), or( X, Z ) ) ), ~( theorem(
% 3.41/3.80 or( not( Y ), Z ) ) ) ] )
% 3.41/3.80 .
% 3.41/3.80 clause( 34, [ theorem( or( not( or( not( X ), Y ) ), Z ) ), ~( theorem( or(
% 3.41/3.80 not( or( not( or( T, X ) ), or( T, Y ) ) ), Z ) ) ) ] )
% 3.41/3.80 .
% 3.41/3.80 clause( 35, [ theorem( or( not( or( X, or( Y, Z ) ) ), T ) ), ~( theorem(
% 3.41/3.80 or( not( or( Y, or( X, Z ) ) ), T ) ) ) ] )
% 3.41/3.80 .
% 3.41/3.80 clause( 36, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 3.41/3.80 or( Y, X ) ), Z ) ) ) ] )
% 3.41/3.80 .
% 3.41/3.80 clause( 38, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( or( Z, X )
% 3.41/3.80 ), Y ) ) ) ] )
% 3.41/3.80 .
% 3.41/3.80 clause( 90, [ theorem( or( not( or( X, or( Y, Y ) ) ), or( X, Y ) ) ) ] )
% 3.41/3.80 .
% 3.41/3.80 clause( 665, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( Y, X ) )
% 3.41/3.80 , Y ) ) ) ] )
% 3.41/3.80 .
% 3.41/3.80 clause( 3146, [ theorem( or( not( or( X, not( Y ) ) ), or( not( or( X, Y )
% 3.41/3.80 ), X ) ) ) ] )
% 3.41/3.80 .
% 3.41/3.80 clause( 3153, [ theorem( or( not( not( X ) ), or( not( or( Y, X ) ), Y ) )
% 3.41/3.80 ) ] )
% 3.41/3.80 .
% 3.41/3.80 clause( 3161, [ theorem( or( not( or( X, Y ) ), or( not( not( Y ) ), X ) )
% 3.41/3.80 ) ] )
% 3.41/3.80 .
% 3.41/3.80 clause( 3166, [ theorem( or( not( or( X, or( Y, Z ) ) ), or( not( not( or(
% 3.41/3.80 X, Z ) ) ), Y ) ) ) ] )
% 3.41/3.80 .
% 3.41/3.80 clause( 29212, [ theorem( or( not( or( X, Y ) ), or( not( not( or( Z, Y ) )
% 3.41/3.80 ), X ) ) ) ] )
% 3.41/3.80 .
% 3.41/3.80 clause( 29221, [ theorem( or( not( or( X, Y ) ), or( not( not( or( Z, X ) )
% 3.41/3.80 ), Y ) ) ) ] )
% 3.41/3.80 .
% 3.41/3.80 clause( 29238, [] )
% 3.41/3.80 .
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 % SZS output end Refutation
% 3.41/3.80 found a proof!
% 3.41/3.80
% 3.41/3.80 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 3.41/3.80
% 3.41/3.80 initialclauses(
% 3.41/3.80 [ clause( 29240, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 3.41/3.80 , clause( 29241, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 3.41/3.80 , clause( 29242, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 3.41/3.80 , clause( 29243, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z )
% 3.41/3.80 ) ) ) ] )
% 3.41/3.80 , clause( 29244, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X )
% 3.41/3.80 ), or( Z, Y ) ) ) ) ] )
% 3.41/3.80 , clause( 29245, [ theorem( X ), ~( axiom( X ) ) ] )
% 3.41/3.80 , clause( 29246, [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~(
% 3.41/3.80 theorem( Y ) ) ] )
% 3.41/3.80 , clause( 29247, [ theorem( or( not( X ), Y ) ), ~( axiom( or( not( X ), Z
% 3.41/3.80 ) ) ), ~( theorem( or( not( Z ), Y ) ) ) ] )
% 3.41/3.80 , clause( 29248, [ ~( theorem( or( not( or( not( q ), r ) ), or( not( not(
% 3.41/3.80 or( not( p ), not( q ) ) ) ), r ) ) ) ) ] )
% 3.41/3.80 ] ).
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 subsumption(
% 3.41/3.80 clause( 0, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 3.41/3.80 , clause( 29240, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 3.41/3.80 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 subsumption(
% 3.41/3.80 clause( 1, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 3.41/3.80 , clause( 29241, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 3.41/3.80 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 3.41/3.80 )] ) ).
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 subsumption(
% 3.41/3.80 clause( 2, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 3.41/3.80 , clause( 29242, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 3.41/3.80 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 3.41/3.80 )] ) ).
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 subsumption(
% 3.41/3.80 clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) )
% 3.41/3.80 ] )
% 3.41/3.80 , clause( 29243, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z )
% 3.41/3.80 ) ) ) ] )
% 3.41/3.80 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 3.41/3.80 permutation( 0, [ ==>( 0, 0 )] ) ).
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 subsumption(
% 3.41/3.80 clause( 4, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) ), or(
% 3.41/3.80 Z, Y ) ) ) ) ] )
% 3.41/3.80 , clause( 29244, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X )
% 3.41/3.80 ), or( Z, Y ) ) ) ) ] )
% 3.41/3.80 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 3.41/3.80 permutation( 0, [ ==>( 0, 0 )] ) ).
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 subsumption(
% 3.41/3.80 clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 3.41/3.80 , clause( 29245, [ theorem( X ), ~( axiom( X ) ) ] )
% 3.41/3.80 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 3.41/3.80 1 )] ) ).
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 subsumption(
% 3.41/3.80 clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X ) )
% 3.41/3.80 ) ] )
% 3.41/3.80 , clause( 29246, [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~(
% 3.41/3.80 theorem( Y ) ) ] )
% 3.41/3.80 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 3.41/3.80 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 subsumption(
% 3.41/3.80 clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y ) )
% 3.41/3.80 ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 3.41/3.80 , clause( 29247, [ theorem( or( not( X ), Y ) ), ~( axiom( or( not( X ), Z
% 3.41/3.80 ) ) ), ~( theorem( or( not( Z ), Y ) ) ) ] )
% 3.41/3.80 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 3.41/3.80 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 subsumption(
% 3.41/3.80 clause( 8, [ ~( theorem( or( not( or( not( q ), r ) ), or( not( not( or(
% 3.41/3.80 not( p ), not( q ) ) ) ), r ) ) ) ) ] )
% 3.41/3.80 , clause( 29248, [ ~( theorem( or( not( or( not( q ), r ) ), or( not( not(
% 3.41/3.80 or( not( p ), not( q ) ) ) ), r ) ) ) ) ] )
% 3.41/3.80 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 resolution(
% 3.41/3.80 clause( 29249, [ theorem( or( not( or( X, X ) ), X ) ) ] )
% 3.41/3.80 , clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 3.41/3.80 , 1, clause( 0, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 3.41/3.80 , 0, substitution( 0, [ :=( X, or( not( or( X, X ) ), X ) )] ),
% 3.41/3.80 substitution( 1, [ :=( X, X )] )).
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 subsumption(
% 3.41/3.80 clause( 10, [ theorem( or( not( or( X, X ) ), X ) ) ] )
% 3.41/3.80 , clause( 29249, [ theorem( or( not( or( X, X ) ), X ) ) ] )
% 3.41/3.80 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 resolution(
% 3.41/3.80 clause( 29250, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X,
% 3.41/3.80 Z ) ) ) ) ] )
% 3.41/3.80 , clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X )
% 3.41/3.80 ) ) ] )
% 3.41/3.80 , 2, clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z )
% 3.41/3.80 ) ) ) ] )
% 3.41/3.80 , 0, substitution( 0, [ :=( X, or( X, or( Y, Z ) ) ), :=( Y, or( Y, or( X,
% 3.41/3.80 Z ) ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, X ), :=( Z, Z )] )).
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 subsumption(
% 3.41/3.80 clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z )
% 3.41/3.80 ) ) ) ] )
% 3.41/3.80 , clause( 29250, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X
% 3.41/3.80 , Z ) ) ) ) ] )
% 3.41/3.80 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 3.41/3.80 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 resolution(
% 3.41/3.80 clause( 29251, [ theorem( or( not( or( X, Y ) ), or( X, Z ) ) ), ~( theorem(
% 3.41/3.80 or( not( Y ), Z ) ) ) ] )
% 3.41/3.80 , clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X )
% 3.41/3.80 ) ) ] )
% 3.41/3.80 , 2, clause( 4, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X )
% 3.41/3.80 ), or( Z, Y ) ) ) ) ] )
% 3.41/3.80 , 0, substitution( 0, [ :=( X, or( not( or( X, Y ) ), or( X, Z ) ) ), :=( Y
% 3.41/3.80 , or( not( Y ), Z ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, Z ), :=(
% 3.41/3.80 Z, X )] )).
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 subsumption(
% 3.41/3.80 clause( 27, [ theorem( or( not( or( X, Y ) ), or( X, Z ) ) ), ~( theorem(
% 3.41/3.80 or( not( Y ), Z ) ) ) ] )
% 3.41/3.80 , clause( 29251, [ theorem( or( not( or( X, Y ) ), or( X, Z ) ) ), ~(
% 3.41/3.80 theorem( or( not( Y ), Z ) ) ) ] )
% 3.41/3.80 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 3.41/3.80 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 resolution(
% 3.41/3.80 clause( 29252, [ theorem( or( not( or( not( X ), Y ) ), Z ) ), ~( theorem(
% 3.41/3.80 or( not( or( not( or( T, X ) ), or( T, Y ) ) ), Z ) ) ) ] )
% 3.41/3.80 , clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y )
% 3.41/3.80 ) ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 3.41/3.80 , 2, clause( 4, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X )
% 3.41/3.80 ), or( Z, Y ) ) ) ) ] )
% 3.41/3.80 , 0, substitution( 0, [ :=( X, or( not( X ), Y ) ), :=( Y, Z ), :=( Z, or(
% 3.41/3.80 not( or( T, X ) ), or( T, Y ) ) )] ), substitution( 1, [ :=( X, X ), :=(
% 3.41/3.80 Y, Y ), :=( Z, T )] )).
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 subsumption(
% 3.41/3.80 clause( 34, [ theorem( or( not( or( not( X ), Y ) ), Z ) ), ~( theorem( or(
% 3.41/3.80 not( or( not( or( T, X ) ), or( T, Y ) ) ), Z ) ) ) ] )
% 3.41/3.80 , clause( 29252, [ theorem( or( not( or( not( X ), Y ) ), Z ) ), ~( theorem(
% 3.41/3.80 or( not( or( not( or( T, X ) ), or( T, Y ) ) ), Z ) ) ) ] )
% 3.41/3.80 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 3.41/3.80 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 resolution(
% 3.41/3.80 clause( 29253, [ theorem( or( not( or( X, or( Y, Z ) ) ), T ) ), ~( theorem(
% 3.41/3.80 or( not( or( Y, or( X, Z ) ) ), T ) ) ) ] )
% 3.41/3.80 , clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y )
% 3.41/3.80 ) ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 3.41/3.80 , 2, clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z )
% 3.41/3.80 ) ) ) ] )
% 3.41/3.80 , 0, substitution( 0, [ :=( X, or( X, or( Y, Z ) ) ), :=( Y, T ), :=( Z, or(
% 3.41/3.80 Y, or( X, Z ) ) )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z
% 3.41/3.80 )] )).
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 subsumption(
% 3.41/3.80 clause( 35, [ theorem( or( not( or( X, or( Y, Z ) ) ), T ) ), ~( theorem(
% 3.41/3.80 or( not( or( Y, or( X, Z ) ) ), T ) ) ) ] )
% 3.41/3.80 , clause( 29253, [ theorem( or( not( or( X, or( Y, Z ) ) ), T ) ), ~(
% 3.41/3.80 theorem( or( not( or( Y, or( X, Z ) ) ), T ) ) ) ] )
% 3.41/3.80 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 3.41/3.80 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 resolution(
% 3.41/3.80 clause( 29254, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 3.41/3.80 or( Y, X ) ), Z ) ) ) ] )
% 3.41/3.80 , clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y )
% 3.41/3.80 ) ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 3.41/3.80 , 2, clause( 2, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 3.41/3.80 , 0, substitution( 0, [ :=( X, or( X, Y ) ), :=( Y, Z ), :=( Z, or( Y, X )
% 3.41/3.80 )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 subsumption(
% 3.41/3.80 clause( 36, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 3.41/3.80 or( Y, X ) ), Z ) ) ) ] )
% 3.41/3.80 , clause( 29254, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or(
% 3.41/3.80 not( or( Y, X ) ), Z ) ) ) ] )
% 3.41/3.80 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 3.41/3.80 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 resolution(
% 3.41/3.80 clause( 29255, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( or( Z,
% 3.41/3.80 X ) ), Y ) ) ) ] )
% 3.41/3.80 , clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y )
% 3.41/3.80 ) ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 3.41/3.80 , 2, clause( 1, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 3.41/3.80 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, or( Z, X ) )] ),
% 3.41/3.80 substitution( 1, [ :=( X, X ), :=( Y, Z )] )).
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 subsumption(
% 3.41/3.80 clause( 38, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( or( Z, X )
% 3.41/3.80 ), Y ) ) ) ] )
% 3.41/3.80 , clause( 29255, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( or( Z
% 3.41/3.80 , X ) ), Y ) ) ) ] )
% 3.41/3.80 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 3.41/3.80 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 resolution(
% 3.41/3.80 clause( 29256, [ theorem( or( not( or( X, or( Y, Y ) ) ), or( X, Y ) ) ) ]
% 3.41/3.80 )
% 3.41/3.80 , clause( 27, [ theorem( or( not( or( X, Y ) ), or( X, Z ) ) ), ~( theorem(
% 3.41/3.80 or( not( Y ), Z ) ) ) ] )
% 3.41/3.80 , 1, clause( 10, [ theorem( or( not( or( X, X ) ), X ) ) ] )
% 3.41/3.80 , 0, substitution( 0, [ :=( X, X ), :=( Y, or( Y, Y ) ), :=( Z, Y )] ),
% 3.41/3.80 substitution( 1, [ :=( X, Y )] )).
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 subsumption(
% 3.41/3.80 clause( 90, [ theorem( or( not( or( X, or( Y, Y ) ) ), or( X, Y ) ) ) ] )
% 3.41/3.80 , clause( 29256, [ theorem( or( not( or( X, or( Y, Y ) ) ), or( X, Y ) ) )
% 3.41/3.80 ] )
% 3.41/3.80 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 3.41/3.80 )] ) ).
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 resolution(
% 3.41/3.80 clause( 29257, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( Y, X )
% 3.41/3.80 ), Y ) ) ) ] )
% 3.41/3.80 , clause( 34, [ theorem( or( not( or( not( X ), Y ) ), Z ) ), ~( theorem(
% 3.41/3.80 or( not( or( not( or( T, X ) ), or( T, Y ) ) ), Z ) ) ) ] )
% 3.41/3.80 , 1, clause( 90, [ theorem( or( not( or( X, or( Y, Y ) ) ), or( X, Y ) ) )
% 3.41/3.80 ] )
% 3.41/3.80 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, or( not( or( Y, X )
% 3.41/3.80 ), Y ) ), :=( T, Y )] ), substitution( 1, [ :=( X, not( or( Y, X ) ) ),
% 3.41/3.80 :=( Y, Y )] )).
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 subsumption(
% 3.41/3.80 clause( 665, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( Y, X ) )
% 3.41/3.80 , Y ) ) ) ] )
% 3.41/3.80 , clause( 29257, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( Y, X
% 3.41/3.80 ) ), Y ) ) ) ] )
% 3.41/3.80 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 3.41/3.80 )] ) ).
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 resolution(
% 3.41/3.80 clause( 29258, [ theorem( or( not( or( X, not( Y ) ) ), or( not( or( X, Y )
% 3.41/3.80 ), X ) ) ) ] )
% 3.41/3.80 , clause( 36, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 3.41/3.80 or( Y, X ) ), Z ) ) ) ] )
% 3.41/3.80 , 1, clause( 665, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( Y,
% 3.41/3.80 X ) ), Y ) ) ) ] )
% 3.41/3.80 , 0, substitution( 0, [ :=( X, X ), :=( Y, not( Y ) ), :=( Z, or( not( or(
% 3.41/3.80 X, Y ) ), X ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, X )] )).
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 subsumption(
% 3.41/3.80 clause( 3146, [ theorem( or( not( or( X, not( Y ) ) ), or( not( or( X, Y )
% 3.41/3.80 ), X ) ) ) ] )
% 3.41/3.80 , clause( 29258, [ theorem( or( not( or( X, not( Y ) ) ), or( not( or( X, Y
% 3.41/3.80 ) ), X ) ) ) ] )
% 3.41/3.80 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 3.41/3.80 )] ) ).
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 resolution(
% 3.41/3.80 clause( 29259, [ theorem( or( not( not( X ) ), or( not( or( Y, X ) ), Y ) )
% 3.41/3.80 ) ] )
% 3.41/3.80 , clause( 38, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( or( Z, X
% 3.41/3.80 ) ), Y ) ) ) ] )
% 3.41/3.80 , 1, clause( 3146, [ theorem( or( not( or( X, not( Y ) ) ), or( not( or( X
% 3.41/3.80 , Y ) ), X ) ) ) ] )
% 3.41/3.80 , 0, substitution( 0, [ :=( X, not( X ) ), :=( Y, or( not( or( Y, X ) ), Y
% 3.41/3.80 ) ), :=( Z, Y )] ), substitution( 1, [ :=( X, Y ), :=( Y, X )] )).
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 subsumption(
% 3.41/3.80 clause( 3153, [ theorem( or( not( not( X ) ), or( not( or( Y, X ) ), Y ) )
% 3.41/3.80 ) ] )
% 3.41/3.80 , clause( 29259, [ theorem( or( not( not( X ) ), or( not( or( Y, X ) ), Y )
% 3.41/3.80 ) ) ] )
% 3.41/3.80 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 3.41/3.80 )] ) ).
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 resolution(
% 3.41/3.80 clause( 29260, [ theorem( or( not( or( X, Y ) ), or( not( not( Y ) ), X ) )
% 3.41/3.80 ) ] )
% 3.41/3.80 , clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z
% 3.41/3.80 ) ) ) ) ] )
% 3.41/3.80 , 1, clause( 3153, [ theorem( or( not( not( X ) ), or( not( or( Y, X ) ), Y
% 3.41/3.80 ) ) ) ] )
% 3.41/3.80 , 0, substitution( 0, [ :=( X, not( or( X, Y ) ) ), :=( Y, not( not( Y ) )
% 3.41/3.80 ), :=( Z, X )] ), substitution( 1, [ :=( X, Y ), :=( Y, X )] )).
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 subsumption(
% 3.41/3.80 clause( 3161, [ theorem( or( not( or( X, Y ) ), or( not( not( Y ) ), X ) )
% 3.41/3.80 ) ] )
% 3.41/3.80 , clause( 29260, [ theorem( or( not( or( X, Y ) ), or( not( not( Y ) ), X )
% 3.41/3.80 ) ) ] )
% 3.41/3.80 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 3.41/3.80 )] ) ).
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 resolution(
% 3.41/3.80 clause( 29261, [ theorem( or( not( or( X, or( Y, Z ) ) ), or( not( not( or(
% 3.41/3.80 X, Z ) ) ), Y ) ) ) ] )
% 3.41/3.80 , clause( 35, [ theorem( or( not( or( X, or( Y, Z ) ) ), T ) ), ~( theorem(
% 3.41/3.80 or( not( or( Y, or( X, Z ) ) ), T ) ) ) ] )
% 3.41/3.80 , 1, clause( 3161, [ theorem( or( not( or( X, Y ) ), or( not( not( Y ) ), X
% 3.41/3.80 ) ) ) ] )
% 3.41/3.80 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, or( not(
% 3.41/3.80 not( or( X, Z ) ) ), Y ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, or(
% 3.41/3.80 X, Z ) )] )).
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 subsumption(
% 3.41/3.80 clause( 3166, [ theorem( or( not( or( X, or( Y, Z ) ) ), or( not( not( or(
% 3.41/3.80 X, Z ) ) ), Y ) ) ) ] )
% 3.41/3.80 , clause( 29261, [ theorem( or( not( or( X, or( Y, Z ) ) ), or( not( not(
% 3.41/3.80 or( X, Z ) ) ), Y ) ) ) ] )
% 3.41/3.80 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 3.41/3.80 permutation( 0, [ ==>( 0, 0 )] ) ).
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 resolution(
% 3.41/3.80 clause( 29262, [ theorem( or( not( or( X, Y ) ), or( not( not( or( Z, Y ) )
% 3.41/3.80 ), X ) ) ) ] )
% 3.41/3.80 , clause( 38, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( or( Z, X
% 3.41/3.80 ) ), Y ) ) ) ] )
% 3.41/3.80 , 1, clause( 3166, [ theorem( or( not( or( X, or( Y, Z ) ) ), or( not( not(
% 3.41/3.80 or( X, Z ) ) ), Y ) ) ) ] )
% 3.41/3.80 , 0, substitution( 0, [ :=( X, or( X, Y ) ), :=( Y, or( not( not( or( Z, Y
% 3.41/3.80 ) ) ), X ) ), :=( Z, Z )] ), substitution( 1, [ :=( X, Z ), :=( Y, X ),
% 3.41/3.80 :=( Z, Y )] )).
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 subsumption(
% 3.41/3.80 clause( 29212, [ theorem( or( not( or( X, Y ) ), or( not( not( or( Z, Y ) )
% 3.41/3.80 ), X ) ) ) ] )
% 3.41/3.80 , clause( 29262, [ theorem( or( not( or( X, Y ) ), or( not( not( or( Z, Y )
% 3.41/3.80 ) ), X ) ) ) ] )
% 3.41/3.80 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 3.41/3.80 permutation( 0, [ ==>( 0, 0 )] ) ).
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 resolution(
% 3.41/3.80 clause( 29263, [ theorem( or( not( or( X, Y ) ), or( not( not( or( Z, X ) )
% 3.41/3.80 ), Y ) ) ) ] )
% 3.41/3.80 , clause( 36, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 3.41/3.80 or( Y, X ) ), Z ) ) ) ] )
% 3.41/3.80 , 1, clause( 29212, [ theorem( or( not( or( X, Y ) ), or( not( not( or( Z,
% 3.41/3.80 Y ) ) ), X ) ) ) ] )
% 3.41/3.80 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, or( not( not( or( Z
% 3.41/3.80 , X ) ) ), Y ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, X ), :=( Z, Z
% 3.41/3.80 )] )).
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 subsumption(
% 3.41/3.80 clause( 29221, [ theorem( or( not( or( X, Y ) ), or( not( not( or( Z, X ) )
% 3.41/3.80 ), Y ) ) ) ] )
% 3.41/3.80 , clause( 29263, [ theorem( or( not( or( X, Y ) ), or( not( not( or( Z, X )
% 3.41/3.80 ) ), Y ) ) ) ] )
% 3.41/3.80 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 3.41/3.80 permutation( 0, [ ==>( 0, 0 )] ) ).
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 resolution(
% 3.41/3.80 clause( 29264, [] )
% 3.41/3.80 , clause( 8, [ ~( theorem( or( not( or( not( q ), r ) ), or( not( not( or(
% 3.41/3.80 not( p ), not( q ) ) ) ), r ) ) ) ) ] )
% 3.41/3.80 , 0, clause( 29221, [ theorem( or( not( or( X, Y ) ), or( not( not( or( Z,
% 3.41/3.80 X ) ) ), Y ) ) ) ] )
% 3.41/3.80 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, not( q ) ), :=( Y, r
% 3.41/3.80 ), :=( Z, not( p ) )] )).
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 subsumption(
% 3.41/3.80 clause( 29238, [] )
% 3.41/3.80 , clause( 29264, [] )
% 3.41/3.80 , substitution( 0, [] ), permutation( 0, [] ) ).
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 end.
% 3.41/3.80
% 3.41/3.80 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 3.41/3.80
% 3.41/3.80 Memory use:
% 3.41/3.80
% 3.41/3.80 space for terms: 536739
% 3.41/3.80 space for clauses: 2274307
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 clauses generated: 49458
% 3.41/3.80 clauses kept: 29239
% 3.41/3.80 clauses selected: 8312
% 3.41/3.80 clauses deleted: 1058
% 3.41/3.80 clauses inuse deleted: 0
% 3.41/3.80
% 3.41/3.80 subsentry: 22044
% 3.41/3.80 literals s-matched: 22044
% 3.41/3.80 literals matched: 22044
% 3.41/3.80 full subsumption: 0
% 3.41/3.80
% 3.41/3.80 checksum: 117146361
% 3.41/3.80
% 3.41/3.80
% 3.41/3.80 Bliksem ended
%------------------------------------------------------------------------------