TSTP Solution File: LCL213-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL213-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n015.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:47 EDT 2022
% Result : Unsatisfiable 0.81s 1.39s
% Output : Refutation 0.81s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL213-1 : TPTP v8.1.0. Released v1.1.0.
% 0.06/0.12 % Command : bliksem %s
% 0.13/0.33 % Computer : n015.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % DateTime : Mon Jul 4 09:26:46 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.81/1.39 *** allocated 10000 integers for termspace/termends
% 0.81/1.39 *** allocated 10000 integers for clauses
% 0.81/1.39 *** allocated 10000 integers for justifications
% 0.81/1.39 Bliksem 1.12
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 Automatic Strategy Selection
% 0.81/1.39
% 0.81/1.39 Clauses:
% 0.81/1.39 [
% 0.81/1.39 [ axiom( or( not( or( X, X ) ), X ) ) ],
% 0.81/1.39 [ axiom( or( not( X ), or( Y, X ) ) ) ],
% 0.81/1.39 [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ],
% 0.81/1.39 [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) ) ],
% 0.81/1.39 [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) ), or( Z, Y )
% 0.81/1.39 ) ) ) ],
% 0.81/1.39 [ theorem( X ), ~( axiom( X ) ) ],
% 0.81/1.39 [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~( theorem( Y ) ) ]
% 0.81/1.39 ,
% 0.81/1.39 [ theorem( or( not( X ), Y ) ), ~( axiom( or( not( X ), Z ) ) ), ~(
% 0.81/1.39 theorem( or( not( Z ), Y ) ) ) ],
% 0.81/1.39 [ ~( theorem( or( not( or( not( p ), q ) ), or( not( or( not( not( p ) )
% 0.81/1.39 , q ) ), q ) ) ) ) ]
% 0.81/1.39 ] .
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 percentage equality = 0.000000, percentage horn = 1.000000
% 0.81/1.39 This is a near-Horn, non-equality problem
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 Options Used:
% 0.81/1.39
% 0.81/1.39 useres = 1
% 0.81/1.39 useparamod = 0
% 0.81/1.39 useeqrefl = 0
% 0.81/1.39 useeqfact = 0
% 0.81/1.39 usefactor = 1
% 0.81/1.39 usesimpsplitting = 0
% 0.81/1.39 usesimpdemod = 0
% 0.81/1.39 usesimpres = 4
% 0.81/1.39
% 0.81/1.39 resimpinuse = 1000
% 0.81/1.39 resimpclauses = 20000
% 0.81/1.39 substype = standard
% 0.81/1.39 backwardsubs = 1
% 0.81/1.39 selectoldest = 5
% 0.81/1.39
% 0.81/1.39 litorderings [0] = split
% 0.81/1.39 litorderings [1] = liftord
% 0.81/1.39
% 0.81/1.39 termordering = none
% 0.81/1.39
% 0.81/1.39 litapriori = 1
% 0.81/1.39 termapriori = 0
% 0.81/1.39 litaposteriori = 0
% 0.81/1.39 termaposteriori = 0
% 0.81/1.39 demodaposteriori = 0
% 0.81/1.39 ordereqreflfact = 0
% 0.81/1.39
% 0.81/1.39 litselect = negative
% 0.81/1.39
% 0.81/1.39 maxweight = 30000
% 0.81/1.39 maxdepth = 30000
% 0.81/1.39 maxlength = 115
% 0.81/1.39 maxnrvars = 195
% 0.81/1.39 excuselevel = 0
% 0.81/1.39 increasemaxweight = 0
% 0.81/1.39
% 0.81/1.39 maxselected = 10000000
% 0.81/1.39 maxnrclauses = 10000000
% 0.81/1.39
% 0.81/1.39 showgenerated = 0
% 0.81/1.39 showkept = 0
% 0.81/1.39 showselected = 0
% 0.81/1.39 showdeleted = 0
% 0.81/1.39 showresimp = 1
% 0.81/1.39 showstatus = 2000
% 0.81/1.39
% 0.81/1.39 prologoutput = 1
% 0.81/1.39 nrgoals = 5000000
% 0.81/1.39 totalproof = 1
% 0.81/1.39
% 0.81/1.39 Symbols occurring in the translation:
% 0.81/1.39
% 0.81/1.39 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.81/1.39 . [1, 2] (w:1, o:25, a:1, s:1, b:0),
% 0.81/1.39 ! [4, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.81/1.39 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.81/1.39 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.81/1.39 or [40, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.81/1.39 not [41, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.81/1.39 axiom [42, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.81/1.39 theorem [46, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.81/1.39 p [49, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.81/1.39 q [50, 0] (w:1, o:16, a:1, s:1, b:0).
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 Starting Search:
% 0.81/1.39
% 0.81/1.39 Resimplifying inuse:
% 0.81/1.39 Done
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 Intermediate Status:
% 0.81/1.39 Generated: 3552
% 0.81/1.39 Kept: 2003
% 0.81/1.39 Inuse: 579
% 0.81/1.39 Deleted: 7
% 0.81/1.39 Deletedinuse: 0
% 0.81/1.39
% 0.81/1.39 Resimplifying inuse:
% 0.81/1.39 Done
% 0.81/1.39
% 0.81/1.39 Resimplifying inuse:
% 0.81/1.39 Done
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 Intermediate Status:
% 0.81/1.39 Generated: 7011
% 0.81/1.39 Kept: 4004
% 0.81/1.39 Inuse: 1159
% 0.81/1.39 Deleted: 22
% 0.81/1.39 Deletedinuse: 0
% 0.81/1.39
% 0.81/1.39 Resimplifying inuse:
% 0.81/1.39 Done
% 0.81/1.39
% 0.81/1.39 Resimplifying inuse:
% 0.81/1.39 Done
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 Intermediate Status:
% 0.81/1.39 Generated: 10535
% 0.81/1.39 Kept: 6005
% 0.81/1.39 Inuse: 1749
% 0.81/1.39 Deleted: 36
% 0.81/1.39 Deletedinuse: 0
% 0.81/1.39
% 0.81/1.39 Resimplifying inuse:
% 0.81/1.39 Done
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 Bliksems!, er is een bewijs:
% 0.81/1.39 % SZS status Unsatisfiable
% 0.81/1.39 % SZS output start Refutation
% 0.81/1.39
% 0.81/1.39 clause( 0, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.81/1.39 .
% 0.81/1.39 clause( 2, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.81/1.39 .
% 0.81/1.39 clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) )
% 0.81/1.39 ] )
% 0.81/1.39 .
% 0.81/1.39 clause( 4, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) ), or(
% 0.81/1.39 Z, Y ) ) ) ) ] )
% 0.81/1.39 .
% 0.81/1.39 clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.81/1.39 .
% 0.81/1.39 clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X ) )
% 0.81/1.39 ) ] )
% 0.81/1.39 .
% 0.81/1.39 clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y ) )
% 0.81/1.39 ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 0.81/1.39 .
% 0.81/1.39 clause( 8, [ ~( theorem( or( not( or( not( p ), q ) ), or( not( or( not(
% 0.81/1.39 not( p ) ), q ) ), q ) ) ) ) ] )
% 0.81/1.39 .
% 0.81/1.39 clause( 10, [ theorem( or( not( or( X, X ) ), X ) ) ] )
% 0.81/1.39 .
% 0.81/1.39 clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z )
% 0.81/1.39 ) ) ) ] )
% 0.81/1.39 .
% 0.81/1.39 clause( 27, [ theorem( or( not( or( X, Y ) ), or( X, Z ) ) ), ~( theorem(
% 0.81/1.39 or( not( Y ), Z ) ) ) ] )
% 0.81/1.39 .
% 0.81/1.39 clause( 34, [ theorem( or( not( or( not( X ), Y ) ), Z ) ), ~( theorem( or(
% 0.81/1.39 not( or( not( or( T, X ) ), or( T, Y ) ) ), Z ) ) ) ] )
% 0.81/1.39 .
% 0.81/1.39 clause( 36, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 0.81/1.39 or( Y, X ) ), Z ) ) ) ] )
% 0.81/1.39 .
% 0.81/1.39 clause( 90, [ theorem( or( not( or( X, or( Y, Y ) ) ), or( X, Y ) ) ) ] )
% 0.81/1.39 .
% 0.81/1.39 clause( 665, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( Y, X ) )
% 0.81/1.39 , Y ) ) ) ] )
% 0.81/1.39 .
% 0.81/1.39 clause( 3146, [ theorem( or( not( or( X, not( Y ) ) ), or( not( or( X, Y )
% 0.81/1.39 ), X ) ) ) ] )
% 0.81/1.39 .
% 0.81/1.39 clause( 3156, [ theorem( or( not( or( X, Y ) ), or( not( or( X, not( Y ) )
% 0.81/1.39 ), X ) ) ) ] )
% 0.81/1.39 .
% 0.81/1.39 clause( 6195, [ theorem( or( not( or( X, Y ) ), or( not( or( Y, not( X ) )
% 0.81/1.39 ), Y ) ) ) ] )
% 0.81/1.39 .
% 0.81/1.39 clause( 6213, [ theorem( or( not( or( X, not( Y ) ) ), or( not( or( Y, X )
% 0.81/1.39 ), X ) ) ) ] )
% 0.81/1.39 .
% 0.81/1.39 clause( 6217, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( X, Y )
% 0.81/1.39 ), Y ) ) ) ] )
% 0.81/1.39 .
% 0.81/1.39 clause( 6225, [ theorem( or( not( or( X, Y ) ), or( not( or( not( X ), Y )
% 0.81/1.39 ), Y ) ) ) ] )
% 0.81/1.39 .
% 0.81/1.39 clause( 6243, [] )
% 0.81/1.39 .
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 % SZS output end Refutation
% 0.81/1.39 found a proof!
% 0.81/1.39
% 0.81/1.39 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.81/1.39
% 0.81/1.39 initialclauses(
% 0.81/1.39 [ clause( 6245, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.81/1.39 , clause( 6246, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 0.81/1.39 , clause( 6247, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.81/1.39 , clause( 6248, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z )
% 0.81/1.39 ) ) ) ] )
% 0.81/1.39 , clause( 6249, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X )
% 0.81/1.39 ), or( Z, Y ) ) ) ) ] )
% 0.81/1.39 , clause( 6250, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.81/1.39 , clause( 6251, [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~( theorem(
% 0.81/1.39 Y ) ) ] )
% 0.81/1.39 , clause( 6252, [ theorem( or( not( X ), Y ) ), ~( axiom( or( not( X ), Z )
% 0.81/1.39 ) ), ~( theorem( or( not( Z ), Y ) ) ) ] )
% 0.81/1.39 , clause( 6253, [ ~( theorem( or( not( or( not( p ), q ) ), or( not( or(
% 0.81/1.39 not( not( p ) ), q ) ), q ) ) ) ) ] )
% 0.81/1.39 ] ).
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 subsumption(
% 0.81/1.39 clause( 0, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.81/1.39 , clause( 6245, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.81/1.39 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 subsumption(
% 0.81/1.39 clause( 2, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.81/1.39 , clause( 6247, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.81/1.39 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.81/1.39 )] ) ).
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 subsumption(
% 0.81/1.39 clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) )
% 0.81/1.39 ] )
% 0.81/1.39 , clause( 6248, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z )
% 0.81/1.39 ) ) ) ] )
% 0.81/1.39 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.81/1.39 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 subsumption(
% 0.81/1.39 clause( 4, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) ), or(
% 0.81/1.39 Z, Y ) ) ) ) ] )
% 0.81/1.39 , clause( 6249, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X )
% 0.81/1.39 ), or( Z, Y ) ) ) ) ] )
% 0.81/1.39 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.81/1.39 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 subsumption(
% 0.81/1.39 clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.81/1.39 , clause( 6250, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.81/1.39 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.81/1.39 1 )] ) ).
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 subsumption(
% 0.81/1.39 clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X ) )
% 0.81/1.39 ) ] )
% 0.81/1.39 , clause( 6251, [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~( theorem(
% 0.81/1.39 Y ) ) ] )
% 0.81/1.39 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.81/1.39 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 subsumption(
% 0.81/1.39 clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y ) )
% 0.81/1.39 ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 0.81/1.39 , clause( 6252, [ theorem( or( not( X ), Y ) ), ~( axiom( or( not( X ), Z )
% 0.81/1.39 ) ), ~( theorem( or( not( Z ), Y ) ) ) ] )
% 0.81/1.39 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.81/1.39 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 subsumption(
% 0.81/1.39 clause( 8, [ ~( theorem( or( not( or( not( p ), q ) ), or( not( or( not(
% 0.81/1.39 not( p ) ), q ) ), q ) ) ) ) ] )
% 0.81/1.39 , clause( 6253, [ ~( theorem( or( not( or( not( p ), q ) ), or( not( or(
% 0.81/1.39 not( not( p ) ), q ) ), q ) ) ) ) ] )
% 0.81/1.39 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 resolution(
% 0.81/1.39 clause( 6254, [ theorem( or( not( or( X, X ) ), X ) ) ] )
% 0.81/1.39 , clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.81/1.39 , 1, clause( 0, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.81/1.39 , 0, substitution( 0, [ :=( X, or( not( or( X, X ) ), X ) )] ),
% 0.81/1.39 substitution( 1, [ :=( X, X )] )).
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 subsumption(
% 0.81/1.39 clause( 10, [ theorem( or( not( or( X, X ) ), X ) ) ] )
% 0.81/1.39 , clause( 6254, [ theorem( or( not( or( X, X ) ), X ) ) ] )
% 0.81/1.39 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 resolution(
% 0.81/1.39 clause( 6255, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z
% 0.81/1.39 ) ) ) ) ] )
% 0.81/1.39 , clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X )
% 0.81/1.39 ) ) ] )
% 0.81/1.39 , 2, clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z )
% 0.81/1.39 ) ) ) ] )
% 0.81/1.39 , 0, substitution( 0, [ :=( X, or( X, or( Y, Z ) ) ), :=( Y, or( Y, or( X,
% 0.81/1.39 Z ) ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, X ), :=( Z, Z )] )).
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 subsumption(
% 0.81/1.39 clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z )
% 0.81/1.39 ) ) ) ] )
% 0.81/1.39 , clause( 6255, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X
% 0.81/1.39 , Z ) ) ) ) ] )
% 0.81/1.39 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.81/1.39 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 resolution(
% 0.81/1.39 clause( 6256, [ theorem( or( not( or( X, Y ) ), or( X, Z ) ) ), ~( theorem(
% 0.81/1.39 or( not( Y ), Z ) ) ) ] )
% 0.81/1.39 , clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X )
% 0.81/1.39 ) ) ] )
% 0.81/1.39 , 2, clause( 4, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X )
% 0.81/1.39 ), or( Z, Y ) ) ) ) ] )
% 0.81/1.39 , 0, substitution( 0, [ :=( X, or( not( or( X, Y ) ), or( X, Z ) ) ), :=( Y
% 0.81/1.39 , or( not( Y ), Z ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, Z ), :=(
% 0.81/1.39 Z, X )] )).
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 subsumption(
% 0.81/1.39 clause( 27, [ theorem( or( not( or( X, Y ) ), or( X, Z ) ) ), ~( theorem(
% 0.81/1.39 or( not( Y ), Z ) ) ) ] )
% 0.81/1.39 , clause( 6256, [ theorem( or( not( or( X, Y ) ), or( X, Z ) ) ), ~(
% 0.81/1.39 theorem( or( not( Y ), Z ) ) ) ] )
% 0.81/1.39 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.81/1.39 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 resolution(
% 0.81/1.39 clause( 6257, [ theorem( or( not( or( not( X ), Y ) ), Z ) ), ~( theorem(
% 0.81/1.39 or( not( or( not( or( T, X ) ), or( T, Y ) ) ), Z ) ) ) ] )
% 0.81/1.39 , clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y )
% 0.81/1.39 ) ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 0.81/1.39 , 2, clause( 4, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X )
% 0.81/1.39 ), or( Z, Y ) ) ) ) ] )
% 0.81/1.39 , 0, substitution( 0, [ :=( X, or( not( X ), Y ) ), :=( Y, Z ), :=( Z, or(
% 0.81/1.39 not( or( T, X ) ), or( T, Y ) ) )] ), substitution( 1, [ :=( X, X ), :=(
% 0.81/1.39 Y, Y ), :=( Z, T )] )).
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 subsumption(
% 0.81/1.39 clause( 34, [ theorem( or( not( or( not( X ), Y ) ), Z ) ), ~( theorem( or(
% 0.81/1.39 not( or( not( or( T, X ) ), or( T, Y ) ) ), Z ) ) ) ] )
% 0.81/1.39 , clause( 6257, [ theorem( or( not( or( not( X ), Y ) ), Z ) ), ~( theorem(
% 0.81/1.39 or( not( or( not( or( T, X ) ), or( T, Y ) ) ), Z ) ) ) ] )
% 0.81/1.39 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.81/1.39 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 resolution(
% 0.81/1.39 clause( 6258, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 0.81/1.39 or( Y, X ) ), Z ) ) ) ] )
% 0.81/1.39 , clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y )
% 0.81/1.39 ) ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 0.81/1.39 , 2, clause( 2, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.81/1.39 , 0, substitution( 0, [ :=( X, or( X, Y ) ), :=( Y, Z ), :=( Z, or( Y, X )
% 0.81/1.39 )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 subsumption(
% 0.81/1.39 clause( 36, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 0.81/1.39 or( Y, X ) ), Z ) ) ) ] )
% 0.81/1.39 , clause( 6258, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or(
% 0.81/1.39 not( or( Y, X ) ), Z ) ) ) ] )
% 0.81/1.39 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.81/1.39 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 resolution(
% 0.81/1.39 clause( 6259, [ theorem( or( not( or( X, or( Y, Y ) ) ), or( X, Y ) ) ) ]
% 0.81/1.39 )
% 0.81/1.39 , clause( 27, [ theorem( or( not( or( X, Y ) ), or( X, Z ) ) ), ~( theorem(
% 0.81/1.39 or( not( Y ), Z ) ) ) ] )
% 0.81/1.39 , 1, clause( 10, [ theorem( or( not( or( X, X ) ), X ) ) ] )
% 0.81/1.39 , 0, substitution( 0, [ :=( X, X ), :=( Y, or( Y, Y ) ), :=( Z, Y )] ),
% 0.81/1.39 substitution( 1, [ :=( X, Y )] )).
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 subsumption(
% 0.81/1.39 clause( 90, [ theorem( or( not( or( X, or( Y, Y ) ) ), or( X, Y ) ) ) ] )
% 0.81/1.39 , clause( 6259, [ theorem( or( not( or( X, or( Y, Y ) ) ), or( X, Y ) ) ) ]
% 0.81/1.39 )
% 0.81/1.39 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.81/1.39 )] ) ).
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 resolution(
% 0.81/1.39 clause( 6260, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( Y, X )
% 0.81/1.39 ), Y ) ) ) ] )
% 0.81/1.39 , clause( 34, [ theorem( or( not( or( not( X ), Y ) ), Z ) ), ~( theorem(
% 0.81/1.39 or( not( or( not( or( T, X ) ), or( T, Y ) ) ), Z ) ) ) ] )
% 0.81/1.39 , 1, clause( 90, [ theorem( or( not( or( X, or( Y, Y ) ) ), or( X, Y ) ) )
% 0.81/1.39 ] )
% 0.81/1.39 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, or( not( or( Y, X )
% 0.81/1.39 ), Y ) ), :=( T, Y )] ), substitution( 1, [ :=( X, not( or( Y, X ) ) ),
% 0.81/1.39 :=( Y, Y )] )).
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 subsumption(
% 0.81/1.39 clause( 665, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( Y, X ) )
% 0.81/1.39 , Y ) ) ) ] )
% 0.81/1.39 , clause( 6260, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( Y, X
% 0.81/1.39 ) ), Y ) ) ) ] )
% 0.81/1.39 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.81/1.39 )] ) ).
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 resolution(
% 0.81/1.39 clause( 6261, [ theorem( or( not( or( X, not( Y ) ) ), or( not( or( X, Y )
% 0.81/1.39 ), X ) ) ) ] )
% 0.81/1.39 , clause( 36, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 0.81/1.39 or( Y, X ) ), Z ) ) ) ] )
% 0.81/1.39 , 1, clause( 665, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( Y,
% 0.81/1.39 X ) ), Y ) ) ) ] )
% 0.81/1.39 , 0, substitution( 0, [ :=( X, X ), :=( Y, not( Y ) ), :=( Z, or( not( or(
% 0.81/1.39 X, Y ) ), X ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, X )] )).
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 subsumption(
% 0.81/1.39 clause( 3146, [ theorem( or( not( or( X, not( Y ) ) ), or( not( or( X, Y )
% 0.81/1.39 ), X ) ) ) ] )
% 0.81/1.39 , clause( 6261, [ theorem( or( not( or( X, not( Y ) ) ), or( not( or( X, Y
% 0.81/1.39 ) ), X ) ) ) ] )
% 0.81/1.39 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.81/1.39 )] ) ).
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 resolution(
% 0.81/1.39 clause( 6262, [ theorem( or( not( or( X, Y ) ), or( not( or( X, not( Y ) )
% 0.81/1.39 ), X ) ) ) ] )
% 0.81/1.39 , clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z
% 0.81/1.39 ) ) ) ) ] )
% 0.81/1.39 , 1, clause( 3146, [ theorem( or( not( or( X, not( Y ) ) ), or( not( or( X
% 0.81/1.39 , Y ) ), X ) ) ) ] )
% 0.81/1.39 , 0, substitution( 0, [ :=( X, not( or( X, Y ) ) ), :=( Y, not( or( X, not(
% 0.81/1.39 Y ) ) ) ), :=( Z, X )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )
% 0.81/1.39 ).
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 subsumption(
% 0.81/1.39 clause( 3156, [ theorem( or( not( or( X, Y ) ), or( not( or( X, not( Y ) )
% 0.81/1.39 ), X ) ) ) ] )
% 0.81/1.39 , clause( 6262, [ theorem( or( not( or( X, Y ) ), or( not( or( X, not( Y )
% 0.81/1.39 ) ), X ) ) ) ] )
% 0.81/1.39 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.81/1.39 )] ) ).
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 resolution(
% 0.81/1.39 clause( 6263, [ theorem( or( not( or( X, Y ) ), or( not( or( Y, not( X ) )
% 0.81/1.39 ), Y ) ) ) ] )
% 0.81/1.39 , clause( 36, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 0.81/1.39 or( Y, X ) ), Z ) ) ) ] )
% 0.81/1.39 , 1, clause( 3156, [ theorem( or( not( or( X, Y ) ), or( not( or( X, not( Y
% 0.81/1.39 ) ) ), X ) ) ) ] )
% 0.81/1.39 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, or( not( or( Y, not(
% 0.81/1.39 X ) ) ), Y ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, X )] )).
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 subsumption(
% 0.81/1.39 clause( 6195, [ theorem( or( not( or( X, Y ) ), or( not( or( Y, not( X ) )
% 0.81/1.39 ), Y ) ) ) ] )
% 0.81/1.39 , clause( 6263, [ theorem( or( not( or( X, Y ) ), or( not( or( Y, not( X )
% 0.81/1.39 ) ), Y ) ) ) ] )
% 0.81/1.39 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.81/1.39 )] ) ).
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 resolution(
% 0.81/1.39 clause( 6264, [ theorem( or( not( or( X, not( Y ) ) ), or( not( or( Y, X )
% 0.81/1.39 ), X ) ) ) ] )
% 0.81/1.39 , clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z
% 0.81/1.39 ) ) ) ) ] )
% 0.81/1.39 , 1, clause( 6195, [ theorem( or( not( or( X, Y ) ), or( not( or( Y, not( X
% 0.81/1.39 ) ) ), Y ) ) ) ] )
% 0.81/1.39 , 0, substitution( 0, [ :=( X, not( or( X, not( Y ) ) ) ), :=( Y, not( or(
% 0.81/1.39 Y, X ) ) ), :=( Z, X )] ), substitution( 1, [ :=( X, Y ), :=( Y, X )] )
% 0.81/1.39 ).
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 subsumption(
% 0.81/1.39 clause( 6213, [ theorem( or( not( or( X, not( Y ) ) ), or( not( or( Y, X )
% 0.81/1.39 ), X ) ) ) ] )
% 0.81/1.39 , clause( 6264, [ theorem( or( not( or( X, not( Y ) ) ), or( not( or( Y, X
% 0.81/1.39 ) ), X ) ) ) ] )
% 0.81/1.39 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.81/1.39 )] ) ).
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 resolution(
% 0.81/1.39 clause( 6265, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( X, Y )
% 0.81/1.39 ), Y ) ) ) ] )
% 0.81/1.39 , clause( 36, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 0.81/1.39 or( Y, X ) ), Z ) ) ) ] )
% 0.81/1.39 , 1, clause( 6213, [ theorem( or( not( or( X, not( Y ) ) ), or( not( or( Y
% 0.81/1.39 , X ) ), X ) ) ) ] )
% 0.81/1.39 , 0, substitution( 0, [ :=( X, not( X ) ), :=( Y, Y ), :=( Z, or( not( or(
% 0.81/1.39 X, Y ) ), Y ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, X )] )).
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 subsumption(
% 0.81/1.39 clause( 6217, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( X, Y )
% 0.81/1.39 ), Y ) ) ) ] )
% 0.81/1.39 , clause( 6265, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( X, Y
% 0.81/1.39 ) ), Y ) ) ) ] )
% 0.81/1.39 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.81/1.39 )] ) ).
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 resolution(
% 0.81/1.39 clause( 6266, [ theorem( or( not( or( X, Y ) ), or( not( or( not( X ), Y )
% 0.81/1.39 ), Y ) ) ) ] )
% 0.81/1.39 , clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z
% 0.81/1.39 ) ) ) ) ] )
% 0.81/1.39 , 1, clause( 6217, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( X
% 0.81/1.39 , Y ) ), Y ) ) ) ] )
% 0.81/1.39 , 0, substitution( 0, [ :=( X, not( or( X, Y ) ) ), :=( Y, not( or( not( X
% 0.81/1.39 ), Y ) ) ), :=( Z, Y )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )
% 0.81/1.39 ).
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 subsumption(
% 0.81/1.39 clause( 6225, [ theorem( or( not( or( X, Y ) ), or( not( or( not( X ), Y )
% 0.81/1.39 ), Y ) ) ) ] )
% 0.81/1.39 , clause( 6266, [ theorem( or( not( or( X, Y ) ), or( not( or( not( X ), Y
% 0.81/1.39 ) ), Y ) ) ) ] )
% 0.81/1.39 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.81/1.39 )] ) ).
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 resolution(
% 0.81/1.39 clause( 6267, [] )
% 0.81/1.39 , clause( 8, [ ~( theorem( or( not( or( not( p ), q ) ), or( not( or( not(
% 0.81/1.39 not( p ) ), q ) ), q ) ) ) ) ] )
% 0.81/1.39 , 0, clause( 6225, [ theorem( or( not( or( X, Y ) ), or( not( or( not( X )
% 0.81/1.39 , Y ) ), Y ) ) ) ] )
% 0.81/1.39 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, not( p ) ), :=( Y, q
% 0.81/1.39 )] )).
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 subsumption(
% 0.81/1.39 clause( 6243, [] )
% 0.81/1.39 , clause( 6267, [] )
% 0.81/1.39 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 end.
% 0.81/1.39
% 0.81/1.39 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.81/1.39
% 0.81/1.39 Memory use:
% 0.81/1.39
% 0.81/1.39 space for terms: 102101
% 0.81/1.39 space for clauses: 483772
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 clauses generated: 10948
% 0.81/1.39 clauses kept: 6244
% 0.81/1.39 clauses selected: 1816
% 0.81/1.39 clauses deleted: 42
% 0.81/1.39 clauses inuse deleted: 0
% 0.81/1.39
% 0.81/1.39 subsentry: 4938
% 0.81/1.39 literals s-matched: 4938
% 0.81/1.39 literals matched: 4938
% 0.81/1.39 full subsumption: 0
% 0.81/1.39
% 0.81/1.39 checksum: 1879083793
% 0.81/1.39
% 0.81/1.39
% 0.81/1.39 Bliksem ended
%------------------------------------------------------------------------------