TSTP Solution File: LCL236-3 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL236-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n004.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:05 EDT 2022
% Result : Unsatisfiable 0.73s 1.54s
% Output : Refutation 0.73s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL236-3 : TPTP v8.1.0. Released v2.3.0.
% 0.03/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n004.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 21:40:08 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.73/1.53 *** allocated 10000 integers for termspace/termends
% 0.73/1.53 *** allocated 10000 integers for clauses
% 0.73/1.53 *** allocated 10000 integers for justifications
% 0.73/1.53 Bliksem 1.12
% 0.73/1.53
% 0.73/1.53
% 0.73/1.53 Automatic Strategy Selection
% 0.73/1.53
% 0.73/1.53 Clauses:
% 0.73/1.53 [
% 0.73/1.53 [ axiom( implies( or( X, X ), X ) ) ],
% 0.73/1.53 [ axiom( implies( X, or( Y, X ) ) ) ],
% 0.73/1.53 [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ],
% 0.73/1.53 [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) ) ) ) ],
% 0.73/1.53 [ axiom( implies( implies( X, Y ), implies( or( Z, X ), or( Z, Y ) ) ) )
% 0.73/1.53 ],
% 0.73/1.53 [ =( implies( X, Y ), or( not( X ), Y ) ) ],
% 0.73/1.53 [ theorem( X ), ~( axiom( X ) ) ],
% 0.73/1.53 [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y ) ) ]
% 0.73/1.53 ,
% 0.73/1.53 [ =( and( X, Y ), not( or( not( X ), not( Y ) ) ) ) ],
% 0.73/1.53 [ ~( theorem( implies( or( not( p ), not( q ) ), not( and( p, q ) ) ) )
% 0.73/1.53 ) ]
% 0.73/1.53 ] .
% 0.73/1.53
% 0.73/1.53
% 0.73/1.53 percentage equality = 0.153846, percentage horn = 1.000000
% 0.73/1.53 This is a problem with some equality
% 0.73/1.53
% 0.73/1.53
% 0.73/1.53
% 0.73/1.53 Options Used:
% 0.73/1.53
% 0.73/1.53 useres = 1
% 0.73/1.53 useparamod = 1
% 0.73/1.53 useeqrefl = 1
% 0.73/1.53 useeqfact = 1
% 0.73/1.53 usefactor = 1
% 0.73/1.53 usesimpsplitting = 0
% 0.73/1.54 usesimpdemod = 5
% 0.73/1.54 usesimpres = 3
% 0.73/1.54
% 0.73/1.54 resimpinuse = 1000
% 0.73/1.54 resimpclauses = 20000
% 0.73/1.54 substype = eqrewr
% 0.73/1.54 backwardsubs = 1
% 0.73/1.54 selectoldest = 5
% 0.73/1.54
% 0.73/1.54 litorderings [0] = split
% 0.73/1.54 litorderings [1] = extend the termordering, first sorting on arguments
% 0.73/1.54
% 0.73/1.54 termordering = kbo
% 0.73/1.54
% 0.73/1.54 litapriori = 0
% 0.73/1.54 termapriori = 1
% 0.73/1.54 litaposteriori = 0
% 0.73/1.54 termaposteriori = 0
% 0.73/1.54 demodaposteriori = 0
% 0.73/1.54 ordereqreflfact = 0
% 0.73/1.54
% 0.73/1.54 litselect = negord
% 0.73/1.54
% 0.73/1.54 maxweight = 15
% 0.73/1.54 maxdepth = 30000
% 0.73/1.54 maxlength = 115
% 0.73/1.54 maxnrvars = 195
% 0.73/1.54 excuselevel = 1
% 0.73/1.54 increasemaxweight = 1
% 0.73/1.54
% 0.73/1.54 maxselected = 10000000
% 0.73/1.54 maxnrclauses = 10000000
% 0.73/1.54
% 0.73/1.54 showgenerated = 0
% 0.73/1.54 showkept = 0
% 0.73/1.54 showselected = 0
% 0.73/1.54 showdeleted = 0
% 0.73/1.54 showresimp = 1
% 0.73/1.54 showstatus = 2000
% 0.73/1.54
% 0.73/1.54 prologoutput = 1
% 0.73/1.54 nrgoals = 5000000
% 0.73/1.54 totalproof = 1
% 0.73/1.54
% 0.73/1.54 Symbols occurring in the translation:
% 0.73/1.54
% 0.73/1.54 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.73/1.54 . [1, 2] (w:1, o:26, a:1, s:1, b:0),
% 0.73/1.54 ! [4, 1] (w:0, o:18, a:1, s:1, b:0),
% 0.73/1.54 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.73/1.54 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.73/1.54 or [40, 2] (w:1, o:51, a:1, s:1, b:0),
% 0.73/1.54 implies [41, 2] (w:1, o:52, a:1, s:1, b:0),
% 0.73/1.54 axiom [42, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.73/1.54 not [47, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.73/1.54 theorem [48, 1] (w:1, o:25, a:1, s:1, b:0),
% 0.73/1.54 and [51, 2] (w:1, o:53, a:1, s:1, b:0),
% 0.73/1.54 p [52, 0] (w:1, o:16, a:1, s:1, b:0),
% 0.73/1.54 q [53, 0] (w:1, o:17, a:1, s:1, b:0).
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 Starting Search:
% 0.73/1.54
% 0.73/1.54 Resimplifying inuse:
% 0.73/1.54 Done
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 Intermediate Status:
% 0.73/1.54 Generated: 4727
% 0.73/1.54 Kept: 2014
% 0.73/1.54 Inuse: 104
% 0.73/1.54 Deleted: 3
% 0.73/1.54 Deletedinuse: 0
% 0.73/1.54
% 0.73/1.54 Resimplifying inuse:
% 0.73/1.54 Done
% 0.73/1.54
% 0.73/1.54 Resimplifying inuse:
% 0.73/1.54 Done
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 Intermediate Status:
% 0.73/1.54 Generated: 11558
% 0.73/1.54 Kept: 4023
% 0.73/1.54 Inuse: 155
% 0.73/1.54 Deleted: 3
% 0.73/1.54 Deletedinuse: 0
% 0.73/1.54
% 0.73/1.54 Resimplifying inuse:
% 0.73/1.54 Done
% 0.73/1.54
% 0.73/1.54 Resimplifying inuse:
% 0.73/1.54 Done
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 Intermediate Status:
% 0.73/1.54 Generated: 16776
% 0.73/1.54 Kept: 6026
% 0.73/1.54 Inuse: 207
% 0.73/1.54 Deleted: 35
% 0.73/1.54 Deletedinuse: 32
% 0.73/1.54
% 0.73/1.54 Resimplifying inuse:
% 0.73/1.54 Done
% 0.73/1.54
% 0.73/1.54 Resimplifying inuse:
% 0.73/1.54 Done
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 Intermediate Status:
% 0.73/1.54 Generated: 20901
% 0.73/1.54 Kept: 8063
% 0.73/1.54 Inuse: 245
% 0.73/1.54 Deleted: 35
% 0.73/1.54 Deletedinuse: 32
% 0.73/1.54
% 0.73/1.54 Resimplifying inuse:
% 0.73/1.54 Done
% 0.73/1.54
% 0.73/1.54 Resimplifying inuse:
% 0.73/1.54 Done
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 Intermediate Status:
% 0.73/1.54 Generated: 25572
% 0.73/1.54 Kept: 10090
% 0.73/1.54 Inuse: 285
% 0.73/1.54 Deleted: 35
% 0.73/1.54 Deletedinuse: 32
% 0.73/1.54
% 0.73/1.54 Resimplifying inuse:
% 0.73/1.54 Done
% 0.73/1.54
% 0.73/1.54 Resimplifying inuse:
% 0.73/1.54 Done
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 Intermediate Status:
% 0.73/1.54 Generated: 31425
% 0.73/1.54 Kept: 12098
% 0.73/1.54 Inuse: 338
% 0.73/1.54 Deleted: 35
% 0.73/1.54 Deletedinuse: 32
% 0.73/1.54
% 0.73/1.54 Resimplifying inuse:
% 0.73/1.54 Done
% 0.73/1.54
% 0.73/1.54 Resimplifying inuse:
% 0.73/1.54 Done
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 Intermediate Status:
% 0.73/1.54 Generated: 36938
% 0.73/1.54 Kept: 14107
% 0.73/1.54 Inuse: 374
% 0.73/1.54 Deleted: 35
% 0.73/1.54 Deletedinuse: 32
% 0.73/1.54
% 0.73/1.54 Resimplifying inuse:
% 0.73/1.54 Done
% 0.73/1.54
% 0.73/1.54 Resimplifying inuse:
% 0.73/1.54 Done
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 Intermediate Status:
% 0.73/1.54 Generated: 41347
% 0.73/1.54 Kept: 16159
% 0.73/1.54 Inuse: 396
% 0.73/1.54 Deleted: 35
% 0.73/1.54 Deletedinuse: 32
% 0.73/1.54
% 0.73/1.54 Resimplifying inuse:
% 0.73/1.54 Done
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 Bliksems!, er is een bewijs:
% 0.73/1.54 % SZS status Unsatisfiable
% 0.73/1.54 % SZS output start Refutation
% 0.73/1.54
% 0.73/1.54 clause( 0, [ axiom( implies( or( X, X ), X ) ) ] )
% 0.73/1.54 .
% 0.73/1.54 clause( 1, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 0.73/1.54 .
% 0.73/1.54 clause( 2, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 0.73/1.54 .
% 0.73/1.54 clause( 3, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) ) ) ) ]
% 0.73/1.54 )
% 0.73/1.54 .
% 0.73/1.54 clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.73/1.54 .
% 0.73/1.54 clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.73/1.54 .
% 0.73/1.54 clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y )
% 0.73/1.54 ) ] )
% 0.73/1.54 .
% 0.73/1.54 clause( 8, [ =( not( implies( X, not( Y ) ) ), and( X, Y ) ) ] )
% 0.73/1.54 .
% 0.73/1.54 clause( 9, [ ~( theorem( implies( implies( p, not( q ) ), not( and( p, q )
% 0.73/1.54 ) ) ) ) ] )
% 0.73/1.54 .
% 0.73/1.54 clause( 10, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 0.73/1.54 .
% 0.73/1.54 clause( 11, [ theorem( implies( or( X, X ), X ) ) ] )
% 0.73/1.54 .
% 0.73/1.54 clause( 15, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 0.73/1.54 .
% 0.73/1.54 clause( 19, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X ) )
% 0.73/1.54 ) ] )
% 0.73/1.54 .
% 0.73/1.54 clause( 65, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 0.73/1.54 .
% 0.73/1.54 clause( 67, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y ) ), X
% 0.73/1.54 ) ) ) ] )
% 0.73/1.54 .
% 0.73/1.54 clause( 118, [ theorem( or( Y, not( X ) ) ), ~( theorem( implies( X, Y ) )
% 0.73/1.54 ) ] )
% 0.73/1.54 .
% 0.73/1.54 clause( 125, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies( X
% 0.73/1.54 , Z ) ) ) ) ] )
% 0.73/1.54 .
% 0.73/1.54 clause( 167, [ =( implies( implies( X, not( Y ) ), Z ), or( and( X, Y ), Z
% 0.73/1.54 ) ) ] )
% 0.73/1.54 .
% 0.73/1.54 clause( 208, [ ~( theorem( or( and( p, q ), not( and( p, q ) ) ) ) ) ] )
% 0.73/1.54 .
% 0.73/1.54 clause( 4483, [ ~( theorem( implies( and( p, q ), and( p, q ) ) ) ) ] )
% 0.73/1.54 .
% 0.73/1.54 clause( 17236, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 0.73/1.54 .
% 0.73/1.54 clause( 17356, [ theorem( implies( X, X ) ) ] )
% 0.73/1.54 .
% 0.73/1.54 clause( 17396, [] )
% 0.73/1.54 .
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 % SZS output end Refutation
% 0.73/1.54 found a proof!
% 0.73/1.54
% 0.73/1.54 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.73/1.54
% 0.73/1.54 initialclauses(
% 0.73/1.54 [ clause( 17398, [ axiom( implies( or( X, X ), X ) ) ] )
% 0.73/1.54 , clause( 17399, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 0.73/1.54 , clause( 17400, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 0.73/1.54 , clause( 17401, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) )
% 0.73/1.54 ) ) ] )
% 0.73/1.54 , clause( 17402, [ axiom( implies( implies( X, Y ), implies( or( Z, X ), or(
% 0.73/1.54 Z, Y ) ) ) ) ] )
% 0.73/1.54 , clause( 17403, [ =( implies( X, Y ), or( not( X ), Y ) ) ] )
% 0.73/1.54 , clause( 17404, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.73/1.54 , clause( 17405, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~(
% 0.73/1.54 theorem( Y ) ) ] )
% 0.73/1.54 , clause( 17406, [ =( and( X, Y ), not( or( not( X ), not( Y ) ) ) ) ] )
% 0.73/1.54 , clause( 17407, [ ~( theorem( implies( or( not( p ), not( q ) ), not( and(
% 0.73/1.54 p, q ) ) ) ) ) ] )
% 0.73/1.54 ] ).
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 subsumption(
% 0.73/1.54 clause( 0, [ axiom( implies( or( X, X ), X ) ) ] )
% 0.73/1.54 , clause( 17398, [ axiom( implies( or( X, X ), X ) ) ] )
% 0.73/1.54 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 subsumption(
% 0.73/1.54 clause( 1, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 0.73/1.54 , clause( 17399, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 0.73/1.54 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.73/1.54 )] ) ).
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 subsumption(
% 0.73/1.54 clause( 2, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 0.73/1.54 , clause( 17400, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 0.73/1.54 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.73/1.54 )] ) ).
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 subsumption(
% 0.73/1.54 clause( 3, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) ) ) ) ]
% 0.73/1.54 )
% 0.73/1.54 , clause( 17401, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) )
% 0.73/1.54 ) ) ] )
% 0.73/1.54 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.73/1.54 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 eqswap(
% 0.73/1.54 clause( 17408, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.73/1.54 , clause( 17403, [ =( implies( X, Y ), or( not( X ), Y ) ) ] )
% 0.73/1.54 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 subsumption(
% 0.73/1.54 clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.73/1.54 , clause( 17408, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.73/1.54 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.73/1.54 )] ) ).
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 subsumption(
% 0.73/1.54 clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.73/1.54 , clause( 17404, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.73/1.54 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.73/1.54 1 )] ) ).
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 subsumption(
% 0.73/1.54 clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y )
% 0.73/1.54 ) ] )
% 0.73/1.54 , clause( 17405, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~(
% 0.73/1.54 theorem( Y ) ) ] )
% 0.73/1.54 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.73/1.54 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 paramod(
% 0.73/1.54 clause( 17424, [ =( and( X, Y ), not( implies( X, not( Y ) ) ) ) ] )
% 0.73/1.54 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.73/1.54 , 0, clause( 17406, [ =( and( X, Y ), not( or( not( X ), not( Y ) ) ) ) ]
% 0.73/1.54 )
% 0.73/1.54 , 0, 5, substitution( 0, [ :=( X, X ), :=( Y, not( Y ) )] ), substitution(
% 0.73/1.54 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 eqswap(
% 0.73/1.54 clause( 17425, [ =( not( implies( X, not( Y ) ) ), and( X, Y ) ) ] )
% 0.73/1.54 , clause( 17424, [ =( and( X, Y ), not( implies( X, not( Y ) ) ) ) ] )
% 0.73/1.54 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 subsumption(
% 0.73/1.54 clause( 8, [ =( not( implies( X, not( Y ) ) ), and( X, Y ) ) ] )
% 0.73/1.54 , clause( 17425, [ =( not( implies( X, not( Y ) ) ), and( X, Y ) ) ] )
% 0.73/1.54 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.73/1.54 )] ) ).
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 paramod(
% 0.73/1.54 clause( 17444, [ ~( theorem( implies( implies( p, not( q ) ), not( and( p,
% 0.73/1.54 q ) ) ) ) ) ] )
% 0.73/1.54 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.73/1.54 , 0, clause( 17407, [ ~( theorem( implies( or( not( p ), not( q ) ), not(
% 0.73/1.54 and( p, q ) ) ) ) ) ] )
% 0.73/1.54 , 0, 3, substitution( 0, [ :=( X, p ), :=( Y, not( q ) )] ), substitution(
% 0.73/1.54 1, [] )).
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 subsumption(
% 0.73/1.54 clause( 9, [ ~( theorem( implies( implies( p, not( q ) ), not( and( p, q )
% 0.73/1.54 ) ) ) ) ] )
% 0.73/1.54 , clause( 17444, [ ~( theorem( implies( implies( p, not( q ) ), not( and( p
% 0.73/1.54 , q ) ) ) ) ) ] )
% 0.73/1.54 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 resolution(
% 0.73/1.54 clause( 17445, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 0.73/1.54 , clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.73/1.54 , 1, clause( 1, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 0.73/1.54 , 0, substitution( 0, [ :=( X, implies( X, or( Y, X ) ) )] ),
% 0.73/1.54 substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 subsumption(
% 0.73/1.54 clause( 10, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 0.73/1.54 , clause( 17445, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 0.73/1.54 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.73/1.54 )] ) ).
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 resolution(
% 0.73/1.54 clause( 17446, [ theorem( implies( or( X, X ), X ) ) ] )
% 0.73/1.54 , clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.73/1.54 , 1, clause( 0, [ axiom( implies( or( X, X ), X ) ) ] )
% 0.73/1.54 , 0, substitution( 0, [ :=( X, implies( or( X, X ), X ) )] ),
% 0.73/1.54 substitution( 1, [ :=( X, X )] )).
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 subsumption(
% 0.73/1.54 clause( 11, [ theorem( implies( or( X, X ), X ) ) ] )
% 0.73/1.54 , clause( 17446, [ theorem( implies( or( X, X ), X ) ) ] )
% 0.73/1.54 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 resolution(
% 0.73/1.54 clause( 17447, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 0.73/1.54 , clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y
% 0.73/1.54 ) ) ] )
% 0.73/1.54 , 1, clause( 11, [ theorem( implies( or( X, X ), X ) ) ] )
% 0.73/1.54 , 0, substitution( 0, [ :=( X, X ), :=( Y, or( X, X ) )] ), substitution( 1
% 0.73/1.54 , [ :=( X, X )] )).
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 subsumption(
% 0.73/1.54 clause( 15, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 0.73/1.54 , clause( 17447, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 0.73/1.54 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.73/1.54 1 )] ) ).
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 resolution(
% 0.73/1.54 clause( 17449, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X )
% 0.73/1.54 ) ) ] )
% 0.73/1.54 , clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y
% 0.73/1.54 ) ) ] )
% 0.73/1.54 , 1, clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.73/1.54 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [ :=( X
% 0.73/1.54 , implies( Y, X ) )] )).
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 subsumption(
% 0.73/1.54 clause( 19, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X ) )
% 0.73/1.54 ) ] )
% 0.73/1.54 , clause( 17449, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X
% 0.73/1.54 ) ) ) ] )
% 0.73/1.54 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.73/1.54 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 resolution(
% 0.73/1.54 clause( 17451, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 0.73/1.54 , clause( 19, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X )
% 0.73/1.54 ) ) ] )
% 0.73/1.54 , 2, clause( 2, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 0.73/1.54 , 0, substitution( 0, [ :=( X, or( X, Y ) ), :=( Y, or( Y, X ) )] ),
% 0.73/1.54 substitution( 1, [ :=( X, Y ), :=( Y, X )] )).
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 subsumption(
% 0.73/1.54 clause( 65, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 0.73/1.54 , clause( 17451, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 0.73/1.54 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.73/1.54 ), ==>( 1, 1 )] ) ).
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 resolution(
% 0.73/1.54 clause( 17452, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y ) )
% 0.73/1.54 , X ) ) ) ] )
% 0.73/1.54 , clause( 19, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X )
% 0.73/1.54 ) ) ] )
% 0.73/1.54 , 1, clause( 10, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 0.73/1.54 , 0, substitution( 0, [ :=( X, X ), :=( Y, implies( Y, or( Z, Y ) ) )] ),
% 0.73/1.54 substitution( 1, [ :=( X, Y ), :=( Y, Z )] )).
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 subsumption(
% 0.73/1.54 clause( 67, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y ) ), X
% 0.73/1.54 ) ) ) ] )
% 0.73/1.54 , clause( 17452, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y )
% 0.73/1.54 ), X ) ) ) ] )
% 0.73/1.54 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.73/1.54 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 paramod(
% 0.73/1.54 clause( 17455, [ ~( theorem( implies( X, Y ) ) ), theorem( or( Y, not( X )
% 0.73/1.54 ) ) ] )
% 0.73/1.54 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.73/1.54 , 0, clause( 65, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 0.73/1.54 , 1, 2, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [
% 0.73/1.54 :=( X, Y ), :=( Y, not( X ) )] )).
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 subsumption(
% 0.73/1.54 clause( 118, [ theorem( or( Y, not( X ) ) ), ~( theorem( implies( X, Y ) )
% 0.73/1.54 ) ] )
% 0.73/1.54 , clause( 17455, [ ~( theorem( implies( X, Y ) ) ), theorem( or( Y, not( X
% 0.73/1.54 ) ) ) ] )
% 0.73/1.54 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.73/1.54 ), ==>( 1, 0 )] ) ).
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 paramod(
% 0.73/1.54 clause( 17461, [ axiom( implies( or( not( X ), or( Y, Z ) ), or( Y, implies(
% 0.73/1.54 X, Z ) ) ) ) ] )
% 0.73/1.54 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.73/1.54 , 0, clause( 3, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) )
% 0.73/1.54 ) ) ] )
% 0.73/1.54 , 0, 10, substitution( 0, [ :=( X, X ), :=( Y, Z )] ), substitution( 1, [
% 0.73/1.54 :=( X, not( X ) ), :=( Y, Y ), :=( Z, Z )] )).
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 paramod(
% 0.73/1.54 clause( 17464, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies(
% 0.73/1.54 X, Z ) ) ) ) ] )
% 0.73/1.54 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.73/1.54 , 0, clause( 17461, [ axiom( implies( or( not( X ), or( Y, Z ) ), or( Y,
% 0.73/1.54 implies( X, Z ) ) ) ) ] )
% 0.73/1.54 , 0, 2, substitution( 0, [ :=( X, X ), :=( Y, or( Y, Z ) )] ),
% 0.73/1.54 substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 subsumption(
% 0.73/1.54 clause( 125, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies( X
% 0.73/1.54 , Z ) ) ) ) ] )
% 0.73/1.54 , clause( 17464, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies(
% 0.73/1.54 X, Z ) ) ) ) ] )
% 0.73/1.54 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.73/1.54 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 eqswap(
% 0.73/1.54 clause( 17466, [ =( implies( X, Y ), or( not( X ), Y ) ) ] )
% 0.73/1.54 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.73/1.54 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 paramod(
% 0.73/1.54 clause( 17467, [ =( implies( implies( X, not( Y ) ), Z ), or( and( X, Y ),
% 0.73/1.54 Z ) ) ] )
% 0.73/1.54 , clause( 8, [ =( not( implies( X, not( Y ) ) ), and( X, Y ) ) ] )
% 0.73/1.54 , 0, clause( 17466, [ =( implies( X, Y ), or( not( X ), Y ) ) ] )
% 0.73/1.54 , 0, 8, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [
% 0.73/1.54 :=( X, implies( X, not( Y ) ) ), :=( Y, Z )] )).
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 subsumption(
% 0.73/1.54 clause( 167, [ =( implies( implies( X, not( Y ) ), Z ), or( and( X, Y ), Z
% 0.73/1.54 ) ) ] )
% 0.73/1.54 , clause( 17467, [ =( implies( implies( X, not( Y ) ), Z ), or( and( X, Y )
% 0.73/1.54 , Z ) ) ] )
% 0.73/1.54 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.73/1.54 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 paramod(
% 0.73/1.54 clause( 17470, [ ~( theorem( or( and( p, q ), not( and( p, q ) ) ) ) ) ] )
% 0.73/1.54 , clause( 167, [ =( implies( implies( X, not( Y ) ), Z ), or( and( X, Y ),
% 0.73/1.54 Z ) ) ] )
% 0.73/1.54 , 0, clause( 9, [ ~( theorem( implies( implies( p, not( q ) ), not( and( p
% 0.73/1.54 , q ) ) ) ) ) ] )
% 0.73/1.54 , 0, 2, substitution( 0, [ :=( X, p ), :=( Y, q ), :=( Z, not( and( p, q )
% 0.73/1.54 ) )] ), substitution( 1, [] )).
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 subsumption(
% 0.73/1.54 clause( 208, [ ~( theorem( or( and( p, q ), not( and( p, q ) ) ) ) ) ] )
% 0.73/1.54 , clause( 17470, [ ~( theorem( or( and( p, q ), not( and( p, q ) ) ) ) ) ]
% 0.73/1.54 )
% 0.73/1.54 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 resolution(
% 0.73/1.54 clause( 17471, [ ~( theorem( implies( and( p, q ), and( p, q ) ) ) ) ] )
% 0.73/1.54 , clause( 208, [ ~( theorem( or( and( p, q ), not( and( p, q ) ) ) ) ) ] )
% 0.73/1.54 , 0, clause( 118, [ theorem( or( Y, not( X ) ) ), ~( theorem( implies( X, Y
% 0.73/1.54 ) ) ) ] )
% 0.73/1.54 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, and( p, q ) ), :=( Y
% 0.73/1.54 , and( p, q ) )] )).
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 subsumption(
% 0.73/1.54 clause( 4483, [ ~( theorem( implies( and( p, q ), and( p, q ) ) ) ) ] )
% 0.73/1.54 , clause( 17471, [ ~( theorem( implies( and( p, q ), and( p, q ) ) ) ) ] )
% 0.73/1.54 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 resolution(
% 0.73/1.54 clause( 17472, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 0.73/1.54 , clause( 67, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y ) ),
% 0.73/1.54 X ) ) ) ] )
% 0.73/1.54 , 1, clause( 125, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y,
% 0.73/1.54 implies( X, Z ) ) ) ) ] )
% 0.73/1.54 , 0, substitution( 0, [ :=( X, or( X, implies( Y, Y ) ) ), :=( Y, Y ), :=(
% 0.73/1.54 Z, X )] ), substitution( 1, [ :=( X, Y ), :=( Y, X ), :=( Z, Y )] )).
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 subsumption(
% 0.73/1.54 clause( 17236, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 0.73/1.54 , clause( 17472, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 0.73/1.54 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.73/1.54 )] ) ).
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 resolution(
% 0.73/1.54 clause( 17473, [ theorem( implies( X, X ) ) ] )
% 0.73/1.54 , clause( 15, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 0.73/1.54 , 1, clause( 17236, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 0.73/1.54 , 0, substitution( 0, [ :=( X, implies( X, X ) )] ), substitution( 1, [
% 0.73/1.54 :=( X, implies( X, X ) ), :=( Y, X )] )).
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 subsumption(
% 0.73/1.54 clause( 17356, [ theorem( implies( X, X ) ) ] )
% 0.73/1.54 , clause( 17473, [ theorem( implies( X, X ) ) ] )
% 0.73/1.54 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 resolution(
% 0.73/1.54 clause( 17474, [] )
% 0.73/1.54 , clause( 4483, [ ~( theorem( implies( and( p, q ), and( p, q ) ) ) ) ] )
% 0.73/1.54 , 0, clause( 17356, [ theorem( implies( X, X ) ) ] )
% 0.73/1.54 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, and( p, q ) )] )).
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 subsumption(
% 0.73/1.54 clause( 17396, [] )
% 0.73/1.54 , clause( 17474, [] )
% 0.73/1.54 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 end.
% 0.73/1.54
% 0.73/1.54 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.73/1.54
% 0.73/1.54 Memory use:
% 0.73/1.54
% 0.73/1.54 space for terms: 269904
% 0.73/1.54 space for clauses: 794092
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 clauses generated: 44593
% 0.73/1.54 clauses kept: 17397
% 0.73/1.54 clauses selected: 425
% 0.73/1.54 clauses deleted: 35
% 0.73/1.54 clauses inuse deleted: 32
% 0.73/1.54
% 0.73/1.54 subsentry: 428529
% 0.73/1.54 literals s-matched: 227014
% 0.73/1.54 literals matched: 215371
% 0.73/1.54 full subsumption: 93478
% 0.73/1.54
% 0.73/1.54 checksum: 359692126
% 0.73/1.54
% 0.73/1.54
% 0.73/1.54 Bliksem ended
%------------------------------------------------------------------------------