TSTP Solution File: LCL215-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL215-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n025.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:49 EDT 2022
% Result : Unsatisfiable 0.73s 1.34s
% Output : Refutation 0.73s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LCL215-1 : TPTP v8.1.0. Released v1.1.0.
% 0.04/0.13 % Command : bliksem %s
% 0.12/0.34 % Computer : n025.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 18:51:56 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.73/1.34 *** allocated 10000 integers for termspace/termends
% 0.73/1.34 *** allocated 10000 integers for clauses
% 0.73/1.34 *** allocated 10000 integers for justifications
% 0.73/1.34 Bliksem 1.12
% 0.73/1.34
% 0.73/1.34
% 0.73/1.34 Automatic Strategy Selection
% 0.73/1.34
% 0.73/1.34 Clauses:
% 0.73/1.34 [
% 0.73/1.34 [ axiom( or( not( or( X, X ) ), X ) ) ],
% 0.73/1.34 [ axiom( or( not( X ), or( Y, X ) ) ) ],
% 0.73/1.34 [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ],
% 0.73/1.34 [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) ) ],
% 0.73/1.34 [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) ), or( Z, Y )
% 0.73/1.34 ) ) ) ],
% 0.73/1.34 [ theorem( X ), ~( axiom( X ) ) ],
% 0.73/1.34 [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~( theorem( Y ) ) ]
% 0.73/1.34 ,
% 0.73/1.34 [ theorem( or( not( X ), Y ) ), ~( axiom( or( not( X ), Z ) ) ), ~(
% 0.73/1.34 theorem( or( not( Z ), Y ) ) ) ],
% 0.73/1.34 [ ~( theorem( or( not( or( not( p ), q ) ), or( not( or( p, q ) ), q ) )
% 0.73/1.34 ) ) ]
% 0.73/1.34 ] .
% 0.73/1.34
% 0.73/1.34
% 0.73/1.34 percentage equality = 0.000000, percentage horn = 1.000000
% 0.73/1.34 This is a near-Horn, non-equality problem
% 0.73/1.34
% 0.73/1.34
% 0.73/1.34 Options Used:
% 0.73/1.34
% 0.73/1.34 useres = 1
% 0.73/1.34 useparamod = 0
% 0.73/1.34 useeqrefl = 0
% 0.73/1.34 useeqfact = 0
% 0.73/1.34 usefactor = 1
% 0.73/1.34 usesimpsplitting = 0
% 0.73/1.34 usesimpdemod = 0
% 0.73/1.34 usesimpres = 4
% 0.73/1.34
% 0.73/1.34 resimpinuse = 1000
% 0.73/1.34 resimpclauses = 20000
% 0.73/1.34 substype = standard
% 0.73/1.34 backwardsubs = 1
% 0.73/1.34 selectoldest = 5
% 0.73/1.34
% 0.73/1.34 litorderings [0] = split
% 0.73/1.34 litorderings [1] = liftord
% 0.73/1.34
% 0.73/1.34 termordering = none
% 0.73/1.34
% 0.73/1.34 litapriori = 1
% 0.73/1.34 termapriori = 0
% 0.73/1.34 litaposteriori = 0
% 0.73/1.34 termaposteriori = 0
% 0.73/1.34 demodaposteriori = 0
% 0.73/1.34 ordereqreflfact = 0
% 0.73/1.34
% 0.73/1.34 litselect = negative
% 0.73/1.34
% 0.73/1.34 maxweight = 30000
% 0.73/1.34 maxdepth = 30000
% 0.73/1.34 maxlength = 115
% 0.73/1.34 maxnrvars = 195
% 0.73/1.34 excuselevel = 0
% 0.73/1.34 increasemaxweight = 0
% 0.73/1.34
% 0.73/1.34 maxselected = 10000000
% 0.73/1.34 maxnrclauses = 10000000
% 0.73/1.34
% 0.73/1.34 showgenerated = 0
% 0.73/1.34 showkept = 0
% 0.73/1.34 showselected = 0
% 0.73/1.34 showdeleted = 0
% 0.73/1.34 showresimp = 1
% 0.73/1.34 showstatus = 2000
% 0.73/1.34
% 0.73/1.34 prologoutput = 1
% 0.73/1.34 nrgoals = 5000000
% 0.73/1.34 totalproof = 1
% 0.73/1.34
% 0.73/1.34 Symbols occurring in the translation:
% 0.73/1.34
% 0.73/1.34 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.73/1.34 . [1, 2] (w:1, o:25, a:1, s:1, b:0),
% 0.73/1.34 ! [4, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.73/1.34 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.73/1.34 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.73/1.34 or [40, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.73/1.34 not [41, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.73/1.34 axiom [42, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.73/1.34 theorem [46, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.73/1.34 p [49, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.73/1.34 q [50, 0] (w:1, o:16, a:1, s:1, b:0).
% 0.73/1.34
% 0.73/1.34
% 0.73/1.34 Starting Search:
% 0.73/1.34
% 0.73/1.34 Resimplifying inuse:
% 0.73/1.34 Done
% 0.73/1.34
% 0.73/1.34
% 0.73/1.34 Intermediate Status:
% 0.73/1.34 Generated: 3552
% 0.73/1.34 Kept: 2003
% 0.73/1.34 Inuse: 579
% 0.73/1.34 Deleted: 7
% 0.73/1.34 Deletedinuse: 0
% 0.73/1.34
% 0.73/1.34 Resimplifying inuse:
% 0.73/1.34 Done
% 0.73/1.34
% 0.73/1.34 Resimplifying inuse:
% 0.73/1.34 Done
% 0.73/1.34
% 0.73/1.34
% 0.73/1.34 Intermediate Status:
% 0.73/1.34 Generated: 7011
% 0.73/1.34 Kept: 4004
% 0.73/1.34 Inuse: 1159
% 0.73/1.34 Deleted: 22
% 0.73/1.34 Deletedinuse: 0
% 0.73/1.34
% 0.73/1.34 Resimplifying inuse:
% 0.73/1.34 Done
% 0.73/1.34
% 0.73/1.34 Resimplifying inuse:
% 0.73/1.34 Done
% 0.73/1.34
% 0.73/1.34
% 0.73/1.34 Intermediate Status:
% 0.73/1.34 Generated: 10535
% 0.73/1.34 Kept: 6005
% 0.73/1.34 Inuse: 1749
% 0.73/1.34 Deleted: 36
% 0.73/1.34 Deletedinuse: 0
% 0.73/1.34
% 0.73/1.34 Resimplifying inuse:
% 0.73/1.34 Done
% 0.73/1.34
% 0.73/1.34
% 0.73/1.34 Bliksems!, er is een bewijs:
% 0.73/1.34 % SZS status Unsatisfiable
% 0.73/1.34 % SZS output start Refutation
% 0.73/1.34
% 0.73/1.34 clause( 0, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.73/1.34 .
% 0.73/1.34 clause( 2, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.73/1.34 .
% 0.73/1.34 clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) )
% 0.73/1.34 ] )
% 0.73/1.34 .
% 0.73/1.34 clause( 4, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) ), or(
% 0.73/1.34 Z, Y ) ) ) ) ] )
% 0.73/1.34 .
% 0.73/1.34 clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.73/1.34 .
% 0.73/1.34 clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X ) )
% 0.73/1.34 ) ] )
% 0.73/1.34 .
% 0.73/1.34 clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y ) )
% 0.73/1.34 ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 0.73/1.34 .
% 0.73/1.34 clause( 8, [ ~( theorem( or( not( or( not( p ), q ) ), or( not( or( p, q )
% 0.73/1.34 ), q ) ) ) ) ] )
% 0.73/1.34 .
% 0.73/1.34 clause( 10, [ theorem( or( not( or( X, X ) ), X ) ) ] )
% 0.73/1.34 .
% 0.73/1.34 clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z )
% 0.73/1.34 ) ) ) ] )
% 0.73/1.34 .
% 0.73/1.34 clause( 27, [ theorem( or( not( or( X, Y ) ), or( X, Z ) ) ), ~( theorem(
% 0.73/1.34 or( not( Y ), Z ) ) ) ] )
% 0.73/1.34 .
% 0.73/1.34 clause( 34, [ theorem( or( not( or( not( X ), Y ) ), Z ) ), ~( theorem( or(
% 0.73/1.34 not( or( not( or( T, X ) ), or( T, Y ) ) ), Z ) ) ) ] )
% 0.73/1.34 .
% 0.73/1.34 clause( 36, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 0.73/1.34 or( Y, X ) ), Z ) ) ) ] )
% 0.73/1.34 .
% 0.73/1.34 clause( 90, [ theorem( or( not( or( X, or( Y, Y ) ) ), or( X, Y ) ) ) ] )
% 0.73/1.34 .
% 0.73/1.34 clause( 665, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( Y, X ) )
% 0.73/1.34 , Y ) ) ) ] )
% 0.73/1.34 .
% 0.73/1.34 clause( 3146, [ theorem( or( not( or( X, not( Y ) ) ), or( not( or( X, Y )
% 0.73/1.34 ), X ) ) ) ] )
% 0.73/1.34 .
% 0.73/1.34 clause( 3156, [ theorem( or( not( or( X, Y ) ), or( not( or( X, not( Y ) )
% 0.73/1.34 ), X ) ) ) ] )
% 0.73/1.34 .
% 0.73/1.34 clause( 6195, [ theorem( or( not( or( X, Y ) ), or( not( or( Y, not( X ) )
% 0.73/1.34 ), Y ) ) ) ] )
% 0.73/1.34 .
% 0.73/1.34 clause( 6213, [ theorem( or( not( or( X, not( Y ) ) ), or( not( or( Y, X )
% 0.73/1.34 ), X ) ) ) ] )
% 0.73/1.34 .
% 0.73/1.34 clause( 6217, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( X, Y )
% 0.73/1.34 ), Y ) ) ) ] )
% 0.73/1.34 .
% 0.73/1.34 clause( 6226, [] )
% 0.73/1.34 .
% 0.73/1.34
% 0.73/1.34
% 0.73/1.34 % SZS output end Refutation
% 0.73/1.34 found a proof!
% 0.73/1.34
% 0.73/1.34 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.73/1.34
% 0.73/1.34 initialclauses(
% 0.73/1.34 [ clause( 6228, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.73/1.34 , clause( 6229, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 0.73/1.34 , clause( 6230, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.73/1.34 , clause( 6231, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z )
% 0.73/1.34 ) ) ) ] )
% 0.73/1.34 , clause( 6232, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X )
% 0.73/1.34 ), or( Z, Y ) ) ) ) ] )
% 0.73/1.34 , clause( 6233, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.73/1.34 , clause( 6234, [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~( theorem(
% 0.73/1.34 Y ) ) ] )
% 0.73/1.34 , clause( 6235, [ theorem( or( not( X ), Y ) ), ~( axiom( or( not( X ), Z )
% 0.73/1.34 ) ), ~( theorem( or( not( Z ), Y ) ) ) ] )
% 0.73/1.34 , clause( 6236, [ ~( theorem( or( not( or( not( p ), q ) ), or( not( or( p
% 0.73/1.34 , q ) ), q ) ) ) ) ] )
% 0.73/1.34 ] ).
% 0.73/1.34
% 0.73/1.34
% 0.73/1.34
% 0.73/1.34 subsumption(
% 0.73/1.34 clause( 0, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.73/1.34 , clause( 6228, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.73/1.34 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.34
% 0.73/1.34
% 0.73/1.34 subsumption(
% 0.73/1.34 clause( 2, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.73/1.34 , clause( 6230, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.73/1.34 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.73/1.34 )] ) ).
% 0.73/1.34
% 0.73/1.34
% 0.73/1.34 subsumption(
% 0.73/1.34 clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) )
% 0.73/1.34 ] )
% 0.73/1.34 , clause( 6231, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z )
% 0.73/1.34 ) ) ) ] )
% 0.73/1.34 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.73/1.34 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.34
% 0.73/1.34
% 0.73/1.34 subsumption(
% 0.73/1.34 clause( 4, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) ), or(
% 0.73/1.34 Z, Y ) ) ) ) ] )
% 0.73/1.34 , clause( 6232, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X )
% 0.73/1.34 ), or( Z, Y ) ) ) ) ] )
% 0.73/1.34 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.73/1.34 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.34
% 0.73/1.34
% 0.73/1.34 subsumption(
% 0.73/1.34 clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.73/1.34 , clause( 6233, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.73/1.34 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.73/1.34 1 )] ) ).
% 0.73/1.34
% 0.73/1.34
% 0.73/1.34 subsumption(
% 0.73/1.34 clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X ) )
% 0.73/1.34 ) ] )
% 0.73/1.34 , clause( 6234, [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~( theorem(
% 0.73/1.34 Y ) ) ] )
% 0.73/1.34 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.73/1.34 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.73/1.34
% 0.73/1.34
% 0.73/1.34 subsumption(
% 0.73/1.34 clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y ) )
% 0.73/1.34 ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 0.73/1.34 , clause( 6235, [ theorem( or( not( X ), Y ) ), ~( axiom( or( not( X ), Z )
% 0.73/1.34 ) ), ~( theorem( or( not( Z ), Y ) ) ) ] )
% 0.73/1.34 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.73/1.34 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.73/1.34
% 0.73/1.34
% 0.73/1.34 subsumption(
% 0.73/1.34 clause( 8, [ ~( theorem( or( not( or( not( p ), q ) ), or( not( or( p, q )
% 0.73/1.34 ), q ) ) ) ) ] )
% 0.73/1.34 , clause( 6236, [ ~( theorem( or( not( or( not( p ), q ) ), or( not( or( p
% 0.73/1.34 , q ) ), q ) ) ) ) ] )
% 0.73/1.34 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.34
% 0.73/1.34
% 0.73/1.34 resolution(
% 0.73/1.34 clause( 6237, [ theorem( or( not( or( X, X ) ), X ) ) ] )
% 0.73/1.34 , clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.73/1.34 , 1, clause( 0, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.73/1.34 , 0, substitution( 0, [ :=( X, or( not( or( X, X ) ), X ) )] ),
% 0.73/1.34 substitution( 1, [ :=( X, X )] )).
% 0.73/1.34
% 0.73/1.34
% 0.73/1.34 subsumption(
% 0.73/1.34 clause( 10, [ theorem( or( not( or( X, X ) ), X ) ) ] )
% 0.73/1.34 , clause( 6237, [ theorem( or( not( or( X, X ) ), X ) ) ] )
% 0.73/1.34 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.34
% 0.73/1.34
% 0.73/1.34 resolution(
% 0.73/1.34 clause( 6238, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z
% 0.73/1.34 ) ) ) ) ] )
% 0.73/1.34 , clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X )
% 0.73/1.34 ) ) ] )
% 0.73/1.34 , 2, clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z )
% 0.73/1.34 ) ) ) ] )
% 0.73/1.34 , 0, substitution( 0, [ :=( X, or( X, or( Y, Z ) ) ), :=( Y, or( Y, or( X,
% 0.73/1.34 Z ) ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, X ), :=( Z, Z )] )).
% 0.73/1.34
% 0.73/1.34
% 0.73/1.34 subsumption(
% 0.73/1.34 clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z )
% 0.73/1.34 ) ) ) ] )
% 0.73/1.34 , clause( 6238, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X
% 0.73/1.34 , Z ) ) ) ) ] )
% 0.73/1.34 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.73/1.34 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.73/1.34
% 0.73/1.34
% 0.73/1.34 resolution(
% 0.73/1.34 clause( 6239, [ theorem( or( not( or( X, Y ) ), or( X, Z ) ) ), ~( theorem(
% 0.73/1.34 or( not( Y ), Z ) ) ) ] )
% 0.73/1.34 , clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X )
% 0.73/1.34 ) ) ] )
% 0.73/1.34 , 2, clause( 4, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X )
% 0.73/1.34 ), or( Z, Y ) ) ) ) ] )
% 0.73/1.34 , 0, substitution( 0, [ :=( X, or( not( or( X, Y ) ), or( X, Z ) ) ), :=( Y
% 0.73/1.34 , or( not( Y ), Z ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, Z ), :=(
% 0.73/1.34 Z, X )] )).
% 0.73/1.34
% 0.73/1.34
% 0.73/1.34 subsumption(
% 0.73/1.34 clause( 27, [ theorem( or( not( or( X, Y ) ), or( X, Z ) ) ), ~( theorem(
% 0.73/1.34 or( not( Y ), Z ) ) ) ] )
% 0.73/1.34 , clause( 6239, [ theorem( or( not( or( X, Y ) ), or( X, Z ) ) ), ~(
% 0.73/1.34 theorem( or( not( Y ), Z ) ) ) ] )
% 0.73/1.34 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.73/1.34 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.73/1.34
% 0.73/1.34
% 0.73/1.34 resolution(
% 0.73/1.34 clause( 6240, [ theorem( or( not( or( not( X ), Y ) ), Z ) ), ~( theorem(
% 0.73/1.34 or( not( or( not( or( T, X ) ), or( T, Y ) ) ), Z ) ) ) ] )
% 0.73/1.34 , clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y )
% 0.73/1.34 ) ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 0.73/1.34 , 2, clause( 4, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X )
% 0.73/1.34 ), or( Z, Y ) ) ) ) ] )
% 0.73/1.34 , 0, substitution( 0, [ :=( X, or( not( X ), Y ) ), :=( Y, Z ), :=( Z, or(
% 0.73/1.34 not( or( T, X ) ), or( T, Y ) ) )] ), substitution( 1, [ :=( X, X ), :=(
% 0.73/1.34 Y, Y ), :=( Z, T )] )).
% 0.73/1.34
% 0.73/1.34
% 0.73/1.34 subsumption(
% 0.73/1.34 clause( 34, [ theorem( or( not( or( not( X ), Y ) ), Z ) ), ~( theorem( or(
% 0.73/1.34 not( or( not( or( T, X ) ), or( T, Y ) ) ), Z ) ) ) ] )
% 0.73/1.34 , clause( 6240, [ theorem( or( not( or( not( X ), Y ) ), Z ) ), ~( theorem(
% 0.73/1.34 or( not( or( not( or( T, X ) ), or( T, Y ) ) ), Z ) ) ) ] )
% 0.73/1.34 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.73/1.34 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.73/1.34
% 0.73/1.34
% 0.73/1.34 resolution(
% 0.73/1.34 clause( 6241, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 0.73/1.34 or( Y, X ) ), Z ) ) ) ] )
% 0.73/1.34 , clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y )
% 0.73/1.34 ) ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 0.73/1.34 , 2, clause( 2, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.73/1.34 , 0, substitution( 0, [ :=( X, or( X, Y ) ), :=( Y, Z ), :=( Z, or( Y, X )
% 0.73/1.34 )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.73/1.34
% 0.73/1.34
% 0.73/1.34 subsumption(
% 0.73/1.34 clause( 36, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 0.73/1.34 or( Y, X ) ), Z ) ) ) ] )
% 0.73/1.34 , clause( 6241, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or(
% 0.73/1.34 not( or( Y, X ) ), Z ) ) ) ] )
% 0.73/1.34 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.73/1.34 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.73/1.34
% 0.73/1.34
% 0.73/1.34 resolution(
% 0.73/1.34 clause( 6242, [ theorem( or( not( or( X, or( Y, Y ) ) ), or( X, Y ) ) ) ]
% 0.73/1.34 )
% 0.73/1.34 , clause( 27, [ theorem( or( not( or( X, Y ) ), or( X, Z ) ) ), ~( theorem(
% 0.73/1.34 or( not( Y ), Z ) ) ) ] )
% 0.73/1.34 , 1, clause( 10, [ theorem( or( not( or( X, X ) ), X ) ) ] )
% 0.73/1.34 , 0, substitution( 0, [ :=( X, X ), :=( Y, or( Y, Y ) ), :=( Z, Y )] ),
% 0.73/1.34 substitution( 1, [ :=( X, Y )] )).
% 0.73/1.34
% 0.73/1.34
% 0.73/1.34 subsumption(
% 0.73/1.34 clause( 90, [ theorem( or( not( or( X, or( Y, Y ) ) ), or( X, Y ) ) ) ] )
% 0.73/1.34 , clause( 6242, [ theorem( or( not( or( X, or( Y, Y ) ) ), or( X, Y ) ) ) ]
% 0.73/1.34 )
% 0.73/1.34 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.73/1.34 )] ) ).
% 0.73/1.34
% 0.73/1.34
% 0.73/1.34 resolution(
% 0.73/1.34 clause( 6243, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( Y, X )
% 0.73/1.34 ), Y ) ) ) ] )
% 0.73/1.34 , clause( 34, [ theorem( or( not( or( not( X ), Y ) ), Z ) ), ~( theorem(
% 0.73/1.34 or( not( or( not( or( T, X ) ), or( T, Y ) ) ), Z ) ) ) ] )
% 0.73/1.34 , 1, clause( 90, [ theorem( or( not( or( X, or( Y, Y ) ) ), or( X, Y ) ) )
% 0.73/1.34 ] )
% 0.73/1.34 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, or( not( or( Y, X )
% 0.73/1.34 ), Y ) ), :=( T, Y )] ), substitution( 1, [ :=( X, not( or( Y, X ) ) ),
% 0.73/1.34 :=( Y, Y )] )).
% 0.73/1.34
% 0.73/1.34
% 0.73/1.34 subsumption(
% 0.73/1.34 clause( 665, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( Y, X ) )
% 0.73/1.34 , Y ) ) ) ] )
% 0.73/1.34 , clause( 6243, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( Y, X
% 0.73/1.34 ) ), Y ) ) ) ] )
% 0.73/1.34 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.73/1.34 )] ) ).
% 0.73/1.34
% 0.73/1.34
% 0.73/1.34 resolution(
% 0.73/1.34 clause( 6244, [ theorem( or( not( or( X, not( Y ) ) ), or( not( or( X, Y )
% 0.73/1.34 ), X ) ) ) ] )
% 0.73/1.34 , clause( 36, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 0.73/1.34 or( Y, X ) ), Z ) ) ) ] )
% 0.73/1.34 , 1, clause( 665, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( Y,
% 0.73/1.34 X ) ), Y ) ) ) ] )
% 0.73/1.34 , 0, substitution( 0, [ :=( X, X ), :=( Y, not( Y ) ), :=( Z, or( not( or(
% 0.73/1.34 X, Y ) ), X ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, X )] )).
% 0.73/1.34
% 0.73/1.34
% 0.73/1.34 subsumption(
% 0.73/1.34 clause( 3146, [ theorem( or( not( or( X, not( Y ) ) ), or( not( or( X, Y )
% 0.73/1.34 ), X ) ) ) ] )
% 0.73/1.34 , clause( 6244, [ theorem( or( not( or( X, not( Y ) ) ), or( not( or( X, Y
% 0.73/1.34 ) ), X ) ) ) ] )
% 0.73/1.34 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.73/1.34 )] ) ).
% 0.73/1.34
% 0.73/1.34
% 0.73/1.34 resolution(
% 0.73/1.34 clause( 6245, [ theorem( or( not( or( X, Y ) ), or( not( or( X, not( Y ) )
% 0.73/1.34 ), X ) ) ) ] )
% 0.73/1.34 , clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z
% 0.73/1.34 ) ) ) ) ] )
% 0.73/1.34 , 1, clause( 3146, [ theorem( or( not( or( X, not( Y ) ) ), or( not( or( X
% 0.73/1.34 , Y ) ), X ) ) ) ] )
% 0.73/1.34 , 0, substitution( 0, [ :=( X, not( or( X, Y ) ) ), :=( Y, not( or( X, not(
% 0.73/1.34 Y ) ) ) ), :=( Z, X )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )
% 0.73/1.34 ).
% 0.73/1.34
% 0.73/1.34
% 0.73/1.34 subsumption(
% 0.73/1.34 clause( 3156, [ theorem( or( not( or( X, Y ) ), or( not( or( X, not( Y ) )
% 0.73/1.34 ), X ) ) ) ] )
% 0.73/1.34 , clause( 6245, [ theorem( or( not( or( X, Y ) ), or( not( or( X, not( Y )
% 0.73/1.34 ) ), X ) ) ) ] )
% 0.73/1.34 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.73/1.34 )] ) ).
% 0.73/1.34
% 0.73/1.34
% 0.73/1.34 resolution(
% 0.73/1.34 clause( 6246, [ theorem( or( not( or( X, Y ) ), or( not( or( Y, not( X ) )
% 0.73/1.34 ), Y ) ) ) ] )
% 0.73/1.34 , clause( 36, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 0.73/1.34 or( Y, X ) ), Z ) ) ) ] )
% 0.73/1.34 , 1, clause( 3156, [ theorem( or( not( or( X, Y ) ), or( not( or( X, not( Y
% 0.73/1.34 ) ) ), X ) ) ) ] )
% 0.73/1.34 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, or( not( or( Y, not(
% 0.73/1.34 X ) ) ), Y ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, X )] )).
% 0.73/1.34
% 0.73/1.34
% 0.73/1.34 subsumption(
% 0.73/1.34 clause( 6195, [ theorem( or( not( or( X, Y ) ), or( not( or( Y, not( X ) )
% 0.73/1.34 ), Y ) ) ) ] )
% 0.73/1.34 , clause( 6246, [ theorem( or( not( or( X, Y ) ), or( not( or( Y, not( X )
% 0.73/1.34 ) ), Y ) ) ) ] )
% 0.73/1.34 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.73/1.34 )] ) ).
% 0.73/1.34
% 0.73/1.34
% 0.73/1.34 resolution(
% 0.73/1.34 clause( 6247, [ theorem( or( not( or( X, not( Y ) ) ), or( not( or( Y, X )
% 0.73/1.34 ), X ) ) ) ] )
% 0.73/1.34 , clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z
% 0.73/1.34 ) ) ) ) ] )
% 0.73/1.34 , 1, clause( 6195, [ theorem( or( not( or( X, Y ) ), or( not( or( Y, not( X
% 0.73/1.34 ) ) ), Y ) ) ) ] )
% 0.73/1.34 , 0, substitution( 0, [ :=( X, not( or( X, not( Y ) ) ) ), :=( Y, not( or(
% 0.73/1.34 Y, X ) ) ), :=( Z, X )] ), substitution( 1, [ :=( X, Y ), :=( Y, X )] )
% 0.73/1.34 ).
% 0.73/1.34
% 0.73/1.34
% 0.73/1.34 subsumption(
% 0.73/1.34 clause( 6213, [ theorem( or( not( or( X, not( Y ) ) ), or( not( or( Y, X )
% 0.73/1.34 ), X ) ) ) ] )
% 0.73/1.34 , clause( 6247, [ theorem( or( not( or( X, not( Y ) ) ), or( not( or( Y, X
% 0.73/1.34 ) ), X ) ) ) ] )
% 0.73/1.34 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.73/1.34 )] ) ).
% 0.73/1.34
% 0.73/1.34
% 0.73/1.34 resolution(
% 0.73/1.34 clause( 6248, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( X, Y )
% 0.73/1.34 ), Y ) ) ) ] )
% 0.73/1.34 , clause( 36, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 0.73/1.34 or( Y, X ) ), Z ) ) ) ] )
% 0.73/1.34 , 1, clause( 6213, [ theorem( or( not( or( X, not( Y ) ) ), or( not( or( Y
% 0.73/1.34 , X ) ), X ) ) ) ] )
% 0.73/1.34 , 0, substitution( 0, [ :=( X, not( X ) ), :=( Y, Y ), :=( Z, or( not( or(
% 0.73/1.34 X, Y ) ), Y ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, X )] )).
% 0.73/1.34
% 0.73/1.34
% 0.73/1.34 subsumption(
% 0.73/1.34 clause( 6217, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( X, Y )
% 0.73/1.34 ), Y ) ) ) ] )
% 0.73/1.34 , clause( 6248, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( X, Y
% 0.73/1.34 ) ), Y ) ) ) ] )
% 0.73/1.34 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.73/1.34 )] ) ).
% 0.73/1.34
% 0.73/1.34
% 0.73/1.34 resolution(
% 0.73/1.34 clause( 6249, [] )
% 0.73/1.34 , clause( 8, [ ~( theorem( or( not( or( not( p ), q ) ), or( not( or( p, q
% 0.73/1.34 ) ), q ) ) ) ) ] )
% 0.73/1.34 , 0, clause( 6217, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( X
% 0.73/1.34 , Y ) ), Y ) ) ) ] )
% 0.73/1.34 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, p ), :=( Y, q )] )
% 0.73/1.34 ).
% 0.73/1.34
% 0.73/1.34
% 0.73/1.34 subsumption(
% 0.73/1.34 clause( 6226, [] )
% 0.73/1.34 , clause( 6249, [] )
% 0.73/1.34 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.73/1.34
% 0.73/1.34
% 0.73/1.34 end.
% 0.73/1.34
% 0.73/1.34 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.73/1.34
% 0.73/1.34 Memory use:
% 0.73/1.34
% 0.73/1.34 space for terms: 101741
% 0.73/1.34 space for clauses: 481769
% 0.73/1.34
% 0.73/1.34
% 0.73/1.34 clauses generated: 10926
% 0.73/1.34 clauses kept: 6227
% 0.73/1.34 clauses selected: 1812
% 0.73/1.34 clauses deleted: 42
% 0.73/1.34 clauses inuse deleted: 0
% 0.73/1.34
% 0.73/1.34 subsentry: 4933
% 0.73/1.34 literals s-matched: 4933
% 0.73/1.34 literals matched: 4933
% 0.73/1.34 full subsumption: 0
% 0.73/1.34
% 0.73/1.34 checksum: 258232877
% 0.73/1.34
% 0.73/1.34
% 0.73/1.34 Bliksem ended
%------------------------------------------------------------------------------