TSTP Solution File: LCL238-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL238-1 : TPTP v8.1.0. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n009.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:06 EDT 2022
% Result : Unsatisfiable 0.61s 1.01s
% Output : Refutation 0.61s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL238-1 : TPTP v8.1.0. Bugfixed v2.3.0.
% 0.11/0.12 % Command : bliksem %s
% 0.11/0.33 % Computer : n009.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % DateTime : Tue Jul 5 00:13:22 EDT 2022
% 0.11/0.34 % CPUTime :
% 0.61/1.01 *** allocated 10000 integers for termspace/termends
% 0.61/1.01 *** allocated 10000 integers for clauses
% 0.61/1.01 *** allocated 10000 integers for justifications
% 0.61/1.01 Bliksem 1.12
% 0.61/1.01
% 0.61/1.01
% 0.61/1.01 Automatic Strategy Selection
% 0.61/1.01
% 0.61/1.01 Clauses:
% 0.61/1.01 [
% 0.61/1.01 [ axiom( or( not( or( X, X ) ), X ) ) ],
% 0.61/1.01 [ axiom( or( not( X ), or( Y, X ) ) ) ],
% 0.61/1.01 [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ],
% 0.61/1.01 [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) ) ],
% 0.61/1.01 [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) ), or( Z, Y )
% 0.61/1.01 ) ) ) ],
% 0.61/1.01 [ theorem( X ), ~( axiom( X ) ) ],
% 0.61/1.01 [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~( theorem( Y ) ) ]
% 0.61/1.01 ,
% 0.61/1.01 [ theorem( or( not( X ), Y ) ), ~( axiom( or( not( X ), Z ) ) ), ~(
% 0.61/1.01 theorem( or( not( Z ), Y ) ) ) ],
% 0.61/1.01 [ ~( theorem( or( not( not( or( not( p ), not( q ) ) ) ), not( or( not(
% 0.61/1.01 q ), not( p ) ) ) ) ) ) ]
% 0.61/1.01 ] .
% 0.61/1.01
% 0.61/1.01
% 0.61/1.01 percentage equality = 0.000000, percentage horn = 1.000000
% 0.61/1.01 This is a near-Horn, non-equality problem
% 0.61/1.01
% 0.61/1.01
% 0.61/1.01 Options Used:
% 0.61/1.01
% 0.61/1.01 useres = 1
% 0.61/1.01 useparamod = 0
% 0.61/1.01 useeqrefl = 0
% 0.61/1.01 useeqfact = 0
% 0.61/1.01 usefactor = 1
% 0.61/1.01 usesimpsplitting = 0
% 0.61/1.01 usesimpdemod = 0
% 0.61/1.01 usesimpres = 4
% 0.61/1.01
% 0.61/1.01 resimpinuse = 1000
% 0.61/1.01 resimpclauses = 20000
% 0.61/1.01 substype = standard
% 0.61/1.01 backwardsubs = 1
% 0.61/1.01 selectoldest = 5
% 0.61/1.01
% 0.61/1.01 litorderings [0] = split
% 0.61/1.01 litorderings [1] = liftord
% 0.61/1.01
% 0.61/1.01 termordering = none
% 0.61/1.01
% 0.61/1.01 litapriori = 1
% 0.61/1.01 termapriori = 0
% 0.61/1.01 litaposteriori = 0
% 0.61/1.01 termaposteriori = 0
% 0.61/1.01 demodaposteriori = 0
% 0.61/1.01 ordereqreflfact = 0
% 0.61/1.01
% 0.61/1.01 litselect = negative
% 0.61/1.01
% 0.61/1.01 maxweight = 30000
% 0.61/1.01 maxdepth = 30000
% 0.61/1.01 maxlength = 115
% 0.61/1.01 maxnrvars = 195
% 0.61/1.01 excuselevel = 0
% 0.61/1.01 increasemaxweight = 0
% 0.61/1.01
% 0.61/1.01 maxselected = 10000000
% 0.61/1.01 maxnrclauses = 10000000
% 0.61/1.01
% 0.61/1.01 showgenerated = 0
% 0.61/1.01 showkept = 0
% 0.61/1.01 showselected = 0
% 0.61/1.01 showdeleted = 0
% 0.61/1.01 showresimp = 1
% 0.61/1.01 showstatus = 2000
% 0.61/1.01
% 0.61/1.01 prologoutput = 1
% 0.61/1.01 nrgoals = 5000000
% 0.61/1.01 totalproof = 1
% 0.61/1.01
% 0.61/1.01 Symbols occurring in the translation:
% 0.61/1.01
% 0.61/1.01 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.61/1.01 . [1, 2] (w:1, o:25, a:1, s:1, b:0),
% 0.61/1.01 ! [4, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.61/1.01 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.61/1.01 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.61/1.01 or [40, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.61/1.01 not [41, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.61/1.01 axiom [42, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.61/1.01 theorem [46, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.61/1.01 p [49, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.61/1.01 q [50, 0] (w:1, o:16, a:1, s:1, b:0).
% 0.61/1.01
% 0.61/1.01
% 0.61/1.01 Starting Search:
% 0.61/1.01
% 0.61/1.01 Resimplifying inuse:
% 0.61/1.01
% 0.61/1.01 Bliksems!, er is een bewijs:
% 0.61/1.01 % SZS status Unsatisfiable
% 0.61/1.01 % SZS output start Refutation
% 0.61/1.01
% 0.61/1.01 clause( 0, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.61/1.01 .
% 0.61/1.01 clause( 1, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 0.61/1.01 .
% 0.61/1.01 clause( 2, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.61/1.01 .
% 0.61/1.01 clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) )
% 0.61/1.01 ] )
% 0.61/1.01 .
% 0.61/1.01 clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.61/1.01 .
% 0.61/1.01 clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X ) )
% 0.61/1.01 ) ] )
% 0.61/1.01 .
% 0.61/1.01 clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y ) )
% 0.61/1.01 ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 0.61/1.01 .
% 0.61/1.01 clause( 8, [ ~( theorem( or( not( not( or( not( p ), not( q ) ) ) ), not(
% 0.61/1.01 or( not( q ), not( p ) ) ) ) ) ) ] )
% 0.61/1.01 .
% 0.61/1.01 clause( 9, [ theorem( or( not( X ), or( Y, X ) ) ) ] )
% 0.61/1.01 .
% 0.61/1.01 clause( 12, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 0.61/1.01 .
% 0.61/1.01 clause( 13, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 0.61/1.01 .
% 0.61/1.01 clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z )
% 0.61/1.01 ) ) ) ] )
% 0.61/1.01 .
% 0.61/1.01 clause( 36, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 0.61/1.01 or( Y, X ) ), Z ) ) ) ] )
% 0.61/1.01 .
% 0.61/1.01 clause( 66, [ theorem( or( X, or( not( Y ), Y ) ) ) ] )
% 0.61/1.01 .
% 0.61/1.01 clause( 68, [ theorem( or( not( X ), X ) ) ] )
% 0.61/1.01 .
% 0.61/1.01 clause( 71, [ theorem( or( X, not( X ) ) ) ] )
% 0.61/1.01 .
% 0.61/1.01 clause( 165, [ theorem( or( not( or( X, Y ) ), not( not( or( Y, X ) ) ) ) )
% 0.61/1.01 ] )
% 0.61/1.01 .
% 0.61/1.01 clause( 986, [ theorem( or( not( not( or( X, Y ) ) ), not( or( Y, X ) ) ) )
% 0.61/1.01 ] )
% 0.61/1.01 .
% 0.61/1.01 clause( 1002, [] )
% 0.61/1.01 .
% 0.61/1.01
% 0.61/1.01
% 0.61/1.01 % SZS output end Refutation
% 0.61/1.01 found a proof!
% 0.61/1.01
% 0.61/1.01 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.61/1.01
% 0.61/1.01 initialclauses(
% 0.61/1.01 [ clause( 1004, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.61/1.01 , clause( 1005, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 0.61/1.01 , clause( 1006, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.61/1.01 , clause( 1007, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z )
% 0.61/1.01 ) ) ) ] )
% 0.61/1.01 , clause( 1008, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X )
% 0.61/1.01 ), or( Z, Y ) ) ) ) ] )
% 0.61/1.01 , clause( 1009, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.61/1.01 , clause( 1010, [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~( theorem(
% 0.61/1.01 Y ) ) ] )
% 0.61/1.01 , clause( 1011, [ theorem( or( not( X ), Y ) ), ~( axiom( or( not( X ), Z )
% 0.61/1.01 ) ), ~( theorem( or( not( Z ), Y ) ) ) ] )
% 0.61/1.01 , clause( 1012, [ ~( theorem( or( not( not( or( not( p ), not( q ) ) ) ),
% 0.61/1.01 not( or( not( q ), not( p ) ) ) ) ) ) ] )
% 0.61/1.01 ] ).
% 0.61/1.01
% 0.61/1.01
% 0.61/1.01
% 0.61/1.01 subsumption(
% 0.61/1.01 clause( 0, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.61/1.01 , clause( 1004, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.61/1.01 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.61/1.01
% 0.61/1.01
% 0.61/1.01 subsumption(
% 0.61/1.01 clause( 1, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 0.61/1.01 , clause( 1005, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 0.61/1.01 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.61/1.01 )] ) ).
% 0.61/1.01
% 0.61/1.01
% 0.61/1.01 subsumption(
% 0.61/1.01 clause( 2, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.61/1.01 , clause( 1006, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.61/1.01 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.61/1.01 )] ) ).
% 0.61/1.01
% 0.61/1.01
% 0.61/1.01 subsumption(
% 0.61/1.01 clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) )
% 0.61/1.01 ] )
% 0.61/1.01 , clause( 1007, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z )
% 0.61/1.01 ) ) ) ] )
% 0.61/1.01 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.61/1.01 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.61/1.01
% 0.61/1.01
% 0.61/1.01 subsumption(
% 0.61/1.01 clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.61/1.01 , clause( 1009, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.61/1.01 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.61/1.01 1 )] ) ).
% 0.61/1.01
% 0.61/1.01
% 0.61/1.01 subsumption(
% 0.61/1.01 clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X ) )
% 0.61/1.01 ) ] )
% 0.61/1.01 , clause( 1010, [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~( theorem(
% 0.61/1.01 Y ) ) ] )
% 0.61/1.01 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.61/1.01 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.61/1.01
% 0.61/1.01
% 0.61/1.01 subsumption(
% 0.61/1.01 clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y ) )
% 0.61/1.01 ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 0.61/1.01 , clause( 1011, [ theorem( or( not( X ), Y ) ), ~( axiom( or( not( X ), Z )
% 0.61/1.01 ) ), ~( theorem( or( not( Z ), Y ) ) ) ] )
% 0.61/1.01 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.61/1.01 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.61/1.01
% 0.61/1.01
% 0.61/1.01 subsumption(
% 0.61/1.01 clause( 8, [ ~( theorem( or( not( not( or( not( p ), not( q ) ) ) ), not(
% 0.61/1.01 or( not( q ), not( p ) ) ) ) ) ) ] )
% 0.61/1.01 , clause( 1012, [ ~( theorem( or( not( not( or( not( p ), not( q ) ) ) ),
% 0.61/1.01 not( or( not( q ), not( p ) ) ) ) ) ) ] )
% 0.61/1.01 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.61/1.01
% 0.61/1.01
% 0.61/1.01 resolution(
% 0.61/1.01 clause( 1013, [ theorem( or( not( X ), or( Y, X ) ) ) ] )
% 0.61/1.01 , clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.61/1.01 , 1, clause( 1, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 0.61/1.01 , 0, substitution( 0, [ :=( X, or( not( X ), or( Y, X ) ) )] ),
% 0.61/1.01 substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.61/1.01
% 0.61/1.01
% 0.61/1.01 subsumption(
% 0.61/1.01 clause( 9, [ theorem( or( not( X ), or( Y, X ) ) ) ] )
% 0.61/1.01 , clause( 1013, [ theorem( or( not( X ), or( Y, X ) ) ) ] )
% 0.61/1.01 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.61/1.01 )] ) ).
% 0.61/1.01
% 0.61/1.01
% 0.61/1.01 resolution(
% 0.61/1.01 clause( 1014, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 0.61/1.01 , clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X )
% 0.61/1.01 ) ) ] )
% 0.61/1.01 , 2, clause( 2, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.61/1.01 , 0, substitution( 0, [ :=( X, or( X, Y ) ), :=( Y, or( Y, X ) )] ),
% 0.61/1.01 substitution( 1, [ :=( X, Y ), :=( Y, X )] )).
% 0.61/1.01
% 0.61/1.01
% 0.61/1.01 subsumption(
% 0.61/1.01 clause( 12, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 0.61/1.01 , clause( 1014, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 0.61/1.01 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.61/1.01 ), ==>( 1, 1 )] ) ).
% 0.61/1.01
% 0.61/1.01
% 0.61/1.01 resolution(
% 0.61/1.01 clause( 1015, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 0.61/1.01 , clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X )
% 0.61/1.01 ) ) ] )
% 0.61/1.01 , 2, clause( 0, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.61/1.01 , 0, substitution( 0, [ :=( X, X ), :=( Y, or( X, X ) )] ), substitution( 1
% 0.61/1.01 , [ :=( X, X )] )).
% 0.61/1.01
% 0.61/1.01
% 0.61/1.01 subsumption(
% 0.61/1.01 clause( 13, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 0.61/1.01 , clause( 1015, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 0.61/1.01 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.61/1.01 1 )] ) ).
% 0.61/1.01
% 0.61/1.01
% 0.61/1.01 resolution(
% 0.61/1.01 clause( 1016, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z
% 0.61/1.01 ) ) ) ) ] )
% 0.61/1.01 , clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X )
% 0.61/1.01 ) ) ] )
% 0.61/1.01 , 2, clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z )
% 0.61/1.01 ) ) ) ] )
% 0.61/1.01 , 0, substitution( 0, [ :=( X, or( X, or( Y, Z ) ) ), :=( Y, or( Y, or( X,
% 0.61/1.01 Z ) ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, X ), :=( Z, Z )] )).
% 0.61/1.01
% 0.61/1.01
% 0.61/1.01 subsumption(
% 0.61/1.01 clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z )
% 0.61/1.01 ) ) ) ] )
% 0.61/1.01 , clause( 1016, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X
% 0.61/1.01 , Z ) ) ) ) ] )
% 0.61/1.01 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.61/1.01 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.61/1.01
% 0.61/1.01
% 0.61/1.01 resolution(
% 0.61/1.01 clause( 1017, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 0.61/1.01 or( Y, X ) ), Z ) ) ) ] )
% 0.61/1.01 , clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y )
% 0.61/1.01 ) ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 0.61/1.01 , 2, clause( 2, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.61/1.01 , 0, substitution( 0, [ :=( X, or( X, Y ) ), :=( Y, Z ), :=( Z, or( Y, X )
% 0.61/1.01 )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.61/1.01
% 0.61/1.01
% 0.61/1.01 subsumption(
% 0.61/1.01 clause( 36, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 0.61/1.01 or( Y, X ) ), Z ) ) ) ] )
% 0.61/1.01 , clause( 1017, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or(
% 0.61/1.01 not( or( Y, X ) ), Z ) ) ) ] )
% 0.61/1.01 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.61/1.01 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.61/1.01
% 0.61/1.01
% 0.61/1.01 resolution(
% 0.61/1.01 clause( 1018, [ theorem( or( X, or( not( Y ), Y ) ) ) ] )
% 0.61/1.01 , clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z
% 0.61/1.01 ) ) ) ) ] )
% 0.61/1.01 , 1, clause( 9, [ theorem( or( not( X ), or( Y, X ) ) ) ] )
% 0.61/1.01 , 0, substitution( 0, [ :=( X, X ), :=( Y, not( Y ) ), :=( Z, Y )] ),
% 0.61/1.01 substitution( 1, [ :=( X, Y ), :=( Y, X )] )).
% 0.61/1.01
% 0.61/1.01
% 0.61/1.01 subsumption(
% 0.61/1.01 clause( 66, [ theorem( or( X, or( not( Y ), Y ) ) ) ] )
% 0.61/1.01 , clause( 1018, [ theorem( or( X, or( not( Y ), Y ) ) ) ] )
% 0.61/1.01 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.61/1.01 )] ) ).
% 0.61/1.01
% 0.61/1.01
% 0.61/1.01 resolution(
% 0.61/1.01 clause( 1019, [ theorem( or( not( X ), X ) ) ] )
% 0.61/1.01 , clause( 13, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 0.61/1.01 , 1, clause( 66, [ theorem( or( X, or( not( Y ), Y ) ) ) ] )
% 0.61/1.01 , 0, substitution( 0, [ :=( X, or( not( X ), X ) )] ), substitution( 1, [
% 0.61/1.01 :=( X, or( not( X ), X ) ), :=( Y, X )] )).
% 0.61/1.01
% 0.61/1.01
% 0.61/1.01 subsumption(
% 0.61/1.01 clause( 68, [ theorem( or( not( X ), X ) ) ] )
% 0.61/1.01 , clause( 1019, [ theorem( or( not( X ), X ) ) ] )
% 0.61/1.01 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.61/1.01
% 0.61/1.01
% 0.61/1.01 resolution(
% 0.61/1.01 clause( 1020, [ theorem( or( X, not( X ) ) ) ] )
% 0.61/1.01 , clause( 12, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 0.61/1.01 , 1, clause( 68, [ theorem( or( not( X ), X ) ) ] )
% 0.61/1.01 , 0, substitution( 0, [ :=( X, X ), :=( Y, not( X ) )] ), substitution( 1
% 0.61/1.01 , [ :=( X, X )] )).
% 0.61/1.01
% 0.61/1.01
% 0.61/1.01 subsumption(
% 0.61/1.01 clause( 71, [ theorem( or( X, not( X ) ) ) ] )
% 0.61/1.01 , clause( 1020, [ theorem( or( X, not( X ) ) ) ] )
% 0.61/1.01 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.61/1.01
% 0.61/1.01
% 0.61/1.01 resolution(
% 0.61/1.01 clause( 1021, [ theorem( or( not( or( X, Y ) ), not( not( or( Y, X ) ) ) )
% 0.61/1.01 ) ] )
% 0.61/1.01 , clause( 36, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 0.61/1.01 or( Y, X ) ), Z ) ) ) ] )
% 0.61/1.01 , 1, clause( 71, [ theorem( or( X, not( X ) ) ) ] )
% 0.61/1.01 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, not( not( or( Y, X )
% 0.61/1.01 ) ) )] ), substitution( 1, [ :=( X, not( or( Y, X ) ) )] )).
% 0.61/1.01
% 0.61/1.01
% 0.61/1.01 subsumption(
% 0.61/1.01 clause( 165, [ theorem( or( not( or( X, Y ) ), not( not( or( Y, X ) ) ) ) )
% 0.61/1.01 ] )
% 0.61/1.01 , clause( 1021, [ theorem( or( not( or( X, Y ) ), not( not( or( Y, X ) ) )
% 0.61/1.01 ) ) ] )
% 0.61/1.01 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.61/1.01 )] ) ).
% 0.61/1.01
% 0.61/1.01
% 0.61/1.01 resolution(
% 0.61/1.01 clause( 1022, [ theorem( or( not( not( or( X, Y ) ) ), not( or( Y, X ) ) )
% 0.61/1.01 ) ] )
% 0.61/1.01 , clause( 12, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 0.61/1.01 , 1, clause( 165, [ theorem( or( not( or( X, Y ) ), not( not( or( Y, X ) )
% 0.61/1.01 ) ) ) ] )
% 0.61/1.01 , 0, substitution( 0, [ :=( X, not( not( or( X, Y ) ) ) ), :=( Y, not( or(
% 0.61/1.01 Y, X ) ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, X )] )).
% 0.61/1.01
% 0.61/1.01
% 0.61/1.01 subsumption(
% 0.61/1.01 clause( 986, [ theorem( or( not( not( or( X, Y ) ) ), not( or( Y, X ) ) ) )
% 0.61/1.01 ] )
% 0.61/1.01 , clause( 1022, [ theorem( or( not( not( or( X, Y ) ) ), not( or( Y, X ) )
% 0.61/1.01 ) ) ] )
% 0.61/1.01 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.61/1.01 )] ) ).
% 0.61/1.01
% 0.61/1.01
% 0.61/1.01 resolution(
% 0.61/1.01 clause( 1023, [] )
% 0.61/1.01 , clause( 8, [ ~( theorem( or( not( not( or( not( p ), not( q ) ) ) ), not(
% 0.61/1.01 or( not( q ), not( p ) ) ) ) ) ) ] )
% 0.61/1.01 , 0, clause( 986, [ theorem( or( not( not( or( X, Y ) ) ), not( or( Y, X )
% 0.61/1.01 ) ) ) ] )
% 0.61/1.01 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, not( p ) ), :=( Y,
% 0.61/1.01 not( q ) )] )).
% 0.61/1.01
% 0.61/1.01
% 0.61/1.01 subsumption(
% 0.61/1.01 clause( 1002, [] )
% 0.61/1.01 , clause( 1023, [] )
% 0.61/1.01 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.61/1.01
% 0.61/1.01
% 0.61/1.01 end.
% 0.61/1.01
% 0.61/1.01 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.61/1.01
% 0.61/1.01 Memory use:
% 0.61/1.01
% 0.61/1.01 space for terms: 13884
% 0.61/1.01 space for clauses: 74130
% 0.61/1.01
% 0.61/1.01
% 0.61/1.01 clauses generated: 1863
% 0.61/1.01 clauses kept: 1003
% 0.61/1.01 clauses selected: 317
% 0.61/1.01 clauses deleted: 5
% 0.61/1.01 clauses inuse deleted: 1
% 0.61/1.01
% 0.61/1.01 subsentry: 925
% 0.61/1.01 literals s-matched: 925
% 0.61/1.01 literals matched: 925
% 0.61/1.01 full subsumption: 0
% 0.61/1.01
% 0.61/1.01 checksum: 1920915497
% 0.61/1.01
% 0.61/1.01
% 0.61/1.01 Bliksem ended
%------------------------------------------------------------------------------