TSTP Solution File: LCL045-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL045-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n008.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:35 EDT 2022
% Result : Unsatisfiable 2.16s 2.59s
% Output : Refutation 2.16s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LCL045-1 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n008.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 13:30:53 EDT 2022
% 0.13/0.35 % CPUTime :
% 2.16/2.59 *** allocated 10000 integers for termspace/termends
% 2.16/2.59 *** allocated 10000 integers for clauses
% 2.16/2.59 *** allocated 10000 integers for justifications
% 2.16/2.59 Bliksem 1.12
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 Automatic Strategy Selection
% 2.16/2.59
% 2.16/2.59 Clauses:
% 2.16/2.59 [
% 2.16/2.59 [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'( X ) ),
% 2.16/2.59 'is_a_theorem'( Y ) ],
% 2.16/2.59 [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ],
% 2.16/2.59 [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ],
% 2.16/2.59 [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) ), implies( Y,
% 2.16/2.59 implies( X, Z ) ) ) ) ],
% 2.16/2.59 [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies( Z, X ),
% 2.16/2.59 implies( Z, Y ) ) ) ) ],
% 2.16/2.59 [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies( not( X ),
% 2.16/2.59 Y ), Y ) ) ) ],
% 2.16/2.59 [ ~( 'is_a_theorem'( implies( implies( a, b ), implies( not( b ), not( a
% 2.16/2.59 ) ) ) ) ) ]
% 2.16/2.59 ] .
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 percentage equality = 0.000000, percentage horn = 1.000000
% 2.16/2.59 This is a near-Horn, non-equality problem
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 Options Used:
% 2.16/2.59
% 2.16/2.59 useres = 1
% 2.16/2.59 useparamod = 0
% 2.16/2.59 useeqrefl = 0
% 2.16/2.59 useeqfact = 0
% 2.16/2.59 usefactor = 1
% 2.16/2.59 usesimpsplitting = 0
% 2.16/2.59 usesimpdemod = 0
% 2.16/2.59 usesimpres = 4
% 2.16/2.59
% 2.16/2.59 resimpinuse = 1000
% 2.16/2.59 resimpclauses = 20000
% 2.16/2.59 substype = standard
% 2.16/2.59 backwardsubs = 1
% 2.16/2.59 selectoldest = 5
% 2.16/2.59
% 2.16/2.59 litorderings [0] = split
% 2.16/2.59 litorderings [1] = liftord
% 2.16/2.59
% 2.16/2.59 termordering = none
% 2.16/2.59
% 2.16/2.59 litapriori = 1
% 2.16/2.59 termapriori = 0
% 2.16/2.59 litaposteriori = 0
% 2.16/2.59 termaposteriori = 0
% 2.16/2.59 demodaposteriori = 0
% 2.16/2.59 ordereqreflfact = 0
% 2.16/2.59
% 2.16/2.59 litselect = negative
% 2.16/2.59
% 2.16/2.59 maxweight = 30000
% 2.16/2.59 maxdepth = 30000
% 2.16/2.59 maxlength = 115
% 2.16/2.59 maxnrvars = 195
% 2.16/2.59 excuselevel = 0
% 2.16/2.59 increasemaxweight = 0
% 2.16/2.59
% 2.16/2.59 maxselected = 10000000
% 2.16/2.59 maxnrclauses = 10000000
% 2.16/2.59
% 2.16/2.59 showgenerated = 0
% 2.16/2.59 showkept = 0
% 2.16/2.59 showselected = 0
% 2.16/2.59 showdeleted = 0
% 2.16/2.59 showresimp = 1
% 2.16/2.59 showstatus = 2000
% 2.16/2.59
% 2.16/2.59 prologoutput = 1
% 2.16/2.59 nrgoals = 5000000
% 2.16/2.59 totalproof = 1
% 2.16/2.59
% 2.16/2.59 Symbols occurring in the translation:
% 2.16/2.59
% 2.16/2.59 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 2.16/2.59 . [1, 2] (w:1, o:21, a:1, s:1, b:0),
% 2.16/2.59 ! [4, 1] (w:1, o:14, a:1, s:1, b:0),
% 2.16/2.59 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 2.16/2.59 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 2.16/2.59 implies [41, 2] (w:1, o:46, a:1, s:1, b:0),
% 2.16/2.59 'is_a_theorem' [42, 1] (w:1, o:19, a:1, s:1, b:0),
% 2.16/2.59 not [43, 1] (w:1, o:20, a:1, s:1, b:0),
% 2.16/2.59 a [45, 0] (w:1, o:12, a:1, s:1, b:0),
% 2.16/2.59 b [46, 0] (w:1, o:13, a:1, s:1, b:0).
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 Starting Search:
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 Intermediate Status:
% 2.16/2.59 Generated: 5161
% 2.16/2.59 Kept: 2001
% 2.16/2.59 Inuse: 301
% 2.16/2.59 Deleted: 1
% 2.16/2.59 Deletedinuse: 1
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 Intermediate Status:
% 2.16/2.59 Generated: 13720
% 2.16/2.59 Kept: 4052
% 2.16/2.59 Inuse: 594
% 2.16/2.59 Deleted: 1
% 2.16/2.59 Deletedinuse: 1
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 Intermediate Status:
% 2.16/2.59 Generated: 20997
% 2.16/2.59 Kept: 6056
% 2.16/2.59 Inuse: 789
% 2.16/2.59 Deleted: 1
% 2.16/2.59 Deletedinuse: 1
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 Intermediate Status:
% 2.16/2.59 Generated: 28721
% 2.16/2.59 Kept: 8097
% 2.16/2.59 Inuse: 966
% 2.16/2.59 Deleted: 4
% 2.16/2.59 Deletedinuse: 2
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 Intermediate Status:
% 2.16/2.59 Generated: 34769
% 2.16/2.59 Kept: 10149
% 2.16/2.59 Inuse: 1070
% 2.16/2.59 Deleted: 4
% 2.16/2.59 Deletedinuse: 2
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 Intermediate Status:
% 2.16/2.59 Generated: 43213
% 2.16/2.59 Kept: 12184
% 2.16/2.59 Inuse: 1189
% 2.16/2.59 Deleted: 5
% 2.16/2.59 Deletedinuse: 2
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 Intermediate Status:
% 2.16/2.59 Generated: 48847
% 2.16/2.59 Kept: 14238
% 2.16/2.59 Inuse: 1267
% 2.16/2.59 Deleted: 6
% 2.16/2.59 Deletedinuse: 2
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 Intermediate Status:
% 2.16/2.59 Generated: 54552
% 2.16/2.59 Kept: 16256
% 2.16/2.59 Inuse: 1345
% 2.16/2.59 Deleted: 12
% 2.16/2.59 Deletedinuse: 8
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 Intermediate Status:
% 2.16/2.59 Generated: 62196
% 2.16/2.59 Kept: 18376
% 2.16/2.59 Inuse: 1456
% 2.16/2.59 Deleted: 13
% 2.16/2.59 Deletedinuse: 8
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59 Resimplifying clauses:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 Intermediate Status:
% 2.16/2.59 Generated: 70093
% 2.16/2.59 Kept: 20394
% 2.16/2.59 Inuse: 1571
% 2.16/2.59 Deleted: 48
% 2.16/2.59 Deletedinuse: 10
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 Intermediate Status:
% 2.16/2.59 Generated: 76780
% 2.16/2.59 Kept: 22473
% 2.16/2.59 Inuse: 1616
% 2.16/2.59 Deleted: 48
% 2.16/2.59 Deletedinuse: 10
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 Intermediate Status:
% 2.16/2.59 Generated: 84669
% 2.16/2.59 Kept: 24553
% 2.16/2.59 Inuse: 1711
% 2.16/2.59 Deleted: 48
% 2.16/2.59 Deletedinuse: 10
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 Intermediate Status:
% 2.16/2.59 Generated: 92994
% 2.16/2.59 Kept: 26565
% 2.16/2.59 Inuse: 1790
% 2.16/2.59 Deleted: 48
% 2.16/2.59 Deletedinuse: 10
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 Intermediate Status:
% 2.16/2.59 Generated: 101584
% 2.16/2.59 Kept: 28674
% 2.16/2.59 Inuse: 1923
% 2.16/2.59 Deleted: 48
% 2.16/2.59 Deletedinuse: 10
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 Intermediate Status:
% 2.16/2.59 Generated: 106622
% 2.16/2.59 Kept: 30866
% 2.16/2.59 Inuse: 1986
% 2.16/2.59 Deleted: 48
% 2.16/2.59 Deletedinuse: 10
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 Intermediate Status:
% 2.16/2.59 Generated: 114643
% 2.16/2.59 Kept: 32880
% 2.16/2.59 Inuse: 2076
% 2.16/2.59 Deleted: 48
% 2.16/2.59 Deletedinuse: 10
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 Intermediate Status:
% 2.16/2.59 Generated: 124088
% 2.16/2.59 Kept: 35081
% 2.16/2.59 Inuse: 2196
% 2.16/2.59 Deleted: 48
% 2.16/2.59 Deletedinuse: 10
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 Intermediate Status:
% 2.16/2.59 Generated: 130242
% 2.16/2.59 Kept: 37111
% 2.16/2.59 Inuse: 2247
% 2.16/2.59 Deleted: 48
% 2.16/2.59 Deletedinuse: 10
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 Intermediate Status:
% 2.16/2.59 Generated: 139905
% 2.16/2.59 Kept: 39143
% 2.16/2.59 Inuse: 2343
% 2.16/2.59 Deleted: 48
% 2.16/2.59 Deletedinuse: 10
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59 Resimplifying clauses:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 Intermediate Status:
% 2.16/2.59 Generated: 150304
% 2.16/2.59 Kept: 41165
% 2.16/2.59 Inuse: 2390
% 2.16/2.59 Deleted: 79
% 2.16/2.59 Deletedinuse: 10
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 Intermediate Status:
% 2.16/2.59 Generated: 156065
% 2.16/2.59 Kept: 43279
% 2.16/2.59 Inuse: 2411
% 2.16/2.59 Deleted: 79
% 2.16/2.59 Deletedinuse: 10
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 Intermediate Status:
% 2.16/2.59 Generated: 163350
% 2.16/2.59 Kept: 45426
% 2.16/2.59 Inuse: 2501
% 2.16/2.59 Deleted: 79
% 2.16/2.59 Deletedinuse: 10
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 Intermediate Status:
% 2.16/2.59 Generated: 168548
% 2.16/2.59 Kept: 47574
% 2.16/2.59 Inuse: 2593
% 2.16/2.59 Deleted: 79
% 2.16/2.59 Deletedinuse: 10
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 Intermediate Status:
% 2.16/2.59 Generated: 172620
% 2.16/2.59 Kept: 49606
% 2.16/2.59 Inuse: 2627
% 2.16/2.59 Deleted: 79
% 2.16/2.59 Deletedinuse: 10
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59 Resimplifying inuse:
% 2.16/2.59 Done
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 Intermediate Status:
% 2.16/2.59 Generated: 176967
% 2.16/2.59 Kept: 51650
% 2.16/2.59 Inuse: 2668
% 2.16/2.59 Deleted: 79
% 2.16/2.59 Deletedinuse: 10
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 Bliksems!, er is een bewijs:
% 2.16/2.59 % SZS status Unsatisfiable
% 2.16/2.59 % SZS output start Refutation
% 2.16/2.59
% 2.16/2.59 clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y ),
% 2.16/2.59 ~( 'is_a_theorem'( X ) ) ] )
% 2.16/2.59 .
% 2.16/2.59 clause( 1, [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ] )
% 2.16/2.59 .
% 2.16/2.59 clause( 2, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 2.16/2.59 .
% 2.16/2.59 clause( 3, [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) ),
% 2.16/2.59 implies( Y, implies( X, Z ) ) ) ) ] )
% 2.16/2.59 .
% 2.16/2.59 clause( 4, [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies( Z
% 2.16/2.59 , X ), implies( Z, Y ) ) ) ) ] )
% 2.16/2.59 .
% 2.16/2.59 clause( 5, [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies(
% 2.16/2.59 not( X ), Y ), Y ) ) ) ] )
% 2.16/2.59 .
% 2.16/2.59 clause( 6, [ ~( 'is_a_theorem'( implies( implies( a, b ), implies( not( b )
% 2.16/2.59 , not( a ) ) ) ) ) ] )
% 2.16/2.59 .
% 2.16/2.59 clause( 7, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X,
% 2.16/2.59 implies( not( X ), Y ) ), Z ) ) ) ] )
% 2.16/2.59 .
% 2.16/2.59 clause( 8, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X,
% 2.16/2.59 implies( Y, X ) ), Z ) ) ) ] )
% 2.16/2.59 .
% 2.16/2.59 clause( 12, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 2.16/2.59 implies( X, implies( Y, Z ) ), implies( Y, implies( X, Z ) ) ), T ) ) ) ]
% 2.16/2.59 )
% 2.16/2.59 .
% 2.16/2.59 clause( 19, [ 'is_a_theorem'( implies( implies( X, Y ), implies( X, implies(
% 2.16/2.59 Z, Y ) ) ) ) ] )
% 2.16/2.59 .
% 2.16/2.59 clause( 20, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 2.16/2.59 implies( X, Y ), implies( implies( Z, X ), implies( Z, Y ) ) ), T ) ) ) ]
% 2.16/2.59 )
% 2.16/2.59 .
% 2.16/2.59 clause( 29, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies(
% 2.16/2.59 implies( X, Y ), implies( implies( not( X ), Y ), Y ) ), Z ) ) ) ] )
% 2.16/2.59 .
% 2.16/2.59 clause( 31, [ 'is_a_theorem'( implies( X, implies( Y, implies( Z, X ) ) ) )
% 2.16/2.59 ] )
% 2.16/2.59 .
% 2.16/2.59 clause( 35, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies( X,
% 2.16/2.59 implies( Y, implies( Z, X ) ) ), T ) ) ) ] )
% 2.16/2.59 .
% 2.16/2.59 clause( 57, [ 'is_a_theorem'( implies( implies( X, implies( Y, implies( Z,
% 2.16/2.59 T ) ) ), implies( X, implies( Z, implies( Y, T ) ) ) ) ) ] )
% 2.16/2.59 .
% 2.16/2.59 clause( 214, [ 'is_a_theorem'( implies( implies( not( X ), Y ), implies(
% 2.16/2.59 implies( X, Y ), Y ) ) ) ] )
% 2.16/2.59 .
% 2.16/2.59 clause( 279, [ 'is_a_theorem'( implies( implies( X, implies( Y, implies( Z
% 2.16/2.59 , not( X ) ) ) ), implies( Y, implies( Z, not( X ) ) ) ) ) ] )
% 2.16/2.59 .
% 2.16/2.59 clause( 648, [ 'is_a_theorem'( implies( implies( X, Y ), implies( Z,
% 2.16/2.59 implies( implies( Z, X ), Y ) ) ) ) ] )
% 2.16/2.59 .
% 2.16/2.59 clause( 719, [ 'is_a_theorem'( implies( X, implies( implies( X, Y ),
% 2.16/2.59 implies( not( Y ), Z ) ) ) ) ] )
% 2.16/2.59 .
% 2.16/2.59 clause( 787, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies( X
% 2.16/2.59 , implies( implies( X, Y ), implies( not( Y ), Z ) ) ), T ) ) ) ] )
% 2.16/2.59 .
% 2.16/2.59 clause( 51971, [ 'is_a_theorem'( implies( implies( X, Y ), implies( not( Y
% 2.16/2.59 ), not( X ) ) ) ) ] )
% 2.16/2.59 .
% 2.16/2.59 clause( 52172, [] )
% 2.16/2.59 .
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 % SZS output end Refutation
% 2.16/2.59 found a proof!
% 2.16/2.59
% 2.16/2.59 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 2.16/2.59
% 2.16/2.59 initialclauses(
% 2.16/2.59 [ clause( 52174, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~(
% 2.16/2.59 'is_a_theorem'( X ) ), 'is_a_theorem'( Y ) ] )
% 2.16/2.59 , clause( 52175, [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ]
% 2.16/2.59 )
% 2.16/2.59 , clause( 52176, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 2.16/2.59 , clause( 52177, [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) ),
% 2.16/2.59 implies( Y, implies( X, Z ) ) ) ) ] )
% 2.16/2.59 , clause( 52178, [ 'is_a_theorem'( implies( implies( X, Y ), implies(
% 2.16/2.59 implies( Z, X ), implies( Z, Y ) ) ) ) ] )
% 2.16/2.59 , clause( 52179, [ 'is_a_theorem'( implies( implies( X, Y ), implies(
% 2.16/2.59 implies( not( X ), Y ), Y ) ) ) ] )
% 2.16/2.59 , clause( 52180, [ ~( 'is_a_theorem'( implies( implies( a, b ), implies(
% 2.16/2.59 not( b ), not( a ) ) ) ) ) ] )
% 2.16/2.59 ] ).
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 subsumption(
% 2.16/2.59 clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y ),
% 2.16/2.59 ~( 'is_a_theorem'( X ) ) ] )
% 2.16/2.59 , clause( 52174, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~(
% 2.16/2.59 'is_a_theorem'( X ) ), 'is_a_theorem'( Y ) ] )
% 2.16/2.59 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 2.16/2.59 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 subsumption(
% 2.16/2.59 clause( 1, [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ] )
% 2.16/2.59 , clause( 52175, [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ]
% 2.16/2.59 )
% 2.16/2.59 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 2.16/2.59 )] ) ).
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 subsumption(
% 2.16/2.59 clause( 2, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 2.16/2.59 , clause( 52176, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 2.16/2.59 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 2.16/2.59 )] ) ).
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 subsumption(
% 2.16/2.59 clause( 3, [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) ),
% 2.16/2.59 implies( Y, implies( X, Z ) ) ) ) ] )
% 2.16/2.59 , clause( 52177, [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) ),
% 2.16/2.59 implies( Y, implies( X, Z ) ) ) ) ] )
% 2.16/2.59 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 2.16/2.59 permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 subsumption(
% 2.16/2.59 clause( 4, [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies( Z
% 2.16/2.59 , X ), implies( Z, Y ) ) ) ) ] )
% 2.16/2.59 , clause( 52178, [ 'is_a_theorem'( implies( implies( X, Y ), implies(
% 2.16/2.59 implies( Z, X ), implies( Z, Y ) ) ) ) ] )
% 2.16/2.59 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 2.16/2.59 permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 subsumption(
% 2.16/2.59 clause( 5, [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies(
% 2.16/2.59 not( X ), Y ), Y ) ) ) ] )
% 2.16/2.59 , clause( 52179, [ 'is_a_theorem'( implies( implies( X, Y ), implies(
% 2.16/2.59 implies( not( X ), Y ), Y ) ) ) ] )
% 2.16/2.59 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 2.16/2.59 )] ) ).
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 subsumption(
% 2.16/2.59 clause( 6, [ ~( 'is_a_theorem'( implies( implies( a, b ), implies( not( b )
% 2.16/2.59 , not( a ) ) ) ) ) ] )
% 2.16/2.59 , clause( 52180, [ ~( 'is_a_theorem'( implies( implies( a, b ), implies(
% 2.16/2.59 not( b ), not( a ) ) ) ) ) ] )
% 2.16/2.59 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 resolution(
% 2.16/2.59 clause( 52182, [ ~( 'is_a_theorem'( implies( implies( X, implies( not( X )
% 2.16/2.59 , Y ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 2.16/2.59 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 2.16/2.59 , ~( 'is_a_theorem'( X ) ) ] )
% 2.16/2.59 , 2, clause( 1, [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ]
% 2.16/2.59 )
% 2.16/2.59 , 0, substitution( 0, [ :=( X, implies( X, implies( not( X ), Y ) ) ), :=(
% 2.16/2.59 Y, Z )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 subsumption(
% 2.16/2.59 clause( 7, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X,
% 2.16/2.59 implies( not( X ), Y ) ), Z ) ) ) ] )
% 2.16/2.59 , clause( 52182, [ ~( 'is_a_theorem'( implies( implies( X, implies( not( X
% 2.16/2.59 ), Y ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 2.16/2.59 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 2.16/2.59 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 resolution(
% 2.16/2.59 clause( 52184, [ ~( 'is_a_theorem'( implies( implies( X, implies( Y, X ) )
% 2.16/2.59 , Z ) ) ), 'is_a_theorem'( Z ) ] )
% 2.16/2.59 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 2.16/2.59 , ~( 'is_a_theorem'( X ) ) ] )
% 2.16/2.59 , 2, clause( 2, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 2.16/2.59 , 0, substitution( 0, [ :=( X, implies( X, implies( Y, X ) ) ), :=( Y, Z )] )
% 2.16/2.59 , substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 subsumption(
% 2.16/2.59 clause( 8, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X,
% 2.16/2.59 implies( Y, X ) ), Z ) ) ) ] )
% 2.16/2.59 , clause( 52184, [ ~( 'is_a_theorem'( implies( implies( X, implies( Y, X )
% 2.16/2.59 ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 2.16/2.59 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 2.16/2.59 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 resolution(
% 2.16/2.59 clause( 52186, [ ~( 'is_a_theorem'( implies( implies( implies( X, implies(
% 2.16/2.59 Y, Z ) ), implies( Y, implies( X, Z ) ) ), T ) ) ), 'is_a_theorem'( T ) ]
% 2.16/2.59 )
% 2.16/2.59 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 2.16/2.59 , ~( 'is_a_theorem'( X ) ) ] )
% 2.16/2.59 , 2, clause( 3, [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) ),
% 2.16/2.59 implies( Y, implies( X, Z ) ) ) ) ] )
% 2.16/2.59 , 0, substitution( 0, [ :=( X, implies( implies( X, implies( Y, Z ) ),
% 2.16/2.59 implies( Y, implies( X, Z ) ) ) ), :=( Y, T )] ), substitution( 1, [ :=(
% 2.16/2.59 X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 subsumption(
% 2.16/2.59 clause( 12, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 2.16/2.59 implies( X, implies( Y, Z ) ), implies( Y, implies( X, Z ) ) ), T ) ) ) ]
% 2.16/2.59 )
% 2.16/2.59 , clause( 52186, [ ~( 'is_a_theorem'( implies( implies( implies( X, implies(
% 2.16/2.59 Y, Z ) ), implies( Y, implies( X, Z ) ) ), T ) ) ), 'is_a_theorem'( T ) ]
% 2.16/2.59 )
% 2.16/2.59 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 2.16/2.59 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 resolution(
% 2.16/2.59 clause( 52187, [ 'is_a_theorem'( implies( implies( X, Y ), implies( X,
% 2.16/2.59 implies( Z, Y ) ) ) ) ] )
% 2.16/2.59 , clause( 8, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X
% 2.16/2.59 , implies( Y, X ) ), Z ) ) ) ] )
% 2.16/2.59 , 1, clause( 4, [ 'is_a_theorem'( implies( implies( X, Y ), implies(
% 2.16/2.59 implies( Z, X ), implies( Z, Y ) ) ) ) ] )
% 2.16/2.59 , 0, substitution( 0, [ :=( X, Y ), :=( Y, Z ), :=( Z, implies( implies( X
% 2.16/2.59 , Y ), implies( X, implies( Z, Y ) ) ) )] ), substitution( 1, [ :=( X, Y
% 2.16/2.59 ), :=( Y, implies( Z, Y ) ), :=( Z, X )] )).
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 subsumption(
% 2.16/2.59 clause( 19, [ 'is_a_theorem'( implies( implies( X, Y ), implies( X, implies(
% 2.16/2.59 Z, Y ) ) ) ) ] )
% 2.16/2.59 , clause( 52187, [ 'is_a_theorem'( implies( implies( X, Y ), implies( X,
% 2.16/2.59 implies( Z, Y ) ) ) ) ] )
% 2.16/2.59 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 2.16/2.59 permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 resolution(
% 2.16/2.59 clause( 52189, [ ~( 'is_a_theorem'( implies( implies( implies( X, Y ),
% 2.16/2.59 implies( implies( Z, X ), implies( Z, Y ) ) ), T ) ) ), 'is_a_theorem'( T
% 2.16/2.59 ) ] )
% 2.16/2.59 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 2.16/2.59 , ~( 'is_a_theorem'( X ) ) ] )
% 2.16/2.59 , 2, clause( 4, [ 'is_a_theorem'( implies( implies( X, Y ), implies(
% 2.16/2.59 implies( Z, X ), implies( Z, Y ) ) ) ) ] )
% 2.16/2.59 , 0, substitution( 0, [ :=( X, implies( implies( X, Y ), implies( implies(
% 2.16/2.59 Z, X ), implies( Z, Y ) ) ) ), :=( Y, T )] ), substitution( 1, [ :=( X, X
% 2.16/2.59 ), :=( Y, Y ), :=( Z, Z )] )).
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 subsumption(
% 2.16/2.59 clause( 20, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 2.16/2.59 implies( X, Y ), implies( implies( Z, X ), implies( Z, Y ) ) ), T ) ) ) ]
% 2.16/2.59 )
% 2.16/2.59 , clause( 52189, [ ~( 'is_a_theorem'( implies( implies( implies( X, Y ),
% 2.16/2.59 implies( implies( Z, X ), implies( Z, Y ) ) ), T ) ) ), 'is_a_theorem'( T
% 2.16/2.59 ) ] )
% 2.16/2.59 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 2.16/2.59 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 resolution(
% 2.16/2.59 clause( 52191, [ ~( 'is_a_theorem'( implies( implies( implies( X, Y ),
% 2.16/2.59 implies( implies( not( X ), Y ), Y ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 2.16/2.59 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 2.16/2.59 , ~( 'is_a_theorem'( X ) ) ] )
% 2.16/2.59 , 2, clause( 5, [ 'is_a_theorem'( implies( implies( X, Y ), implies(
% 2.16/2.59 implies( not( X ), Y ), Y ) ) ) ] )
% 2.16/2.59 , 0, substitution( 0, [ :=( X, implies( implies( X, Y ), implies( implies(
% 2.16/2.59 not( X ), Y ), Y ) ) ), :=( Y, Z )] ), substitution( 1, [ :=( X, X ),
% 2.16/2.59 :=( Y, Y )] )).
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 subsumption(
% 2.16/2.59 clause( 29, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies(
% 2.16/2.59 implies( X, Y ), implies( implies( not( X ), Y ), Y ) ), Z ) ) ) ] )
% 2.16/2.59 , clause( 52191, [ ~( 'is_a_theorem'( implies( implies( implies( X, Y ),
% 2.16/2.59 implies( implies( not( X ), Y ), Y ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 2.16/2.59 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 2.16/2.59 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 resolution(
% 2.16/2.59 clause( 52192, [ 'is_a_theorem'( implies( X, implies( Y, implies( Z, X ) )
% 2.16/2.59 ) ) ] )
% 2.16/2.59 , clause( 8, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X
% 2.16/2.59 , implies( Y, X ) ), Z ) ) ) ] )
% 2.16/2.59 , 1, clause( 19, [ 'is_a_theorem'( implies( implies( X, Y ), implies( X,
% 2.16/2.59 implies( Z, Y ) ) ) ) ] )
% 2.16/2.59 , 0, substitution( 0, [ :=( X, X ), :=( Y, Z ), :=( Z, implies( X, implies(
% 2.16/2.59 Y, implies( Z, X ) ) ) )] ), substitution( 1, [ :=( X, X ), :=( Y,
% 2.16/2.59 implies( Z, X ) ), :=( Z, Y )] )).
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 subsumption(
% 2.16/2.59 clause( 31, [ 'is_a_theorem'( implies( X, implies( Y, implies( Z, X ) ) ) )
% 2.16/2.59 ] )
% 2.16/2.59 , clause( 52192, [ 'is_a_theorem'( implies( X, implies( Y, implies( Z, X )
% 2.16/2.59 ) ) ) ] )
% 2.16/2.59 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 2.16/2.59 permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 resolution(
% 2.16/2.59 clause( 52194, [ ~( 'is_a_theorem'( implies( implies( X, implies( Y,
% 2.16/2.59 implies( Z, X ) ) ), T ) ) ), 'is_a_theorem'( T ) ] )
% 2.16/2.59 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 2.16/2.59 , ~( 'is_a_theorem'( X ) ) ] )
% 2.16/2.59 , 2, clause( 31, [ 'is_a_theorem'( implies( X, implies( Y, implies( Z, X )
% 2.16/2.59 ) ) ) ] )
% 2.16/2.59 , 0, substitution( 0, [ :=( X, implies( X, implies( Y, implies( Z, X ) ) )
% 2.16/2.59 ), :=( Y, T )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )
% 2.16/2.59 ).
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 subsumption(
% 2.16/2.59 clause( 35, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies( X,
% 2.16/2.59 implies( Y, implies( Z, X ) ) ), T ) ) ) ] )
% 2.16/2.59 , clause( 52194, [ ~( 'is_a_theorem'( implies( implies( X, implies( Y,
% 2.16/2.59 implies( Z, X ) ) ), T ) ) ), 'is_a_theorem'( T ) ] )
% 2.16/2.59 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 2.16/2.59 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 resolution(
% 2.16/2.59 clause( 52195, [ 'is_a_theorem'( implies( implies( X, implies( Y, implies(
% 2.16/2.59 Z, T ) ) ), implies( X, implies( Z, implies( Y, T ) ) ) ) ) ] )
% 2.16/2.59 , clause( 12, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 2.16/2.59 implies( X, implies( Y, Z ) ), implies( Y, implies( X, Z ) ) ), T ) ) ) ]
% 2.16/2.59 )
% 2.16/2.59 , 1, clause( 4, [ 'is_a_theorem'( implies( implies( X, Y ), implies(
% 2.16/2.59 implies( Z, X ), implies( Z, Y ) ) ) ) ] )
% 2.16/2.59 , 0, substitution( 0, [ :=( X, Y ), :=( Y, Z ), :=( Z, T ), :=( T, implies(
% 2.16/2.59 implies( X, implies( Y, implies( Z, T ) ) ), implies( X, implies( Z,
% 2.16/2.59 implies( Y, T ) ) ) ) )] ), substitution( 1, [ :=( X, implies( Y, implies(
% 2.16/2.59 Z, T ) ) ), :=( Y, implies( Z, implies( Y, T ) ) ), :=( Z, X )] )).
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 subsumption(
% 2.16/2.59 clause( 57, [ 'is_a_theorem'( implies( implies( X, implies( Y, implies( Z,
% 2.16/2.59 T ) ) ), implies( X, implies( Z, implies( Y, T ) ) ) ) ) ] )
% 2.16/2.59 , clause( 52195, [ 'is_a_theorem'( implies( implies( X, implies( Y, implies(
% 2.16/2.59 Z, T ) ) ), implies( X, implies( Z, implies( Y, T ) ) ) ) ) ] )
% 2.16/2.59 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 2.16/2.59 permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 resolution(
% 2.16/2.59 clause( 52196, [ 'is_a_theorem'( implies( implies( not( X ), Y ), implies(
% 2.16/2.59 implies( X, Y ), Y ) ) ) ] )
% 2.16/2.59 , clause( 29, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies(
% 2.16/2.59 implies( X, Y ), implies( implies( not( X ), Y ), Y ) ), Z ) ) ) ] )
% 2.16/2.59 , 1, clause( 3, [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) ),
% 2.16/2.59 implies( Y, implies( X, Z ) ) ) ) ] )
% 2.16/2.59 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, implies( implies(
% 2.16/2.59 not( X ), Y ), implies( implies( X, Y ), Y ) ) )] ), substitution( 1, [
% 2.16/2.59 :=( X, implies( X, Y ) ), :=( Y, implies( not( X ), Y ) ), :=( Z, Y )] )
% 2.16/2.59 ).
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 subsumption(
% 2.16/2.59 clause( 214, [ 'is_a_theorem'( implies( implies( not( X ), Y ), implies(
% 2.16/2.59 implies( X, Y ), Y ) ) ) ] )
% 2.16/2.59 , clause( 52196, [ 'is_a_theorem'( implies( implies( not( X ), Y ), implies(
% 2.16/2.59 implies( X, Y ), Y ) ) ) ] )
% 2.16/2.59 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 2.16/2.59 )] ) ).
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 resolution(
% 2.16/2.59 clause( 52197, [ 'is_a_theorem'( implies( implies( X, implies( Y, implies(
% 2.16/2.59 Z, not( X ) ) ) ), implies( Y, implies( Z, not( X ) ) ) ) ) ] )
% 2.16/2.59 , clause( 35, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies( X
% 2.16/2.59 , implies( Y, implies( Z, X ) ) ), T ) ) ) ] )
% 2.16/2.59 , 1, clause( 214, [ 'is_a_theorem'( implies( implies( not( X ), Y ),
% 2.16/2.59 implies( implies( X, Y ), Y ) ) ) ] )
% 2.16/2.59 , 0, substitution( 0, [ :=( X, not( X ) ), :=( Y, Y ), :=( Z, Z ), :=( T,
% 2.16/2.59 implies( implies( X, implies( Y, implies( Z, not( X ) ) ) ), implies( Y,
% 2.16/2.59 implies( Z, not( X ) ) ) ) )] ), substitution( 1, [ :=( X, X ), :=( Y,
% 2.16/2.59 implies( Y, implies( Z, not( X ) ) ) )] )).
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 subsumption(
% 2.16/2.59 clause( 279, [ 'is_a_theorem'( implies( implies( X, implies( Y, implies( Z
% 2.16/2.59 , not( X ) ) ) ), implies( Y, implies( Z, not( X ) ) ) ) ) ] )
% 2.16/2.59 , clause( 52197, [ 'is_a_theorem'( implies( implies( X, implies( Y, implies(
% 2.16/2.59 Z, not( X ) ) ) ), implies( Y, implies( Z, not( X ) ) ) ) ) ] )
% 2.16/2.59 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 2.16/2.59 permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 resolution(
% 2.16/2.59 clause( 52198, [ 'is_a_theorem'( implies( implies( X, Y ), implies( Z,
% 2.16/2.59 implies( implies( Z, X ), Y ) ) ) ) ] )
% 2.16/2.59 , clause( 20, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 2.16/2.59 implies( X, Y ), implies( implies( Z, X ), implies( Z, Y ) ) ), T ) ) ) ]
% 2.16/2.59 )
% 2.16/2.59 , 1, clause( 57, [ 'is_a_theorem'( implies( implies( X, implies( Y, implies(
% 2.16/2.59 Z, T ) ) ), implies( X, implies( Z, implies( Y, T ) ) ) ) ) ] )
% 2.16/2.59 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, implies(
% 2.16/2.59 implies( X, Y ), implies( Z, implies( implies( Z, X ), Y ) ) ) )] ),
% 2.16/2.59 substitution( 1, [ :=( X, implies( X, Y ) ), :=( Y, implies( Z, X ) ),
% 2.16/2.59 :=( Z, Z ), :=( T, Y )] )).
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 subsumption(
% 2.16/2.59 clause( 648, [ 'is_a_theorem'( implies( implies( X, Y ), implies( Z,
% 2.16/2.59 implies( implies( Z, X ), Y ) ) ) ) ] )
% 2.16/2.59 , clause( 52198, [ 'is_a_theorem'( implies( implies( X, Y ), implies( Z,
% 2.16/2.59 implies( implies( Z, X ), Y ) ) ) ) ] )
% 2.16/2.59 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 2.16/2.59 permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 resolution(
% 2.16/2.59 clause( 52199, [ 'is_a_theorem'( implies( X, implies( implies( X, Y ),
% 2.16/2.59 implies( not( Y ), Z ) ) ) ) ] )
% 2.16/2.59 , clause( 7, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X
% 2.16/2.59 , implies( not( X ), Y ) ), Z ) ) ) ] )
% 2.16/2.59 , 1, clause( 648, [ 'is_a_theorem'( implies( implies( X, Y ), implies( Z,
% 2.16/2.59 implies( implies( Z, X ), Y ) ) ) ) ] )
% 2.16/2.59 , 0, substitution( 0, [ :=( X, Y ), :=( Y, Z ), :=( Z, implies( X, implies(
% 2.16/2.59 implies( X, Y ), implies( not( Y ), Z ) ) ) )] ), substitution( 1, [ :=(
% 2.16/2.59 X, Y ), :=( Y, implies( not( Y ), Z ) ), :=( Z, X )] )).
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 subsumption(
% 2.16/2.59 clause( 719, [ 'is_a_theorem'( implies( X, implies( implies( X, Y ),
% 2.16/2.59 implies( not( Y ), Z ) ) ) ) ] )
% 2.16/2.59 , clause( 52199, [ 'is_a_theorem'( implies( X, implies( implies( X, Y ),
% 2.16/2.59 implies( not( Y ), Z ) ) ) ) ] )
% 2.16/2.59 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 2.16/2.59 permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 resolution(
% 2.16/2.59 clause( 52201, [ ~( 'is_a_theorem'( implies( implies( X, implies( implies(
% 2.16/2.59 X, Y ), implies( not( Y ), Z ) ) ), T ) ) ), 'is_a_theorem'( T ) ] )
% 2.16/2.59 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 2.16/2.59 , ~( 'is_a_theorem'( X ) ) ] )
% 2.16/2.59 , 2, clause( 719, [ 'is_a_theorem'( implies( X, implies( implies( X, Y ),
% 2.16/2.59 implies( not( Y ), Z ) ) ) ) ] )
% 2.16/2.59 , 0, substitution( 0, [ :=( X, implies( X, implies( implies( X, Y ),
% 2.16/2.59 implies( not( Y ), Z ) ) ) ), :=( Y, T )] ), substitution( 1, [ :=( X, X
% 2.16/2.59 ), :=( Y, Y ), :=( Z, Z )] )).
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 subsumption(
% 2.16/2.59 clause( 787, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies( X
% 2.16/2.59 , implies( implies( X, Y ), implies( not( Y ), Z ) ) ), T ) ) ) ] )
% 2.16/2.59 , clause( 52201, [ ~( 'is_a_theorem'( implies( implies( X, implies( implies(
% 2.16/2.59 X, Y ), implies( not( Y ), Z ) ) ), T ) ) ), 'is_a_theorem'( T ) ] )
% 2.16/2.59 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 2.16/2.59 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 resolution(
% 2.16/2.59 clause( 52202, [ 'is_a_theorem'( implies( implies( X, Y ), implies( not( Y
% 2.16/2.59 ), not( X ) ) ) ) ] )
% 2.16/2.59 , clause( 787, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 2.16/2.59 X, implies( implies( X, Y ), implies( not( Y ), Z ) ) ), T ) ) ) ] )
% 2.16/2.59 , 1, clause( 279, [ 'is_a_theorem'( implies( implies( X, implies( Y,
% 2.16/2.59 implies( Z, not( X ) ) ) ), implies( Y, implies( Z, not( X ) ) ) ) ) ] )
% 2.16/2.59 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, not( X ) ), :=( T,
% 2.16/2.59 implies( implies( X, Y ), implies( not( Y ), not( X ) ) ) )] ),
% 2.16/2.59 substitution( 1, [ :=( X, X ), :=( Y, implies( X, Y ) ), :=( Z, not( Y )
% 2.16/2.59 )] )).
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 subsumption(
% 2.16/2.59 clause( 51971, [ 'is_a_theorem'( implies( implies( X, Y ), implies( not( Y
% 2.16/2.59 ), not( X ) ) ) ) ] )
% 2.16/2.59 , clause( 52202, [ 'is_a_theorem'( implies( implies( X, Y ), implies( not(
% 2.16/2.59 Y ), not( X ) ) ) ) ] )
% 2.16/2.59 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 2.16/2.59 )] ) ).
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 resolution(
% 2.16/2.59 clause( 52203, [] )
% 2.16/2.59 , clause( 6, [ ~( 'is_a_theorem'( implies( implies( a, b ), implies( not( b
% 2.16/2.59 ), not( a ) ) ) ) ) ] )
% 2.16/2.59 , 0, clause( 51971, [ 'is_a_theorem'( implies( implies( X, Y ), implies(
% 2.16/2.59 not( Y ), not( X ) ) ) ) ] )
% 2.16/2.59 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, a ), :=( Y, b )] )
% 2.16/2.59 ).
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 subsumption(
% 2.16/2.59 clause( 52172, [] )
% 2.16/2.59 , clause( 52203, [] )
% 2.16/2.59 , substitution( 0, [] ), permutation( 0, [] ) ).
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 end.
% 2.16/2.59
% 2.16/2.59 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 2.16/2.59
% 2.16/2.59 Memory use:
% 2.16/2.59
% 2.16/2.59 space for terms: 982297
% 2.16/2.59 space for clauses: 4593829
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 clauses generated: 178334
% 2.16/2.59 clauses kept: 52173
% 2.16/2.59 clauses selected: 2673
% 2.16/2.59 clauses deleted: 79
% 2.16/2.59 clauses inuse deleted: 10
% 2.16/2.59
% 2.16/2.59 subsentry: 137939
% 2.16/2.59 literals s-matched: 126240
% 2.16/2.59 literals matched: 126240
% 2.16/2.59 full subsumption: 0
% 2.16/2.59
% 2.16/2.59 checksum: -1187035834
% 2.16/2.59
% 2.16/2.59
% 2.16/2.59 Bliksem ended
%------------------------------------------------------------------------------