TSTP Solution File: LCL258-3 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL258-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n028.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 0s
% DateTime : Sun Jul 17 07:52:19 EDT 2022
% Result : Unsatisfiable 1.92s 2.31s
% Output : Refutation 1.92s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL258-3 : TPTP v8.1.0. Released v2.3.0.
% 0.07/0.13 % Command : bliksem %s
% 0.12/0.34 % Computer : n028.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % DateTime : Mon Jul 4 08:26:34 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.92/2.31 *** allocated 10000 integers for termspace/termends
% 1.92/2.31 *** allocated 10000 integers for clauses
% 1.92/2.31 *** allocated 10000 integers for justifications
% 1.92/2.31 Bliksem 1.12
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 Automatic Strategy Selection
% 1.92/2.31
% 1.92/2.31 Clauses:
% 1.92/2.31 [
% 1.92/2.31 [ axiom( implies( or( X, X ), X ) ) ],
% 1.92/2.31 [ axiom( implies( X, or( Y, X ) ) ) ],
% 1.92/2.31 [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ],
% 1.92/2.31 [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) ) ) ) ],
% 1.92/2.31 [ axiom( implies( implies( X, Y ), implies( or( Z, X ), or( Z, Y ) ) ) )
% 1.92/2.31 ],
% 1.92/2.31 [ =( implies( X, Y ), or( not( X ), Y ) ) ],
% 1.92/2.31 [ theorem( X ), ~( axiom( X ) ) ],
% 1.92/2.31 [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y ) ) ]
% 1.92/2.31 ,
% 1.92/2.31 [ ~( theorem( implies( p, implies( implies( p, q ), q ) ) ) ) ]
% 1.92/2.31 ] .
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 percentage equality = 0.083333, percentage horn = 1.000000
% 1.92/2.31 This is a problem with some equality
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 Options Used:
% 1.92/2.31
% 1.92/2.31 useres = 1
% 1.92/2.31 useparamod = 1
% 1.92/2.31 useeqrefl = 1
% 1.92/2.31 useeqfact = 1
% 1.92/2.31 usefactor = 1
% 1.92/2.31 usesimpsplitting = 0
% 1.92/2.31 usesimpdemod = 5
% 1.92/2.31 usesimpres = 3
% 1.92/2.31
% 1.92/2.31 resimpinuse = 1000
% 1.92/2.31 resimpclauses = 20000
% 1.92/2.31 substype = eqrewr
% 1.92/2.31 backwardsubs = 1
% 1.92/2.31 selectoldest = 5
% 1.92/2.31
% 1.92/2.31 litorderings [0] = split
% 1.92/2.31 litorderings [1] = extend the termordering, first sorting on arguments
% 1.92/2.31
% 1.92/2.31 termordering = kbo
% 1.92/2.31
% 1.92/2.31 litapriori = 0
% 1.92/2.31 termapriori = 1
% 1.92/2.31 litaposteriori = 0
% 1.92/2.31 termaposteriori = 0
% 1.92/2.31 demodaposteriori = 0
% 1.92/2.31 ordereqreflfact = 0
% 1.92/2.31
% 1.92/2.31 litselect = negord
% 1.92/2.31
% 1.92/2.31 maxweight = 15
% 1.92/2.31 maxdepth = 30000
% 1.92/2.31 maxlength = 115
% 1.92/2.31 maxnrvars = 195
% 1.92/2.31 excuselevel = 1
% 1.92/2.31 increasemaxweight = 1
% 1.92/2.31
% 1.92/2.31 maxselected = 10000000
% 1.92/2.31 maxnrclauses = 10000000
% 1.92/2.31
% 1.92/2.31 showgenerated = 0
% 1.92/2.31 showkept = 0
% 1.92/2.31 showselected = 0
% 1.92/2.31 showdeleted = 0
% 1.92/2.31 showresimp = 1
% 1.92/2.31 showstatus = 2000
% 1.92/2.31
% 1.92/2.31 prologoutput = 1
% 1.92/2.31 nrgoals = 5000000
% 1.92/2.31 totalproof = 1
% 1.92/2.31
% 1.92/2.31 Symbols occurring in the translation:
% 1.92/2.31
% 1.92/2.31 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 1.92/2.31 . [1, 2] (w:1, o:24, a:1, s:1, b:0),
% 1.92/2.31 ! [4, 1] (w:0, o:16, a:1, s:1, b:0),
% 1.92/2.31 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.92/2.31 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.92/2.31 or [40, 2] (w:1, o:49, a:1, s:1, b:0),
% 1.92/2.31 implies [41, 2] (w:1, o:50, a:1, s:1, b:0),
% 1.92/2.31 axiom [42, 1] (w:1, o:21, a:1, s:1, b:0),
% 1.92/2.31 not [47, 1] (w:1, o:22, a:1, s:1, b:0),
% 1.92/2.31 theorem [48, 1] (w:1, o:23, a:1, s:1, b:0),
% 1.92/2.31 p [49, 0] (w:1, o:14, a:1, s:1, b:0),
% 1.92/2.31 q [50, 0] (w:1, o:15, a:1, s:1, b:0).
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 Starting Search:
% 1.92/2.31
% 1.92/2.31 Resimplifying inuse:
% 1.92/2.31 Done
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 Intermediate Status:
% 1.92/2.31 Generated: 3566
% 1.92/2.31 Kept: 2009
% 1.92/2.31 Inuse: 114
% 1.92/2.31 Deleted: 0
% 1.92/2.31 Deletedinuse: 0
% 1.92/2.31
% 1.92/2.31 Resimplifying inuse:
% 1.92/2.31 Done
% 1.92/2.31
% 1.92/2.31 Resimplifying inuse:
% 1.92/2.31 Done
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 Intermediate Status:
% 1.92/2.31 Generated: 8501
% 1.92/2.31 Kept: 4041
% 1.92/2.31 Inuse: 186
% 1.92/2.31 Deleted: 0
% 1.92/2.31 Deletedinuse: 0
% 1.92/2.31
% 1.92/2.31 Resimplifying inuse:
% 1.92/2.31 Done
% 1.92/2.31
% 1.92/2.31 Resimplifying inuse:
% 1.92/2.31 Done
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 Intermediate Status:
% 1.92/2.31 Generated: 12766
% 1.92/2.31 Kept: 6060
% 1.92/2.31 Inuse: 231
% 1.92/2.31 Deleted: 1
% 1.92/2.31 Deletedinuse: 0
% 1.92/2.31
% 1.92/2.31 Resimplifying inuse:
% 1.92/2.31 Done
% 1.92/2.31
% 1.92/2.31 Resimplifying inuse:
% 1.92/2.31 Done
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 Intermediate Status:
% 1.92/2.31 Generated: 17377
% 1.92/2.31 Kept: 8122
% 1.92/2.31 Inuse: 266
% 1.92/2.31 Deleted: 1
% 1.92/2.31 Deletedinuse: 0
% 1.92/2.31
% 1.92/2.31 Resimplifying inuse:
% 1.92/2.31 Done
% 1.92/2.31
% 1.92/2.31 Resimplifying inuse:
% 1.92/2.31 Done
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 Intermediate Status:
% 1.92/2.31 Generated: 23448
% 1.92/2.31 Kept: 10131
% 1.92/2.31 Inuse: 324
% 1.92/2.31 Deleted: 1
% 1.92/2.31 Deletedinuse: 0
% 1.92/2.31
% 1.92/2.31 Resimplifying inuse:
% 1.92/2.31 Done
% 1.92/2.31
% 1.92/2.31 Resimplifying inuse:
% 1.92/2.31 Done
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 Intermediate Status:
% 1.92/2.31 Generated: 28377
% 1.92/2.31 Kept: 12217
% 1.92/2.31 Inuse: 360
% 1.92/2.31 Deleted: 1
% 1.92/2.31 Deletedinuse: 0
% 1.92/2.31
% 1.92/2.31 Resimplifying inuse:
% 1.92/2.31 Done
% 1.92/2.31
% 1.92/2.31 Resimplifying inuse:
% 1.92/2.31 Done
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 Intermediate Status:
% 1.92/2.31 Generated: 33881
% 1.92/2.31 Kept: 14230
% 1.92/2.31 Inuse: 398
% 1.92/2.31 Deleted: 1
% 1.92/2.31 Deletedinuse: 0
% 1.92/2.31
% 1.92/2.31 Resimplifying inuse:
% 1.92/2.31 Done
% 1.92/2.31
% 1.92/2.31 Resimplifying inuse:
% 1.92/2.31 Done
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 Intermediate Status:
% 1.92/2.31 Generated: 38000
% 1.92/2.31 Kept: 16469
% 1.92/2.31 Inuse: 413
% 1.92/2.31 Deleted: 1
% 1.92/2.31 Deletedinuse: 0
% 1.92/2.31
% 1.92/2.31 Resimplifying inuse:
% 1.92/2.31 Done
% 1.92/2.31
% 1.92/2.31 Resimplifying inuse:
% 1.92/2.31 Done
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 Intermediate Status:
% 1.92/2.31 Generated: 43172
% 1.92/2.31 Kept: 18581
% 1.92/2.31 Inuse: 446
% 1.92/2.31 Deleted: 1
% 1.92/2.31 Deletedinuse: 0
% 1.92/2.31
% 1.92/2.31 Resimplifying inuse:
% 1.92/2.31 Done
% 1.92/2.31
% 1.92/2.31 Resimplifying inuse:
% 1.92/2.31 Done
% 1.92/2.31
% 1.92/2.31 Resimplifying clauses:
% 1.92/2.31 Done
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 Intermediate Status:
% 1.92/2.31 Generated: 46685
% 1.92/2.31 Kept: 20733
% 1.92/2.31 Inuse: 476
% 1.92/2.31 Deleted: 61
% 1.92/2.31 Deletedinuse: 0
% 1.92/2.31
% 1.92/2.31 Resimplifying inuse:
% 1.92/2.31 Done
% 1.92/2.31
% 1.92/2.31 Resimplifying inuse:
% 1.92/2.31 Done
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 Intermediate Status:
% 1.92/2.31 Generated: 50388
% 1.92/2.31 Kept: 22767
% 1.92/2.31 Inuse: 504
% 1.92/2.31 Deleted: 61
% 1.92/2.31 Deletedinuse: 0
% 1.92/2.31
% 1.92/2.31 Resimplifying inuse:
% 1.92/2.31 Done
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 Intermediate Status:
% 1.92/2.31 Generated: 54378
% 1.92/2.31 Kept: 24894
% 1.92/2.31 Inuse: 528
% 1.92/2.31 Deleted: 61
% 1.92/2.31 Deletedinuse: 0
% 1.92/2.31
% 1.92/2.31 Resimplifying inuse:
% 1.92/2.31 Done
% 1.92/2.31
% 1.92/2.31 Resimplifying inuse:
% 1.92/2.31 Done
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 Intermediate Status:
% 1.92/2.31 Generated: 57914
% 1.92/2.31 Kept: 26899
% 1.92/2.31 Inuse: 543
% 1.92/2.31 Deleted: 61
% 1.92/2.31 Deletedinuse: 0
% 1.92/2.31
% 1.92/2.31 Resimplifying inuse:
% 1.92/2.31 Done
% 1.92/2.31
% 1.92/2.31 Resimplifying inuse:
% 1.92/2.31
% 1.92/2.31 Bliksems!, er is een bewijs:
% 1.92/2.31 % SZS status Unsatisfiable
% 1.92/2.31 % SZS output start Refutation
% 1.92/2.31
% 1.92/2.31 clause( 0, [ axiom( implies( or( X, X ), X ) ) ] )
% 1.92/2.31 .
% 1.92/2.31 clause( 1, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 1.92/2.31 .
% 1.92/2.31 clause( 3, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) ) ) ) ]
% 1.92/2.31 )
% 1.92/2.31 .
% 1.92/2.31 clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.92/2.31 .
% 1.92/2.31 clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.92/2.31 .
% 1.92/2.31 clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y )
% 1.92/2.31 ) ] )
% 1.92/2.31 .
% 1.92/2.31 clause( 8, [ ~( theorem( implies( p, implies( implies( p, q ), q ) ) ) ) ]
% 1.92/2.31 )
% 1.92/2.31 .
% 1.92/2.31 clause( 9, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 1.92/2.31 .
% 1.92/2.31 clause( 10, [ theorem( implies( or( X, X ), X ) ) ] )
% 1.92/2.31 .
% 1.92/2.31 clause( 14, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 1.92/2.31 .
% 1.92/2.31 clause( 18, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X ) )
% 1.92/2.31 ) ] )
% 1.92/2.31 .
% 1.92/2.31 clause( 57, [ theorem( X ), ~( axiom( implies( Y, X ) ) ), ~( theorem( or(
% 1.92/2.31 Y, Y ) ) ) ] )
% 1.92/2.31 .
% 1.92/2.31 clause( 66, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y ) ), X
% 1.92/2.31 ) ) ) ] )
% 1.92/2.31 .
% 1.92/2.31 clause( 124, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies( X
% 1.92/2.31 , Z ) ) ) ) ] )
% 1.92/2.31 .
% 1.92/2.31 clause( 18430, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 1.92/2.31 .
% 1.92/2.31 clause( 18525, [ theorem( X ), ~( axiom( implies( implies( Y, Y ), X ) ) )
% 1.92/2.31 ] )
% 1.92/2.31 .
% 1.92/2.31 clause( 24596, [ theorem( or( X, implies( or( X, Y ), Y ) ) ) ] )
% 1.92/2.31 .
% 1.92/2.31 clause( 27305, [ theorem( implies( X, implies( implies( X, Y ), Y ) ) ) ]
% 1.92/2.31 )
% 1.92/2.31 .
% 1.92/2.31 clause( 28024, [] )
% 1.92/2.31 .
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 % SZS output end Refutation
% 1.92/2.31 found a proof!
% 1.92/2.31
% 1.92/2.31 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 1.92/2.31
% 1.92/2.31 initialclauses(
% 1.92/2.31 [ clause( 28026, [ axiom( implies( or( X, X ), X ) ) ] )
% 1.92/2.31 , clause( 28027, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 1.92/2.31 , clause( 28028, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 1.92/2.31 , clause( 28029, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) )
% 1.92/2.31 ) ) ] )
% 1.92/2.31 , clause( 28030, [ axiom( implies( implies( X, Y ), implies( or( Z, X ), or(
% 1.92/2.31 Z, Y ) ) ) ) ] )
% 1.92/2.31 , clause( 28031, [ =( implies( X, Y ), or( not( X ), Y ) ) ] )
% 1.92/2.31 , clause( 28032, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.92/2.31 , clause( 28033, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~(
% 1.92/2.31 theorem( Y ) ) ] )
% 1.92/2.31 , clause( 28034, [ ~( theorem( implies( p, implies( implies( p, q ), q ) )
% 1.92/2.31 ) ) ] )
% 1.92/2.31 ] ).
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 subsumption(
% 1.92/2.31 clause( 0, [ axiom( implies( or( X, X ), X ) ) ] )
% 1.92/2.31 , clause( 28026, [ axiom( implies( or( X, X ), X ) ) ] )
% 1.92/2.31 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 subsumption(
% 1.92/2.31 clause( 1, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 1.92/2.31 , clause( 28027, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 1.92/2.31 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.92/2.31 )] ) ).
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 subsumption(
% 1.92/2.31 clause( 3, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) ) ) ) ]
% 1.92/2.31 )
% 1.92/2.31 , clause( 28029, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) )
% 1.92/2.31 ) ) ] )
% 1.92/2.31 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 1.92/2.31 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 eqswap(
% 1.92/2.31 clause( 28035, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.92/2.31 , clause( 28031, [ =( implies( X, Y ), or( not( X ), Y ) ) ] )
% 1.92/2.31 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 subsumption(
% 1.92/2.31 clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.92/2.31 , clause( 28035, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.92/2.31 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.92/2.31 )] ) ).
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 subsumption(
% 1.92/2.31 clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.92/2.31 , clause( 28032, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.92/2.31 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 1.92/2.31 1 )] ) ).
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 subsumption(
% 1.92/2.31 clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y )
% 1.92/2.31 ) ] )
% 1.92/2.31 , clause( 28033, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~(
% 1.92/2.31 theorem( Y ) ) ] )
% 1.92/2.31 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.92/2.31 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 subsumption(
% 1.92/2.31 clause( 8, [ ~( theorem( implies( p, implies( implies( p, q ), q ) ) ) ) ]
% 1.92/2.31 )
% 1.92/2.31 , clause( 28034, [ ~( theorem( implies( p, implies( implies( p, q ), q ) )
% 1.92/2.31 ) ) ] )
% 1.92/2.31 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 resolution(
% 1.92/2.31 clause( 28039, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 1.92/2.31 , clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.92/2.31 , 1, clause( 1, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 1.92/2.31 , 0, substitution( 0, [ :=( X, implies( X, or( Y, X ) ) )] ),
% 1.92/2.31 substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 subsumption(
% 1.92/2.31 clause( 9, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 1.92/2.31 , clause( 28039, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 1.92/2.31 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.92/2.31 )] ) ).
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 resolution(
% 1.92/2.31 clause( 28040, [ theorem( implies( or( X, X ), X ) ) ] )
% 1.92/2.31 , clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.92/2.31 , 1, clause( 0, [ axiom( implies( or( X, X ), X ) ) ] )
% 1.92/2.31 , 0, substitution( 0, [ :=( X, implies( or( X, X ), X ) )] ),
% 1.92/2.31 substitution( 1, [ :=( X, X )] )).
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 subsumption(
% 1.92/2.31 clause( 10, [ theorem( implies( or( X, X ), X ) ) ] )
% 1.92/2.31 , clause( 28040, [ theorem( implies( or( X, X ), X ) ) ] )
% 1.92/2.31 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 resolution(
% 1.92/2.31 clause( 28041, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 1.92/2.31 , clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y
% 1.92/2.31 ) ) ] )
% 1.92/2.31 , 1, clause( 10, [ theorem( implies( or( X, X ), X ) ) ] )
% 1.92/2.31 , 0, substitution( 0, [ :=( X, X ), :=( Y, or( X, X ) )] ), substitution( 1
% 1.92/2.31 , [ :=( X, X )] )).
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 subsumption(
% 1.92/2.31 clause( 14, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 1.92/2.31 , clause( 28041, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 1.92/2.31 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 1.92/2.31 1 )] ) ).
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 resolution(
% 1.92/2.31 clause( 28043, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X )
% 1.92/2.31 ) ) ] )
% 1.92/2.31 , clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y
% 1.92/2.31 ) ) ] )
% 1.92/2.31 , 1, clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.92/2.31 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [ :=( X
% 1.92/2.31 , implies( Y, X ) )] )).
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 subsumption(
% 1.92/2.31 clause( 18, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X ) )
% 1.92/2.31 ) ] )
% 1.92/2.31 , clause( 28043, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X
% 1.92/2.31 ) ) ) ] )
% 1.92/2.31 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.92/2.31 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 resolution(
% 1.92/2.31 clause( 28045, [ theorem( X ), ~( axiom( implies( Y, X ) ) ), ~( theorem(
% 1.92/2.31 or( Y, Y ) ) ) ] )
% 1.92/2.31 , clause( 18, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X )
% 1.92/2.31 ) ) ] )
% 1.92/2.31 , 1, clause( 14, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 1.92/2.31 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [ :=( X
% 1.92/2.31 , Y )] )).
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 subsumption(
% 1.92/2.31 clause( 57, [ theorem( X ), ~( axiom( implies( Y, X ) ) ), ~( theorem( or(
% 1.92/2.31 Y, Y ) ) ) ] )
% 1.92/2.31 , clause( 28045, [ theorem( X ), ~( axiom( implies( Y, X ) ) ), ~( theorem(
% 1.92/2.31 or( Y, Y ) ) ) ] )
% 1.92/2.31 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.92/2.31 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 resolution(
% 1.92/2.31 clause( 28046, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y ) )
% 1.92/2.31 , X ) ) ) ] )
% 1.92/2.31 , clause( 18, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X )
% 1.92/2.31 ) ) ] )
% 1.92/2.31 , 1, clause( 9, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 1.92/2.31 , 0, substitution( 0, [ :=( X, X ), :=( Y, implies( Y, or( Z, Y ) ) )] ),
% 1.92/2.31 substitution( 1, [ :=( X, Y ), :=( Y, Z )] )).
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 subsumption(
% 1.92/2.31 clause( 66, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y ) ), X
% 1.92/2.31 ) ) ) ] )
% 1.92/2.31 , clause( 28046, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y )
% 1.92/2.31 ), X ) ) ) ] )
% 1.92/2.31 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 1.92/2.31 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 paramod(
% 1.92/2.31 clause( 28052, [ axiom( implies( or( not( X ), or( Y, Z ) ), or( Y, implies(
% 1.92/2.31 X, Z ) ) ) ) ] )
% 1.92/2.31 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.92/2.31 , 0, clause( 3, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) )
% 1.92/2.31 ) ) ] )
% 1.92/2.31 , 0, 10, substitution( 0, [ :=( X, X ), :=( Y, Z )] ), substitution( 1, [
% 1.92/2.31 :=( X, not( X ) ), :=( Y, Y ), :=( Z, Z )] )).
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 paramod(
% 1.92/2.31 clause( 28055, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies(
% 1.92/2.31 X, Z ) ) ) ) ] )
% 1.92/2.31 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.92/2.31 , 0, clause( 28052, [ axiom( implies( or( not( X ), or( Y, Z ) ), or( Y,
% 1.92/2.31 implies( X, Z ) ) ) ) ] )
% 1.92/2.31 , 0, 2, substitution( 0, [ :=( X, X ), :=( Y, or( Y, Z ) )] ),
% 1.92/2.31 substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 subsumption(
% 1.92/2.31 clause( 124, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies( X
% 1.92/2.31 , Z ) ) ) ) ] )
% 1.92/2.31 , clause( 28055, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies(
% 1.92/2.31 X, Z ) ) ) ) ] )
% 1.92/2.31 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 1.92/2.31 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 resolution(
% 1.92/2.31 clause( 28056, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 1.92/2.31 , clause( 66, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y ) ),
% 1.92/2.31 X ) ) ) ] )
% 1.92/2.31 , 1, clause( 124, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y,
% 1.92/2.31 implies( X, Z ) ) ) ) ] )
% 1.92/2.31 , 0, substitution( 0, [ :=( X, or( X, implies( Y, Y ) ) ), :=( Y, Y ), :=(
% 1.92/2.31 Z, X )] ), substitution( 1, [ :=( X, Y ), :=( Y, X ), :=( Z, Y )] )).
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 subsumption(
% 1.92/2.31 clause( 18430, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 1.92/2.31 , clause( 28056, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 1.92/2.31 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.92/2.31 )] ) ).
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 resolution(
% 1.92/2.31 clause( 28057, [ theorem( X ), ~( axiom( implies( implies( Y, Y ), X ) ) )
% 1.92/2.31 ] )
% 1.92/2.31 , clause( 57, [ theorem( X ), ~( axiom( implies( Y, X ) ) ), ~( theorem( or(
% 1.92/2.31 Y, Y ) ) ) ] )
% 1.92/2.31 , 2, clause( 18430, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 1.92/2.31 , 0, substitution( 0, [ :=( X, X ), :=( Y, implies( Y, Y ) )] ),
% 1.92/2.31 substitution( 1, [ :=( X, implies( Y, Y ) ), :=( Y, Y )] )).
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 subsumption(
% 1.92/2.31 clause( 18525, [ theorem( X ), ~( axiom( implies( implies( Y, Y ), X ) ) )
% 1.92/2.31 ] )
% 1.92/2.31 , clause( 28057, [ theorem( X ), ~( axiom( implies( implies( Y, Y ), X ) )
% 1.92/2.31 ) ] )
% 1.92/2.31 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.92/2.31 ), ==>( 1, 1 )] ) ).
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 resolution(
% 1.92/2.31 clause( 28058, [ theorem( or( X, implies( or( X, Y ), Y ) ) ) ] )
% 1.92/2.31 , clause( 18525, [ theorem( X ), ~( axiom( implies( implies( Y, Y ), X ) )
% 1.92/2.31 ) ] )
% 1.92/2.31 , 1, clause( 124, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y,
% 1.92/2.31 implies( X, Z ) ) ) ) ] )
% 1.92/2.31 , 0, substitution( 0, [ :=( X, or( X, implies( or( X, Y ), Y ) ) ), :=( Y,
% 1.92/2.31 or( X, Y ) )] ), substitution( 1, [ :=( X, or( X, Y ) ), :=( Y, X ), :=(
% 1.92/2.31 Z, Y )] )).
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 subsumption(
% 1.92/2.31 clause( 24596, [ theorem( or( X, implies( or( X, Y ), Y ) ) ) ] )
% 1.92/2.31 , clause( 28058, [ theorem( or( X, implies( or( X, Y ), Y ) ) ) ] )
% 1.92/2.31 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.92/2.31 )] ) ).
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 paramod(
% 1.92/2.31 clause( 28062, [ theorem( or( not( X ), implies( implies( X, Y ), Y ) ) ) ]
% 1.92/2.31 )
% 1.92/2.31 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.92/2.31 , 0, clause( 24596, [ theorem( or( X, implies( or( X, Y ), Y ) ) ) ] )
% 1.92/2.31 , 0, 5, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [
% 1.92/2.31 :=( X, not( X ) ), :=( Y, Y )] )).
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 paramod(
% 1.92/2.31 clause( 28064, [ theorem( implies( X, implies( implies( X, Y ), Y ) ) ) ]
% 1.92/2.31 )
% 1.92/2.31 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.92/2.31 , 0, clause( 28062, [ theorem( or( not( X ), implies( implies( X, Y ), Y )
% 1.92/2.31 ) ) ] )
% 1.92/2.31 , 0, 1, substitution( 0, [ :=( X, X ), :=( Y, implies( implies( X, Y ), Y )
% 1.92/2.31 )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 subsumption(
% 1.92/2.31 clause( 27305, [ theorem( implies( X, implies( implies( X, Y ), Y ) ) ) ]
% 1.92/2.31 )
% 1.92/2.31 , clause( 28064, [ theorem( implies( X, implies( implies( X, Y ), Y ) ) ) ]
% 1.92/2.31 )
% 1.92/2.31 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.92/2.31 )] ) ).
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 resolution(
% 1.92/2.31 clause( 28065, [] )
% 1.92/2.31 , clause( 8, [ ~( theorem( implies( p, implies( implies( p, q ), q ) ) ) )
% 1.92/2.31 ] )
% 1.92/2.31 , 0, clause( 27305, [ theorem( implies( X, implies( implies( X, Y ), Y ) )
% 1.92/2.31 ) ] )
% 1.92/2.31 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, p ), :=( Y, q )] )
% 1.92/2.31 ).
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 subsumption(
% 1.92/2.31 clause( 28024, [] )
% 1.92/2.31 , clause( 28065, [] )
% 1.92/2.31 , substitution( 0, [] ), permutation( 0, [] ) ).
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 end.
% 1.92/2.31
% 1.92/2.31 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 1.92/2.31
% 1.92/2.31 Memory use:
% 1.92/2.31
% 1.92/2.31 space for terms: 426110
% 1.92/2.31 space for clauses: 1292701
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 clauses generated: 60238
% 1.92/2.31 clauses kept: 28025
% 1.92/2.31 clauses selected: 562
% 1.92/2.31 clauses deleted: 62
% 1.92/2.31 clauses inuse deleted: 1
% 1.92/2.31
% 1.92/2.31 subsentry: 1323058
% 1.92/2.31 literals s-matched: 517825
% 1.92/2.31 literals matched: 477797
% 1.92/2.31 full subsumption: 226031
% 1.92/2.31
% 1.92/2.31 checksum: 1476877904
% 1.92/2.31
% 1.92/2.31
% 1.92/2.31 Bliksem ended
%------------------------------------------------------------------------------