TSTP Solution File: LCL209-3 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL209-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n007.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 0s
% DateTime : Sun Jul 17 07:51:45 EDT 2022
% Result : Unsatisfiable 11.32s 11.71s
% Output : Refutation 11.32s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL209-3 : TPTP v8.1.0. Released v2.3.0.
% 0.03/0.13 % Command : bliksem %s
% 0.12/0.33 % Computer : n007.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % DateTime : Sun Jul 3 12:33:41 EDT 2022
% 0.12/0.33 % CPUTime :
% 8.53/8.92 *** allocated 10000 integers for termspace/termends
% 8.53/8.92 *** allocated 10000 integers for clauses
% 8.53/8.92 *** allocated 10000 integers for justifications
% 8.53/8.92 Bliksem 1.12
% 8.53/8.92
% 8.53/8.92
% 8.53/8.92 Automatic Strategy Selection
% 8.53/8.92
% 8.53/8.92 Clauses:
% 8.53/8.92 [
% 8.53/8.92 [ axiom( implies( or( X, X ), X ) ) ],
% 8.53/8.92 [ axiom( implies( X, or( Y, X ) ) ) ],
% 8.53/8.92 [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ],
% 8.53/8.92 [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) ) ) ) ],
% 8.53/8.92 [ axiom( implies( implies( X, Y ), implies( or( Z, X ), or( Z, Y ) ) ) )
% 8.53/8.92 ],
% 8.53/8.92 [ =( implies( X, Y ), or( not( X ), Y ) ) ],
% 8.53/8.92 [ theorem( X ), ~( axiom( X ) ) ],
% 8.53/8.92 [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y ) ) ]
% 8.53/8.92 ,
% 8.53/8.92 [ ~( theorem( implies( implies( not( p ), q ), or( p, q ) ) ) ) ]
% 8.53/8.92 ] .
% 8.53/8.92
% 8.53/8.92
% 8.53/8.92 percentage equality = 0.083333, percentage horn = 1.000000
% 8.53/8.92 This is a problem with some equality
% 8.53/8.92
% 8.53/8.92
% 8.53/8.92
% 8.53/8.92 Options Used:
% 8.53/8.92
% 8.53/8.92 useres = 1
% 8.53/8.92 useparamod = 1
% 8.53/8.92 useeqrefl = 1
% 8.53/8.92 useeqfact = 1
% 8.53/8.92 usefactor = 1
% 8.53/8.92 usesimpsplitting = 0
% 8.53/8.92 usesimpdemod = 5
% 8.53/8.92 usesimpres = 3
% 8.53/8.92
% 8.53/8.92 resimpinuse = 1000
% 8.53/8.92 resimpclauses = 20000
% 8.53/8.92 substype = eqrewr
% 8.53/8.92 backwardsubs = 1
% 8.53/8.92 selectoldest = 5
% 8.53/8.92
% 8.53/8.92 litorderings [0] = split
% 8.53/8.92 litorderings [1] = extend the termordering, first sorting on arguments
% 8.53/8.92
% 8.53/8.92 termordering = kbo
% 8.53/8.92
% 8.53/8.92 litapriori = 0
% 8.53/8.92 termapriori = 1
% 8.53/8.92 litaposteriori = 0
% 8.53/8.92 termaposteriori = 0
% 8.53/8.92 demodaposteriori = 0
% 8.53/8.92 ordereqreflfact = 0
% 8.53/8.92
% 8.53/8.92 litselect = negord
% 8.53/8.92
% 8.53/8.92 maxweight = 15
% 8.53/8.92 maxdepth = 30000
% 8.53/8.92 maxlength = 115
% 8.53/8.92 maxnrvars = 195
% 8.53/8.92 excuselevel = 1
% 8.53/8.92 increasemaxweight = 1
% 8.53/8.92
% 8.53/8.92 maxselected = 10000000
% 8.53/8.92 maxnrclauses = 10000000
% 8.53/8.92
% 8.53/8.92 showgenerated = 0
% 8.53/8.92 showkept = 0
% 8.53/8.92 showselected = 0
% 8.53/8.92 showdeleted = 0
% 8.53/8.92 showresimp = 1
% 8.53/8.92 showstatus = 2000
% 8.53/8.92
% 8.53/8.92 prologoutput = 1
% 8.53/8.92 nrgoals = 5000000
% 8.53/8.92 totalproof = 1
% 8.53/8.92
% 8.53/8.92 Symbols occurring in the translation:
% 8.53/8.92
% 8.53/8.92 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 8.53/8.92 . [1, 2] (w:1, o:24, a:1, s:1, b:0),
% 8.53/8.92 ! [4, 1] (w:0, o:16, a:1, s:1, b:0),
% 8.53/8.92 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 8.53/8.92 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 8.53/8.92 or [40, 2] (w:1, o:49, a:1, s:1, b:0),
% 8.53/8.92 implies [41, 2] (w:1, o:50, a:1, s:1, b:0),
% 8.53/8.92 axiom [42, 1] (w:1, o:21, a:1, s:1, b:0),
% 8.53/8.92 not [47, 1] (w:1, o:22, a:1, s:1, b:0),
% 8.53/8.92 theorem [48, 1] (w:1, o:23, a:1, s:1, b:0),
% 8.53/8.92 p [49, 0] (w:1, o:14, a:1, s:1, b:0),
% 8.53/8.92 q [50, 0] (w:1, o:15, a:1, s:1, b:0).
% 8.53/8.92
% 8.53/8.92
% 8.53/8.92 Starting Search:
% 8.53/8.92
% 8.53/8.92 Resimplifying inuse:
% 8.53/8.92 Done
% 8.53/8.92
% 8.53/8.92
% 8.53/8.92 Intermediate Status:
% 8.53/8.92 Generated: 3814
% 8.53/8.92 Kept: 2013
% 8.53/8.92 Inuse: 123
% 8.53/8.92 Deleted: 0
% 8.53/8.92 Deletedinuse: 0
% 8.53/8.92
% 8.53/8.92 Resimplifying inuse:
% 8.53/8.92 Done
% 8.53/8.92
% 8.53/8.92 Resimplifying inuse:
% 8.53/8.92 Done
% 8.53/8.92
% 8.53/8.92
% 8.53/8.92 Intermediate Status:
% 8.53/8.92 Generated: 8685
% 8.53/8.92 Kept: 4078
% 8.53/8.92 Inuse: 191
% 8.53/8.92 Deleted: 0
% 8.53/8.92 Deletedinuse: 0
% 8.53/8.92
% 8.53/8.92 Resimplifying inuse:
% 8.53/8.92 Done
% 8.53/8.92
% 8.53/8.92 Resimplifying inuse:
% 8.53/8.92 Done
% 8.53/8.92
% 8.53/8.92
% 8.53/8.92 Intermediate Status:
% 8.53/8.92 Generated: 13149
% 8.53/8.92 Kept: 6116
% 8.53/8.92 Inuse: 237
% 8.53/8.92 Deleted: 0
% 8.53/8.92 Deletedinuse: 0
% 8.53/8.92
% 8.53/8.92 Resimplifying inuse:
% 8.53/8.92 Done
% 8.53/8.92
% 8.53/8.92 Resimplifying inuse:
% 8.53/8.92 Done
% 8.53/8.92
% 8.53/8.92
% 8.53/8.92 Intermediate Status:
% 8.53/8.92 Generated: 18659
% 8.53/8.92 Kept: 8130
% 8.53/8.92 Inuse: 300
% 8.53/8.92 Deleted: 0
% 8.53/8.92 Deletedinuse: 0
% 8.53/8.92
% 8.53/8.92 Resimplifying inuse:
% 8.53/8.92 Done
% 8.53/8.92
% 8.53/8.92 Resimplifying inuse:
% 8.53/8.92 Done
% 8.53/8.92
% 8.53/8.92
% 8.53/8.92 Intermediate Status:
% 8.53/8.92 Generated: 24019
% 8.53/8.92 Kept: 10140
% 8.53/8.92 Inuse: 353
% 8.53/8.92 Deleted: 0
% 8.53/8.92 Deletedinuse: 0
% 8.53/8.92
% 8.53/8.92 Resimplifying inuse:
% 8.53/8.92 Done
% 8.53/8.92
% 8.53/8.92 Resimplifying inuse:
% 8.53/8.92 Done
% 8.53/8.92
% 8.53/8.92
% 8.53/8.92 Intermediate Status:
% 8.53/8.92 Generated: 28430
% 8.53/8.92 Kept: 12155
% 8.53/8.92 Inuse: 381
% 8.53/8.92 Deleted: 0
% 8.53/8.92 Deletedinuse: 0
% 8.53/8.92
% 8.53/8.92 Resimplifying inuse:
% 8.53/8.92 Done
% 8.53/8.92
% 8.53/8.92 Resimplifying inuse:
% 8.53/8.92 Done
% 8.53/8.92
% 8.53/8.92
% 8.53/8.92 Intermediate Status:
% 8.53/8.92 Generated: 34362
% 8.53/8.92 Kept: 14172
% 8.53/8.92 Inuse: 432
% 8.53/8.92 Deleted: 0
% 8.53/8.92 Deletedinuse: 0
% 8.53/8.92
% 8.53/8.92 Resimplifying inuse:
% 8.53/8.92 Done
% 8.53/8.92
% 8.53/8.92 Resimplifying inuse:
% 8.53/8.92 Done
% 8.53/8.92
% 8.53/8.92
% 8.53/8.92 Intermediate Status:
% 8.53/8.92 Generated: 38640
% 8.53/8.92 Kept: 16213
% 8.53/8.92 Inuse: 476
% 8.53/8.92 Deleted: 0
% 8.53/8.92 Deletedinuse: 0
% 8.53/8.92
% 8.53/8.92 Resimplifying inuse:
% 8.53/8.92 Done
% 8.53/8.92
% 8.53/8.92 Resimplifying inuse:
% 8.53/8.92 Done
% 8.53/8.92
% 8.53/8.92
% 8.53/8.92 Intermediate Status:
% 8.53/8.92 Generated: 42261
% 8.53/8.92 Kept: 18256
% 8.53/8.92 Inuse: 508
% 8.53/8.92 Deleted: 0
% 8.53/8.92 Deletedinuse: 0
% 8.53/8.92
% 8.53/8.92 Resimplifying inuse:
% 8.53/8.92 Done
% 8.53/8.92
% 8.53/8.92 Resimplifying inuse:
% 8.53/8.92 Done
% 8.53/8.92
% 8.53/8.92 Resimplifying clauses:
% 8.53/8.92 Done
% 8.53/8.92
% 8.53/8.92
% 8.53/8.92 Intermediate Status:
% 8.53/8.92 Generated: 46622
% 8.53/8.92 Kept: 20546
% 8.53/8.92 Inuse: 536
% 8.53/8.92 Deleted: 74
% 8.53/8.92 Deletedinuse: 0
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 Intermediate Status:
% 11.32/11.71 Generated: 50610
% 11.32/11.71 Kept: 22561
% 11.32/11.71 Inuse: 575
% 11.32/11.71 Deleted: 74
% 11.32/11.71 Deletedinuse: 0
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 Intermediate Status:
% 11.32/11.71 Generated: 55612
% 11.32/11.71 Kept: 24619
% 11.32/11.71 Inuse: 604
% 11.32/11.71 Deleted: 74
% 11.32/11.71 Deletedinuse: 0
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 Intermediate Status:
% 11.32/11.71 Generated: 62144
% 11.32/11.71 Kept: 26833
% 11.32/11.71 Inuse: 627
% 11.32/11.71 Deleted: 74
% 11.32/11.71 Deletedinuse: 0
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 Intermediate Status:
% 11.32/11.71 Generated: 67168
% 11.32/11.71 Kept: 29002
% 11.32/11.71 Inuse: 640
% 11.32/11.71 Deleted: 74
% 11.32/11.71 Deletedinuse: 0
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 Intermediate Status:
% 11.32/11.71 Generated: 90388
% 11.32/11.71 Kept: 31175
% 11.32/11.71 Inuse: 740
% 11.32/11.71 Deleted: 74
% 11.32/11.71 Deletedinuse: 0
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 Intermediate Status:
% 11.32/11.71 Generated: 96682
% 11.32/11.71 Kept: 33273
% 11.32/11.71 Inuse: 755
% 11.32/11.71 Deleted: 74
% 11.32/11.71 Deletedinuse: 0
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 Intermediate Status:
% 11.32/11.71 Generated: 102318
% 11.32/11.71 Kept: 35288
% 11.32/11.71 Inuse: 770
% 11.32/11.71 Deleted: 74
% 11.32/11.71 Deletedinuse: 0
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 Intermediate Status:
% 11.32/11.71 Generated: 109471
% 11.32/11.71 Kept: 37341
% 11.32/11.71 Inuse: 794
% 11.32/11.71 Deleted: 76
% 11.32/11.71 Deletedinuse: 0
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 Intermediate Status:
% 11.32/11.71 Generated: 117119
% 11.32/11.71 Kept: 39397
% 11.32/11.71 Inuse: 823
% 11.32/11.71 Deleted: 76
% 11.32/11.71 Deletedinuse: 0
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71 Resimplifying clauses:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 Intermediate Status:
% 11.32/11.71 Generated: 129415
% 11.32/11.71 Kept: 41520
% 11.32/11.71 Inuse: 881
% 11.32/11.71 Deleted: 99
% 11.32/11.71 Deletedinuse: 0
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 Intermediate Status:
% 11.32/11.71 Generated: 147250
% 11.32/11.71 Kept: 43569
% 11.32/11.71 Inuse: 925
% 11.32/11.71 Deleted: 99
% 11.32/11.71 Deletedinuse: 0
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 Intermediate Status:
% 11.32/11.71 Generated: 157405
% 11.32/11.71 Kept: 45581
% 11.32/11.71 Inuse: 948
% 11.32/11.71 Deleted: 99
% 11.32/11.71 Deletedinuse: 0
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 Intermediate Status:
% 11.32/11.71 Generated: 172006
% 11.32/11.71 Kept: 47616
% 11.32/11.71 Inuse: 1010
% 11.32/11.71 Deleted: 99
% 11.32/11.71 Deletedinuse: 0
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 Intermediate Status:
% 11.32/11.71 Generated: 180543
% 11.32/11.71 Kept: 50537
% 11.32/11.71 Inuse: 1043
% 11.32/11.71 Deleted: 99
% 11.32/11.71 Deletedinuse: 0
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 Intermediate Status:
% 11.32/11.71 Generated: 184073
% 11.32/11.71 Kept: 52669
% 11.32/11.71 Inuse: 1049
% 11.32/11.71 Deleted: 99
% 11.32/11.71 Deletedinuse: 0
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 Intermediate Status:
% 11.32/11.71 Generated: 189643
% 11.32/11.71 Kept: 54796
% 11.32/11.71 Inuse: 1061
% 11.32/11.71 Deleted: 99
% 11.32/11.71 Deletedinuse: 0
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 Intermediate Status:
% 11.32/11.71 Generated: 197844
% 11.32/11.71 Kept: 56799
% 11.32/11.71 Inuse: 1089
% 11.32/11.71 Deleted: 99
% 11.32/11.71 Deletedinuse: 0
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 Intermediate Status:
% 11.32/11.71 Generated: 206301
% 11.32/11.71 Kept: 59059
% 11.32/11.71 Inuse: 1142
% 11.32/11.71 Deleted: 99
% 11.32/11.71 Deletedinuse: 0
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71 Resimplifying clauses:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 Intermediate Status:
% 11.32/11.71 Generated: 212786
% 11.32/11.71 Kept: 61203
% 11.32/11.71 Inuse: 1153
% 11.32/11.71 Deleted: 126
% 11.32/11.71 Deletedinuse: 0
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 Intermediate Status:
% 11.32/11.71 Generated: 221130
% 11.32/11.71 Kept: 63392
% 11.32/11.71 Inuse: 1175
% 11.32/11.71 Deleted: 126
% 11.32/11.71 Deletedinuse: 0
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 Intermediate Status:
% 11.32/11.71 Generated: 228540
% 11.32/11.71 Kept: 65844
% 11.32/11.71 Inuse: 1200
% 11.32/11.71 Deleted: 126
% 11.32/11.71 Deletedinuse: 0
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 Intermediate Status:
% 11.32/11.71 Generated: 234036
% 11.32/11.71 Kept: 68045
% 11.32/11.71 Inuse: 1210
% 11.32/11.71 Deleted: 126
% 11.32/11.71 Deletedinuse: 0
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 Intermediate Status:
% 11.32/11.71 Generated: 237866
% 11.32/11.71 Kept: 70121
% 11.32/11.71 Inuse: 1218
% 11.32/11.71 Deleted: 126
% 11.32/11.71 Deletedinuse: 0
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 Intermediate Status:
% 11.32/11.71 Generated: 242198
% 11.32/11.71 Kept: 72330
% 11.32/11.71 Inuse: 1231
% 11.32/11.71 Deleted: 126
% 11.32/11.71 Deletedinuse: 0
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 Intermediate Status:
% 11.32/11.71 Generated: 247677
% 11.32/11.71 Kept: 74715
% 11.32/11.71 Inuse: 1250
% 11.32/11.71 Deleted: 126
% 11.32/11.71 Deletedinuse: 0
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 Intermediate Status:
% 11.32/11.71 Generated: 252355
% 11.32/11.71 Kept: 76729
% 11.32/11.71 Inuse: 1271
% 11.32/11.71 Deleted: 126
% 11.32/11.71 Deletedinuse: 0
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 Intermediate Status:
% 11.32/11.71 Generated: 260184
% 11.32/11.71 Kept: 78904
% 11.32/11.71 Inuse: 1303
% 11.32/11.71 Deleted: 126
% 11.32/11.71 Deletedinuse: 0
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71 Resimplifying inuse:
% 11.32/11.71 Done
% 11.32/11.71
% 11.32/11.71 Resimplifying clauses:
% 11.32/11.71
% 11.32/11.71 Bliksems!, er is een bewijs:
% 11.32/11.71 % SZS status Unsatisfiable
% 11.32/11.71 % SZS output start Refutation
% 11.32/11.71
% 11.32/11.71 clause( 0, [ axiom( implies( or( X, X ), X ) ) ] )
% 11.32/11.71 .
% 11.32/11.71 clause( 1, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 11.32/11.71 .
% 11.32/11.71 clause( 2, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 11.32/11.71 .
% 11.32/11.71 clause( 3, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) ) ) ) ]
% 11.32/11.71 )
% 11.32/11.71 .
% 11.32/11.71 clause( 4, [ axiom( implies( implies( X, Y ), implies( or( Z, X ), or( Z, Y
% 11.32/11.71 ) ) ) ) ] )
% 11.32/11.71 .
% 11.32/11.71 clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 11.32/11.71 .
% 11.32/11.71 clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 11.32/11.71 .
% 11.32/11.71 clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y )
% 11.32/11.71 ) ] )
% 11.32/11.71 .
% 11.32/11.71 clause( 8, [ ~( theorem( implies( implies( not( p ), q ), or( p, q ) ) ) )
% 11.32/11.71 ] )
% 11.32/11.71 .
% 11.32/11.71 clause( 9, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 11.32/11.71 .
% 11.32/11.71 clause( 10, [ theorem( implies( or( X, X ), X ) ) ] )
% 11.32/11.71 .
% 11.32/11.71 clause( 14, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 11.32/11.71 .
% 11.32/11.71 clause( 18, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X ) )
% 11.32/11.71 ) ] )
% 11.32/11.71 .
% 11.32/11.71 clause( 57, [ theorem( X ), ~( axiom( implies( Y, X ) ) ), ~( theorem( or(
% 11.32/11.71 Y, Y ) ) ) ] )
% 11.32/11.71 .
% 11.32/11.71 clause( 64, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 11.32/11.71 .
% 11.32/11.71 clause( 66, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y ) ), X
% 11.32/11.71 ) ) ) ] )
% 11.32/11.71 .
% 11.32/11.71 clause( 70, [ theorem( implies( or( X, Y ), or( X, Z ) ) ), ~( theorem(
% 11.32/11.71 implies( Y, Z ) ) ) ] )
% 11.32/11.71 .
% 11.32/11.71 clause( 117, [ theorem( or( Y, not( X ) ) ), ~( theorem( implies( X, Y ) )
% 11.32/11.71 ) ] )
% 11.32/11.71 .
% 11.32/11.71 clause( 124, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies( X
% 11.32/11.71 , Z ) ) ) ) ] )
% 11.32/11.71 .
% 11.32/11.71 clause( 125, [ axiom( implies( or( Z, implies( X, Y ) ), implies( X, or( Z
% 11.32/11.71 , Y ) ) ) ) ] )
% 11.32/11.71 .
% 11.32/11.71 clause( 167, [ ~( theorem( X ) ), ~( axiom( implies( X, implies( implies(
% 11.32/11.71 not( p ), q ), or( p, q ) ) ) ) ) ] )
% 11.32/11.71 .
% 11.32/11.71 clause( 15593, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 11.32/11.71 .
% 11.32/11.71 clause( 15655, [ theorem( X ), ~( axiom( implies( implies( Y, Y ), X ) ) )
% 11.32/11.71 ] )
% 11.32/11.71 .
% 11.32/11.71 clause( 15720, [ theorem( implies( X, X ) ) ] )
% 11.32/11.71 .
% 11.32/11.71 clause( 15723, [ theorem( or( X, not( X ) ) ) ] )
% 11.32/11.71 .
% 11.32/11.71 clause( 16016, [ theorem( X ), ~( theorem( implies( or( Y, not( Y ) ), X )
% 11.32/11.71 ) ) ] )
% 11.32/11.71 .
% 11.32/11.71 clause( 21618, [ ~( theorem( or( p, implies( implies( not( p ), q ), q ) )
% 11.32/11.71 ) ) ] )
% 11.32/11.71 .
% 11.32/11.71 clause( 23134, [ theorem( or( X, implies( or( X, Y ), Y ) ) ) ] )
% 11.32/11.71 .
% 11.32/11.71 clause( 25202, [ theorem( implies( X, implies( implies( X, Y ), Y ) ) ) ]
% 11.32/11.71 )
% 11.32/11.71 .
% 11.32/11.71 clause( 72189, [ theorem( or( X, Y ) ), ~( theorem( implies( not( X ), Y )
% 11.32/11.71 ) ) ] )
% 11.32/11.71 .
% 11.32/11.71 clause( 72522, [ theorem( or( X, implies( implies( not( X ), Y ), Y ) ) ) ]
% 11.32/11.71 )
% 11.32/11.71 .
% 11.32/11.71 clause( 80771, [] )
% 11.32/11.71 .
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 % SZS output end Refutation
% 11.32/11.71 found a proof!
% 11.32/11.71
% 11.32/11.71 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 11.32/11.71
% 11.32/11.71 initialclauses(
% 11.32/11.71 [ clause( 80773, [ axiom( implies( or( X, X ), X ) ) ] )
% 11.32/11.71 , clause( 80774, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 11.32/11.71 , clause( 80775, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 11.32/11.71 , clause( 80776, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) )
% 11.32/11.71 ) ) ] )
% 11.32/11.71 , clause( 80777, [ axiom( implies( implies( X, Y ), implies( or( Z, X ), or(
% 11.32/11.71 Z, Y ) ) ) ) ] )
% 11.32/11.71 , clause( 80778, [ =( implies( X, Y ), or( not( X ), Y ) ) ] )
% 11.32/11.71 , clause( 80779, [ theorem( X ), ~( axiom( X ) ) ] )
% 11.32/11.71 , clause( 80780, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~(
% 11.32/11.71 theorem( Y ) ) ] )
% 11.32/11.71 , clause( 80781, [ ~( theorem( implies( implies( not( p ), q ), or( p, q )
% 11.32/11.71 ) ) ) ] )
% 11.32/11.71 ] ).
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 subsumption(
% 11.32/11.71 clause( 0, [ axiom( implies( or( X, X ), X ) ) ] )
% 11.32/11.71 , clause( 80773, [ axiom( implies( or( X, X ), X ) ) ] )
% 11.32/11.71 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 subsumption(
% 11.32/11.71 clause( 1, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 11.32/11.71 , clause( 80774, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 11.32/11.71 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 11.32/11.71 )] ) ).
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 subsumption(
% 11.32/11.71 clause( 2, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 11.32/11.71 , clause( 80775, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 11.32/11.71 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 11.32/11.71 )] ) ).
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 subsumption(
% 11.32/11.71 clause( 3, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) ) ) ) ]
% 11.32/11.71 )
% 11.32/11.71 , clause( 80776, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) )
% 11.32/11.71 ) ) ] )
% 11.32/11.71 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 11.32/11.71 permutation( 0, [ ==>( 0, 0 )] ) ).
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 subsumption(
% 11.32/11.71 clause( 4, [ axiom( implies( implies( X, Y ), implies( or( Z, X ), or( Z, Y
% 11.32/11.71 ) ) ) ) ] )
% 11.32/11.71 , clause( 80777, [ axiom( implies( implies( X, Y ), implies( or( Z, X ), or(
% 11.32/11.71 Z, Y ) ) ) ) ] )
% 11.32/11.71 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 11.32/11.71 permutation( 0, [ ==>( 0, 0 )] ) ).
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 eqswap(
% 11.32/11.71 clause( 80782, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 11.32/11.71 , clause( 80778, [ =( implies( X, Y ), or( not( X ), Y ) ) ] )
% 11.32/11.71 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 subsumption(
% 11.32/11.71 clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 11.32/11.71 , clause( 80782, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 11.32/11.71 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 11.32/11.71 )] ) ).
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 subsumption(
% 11.32/11.71 clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 11.32/11.71 , clause( 80779, [ theorem( X ), ~( axiom( X ) ) ] )
% 11.32/11.71 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 11.32/11.71 1 )] ) ).
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 subsumption(
% 11.32/11.71 clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y )
% 11.32/11.71 ) ] )
% 11.32/11.71 , clause( 80780, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~(
% 11.32/11.71 theorem( Y ) ) ] )
% 11.32/11.71 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 11.32/11.71 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 subsumption(
% 11.32/11.71 clause( 8, [ ~( theorem( implies( implies( not( p ), q ), or( p, q ) ) ) )
% 11.32/11.71 ] )
% 11.32/11.71 , clause( 80781, [ ~( theorem( implies( implies( not( p ), q ), or( p, q )
% 11.32/11.71 ) ) ) ] )
% 11.32/11.71 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 resolution(
% 11.32/11.71 clause( 80786, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 11.32/11.71 , clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 11.32/11.71 , 1, clause( 1, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 11.32/11.71 , 0, substitution( 0, [ :=( X, implies( X, or( Y, X ) ) )] ),
% 11.32/11.71 substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 subsumption(
% 11.32/11.71 clause( 9, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 11.32/11.71 , clause( 80786, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 11.32/11.71 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 11.32/11.71 )] ) ).
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 resolution(
% 11.32/11.71 clause( 80787, [ theorem( implies( or( X, X ), X ) ) ] )
% 11.32/11.71 , clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 11.32/11.71 , 1, clause( 0, [ axiom( implies( or( X, X ), X ) ) ] )
% 11.32/11.71 , 0, substitution( 0, [ :=( X, implies( or( X, X ), X ) )] ),
% 11.32/11.71 substitution( 1, [ :=( X, X )] )).
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 subsumption(
% 11.32/11.71 clause( 10, [ theorem( implies( or( X, X ), X ) ) ] )
% 11.32/11.71 , clause( 80787, [ theorem( implies( or( X, X ), X ) ) ] )
% 11.32/11.71 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 resolution(
% 11.32/11.71 clause( 80788, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 11.32/11.71 , clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y
% 11.32/11.71 ) ) ] )
% 11.32/11.71 , 1, clause( 10, [ theorem( implies( or( X, X ), X ) ) ] )
% 11.32/11.71 , 0, substitution( 0, [ :=( X, X ), :=( Y, or( X, X ) )] ), substitution( 1
% 11.32/11.71 , [ :=( X, X )] )).
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 subsumption(
% 11.32/11.71 clause( 14, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 11.32/11.71 , clause( 80788, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 11.32/11.71 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 11.32/11.71 1 )] ) ).
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 resolution(
% 11.32/11.71 clause( 80790, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X )
% 11.32/11.71 ) ) ] )
% 11.32/11.71 , clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y
% 11.32/11.71 ) ) ] )
% 11.32/11.71 , 1, clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 11.32/11.71 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [ :=( X
% 11.32/11.71 , implies( Y, X ) )] )).
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 subsumption(
% 11.32/11.71 clause( 18, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X ) )
% 11.32/11.71 ) ] )
% 11.32/11.71 , clause( 80790, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X
% 11.32/11.71 ) ) ) ] )
% 11.32/11.71 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 11.32/11.71 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 resolution(
% 11.32/11.71 clause( 80792, [ theorem( X ), ~( axiom( implies( Y, X ) ) ), ~( theorem(
% 11.32/11.71 or( Y, Y ) ) ) ] )
% 11.32/11.71 , clause( 18, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X )
% 11.32/11.71 ) ) ] )
% 11.32/11.71 , 1, clause( 14, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 11.32/11.71 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [ :=( X
% 11.32/11.71 , Y )] )).
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 subsumption(
% 11.32/11.71 clause( 57, [ theorem( X ), ~( axiom( implies( Y, X ) ) ), ~( theorem( or(
% 11.32/11.71 Y, Y ) ) ) ] )
% 11.32/11.71 , clause( 80792, [ theorem( X ), ~( axiom( implies( Y, X ) ) ), ~( theorem(
% 11.32/11.71 or( Y, Y ) ) ) ] )
% 11.32/11.71 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 11.32/11.71 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 resolution(
% 11.32/11.71 clause( 80793, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 11.32/11.71 , clause( 18, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X )
% 11.32/11.71 ) ) ] )
% 11.32/11.71 , 2, clause( 2, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 11.32/11.71 , 0, substitution( 0, [ :=( X, or( X, Y ) ), :=( Y, or( Y, X ) )] ),
% 11.32/11.71 substitution( 1, [ :=( X, Y ), :=( Y, X )] )).
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 subsumption(
% 11.32/11.71 clause( 64, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 11.32/11.71 , clause( 80793, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 11.32/11.71 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 11.32/11.71 ), ==>( 1, 1 )] ) ).
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 resolution(
% 11.32/11.71 clause( 80794, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y ) )
% 11.32/11.71 , X ) ) ) ] )
% 11.32/11.71 , clause( 18, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X )
% 11.32/11.71 ) ) ] )
% 11.32/11.71 , 1, clause( 9, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 11.32/11.71 , 0, substitution( 0, [ :=( X, X ), :=( Y, implies( Y, or( Z, Y ) ) )] ),
% 11.32/11.71 substitution( 1, [ :=( X, Y ), :=( Y, Z )] )).
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 subsumption(
% 11.32/11.71 clause( 66, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y ) ), X
% 11.32/11.71 ) ) ) ] )
% 11.32/11.71 , clause( 80794, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y )
% 11.32/11.71 ), X ) ) ) ] )
% 11.32/11.71 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 11.32/11.71 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 resolution(
% 11.32/11.71 clause( 80795, [ theorem( implies( or( X, Y ), or( X, Z ) ) ), ~( theorem(
% 11.32/11.71 implies( Y, Z ) ) ) ] )
% 11.32/11.71 , clause( 18, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X )
% 11.32/11.71 ) ) ] )
% 11.32/11.71 , 2, clause( 4, [ axiom( implies( implies( X, Y ), implies( or( Z, X ), or(
% 11.32/11.71 Z, Y ) ) ) ) ] )
% 11.32/11.71 , 0, substitution( 0, [ :=( X, implies( or( X, Y ), or( X, Z ) ) ), :=( Y,
% 11.32/11.71 implies( Y, Z ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, Z ), :=( Z, X
% 11.32/11.71 )] )).
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 subsumption(
% 11.32/11.71 clause( 70, [ theorem( implies( or( X, Y ), or( X, Z ) ) ), ~( theorem(
% 11.32/11.71 implies( Y, Z ) ) ) ] )
% 11.32/11.71 , clause( 80795, [ theorem( implies( or( X, Y ), or( X, Z ) ) ), ~( theorem(
% 11.32/11.71 implies( Y, Z ) ) ) ] )
% 11.32/11.71 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 11.32/11.71 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 paramod(
% 11.32/11.71 clause( 80798, [ ~( theorem( implies( X, Y ) ) ), theorem( or( Y, not( X )
% 11.32/11.71 ) ) ] )
% 11.32/11.71 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 11.32/11.71 , 0, clause( 64, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 11.32/11.71 , 1, 2, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [
% 11.32/11.71 :=( X, Y ), :=( Y, not( X ) )] )).
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 subsumption(
% 11.32/11.71 clause( 117, [ theorem( or( Y, not( X ) ) ), ~( theorem( implies( X, Y ) )
% 11.32/11.71 ) ] )
% 11.32/11.71 , clause( 80798, [ ~( theorem( implies( X, Y ) ) ), theorem( or( Y, not( X
% 11.32/11.71 ) ) ) ] )
% 11.32/11.71 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 11.32/11.71 ), ==>( 1, 0 )] ) ).
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 paramod(
% 11.32/11.71 clause( 80804, [ axiom( implies( or( not( X ), or( Y, Z ) ), or( Y, implies(
% 11.32/11.71 X, Z ) ) ) ) ] )
% 11.32/11.71 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 11.32/11.71 , 0, clause( 3, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) )
% 11.32/11.71 ) ) ] )
% 11.32/11.71 , 0, 10, substitution( 0, [ :=( X, X ), :=( Y, Z )] ), substitution( 1, [
% 11.32/11.71 :=( X, not( X ) ), :=( Y, Y ), :=( Z, Z )] )).
% 11.32/11.71
% 11.32/11.71
% 11.32/11.71 paramod(
% 11.32/11.71 clause( 80807, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies(
% 11.32/11.71 X, Z ) ) ) ) ] )
% 11.32/11.71 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 11.32/11.71 , 0, clause( 80804, [ axiom( implies( or( not( X ), or( Y, Z ) ), or( Y,
% 11.35/11.71 implies( X, Z ) ) ) ) ] )
% 11.35/11.71 , 0, 2, substitution( 0, [ :=( X, X ), :=( Y, or( Y, Z ) )] ),
% 11.35/11.71 substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 11.35/11.71
% 11.35/11.71
% 11.35/11.71 subsumption(
% 11.35/11.71 clause( 124, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies( X
% 11.35/11.71 , Z ) ) ) ) ] )
% 11.35/11.71 , clause( 80807, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies(
% 11.35/11.71 X, Z ) ) ) ) ] )
% 11.35/11.71 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 11.35/11.71 permutation( 0, [ ==>( 0, 0 )] ) ).
% 11.35/11.71
% 11.35/11.71
% 11.35/11.71 paramod(
% 11.35/11.71 clause( 80812, [ axiom( implies( or( X, or( not( Y ), Z ) ), implies( Y, or(
% 11.35/11.71 X, Z ) ) ) ) ] )
% 11.35/11.71 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 11.35/11.71 , 0, clause( 3, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) )
% 11.35/11.71 ) ) ] )
% 11.35/11.71 , 0, 8, substitution( 0, [ :=( X, Y ), :=( Y, or( X, Z ) )] ),
% 11.35/11.71 substitution( 1, [ :=( X, X ), :=( Y, not( Y ) ), :=( Z, Z )] )).
% 11.35/11.71
% 11.35/11.71
% 11.35/11.71 paramod(
% 11.35/11.71 clause( 80817, [ axiom( implies( or( X, implies( Y, Z ) ), implies( Y, or(
% 11.35/11.71 X, Z ) ) ) ) ] )
% 11.35/11.71 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 11.35/11.71 , 0, clause( 80812, [ axiom( implies( or( X, or( not( Y ), Z ) ), implies(
% 11.35/11.71 Y, or( X, Z ) ) ) ) ] )
% 11.35/11.71 , 0, 4, substitution( 0, [ :=( X, Y ), :=( Y, Z )] ), substitution( 1, [
% 11.35/11.71 :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 11.35/11.71
% 11.35/11.71
% 11.35/11.71 subsumption(
% 11.35/11.71 clause( 125, [ axiom( implies( or( Z, implies( X, Y ) ), implies( X, or( Z
% 11.35/11.71 , Y ) ) ) ) ] )
% 11.35/11.71 , clause( 80817, [ axiom( implies( or( X, implies( Y, Z ) ), implies( Y, or(
% 11.35/11.71 X, Z ) ) ) ) ] )
% 11.35/11.71 , substitution( 0, [ :=( X, Z ), :=( Y, X ), :=( Z, Y )] ),
% 11.35/11.71 permutation( 0, [ ==>( 0, 0 )] ) ).
% 11.35/11.71
% 11.35/11.71
% 11.35/11.71 resolution(
% 11.35/11.71 clause( 80818, [ ~( theorem( X ) ), ~( axiom( implies( X, implies( implies(
% 11.35/11.71 not( p ), q ), or( p, q ) ) ) ) ) ] )
% 11.35/11.71 , clause( 8, [ ~( theorem( implies( implies( not( p ), q ), or( p, q ) ) )
% 11.35/11.71 ) ] )
% 11.35/11.71 , 0, clause( 18, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X
% 11.35/11.71 ) ) ) ] )
% 11.35/11.71 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, implies( implies( not(
% 11.35/11.71 p ), q ), or( p, q ) ) ), :=( Y, X )] )).
% 11.35/11.71
% 11.35/11.71
% 11.35/11.71 subsumption(
% 11.35/11.71 clause( 167, [ ~( theorem( X ) ), ~( axiom( implies( X, implies( implies(
% 11.35/11.71 not( p ), q ), or( p, q ) ) ) ) ) ] )
% 11.35/11.71 , clause( 80818, [ ~( theorem( X ) ), ~( axiom( implies( X, implies(
% 11.35/11.71 implies( not( p ), q ), or( p, q ) ) ) ) ) ] )
% 11.35/11.71 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 11.35/11.71 1 )] ) ).
% 11.35/11.71
% 11.35/11.71
% 11.35/11.71 resolution(
% 11.35/11.71 clause( 80819, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 11.35/11.71 , clause( 66, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y ) ),
% 11.35/11.71 X ) ) ) ] )
% 11.35/11.71 , 1, clause( 124, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y,
% 11.35/11.71 implies( X, Z ) ) ) ) ] )
% 11.35/11.71 , 0, substitution( 0, [ :=( X, or( X, implies( Y, Y ) ) ), :=( Y, Y ), :=(
% 11.35/11.71 Z, X )] ), substitution( 1, [ :=( X, Y ), :=( Y, X ), :=( Z, Y )] )).
% 11.35/11.71
% 11.35/11.71
% 11.35/11.71 subsumption(
% 11.35/11.71 clause( 15593, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 11.35/11.71 , clause( 80819, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 11.35/11.71 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 11.35/11.71 )] ) ).
% 11.35/11.71
% 11.35/11.71
% 11.35/11.71 resolution(
% 11.35/11.71 clause( 80820, [ theorem( X ), ~( axiom( implies( implies( Y, Y ), X ) ) )
% 11.35/11.71 ] )
% 11.35/11.71 , clause( 57, [ theorem( X ), ~( axiom( implies( Y, X ) ) ), ~( theorem( or(
% 11.35/11.71 Y, Y ) ) ) ] )
% 11.35/11.71 , 2, clause( 15593, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 11.35/11.71 , 0, substitution( 0, [ :=( X, X ), :=( Y, implies( Y, Y ) )] ),
% 11.35/11.71 substitution( 1, [ :=( X, implies( Y, Y ) ), :=( Y, Y )] )).
% 11.35/11.71
% 11.35/11.71
% 11.35/11.71 subsumption(
% 11.35/11.71 clause( 15655, [ theorem( X ), ~( axiom( implies( implies( Y, Y ), X ) ) )
% 11.35/11.71 ] )
% 11.35/11.71 , clause( 80820, [ theorem( X ), ~( axiom( implies( implies( Y, Y ), X ) )
% 11.35/11.71 ) ] )
% 11.35/11.71 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 11.35/11.71 ), ==>( 1, 1 )] ) ).
% 11.35/11.71
% 11.35/11.71
% 11.35/11.71 resolution(
% 11.35/11.71 clause( 80821, [ theorem( implies( X, X ) ) ] )
% 11.35/11.71 , clause( 14, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 11.35/11.71 , 1, clause( 15593, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 11.35/11.71 , 0, substitution( 0, [ :=( X, implies( X, X ) )] ), substitution( 1, [
% 11.35/11.71 :=( X, implies( X, X ) ), :=( Y, X )] )).
% 11.35/11.71
% 11.35/11.71
% 11.35/11.71 subsumption(
% 11.35/11.71 clause( 15720, [ theorem( implies( X, X ) ) ] )
% 11.35/11.71 , clause( 80821, [ theorem( implies( X, X ) ) ] )
% 11.35/11.71 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 11.35/11.71
% 11.35/11.71
% 11.35/11.71 resolution(
% 11.35/11.71 clause( 80822, [ theorem( or( X, not( X ) ) ) ] )
% 11.35/11.71 , clause( 117, [ theorem( or( Y, not( X ) ) ), ~( theorem( implies( X, Y )
% 11.35/11.71 ) ) ] )
% 11.35/11.71 , 1, clause( 15720, [ theorem( implies( X, X ) ) ] )
% 11.35/11.71 , 0, substitution( 0, [ :=( X, X ), :=( Y, X )] ), substitution( 1, [ :=( X
% 11.35/11.71 , X )] )).
% 11.35/11.71
% 11.35/11.71
% 11.35/11.71 subsumption(
% 11.35/11.71 clause( 15723, [ theorem( or( X, not( X ) ) ) ] )
% 11.35/11.71 , clause( 80822, [ theorem( or( X, not( X ) ) ) ] )
% 11.35/11.71 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 11.35/11.71
% 11.35/11.71
% 11.35/11.71 resolution(
% 11.35/11.71 clause( 80823, [ theorem( X ), ~( theorem( implies( or( Y, not( Y ) ), X )
% 11.35/11.71 ) ) ] )
% 11.35/11.71 , clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y
% 11.35/11.71 ) ) ] )
% 11.35/11.71 , 2, clause( 15723, [ theorem( or( X, not( X ) ) ) ] )
% 11.35/11.71 , 0, substitution( 0, [ :=( X, X ), :=( Y, or( Y, not( Y ) ) )] ),
% 11.35/11.71 substitution( 1, [ :=( X, Y )] )).
% 11.35/11.71
% 11.35/11.71
% 11.35/11.71 subsumption(
% 11.35/11.71 clause( 16016, [ theorem( X ), ~( theorem( implies( or( Y, not( Y ) ), X )
% 11.35/11.71 ) ) ] )
% 11.35/11.71 , clause( 80823, [ theorem( X ), ~( theorem( implies( or( Y, not( Y ) ), X
% 11.35/11.71 ) ) ) ] )
% 11.35/11.71 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 11.35/11.71 ), ==>( 1, 1 )] ) ).
% 11.35/11.71
% 11.35/11.71
% 11.35/11.71 resolution(
% 11.35/11.71 clause( 80824, [ ~( theorem( or( p, implies( implies( not( p ), q ), q ) )
% 11.35/11.71 ) ) ] )
% 11.35/11.71 , clause( 167, [ ~( theorem( X ) ), ~( axiom( implies( X, implies( implies(
% 11.35/11.71 not( p ), q ), or( p, q ) ) ) ) ) ] )
% 11.35/11.71 , 1, clause( 125, [ axiom( implies( or( Z, implies( X, Y ) ), implies( X,
% 11.35/11.71 or( Z, Y ) ) ) ) ] )
% 11.35/11.71 , 0, substitution( 0, [ :=( X, or( p, implies( implies( not( p ), q ), q )
% 11.35/11.71 ) )] ), substitution( 1, [ :=( X, implies( not( p ), q ) ), :=( Y, q ),
% 11.35/11.71 :=( Z, p )] )).
% 11.35/11.71
% 11.35/11.71
% 11.35/11.71 subsumption(
% 11.35/11.71 clause( 21618, [ ~( theorem( or( p, implies( implies( not( p ), q ), q ) )
% 11.35/11.71 ) ) ] )
% 11.35/11.71 , clause( 80824, [ ~( theorem( or( p, implies( implies( not( p ), q ), q )
% 11.35/11.71 ) ) ) ] )
% 11.35/11.71 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 11.35/11.71
% 11.35/11.71
% 11.35/11.71 resolution(
% 11.35/11.71 clause( 80825, [ theorem( or( X, implies( or( X, Y ), Y ) ) ) ] )
% 11.35/11.71 , clause( 15655, [ theorem( X ), ~( axiom( implies( implies( Y, Y ), X ) )
% 11.35/11.71 ) ] )
% 11.35/11.71 , 1, clause( 124, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y,
% 11.35/11.71 implies( X, Z ) ) ) ) ] )
% 11.35/11.71 , 0, substitution( 0, [ :=( X, or( X, implies( or( X, Y ), Y ) ) ), :=( Y,
% 11.35/11.71 or( X, Y ) )] ), substitution( 1, [ :=( X, or( X, Y ) ), :=( Y, X ), :=(
% 11.35/11.71 Z, Y )] )).
% 11.35/11.71
% 11.35/11.71
% 11.35/11.71 subsumption(
% 11.35/11.71 clause( 23134, [ theorem( or( X, implies( or( X, Y ), Y ) ) ) ] )
% 11.35/11.71 , clause( 80825, [ theorem( or( X, implies( or( X, Y ), Y ) ) ) ] )
% 11.35/11.71 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 11.35/11.71 )] ) ).
% 11.35/11.71
% 11.35/11.71
% 11.35/11.71 paramod(
% 11.35/11.71 clause( 80829, [ theorem( or( not( X ), implies( implies( X, Y ), Y ) ) ) ]
% 11.35/11.71 )
% 11.35/11.71 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 11.35/11.71 , 0, clause( 23134, [ theorem( or( X, implies( or( X, Y ), Y ) ) ) ] )
% 11.35/11.71 , 0, 5, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [
% 11.35/11.71 :=( X, not( X ) ), :=( Y, Y )] )).
% 11.35/11.71
% 11.35/11.71
% 11.35/11.71 paramod(
% 11.35/11.71 clause( 80831, [ theorem( implies( X, implies( implies( X, Y ), Y ) ) ) ]
% 11.35/11.71 )
% 11.35/11.71 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 11.35/11.71 , 0, clause( 80829, [ theorem( or( not( X ), implies( implies( X, Y ), Y )
% 11.35/11.71 ) ) ] )
% 11.35/11.71 , 0, 1, substitution( 0, [ :=( X, X ), :=( Y, implies( implies( X, Y ), Y )
% 11.35/11.71 )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 11.35/11.71
% 11.35/11.71
% 11.35/11.71 subsumption(
% 11.35/11.71 clause( 25202, [ theorem( implies( X, implies( implies( X, Y ), Y ) ) ) ]
% 11.35/11.71 )
% 11.35/11.71 , clause( 80831, [ theorem( implies( X, implies( implies( X, Y ), Y ) ) ) ]
% 11.35/11.71 )
% 11.35/11.71 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 11.35/11.71 )] ) ).
% 11.35/11.71
% 11.35/11.71
% 11.35/11.71 resolution(
% 11.35/11.71 clause( 80832, [ theorem( or( X, Y ) ), ~( theorem( implies( not( X ), Y )
% 11.35/11.71 ) ) ] )
% 11.35/11.71 , clause( 16016, [ theorem( X ), ~( theorem( implies( or( Y, not( Y ) ), X
% 11.35/11.71 ) ) ) ] )
% 11.35/11.71 , 1, clause( 70, [ theorem( implies( or( X, Y ), or( X, Z ) ) ), ~( theorem(
% 11.35/11.71 implies( Y, Z ) ) ) ] )
% 11.35/11.71 , 0, substitution( 0, [ :=( X, or( X, Y ) ), :=( Y, X )] ), substitution( 1
% 11.35/11.71 , [ :=( X, X ), :=( Y, not( X ) ), :=( Z, Y )] )).
% 11.35/11.71
% 11.35/11.71
% 11.35/11.71 subsumption(
% 11.35/11.71 clause( 72189, [ theorem( or( X, Y ) ), ~( theorem( implies( not( X ), Y )
% 11.35/11.71 ) ) ] )
% 11.35/11.71 , clause( 80832, [ theorem( or( X, Y ) ), ~( theorem( implies( not( X ), Y
% 11.35/11.71 ) ) ) ] )
% 11.35/11.71 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 11.35/11.71 ), ==>( 1, 1 )] ) ).
% 11.35/11.71
% 11.35/11.71
% 11.35/11.71 resolution(
% 11.35/11.71 clause( 80833, [ theorem( or( X, implies( implies( not( X ), Y ), Y ) ) ) ]
% 11.35/11.71 )
% 11.35/11.71 , clause( 72189, [ theorem( or( X, Y ) ), ~( theorem( implies( not( X ), Y
% 11.35/11.71 ) ) ) ] )
% 11.35/11.71 , 1, clause( 25202, [ theorem( implies( X, implies( implies( X, Y ), Y ) )
% 11.35/11.71 ) ] )
% 11.35/11.71 , 0, substitution( 0, [ :=( X, X ), :=( Y, implies( implies( not( X ), Y )
% 11.35/11.71 , Y ) )] ), substitution( 1, [ :=( X, not( X ) ), :=( Y, Y )] )).
% 11.35/11.71
% 11.35/11.71
% 11.35/11.71 subsumption(
% 11.35/11.71 clause( 72522, [ theorem( or( X, implies( implies( not( X ), Y ), Y ) ) ) ]
% 11.35/11.71 )
% 11.35/11.71 , clause( 80833, [ theorem( or( X, implies( implies( not( X ), Y ), Y ) ) )
% 11.35/11.71 ] )
% 11.35/11.71 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 11.35/11.71 )] ) ).
% 11.35/11.71
% 11.35/11.71
% 11.35/11.71 resolution(
% 11.35/11.71 clause( 80834, [] )
% 11.35/11.71 , clause( 21618, [ ~( theorem( or( p, implies( implies( not( p ), q ), q )
% 11.35/11.71 ) ) ) ] )
% 11.35/11.71 , 0, clause( 72522, [ theorem( or( X, implies( implies( not( X ), Y ), Y )
% 11.35/11.71 ) ) ] )
% 11.35/11.71 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, p ), :=( Y, q )] )
% 11.35/11.71 ).
% 11.35/11.71
% 11.35/11.71
% 11.35/11.71 subsumption(
% 11.35/11.71 clause( 80771, [] )
% 11.35/11.71 , clause( 80834, [] )
% 11.35/11.71 , substitution( 0, [] ), permutation( 0, [] ) ).
% 11.35/11.71
% 11.35/11.71
% 11.35/11.71 end.
% 11.35/11.71
% 11.35/11.71 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 11.35/11.71
% 11.35/11.71 Memory use:
% 11.35/11.71
% 11.35/11.71 space for terms: 1221462
% 11.35/11.71 space for clauses: 3792611
% 11.35/11.71
% 11.35/11.71
% 11.35/11.71 clauses generated: 272040
% 11.35/11.71 clauses kept: 80772
% 11.35/11.71 clauses selected: 1332
% 11.35/11.71 clauses deleted: 164
% 11.35/11.71 clauses inuse deleted: 0
% 11.35/11.71
% 11.35/11.71 subsentry: 5713674
% 11.35/11.71 literals s-matched: 2121320
% 11.35/11.71 literals matched: 1934361
% 11.35/11.71 full subsumption: 858108
% 11.35/11.71
% 11.35/11.71 checksum: 852333053
% 11.35/11.71
% 11.35/11.71
% 11.35/11.71 Bliksem ended
%------------------------------------------------------------------------------