TSTP Solution File: LCL207-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL207-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n013.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:43 EDT 2022
% Result : Unsatisfiable 0.43s 1.13s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL207-1 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.12 % Command : bliksem %s
% 0.13/0.33 % Computer : n013.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 08:47:14 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.43/1.13 *** allocated 10000 integers for termspace/termends
% 0.43/1.13 *** allocated 10000 integers for clauses
% 0.43/1.13 *** allocated 10000 integers for justifications
% 0.43/1.13 Bliksem 1.12
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 Automatic Strategy Selection
% 0.43/1.13
% 0.43/1.13 Clauses:
% 0.43/1.13 [
% 0.43/1.13 [ axiom( or( not( or( X, X ) ), X ) ) ],
% 0.43/1.13 [ axiom( or( not( X ), or( Y, X ) ) ) ],
% 0.43/1.13 [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ],
% 0.43/1.13 [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) ) ],
% 0.43/1.13 [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) ), or( Z, Y )
% 0.43/1.13 ) ) ) ],
% 0.43/1.13 [ theorem( X ), ~( axiom( X ) ) ],
% 0.43/1.13 [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~( theorem( Y ) ) ]
% 0.43/1.13 ,
% 0.43/1.13 [ theorem( or( not( X ), Y ) ), ~( axiom( or( not( X ), Z ) ) ), ~(
% 0.43/1.13 theorem( or( not( Z ), Y ) ) ) ],
% 0.43/1.13 [ ~( theorem( or( not( not( or( not( p ), q ) ) ), or( not( q ), p ) ) )
% 0.43/1.13 ) ]
% 0.43/1.13 ] .
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 percentage equality = 0.000000, percentage horn = 1.000000
% 0.43/1.13 This is a near-Horn, non-equality problem
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 Options Used:
% 0.43/1.13
% 0.43/1.13 useres = 1
% 0.43/1.13 useparamod = 0
% 0.43/1.13 useeqrefl = 0
% 0.43/1.13 useeqfact = 0
% 0.43/1.13 usefactor = 1
% 0.43/1.13 usesimpsplitting = 0
% 0.43/1.13 usesimpdemod = 0
% 0.43/1.13 usesimpres = 4
% 0.43/1.13
% 0.43/1.13 resimpinuse = 1000
% 0.43/1.13 resimpclauses = 20000
% 0.43/1.13 substype = standard
% 0.43/1.13 backwardsubs = 1
% 0.43/1.13 selectoldest = 5
% 0.43/1.13
% 0.43/1.13 litorderings [0] = split
% 0.43/1.13 litorderings [1] = liftord
% 0.43/1.13
% 0.43/1.13 termordering = none
% 0.43/1.13
% 0.43/1.13 litapriori = 1
% 0.43/1.13 termapriori = 0
% 0.43/1.13 litaposteriori = 0
% 0.43/1.13 termaposteriori = 0
% 0.43/1.13 demodaposteriori = 0
% 0.43/1.13 ordereqreflfact = 0
% 0.43/1.13
% 0.43/1.13 litselect = negative
% 0.43/1.13
% 0.43/1.13 maxweight = 30000
% 0.43/1.13 maxdepth = 30000
% 0.43/1.13 maxlength = 115
% 0.43/1.13 maxnrvars = 195
% 0.43/1.13 excuselevel = 0
% 0.43/1.13 increasemaxweight = 0
% 0.43/1.13
% 0.43/1.13 maxselected = 10000000
% 0.43/1.13 maxnrclauses = 10000000
% 0.43/1.13
% 0.43/1.13 showgenerated = 0
% 0.43/1.13 showkept = 0
% 0.43/1.13 showselected = 0
% 0.43/1.13 showdeleted = 0
% 0.43/1.13 showresimp = 1
% 0.43/1.13 showstatus = 2000
% 0.43/1.13
% 0.43/1.13 prologoutput = 1
% 0.43/1.13 nrgoals = 5000000
% 0.43/1.13 totalproof = 1
% 0.43/1.13
% 0.43/1.13 Symbols occurring in the translation:
% 0.43/1.13
% 0.43/1.13 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.43/1.13 . [1, 2] (w:1, o:25, a:1, s:1, b:0),
% 0.43/1.13 ! [4, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.43/1.13 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.43/1.13 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.43/1.13 or [40, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.43/1.13 not [41, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.43/1.13 axiom [42, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.43/1.13 theorem [46, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.43/1.13 p [49, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.43/1.13 q [50, 0] (w:1, o:16, a:1, s:1, b:0).
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 Starting Search:
% 0.43/1.13
% 0.43/1.13 Resimplifying inuse:
% 0.43/1.13 Done
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 Bliksems!, er is een bewijs:
% 0.43/1.13 % SZS status Unsatisfiable
% 0.43/1.13 % SZS output start Refutation
% 0.43/1.13
% 0.43/1.13 clause( 1, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 0.43/1.13 .
% 0.43/1.13 clause( 2, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.43/1.13 .
% 0.43/1.13 clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) )
% 0.43/1.13 ] )
% 0.43/1.13 .
% 0.43/1.13 clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.43/1.13 .
% 0.43/1.13 clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X ) )
% 0.43/1.13 ) ] )
% 0.43/1.13 .
% 0.43/1.13 clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y ) )
% 0.43/1.13 ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 0.43/1.13 .
% 0.43/1.13 clause( 8, [ ~( theorem( or( not( not( or( not( p ), q ) ) ), or( not( q )
% 0.43/1.13 , p ) ) ) ) ] )
% 0.43/1.13 .
% 0.43/1.13 clause( 11, [ theorem( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.43/1.13 .
% 0.43/1.13 clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z )
% 0.43/1.13 ) ) ) ] )
% 0.43/1.13 .
% 0.43/1.13 clause( 38, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( or( Z, X )
% 0.43/1.13 ), Y ) ) ) ] )
% 0.43/1.13 .
% 0.43/1.13 clause( 220, [ theorem( or( not( X ), or( X, Y ) ) ) ] )
% 0.43/1.13 .
% 0.43/1.13 clause( 227, [ theorem( or( X, or( not( X ), Y ) ) ) ] )
% 0.43/1.13 .
% 0.43/1.13 clause( 231, [ theorem( or( not( X ), or( not( not( or( Y, X ) ) ), Z ) ) )
% 0.43/1.13 ] )
% 0.43/1.13 .
% 0.43/1.13 clause( 1498, [ theorem( or( not( not( or( X, Y ) ) ), or( not( Y ), Z ) )
% 0.43/1.13 ) ] )
% 0.43/1.13 .
% 0.43/1.13 clause( 1503, [] )
% 0.43/1.13 .
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 % SZS output end Refutation
% 0.43/1.13 found a proof!
% 0.43/1.13
% 0.43/1.13 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.43/1.13
% 0.43/1.13 initialclauses(
% 0.43/1.13 [ clause( 1505, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.43/1.13 , clause( 1506, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 0.43/1.13 , clause( 1507, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.43/1.13 , clause( 1508, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z )
% 0.43/1.13 ) ) ) ] )
% 0.43/1.13 , clause( 1509, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X )
% 0.43/1.13 ), or( Z, Y ) ) ) ) ] )
% 0.43/1.13 , clause( 1510, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.43/1.13 , clause( 1511, [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~( theorem(
% 0.43/1.13 Y ) ) ] )
% 0.43/1.13 , clause( 1512, [ theorem( or( not( X ), Y ) ), ~( axiom( or( not( X ), Z )
% 0.43/1.13 ) ), ~( theorem( or( not( Z ), Y ) ) ) ] )
% 0.43/1.13 , clause( 1513, [ ~( theorem( or( not( not( or( not( p ), q ) ) ), or( not(
% 0.43/1.13 q ), p ) ) ) ) ] )
% 0.43/1.13 ] ).
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 subsumption(
% 0.43/1.13 clause( 1, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 0.43/1.13 , clause( 1506, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 0.43/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.43/1.13 )] ) ).
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 subsumption(
% 0.43/1.13 clause( 2, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.43/1.13 , clause( 1507, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.43/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.43/1.13 )] ) ).
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 subsumption(
% 0.43/1.13 clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) )
% 0.43/1.13 ] )
% 0.43/1.13 , clause( 1508, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z )
% 0.43/1.13 ) ) ) ] )
% 0.43/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.43/1.13 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 subsumption(
% 0.43/1.13 clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.43/1.13 , clause( 1510, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.43/1.13 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.43/1.13 1 )] ) ).
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 subsumption(
% 0.43/1.13 clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X ) )
% 0.43/1.13 ) ] )
% 0.43/1.13 , clause( 1511, [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~( theorem(
% 0.43/1.13 Y ) ) ] )
% 0.43/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.43/1.13 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 subsumption(
% 0.43/1.13 clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y ) )
% 0.43/1.13 ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 0.43/1.13 , clause( 1512, [ theorem( or( not( X ), Y ) ), ~( axiom( or( not( X ), Z )
% 0.43/1.13 ) ), ~( theorem( or( not( Z ), Y ) ) ) ] )
% 0.43/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.43/1.13 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 subsumption(
% 0.43/1.13 clause( 8, [ ~( theorem( or( not( not( or( not( p ), q ) ) ), or( not( q )
% 0.43/1.13 , p ) ) ) ) ] )
% 0.43/1.13 , clause( 1513, [ ~( theorem( or( not( not( or( not( p ), q ) ) ), or( not(
% 0.43/1.13 q ), p ) ) ) ) ] )
% 0.43/1.13 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 resolution(
% 0.43/1.13 clause( 1514, [ theorem( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.43/1.13 , clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.43/1.13 , 1, clause( 2, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.43/1.13 , 0, substitution( 0, [ :=( X, or( not( or( X, Y ) ), or( Y, X ) ) )] ),
% 0.43/1.13 substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 subsumption(
% 0.43/1.13 clause( 11, [ theorem( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.43/1.13 , clause( 1514, [ theorem( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.43/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.43/1.13 )] ) ).
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 resolution(
% 0.43/1.13 clause( 1515, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z
% 0.43/1.13 ) ) ) ) ] )
% 0.43/1.13 , clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X )
% 0.43/1.13 ) ) ] )
% 0.43/1.13 , 2, clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z )
% 0.43/1.13 ) ) ) ] )
% 0.43/1.13 , 0, substitution( 0, [ :=( X, or( X, or( Y, Z ) ) ), :=( Y, or( Y, or( X,
% 0.43/1.13 Z ) ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, X ), :=( Z, Z )] )).
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 subsumption(
% 0.43/1.13 clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z )
% 0.43/1.13 ) ) ) ] )
% 0.43/1.13 , clause( 1515, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X
% 0.43/1.13 , Z ) ) ) ) ] )
% 0.43/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.43/1.13 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 resolution(
% 0.43/1.13 clause( 1516, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( or( Z, X
% 0.43/1.13 ) ), Y ) ) ) ] )
% 0.43/1.13 , clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y )
% 0.43/1.13 ) ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 0.43/1.13 , 2, clause( 1, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 0.43/1.13 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, or( Z, X ) )] ),
% 0.43/1.13 substitution( 1, [ :=( X, X ), :=( Y, Z )] )).
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 subsumption(
% 0.43/1.13 clause( 38, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( or( Z, X )
% 0.43/1.13 ), Y ) ) ) ] )
% 0.43/1.13 , clause( 1516, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( or( Z
% 0.43/1.13 , X ) ), Y ) ) ) ] )
% 0.43/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.43/1.13 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 resolution(
% 0.43/1.13 clause( 1517, [ theorem( or( not( X ), or( X, Y ) ) ) ] )
% 0.43/1.13 , clause( 38, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( or( Z, X
% 0.43/1.13 ) ), Y ) ) ) ] )
% 0.43/1.13 , 1, clause( 11, [ theorem( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.43/1.13 , 0, substitution( 0, [ :=( X, X ), :=( Y, or( X, Y ) ), :=( Z, Y )] ),
% 0.43/1.13 substitution( 1, [ :=( X, Y ), :=( Y, X )] )).
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 subsumption(
% 0.43/1.13 clause( 220, [ theorem( or( not( X ), or( X, Y ) ) ) ] )
% 0.43/1.13 , clause( 1517, [ theorem( or( not( X ), or( X, Y ) ) ) ] )
% 0.43/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.43/1.13 )] ) ).
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 resolution(
% 0.43/1.13 clause( 1518, [ theorem( or( X, or( not( X ), Y ) ) ) ] )
% 0.43/1.13 , clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z
% 0.43/1.13 ) ) ) ) ] )
% 0.43/1.13 , 1, clause( 220, [ theorem( or( not( X ), or( X, Y ) ) ) ] )
% 0.43/1.13 , 0, substitution( 0, [ :=( X, X ), :=( Y, not( X ) ), :=( Z, Y )] ),
% 0.43/1.13 substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 subsumption(
% 0.43/1.13 clause( 227, [ theorem( or( X, or( not( X ), Y ) ) ) ] )
% 0.43/1.13 , clause( 1518, [ theorem( or( X, or( not( X ), Y ) ) ) ] )
% 0.43/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.43/1.13 )] ) ).
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 resolution(
% 0.43/1.13 clause( 1519, [ theorem( or( not( X ), or( not( not( or( Y, X ) ) ), Z ) )
% 0.43/1.13 ) ] )
% 0.43/1.13 , clause( 38, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( or( Z, X
% 0.43/1.13 ) ), Y ) ) ) ] )
% 0.43/1.13 , 1, clause( 227, [ theorem( or( X, or( not( X ), Y ) ) ) ] )
% 0.43/1.13 , 0, substitution( 0, [ :=( X, X ), :=( Y, or( not( not( or( Y, X ) ) ), Z
% 0.43/1.13 ) ), :=( Z, Y )] ), substitution( 1, [ :=( X, not( or( Y, X ) ) ), :=( Y
% 0.43/1.13 , Z )] )).
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 subsumption(
% 0.43/1.13 clause( 231, [ theorem( or( not( X ), or( not( not( or( Y, X ) ) ), Z ) ) )
% 0.43/1.13 ] )
% 0.43/1.13 , clause( 1519, [ theorem( or( not( X ), or( not( not( or( Y, X ) ) ), Z )
% 0.43/1.13 ) ) ] )
% 0.43/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.43/1.13 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 resolution(
% 0.43/1.13 clause( 1520, [ theorem( or( not( not( or( X, Y ) ) ), or( not( Y ), Z ) )
% 0.43/1.13 ) ] )
% 0.43/1.13 , clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z
% 0.43/1.13 ) ) ) ) ] )
% 0.43/1.13 , 1, clause( 231, [ theorem( or( not( X ), or( not( not( or( Y, X ) ) ), Z
% 0.43/1.13 ) ) ) ] )
% 0.43/1.13 , 0, substitution( 0, [ :=( X, not( not( or( X, Y ) ) ) ), :=( Y, not( Y )
% 0.43/1.13 ), :=( Z, Z )] ), substitution( 1, [ :=( X, Y ), :=( Y, X ), :=( Z, Z )] )
% 0.43/1.13 ).
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 subsumption(
% 0.43/1.13 clause( 1498, [ theorem( or( not( not( or( X, Y ) ) ), or( not( Y ), Z ) )
% 0.43/1.13 ) ] )
% 0.43/1.13 , clause( 1520, [ theorem( or( not( not( or( X, Y ) ) ), or( not( Y ), Z )
% 0.43/1.13 ) ) ] )
% 0.43/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.43/1.13 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 resolution(
% 0.43/1.13 clause( 1521, [] )
% 0.43/1.13 , clause( 8, [ ~( theorem( or( not( not( or( not( p ), q ) ) ), or( not( q
% 0.43/1.13 ), p ) ) ) ) ] )
% 0.43/1.13 , 0, clause( 1498, [ theorem( or( not( not( or( X, Y ) ) ), or( not( Y ), Z
% 0.43/1.13 ) ) ) ] )
% 0.43/1.13 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, not( p ) ), :=( Y, q
% 0.43/1.13 ), :=( Z, p )] )).
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 subsumption(
% 0.43/1.13 clause( 1503, [] )
% 0.43/1.13 , clause( 1521, [] )
% 0.43/1.13 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 end.
% 0.43/1.13
% 0.43/1.13 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.43/1.13
% 0.43/1.13 Memory use:
% 0.43/1.13
% 0.43/1.13 space for terms: 22096
% 0.43/1.13 space for clauses: 116914
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 clauses generated: 2711
% 0.43/1.13 clauses kept: 1504
% 0.43/1.13 clauses selected: 448
% 0.43/1.13 clauses deleted: 7
% 0.43/1.13 clauses inuse deleted: 0
% 0.43/1.13
% 0.43/1.13 subsentry: 1281
% 0.43/1.13 literals s-matched: 1281
% 0.43/1.13 literals matched: 1281
% 0.43/1.13 full subsumption: 0
% 0.43/1.13
% 0.43/1.13 checksum: 1314119916
% 0.43/1.13
% 0.43/1.13
% 0.43/1.13 Bliksem ended
%------------------------------------------------------------------------------