TSTP Solution File: LCL004-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL004-1 : TPTP v8.1.0. Released v1.0.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:49:05 EDT 2022
% Result : Unsatisfiable 1.17s 1.57s
% Output : Refutation 1.17s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LCL004-1 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n013.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 11:06:59 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.17/1.57 *** allocated 10000 integers for termspace/termends
% 1.17/1.57 *** allocated 10000 integers for clauses
% 1.17/1.57 *** allocated 10000 integers for justifications
% 1.17/1.57 Bliksem 1.12
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 Automatic Strategy Selection
% 1.17/1.57
% 1.17/1.57 Clauses:
% 1.17/1.57 [
% 1.17/1.57 [ ~( 'is_a_theorem'( or( not( X ), Y ) ) ), ~( 'is_a_theorem'( X ) ),
% 1.17/1.57 'is_a_theorem'( Y ) ],
% 1.17/1.57 [ 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ), or( Z, or( T, U
% 1.17/1.57 ) ) ) ), or( not( or( not( T ), X ) ), or( Z, or( U, X ) ) ) ) ) ],
% 1.17/1.57 [ ~( 'is_a_theorem'( or( not( a ), or( b, a ) ) ) ) ]
% 1.17/1.57 ] .
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 percentage equality = 0.000000, percentage horn = 1.000000
% 1.17/1.57 This is a near-Horn, non-equality problem
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 Options Used:
% 1.17/1.57
% 1.17/1.57 useres = 1
% 1.17/1.57 useparamod = 0
% 1.17/1.57 useeqrefl = 0
% 1.17/1.57 useeqfact = 0
% 1.17/1.57 usefactor = 1
% 1.17/1.57 usesimpsplitting = 0
% 1.17/1.57 usesimpdemod = 0
% 1.17/1.57 usesimpres = 4
% 1.17/1.57
% 1.17/1.57 resimpinuse = 1000
% 1.17/1.57 resimpclauses = 20000
% 1.17/1.57 substype = standard
% 1.17/1.57 backwardsubs = 1
% 1.17/1.57 selectoldest = 5
% 1.17/1.57
% 1.17/1.57 litorderings [0] = split
% 1.17/1.57 litorderings [1] = liftord
% 1.17/1.57
% 1.17/1.57 termordering = none
% 1.17/1.57
% 1.17/1.57 litapriori = 1
% 1.17/1.57 termapriori = 0
% 1.17/1.57 litaposteriori = 0
% 1.17/1.57 termaposteriori = 0
% 1.17/1.57 demodaposteriori = 0
% 1.17/1.57 ordereqreflfact = 0
% 1.17/1.57
% 1.17/1.57 litselect = negative
% 1.17/1.57
% 1.17/1.57 maxweight = 30000
% 1.17/1.57 maxdepth = 30000
% 1.17/1.57 maxlength = 115
% 1.17/1.57 maxnrvars = 195
% 1.17/1.57 excuselevel = 0
% 1.17/1.57 increasemaxweight = 0
% 1.17/1.57
% 1.17/1.57 maxselected = 10000000
% 1.17/1.57 maxnrclauses = 10000000
% 1.17/1.57
% 1.17/1.57 showgenerated = 0
% 1.17/1.57 showkept = 0
% 1.17/1.57 showselected = 0
% 1.17/1.57 showdeleted = 0
% 1.17/1.57 showresimp = 1
% 1.17/1.57 showstatus = 2000
% 1.17/1.57
% 1.17/1.57 prologoutput = 1
% 1.17/1.57 nrgoals = 5000000
% 1.17/1.57 totalproof = 1
% 1.17/1.57
% 1.17/1.57 Symbols occurring in the translation:
% 1.17/1.57
% 1.17/1.57 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 1.17/1.57 . [1, 2] (w:1, o:23, a:1, s:1, b:0),
% 1.17/1.57 ! [4, 1] (w:1, o:16, a:1, s:1, b:0),
% 1.17/1.57 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.17/1.57 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.17/1.57 not [40, 1] (w:1, o:21, a:1, s:1, b:0),
% 1.17/1.57 or [42, 2] (w:1, o:48, a:1, s:1, b:0),
% 1.17/1.57 'is_a_theorem' [43, 1] (w:1, o:22, a:1, s:1, b:0),
% 1.17/1.57 a [47, 0] (w:1, o:14, a:1, s:1, b:0),
% 1.17/1.57 b [48, 0] (w:1, o:15, a:1, s:1, b:0).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 Starting Search:
% 1.17/1.57
% 1.17/1.57 Resimplifying inuse:
% 1.17/1.57 Done
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 Intermediate Status:
% 1.17/1.57 Generated: 7447
% 1.17/1.57 Kept: 2017
% 1.17/1.57 Inuse: 272
% 1.17/1.57 Deleted: 85
% 1.17/1.57 Deletedinuse: 18
% 1.17/1.57
% 1.17/1.57 Resimplifying inuse:
% 1.17/1.57 Done
% 1.17/1.57
% 1.17/1.57 Resimplifying inuse:
% 1.17/1.57 Done
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 Intermediate Status:
% 1.17/1.57 Generated: 21392
% 1.17/1.57 Kept: 4017
% 1.17/1.57 Inuse: 647
% 1.17/1.57 Deleted: 639
% 1.17/1.57 Deletedinuse: 283
% 1.17/1.57
% 1.17/1.57 Resimplifying inuse:
% 1.17/1.57 Done
% 1.17/1.57
% 1.17/1.57 Resimplifying inuse:
% 1.17/1.57 Done
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 Intermediate Status:
% 1.17/1.57 Generated: 34130
% 1.17/1.57 Kept: 6032
% 1.17/1.57 Inuse: 853
% 1.17/1.57 Deleted: 717
% 1.17/1.57 Deletedinuse: 318
% 1.17/1.57
% 1.17/1.57 Resimplifying inuse:
% 1.17/1.57 Done
% 1.17/1.57
% 1.17/1.57 Resimplifying inuse:
% 1.17/1.57 Done
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 Intermediate Status:
% 1.17/1.57 Generated: 58479
% 1.17/1.57 Kept: 8032
% 1.17/1.57 Inuse: 1271
% 1.17/1.57 Deleted: 933
% 1.17/1.57 Deletedinuse: 340
% 1.17/1.57
% 1.17/1.57 Resimplifying inuse:
% 1.17/1.57 Done
% 1.17/1.57
% 1.17/1.57 Resimplifying inuse:
% 1.17/1.57 Done
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 Intermediate Status:
% 1.17/1.57 Generated: 85580
% 1.17/1.57 Kept: 10050
% 1.17/1.57 Inuse: 1637
% 1.17/1.57 Deleted: 1405
% 1.17/1.57 Deletedinuse: 682
% 1.17/1.57
% 1.17/1.57 Resimplifying inuse:
% 1.17/1.57 Done
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 Bliksems!, er is een bewijs:
% 1.17/1.57 % SZS status Unsatisfiable
% 1.17/1.57 % SZS output start Refutation
% 1.17/1.57
% 1.17/1.57 clause( 0, [ ~( 'is_a_theorem'( or( not( X ), Y ) ) ), 'is_a_theorem'( Y )
% 1.17/1.57 , ~( 'is_a_theorem'( X ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 1, [ 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ), or( Z,
% 1.17/1.57 or( T, U ) ) ) ), or( not( or( not( T ), X ) ), or( Z, or( U, X ) ) ) ) )
% 1.17/1.57 ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 2, [ ~( 'is_a_theorem'( or( not( a ), or( b, a ) ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 3, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( or( not( or( not( or(
% 1.17/1.57 not( or( not( X ), Y ) ), or( Z, or( T, U ) ) ) ), or( not( or( not( T )
% 1.17/1.57 , X ) ), or( Z, or( U, X ) ) ) ) ), W ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 4, [ 'is_a_theorem'( or( not( or( not( X ), or( not( Y ), Z ) ) ),
% 1.17/1.57 or( not( or( not( T ), Y ) ), or( or( U, Y ), or( not( Y ), Z ) ) ) ) ) ]
% 1.17/1.57 )
% 1.17/1.57 .
% 1.17/1.57 clause( 5, [ 'is_a_theorem'( or( not( or( not( X ), or( not( Y ), Z ) ) ),
% 1.17/1.57 or( or( T, or( not( Y ), Z ) ), or( not( or( not( Y ), Z ) ), or( U, or(
% 1.17/1.57 W, Z ) ) ) ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 6, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( or( not( or( not( or(
% 1.17/1.57 not( X ), or( not( Y ), Z ) ) ), or( not( or( not( T ), Y ) ), or( or( U
% 1.17/1.57 , Y ), or( not( Y ), Z ) ) ) ) ), W ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 7, [ 'is_a_theorem'( or( or( X, or( not( or( not( Y ), Z ) ), or( T
% 1.17/1.57 , or( U, Z ) ) ) ), or( not( or( not( or( not( Y ), Z ) ), or( T, or( U,
% 1.17/1.57 Z ) ) ) ), or( W, or( V0, or( T, or( U, Z ) ) ) ) ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 11, [ 'is_a_theorem'( or( not( or( not( or( X, Y ) ), Z ) ), or(
% 1.17/1.57 not( or( not( T ), Y ) ), or( or( not( Y ), U ), Z ) ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 14, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( or( not( or( not( or(
% 1.17/1.57 not( or( X, Y ) ), Z ) ), or( not( or( not( T ), Y ) ), or( or( not( Y )
% 1.17/1.57 , U ), Z ) ) ) ), W ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 18, [ 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ), or( Z
% 1.17/1.57 , X ) ) ), or( not( or( not( T ), X ) ), or( U, or( Z, X ) ) ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 19, [ 'is_a_theorem'( or( not( or( not( X ), or( or( not( Y ), Z )
% 1.17/1.57 , Y ) ) ), or( T, or( not( or( not( U ), Y ) ), or( or( not( Y ), Z ), Y
% 1.17/1.57 ) ) ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 21, [ 'is_a_theorem'( or( not( or( not( X ), or( not( Y ), or( Z, Y
% 1.17/1.57 ) ) ) ), or( T, or( not( or( not( U ), Y ) ), or( not( Y ), or( Z, Y ) )
% 1.17/1.57 ) ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 23, [ 'is_a_theorem'( V1 ), ~( 'is_a_theorem'( or( not( or( or( X,
% 1.17/1.57 or( not( or( not( Y ), Z ) ), or( T, or( U, Z ) ) ) ), or( not( or( not(
% 1.17/1.57 or( not( Y ), Z ) ), or( T, or( U, Z ) ) ) ), or( W, or( V0, or( T, or( U
% 1.17/1.57 , Z ) ) ) ) ) ) ), V1 ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 28, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( or( not( or( not( or(
% 1.17/1.57 not( X ), or( or( not( Y ), Z ), Y ) ) ), or( T, or( not( or( not( U ), Y
% 1.17/1.57 ) ), or( or( not( Y ), Z ), Y ) ) ) ) ), W ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 31, [ 'is_a_theorem'( or( X, or( not( or( not( Y ), or( not( Z ), T
% 1.17/1.57 ) ) ), or( not( or( not( Z ), T ) ), or( U, or( not( Z ), T ) ) ) ) ) )
% 1.17/1.57 ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 33, [ 'is_a_theorem'( or( not( or( not( X ), or( not( Y ), Z ) ) )
% 1.17/1.57 , or( not( or( not( Y ), Z ) ), or( T, or( not( Y ), Z ) ) ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 42, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( or( not( or( not( or(
% 1.17/1.57 not( X ), or( not( Y ), Z ) ) ), or( not( or( not( Y ), Z ) ), or( T, or(
% 1.17/1.57 not( Y ), Z ) ) ) ) ), U ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 51, [ 'is_a_theorem'( or( not( or( not( X ), or( Y, or( not( Z ), T
% 1.17/1.57 ) ) ) ), or( U, or( not( or( not( Z ), T ) ), or( Y, or( not( Z ), T ) )
% 1.17/1.57 ) ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 53, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( not( or(
% 1.17/1.57 not( Z ), T ) ), or( or( not( Z ), T ), Y ) ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 64, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( or( not( or( not( or(
% 1.17/1.57 not( X ), Y ) ), or( not( or( not( Z ), T ) ), or( or( not( Z ), T ), Y )
% 1.17/1.57 ) ) ), U ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 94, [ 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ), Z ) )
% 1.17/1.57 , or( not( or( not( X ), Y ) ), or( T, Z ) ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 101, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( or( not( or( not( or(
% 1.17/1.57 not( or( not( X ), Y ) ), Z ) ), or( not( or( not( X ), Y ) ), or( T, Z )
% 1.17/1.57 ) ) ), U ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 211, [ 'is_a_theorem'( or( X, or( not( or( not( Y ), Z ) ), or( not(
% 1.17/1.57 or( not( T ), U ) ), or( not( Y ), Z ) ) ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 213, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( not( or(
% 1.17/1.57 not( Z ), T ) ), or( not( X ), Y ) ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 215, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( or( not( or( not( or(
% 1.17/1.57 not( X ), Y ) ), or( not( or( not( Z ), T ) ), or( not( X ), Y ) ) ) ), U
% 1.17/1.57 ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 218, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( Z, or( not(
% 1.17/1.57 or( not( T ), U ) ), or( not( X ), Y ) ) ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 230, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( or( not( or( not( or(
% 1.17/1.57 not( X ), Y ) ), or( Z, or( not( or( not( T ), U ) ), or( not( X ), Y ) )
% 1.17/1.57 ) ) ), W ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 257, [ 'is_a_theorem'( or( not( or( not( X ), or( not( or( not( Y )
% 1.17/1.57 , Z ) ), or( or( not( Z ), T ), Z ) ) ) ), or( U, or( W, or( not( or( not(
% 1.17/1.57 Y ), Z ) ), or( or( not( Z ), T ), Z ) ) ) ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 377, [ 'is_a_theorem'( or( not( or( not( not( or( not( X ), Y ) ) )
% 1.17/1.57 , Z ) ), or( T, or( or( not( Z ), U ), Z ) ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 399, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( or( not( or( not( or(
% 1.17/1.57 not( not( or( not( X ), Y ) ) ), Z ) ), or( T, or( or( not( Z ), U ), Z )
% 1.17/1.57 ) ) ), W ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 452, [ 'is_a_theorem'( or( X, or( not( or( not( Y ), Z ) ), or( not(
% 1.17/1.57 Z ), or( or( not( Z ), T ), Z ) ) ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 457, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( not( Y ),
% 1.17/1.57 or( or( not( Y ), Z ), Y ) ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 463, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( or( not( or( not( or(
% 1.17/1.57 not( X ), Y ) ), or( not( Y ), or( or( not( Y ), Z ), Y ) ) ) ), T ) ) )
% 1.17/1.57 ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 555, [ 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ), Z ) )
% 1.17/1.57 , or( not( X ), or( X, Z ) ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 575, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( or( not( or( not( or(
% 1.17/1.57 not( or( not( X ), Y ) ), Z ) ), or( not( X ), or( X, Z ) ) ) ), T ) ) )
% 1.17/1.57 ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 872, [ 'is_a_theorem'( or( X, or( not( or( not( Y ), Z ) ), or( not(
% 1.17/1.57 Z ), or( Z, Z ) ) ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 876, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( not( Y ),
% 1.17/1.57 or( Y, Y ) ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 885, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( or( not( or( not( or(
% 1.17/1.57 not( X ), Y ) ), or( not( Y ), or( Y, Y ) ) ) ), Z ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 1003, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( not( X )
% 1.17/1.57 , or( X, Y ) ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 1013, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( not( X ), Y ) ), or( not( X ), or( X, Y ) ) ) ), Z ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 1227, [ 'is_a_theorem'( or( not( or( not( X ), X ) ), or( not( X )
% 1.17/1.57 , or( Y, X ) ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 1235, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( not( X ), X ) ), or( not( X ), or( Y, X ) ) ) ), Z ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 1372, [ 'is_a_theorem'( or( X, or( not( or( not( Y ), Z ) ), or(
% 1.17/1.57 not( Z ), or( T, Z ) ) ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 1384, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( not( Y )
% 1.17/1.57 , or( Z, Y ) ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 1395, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( not( X ), Y ) ), or( not( Y ), or( Z, Y ) ) ) ), T ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 1558, [ 'is_a_theorem'( or( not( or( not( X ), or( Y, Z ) ) ), or(
% 1.17/1.57 T, or( not( Z ), or( Y, Z ) ) ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 1559, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( not( Z )
% 1.17/1.57 , or( Z, Y ) ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 1574, [ 'is_a_theorem'( or( not( X ), or( X, or( Y, or( or( not( Z
% 1.17/1.57 ), T ), Z ) ) ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 1579, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( not( X ), Y ) ), or( not( Z ), or( Z, Y ) ) ) ), T ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 1687, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( or( not( or( not( X
% 1.17/1.57 ), or( X, or( Y, or( or( not( Z ), T ), Z ) ) ) ) ), U ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 2075, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( not( X )
% 1.17/1.57 , or( Z, Y ) ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 2083, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( not( X ), Y ) ), or( not( X ), or( Z, Y ) ) ) ), T ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 2457, [ 'is_a_theorem'( or( X, or( not( or( Y, Z ) ), or( not( T )
% 1.17/1.57 , or( Y, Z ) ) ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 2520, [ 'is_a_theorem'( or( not( or( X, Y ) ), or( not( Z ), or( X
% 1.17/1.57 , Y ) ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 2524, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( X, Y ) ), or( not( Z ), or( X, Y ) ) ) ), T ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 2622, [ 'is_a_theorem'( or( not( or( not( not( X ) ), X ) ), or(
% 1.17/1.57 not( Y ), or( Z, X ) ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 2647, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( not( not( X ) ), X ) ), or( not( Y ), or( Z, X ) ) ) ), T ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 3596, [ 'is_a_theorem'( or( X, or( Y, or( not( or( not( Z ), T ) )
% 1.17/1.57 , or( or( not( T ), U ), T ) ) ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 3598, [ 'is_a_theorem'( or( X, or( not( or( not( Y ), Z ) ), or( or(
% 1.17/1.57 not( Z ), T ), Z ) ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 3600, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( or( not(
% 1.17/1.57 Y ), Z ), Y ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 3609, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( not( X ), Y ) ), or( or( not( Y ), Z ), Y ) ) ), T ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 3633, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( Z, or( or(
% 1.17/1.57 not( Y ), T ), Y ) ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 3648, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( not( X ), Y ) ), or( Z, or( or( not( Y ), T ), Y ) ) ) ), U ) ) ) ]
% 1.17/1.57 )
% 1.17/1.57 .
% 1.17/1.57 clause( 10525, [ 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ), Z )
% 1.17/1.57 ), or( T, or( X, Z ) ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 10563, [ 'is_a_theorem'( or( X, or( Y, or( not( Z ), or( T, Z ) ) )
% 1.17/1.57 ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 10778, [ 'is_a_theorem'( or( X, or( not( Y ), or( Z, Y ) ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 10780, [ 'is_a_theorem'( or( not( X ), or( Y, X ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 10783, [] )
% 1.17/1.57 .
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 % SZS output end Refutation
% 1.17/1.57 found a proof!
% 1.17/1.57
% 1.17/1.57 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 1.17/1.57
% 1.17/1.57 initialclauses(
% 1.17/1.57 [ clause( 10785, [ ~( 'is_a_theorem'( or( not( X ), Y ) ) ), ~(
% 1.17/1.57 'is_a_theorem'( X ) ), 'is_a_theorem'( Y ) ] )
% 1.17/1.57 , clause( 10786, [ 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ),
% 1.17/1.57 or( Z, or( T, U ) ) ) ), or( not( or( not( T ), X ) ), or( Z, or( U, X )
% 1.17/1.57 ) ) ) ) ] )
% 1.17/1.57 , clause( 10787, [ ~( 'is_a_theorem'( or( not( a ), or( b, a ) ) ) ) ] )
% 1.17/1.57 ] ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 0, [ ~( 'is_a_theorem'( or( not( X ), Y ) ) ), 'is_a_theorem'( Y )
% 1.17/1.57 , ~( 'is_a_theorem'( X ) ) ] )
% 1.17/1.57 , clause( 10785, [ ~( 'is_a_theorem'( or( not( X ), Y ) ) ), ~(
% 1.17/1.57 'is_a_theorem'( X ) ), 'is_a_theorem'( Y ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.17/1.57 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 1, [ 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ), or( Z,
% 1.17/1.57 or( T, U ) ) ) ), or( not( or( not( T ), X ) ), or( Z, or( U, X ) ) ) ) )
% 1.17/1.57 ] )
% 1.17/1.57 , clause( 10786, [ 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ),
% 1.17/1.57 or( Z, or( T, U ) ) ) ), or( not( or( not( T ), X ) ), or( Z, or( U, X )
% 1.17/1.57 ) ) ) ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 1.17/1.57 , U )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 2, [ ~( 'is_a_theorem'( or( not( a ), or( b, a ) ) ) ) ] )
% 1.17/1.57 , clause( 10787, [ ~( 'is_a_theorem'( or( not( a ), or( b, a ) ) ) ) ] )
% 1.17/1.57 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10789, [ ~( 'is_a_theorem'( or( not( or( not( or( not( or( not( X )
% 1.17/1.57 , Y ) ), or( Z, or( T, U ) ) ) ), or( not( or( not( T ), X ) ), or( Z, or(
% 1.17/1.57 U, X ) ) ) ) ), W ) ) ), 'is_a_theorem'( W ) ] )
% 1.17/1.57 , clause( 0, [ ~( 'is_a_theorem'( or( not( X ), Y ) ) ), 'is_a_theorem'( Y
% 1.17/1.57 ), ~( 'is_a_theorem'( X ) ) ] )
% 1.17/1.57 , 2, clause( 1, [ 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ), or(
% 1.17/1.57 Z, or( T, U ) ) ) ), or( not( or( not( T ), X ) ), or( Z, or( U, X ) ) )
% 1.17/1.57 ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, or( not( or( not( or( not( X ), Y ) ), or( Z
% 1.17/1.57 , or( T, U ) ) ) ), or( not( or( not( T ), X ) ), or( Z, or( U, X ) ) ) )
% 1.17/1.57 ), :=( Y, W )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )
% 1.17/1.57 , :=( T, T ), :=( U, U )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 3, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( or( not( or( not( or(
% 1.17/1.57 not( or( not( X ), Y ) ), or( Z, or( T, U ) ) ) ), or( not( or( not( T )
% 1.17/1.57 , X ) ), or( Z, or( U, X ) ) ) ) ), W ) ) ) ] )
% 1.17/1.57 , clause( 10789, [ ~( 'is_a_theorem'( or( not( or( not( or( not( or( not( X
% 1.17/1.57 ), Y ) ), or( Z, or( T, U ) ) ) ), or( not( or( not( T ), X ) ), or( Z,
% 1.17/1.57 or( U, X ) ) ) ) ), W ) ) ), 'is_a_theorem'( W ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 1.17/1.57 , U ), :=( W, W )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10790, [ 'is_a_theorem'( or( not( or( not( X ), or( not( Y ), Z ) )
% 1.17/1.57 ), or( not( or( not( T ), Y ) ), or( or( U, Y ), or( not( Y ), Z ) ) ) )
% 1.17/1.57 ) ] )
% 1.17/1.57 , clause( 3, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( or( not( or( not( or(
% 1.17/1.57 not( or( not( X ), Y ) ), or( Z, or( T, U ) ) ) ), or( not( or( not( T )
% 1.17/1.57 , X ) ), or( Z, or( U, X ) ) ) ) ), W ) ) ) ] )
% 1.17/1.57 , 1, clause( 1, [ 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ), or(
% 1.17/1.57 Z, or( T, U ) ) ) ), or( not( or( not( T ), X ) ), or( Z, or( U, X ) ) )
% 1.17/1.57 ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, Y ), :=( Y, Z ), :=( Z, X ), :=( T, T ),
% 1.17/1.57 :=( U, U ), :=( W, or( not( or( not( X ), or( not( Y ), Z ) ) ), or( not(
% 1.17/1.57 or( not( T ), Y ) ), or( or( U, Y ), or( not( Y ), Z ) ) ) ) )] ),
% 1.17/1.57 substitution( 1, [ :=( X, or( not( Y ), Z ) ), :=( Y, or( X, or( T, U ) )
% 1.17/1.57 ), :=( Z, not( or( not( T ), Y ) ) ), :=( T, X ), :=( U, or( U, Y ) )] )
% 1.17/1.57 ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 4, [ 'is_a_theorem'( or( not( or( not( X ), or( not( Y ), Z ) ) ),
% 1.17/1.57 or( not( or( not( T ), Y ) ), or( or( U, Y ), or( not( Y ), Z ) ) ) ) ) ]
% 1.17/1.57 )
% 1.17/1.57 , clause( 10790, [ 'is_a_theorem'( or( not( or( not( X ), or( not( Y ), Z )
% 1.17/1.57 ) ), or( not( or( not( T ), Y ) ), or( or( U, Y ), or( not( Y ), Z ) ) )
% 1.17/1.57 ) ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 1.17/1.57 , U )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10791, [ 'is_a_theorem'( or( not( or( not( X ), or( not( Y ), Z ) )
% 1.17/1.57 ), or( or( T, or( not( Y ), Z ) ), or( not( or( not( Y ), Z ) ), or( U,
% 1.17/1.57 or( W, Z ) ) ) ) ) ) ] )
% 1.17/1.57 , clause( 3, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( or( not( or( not( or(
% 1.17/1.57 not( or( not( X ), Y ) ), or( Z, or( T, U ) ) ) ), or( not( or( not( T )
% 1.17/1.57 , X ) ), or( Z, or( U, X ) ) ) ) ), W ) ) ) ] )
% 1.17/1.57 , 1, clause( 4, [ 'is_a_theorem'( or( not( or( not( X ), or( not( Y ), Z )
% 1.17/1.57 ) ), or( not( or( not( T ), Y ) ), or( or( U, Y ), or( not( Y ), Z ) ) )
% 1.17/1.57 ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, Z ), :=( Y, V0 ), :=( Z, U ), :=( T, Y ),
% 1.17/1.57 :=( U, W ), :=( W, or( not( or( not( X ), or( not( Y ), Z ) ) ), or( or(
% 1.17/1.57 T, or( not( Y ), Z ) ), or( not( or( not( Y ), Z ) ), or( U, or( W, Z ) )
% 1.17/1.57 ) ) ) )] ), substitution( 1, [ :=( X, or( not( or( not( Z ), V0 ) ), or(
% 1.17/1.57 U, or( Y, W ) ) ) ), :=( Y, or( not( Y ), Z ) ), :=( Z, or( U, or( W, Z )
% 1.17/1.57 ) ), :=( T, X ), :=( U, T )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 5, [ 'is_a_theorem'( or( not( or( not( X ), or( not( Y ), Z ) ) ),
% 1.17/1.57 or( or( T, or( not( Y ), Z ) ), or( not( or( not( Y ), Z ) ), or( U, or(
% 1.17/1.57 W, Z ) ) ) ) ) ) ] )
% 1.17/1.57 , clause( 10791, [ 'is_a_theorem'( or( not( or( not( X ), or( not( Y ), Z )
% 1.17/1.57 ) ), or( or( T, or( not( Y ), Z ) ), or( not( or( not( Y ), Z ) ), or( U
% 1.17/1.57 , or( W, Z ) ) ) ) ) ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 1.17/1.57 , U ), :=( W, W )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10793, [ ~( 'is_a_theorem'( or( not( or( not( or( not( X ), or( not(
% 1.17/1.57 Y ), Z ) ) ), or( not( or( not( T ), Y ) ), or( or( U, Y ), or( not( Y )
% 1.17/1.57 , Z ) ) ) ) ), W ) ) ), 'is_a_theorem'( W ) ] )
% 1.17/1.57 , clause( 0, [ ~( 'is_a_theorem'( or( not( X ), Y ) ) ), 'is_a_theorem'( Y
% 1.17/1.57 ), ~( 'is_a_theorem'( X ) ) ] )
% 1.17/1.57 , 2, clause( 4, [ 'is_a_theorem'( or( not( or( not( X ), or( not( Y ), Z )
% 1.17/1.57 ) ), or( not( or( not( T ), Y ) ), or( or( U, Y ), or( not( Y ), Z ) ) )
% 1.17/1.57 ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, or( not( or( not( X ), or( not( Y ), Z ) ) )
% 1.17/1.57 , or( not( or( not( T ), Y ) ), or( or( U, Y ), or( not( Y ), Z ) ) ) ) )
% 1.17/1.57 , :=( Y, W )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ),
% 1.17/1.57 :=( T, T ), :=( U, U )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 6, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( or( not( or( not( or(
% 1.17/1.57 not( X ), or( not( Y ), Z ) ) ), or( not( or( not( T ), Y ) ), or( or( U
% 1.17/1.57 , Y ), or( not( Y ), Z ) ) ) ) ), W ) ) ) ] )
% 1.17/1.57 , clause( 10793, [ ~( 'is_a_theorem'( or( not( or( not( or( not( X ), or(
% 1.17/1.57 not( Y ), Z ) ) ), or( not( or( not( T ), Y ) ), or( or( U, Y ), or( not(
% 1.17/1.57 Y ), Z ) ) ) ) ), W ) ) ), 'is_a_theorem'( W ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 1.17/1.57 , U ), :=( W, W )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10794, [ 'is_a_theorem'( or( or( X, or( not( or( not( Y ), Z ) ),
% 1.17/1.57 or( T, or( U, Z ) ) ) ), or( not( or( not( or( not( Y ), Z ) ), or( T, or(
% 1.17/1.57 U, Z ) ) ) ), or( W, or( V0, or( T, or( U, Z ) ) ) ) ) ) ) ] )
% 1.17/1.57 , clause( 3, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( or( not( or( not( or(
% 1.17/1.57 not( or( not( X ), Y ) ), or( Z, or( T, U ) ) ) ), or( not( or( not( T )
% 1.17/1.57 , X ) ), or( Z, or( U, X ) ) ) ) ), W ) ) ) ] )
% 1.17/1.57 , 1, clause( 5, [ 'is_a_theorem'( or( not( or( not( X ), or( not( Y ), Z )
% 1.17/1.57 ) ), or( or( T, or( not( Y ), Z ) ), or( not( or( not( Y ), Z ) ), or( U
% 1.17/1.57 , or( W, Z ) ) ) ) ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, Z ), :=( Y, V1 ), :=( Z, T ), :=( T, Y ),
% 1.17/1.57 :=( U, U ), :=( W, or( or( X, or( not( or( not( Y ), Z ) ), or( T, or( U
% 1.17/1.57 , Z ) ) ) ), or( not( or( not( or( not( Y ), Z ) ), or( T, or( U, Z ) ) )
% 1.17/1.57 ), or( W, or( V0, or( T, or( U, Z ) ) ) ) ) ) )] ), substitution( 1, [
% 1.17/1.57 :=( X, or( not( or( not( Z ), V1 ) ), or( T, or( Y, U ) ) ) ), :=( Y, or(
% 1.17/1.57 not( Y ), Z ) ), :=( Z, or( T, or( U, Z ) ) ), :=( T, X ), :=( U, W ),
% 1.17/1.57 :=( W, V0 )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 7, [ 'is_a_theorem'( or( or( X, or( not( or( not( Y ), Z ) ), or( T
% 1.17/1.57 , or( U, Z ) ) ) ), or( not( or( not( or( not( Y ), Z ) ), or( T, or( U,
% 1.17/1.57 Z ) ) ) ), or( W, or( V0, or( T, or( U, Z ) ) ) ) ) ) ) ] )
% 1.17/1.57 , clause( 10794, [ 'is_a_theorem'( or( or( X, or( not( or( not( Y ), Z ) )
% 1.17/1.57 , or( T, or( U, Z ) ) ) ), or( not( or( not( or( not( Y ), Z ) ), or( T,
% 1.17/1.57 or( U, Z ) ) ) ), or( W, or( V0, or( T, or( U, Z ) ) ) ) ) ) ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 1.17/1.57 , U ), :=( W, W ), :=( V0, V0 )] ), permutation( 0, [ ==>( 0, 0 )] )
% 1.17/1.57 ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10795, [ 'is_a_theorem'( or( not( or( not( or( X, Y ) ), Z ) ), or(
% 1.17/1.57 not( or( not( T ), Y ) ), or( or( not( Y ), U ), Z ) ) ) ) ] )
% 1.17/1.57 , clause( 6, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( or( not( or( not( or(
% 1.17/1.57 not( X ), or( not( Y ), Z ) ) ), or( not( or( not( T ), Y ) ), or( or( U
% 1.17/1.57 , Y ), or( not( Y ), Z ) ) ) ) ), W ) ) ) ] )
% 1.17/1.57 , 1, clause( 1, [ 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ), or(
% 1.17/1.57 Z, or( T, U ) ) ) ), or( not( or( not( T ), X ) ), or( Z, or( U, X ) ) )
% 1.17/1.57 ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, Z ), :=( Y, Y ), :=( Z, U ), :=( T, T ),
% 1.17/1.57 :=( U, X ), :=( W, or( not( or( not( or( X, Y ) ), Z ) ), or( not( or(
% 1.17/1.57 not( T ), Y ) ), or( or( not( Y ), U ), Z ) ) ) )] ), substitution( 1, [
% 1.17/1.57 :=( X, Z ), :=( Y, or( not( Y ), U ) ), :=( Z, not( or( not( T ), Y ) ) )
% 1.17/1.57 , :=( T, or( X, Y ) ), :=( U, or( not( Y ), U ) )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 11, [ 'is_a_theorem'( or( not( or( not( or( X, Y ) ), Z ) ), or(
% 1.17/1.57 not( or( not( T ), Y ) ), or( or( not( Y ), U ), Z ) ) ) ) ] )
% 1.17/1.57 , clause( 10795, [ 'is_a_theorem'( or( not( or( not( or( X, Y ) ), Z ) ),
% 1.17/1.57 or( not( or( not( T ), Y ) ), or( or( not( Y ), U ), Z ) ) ) ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 1.17/1.57 , U )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10797, [ ~( 'is_a_theorem'( or( not( or( not( or( not( or( X, Y ) )
% 1.17/1.57 , Z ) ), or( not( or( not( T ), Y ) ), or( or( not( Y ), U ), Z ) ) ) ),
% 1.17/1.57 W ) ) ), 'is_a_theorem'( W ) ] )
% 1.17/1.57 , clause( 0, [ ~( 'is_a_theorem'( or( not( X ), Y ) ) ), 'is_a_theorem'( Y
% 1.17/1.57 ), ~( 'is_a_theorem'( X ) ) ] )
% 1.17/1.57 , 2, clause( 11, [ 'is_a_theorem'( or( not( or( not( or( X, Y ) ), Z ) ),
% 1.17/1.57 or( not( or( not( T ), Y ) ), or( or( not( Y ), U ), Z ) ) ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, or( not( or( not( or( X, Y ) ), Z ) ), or(
% 1.17/1.57 not( or( not( T ), Y ) ), or( or( not( Y ), U ), Z ) ) ) ), :=( Y, W )] )
% 1.17/1.57 , substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=(
% 1.17/1.57 U, U )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 14, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( or( not( or( not( or(
% 1.17/1.57 not( or( X, Y ) ), Z ) ), or( not( or( not( T ), Y ) ), or( or( not( Y )
% 1.17/1.57 , U ), Z ) ) ) ), W ) ) ) ] )
% 1.17/1.57 , clause( 10797, [ ~( 'is_a_theorem'( or( not( or( not( or( not( or( X, Y )
% 1.17/1.57 ), Z ) ), or( not( or( not( T ), Y ) ), or( or( not( Y ), U ), Z ) ) ) )
% 1.17/1.57 , W ) ) ), 'is_a_theorem'( W ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 1.17/1.57 , U ), :=( W, W )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10798, [ 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ), or(
% 1.17/1.57 Z, X ) ) ), or( not( or( not( T ), X ) ), or( U, or( Z, X ) ) ) ) ) ] )
% 1.17/1.57 , clause( 14, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( not( or( X, Y ) ), Z ) ), or( not( or( not( T ), Y ) ), or( or( not(
% 1.17/1.57 Y ), U ), Z ) ) ) ), W ) ) ) ] )
% 1.17/1.57 , 1, clause( 1, [ 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ), or(
% 1.17/1.57 Z, or( T, U ) ) ) ), or( not( or( not( T ), X ) ), or( Z, or( U, X ) ) )
% 1.17/1.57 ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, Z ), :=( Y, X ), :=( Z, U ), :=( T, T ),
% 1.17/1.57 :=( U, Y ), :=( W, or( not( or( not( or( not( X ), Y ) ), or( Z, X ) ) )
% 1.17/1.57 , or( not( or( not( T ), X ) ), or( U, or( Z, X ) ) ) ) )] ),
% 1.17/1.57 substitution( 1, [ :=( X, or( Z, X ) ), :=( Y, U ), :=( Z, not( or( not(
% 1.17/1.57 T ), X ) ) ), :=( T, or( not( X ), Y ) ), :=( U, U )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 18, [ 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ), or( Z
% 1.17/1.57 , X ) ) ), or( not( or( not( T ), X ) ), or( U, or( Z, X ) ) ) ) ) ] )
% 1.17/1.57 , clause( 10798, [ 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ),
% 1.17/1.57 or( Z, X ) ) ), or( not( or( not( T ), X ) ), or( U, or( Z, X ) ) ) ) ) ]
% 1.17/1.57 )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 1.17/1.57 , U )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10799, [ 'is_a_theorem'( or( not( or( not( X ), or( or( not( Y ), Z
% 1.17/1.57 ), Y ) ) ), or( T, or( not( or( not( U ), Y ) ), or( or( not( Y ), Z ),
% 1.17/1.57 Y ) ) ) ) ) ] )
% 1.17/1.57 , clause( 14, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( not( or( X, Y ) ), Z ) ), or( not( or( not( T ), Y ) ), or( or( not(
% 1.17/1.57 Y ), U ), Z ) ) ) ), W ) ) ) ] )
% 1.17/1.57 , 1, clause( 18, [ 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ),
% 1.17/1.57 or( Z, X ) ) ), or( not( or( not( T ), X ) ), or( U, or( Z, X ) ) ) ) ) ]
% 1.17/1.57 )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, or( not( Y ), Z ) ), :=( Y, Y ), :=( Z, Y )
% 1.17/1.57 , :=( T, U ), :=( U, Z ), :=( W, or( not( or( not( X ), or( or( not( Y )
% 1.17/1.57 , Z ), Y ) ) ), or( T, or( not( or( not( U ), Y ) ), or( or( not( Y ), Z
% 1.17/1.57 ), Y ) ) ) ) )] ), substitution( 1, [ :=( X, or( or( not( Y ), Z ), Y )
% 1.17/1.57 ), :=( Y, Y ), :=( Z, not( or( not( U ), Y ) ) ), :=( T, X ), :=( U, T )] )
% 1.17/1.57 ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 19, [ 'is_a_theorem'( or( not( or( not( X ), or( or( not( Y ), Z )
% 1.17/1.57 , Y ) ) ), or( T, or( not( or( not( U ), Y ) ), or( or( not( Y ), Z ), Y
% 1.17/1.57 ) ) ) ) ) ] )
% 1.17/1.57 , clause( 10799, [ 'is_a_theorem'( or( not( or( not( X ), or( or( not( Y )
% 1.17/1.57 , Z ), Y ) ) ), or( T, or( not( or( not( U ), Y ) ), or( or( not( Y ), Z
% 1.17/1.57 ), Y ) ) ) ) ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 1.17/1.57 , U )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10800, [ 'is_a_theorem'( or( not( or( not( X ), or( not( Y ), or( Z
% 1.17/1.57 , Y ) ) ) ), or( T, or( not( or( not( U ), Y ) ), or( not( Y ), or( Z, Y
% 1.17/1.57 ) ) ) ) ) ) ] )
% 1.17/1.57 , clause( 3, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( or( not( or( not( or(
% 1.17/1.57 not( or( not( X ), Y ) ), or( Z, or( T, U ) ) ) ), or( not( or( not( T )
% 1.17/1.57 , X ) ), or( Z, or( U, X ) ) ) ) ), W ) ) ) ] )
% 1.17/1.57 , 1, clause( 18, [ 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ),
% 1.17/1.57 or( Z, X ) ) ), or( not( or( not( T ), X ) ), or( U, or( Z, X ) ) ) ) ) ]
% 1.17/1.57 )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, Y ), :=( Y, or( Z, Y ) ), :=( Z, not( Y ) )
% 1.17/1.57 , :=( T, U ), :=( U, Z ), :=( W, or( not( or( not( X ), or( not( Y ), or(
% 1.17/1.57 Z, Y ) ) ) ), or( T, or( not( or( not( U ), Y ) ), or( not( Y ), or( Z, Y
% 1.17/1.57 ) ) ) ) ) )] ), substitution( 1, [ :=( X, or( not( Y ), or( Z, Y ) ) ),
% 1.17/1.57 :=( Y, or( not( Y ), or( U, Z ) ) ), :=( Z, not( or( not( U ), Y ) ) ),
% 1.17/1.57 :=( T, X ), :=( U, T )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 21, [ 'is_a_theorem'( or( not( or( not( X ), or( not( Y ), or( Z, Y
% 1.17/1.57 ) ) ) ), or( T, or( not( or( not( U ), Y ) ), or( not( Y ), or( Z, Y ) )
% 1.17/1.57 ) ) ) ) ] )
% 1.17/1.57 , clause( 10800, [ 'is_a_theorem'( or( not( or( not( X ), or( not( Y ), or(
% 1.17/1.57 Z, Y ) ) ) ), or( T, or( not( or( not( U ), Y ) ), or( not( Y ), or( Z, Y
% 1.17/1.57 ) ) ) ) ) ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 1.17/1.57 , U )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10801, [ ~( 'is_a_theorem'( or( not( or( or( X, or( not( or( not( Y
% 1.17/1.57 ), Z ) ), or( T, or( U, Z ) ) ) ), or( not( or( not( or( not( Y ), Z ) )
% 1.17/1.57 , or( T, or( U, Z ) ) ) ), or( W, or( V0, or( T, or( U, Z ) ) ) ) ) ) ),
% 1.17/1.57 V1 ) ) ), 'is_a_theorem'( V1 ) ] )
% 1.17/1.57 , clause( 0, [ ~( 'is_a_theorem'( or( not( X ), Y ) ) ), 'is_a_theorem'( Y
% 1.17/1.57 ), ~( 'is_a_theorem'( X ) ) ] )
% 1.17/1.57 , 2, clause( 7, [ 'is_a_theorem'( or( or( X, or( not( or( not( Y ), Z ) ),
% 1.17/1.57 or( T, or( U, Z ) ) ) ), or( not( or( not( or( not( Y ), Z ) ), or( T, or(
% 1.17/1.57 U, Z ) ) ) ), or( W, or( V0, or( T, or( U, Z ) ) ) ) ) ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, or( or( X, or( not( or( not( Y ), Z ) ), or(
% 1.17/1.57 T, or( U, Z ) ) ) ), or( not( or( not( or( not( Y ), Z ) ), or( T, or( U
% 1.17/1.57 , Z ) ) ) ), or( W, or( V0, or( T, or( U, Z ) ) ) ) ) ) ), :=( Y, V1 )] )
% 1.17/1.57 , substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=(
% 1.17/1.57 U, U ), :=( W, W ), :=( V0, V0 )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 23, [ 'is_a_theorem'( V1 ), ~( 'is_a_theorem'( or( not( or( or( X,
% 1.17/1.57 or( not( or( not( Y ), Z ) ), or( T, or( U, Z ) ) ) ), or( not( or( not(
% 1.17/1.57 or( not( Y ), Z ) ), or( T, or( U, Z ) ) ) ), or( W, or( V0, or( T, or( U
% 1.17/1.57 , Z ) ) ) ) ) ) ), V1 ) ) ) ] )
% 1.17/1.57 , clause( 10801, [ ~( 'is_a_theorem'( or( not( or( or( X, or( not( or( not(
% 1.17/1.57 Y ), Z ) ), or( T, or( U, Z ) ) ) ), or( not( or( not( or( not( Y ), Z )
% 1.17/1.57 ), or( T, or( U, Z ) ) ) ), or( W, or( V0, or( T, or( U, Z ) ) ) ) ) ) )
% 1.17/1.57 , V1 ) ) ), 'is_a_theorem'( V1 ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 1.17/1.57 , U ), :=( W, W ), :=( V0, V0 ), :=( V1, V1 )] ), permutation( 0, [ ==>(
% 1.17/1.57 0, 1 ), ==>( 1, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10803, [ ~( 'is_a_theorem'( or( not( or( not( or( not( X ), or( or(
% 1.17/1.57 not( Y ), Z ), Y ) ) ), or( T, or( not( or( not( U ), Y ) ), or( or( not(
% 1.17/1.57 Y ), Z ), Y ) ) ) ) ), W ) ) ), 'is_a_theorem'( W ) ] )
% 1.17/1.57 , clause( 0, [ ~( 'is_a_theorem'( or( not( X ), Y ) ) ), 'is_a_theorem'( Y
% 1.17/1.57 ), ~( 'is_a_theorem'( X ) ) ] )
% 1.17/1.57 , 2, clause( 19, [ 'is_a_theorem'( or( not( or( not( X ), or( or( not( Y )
% 1.17/1.57 , Z ), Y ) ) ), or( T, or( not( or( not( U ), Y ) ), or( or( not( Y ), Z
% 1.17/1.57 ), Y ) ) ) ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, or( not( or( not( X ), or( or( not( Y ), Z )
% 1.17/1.57 , Y ) ) ), or( T, or( not( or( not( U ), Y ) ), or( or( not( Y ), Z ), Y
% 1.17/1.57 ) ) ) ) ), :=( Y, W )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ),
% 1.17/1.57 :=( Z, Z ), :=( T, T ), :=( U, U )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 28, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( or( not( or( not( or(
% 1.17/1.57 not( X ), or( or( not( Y ), Z ), Y ) ) ), or( T, or( not( or( not( U ), Y
% 1.17/1.57 ) ), or( or( not( Y ), Z ), Y ) ) ) ) ), W ) ) ) ] )
% 1.17/1.57 , clause( 10803, [ ~( 'is_a_theorem'( or( not( or( not( or( not( X ), or(
% 1.17/1.57 or( not( Y ), Z ), Y ) ) ), or( T, or( not( or( not( U ), Y ) ), or( or(
% 1.17/1.57 not( Y ), Z ), Y ) ) ) ) ), W ) ) ), 'is_a_theorem'( W ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 1.17/1.57 , U ), :=( W, W )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10804, [ 'is_a_theorem'( or( X, or( not( or( not( Y ), or( not( Z )
% 1.17/1.57 , T ) ) ), or( not( or( not( Z ), T ) ), or( U, or( not( Z ), T ) ) ) ) )
% 1.17/1.57 ) ] )
% 1.17/1.57 , clause( 3, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( or( not( or( not( or(
% 1.17/1.57 not( or( not( X ), Y ) ), or( Z, or( T, U ) ) ) ), or( not( or( not( T )
% 1.17/1.57 , X ) ), or( Z, or( U, X ) ) ) ) ), W ) ) ) ] )
% 1.17/1.57 , 1, clause( 21, [ 'is_a_theorem'( or( not( or( not( X ), or( not( Y ), or(
% 1.17/1.57 Z, Y ) ) ) ), or( T, or( not( or( not( U ), Y ) ), or( not( Y ), or( Z, Y
% 1.17/1.57 ) ) ) ) ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, T ), :=( Y, W ), :=( Z, U ), :=( T, Z ),
% 1.17/1.57 :=( U, not( Z ) ), :=( W, or( X, or( not( or( not( Y ), or( not( Z ), T )
% 1.17/1.57 ) ), or( not( or( not( Z ), T ) ), or( U, or( not( Z ), T ) ) ) ) ) )] )
% 1.17/1.57 , substitution( 1, [ :=( X, or( not( or( not( T ), W ) ), or( U, or( Z,
% 1.17/1.57 not( Z ) ) ) ) ), :=( Y, or( not( Z ), T ) ), :=( Z, U ), :=( T, X ),
% 1.17/1.57 :=( U, Y )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 31, [ 'is_a_theorem'( or( X, or( not( or( not( Y ), or( not( Z ), T
% 1.17/1.57 ) ) ), or( not( or( not( Z ), T ) ), or( U, or( not( Z ), T ) ) ) ) ) )
% 1.17/1.57 ] )
% 1.17/1.57 , clause( 10804, [ 'is_a_theorem'( or( X, or( not( or( not( Y ), or( not( Z
% 1.17/1.57 ), T ) ) ), or( not( or( not( Z ), T ) ), or( U, or( not( Z ), T ) ) ) )
% 1.17/1.57 ) ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 1.17/1.57 , U )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10805, [ 'is_a_theorem'( or( not( or( not( X ), or( not( Y ), Z ) )
% 1.17/1.57 ), or( not( or( not( Y ), Z ) ), or( T, or( not( Y ), Z ) ) ) ) ) ] )
% 1.17/1.57 , clause( 14, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( not( or( X, Y ) ), Z ) ), or( not( or( not( T ), Y ) ), or( or( not(
% 1.17/1.57 Y ), U ), Z ) ) ) ), W ) ) ) ] )
% 1.17/1.57 , 1, clause( 31, [ 'is_a_theorem'( or( X, or( not( or( not( Y ), or( not( Z
% 1.17/1.57 ), T ) ) ), or( not( or( not( Z ), T ) ), or( U, or( not( Z ), T ) ) ) )
% 1.17/1.57 ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, U ), :=( Y, W ), :=( Z, V0 ), :=( T, V1 ),
% 1.17/1.57 :=( U, V2 ), :=( W, or( not( or( not( X ), or( not( Y ), Z ) ) ), or( not(
% 1.17/1.57 or( not( Y ), Z ) ), or( T, or( not( Y ), Z ) ) ) ) )] ), substitution( 1
% 1.17/1.57 , [ :=( X, not( or( not( or( not( or( U, W ) ), V0 ) ), or( not( or( not(
% 1.17/1.57 V1 ), W ) ), or( or( not( W ), V2 ), V0 ) ) ) ) ), :=( Y, X ), :=( Z, Y )
% 1.17/1.57 , :=( T, Z ), :=( U, T )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 33, [ 'is_a_theorem'( or( not( or( not( X ), or( not( Y ), Z ) ) )
% 1.17/1.57 , or( not( or( not( Y ), Z ) ), or( T, or( not( Y ), Z ) ) ) ) ) ] )
% 1.17/1.57 , clause( 10805, [ 'is_a_theorem'( or( not( or( not( X ), or( not( Y ), Z )
% 1.17/1.57 ) ), or( not( or( not( Y ), Z ) ), or( T, or( not( Y ), Z ) ) ) ) ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 1.17/1.57 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10807, [ ~( 'is_a_theorem'( or( not( or( not( or( not( X ), or( not(
% 1.17/1.57 Y ), Z ) ) ), or( not( or( not( Y ), Z ) ), or( T, or( not( Y ), Z ) ) )
% 1.17/1.57 ) ), U ) ) ), 'is_a_theorem'( U ) ] )
% 1.17/1.57 , clause( 0, [ ~( 'is_a_theorem'( or( not( X ), Y ) ) ), 'is_a_theorem'( Y
% 1.17/1.57 ), ~( 'is_a_theorem'( X ) ) ] )
% 1.17/1.57 , 2, clause( 33, [ 'is_a_theorem'( or( not( or( not( X ), or( not( Y ), Z )
% 1.17/1.57 ) ), or( not( or( not( Y ), Z ) ), or( T, or( not( Y ), Z ) ) ) ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, or( not( or( not( X ), or( not( Y ), Z ) ) )
% 1.17/1.57 , or( not( or( not( Y ), Z ) ), or( T, or( not( Y ), Z ) ) ) ) ), :=( Y,
% 1.17/1.57 U )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] )
% 1.17/1.57 ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 42, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( or( not( or( not( or(
% 1.17/1.57 not( X ), or( not( Y ), Z ) ) ), or( not( or( not( Y ), Z ) ), or( T, or(
% 1.17/1.57 not( Y ), Z ) ) ) ) ), U ) ) ) ] )
% 1.17/1.57 , clause( 10807, [ ~( 'is_a_theorem'( or( not( or( not( or( not( X ), or(
% 1.17/1.57 not( Y ), Z ) ) ), or( not( or( not( Y ), Z ) ), or( T, or( not( Y ), Z )
% 1.17/1.57 ) ) ) ), U ) ) ), 'is_a_theorem'( U ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 1.17/1.57 , U )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10808, [ 'is_a_theorem'( or( not( or( not( X ), or( Y, or( not( Z )
% 1.17/1.57 , T ) ) ) ), or( U, or( not( or( not( Z ), T ) ), or( Y, or( not( Z ), T
% 1.17/1.57 ) ) ) ) ) ) ] )
% 1.17/1.57 , clause( 42, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( not( X ), or( not( Y ), Z ) ) ), or( not( or( not( Y ), Z ) ), or( T
% 1.17/1.57 , or( not( Y ), Z ) ) ) ) ), U ) ) ) ] )
% 1.17/1.57 , 1, clause( 18, [ 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ),
% 1.17/1.57 or( Z, X ) ) ), or( not( or( not( T ), X ) ), or( U, or( Z, X ) ) ) ) ) ]
% 1.17/1.57 )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, or( Y, or( not( Z ), T ) ) ), :=( Y, Z ),
% 1.17/1.57 :=( Z, T ), :=( T, Y ), :=( U, or( not( or( not( X ), or( Y, or( not( Z )
% 1.17/1.57 , T ) ) ) ), or( U, or( not( or( not( Z ), T ) ), or( Y, or( not( Z ), T
% 1.17/1.57 ) ) ) ) ) )] ), substitution( 1, [ :=( X, or( Y, or( not( Z ), T ) ) ),
% 1.17/1.57 :=( Y, or( not( Z ), T ) ), :=( Z, not( or( not( Z ), T ) ) ), :=( T, X )
% 1.17/1.57 , :=( U, U )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 51, [ 'is_a_theorem'( or( not( or( not( X ), or( Y, or( not( Z ), T
% 1.17/1.57 ) ) ) ), or( U, or( not( or( not( Z ), T ) ), or( Y, or( not( Z ), T ) )
% 1.17/1.57 ) ) ) ) ] )
% 1.17/1.57 , clause( 10808, [ 'is_a_theorem'( or( not( or( not( X ), or( Y, or( not( Z
% 1.17/1.57 ), T ) ) ) ), or( U, or( not( or( not( Z ), T ) ), or( Y, or( not( Z ),
% 1.17/1.57 T ) ) ) ) ) ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 1.17/1.57 , U )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10809, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( not( or(
% 1.17/1.57 not( Z ), T ) ), or( or( not( Z ), T ), Y ) ) ) ) ] )
% 1.17/1.57 , clause( 42, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( not( X ), or( not( Y ), Z ) ) ), or( not( or( not( Y ), Z ) ), or( T
% 1.17/1.57 , or( not( Y ), Z ) ) ) ) ), U ) ) ) ] )
% 1.17/1.57 , 1, clause( 1, [ 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ), or(
% 1.17/1.57 Z, or( T, U ) ) ) ), or( not( or( not( T ), X ) ), or( Z, or( U, X ) ) )
% 1.17/1.57 ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, Y ), :=( Y, Z ), :=( Z, T ), :=( T, X ),
% 1.17/1.57 :=( U, or( not( or( not( X ), Y ) ), or( not( or( not( Z ), T ) ), or( or(
% 1.17/1.57 not( Z ), T ), Y ) ) ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, or(
% 1.17/1.57 not( Z ), T ) ), :=( Z, not( or( not( Z ), T ) ) ), :=( T, X ), :=( U, or(
% 1.17/1.57 not( Z ), T ) )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 53, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( not( or(
% 1.17/1.57 not( Z ), T ) ), or( or( not( Z ), T ), Y ) ) ) ) ] )
% 1.17/1.57 , clause( 10809, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( not(
% 1.17/1.57 or( not( Z ), T ) ), or( or( not( Z ), T ), Y ) ) ) ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 1.17/1.57 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10811, [ ~( 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ),
% 1.17/1.57 or( not( or( not( Z ), T ) ), or( or( not( Z ), T ), Y ) ) ) ), U ) ) ),
% 1.17/1.57 'is_a_theorem'( U ) ] )
% 1.17/1.57 , clause( 0, [ ~( 'is_a_theorem'( or( not( X ), Y ) ) ), 'is_a_theorem'( Y
% 1.17/1.57 ), ~( 'is_a_theorem'( X ) ) ] )
% 1.17/1.57 , 2, clause( 53, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( not(
% 1.17/1.57 or( not( Z ), T ) ), or( or( not( Z ), T ), Y ) ) ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, or( not( or( not( X ), Y ) ), or( not( or(
% 1.17/1.57 not( Z ), T ) ), or( or( not( Z ), T ), Y ) ) ) ), :=( Y, U )] ),
% 1.17/1.57 substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 64, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( or( not( or( not( or(
% 1.17/1.57 not( X ), Y ) ), or( not( or( not( Z ), T ) ), or( or( not( Z ), T ), Y )
% 1.17/1.57 ) ) ), U ) ) ) ] )
% 1.17/1.57 , clause( 10811, [ ~( 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) )
% 1.17/1.57 , or( not( or( not( Z ), T ) ), or( or( not( Z ), T ), Y ) ) ) ), U ) ) )
% 1.17/1.57 , 'is_a_theorem'( U ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 1.17/1.57 , U )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10812, [ 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ), Z )
% 1.17/1.57 ), or( not( or( not( X ), Y ) ), or( T, Z ) ) ) ) ] )
% 1.17/1.57 , clause( 64, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( not( X ), Y ) ), or( not( or( not( Z ), T ) ), or( or( not( Z ), T )
% 1.17/1.57 , Y ) ) ) ), U ) ) ) ] )
% 1.17/1.57 , 1, clause( 1, [ 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ), or(
% 1.17/1.57 Z, or( T, U ) ) ) ), or( not( or( not( T ), X ) ), or( Z, or( U, X ) ) )
% 1.17/1.57 ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, Z ), :=( Y, T ), :=( Z, X ), :=( T, Y ),
% 1.17/1.57 :=( U, or( not( or( not( or( not( X ), Y ) ), Z ) ), or( not( or( not( X
% 1.17/1.57 ), Y ) ), or( T, Z ) ) ) )] ), substitution( 1, [ :=( X, Z ), :=( Y, T )
% 1.17/1.57 , :=( Z, not( or( not( X ), Y ) ) ), :=( T, or( not( X ), Y ) ), :=( U, T
% 1.17/1.57 )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 94, [ 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ), Z ) )
% 1.17/1.57 , or( not( or( not( X ), Y ) ), or( T, Z ) ) ) ) ] )
% 1.17/1.57 , clause( 10812, [ 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ), Z
% 1.17/1.57 ) ), or( not( or( not( X ), Y ) ), or( T, Z ) ) ) ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 1.17/1.57 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10814, [ ~( 'is_a_theorem'( or( not( or( not( or( not( or( not( X )
% 1.17/1.57 , Y ) ), Z ) ), or( not( or( not( X ), Y ) ), or( T, Z ) ) ) ), U ) ) ),
% 1.17/1.57 'is_a_theorem'( U ) ] )
% 1.17/1.57 , clause( 0, [ ~( 'is_a_theorem'( or( not( X ), Y ) ) ), 'is_a_theorem'( Y
% 1.17/1.57 ), ~( 'is_a_theorem'( X ) ) ] )
% 1.17/1.57 , 2, clause( 94, [ 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ), Z
% 1.17/1.57 ) ), or( not( or( not( X ), Y ) ), or( T, Z ) ) ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, or( not( or( not( or( not( X ), Y ) ), Z ) )
% 1.17/1.57 , or( not( or( not( X ), Y ) ), or( T, Z ) ) ) ), :=( Y, U )] ),
% 1.17/1.57 substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 101, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( or( not( or( not( or(
% 1.17/1.57 not( or( not( X ), Y ) ), Z ) ), or( not( or( not( X ), Y ) ), or( T, Z )
% 1.17/1.57 ) ) ), U ) ) ) ] )
% 1.17/1.57 , clause( 10814, [ ~( 'is_a_theorem'( or( not( or( not( or( not( or( not( X
% 1.17/1.57 ), Y ) ), Z ) ), or( not( or( not( X ), Y ) ), or( T, Z ) ) ) ), U ) ) )
% 1.17/1.57 , 'is_a_theorem'( U ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 1.17/1.57 , U )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10815, [ 'is_a_theorem'( or( X, or( not( or( not( Y ), Z ) ), or(
% 1.17/1.57 not( or( not( T ), U ) ), or( not( Y ), Z ) ) ) ) ) ] )
% 1.17/1.57 , clause( 101, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( not( or( not( X ), Y ) ), Z ) ), or( not( or( not( X ), Y ) ), or( T
% 1.17/1.57 , Z ) ) ) ), U ) ) ) ] )
% 1.17/1.57 , 1, clause( 51, [ 'is_a_theorem'( or( not( or( not( X ), or( Y, or( not( Z
% 1.17/1.57 ), T ) ) ) ), or( U, or( not( or( not( Z ), T ) ), or( Y, or( not( Z ),
% 1.17/1.57 T ) ) ) ) ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, T ), :=( Y, U ), :=( Z, Z ), :=( T, not( Y )
% 1.17/1.57 ), :=( U, or( X, or( not( or( not( Y ), Z ) ), or( not( or( not( T ), U
% 1.17/1.57 ) ), or( not( Y ), Z ) ) ) ) )] ), substitution( 1, [ :=( X, or( not( or(
% 1.17/1.57 not( T ), U ) ), Z ) ), :=( Y, not( or( not( T ), U ) ) ), :=( Z, Y ),
% 1.17/1.57 :=( T, Z ), :=( U, X )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 211, [ 'is_a_theorem'( or( X, or( not( or( not( Y ), Z ) ), or( not(
% 1.17/1.57 or( not( T ), U ) ), or( not( Y ), Z ) ) ) ) ) ] )
% 1.17/1.57 , clause( 10815, [ 'is_a_theorem'( or( X, or( not( or( not( Y ), Z ) ), or(
% 1.17/1.57 not( or( not( T ), U ) ), or( not( Y ), Z ) ) ) ) ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 1.17/1.57 , U )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10816, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( not( or(
% 1.17/1.57 not( Z ), T ) ), or( not( X ), Y ) ) ) ) ] )
% 1.17/1.57 , clause( 23, [ 'is_a_theorem'( V1 ), ~( 'is_a_theorem'( or( not( or( or( X
% 1.17/1.57 , or( not( or( not( Y ), Z ) ), or( T, or( U, Z ) ) ) ), or( not( or( not(
% 1.17/1.57 or( not( Y ), Z ) ), or( T, or( U, Z ) ) ) ), or( W, or( V0, or( T, or( U
% 1.17/1.57 , Z ) ) ) ) ) ) ), V1 ) ) ) ] )
% 1.17/1.57 , 1, clause( 211, [ 'is_a_theorem'( or( X, or( not( or( not( Y ), Z ) ), or(
% 1.17/1.57 not( or( not( T ), U ) ), or( not( Y ), Z ) ) ) ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, U ), :=( Y, W ), :=( Z, V0 ), :=( T, V1 ),
% 1.17/1.57 :=( U, V2 ), :=( W, V3 ), :=( V0, V4 ), :=( V1, or( not( or( not( X ), Y
% 1.17/1.57 ) ), or( not( or( not( Z ), T ) ), or( not( X ), Y ) ) ) )] ),
% 1.17/1.57 substitution( 1, [ :=( X, not( or( or( U, or( not( or( not( W ), V0 ) ),
% 1.17/1.57 or( V1, or( V2, V0 ) ) ) ), or( not( or( not( or( not( W ), V0 ) ), or(
% 1.17/1.57 V1, or( V2, V0 ) ) ) ), or( V3, or( V4, or( V1, or( V2, V0 ) ) ) ) ) ) )
% 1.17/1.57 ), :=( Y, X ), :=( Z, Y ), :=( T, Z ), :=( U, T )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 213, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( not( or(
% 1.17/1.57 not( Z ), T ) ), or( not( X ), Y ) ) ) ) ] )
% 1.17/1.57 , clause( 10816, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( not(
% 1.17/1.57 or( not( Z ), T ) ), or( not( X ), Y ) ) ) ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 1.17/1.57 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10818, [ ~( 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ),
% 1.17/1.57 or( not( or( not( Z ), T ) ), or( not( X ), Y ) ) ) ), U ) ) ),
% 1.17/1.57 'is_a_theorem'( U ) ] )
% 1.17/1.57 , clause( 0, [ ~( 'is_a_theorem'( or( not( X ), Y ) ) ), 'is_a_theorem'( Y
% 1.17/1.57 ), ~( 'is_a_theorem'( X ) ) ] )
% 1.17/1.57 , 2, clause( 213, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( not(
% 1.17/1.57 or( not( Z ), T ) ), or( not( X ), Y ) ) ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, or( not( or( not( X ), Y ) ), or( not( or(
% 1.17/1.57 not( Z ), T ) ), or( not( X ), Y ) ) ) ), :=( Y, U )] ), substitution( 1
% 1.17/1.57 , [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 215, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( or( not( or( not( or(
% 1.17/1.57 not( X ), Y ) ), or( not( or( not( Z ), T ) ), or( not( X ), Y ) ) ) ), U
% 1.17/1.57 ) ) ) ] )
% 1.17/1.57 , clause( 10818, [ ~( 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) )
% 1.17/1.57 , or( not( or( not( Z ), T ) ), or( not( X ), Y ) ) ) ), U ) ) ),
% 1.17/1.57 'is_a_theorem'( U ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 1.17/1.57 , U )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10819, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( Z, or(
% 1.17/1.57 not( or( not( T ), U ) ), or( not( X ), Y ) ) ) ) ) ] )
% 1.17/1.57 , clause( 215, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( not( X ), Y ) ), or( not( or( not( Z ), T ) ), or( not( X ), Y ) ) )
% 1.17/1.57 ), U ) ) ) ] )
% 1.17/1.57 , 1, clause( 94, [ 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ), Z
% 1.17/1.57 ) ), or( not( or( not( X ), Y ) ), or( T, Z ) ) ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, T ), :=( T, U ),
% 1.17/1.57 :=( U, or( not( or( not( X ), Y ) ), or( Z, or( not( or( not( T ), U ) )
% 1.17/1.57 , or( not( X ), Y ) ) ) ) )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )
% 1.17/1.57 , :=( Z, or( not( or( not( T ), U ) ), or( not( X ), Y ) ) ), :=( T, Z )] )
% 1.17/1.57 ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 218, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( Z, or( not(
% 1.17/1.57 or( not( T ), U ) ), or( not( X ), Y ) ) ) ) ) ] )
% 1.17/1.57 , clause( 10819, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( Z, or(
% 1.17/1.57 not( or( not( T ), U ) ), or( not( X ), Y ) ) ) ) ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 1.17/1.57 , U )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10821, [ ~( 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ),
% 1.17/1.57 or( Z, or( not( or( not( T ), U ) ), or( not( X ), Y ) ) ) ) ), W ) ) ),
% 1.17/1.57 'is_a_theorem'( W ) ] )
% 1.17/1.57 , clause( 0, [ ~( 'is_a_theorem'( or( not( X ), Y ) ) ), 'is_a_theorem'( Y
% 1.17/1.57 ), ~( 'is_a_theorem'( X ) ) ] )
% 1.17/1.57 , 2, clause( 218, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( Z, or(
% 1.17/1.57 not( or( not( T ), U ) ), or( not( X ), Y ) ) ) ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, or( not( or( not( X ), Y ) ), or( Z, or( not(
% 1.17/1.57 or( not( T ), U ) ), or( not( X ), Y ) ) ) ) ), :=( Y, W )] ),
% 1.17/1.57 substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 1.17/1.57 , U )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 230, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( or( not( or( not( or(
% 1.17/1.57 not( X ), Y ) ), or( Z, or( not( or( not( T ), U ) ), or( not( X ), Y ) )
% 1.17/1.57 ) ) ), W ) ) ) ] )
% 1.17/1.57 , clause( 10821, [ ~( 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) )
% 1.17/1.57 , or( Z, or( not( or( not( T ), U ) ), or( not( X ), Y ) ) ) ) ), W ) ) )
% 1.17/1.57 , 'is_a_theorem'( W ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 1.17/1.57 , U ), :=( W, W )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10822, [ 'is_a_theorem'( or( not( or( not( X ), or( not( or( not( Y
% 1.17/1.57 ), Z ) ), or( or( not( Z ), T ), Z ) ) ) ), or( U, or( W, or( not( or(
% 1.17/1.57 not( Y ), Z ) ), or( or( not( Z ), T ), Z ) ) ) ) ) ) ] )
% 1.17/1.57 , clause( 28, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( not( X ), or( or( not( Y ), Z ), Y ) ) ), or( T, or( not( or( not( U
% 1.17/1.57 ), Y ) ), or( or( not( Y ), Z ), Y ) ) ) ) ), W ) ) ) ] )
% 1.17/1.57 , 1, clause( 18, [ 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ),
% 1.17/1.57 or( Z, X ) ) ), or( not( or( not( T ), X ) ), or( U, or( Z, X ) ) ) ) ) ]
% 1.17/1.57 )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, or( not( or( not( Y ), Z ) ), or( or( not( Z
% 1.17/1.57 ), T ), Z ) ) ), :=( Y, Z ), :=( Z, T ), :=( T, W ), :=( U, Y ), :=( W,
% 1.17/1.57 or( not( or( not( X ), or( not( or( not( Y ), Z ) ), or( or( not( Z ), T
% 1.17/1.57 ), Z ) ) ) ), or( U, or( W, or( not( or( not( Y ), Z ) ), or( or( not( Z
% 1.17/1.57 ), T ), Z ) ) ) ) ) )] ), substitution( 1, [ :=( X, or( not( or( not( Y
% 1.17/1.57 ), Z ) ), or( or( not( Z ), T ), Z ) ) ), :=( Y, or( or( not( Z ), T ),
% 1.17/1.57 Z ) ), :=( Z, W ), :=( T, X ), :=( U, U )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 257, [ 'is_a_theorem'( or( not( or( not( X ), or( not( or( not( Y )
% 1.17/1.57 , Z ) ), or( or( not( Z ), T ), Z ) ) ) ), or( U, or( W, or( not( or( not(
% 1.17/1.57 Y ), Z ) ), or( or( not( Z ), T ), Z ) ) ) ) ) ) ] )
% 1.17/1.57 , clause( 10822, [ 'is_a_theorem'( or( not( or( not( X ), or( not( or( not(
% 1.17/1.57 Y ), Z ) ), or( or( not( Z ), T ), Z ) ) ) ), or( U, or( W, or( not( or(
% 1.17/1.57 not( Y ), Z ) ), or( or( not( Z ), T ), Z ) ) ) ) ) ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 1.17/1.57 , U ), :=( W, W )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10823, [ 'is_a_theorem'( or( not( or( not( not( or( not( X ), Y ) )
% 1.17/1.57 ), Z ) ), or( T, or( or( not( Z ), U ), Z ) ) ) ) ] )
% 1.17/1.57 , clause( 230, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( not( X ), Y ) ), or( Z, or( not( or( not( T ), U ) ), or( not( X ), Y
% 1.17/1.57 ) ) ) ) ), W ) ) ) ] )
% 1.17/1.57 , 1, clause( 1, [ 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ), or(
% 1.17/1.57 Z, or( T, U ) ) ) ), or( not( or( not( T ), X ) ), or( Z, or( U, X ) ) )
% 1.17/1.57 ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, Z ), :=( Y, U ), :=( Z, T ), :=( T, X ),
% 1.17/1.57 :=( U, Y ), :=( W, or( not( or( not( not( or( not( X ), Y ) ) ), Z ) ),
% 1.17/1.57 or( T, or( or( not( Z ), U ), Z ) ) ) )] ), substitution( 1, [ :=( X, Z )
% 1.17/1.57 , :=( Y, U ), :=( Z, T ), :=( T, not( or( not( X ), Y ) ) ), :=( U, or(
% 1.17/1.57 not( Z ), U ) )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 377, [ 'is_a_theorem'( or( not( or( not( not( or( not( X ), Y ) ) )
% 1.17/1.57 , Z ) ), or( T, or( or( not( Z ), U ), Z ) ) ) ) ] )
% 1.17/1.57 , clause( 10823, [ 'is_a_theorem'( or( not( or( not( not( or( not( X ), Y )
% 1.17/1.57 ) ), Z ) ), or( T, or( or( not( Z ), U ), Z ) ) ) ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 1.17/1.57 , U )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10825, [ ~( 'is_a_theorem'( or( not( or( not( or( not( not( or( not(
% 1.17/1.57 X ), Y ) ) ), Z ) ), or( T, or( or( not( Z ), U ), Z ) ) ) ), W ) ) ),
% 1.17/1.57 'is_a_theorem'( W ) ] )
% 1.17/1.57 , clause( 0, [ ~( 'is_a_theorem'( or( not( X ), Y ) ) ), 'is_a_theorem'( Y
% 1.17/1.57 ), ~( 'is_a_theorem'( X ) ) ] )
% 1.17/1.57 , 2, clause( 377, [ 'is_a_theorem'( or( not( or( not( not( or( not( X ), Y
% 1.17/1.57 ) ) ), Z ) ), or( T, or( or( not( Z ), U ), Z ) ) ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, or( not( or( not( not( or( not( X ), Y ) ) )
% 1.17/1.57 , Z ) ), or( T, or( or( not( Z ), U ), Z ) ) ) ), :=( Y, W )] ),
% 1.17/1.57 substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 1.17/1.57 , U )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 399, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( or( not( or( not( or(
% 1.17/1.57 not( not( or( not( X ), Y ) ) ), Z ) ), or( T, or( or( not( Z ), U ), Z )
% 1.17/1.57 ) ) ), W ) ) ) ] )
% 1.17/1.57 , clause( 10825, [ ~( 'is_a_theorem'( or( not( or( not( or( not( not( or(
% 1.17/1.57 not( X ), Y ) ) ), Z ) ), or( T, or( or( not( Z ), U ), Z ) ) ) ), W ) )
% 1.17/1.57 ), 'is_a_theorem'( W ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 1.17/1.57 , U ), :=( W, W )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10826, [ 'is_a_theorem'( or( X, or( not( or( not( Y ), Z ) ), or(
% 1.17/1.57 not( Z ), or( or( not( Z ), T ), Z ) ) ) ) ) ] )
% 1.17/1.57 , clause( 399, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( not( not( or( not( X ), Y ) ) ), Z ) ), or( T, or( or( not( Z ), U )
% 1.17/1.57 , Z ) ) ) ), W ) ) ) ] )
% 1.17/1.57 , 1, clause( 21, [ 'is_a_theorem'( or( not( or( not( X ), or( not( Y ), or(
% 1.17/1.57 Z, Y ) ) ) ), or( T, or( not( or( not( U ), Y ) ), or( not( Y ), or( Z, Y
% 1.17/1.57 ) ) ) ) ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, U ), :=( Y, W ), :=( Z, Z ), :=( T, not( Z )
% 1.17/1.57 ), :=( U, T ), :=( W, or( X, or( not( or( not( Y ), Z ) ), or( not( Z )
% 1.17/1.57 , or( or( not( Z ), T ), Z ) ) ) ) )] ), substitution( 1, [ :=( X, or(
% 1.17/1.57 not( not( or( not( U ), W ) ) ), Z ) ), :=( Y, Z ), :=( Z, or( not( Z ),
% 1.17/1.57 T ) ), :=( T, X ), :=( U, Y )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 452, [ 'is_a_theorem'( or( X, or( not( or( not( Y ), Z ) ), or( not(
% 1.17/1.57 Z ), or( or( not( Z ), T ), Z ) ) ) ) ) ] )
% 1.17/1.57 , clause( 10826, [ 'is_a_theorem'( or( X, or( not( or( not( Y ), Z ) ), or(
% 1.17/1.57 not( Z ), or( or( not( Z ), T ), Z ) ) ) ) ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 1.17/1.57 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10827, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( not( Y )
% 1.17/1.57 , or( or( not( Y ), Z ), Y ) ) ) ) ] )
% 1.17/1.57 , clause( 399, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( not( not( or( not( X ), Y ) ) ), Z ) ), or( T, or( or( not( Z ), U )
% 1.17/1.57 , Z ) ) ) ), W ) ) ) ] )
% 1.17/1.57 , 1, clause( 452, [ 'is_a_theorem'( or( X, or( not( or( not( Y ), Z ) ), or(
% 1.17/1.57 not( Z ), or( or( not( Z ), T ), Z ) ) ) ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, T ), :=( Y, U ), :=( Z, W ), :=( T, V0 ),
% 1.17/1.57 :=( U, V1 ), :=( W, or( not( or( not( X ), Y ) ), or( not( Y ), or( or(
% 1.17/1.57 not( Y ), Z ), Y ) ) ) )] ), substitution( 1, [ :=( X, not( or( not( or(
% 1.17/1.57 not( not( or( not( T ), U ) ) ), W ) ), or( V0, or( or( not( W ), V1 ), W
% 1.17/1.57 ) ) ) ) ), :=( Y, X ), :=( Z, Y ), :=( T, Z )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 457, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( not( Y ),
% 1.17/1.57 or( or( not( Y ), Z ), Y ) ) ) ) ] )
% 1.17/1.57 , clause( 10827, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( not( Y
% 1.17/1.57 ), or( or( not( Y ), Z ), Y ) ) ) ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 1.17/1.57 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10829, [ ~( 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ),
% 1.17/1.57 or( not( Y ), or( or( not( Y ), Z ), Y ) ) ) ), T ) ) ), 'is_a_theorem'(
% 1.17/1.57 T ) ] )
% 1.17/1.57 , clause( 0, [ ~( 'is_a_theorem'( or( not( X ), Y ) ) ), 'is_a_theorem'( Y
% 1.17/1.57 ), ~( 'is_a_theorem'( X ) ) ] )
% 1.17/1.57 , 2, clause( 457, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( not(
% 1.17/1.57 Y ), or( or( not( Y ), Z ), Y ) ) ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, or( not( or( not( X ), Y ) ), or( not( Y ),
% 1.17/1.57 or( or( not( Y ), Z ), Y ) ) ) ), :=( Y, T )] ), substitution( 1, [ :=( X
% 1.17/1.57 , X ), :=( Y, Y ), :=( Z, Z )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 463, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( or( not( or( not( or(
% 1.17/1.57 not( X ), Y ) ), or( not( Y ), or( or( not( Y ), Z ), Y ) ) ) ), T ) ) )
% 1.17/1.57 ] )
% 1.17/1.57 , clause( 10829, [ ~( 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) )
% 1.17/1.57 , or( not( Y ), or( or( not( Y ), Z ), Y ) ) ) ), T ) ) ), 'is_a_theorem'(
% 1.17/1.57 T ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 1.17/1.57 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10830, [ 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ), Z )
% 1.17/1.57 ), or( not( X ), or( X, Z ) ) ) ) ] )
% 1.17/1.57 , clause( 463, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( not( X ), Y ) ), or( not( Y ), or( or( not( Y ), Z ), Y ) ) ) ), T )
% 1.17/1.57 ) ) ] )
% 1.17/1.57 , 1, clause( 1, [ 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ), or(
% 1.17/1.57 Z, or( T, U ) ) ) ), or( not( or( not( T ), X ) ), or( Z, or( U, X ) ) )
% 1.17/1.57 ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, Z ), :=( Y, X ), :=( Z, Y ), :=( T, or( not(
% 1.17/1.57 or( not( or( not( X ), Y ) ), Z ) ), or( not( X ), or( X, Z ) ) ) )] ),
% 1.17/1.57 substitution( 1, [ :=( X, Z ), :=( Y, X ), :=( Z, not( X ) ), :=( T, or(
% 1.17/1.57 not( X ), Y ) ), :=( U, X )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 555, [ 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ), Z ) )
% 1.17/1.57 , or( not( X ), or( X, Z ) ) ) ) ] )
% 1.17/1.57 , clause( 10830, [ 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ), Z
% 1.17/1.57 ) ), or( not( X ), or( X, Z ) ) ) ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 1.17/1.57 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10832, [ ~( 'is_a_theorem'( or( not( or( not( or( not( or( not( X )
% 1.17/1.57 , Y ) ), Z ) ), or( not( X ), or( X, Z ) ) ) ), T ) ) ), 'is_a_theorem'(
% 1.17/1.57 T ) ] )
% 1.17/1.57 , clause( 0, [ ~( 'is_a_theorem'( or( not( X ), Y ) ) ), 'is_a_theorem'( Y
% 1.17/1.57 ), ~( 'is_a_theorem'( X ) ) ] )
% 1.17/1.57 , 2, clause( 555, [ 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ),
% 1.17/1.57 Z ) ), or( not( X ), or( X, Z ) ) ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, or( not( or( not( or( not( X ), Y ) ), Z ) )
% 1.17/1.57 , or( not( X ), or( X, Z ) ) ) ), :=( Y, T )] ), substitution( 1, [ :=( X
% 1.17/1.57 , X ), :=( Y, Y ), :=( Z, Z )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 575, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( or( not( or( not( or(
% 1.17/1.57 not( or( not( X ), Y ) ), Z ) ), or( not( X ), or( X, Z ) ) ) ), T ) ) )
% 1.17/1.57 ] )
% 1.17/1.57 , clause( 10832, [ ~( 'is_a_theorem'( or( not( or( not( or( not( or( not( X
% 1.17/1.57 ), Y ) ), Z ) ), or( not( X ), or( X, Z ) ) ) ), T ) ) ), 'is_a_theorem'(
% 1.17/1.57 T ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 1.17/1.57 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10833, [ 'is_a_theorem'( or( X, or( not( or( not( Y ), Z ) ), or(
% 1.17/1.57 not( Z ), or( Z, Z ) ) ) ) ) ] )
% 1.17/1.57 , clause( 575, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( not( or( not( X ), Y ) ), Z ) ), or( not( X ), or( X, Z ) ) ) ), T )
% 1.17/1.57 ) ) ] )
% 1.17/1.57 , 1, clause( 21, [ 'is_a_theorem'( or( not( or( not( X ), or( not( Y ), or(
% 1.17/1.57 Z, Y ) ) ) ), or( T, or( not( or( not( U ), Y ) ), or( not( Y ), or( Z, Y
% 1.17/1.57 ) ) ) ) ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, Z ), :=( Y, T ), :=( Z, Z ), :=( T, or( X,
% 1.17/1.57 or( not( or( not( Y ), Z ) ), or( not( Z ), or( Z, Z ) ) ) ) )] ),
% 1.17/1.57 substitution( 1, [ :=( X, or( not( or( not( Z ), T ) ), Z ) ), :=( Y, Z )
% 1.17/1.57 , :=( Z, Z ), :=( T, X ), :=( U, Y )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 872, [ 'is_a_theorem'( or( X, or( not( or( not( Y ), Z ) ), or( not(
% 1.17/1.57 Z ), or( Z, Z ) ) ) ) ) ] )
% 1.17/1.57 , clause( 10833, [ 'is_a_theorem'( or( X, or( not( or( not( Y ), Z ) ), or(
% 1.17/1.57 not( Z ), or( Z, Z ) ) ) ) ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 1.17/1.57 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10834, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( not( Y )
% 1.17/1.57 , or( Y, Y ) ) ) ) ] )
% 1.17/1.57 , clause( 575, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( not( or( not( X ), Y ) ), Z ) ), or( not( X ), or( X, Z ) ) ) ), T )
% 1.17/1.57 ) ) ] )
% 1.17/1.57 , 1, clause( 872, [ 'is_a_theorem'( or( X, or( not( or( not( Y ), Z ) ), or(
% 1.17/1.57 not( Z ), or( Z, Z ) ) ) ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, Z ), :=( Y, T ), :=( Z, U ), :=( T, or( not(
% 1.17/1.57 or( not( X ), Y ) ), or( not( Y ), or( Y, Y ) ) ) )] ), substitution( 1
% 1.17/1.57 , [ :=( X, not( or( not( or( not( or( not( Z ), T ) ), U ) ), or( not( Z
% 1.17/1.57 ), or( Z, U ) ) ) ) ), :=( Y, X ), :=( Z, Y )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 876, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( not( Y ),
% 1.17/1.57 or( Y, Y ) ) ) ) ] )
% 1.17/1.57 , clause( 10834, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( not( Y
% 1.17/1.57 ), or( Y, Y ) ) ) ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.17/1.57 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10836, [ ~( 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ),
% 1.17/1.57 or( not( Y ), or( Y, Y ) ) ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 1.17/1.57 , clause( 0, [ ~( 'is_a_theorem'( or( not( X ), Y ) ) ), 'is_a_theorem'( Y
% 1.17/1.57 ), ~( 'is_a_theorem'( X ) ) ] )
% 1.17/1.57 , 2, clause( 876, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( not(
% 1.17/1.57 Y ), or( Y, Y ) ) ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, or( not( or( not( X ), Y ) ), or( not( Y ),
% 1.17/1.57 or( Y, Y ) ) ) ), :=( Y, Z )] ), substitution( 1, [ :=( X, X ), :=( Y, Y
% 1.17/1.57 )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 885, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( or( not( or( not( or(
% 1.17/1.57 not( X ), Y ) ), or( not( Y ), or( Y, Y ) ) ) ), Z ) ) ) ] )
% 1.17/1.57 , clause( 10836, [ ~( 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) )
% 1.17/1.57 , or( not( Y ), or( Y, Y ) ) ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 1.17/1.57 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10837, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( not( X )
% 1.17/1.57 , or( X, Y ) ) ) ) ] )
% 1.17/1.57 , clause( 885, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( not( X ), Y ) ), or( not( Y ), or( Y, Y ) ) ) ), Z ) ) ) ] )
% 1.17/1.57 , 1, clause( 1, [ 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ), or(
% 1.17/1.57 Z, or( T, U ) ) ) ), or( not( or( not( T ), X ) ), or( Z, or( U, X ) ) )
% 1.17/1.57 ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, Y ), :=( Y, X ), :=( Z, or( not( or( not( X
% 1.17/1.57 ), Y ) ), or( not( X ), or( X, Y ) ) ) )] ), substitution( 1, [ :=( X, Y
% 1.17/1.57 ), :=( Y, X ), :=( Z, not( X ) ), :=( T, X ), :=( U, X )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 1003, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( not( X )
% 1.17/1.57 , or( X, Y ) ) ) ) ] )
% 1.17/1.57 , clause( 10837, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( not( X
% 1.17/1.57 ), or( X, Y ) ) ) ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.17/1.57 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10839, [ ~( 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ),
% 1.17/1.57 or( not( X ), or( X, Y ) ) ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 1.17/1.57 , clause( 0, [ ~( 'is_a_theorem'( or( not( X ), Y ) ) ), 'is_a_theorem'( Y
% 1.17/1.57 ), ~( 'is_a_theorem'( X ) ) ] )
% 1.17/1.57 , 2, clause( 1003, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( not(
% 1.17/1.57 X ), or( X, Y ) ) ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, or( not( or( not( X ), Y ) ), or( not( X ),
% 1.17/1.57 or( X, Y ) ) ) ), :=( Y, Z )] ), substitution( 1, [ :=( X, X ), :=( Y, Y
% 1.17/1.57 )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 1013, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( not( X ), Y ) ), or( not( X ), or( X, Y ) ) ) ), Z ) ) ) ] )
% 1.17/1.57 , clause( 10839, [ ~( 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) )
% 1.17/1.57 , or( not( X ), or( X, Y ) ) ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 1.17/1.57 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10840, [ 'is_a_theorem'( or( not( or( not( X ), X ) ), or( not( X )
% 1.17/1.57 , or( Y, X ) ) ) ) ] )
% 1.17/1.57 , clause( 1013, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( not( X ), Y ) ), or( not( X ), or( X, Y ) ) ) ), Z ) ) ) ] )
% 1.17/1.57 , 1, clause( 1, [ 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ), or(
% 1.17/1.57 Z, or( T, U ) ) ) ), or( not( or( not( T ), X ) ), or( Z, or( U, X ) ) )
% 1.17/1.57 ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, or( not( or( not( X
% 1.17/1.57 ), X ) ), or( not( X ), or( Y, X ) ) ) )] ), substitution( 1, [ :=( X, X
% 1.17/1.57 ), :=( Y, Y ), :=( Z, not( X ) ), :=( T, X ), :=( U, Y )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 1227, [ 'is_a_theorem'( or( not( or( not( X ), X ) ), or( not( X )
% 1.17/1.57 , or( Y, X ) ) ) ) ] )
% 1.17/1.57 , clause( 10840, [ 'is_a_theorem'( or( not( or( not( X ), X ) ), or( not( X
% 1.17/1.57 ), or( Y, X ) ) ) ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.17/1.57 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10842, [ ~( 'is_a_theorem'( or( not( or( not( or( not( X ), X ) ),
% 1.17/1.57 or( not( X ), or( Y, X ) ) ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 1.17/1.57 , clause( 0, [ ~( 'is_a_theorem'( or( not( X ), Y ) ) ), 'is_a_theorem'( Y
% 1.17/1.57 ), ~( 'is_a_theorem'( X ) ) ] )
% 1.17/1.57 , 2, clause( 1227, [ 'is_a_theorem'( or( not( or( not( X ), X ) ), or( not(
% 1.17/1.57 X ), or( Y, X ) ) ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, or( not( or( not( X ), X ) ), or( not( X ),
% 1.17/1.57 or( Y, X ) ) ) ), :=( Y, Z )] ), substitution( 1, [ :=( X, X ), :=( Y, Y
% 1.17/1.57 )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 1235, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( not( X ), X ) ), or( not( X ), or( Y, X ) ) ) ), Z ) ) ) ] )
% 1.17/1.57 , clause( 10842, [ ~( 'is_a_theorem'( or( not( or( not( or( not( X ), X ) )
% 1.17/1.57 , or( not( X ), or( Y, X ) ) ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 1.17/1.57 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10843, [ 'is_a_theorem'( or( X, or( not( or( not( Y ), Z ) ), or(
% 1.17/1.57 not( Z ), or( T, Z ) ) ) ) ) ] )
% 1.17/1.57 , clause( 1235, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( not( X ), X ) ), or( not( X ), or( Y, X ) ) ) ), Z ) ) ) ] )
% 1.17/1.57 , 1, clause( 21, [ 'is_a_theorem'( or( not( or( not( X ), or( not( Y ), or(
% 1.17/1.57 Z, Y ) ) ) ), or( T, or( not( or( not( U ), Y ) ), or( not( Y ), or( Z, Y
% 1.17/1.57 ) ) ) ) ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, Z ), :=( Y, T ), :=( Z, or( X, or( not( or(
% 1.17/1.57 not( Y ), Z ) ), or( not( Z ), or( T, Z ) ) ) ) )] ), substitution( 1, [
% 1.17/1.57 :=( X, or( not( Z ), Z ) ), :=( Y, Z ), :=( Z, T ), :=( T, X ), :=( U, Y
% 1.17/1.57 )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 1372, [ 'is_a_theorem'( or( X, or( not( or( not( Y ), Z ) ), or(
% 1.17/1.57 not( Z ), or( T, Z ) ) ) ) ) ] )
% 1.17/1.57 , clause( 10843, [ 'is_a_theorem'( or( X, or( not( or( not( Y ), Z ) ), or(
% 1.17/1.57 not( Z ), or( T, Z ) ) ) ) ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 1.17/1.57 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10844, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( not( Y )
% 1.17/1.57 , or( Z, Y ) ) ) ) ] )
% 1.17/1.57 , clause( 1235, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( not( X ), X ) ), or( not( X ), or( Y, X ) ) ) ), Z ) ) ) ] )
% 1.17/1.57 , 1, clause( 1372, [ 'is_a_theorem'( or( X, or( not( or( not( Y ), Z ) ),
% 1.17/1.57 or( not( Z ), or( T, Z ) ) ) ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, T ), :=( Y, U ), :=( Z, or( not( or( not( X
% 1.17/1.57 ), Y ) ), or( not( Y ), or( Z, Y ) ) ) )] ), substitution( 1, [ :=( X,
% 1.17/1.57 not( or( not( or( not( T ), T ) ), or( not( T ), or( U, T ) ) ) ) ), :=(
% 1.17/1.57 Y, X ), :=( Z, Y ), :=( T, Z )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 1384, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( not( Y )
% 1.17/1.57 , or( Z, Y ) ) ) ) ] )
% 1.17/1.57 , clause( 10844, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( not( Y
% 1.17/1.57 ), or( Z, Y ) ) ) ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 1.17/1.57 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10846, [ ~( 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ),
% 1.17/1.57 or( not( Y ), or( Z, Y ) ) ) ), T ) ) ), 'is_a_theorem'( T ) ] )
% 1.17/1.57 , clause( 0, [ ~( 'is_a_theorem'( or( not( X ), Y ) ) ), 'is_a_theorem'( Y
% 1.17/1.57 ), ~( 'is_a_theorem'( X ) ) ] )
% 1.17/1.57 , 2, clause( 1384, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( not(
% 1.17/1.57 Y ), or( Z, Y ) ) ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, or( not( or( not( X ), Y ) ), or( not( Y ),
% 1.17/1.57 or( Z, Y ) ) ) ), :=( Y, T )] ), substitution( 1, [ :=( X, X ), :=( Y, Y
% 1.17/1.57 ), :=( Z, Z )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 1395, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( not( X ), Y ) ), or( not( Y ), or( Z, Y ) ) ) ), T ) ) ) ] )
% 1.17/1.57 , clause( 10846, [ ~( 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) )
% 1.17/1.57 , or( not( Y ), or( Z, Y ) ) ) ), T ) ) ), 'is_a_theorem'( T ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 1.17/1.57 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10847, [ 'is_a_theorem'( or( not( or( not( X ), or( Y, Z ) ) ), or(
% 1.17/1.57 T, or( not( Z ), or( Y, Z ) ) ) ) ) ] )
% 1.17/1.57 , clause( 1395, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( not( X ), Y ) ), or( not( Y ), or( Z, Y ) ) ) ), T ) ) ) ] )
% 1.17/1.57 , 1, clause( 18, [ 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ),
% 1.17/1.57 or( Z, X ) ) ), or( not( or( not( T ), X ) ), or( U, or( Z, X ) ) ) ) ) ]
% 1.17/1.57 )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, or( Y, Z ) ), :=( Y, Z ), :=( Z, Y ), :=( T
% 1.17/1.57 , or( not( or( not( X ), or( Y, Z ) ) ), or( T, or( not( Z ), or( Y, Z )
% 1.17/1.57 ) ) ) )] ), substitution( 1, [ :=( X, or( Y, Z ) ), :=( Y, Z ), :=( Z,
% 1.17/1.57 not( Z ) ), :=( T, X ), :=( U, T )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 1558, [ 'is_a_theorem'( or( not( or( not( X ), or( Y, Z ) ) ), or(
% 1.17/1.57 T, or( not( Z ), or( Y, Z ) ) ) ) ) ] )
% 1.17/1.57 , clause( 10847, [ 'is_a_theorem'( or( not( or( not( X ), or( Y, Z ) ) ),
% 1.17/1.57 or( T, or( not( Z ), or( Y, Z ) ) ) ) ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 1.17/1.57 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10848, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( not( Z )
% 1.17/1.57 , or( Z, Y ) ) ) ) ] )
% 1.17/1.57 , clause( 1395, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( not( X ), Y ) ), or( not( Y ), or( Z, Y ) ) ) ), T ) ) ) ] )
% 1.17/1.57 , 1, clause( 1, [ 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ), or(
% 1.17/1.57 Z, or( T, U ) ) ) ), or( not( or( not( T ), X ) ), or( Z, or( U, X ) ) )
% 1.17/1.57 ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, Y ), :=( Y, Z ), :=( Z, X ), :=( T, or( not(
% 1.17/1.57 or( not( X ), Y ) ), or( not( Z ), or( Z, Y ) ) ) )] ), substitution( 1
% 1.17/1.57 , [ :=( X, Y ), :=( Y, Z ), :=( Z, not( Z ) ), :=( T, X ), :=( U, Z )] )
% 1.17/1.57 ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 1559, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( not( Z )
% 1.17/1.57 , or( Z, Y ) ) ) ) ] )
% 1.17/1.57 , clause( 10848, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( not( Z
% 1.17/1.57 ), or( Z, Y ) ) ) ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 1.17/1.57 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10849, [ 'is_a_theorem'( or( not( X ), or( X, or( Y, or( or( not( Z
% 1.17/1.57 ), T ), Z ) ) ) ) ) ] )
% 1.17/1.57 , clause( 399, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( not( not( or( not( X ), Y ) ) ), Z ) ), or( T, or( or( not( Z ), U )
% 1.17/1.57 , Z ) ) ) ), W ) ) ) ] )
% 1.17/1.57 , 1, clause( 1559, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( not(
% 1.17/1.57 Z ), or( Z, Y ) ) ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, U ), :=( Y, W ), :=( Z, Z ), :=( T, Y ),
% 1.17/1.57 :=( U, T ), :=( W, or( not( X ), or( X, or( Y, or( or( not( Z ), T ), Z )
% 1.17/1.57 ) ) ) )] ), substitution( 1, [ :=( X, or( not( not( or( not( U ), W ) )
% 1.17/1.57 ), Z ) ), :=( Y, or( Y, or( or( not( Z ), T ), Z ) ) ), :=( Z, X )] )
% 1.17/1.57 ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 1574, [ 'is_a_theorem'( or( not( X ), or( X, or( Y, or( or( not( Z
% 1.17/1.57 ), T ), Z ) ) ) ) ) ] )
% 1.17/1.57 , clause( 10849, [ 'is_a_theorem'( or( not( X ), or( X, or( Y, or( or( not(
% 1.17/1.57 Z ), T ), Z ) ) ) ) ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 1.17/1.57 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10851, [ ~( 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ),
% 1.17/1.57 or( not( Z ), or( Z, Y ) ) ) ), T ) ) ), 'is_a_theorem'( T ) ] )
% 1.17/1.57 , clause( 0, [ ~( 'is_a_theorem'( or( not( X ), Y ) ) ), 'is_a_theorem'( Y
% 1.17/1.57 ), ~( 'is_a_theorem'( X ) ) ] )
% 1.17/1.57 , 2, clause( 1559, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( not(
% 1.17/1.57 Z ), or( Z, Y ) ) ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, or( not( or( not( X ), Y ) ), or( not( Z ),
% 1.17/1.57 or( Z, Y ) ) ) ), :=( Y, T )] ), substitution( 1, [ :=( X, X ), :=( Y, Y
% 1.17/1.57 ), :=( Z, Z )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 1579, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( not( X ), Y ) ), or( not( Z ), or( Z, Y ) ) ) ), T ) ) ) ] )
% 1.17/1.57 , clause( 10851, [ ~( 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) )
% 1.17/1.57 , or( not( Z ), or( Z, Y ) ) ) ), T ) ) ), 'is_a_theorem'( T ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 1.17/1.57 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10853, [ ~( 'is_a_theorem'( or( not( or( not( X ), or( X, or( Y, or(
% 1.17/1.57 or( not( Z ), T ), Z ) ) ) ) ), U ) ) ), 'is_a_theorem'( U ) ] )
% 1.17/1.57 , clause( 0, [ ~( 'is_a_theorem'( or( not( X ), Y ) ) ), 'is_a_theorem'( Y
% 1.17/1.57 ), ~( 'is_a_theorem'( X ) ) ] )
% 1.17/1.57 , 2, clause( 1574, [ 'is_a_theorem'( or( not( X ), or( X, or( Y, or( or(
% 1.17/1.57 not( Z ), T ), Z ) ) ) ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, or( not( X ), or( X, or( Y, or( or( not( Z )
% 1.17/1.57 , T ), Z ) ) ) ) ), :=( Y, U )] ), substitution( 1, [ :=( X, X ), :=( Y,
% 1.17/1.57 Y ), :=( Z, Z ), :=( T, T )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 1687, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( or( not( or( not( X
% 1.17/1.57 ), or( X, or( Y, or( or( not( Z ), T ), Z ) ) ) ) ), U ) ) ) ] )
% 1.17/1.57 , clause( 10853, [ ~( 'is_a_theorem'( or( not( or( not( X ), or( X, or( Y,
% 1.17/1.57 or( or( not( Z ), T ), Z ) ) ) ) ), U ) ) ), 'is_a_theorem'( U ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 1.17/1.57 , U )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10854, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( not( X )
% 1.17/1.57 , or( Z, Y ) ) ) ) ] )
% 1.17/1.57 , clause( 1579, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( not( X ), Y ) ), or( not( Z ), or( Z, Y ) ) ) ), T ) ) ) ] )
% 1.17/1.57 , 1, clause( 1, [ 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ), or(
% 1.17/1.57 Z, or( T, U ) ) ) ), or( not( or( not( T ), X ) ), or( Z, or( U, X ) ) )
% 1.17/1.57 ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, Y ), :=( Y, Z ), :=( Z, X ), :=( T, or( not(
% 1.17/1.57 or( not( X ), Y ) ), or( not( X ), or( Z, Y ) ) ) )] ), substitution( 1
% 1.17/1.57 , [ :=( X, Y ), :=( Y, Z ), :=( Z, not( X ) ), :=( T, X ), :=( U, Z )] )
% 1.17/1.57 ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 2075, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( not( X )
% 1.17/1.57 , or( Z, Y ) ) ) ) ] )
% 1.17/1.57 , clause( 10854, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( not( X
% 1.17/1.57 ), or( Z, Y ) ) ) ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 1.17/1.57 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10856, [ ~( 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ),
% 1.17/1.57 or( not( X ), or( Z, Y ) ) ) ), T ) ) ), 'is_a_theorem'( T ) ] )
% 1.17/1.57 , clause( 0, [ ~( 'is_a_theorem'( or( not( X ), Y ) ) ), 'is_a_theorem'( Y
% 1.17/1.57 ), ~( 'is_a_theorem'( X ) ) ] )
% 1.17/1.57 , 2, clause( 2075, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( not(
% 1.17/1.57 X ), or( Z, Y ) ) ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, or( not( or( not( X ), Y ) ), or( not( X ),
% 1.17/1.57 or( Z, Y ) ) ) ), :=( Y, T )] ), substitution( 1, [ :=( X, X ), :=( Y, Y
% 1.17/1.57 ), :=( Z, Z )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 2083, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( not( X ), Y ) ), or( not( X ), or( Z, Y ) ) ) ), T ) ) ) ] )
% 1.17/1.57 , clause( 10856, [ ~( 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) )
% 1.17/1.57 , or( not( X ), or( Z, Y ) ) ) ), T ) ) ), 'is_a_theorem'( T ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 1.17/1.57 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10857, [ 'is_a_theorem'( or( X, or( not( or( Y, Z ) ), or( not( T )
% 1.17/1.57 , or( Y, Z ) ) ) ) ) ] )
% 1.17/1.57 , clause( 2083, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( not( X ), Y ) ), or( not( X ), or( Z, Y ) ) ) ), T ) ) ) ] )
% 1.17/1.57 , 1, clause( 1558, [ 'is_a_theorem'( or( not( or( not( X ), or( Y, Z ) ) )
% 1.17/1.57 , or( T, or( not( Z ), or( Y, Z ) ) ) ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, T ), :=( Y, Z ), :=( Z, Y ), :=( T, or( X,
% 1.17/1.57 or( not( or( Y, Z ) ), or( not( T ), or( Y, Z ) ) ) ) )] ),
% 1.17/1.57 substitution( 1, [ :=( X, or( not( T ), Z ) ), :=( Y, not( T ) ), :=( Z,
% 1.17/1.57 or( Y, Z ) ), :=( T, X )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 2457, [ 'is_a_theorem'( or( X, or( not( or( Y, Z ) ), or( not( T )
% 1.17/1.57 , or( Y, Z ) ) ) ) ) ] )
% 1.17/1.57 , clause( 10857, [ 'is_a_theorem'( or( X, or( not( or( Y, Z ) ), or( not( T
% 1.17/1.57 ), or( Y, Z ) ) ) ) ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 1.17/1.57 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10858, [ 'is_a_theorem'( or( not( or( X, Y ) ), or( not( Z ), or( X
% 1.17/1.57 , Y ) ) ) ) ] )
% 1.17/1.57 , clause( 2083, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( not( X ), Y ) ), or( not( X ), or( Z, Y ) ) ) ), T ) ) ) ] )
% 1.17/1.57 , 1, clause( 2457, [ 'is_a_theorem'( or( X, or( not( or( Y, Z ) ), or( not(
% 1.17/1.57 T ), or( Y, Z ) ) ) ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, T ), :=( Y, U ), :=( Z, W ), :=( T, or( not(
% 1.17/1.57 or( X, Y ) ), or( not( Z ), or( X, Y ) ) ) )] ), substitution( 1, [ :=( X
% 1.17/1.57 , not( or( not( or( not( T ), U ) ), or( not( T ), or( W, U ) ) ) ) ),
% 1.17/1.57 :=( Y, X ), :=( Z, Y ), :=( T, Z )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 2520, [ 'is_a_theorem'( or( not( or( X, Y ) ), or( not( Z ), or( X
% 1.17/1.57 , Y ) ) ) ) ] )
% 1.17/1.57 , clause( 10858, [ 'is_a_theorem'( or( not( or( X, Y ) ), or( not( Z ), or(
% 1.17/1.57 X, Y ) ) ) ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 1.17/1.57 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10860, [ ~( 'is_a_theorem'( or( not( or( not( or( X, Y ) ), or( not(
% 1.17/1.57 Z ), or( X, Y ) ) ) ), T ) ) ), 'is_a_theorem'( T ) ] )
% 1.17/1.57 , clause( 0, [ ~( 'is_a_theorem'( or( not( X ), Y ) ) ), 'is_a_theorem'( Y
% 1.17/1.57 ), ~( 'is_a_theorem'( X ) ) ] )
% 1.17/1.57 , 2, clause( 2520, [ 'is_a_theorem'( or( not( or( X, Y ) ), or( not( Z ),
% 1.17/1.57 or( X, Y ) ) ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, or( not( or( X, Y ) ), or( not( Z ), or( X,
% 1.17/1.57 Y ) ) ) ), :=( Y, T )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ), :=(
% 1.17/1.57 Z, Z )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 2524, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( X, Y ) ), or( not( Z ), or( X, Y ) ) ) ), T ) ) ) ] )
% 1.17/1.57 , clause( 10860, [ ~( 'is_a_theorem'( or( not( or( not( or( X, Y ) ), or(
% 1.17/1.57 not( Z ), or( X, Y ) ) ) ), T ) ) ), 'is_a_theorem'( T ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 1.17/1.57 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10861, [ 'is_a_theorem'( or( not( or( not( not( X ) ), X ) ), or(
% 1.17/1.57 not( Y ), or( Z, X ) ) ) ) ] )
% 1.17/1.57 , clause( 2524, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( X, Y ) ), or( not( Z ), or( X, Y ) ) ) ), T ) ) ) ] )
% 1.17/1.57 , 1, clause( 1, [ 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ), or(
% 1.17/1.57 Z, or( T, U ) ) ) ), or( not( or( not( T ), X ) ), or( Z, or( U, X ) ) )
% 1.17/1.57 ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, not( X ) ), :=( Y, Z ), :=( Z, Y ), :=( T,
% 1.17/1.57 or( not( or( not( not( X ) ), X ) ), or( not( Y ), or( Z, X ) ) ) )] ),
% 1.17/1.57 substitution( 1, [ :=( X, X ), :=( Y, Z ), :=( Z, not( Y ) ), :=( T, not(
% 1.17/1.57 X ) ), :=( U, Z )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 2622, [ 'is_a_theorem'( or( not( or( not( not( X ) ), X ) ), or(
% 1.17/1.57 not( Y ), or( Z, X ) ) ) ) ] )
% 1.17/1.57 , clause( 10861, [ 'is_a_theorem'( or( not( or( not( not( X ) ), X ) ), or(
% 1.17/1.57 not( Y ), or( Z, X ) ) ) ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 1.17/1.57 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10863, [ ~( 'is_a_theorem'( or( not( or( not( or( not( not( X ) ),
% 1.17/1.57 X ) ), or( not( Y ), or( Z, X ) ) ) ), T ) ) ), 'is_a_theorem'( T ) ] )
% 1.17/1.57 , clause( 0, [ ~( 'is_a_theorem'( or( not( X ), Y ) ) ), 'is_a_theorem'( Y
% 1.17/1.57 ), ~( 'is_a_theorem'( X ) ) ] )
% 1.17/1.57 , 2, clause( 2622, [ 'is_a_theorem'( or( not( or( not( not( X ) ), X ) ),
% 1.17/1.57 or( not( Y ), or( Z, X ) ) ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, or( not( or( not( not( X ) ), X ) ), or( not(
% 1.17/1.57 Y ), or( Z, X ) ) ) ), :=( Y, T )] ), substitution( 1, [ :=( X, X ), :=(
% 1.17/1.57 Y, Y ), :=( Z, Z )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 2647, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( not( not( X ) ), X ) ), or( not( Y ), or( Z, X ) ) ) ), T ) ) ) ] )
% 1.17/1.57 , clause( 10863, [ ~( 'is_a_theorem'( or( not( or( not( or( not( not( X ) )
% 1.17/1.57 , X ) ), or( not( Y ), or( Z, X ) ) ) ), T ) ) ), 'is_a_theorem'( T ) ]
% 1.17/1.57 )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 1.17/1.57 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10864, [ 'is_a_theorem'( or( X, or( Y, or( not( or( not( Z ), T ) )
% 1.17/1.57 , or( or( not( T ), U ), T ) ) ) ) ) ] )
% 1.17/1.57 , clause( 2647, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( not( not( X ) ), X ) ), or( not( Y ), or( Z, X ) ) ) ), T ) ) ) ] )
% 1.17/1.57 , 1, clause( 257, [ 'is_a_theorem'( or( not( or( not( X ), or( not( or( not(
% 1.17/1.57 Y ), Z ) ), or( or( not( Z ), T ), Z ) ) ) ), or( U, or( W, or( not( or(
% 1.17/1.57 not( Y ), Z ) ), or( or( not( Z ), T ), Z ) ) ) ) ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, T ), :=( Y, or( not( Z ), T ) ), :=( Z, or(
% 1.17/1.57 not( T ), U ) ), :=( T, or( X, or( Y, or( not( or( not( Z ), T ) ), or(
% 1.17/1.57 or( not( T ), U ), T ) ) ) ) )] ), substitution( 1, [ :=( X, or( not( not(
% 1.17/1.57 T ) ), T ) ), :=( Y, Z ), :=( Z, T ), :=( T, U ), :=( U, X ), :=( W, Y )] )
% 1.17/1.57 ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 3596, [ 'is_a_theorem'( or( X, or( Y, or( not( or( not( Z ), T ) )
% 1.17/1.57 , or( or( not( T ), U ), T ) ) ) ) ) ] )
% 1.17/1.57 , clause( 10864, [ 'is_a_theorem'( or( X, or( Y, or( not( or( not( Z ), T )
% 1.17/1.57 ), or( or( not( T ), U ), T ) ) ) ) ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 1.17/1.57 , U )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10865, [ 'is_a_theorem'( or( X, or( not( or( not( Y ), Z ) ), or(
% 1.17/1.57 or( not( Z ), T ), Z ) ) ) ) ] )
% 1.17/1.57 , clause( 1687, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 X ), or( X, or( Y, or( or( not( Z ), T ), Z ) ) ) ) ), U ) ) ) ] )
% 1.17/1.57 , 1, clause( 3596, [ 'is_a_theorem'( or( X, or( Y, or( not( or( not( Z ), T
% 1.17/1.57 ) ), or( or( not( T ), U ), T ) ) ) ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, U ), :=( Y, W ), :=( Z, V0 ), :=( T, V1 ),
% 1.17/1.57 :=( U, or( X, or( not( or( not( Y ), Z ) ), or( or( not( Z ), T ), Z ) )
% 1.17/1.57 ) )] ), substitution( 1, [ :=( X, not( or( not( U ), or( U, or( W, or(
% 1.17/1.57 or( not( V0 ), V1 ), V0 ) ) ) ) ) ), :=( Y, X ), :=( Z, Y ), :=( T, Z ),
% 1.17/1.57 :=( U, T )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 3598, [ 'is_a_theorem'( or( X, or( not( or( not( Y ), Z ) ), or( or(
% 1.17/1.57 not( Z ), T ), Z ) ) ) ) ] )
% 1.17/1.57 , clause( 10865, [ 'is_a_theorem'( or( X, or( not( or( not( Y ), Z ) ), or(
% 1.17/1.57 or( not( Z ), T ), Z ) ) ) ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 1.17/1.57 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10866, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( or( not(
% 1.17/1.57 Y ), Z ), Y ) ) ) ] )
% 1.17/1.57 , clause( 1687, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 X ), or( X, or( Y, or( or( not( Z ), T ), Z ) ) ) ) ), U ) ) ) ] )
% 1.17/1.57 , 1, clause( 3598, [ 'is_a_theorem'( or( X, or( not( or( not( Y ), Z ) ),
% 1.17/1.57 or( or( not( Z ), T ), Z ) ) ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, T ), :=( Y, U ), :=( Z, W ), :=( T, V0 ),
% 1.17/1.57 :=( U, or( not( or( not( X ), Y ) ), or( or( not( Y ), Z ), Y ) ) )] ),
% 1.17/1.57 substitution( 1, [ :=( X, not( or( not( T ), or( T, or( U, or( or( not( W
% 1.17/1.57 ), V0 ), W ) ) ) ) ) ), :=( Y, X ), :=( Z, Y ), :=( T, Z )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 3600, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( or( not(
% 1.17/1.57 Y ), Z ), Y ) ) ) ] )
% 1.17/1.57 , clause( 10866, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( or(
% 1.17/1.57 not( Y ), Z ), Y ) ) ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 1.17/1.57 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10868, [ ~( 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ),
% 1.17/1.57 or( or( not( Y ), Z ), Y ) ) ), T ) ) ), 'is_a_theorem'( T ) ] )
% 1.17/1.57 , clause( 0, [ ~( 'is_a_theorem'( or( not( X ), Y ) ) ), 'is_a_theorem'( Y
% 1.17/1.57 ), ~( 'is_a_theorem'( X ) ) ] )
% 1.17/1.57 , 2, clause( 3600, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( or(
% 1.17/1.57 not( Y ), Z ), Y ) ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, or( not( or( not( X ), Y ) ), or( or( not( Y
% 1.17/1.57 ), Z ), Y ) ) ), :=( Y, T )] ), substitution( 1, [ :=( X, X ), :=( Y, Y
% 1.17/1.57 ), :=( Z, Z )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 3609, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( not( X ), Y ) ), or( or( not( Y ), Z ), Y ) ) ), T ) ) ) ] )
% 1.17/1.57 , clause( 10868, [ ~( 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) )
% 1.17/1.57 , or( or( not( Y ), Z ), Y ) ) ), T ) ) ), 'is_a_theorem'( T ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 1.17/1.57 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10869, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( Z, or(
% 1.17/1.57 or( not( Y ), T ), Y ) ) ) ) ] )
% 1.17/1.57 , clause( 3609, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( not( X ), Y ) ), or( or( not( Y ), Z ), Y ) ) ), T ) ) ) ] )
% 1.17/1.57 , 1, clause( 2075, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( not(
% 1.17/1.57 X ), or( Z, Y ) ) ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, T ), :=( T, or( not(
% 1.17/1.57 or( not( X ), Y ) ), or( Z, or( or( not( Y ), T ), Y ) ) ) )] ),
% 1.17/1.57 substitution( 1, [ :=( X, or( not( X ), Y ) ), :=( Y, or( or( not( Y ), T
% 1.17/1.57 ), Y ) ), :=( Z, Z )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 3633, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( Z, or( or(
% 1.17/1.57 not( Y ), T ), Y ) ) ) ) ] )
% 1.17/1.57 , clause( 10869, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( Z, or(
% 1.17/1.57 or( not( Y ), T ), Y ) ) ) ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 1.17/1.57 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10871, [ ~( 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ),
% 1.17/1.57 or( Z, or( or( not( Y ), T ), Y ) ) ) ), U ) ) ), 'is_a_theorem'( U ) ]
% 1.17/1.57 )
% 1.17/1.57 , clause( 0, [ ~( 'is_a_theorem'( or( not( X ), Y ) ) ), 'is_a_theorem'( Y
% 1.17/1.57 ), ~( 'is_a_theorem'( X ) ) ] )
% 1.17/1.57 , 2, clause( 3633, [ 'is_a_theorem'( or( not( or( not( X ), Y ) ), or( Z,
% 1.17/1.57 or( or( not( Y ), T ), Y ) ) ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, or( not( or( not( X ), Y ) ), or( Z, or( or(
% 1.17/1.57 not( Y ), T ), Y ) ) ) ), :=( Y, U )] ), substitution( 1, [ :=( X, X ),
% 1.17/1.57 :=( Y, Y ), :=( Z, Z ), :=( T, T )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 3648, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( not( X ), Y ) ), or( Z, or( or( not( Y ), T ), Y ) ) ) ), U ) ) ) ]
% 1.17/1.57 )
% 1.17/1.57 , clause( 10871, [ ~( 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) )
% 1.17/1.57 , or( Z, or( or( not( Y ), T ), Y ) ) ) ), U ) ) ), 'is_a_theorem'( U ) ]
% 1.17/1.57 )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 1.17/1.57 , U )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10872, [ 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ), Z )
% 1.17/1.57 ), or( T, or( X, Z ) ) ) ) ] )
% 1.17/1.57 , clause( 3648, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( not( X ), Y ) ), or( Z, or( or( not( Y ), T ), Y ) ) ) ), U ) ) ) ]
% 1.17/1.57 )
% 1.17/1.57 , 1, clause( 1, [ 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ), or(
% 1.17/1.57 Z, or( T, U ) ) ) ), or( not( or( not( T ), X ) ), or( Z, or( U, X ) ) )
% 1.17/1.57 ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, Z ), :=( Y, X ), :=( Z, T ), :=( T, Y ),
% 1.17/1.57 :=( U, or( not( or( not( or( not( X ), Y ) ), Z ) ), or( T, or( X, Z ) )
% 1.17/1.57 ) )] ), substitution( 1, [ :=( X, Z ), :=( Y, X ), :=( Z, T ), :=( T, or(
% 1.17/1.57 not( X ), Y ) ), :=( U, X )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 10525, [ 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ), Z )
% 1.17/1.57 ), or( T, or( X, Z ) ) ) ) ] )
% 1.17/1.57 , clause( 10872, [ 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) ), Z
% 1.17/1.57 ) ), or( T, or( X, Z ) ) ) ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 1.17/1.57 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10873, [ 'is_a_theorem'( or( X, or( Y, or( not( Z ), or( T, Z ) ) )
% 1.17/1.57 ) ) ] )
% 1.17/1.57 , clause( 1395, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( not( X ), Y ) ), or( not( Y ), or( Z, Y ) ) ) ), T ) ) ) ] )
% 1.17/1.57 , 1, clause( 10525, [ 'is_a_theorem'( or( not( or( not( or( not( X ), Y ) )
% 1.17/1.57 , Z ) ), or( T, or( X, Z ) ) ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, Y ), :=( Y, Z ), :=( Z, T ), :=( T, or( X,
% 1.17/1.57 or( Y, or( not( Z ), or( T, Z ) ) ) ) )] ), substitution( 1, [ :=( X, Y )
% 1.17/1.57 , :=( Y, Z ), :=( Z, or( not( Z ), or( T, Z ) ) ), :=( T, X )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 10563, [ 'is_a_theorem'( or( X, or( Y, or( not( Z ), or( T, Z ) ) )
% 1.17/1.57 ) ) ] )
% 1.17/1.57 , clause( 10873, [ 'is_a_theorem'( or( X, or( Y, or( not( Z ), or( T, Z ) )
% 1.17/1.57 ) ) ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 1.17/1.57 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10874, [ 'is_a_theorem'( or( X, or( not( Y ), or( Z, Y ) ) ) ) ] )
% 1.17/1.57 , clause( 3648, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( not( X ), Y ) ), or( Z, or( or( not( Y ), T ), Y ) ) ) ), U ) ) ) ]
% 1.17/1.57 )
% 1.17/1.57 , 1, clause( 10563, [ 'is_a_theorem'( or( X, or( Y, or( not( Z ), or( T, Z
% 1.17/1.57 ) ) ) ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, T ), :=( Y, U ), :=( Z, W ), :=( T, V0 ),
% 1.17/1.57 :=( U, or( X, or( not( Y ), or( Z, Y ) ) ) )] ), substitution( 1, [ :=( X
% 1.17/1.57 , not( or( not( or( not( T ), U ) ), or( W, or( or( not( U ), V0 ), U ) )
% 1.17/1.57 ) ) ), :=( Y, X ), :=( Z, Y ), :=( T, Z )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 10778, [ 'is_a_theorem'( or( X, or( not( Y ), or( Z, Y ) ) ) ) ] )
% 1.17/1.57 , clause( 10874, [ 'is_a_theorem'( or( X, or( not( Y ), or( Z, Y ) ) ) ) ]
% 1.17/1.57 )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 1.17/1.57 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10875, [ 'is_a_theorem'( or( not( X ), or( Y, X ) ) ) ] )
% 1.17/1.57 , clause( 3648, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( or( not( or( not(
% 1.17/1.57 or( not( X ), Y ) ), or( Z, or( or( not( Y ), T ), Y ) ) ) ), U ) ) ) ]
% 1.17/1.57 )
% 1.17/1.57 , 1, clause( 10778, [ 'is_a_theorem'( or( X, or( not( Y ), or( Z, Y ) ) ) )
% 1.17/1.57 ] )
% 1.17/1.57 , 0, substitution( 0, [ :=( X, Z ), :=( Y, T ), :=( Z, U ), :=( T, W ),
% 1.17/1.57 :=( U, or( not( X ), or( Y, X ) ) )] ), substitution( 1, [ :=( X, not( or(
% 1.17/1.57 not( or( not( Z ), T ) ), or( U, or( or( not( T ), W ), T ) ) ) ) ), :=(
% 1.17/1.57 Y, X ), :=( Z, Y )] )).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 10780, [ 'is_a_theorem'( or( not( X ), or( Y, X ) ) ) ] )
% 1.17/1.57 , clause( 10875, [ 'is_a_theorem'( or( not( X ), or( Y, X ) ) ) ] )
% 1.17/1.57 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.17/1.57 )] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 resolution(
% 1.17/1.57 clause( 10876, [] )
% 1.17/1.57 , clause( 2, [ ~( 'is_a_theorem'( or( not( a ), or( b, a ) ) ) ) ] )
% 1.17/1.57 , 0, clause( 10780, [ 'is_a_theorem'( or( not( X ), or( Y, X ) ) ) ] )
% 1.17/1.57 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, a ), :=( Y, b )] )
% 1.17/1.57 ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 subsumption(
% 1.17/1.57 clause( 10783, [] )
% 1.17/1.57 , clause( 10876, [] )
% 1.17/1.57 , substitution( 0, [] ), permutation( 0, [] ) ).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 end.
% 1.17/1.57
% 1.17/1.57 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 1.17/1.57
% 1.17/1.57 Memory use:
% 1.17/1.57
% 1.17/1.57 space for terms: 306263
% 1.17/1.57 space for clauses: 1205632
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 clauses generated: 97328
% 1.17/1.57 clauses kept: 10784
% 1.17/1.57 clauses selected: 1780
% 1.17/1.57 clauses deleted: 1555
% 1.17/1.57 clauses inuse deleted: 787
% 1.17/1.57
% 1.17/1.57 subsentry: 90657
% 1.17/1.57 literals s-matched: 88099
% 1.17/1.57 literals matched: 88099
% 1.17/1.57 full subsumption: 0
% 1.17/1.57
% 1.17/1.57 checksum: -498394473
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 Bliksem ended
%------------------------------------------------------------------------------