TSTP Solution File: LCL239-3 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL239-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n023.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:07 EDT 2022
% Result : Unsatisfiable 0.76s 1.52s
% Output : Refutation 0.76s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LCL239-3 : TPTP v8.1.0. Released v2.3.0.
% 0.04/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n023.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 : Mon Jul 4 20:52:12 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.76/1.52 *** allocated 10000 integers for termspace/termends
% 0.76/1.52 *** allocated 10000 integers for clauses
% 0.76/1.52 *** allocated 10000 integers for justifications
% 0.76/1.52 Bliksem 1.12
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 Automatic Strategy Selection
% 0.76/1.52
% 0.76/1.52 Clauses:
% 0.76/1.52 [
% 0.76/1.52 [ axiom( implies( or( X, X ), X ) ) ],
% 0.76/1.52 [ axiom( implies( X, or( Y, X ) ) ) ],
% 0.76/1.52 [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ],
% 0.76/1.52 [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) ) ) ) ],
% 0.76/1.52 [ axiom( implies( implies( X, Y ), implies( or( Z, X ), or( Z, Y ) ) ) )
% 0.76/1.52 ],
% 0.76/1.52 [ =( implies( X, Y ), or( not( X ), Y ) ) ],
% 0.76/1.52 [ theorem( X ), ~( axiom( X ) ) ],
% 0.76/1.52 [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y ) ) ]
% 0.76/1.52 ,
% 0.76/1.52 [ =( and( X, Y ), not( or( not( X ), not( Y ) ) ) ) ],
% 0.76/1.52 [ ~( theorem( not( and( p, not( p ) ) ) ) ) ]
% 0.76/1.52 ] .
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 percentage equality = 0.153846, percentage horn = 1.000000
% 0.76/1.52 This is a problem with some equality
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 Options Used:
% 0.76/1.52
% 0.76/1.52 useres = 1
% 0.76/1.52 useparamod = 1
% 0.76/1.52 useeqrefl = 1
% 0.76/1.52 useeqfact = 1
% 0.76/1.52 usefactor = 1
% 0.76/1.52 usesimpsplitting = 0
% 0.76/1.52 usesimpdemod = 5
% 0.76/1.52 usesimpres = 3
% 0.76/1.52
% 0.76/1.52 resimpinuse = 1000
% 0.76/1.52 resimpclauses = 20000
% 0.76/1.52 substype = eqrewr
% 0.76/1.52 backwardsubs = 1
% 0.76/1.52 selectoldest = 5
% 0.76/1.52
% 0.76/1.52 litorderings [0] = split
% 0.76/1.52 litorderings [1] = extend the termordering, first sorting on arguments
% 0.76/1.52
% 0.76/1.52 termordering = kbo
% 0.76/1.52
% 0.76/1.52 litapriori = 0
% 0.76/1.52 termapriori = 1
% 0.76/1.52 litaposteriori = 0
% 0.76/1.52 termaposteriori = 0
% 0.76/1.52 demodaposteriori = 0
% 0.76/1.52 ordereqreflfact = 0
% 0.76/1.52
% 0.76/1.52 litselect = negord
% 0.76/1.52
% 0.76/1.52 maxweight = 15
% 0.76/1.52 maxdepth = 30000
% 0.76/1.52 maxlength = 115
% 0.76/1.52 maxnrvars = 195
% 0.76/1.52 excuselevel = 1
% 0.76/1.52 increasemaxweight = 1
% 0.76/1.52
% 0.76/1.52 maxselected = 10000000
% 0.76/1.52 maxnrclauses = 10000000
% 0.76/1.52
% 0.76/1.52 showgenerated = 0
% 0.76/1.52 showkept = 0
% 0.76/1.52 showselected = 0
% 0.76/1.52 showdeleted = 0
% 0.76/1.52 showresimp = 1
% 0.76/1.52 showstatus = 2000
% 0.76/1.52
% 0.76/1.52 prologoutput = 1
% 0.76/1.52 nrgoals = 5000000
% 0.76/1.52 totalproof = 1
% 0.76/1.52
% 0.76/1.52 Symbols occurring in the translation:
% 0.76/1.52
% 0.76/1.52 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.76/1.52 . [1, 2] (w:1, o:25, a:1, s:1, b:0),
% 0.76/1.52 ! [4, 1] (w:0, o:17, a:1, s:1, b:0),
% 0.76/1.52 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.76/1.52 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.76/1.52 or [40, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.76/1.52 implies [41, 2] (w:1, o:51, a:1, s:1, b:0),
% 0.76/1.52 axiom [42, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.76/1.52 not [47, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.76/1.52 theorem [48, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.76/1.52 and [51, 2] (w:1, o:52, a:1, s:1, b:0),
% 0.76/1.52 p [52, 0] (w:1, o:16, a:1, s:1, b:0).
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 Starting Search:
% 0.76/1.52
% 0.76/1.52 Resimplifying inuse:
% 0.76/1.52 Done
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 Intermediate Status:
% 0.76/1.52 Generated: 3748
% 0.76/1.52 Kept: 2057
% 0.76/1.52 Inuse: 108
% 0.76/1.52 Deleted: 5
% 0.76/1.52 Deletedinuse: 2
% 0.76/1.52
% 0.76/1.52 Resimplifying inuse:
% 0.76/1.52 Done
% 0.76/1.52
% 0.76/1.52 Resimplifying inuse:
% 0.76/1.52 Done
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 Intermediate Status:
% 0.76/1.52 Generated: 8080
% 0.76/1.52 Kept: 4057
% 0.76/1.52 Inuse: 171
% 0.76/1.52 Deleted: 7
% 0.76/1.52 Deletedinuse: 2
% 0.76/1.52
% 0.76/1.52 Resimplifying inuse:
% 0.76/1.52 Done
% 0.76/1.52
% 0.76/1.52 Resimplifying inuse:
% 0.76/1.52 Done
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 Intermediate Status:
% 0.76/1.52 Generated: 13525
% 0.76/1.52 Kept: 6080
% 0.76/1.52 Inuse: 237
% 0.76/1.52 Deleted: 11
% 0.76/1.52 Deletedinuse: 2
% 0.76/1.52
% 0.76/1.52 Resimplifying inuse:
% 0.76/1.52 Done
% 0.76/1.52
% 0.76/1.52 Resimplifying inuse:
% 0.76/1.52 Done
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 Intermediate Status:
% 0.76/1.52 Generated: 19132
% 0.76/1.52 Kept: 8179
% 0.76/1.52 Inuse: 282
% 0.76/1.52 Deleted: 16
% 0.76/1.52 Deletedinuse: 2
% 0.76/1.52
% 0.76/1.52 Resimplifying inuse:
% 0.76/1.52 Done
% 0.76/1.52
% 0.76/1.52 Resimplifying inuse:
% 0.76/1.52 Done
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 Intermediate Status:
% 0.76/1.52 Generated: 23682
% 0.76/1.52 Kept: 10243
% 0.76/1.52 Inuse: 303
% 0.76/1.52 Deleted: 23
% 0.76/1.52 Deletedinuse: 2
% 0.76/1.52
% 0.76/1.52 Resimplifying inuse:
% 0.76/1.52 Done
% 0.76/1.52
% 0.76/1.52 Resimplifying inuse:
% 0.76/1.52 Done
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 Intermediate Status:
% 0.76/1.52 Generated: 28793
% 0.76/1.52 Kept: 12258
% 0.76/1.52 Inuse: 335
% 0.76/1.52 Deleted: 25
% 0.76/1.52 Deletedinuse: 2
% 0.76/1.52
% 0.76/1.52 Resimplifying inuse:
% 0.76/1.52 Done
% 0.76/1.52
% 0.76/1.52 Resimplifying inuse:
% 0.76/1.52 Done
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 Intermediate Status:
% 0.76/1.52 Generated: 32802
% 0.76/1.52 Kept: 14310
% 0.76/1.52 Inuse: 375
% 0.76/1.52 Deleted: 25
% 0.76/1.52 Deletedinuse: 2
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 Bliksems!, er is een bewijs:
% 0.76/1.52 % SZS status Unsatisfiable
% 0.76/1.52 % SZS output start Refutation
% 0.76/1.52
% 0.76/1.52 clause( 0, [ axiom( implies( or( X, X ), X ) ) ] )
% 0.76/1.52 .
% 0.76/1.52 clause( 1, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 0.76/1.52 .
% 0.76/1.52 clause( 2, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 0.76/1.52 .
% 0.76/1.52 clause( 3, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) ) ) ) ]
% 0.76/1.52 )
% 0.76/1.52 .
% 0.76/1.52 clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.76/1.52 .
% 0.76/1.52 clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.76/1.52 .
% 0.76/1.52 clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y )
% 0.76/1.52 ) ] )
% 0.76/1.52 .
% 0.76/1.52 clause( 8, [ =( not( implies( X, not( Y ) ) ), and( X, Y ) ) ] )
% 0.76/1.52 .
% 0.76/1.52 clause( 9, [ ~( theorem( not( and( p, not( p ) ) ) ) ) ] )
% 0.76/1.52 .
% 0.76/1.52 clause( 10, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 0.76/1.52 .
% 0.76/1.52 clause( 11, [ theorem( implies( or( X, X ), X ) ) ] )
% 0.76/1.52 .
% 0.76/1.52 clause( 17, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 0.76/1.52 .
% 0.76/1.52 clause( 21, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X ) )
% 0.76/1.52 ) ] )
% 0.76/1.52 .
% 0.76/1.52 clause( 73, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 0.76/1.52 .
% 0.76/1.52 clause( 75, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y ) ), X
% 0.76/1.52 ) ) ) ] )
% 0.76/1.52 .
% 0.76/1.52 clause( 101, [ theorem( or( Y, not( X ) ) ), ~( theorem( implies( X, Y ) )
% 0.76/1.52 ) ] )
% 0.76/1.52 .
% 0.76/1.52 clause( 110, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies( X
% 0.76/1.52 , Z ) ) ) ) ] )
% 0.76/1.52 .
% 0.76/1.52 clause( 13595, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 0.76/1.52 .
% 0.76/1.52 clause( 13710, [ theorem( implies( X, X ) ) ] )
% 0.76/1.52 .
% 0.76/1.52 clause( 13735, [ theorem( or( X, not( X ) ) ) ] )
% 0.76/1.52 .
% 0.76/1.52 clause( 13851, [ theorem( implies( X, not( not( X ) ) ) ) ] )
% 0.76/1.52 .
% 0.76/1.52 clause( 14500, [ theorem( not( not( X ) ) ), ~( theorem( X ) ) ] )
% 0.76/1.52 .
% 0.76/1.52 clause( 14610, [ theorem( not( and( X, not( X ) ) ) ) ] )
% 0.76/1.52 .
% 0.76/1.52 clause( 14952, [] )
% 0.76/1.52 .
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 % SZS output end Refutation
% 0.76/1.52 found a proof!
% 0.76/1.52
% 0.76/1.52 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.76/1.52
% 0.76/1.52 initialclauses(
% 0.76/1.52 [ clause( 14954, [ axiom( implies( or( X, X ), X ) ) ] )
% 0.76/1.52 , clause( 14955, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 0.76/1.52 , clause( 14956, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 0.76/1.52 , clause( 14957, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) )
% 0.76/1.52 ) ) ] )
% 0.76/1.52 , clause( 14958, [ axiom( implies( implies( X, Y ), implies( or( Z, X ), or(
% 0.76/1.52 Z, Y ) ) ) ) ] )
% 0.76/1.52 , clause( 14959, [ =( implies( X, Y ), or( not( X ), Y ) ) ] )
% 0.76/1.52 , clause( 14960, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.76/1.52 , clause( 14961, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~(
% 0.76/1.52 theorem( Y ) ) ] )
% 0.76/1.52 , clause( 14962, [ =( and( X, Y ), not( or( not( X ), not( Y ) ) ) ) ] )
% 0.76/1.52 , clause( 14963, [ ~( theorem( not( and( p, not( p ) ) ) ) ) ] )
% 0.76/1.52 ] ).
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 subsumption(
% 0.76/1.52 clause( 0, [ axiom( implies( or( X, X ), X ) ) ] )
% 0.76/1.52 , clause( 14954, [ axiom( implies( or( X, X ), X ) ) ] )
% 0.76/1.52 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 subsumption(
% 0.76/1.52 clause( 1, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 0.76/1.52 , clause( 14955, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 0.76/1.52 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.76/1.52 )] ) ).
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 subsumption(
% 0.76/1.52 clause( 2, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 0.76/1.52 , clause( 14956, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 0.76/1.52 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.76/1.52 )] ) ).
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 subsumption(
% 0.76/1.52 clause( 3, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) ) ) ) ]
% 0.76/1.52 )
% 0.76/1.52 , clause( 14957, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) )
% 0.76/1.52 ) ) ] )
% 0.76/1.52 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.76/1.52 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 eqswap(
% 0.76/1.52 clause( 14964, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.76/1.52 , clause( 14959, [ =( implies( X, Y ), or( not( X ), Y ) ) ] )
% 0.76/1.52 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 subsumption(
% 0.76/1.52 clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.76/1.52 , clause( 14964, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.76/1.52 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.76/1.52 )] ) ).
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 subsumption(
% 0.76/1.52 clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.76/1.52 , clause( 14960, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.76/1.52 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.76/1.52 1 )] ) ).
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 subsumption(
% 0.76/1.52 clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y )
% 0.76/1.52 ) ] )
% 0.76/1.52 , clause( 14961, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~(
% 0.76/1.52 theorem( Y ) ) ] )
% 0.76/1.52 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.76/1.52 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 paramod(
% 0.76/1.52 clause( 14980, [ =( and( X, Y ), not( implies( X, not( Y ) ) ) ) ] )
% 0.76/1.52 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.76/1.52 , 0, clause( 14962, [ =( and( X, Y ), not( or( not( X ), not( Y ) ) ) ) ]
% 0.76/1.52 )
% 0.76/1.52 , 0, 5, substitution( 0, [ :=( X, X ), :=( Y, not( Y ) )] ), substitution(
% 0.76/1.52 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 eqswap(
% 0.76/1.52 clause( 14981, [ =( not( implies( X, not( Y ) ) ), and( X, Y ) ) ] )
% 0.76/1.52 , clause( 14980, [ =( and( X, Y ), not( implies( X, not( Y ) ) ) ) ] )
% 0.76/1.52 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 subsumption(
% 0.76/1.52 clause( 8, [ =( not( implies( X, not( Y ) ) ), and( X, Y ) ) ] )
% 0.76/1.52 , clause( 14981, [ =( not( implies( X, not( Y ) ) ), and( X, Y ) ) ] )
% 0.76/1.52 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.76/1.52 )] ) ).
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 subsumption(
% 0.76/1.52 clause( 9, [ ~( theorem( not( and( p, not( p ) ) ) ) ) ] )
% 0.76/1.52 , clause( 14963, [ ~( theorem( not( and( p, not( p ) ) ) ) ) ] )
% 0.76/1.52 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 resolution(
% 0.76/1.52 clause( 14984, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 0.76/1.52 , clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.76/1.52 , 1, clause( 1, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 0.76/1.52 , 0, substitution( 0, [ :=( X, implies( X, or( Y, X ) ) )] ),
% 0.76/1.52 substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 subsumption(
% 0.76/1.52 clause( 10, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 0.76/1.52 , clause( 14984, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 0.76/1.52 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.76/1.52 )] ) ).
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 resolution(
% 0.76/1.52 clause( 14985, [ theorem( implies( or( X, X ), X ) ) ] )
% 0.76/1.52 , clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.76/1.52 , 1, clause( 0, [ axiom( implies( or( X, X ), X ) ) ] )
% 0.76/1.52 , 0, substitution( 0, [ :=( X, implies( or( X, X ), X ) )] ),
% 0.76/1.52 substitution( 1, [ :=( X, X )] )).
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 subsumption(
% 0.76/1.52 clause( 11, [ theorem( implies( or( X, X ), X ) ) ] )
% 0.76/1.52 , clause( 14985, [ theorem( implies( or( X, X ), X ) ) ] )
% 0.76/1.52 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 resolution(
% 0.76/1.52 clause( 14986, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 0.76/1.52 , clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y
% 0.76/1.52 ) ) ] )
% 0.76/1.52 , 1, clause( 11, [ theorem( implies( or( X, X ), X ) ) ] )
% 0.76/1.52 , 0, substitution( 0, [ :=( X, X ), :=( Y, or( X, X ) )] ), substitution( 1
% 0.76/1.52 , [ :=( X, X )] )).
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 subsumption(
% 0.76/1.52 clause( 17, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 0.76/1.52 , clause( 14986, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 0.76/1.52 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.76/1.52 1 )] ) ).
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 resolution(
% 0.76/1.52 clause( 14988, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X )
% 0.76/1.52 ) ) ] )
% 0.76/1.52 , clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y
% 0.76/1.52 ) ) ] )
% 0.76/1.52 , 1, clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.76/1.52 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [ :=( X
% 0.76/1.52 , implies( Y, X ) )] )).
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 subsumption(
% 0.76/1.52 clause( 21, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X ) )
% 0.76/1.52 ) ] )
% 0.76/1.52 , clause( 14988, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X
% 0.76/1.52 ) ) ) ] )
% 0.76/1.52 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.76/1.52 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 resolution(
% 0.76/1.52 clause( 14990, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 0.76/1.52 , clause( 21, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X )
% 0.76/1.52 ) ) ] )
% 0.76/1.52 , 2, clause( 2, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 0.76/1.52 , 0, substitution( 0, [ :=( X, or( X, Y ) ), :=( Y, or( Y, X ) )] ),
% 0.76/1.52 substitution( 1, [ :=( X, Y ), :=( Y, X )] )).
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 subsumption(
% 0.76/1.52 clause( 73, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 0.76/1.52 , clause( 14990, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 0.76/1.52 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.76/1.52 ), ==>( 1, 1 )] ) ).
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 resolution(
% 0.76/1.52 clause( 14991, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y ) )
% 0.76/1.52 , X ) ) ) ] )
% 0.76/1.52 , clause( 21, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X )
% 0.76/1.52 ) ) ] )
% 0.76/1.52 , 1, clause( 10, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 0.76/1.52 , 0, substitution( 0, [ :=( X, X ), :=( Y, implies( Y, or( Z, Y ) ) )] ),
% 0.76/1.52 substitution( 1, [ :=( X, Y ), :=( Y, Z )] )).
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 subsumption(
% 0.76/1.52 clause( 75, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y ) ), X
% 0.76/1.52 ) ) ) ] )
% 0.76/1.52 , clause( 14991, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y )
% 0.76/1.52 ), X ) ) ) ] )
% 0.76/1.52 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.76/1.52 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 paramod(
% 0.76/1.52 clause( 14994, [ ~( theorem( implies( X, Y ) ) ), theorem( or( Y, not( X )
% 0.76/1.52 ) ) ] )
% 0.76/1.52 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.76/1.52 , 0, clause( 73, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 0.76/1.52 , 1, 2, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [
% 0.76/1.52 :=( X, Y ), :=( Y, not( X ) )] )).
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 subsumption(
% 0.76/1.52 clause( 101, [ theorem( or( Y, not( X ) ) ), ~( theorem( implies( X, Y ) )
% 0.76/1.52 ) ] )
% 0.76/1.52 , clause( 14994, [ ~( theorem( implies( X, Y ) ) ), theorem( or( Y, not( X
% 0.76/1.52 ) ) ) ] )
% 0.76/1.52 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.76/1.52 ), ==>( 1, 0 )] ) ).
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 paramod(
% 0.76/1.52 clause( 15000, [ axiom( implies( or( not( X ), or( Y, Z ) ), or( Y, implies(
% 0.76/1.52 X, Z ) ) ) ) ] )
% 0.76/1.52 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.76/1.52 , 0, clause( 3, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) )
% 0.76/1.52 ) ) ] )
% 0.76/1.52 , 0, 10, substitution( 0, [ :=( X, X ), :=( Y, Z )] ), substitution( 1, [
% 0.76/1.52 :=( X, not( X ) ), :=( Y, Y ), :=( Z, Z )] )).
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 paramod(
% 0.76/1.52 clause( 15003, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies(
% 0.76/1.52 X, Z ) ) ) ) ] )
% 0.76/1.52 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.76/1.52 , 0, clause( 15000, [ axiom( implies( or( not( X ), or( Y, Z ) ), or( Y,
% 0.76/1.52 implies( X, Z ) ) ) ) ] )
% 0.76/1.52 , 0, 2, substitution( 0, [ :=( X, X ), :=( Y, or( Y, Z ) )] ),
% 0.76/1.52 substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 subsumption(
% 0.76/1.52 clause( 110, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies( X
% 0.76/1.52 , Z ) ) ) ) ] )
% 0.76/1.52 , clause( 15003, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies(
% 0.76/1.52 X, Z ) ) ) ) ] )
% 0.76/1.52 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.76/1.52 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 resolution(
% 0.76/1.52 clause( 15004, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 0.76/1.52 , clause( 75, [ theorem( X ), ~( axiom( implies( implies( Y, or( Z, Y ) ),
% 0.76/1.52 X ) ) ) ] )
% 0.76/1.52 , 1, clause( 110, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y,
% 0.76/1.52 implies( X, Z ) ) ) ) ] )
% 0.76/1.52 , 0, substitution( 0, [ :=( X, or( X, implies( Y, Y ) ) ), :=( Y, Y ), :=(
% 0.76/1.52 Z, X )] ), substitution( 1, [ :=( X, Y ), :=( Y, X ), :=( Z, Y )] )).
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 subsumption(
% 0.76/1.52 clause( 13595, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 0.76/1.52 , clause( 15004, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 0.76/1.52 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.76/1.52 )] ) ).
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 resolution(
% 0.76/1.52 clause( 15005, [ theorem( implies( X, X ) ) ] )
% 0.76/1.52 , clause( 17, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 0.76/1.52 , 1, clause( 13595, [ theorem( or( X, implies( Y, Y ) ) ) ] )
% 0.76/1.52 , 0, substitution( 0, [ :=( X, implies( X, X ) )] ), substitution( 1, [
% 0.76/1.52 :=( X, implies( X, X ) ), :=( Y, X )] )).
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 subsumption(
% 0.76/1.52 clause( 13710, [ theorem( implies( X, X ) ) ] )
% 0.76/1.52 , clause( 15005, [ theorem( implies( X, X ) ) ] )
% 0.76/1.52 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 resolution(
% 0.76/1.52 clause( 15006, [ theorem( or( X, not( X ) ) ) ] )
% 0.76/1.52 , clause( 101, [ theorem( or( Y, not( X ) ) ), ~( theorem( implies( X, Y )
% 0.76/1.52 ) ) ] )
% 0.76/1.52 , 1, clause( 13710, [ theorem( implies( X, X ) ) ] )
% 0.76/1.52 , 0, substitution( 0, [ :=( X, X ), :=( Y, X )] ), substitution( 1, [ :=( X
% 0.76/1.52 , X )] )).
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 subsumption(
% 0.76/1.52 clause( 13735, [ theorem( or( X, not( X ) ) ) ] )
% 0.76/1.52 , clause( 15006, [ theorem( or( X, not( X ) ) ) ] )
% 0.76/1.52 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 paramod(
% 0.76/1.52 clause( 15008, [ theorem( implies( X, not( not( X ) ) ) ) ] )
% 0.76/1.52 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.76/1.52 , 0, clause( 13735, [ theorem( or( X, not( X ) ) ) ] )
% 0.76/1.52 , 0, 1, substitution( 0, [ :=( X, X ), :=( Y, not( not( X ) ) )] ),
% 0.76/1.52 substitution( 1, [ :=( X, not( X ) )] )).
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 subsumption(
% 0.76/1.52 clause( 13851, [ theorem( implies( X, not( not( X ) ) ) ) ] )
% 0.76/1.52 , clause( 15008, [ theorem( implies( X, not( not( X ) ) ) ) ] )
% 0.76/1.52 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 resolution(
% 0.76/1.52 clause( 15009, [ theorem( not( not( X ) ) ), ~( theorem( X ) ) ] )
% 0.76/1.52 , clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y
% 0.76/1.52 ) ) ] )
% 0.76/1.52 , 1, clause( 13851, [ theorem( implies( X, not( not( X ) ) ) ) ] )
% 0.76/1.52 , 0, substitution( 0, [ :=( X, not( not( X ) ) ), :=( Y, X )] ),
% 0.76/1.52 substitution( 1, [ :=( X, X )] )).
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 subsumption(
% 0.76/1.52 clause( 14500, [ theorem( not( not( X ) ) ), ~( theorem( X ) ) ] )
% 0.76/1.52 , clause( 15009, [ theorem( not( not( X ) ) ), ~( theorem( X ) ) ] )
% 0.76/1.52 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.76/1.52 1 )] ) ).
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 resolution(
% 0.76/1.52 clause( 15012, [ theorem( not( not( implies( X, not( not( X ) ) ) ) ) ) ]
% 0.76/1.52 )
% 0.76/1.52 , clause( 14500, [ theorem( not( not( X ) ) ), ~( theorem( X ) ) ] )
% 0.76/1.52 , 1, clause( 13851, [ theorem( implies( X, not( not( X ) ) ) ) ] )
% 0.76/1.52 , 0, substitution( 0, [ :=( X, implies( X, not( not( X ) ) ) )] ),
% 0.76/1.52 substitution( 1, [ :=( X, X )] )).
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 paramod(
% 0.76/1.52 clause( 15013, [ theorem( not( and( X, not( X ) ) ) ) ] )
% 0.76/1.52 , clause( 8, [ =( not( implies( X, not( Y ) ) ), and( X, Y ) ) ] )
% 0.76/1.52 , 0, clause( 15012, [ theorem( not( not( implies( X, not( not( X ) ) ) ) )
% 0.76/1.52 ) ] )
% 0.76/1.52 , 0, 2, substitution( 0, [ :=( X, X ), :=( Y, not( X ) )] ), substitution(
% 0.76/1.52 1, [ :=( X, X )] )).
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 subsumption(
% 0.76/1.52 clause( 14610, [ theorem( not( and( X, not( X ) ) ) ) ] )
% 0.76/1.52 , clause( 15013, [ theorem( not( and( X, not( X ) ) ) ) ] )
% 0.76/1.52 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 resolution(
% 0.76/1.52 clause( 15014, [] )
% 0.76/1.52 , clause( 9, [ ~( theorem( not( and( p, not( p ) ) ) ) ) ] )
% 0.76/1.52 , 0, clause( 14610, [ theorem( not( and( X, not( X ) ) ) ) ] )
% 0.76/1.52 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, p )] )).
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 subsumption(
% 0.76/1.52 clause( 14952, [] )
% 0.76/1.52 , clause( 15014, [] )
% 0.76/1.52 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 end.
% 0.76/1.52
% 0.76/1.52 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.76/1.52
% 0.76/1.52 Memory use:
% 0.76/1.52
% 0.76/1.52 space for terms: 228467
% 0.76/1.52 space for clauses: 713533
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 clauses generated: 33892
% 0.76/1.52 clauses kept: 14953
% 0.76/1.52 clauses selected: 384
% 0.76/1.52 clauses deleted: 25
% 0.76/1.52 clauses inuse deleted: 2
% 0.76/1.52
% 0.76/1.52 subsentry: 323464
% 0.76/1.52 literals s-matched: 158261
% 0.76/1.52 literals matched: 149326
% 0.76/1.52 full subsumption: 65524
% 0.76/1.52
% 0.76/1.52 checksum: -850201287
% 0.76/1.52
% 0.76/1.52
% 0.76/1.52 Bliksem ended
%------------------------------------------------------------------------------