TSTP Solution File: LCL210-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL210-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n021.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:45 EDT 2022
% Result : Unsatisfiable 0.74s 1.18s
% Output : Refutation 0.74s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL210-1 : TPTP v8.1.0. Released v1.1.0.
% 0.13/0.13 % Command : bliksem %s
% 0.14/0.34 % Computer : n021.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % DateTime : Sun Jul 3 19:27:16 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.74/1.18 *** allocated 10000 integers for termspace/termends
% 0.74/1.18 *** allocated 10000 integers for clauses
% 0.74/1.18 *** allocated 10000 integers for justifications
% 0.74/1.18 Bliksem 1.12
% 0.74/1.18
% 0.74/1.18
% 0.74/1.18 Automatic Strategy Selection
% 0.74/1.18
% 0.74/1.18 Clauses:
% 0.74/1.18 [
% 0.74/1.18 [ axiom( or( not( or( X, X ) ), X ) ) ],
% 0.74/1.18 [ axiom( or( not( X ), or( Y, X ) ) ) ],
% 0.74/1.18 [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ],
% 0.74/1.18 [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) ) ],
% 0.74/1.18 [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) ), or( Z, Y )
% 0.74/1.18 ) ) ) ],
% 0.74/1.18 [ theorem( X ), ~( axiom( X ) ) ],
% 0.74/1.18 [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~( theorem( Y ) ) ]
% 0.74/1.18 ,
% 0.74/1.18 [ theorem( or( not( X ), Y ) ), ~( axiom( or( not( X ), Z ) ) ), ~(
% 0.74/1.18 theorem( or( not( Z ), Y ) ) ) ],
% 0.74/1.18 [ ~( theorem( or( not( not( p ) ), or( not( or( p, q ) ), q ) ) ) ) ]
% 0.74/1.18 ] .
% 0.74/1.18
% 0.74/1.18
% 0.74/1.18 percentage equality = 0.000000, percentage horn = 1.000000
% 0.74/1.18 This is a near-Horn, non-equality problem
% 0.74/1.18
% 0.74/1.18
% 0.74/1.18 Options Used:
% 0.74/1.18
% 0.74/1.18 useres = 1
% 0.74/1.18 useparamod = 0
% 0.74/1.18 useeqrefl = 0
% 0.74/1.18 useeqfact = 0
% 0.74/1.18 usefactor = 1
% 0.74/1.18 usesimpsplitting = 0
% 0.74/1.18 usesimpdemod = 0
% 0.74/1.18 usesimpres = 4
% 0.74/1.18
% 0.74/1.18 resimpinuse = 1000
% 0.74/1.18 resimpclauses = 20000
% 0.74/1.18 substype = standard
% 0.74/1.18 backwardsubs = 1
% 0.74/1.18 selectoldest = 5
% 0.74/1.18
% 0.74/1.18 litorderings [0] = split
% 0.74/1.18 litorderings [1] = liftord
% 0.74/1.18
% 0.74/1.18 termordering = none
% 0.74/1.18
% 0.74/1.18 litapriori = 1
% 0.74/1.18 termapriori = 0
% 0.74/1.18 litaposteriori = 0
% 0.74/1.18 termaposteriori = 0
% 0.74/1.18 demodaposteriori = 0
% 0.74/1.18 ordereqreflfact = 0
% 0.74/1.18
% 0.74/1.18 litselect = negative
% 0.74/1.18
% 0.74/1.18 maxweight = 30000
% 0.74/1.18 maxdepth = 30000
% 0.74/1.18 maxlength = 115
% 0.74/1.18 maxnrvars = 195
% 0.74/1.18 excuselevel = 0
% 0.74/1.18 increasemaxweight = 0
% 0.74/1.18
% 0.74/1.18 maxselected = 10000000
% 0.74/1.18 maxnrclauses = 10000000
% 0.74/1.18
% 0.74/1.18 showgenerated = 0
% 0.74/1.18 showkept = 0
% 0.74/1.18 showselected = 0
% 0.74/1.18 showdeleted = 0
% 0.74/1.18 showresimp = 1
% 0.74/1.18 showstatus = 2000
% 0.74/1.18
% 0.74/1.18 prologoutput = 1
% 0.74/1.18 nrgoals = 5000000
% 0.74/1.18 totalproof = 1
% 0.74/1.18
% 0.74/1.18 Symbols occurring in the translation:
% 0.74/1.18
% 0.74/1.18 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.74/1.18 . [1, 2] (w:1, o:25, a:1, s:1, b:0),
% 0.74/1.18 ! [4, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.74/1.18 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.74/1.18 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.74/1.18 or [40, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.74/1.18 not [41, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.74/1.18 axiom [42, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.74/1.18 theorem [46, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.74/1.18 p [49, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.74/1.18 q [50, 0] (w:1, o:16, a:1, s:1, b:0).
% 0.74/1.18
% 0.74/1.18
% 0.74/1.18 Starting Search:
% 0.74/1.18
% 0.74/1.18 Resimplifying inuse:
% 0.74/1.18 Done
% 0.74/1.18
% 0.74/1.18
% 0.74/1.18 Intermediate Status:
% 0.74/1.18 Generated: 3552
% 0.74/1.18 Kept: 2003
% 0.74/1.18 Inuse: 579
% 0.74/1.18 Deleted: 7
% 0.74/1.18 Deletedinuse: 0
% 0.74/1.18
% 0.74/1.18 Resimplifying inuse:
% 0.74/1.18 Done
% 0.74/1.18
% 0.74/1.18 Resimplifying inuse:
% 0.74/1.18 Done
% 0.74/1.18
% 0.74/1.18
% 0.74/1.18 Bliksems!, er is een bewijs:
% 0.74/1.18 % SZS status Unsatisfiable
% 0.74/1.18 % SZS output start Refutation
% 0.74/1.18
% 0.74/1.18 clause( 0, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.74/1.18 .
% 0.74/1.18 clause( 1, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 0.74/1.18 .
% 0.74/1.18 clause( 2, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.74/1.18 .
% 0.74/1.18 clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) )
% 0.74/1.18 ] )
% 0.74/1.18 .
% 0.74/1.18 clause( 4, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) ), or(
% 0.74/1.18 Z, Y ) ) ) ) ] )
% 0.74/1.18 .
% 0.74/1.18 clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.74/1.18 .
% 0.74/1.18 clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X ) )
% 0.74/1.18 ) ] )
% 0.74/1.18 .
% 0.74/1.18 clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y ) )
% 0.74/1.18 ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 0.74/1.18 .
% 0.74/1.18 clause( 8, [ ~( theorem( or( not( not( p ) ), or( not( or( p, q ) ), q ) )
% 0.74/1.18 ) ) ] )
% 0.74/1.18 .
% 0.74/1.18 clause( 10, [ theorem( or( not( or( X, X ) ), X ) ) ] )
% 0.74/1.18 .
% 0.74/1.18 clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z )
% 0.74/1.18 ) ) ) ] )
% 0.74/1.18 .
% 0.74/1.18 clause( 27, [ theorem( or( not( or( X, Y ) ), or( X, Z ) ) ), ~( theorem(
% 0.74/1.18 or( not( Y ), Z ) ) ) ] )
% 0.74/1.18 .
% 0.74/1.18 clause( 34, [ theorem( or( not( or( not( X ), Y ) ), Z ) ), ~( theorem( or(
% 0.74/1.18 not( or( not( or( T, X ) ), or( T, Y ) ) ), Z ) ) ) ] )
% 0.74/1.18 .
% 0.74/1.18 clause( 36, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 0.74/1.18 or( Y, X ) ), Z ) ) ) ] )
% 0.74/1.18 .
% 0.74/1.18 clause( 38, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( or( Z, X )
% 0.74/1.18 ), Y ) ) ) ] )
% 0.74/1.18 .
% 0.74/1.18 clause( 90, [ theorem( or( not( or( X, or( Y, Y ) ) ), or( X, Y ) ) ) ] )
% 0.74/1.18 .
% 0.74/1.18 clause( 665, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( Y, X ) )
% 0.74/1.18 , Y ) ) ) ] )
% 0.74/1.18 .
% 0.74/1.18 clause( 3146, [ theorem( or( not( or( X, not( Y ) ) ), or( not( or( X, Y )
% 0.74/1.18 ), X ) ) ) ] )
% 0.74/1.18 .
% 0.74/1.18 clause( 3153, [ theorem( or( not( not( X ) ), or( not( or( Y, X ) ), Y ) )
% 0.74/1.18 ) ] )
% 0.74/1.18 .
% 0.74/1.18 clause( 3161, [ theorem( or( not( or( X, Y ) ), or( not( not( Y ) ), X ) )
% 0.74/1.18 ) ] )
% 0.74/1.18 .
% 0.74/1.18 clause( 3165, [ theorem( or( not( or( X, Y ) ), or( not( not( X ) ), Y ) )
% 0.74/1.18 ) ] )
% 0.74/1.18 .
% 0.74/1.18 clause( 3183, [ theorem( or( not( not( X ) ), or( not( or( X, Y ) ), Y ) )
% 0.74/1.18 ) ] )
% 0.74/1.18 .
% 0.74/1.18 clause( 3188, [] )
% 0.74/1.18 .
% 0.74/1.18
% 0.74/1.18
% 0.74/1.18 % SZS output end Refutation
% 0.74/1.18 found a proof!
% 0.74/1.18
% 0.74/1.18 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.74/1.18
% 0.74/1.18 initialclauses(
% 0.74/1.18 [ clause( 3190, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.74/1.18 , clause( 3191, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 0.74/1.18 , clause( 3192, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.74/1.18 , clause( 3193, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z )
% 0.74/1.18 ) ) ) ] )
% 0.74/1.18 , clause( 3194, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X )
% 0.74/1.18 ), or( Z, Y ) ) ) ) ] )
% 0.74/1.18 , clause( 3195, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.74/1.18 , clause( 3196, [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~( theorem(
% 0.74/1.18 Y ) ) ] )
% 0.74/1.18 , clause( 3197, [ theorem( or( not( X ), Y ) ), ~( axiom( or( not( X ), Z )
% 0.74/1.18 ) ), ~( theorem( or( not( Z ), Y ) ) ) ] )
% 0.74/1.18 , clause( 3198, [ ~( theorem( or( not( not( p ) ), or( not( or( p, q ) ), q
% 0.74/1.18 ) ) ) ) ] )
% 0.74/1.18 ] ).
% 0.74/1.18
% 0.74/1.18
% 0.74/1.18
% 0.74/1.18 subsumption(
% 0.74/1.18 clause( 0, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.74/1.18 , clause( 3190, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.74/1.18 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.18
% 0.74/1.18
% 0.74/1.18 subsumption(
% 0.74/1.18 clause( 1, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 0.74/1.18 , clause( 3191, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 0.74/1.18 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.74/1.18 )] ) ).
% 0.74/1.18
% 0.74/1.18
% 0.74/1.18 subsumption(
% 0.74/1.18 clause( 2, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.74/1.18 , clause( 3192, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.74/1.18 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.74/1.18 )] ) ).
% 0.74/1.18
% 0.74/1.18
% 0.74/1.18 subsumption(
% 0.74/1.18 clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) )
% 0.74/1.18 ] )
% 0.74/1.18 , clause( 3193, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z )
% 0.74/1.18 ) ) ) ] )
% 0.74/1.18 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.74/1.18 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.18
% 0.74/1.18
% 0.74/1.18 subsumption(
% 0.74/1.18 clause( 4, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) ), or(
% 0.74/1.18 Z, Y ) ) ) ) ] )
% 0.74/1.18 , clause( 3194, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X )
% 0.74/1.18 ), or( Z, Y ) ) ) ) ] )
% 0.74/1.18 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.74/1.18 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.18
% 0.74/1.18
% 0.74/1.18 subsumption(
% 0.74/1.18 clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.74/1.18 , clause( 3195, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.74/1.18 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.74/1.18 1 )] ) ).
% 0.74/1.18
% 0.74/1.18
% 0.74/1.18 subsumption(
% 0.74/1.18 clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X ) )
% 0.74/1.18 ) ] )
% 0.74/1.18 , clause( 3196, [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~( theorem(
% 0.74/1.18 Y ) ) ] )
% 0.74/1.18 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.74/1.18 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.74/1.19
% 0.74/1.19
% 0.74/1.19 subsumption(
% 0.74/1.19 clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y ) )
% 0.74/1.19 ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 0.74/1.19 , clause( 3197, [ theorem( or( not( X ), Y ) ), ~( axiom( or( not( X ), Z )
% 0.74/1.19 ) ), ~( theorem( or( not( Z ), Y ) ) ) ] )
% 0.74/1.19 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.74/1.19 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.74/1.19
% 0.74/1.19
% 0.74/1.19 subsumption(
% 0.74/1.19 clause( 8, [ ~( theorem( or( not( not( p ) ), or( not( or( p, q ) ), q ) )
% 0.74/1.19 ) ) ] )
% 0.74/1.19 , clause( 3198, [ ~( theorem( or( not( not( p ) ), or( not( or( p, q ) ), q
% 0.74/1.19 ) ) ) ) ] )
% 0.74/1.19 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.19
% 0.74/1.19
% 0.74/1.19 resolution(
% 0.74/1.19 clause( 3199, [ theorem( or( not( or( X, X ) ), X ) ) ] )
% 0.74/1.19 , clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.74/1.19 , 1, clause( 0, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.74/1.19 , 0, substitution( 0, [ :=( X, or( not( or( X, X ) ), X ) )] ),
% 0.74/1.19 substitution( 1, [ :=( X, X )] )).
% 0.74/1.19
% 0.74/1.19
% 0.74/1.19 subsumption(
% 0.74/1.19 clause( 10, [ theorem( or( not( or( X, X ) ), X ) ) ] )
% 0.74/1.19 , clause( 3199, [ theorem( or( not( or( X, X ) ), X ) ) ] )
% 0.74/1.19 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.19
% 0.74/1.19
% 0.74/1.19 resolution(
% 0.74/1.19 clause( 3200, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z
% 0.74/1.19 ) ) ) ) ] )
% 0.74/1.19 , clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X )
% 0.74/1.19 ) ) ] )
% 0.74/1.19 , 2, clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z )
% 0.74/1.19 ) ) ) ] )
% 0.74/1.19 , 0, substitution( 0, [ :=( X, or( X, or( Y, Z ) ) ), :=( Y, or( Y, or( X,
% 0.74/1.19 Z ) ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, X ), :=( Z, Z )] )).
% 0.74/1.19
% 0.74/1.19
% 0.74/1.19 subsumption(
% 0.74/1.19 clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z )
% 0.74/1.19 ) ) ) ] )
% 0.74/1.19 , clause( 3200, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X
% 0.74/1.19 , Z ) ) ) ) ] )
% 0.74/1.19 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.74/1.19 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.74/1.19
% 0.74/1.19
% 0.74/1.19 resolution(
% 0.74/1.19 clause( 3201, [ theorem( or( not( or( X, Y ) ), or( X, Z ) ) ), ~( theorem(
% 0.74/1.19 or( not( Y ), Z ) ) ) ] )
% 0.74/1.19 , clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X )
% 0.74/1.19 ) ) ] )
% 0.74/1.19 , 2, clause( 4, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X )
% 0.74/1.19 ), or( Z, Y ) ) ) ) ] )
% 0.74/1.19 , 0, substitution( 0, [ :=( X, or( not( or( X, Y ) ), or( X, Z ) ) ), :=( Y
% 0.74/1.19 , or( not( Y ), Z ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, Z ), :=(
% 0.74/1.19 Z, X )] )).
% 0.74/1.19
% 0.74/1.19
% 0.74/1.19 subsumption(
% 0.74/1.19 clause( 27, [ theorem( or( not( or( X, Y ) ), or( X, Z ) ) ), ~( theorem(
% 0.74/1.19 or( not( Y ), Z ) ) ) ] )
% 0.74/1.19 , clause( 3201, [ theorem( or( not( or( X, Y ) ), or( X, Z ) ) ), ~(
% 0.74/1.19 theorem( or( not( Y ), Z ) ) ) ] )
% 0.74/1.19 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.74/1.19 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.74/1.19
% 0.74/1.19
% 0.74/1.19 resolution(
% 0.74/1.19 clause( 3202, [ theorem( or( not( or( not( X ), Y ) ), Z ) ), ~( theorem(
% 0.74/1.19 or( not( or( not( or( T, X ) ), or( T, Y ) ) ), Z ) ) ) ] )
% 0.74/1.19 , clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y )
% 0.74/1.19 ) ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 0.74/1.19 , 2, clause( 4, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X )
% 0.74/1.19 ), or( Z, Y ) ) ) ) ] )
% 0.74/1.19 , 0, substitution( 0, [ :=( X, or( not( X ), Y ) ), :=( Y, Z ), :=( Z, or(
% 0.74/1.19 not( or( T, X ) ), or( T, Y ) ) )] ), substitution( 1, [ :=( X, X ), :=(
% 0.74/1.19 Y, Y ), :=( Z, T )] )).
% 0.74/1.19
% 0.74/1.19
% 0.74/1.19 subsumption(
% 0.74/1.19 clause( 34, [ theorem( or( not( or( not( X ), Y ) ), Z ) ), ~( theorem( or(
% 0.74/1.19 not( or( not( or( T, X ) ), or( T, Y ) ) ), Z ) ) ) ] )
% 0.74/1.19 , clause( 3202, [ theorem( or( not( or( not( X ), Y ) ), Z ) ), ~( theorem(
% 0.74/1.19 or( not( or( not( or( T, X ) ), or( T, Y ) ) ), Z ) ) ) ] )
% 0.74/1.19 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.74/1.19 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.74/1.19
% 0.74/1.19
% 0.74/1.19 resolution(
% 0.74/1.19 clause( 3203, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 0.74/1.19 or( Y, X ) ), Z ) ) ) ] )
% 0.74/1.19 , clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y )
% 0.74/1.19 ) ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 0.74/1.19 , 2, clause( 2, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.74/1.19 , 0, substitution( 0, [ :=( X, or( X, Y ) ), :=( Y, Z ), :=( Z, or( Y, X )
% 0.74/1.19 )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.74/1.19
% 0.74/1.19
% 0.74/1.19 subsumption(
% 0.74/1.19 clause( 36, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 0.74/1.19 or( Y, X ) ), Z ) ) ) ] )
% 0.74/1.19 , clause( 3203, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or(
% 0.74/1.19 not( or( Y, X ) ), Z ) ) ) ] )
% 0.74/1.19 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.74/1.19 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.74/1.19
% 0.74/1.19
% 0.74/1.19 resolution(
% 0.74/1.19 clause( 3204, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( or( Z, X
% 0.74/1.19 ) ), Y ) ) ) ] )
% 0.74/1.19 , clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y )
% 0.74/1.19 ) ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 0.74/1.19 , 2, clause( 1, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 0.74/1.19 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, or( Z, X ) )] ),
% 0.74/1.19 substitution( 1, [ :=( X, X ), :=( Y, Z )] )).
% 0.74/1.19
% 0.74/1.19
% 0.74/1.19 subsumption(
% 0.74/1.19 clause( 38, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( or( Z, X )
% 0.74/1.19 ), Y ) ) ) ] )
% 0.74/1.19 , clause( 3204, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( or( Z
% 0.74/1.19 , X ) ), Y ) ) ) ] )
% 0.74/1.19 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.74/1.19 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.74/1.19
% 0.74/1.19
% 0.74/1.19 resolution(
% 0.74/1.19 clause( 3205, [ theorem( or( not( or( X, or( Y, Y ) ) ), or( X, Y ) ) ) ]
% 0.74/1.19 )
% 0.74/1.19 , clause( 27, [ theorem( or( not( or( X, Y ) ), or( X, Z ) ) ), ~( theorem(
% 0.74/1.19 or( not( Y ), Z ) ) ) ] )
% 0.74/1.19 , 1, clause( 10, [ theorem( or( not( or( X, X ) ), X ) ) ] )
% 0.74/1.19 , 0, substitution( 0, [ :=( X, X ), :=( Y, or( Y, Y ) ), :=( Z, Y )] ),
% 0.74/1.19 substitution( 1, [ :=( X, Y )] )).
% 0.74/1.19
% 0.74/1.19
% 0.74/1.19 subsumption(
% 0.74/1.19 clause( 90, [ theorem( or( not( or( X, or( Y, Y ) ) ), or( X, Y ) ) ) ] )
% 0.74/1.19 , clause( 3205, [ theorem( or( not( or( X, or( Y, Y ) ) ), or( X, Y ) ) ) ]
% 0.74/1.19 )
% 0.74/1.19 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.74/1.19 )] ) ).
% 0.74/1.19
% 0.74/1.19
% 0.74/1.19 resolution(
% 0.74/1.19 clause( 3206, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( Y, X )
% 0.74/1.19 ), Y ) ) ) ] )
% 0.74/1.19 , clause( 34, [ theorem( or( not( or( not( X ), Y ) ), Z ) ), ~( theorem(
% 0.74/1.19 or( not( or( not( or( T, X ) ), or( T, Y ) ) ), Z ) ) ) ] )
% 0.74/1.19 , 1, clause( 90, [ theorem( or( not( or( X, or( Y, Y ) ) ), or( X, Y ) ) )
% 0.74/1.19 ] )
% 0.74/1.19 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, or( not( or( Y, X )
% 0.74/1.19 ), Y ) ), :=( T, Y )] ), substitution( 1, [ :=( X, not( or( Y, X ) ) ),
% 0.74/1.19 :=( Y, Y )] )).
% 0.74/1.19
% 0.74/1.19
% 0.74/1.19 subsumption(
% 0.74/1.19 clause( 665, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( Y, X ) )
% 0.74/1.19 , Y ) ) ) ] )
% 0.74/1.19 , clause( 3206, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( Y, X
% 0.74/1.19 ) ), Y ) ) ) ] )
% 0.74/1.19 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.74/1.19 )] ) ).
% 0.74/1.19
% 0.74/1.19
% 0.74/1.19 resolution(
% 0.74/1.19 clause( 3207, [ theorem( or( not( or( X, not( Y ) ) ), or( not( or( X, Y )
% 0.74/1.19 ), X ) ) ) ] )
% 0.74/1.19 , clause( 36, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 0.74/1.19 or( Y, X ) ), Z ) ) ) ] )
% 0.74/1.19 , 1, clause( 665, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( Y,
% 0.74/1.19 X ) ), Y ) ) ) ] )
% 0.74/1.19 , 0, substitution( 0, [ :=( X, X ), :=( Y, not( Y ) ), :=( Z, or( not( or(
% 0.74/1.19 X, Y ) ), X ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, X )] )).
% 0.74/1.19
% 0.74/1.19
% 0.74/1.19 subsumption(
% 0.74/1.19 clause( 3146, [ theorem( or( not( or( X, not( Y ) ) ), or( not( or( X, Y )
% 0.74/1.19 ), X ) ) ) ] )
% 0.74/1.19 , clause( 3207, [ theorem( or( not( or( X, not( Y ) ) ), or( not( or( X, Y
% 0.74/1.19 ) ), X ) ) ) ] )
% 0.74/1.19 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.74/1.19 )] ) ).
% 0.74/1.19
% 0.74/1.19
% 0.74/1.19 resolution(
% 0.74/1.19 clause( 3208, [ theorem( or( not( not( X ) ), or( not( or( Y, X ) ), Y ) )
% 0.74/1.19 ) ] )
% 0.74/1.19 , clause( 38, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( or( Z, X
% 0.74/1.19 ) ), Y ) ) ) ] )
% 0.74/1.19 , 1, clause( 3146, [ theorem( or( not( or( X, not( Y ) ) ), or( not( or( X
% 0.74/1.19 , Y ) ), X ) ) ) ] )
% 0.74/1.19 , 0, substitution( 0, [ :=( X, not( X ) ), :=( Y, or( not( or( Y, X ) ), Y
% 0.74/1.19 ) ), :=( Z, Y )] ), substitution( 1, [ :=( X, Y ), :=( Y, X )] )).
% 0.74/1.19
% 0.74/1.19
% 0.74/1.19 subsumption(
% 0.74/1.19 clause( 3153, [ theorem( or( not( not( X ) ), or( not( or( Y, X ) ), Y ) )
% 0.74/1.19 ) ] )
% 0.74/1.19 , clause( 3208, [ theorem( or( not( not( X ) ), or( not( or( Y, X ) ), Y )
% 0.74/1.19 ) ) ] )
% 0.74/1.19 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.74/1.19 )] ) ).
% 0.74/1.19
% 0.74/1.19
% 0.74/1.19 resolution(
% 0.74/1.19 clause( 3209, [ theorem( or( not( or( X, Y ) ), or( not( not( Y ) ), X ) )
% 0.74/1.19 ) ] )
% 0.74/1.19 , clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z
% 0.74/1.19 ) ) ) ) ] )
% 0.74/1.19 , 1, clause( 3153, [ theorem( or( not( not( X ) ), or( not( or( Y, X ) ), Y
% 0.74/1.19 ) ) ) ] )
% 0.74/1.19 , 0, substitution( 0, [ :=( X, not( or( X, Y ) ) ), :=( Y, not( not( Y ) )
% 0.74/1.19 ), :=( Z, X )] ), substitution( 1, [ :=( X, Y ), :=( Y, X )] )).
% 0.74/1.19
% 0.74/1.19
% 0.74/1.19 subsumption(
% 0.74/1.19 clause( 3161, [ theorem( or( not( or( X, Y ) ), or( not( not( Y ) ), X ) )
% 0.74/1.19 ) ] )
% 0.74/1.19 , clause( 3209, [ theorem( or( not( or( X, Y ) ), or( not( not( Y ) ), X )
% 0.74/1.19 ) ) ] )
% 0.74/1.19 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.74/1.19 )] ) ).
% 0.74/1.19
% 0.74/1.19
% 0.74/1.19 resolution(
% 0.74/1.19 clause( 3210, [ theorem( or( not( or( X, Y ) ), or( not( not( X ) ), Y ) )
% 0.74/1.19 ) ] )
% 0.74/1.19 , clause( 36, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 0.74/1.19 or( Y, X ) ), Z ) ) ) ] )
% 0.74/1.19 , 1, clause( 3161, [ theorem( or( not( or( X, Y ) ), or( not( not( Y ) ), X
% 0.74/1.19 ) ) ) ] )
% 0.74/1.19 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, or( not( not( X ) )
% 0.74/1.19 , Y ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, X )] )).
% 0.74/1.19
% 0.74/1.19
% 0.74/1.19 subsumption(
% 0.74/1.19 clause( 3165, [ theorem( or( not( or( X, Y ) ), or( not( not( X ) ), Y ) )
% 0.74/1.19 ) ] )
% 0.74/1.19 , clause( 3210, [ theorem( or( not( or( X, Y ) ), or( not( not( X ) ), Y )
% 0.74/1.19 ) ) ] )
% 0.74/1.19 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.74/1.19 )] ) ).
% 0.74/1.19
% 0.74/1.19
% 0.74/1.19 resolution(
% 0.74/1.19 clause( 3211, [ theorem( or( not( not( X ) ), or( not( or( X, Y ) ), Y ) )
% 0.74/1.19 ) ] )
% 0.74/1.19 , clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z
% 0.74/1.19 ) ) ) ) ] )
% 0.74/1.19 , 1, clause( 3165, [ theorem( or( not( or( X, Y ) ), or( not( not( X ) ), Y
% 0.74/1.19 ) ) ) ] )
% 0.74/1.19 , 0, substitution( 0, [ :=( X, not( not( X ) ) ), :=( Y, not( or( X, Y ) )
% 0.74/1.19 ), :=( Z, Y )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.74/1.19
% 0.74/1.19
% 0.74/1.19 subsumption(
% 0.74/1.19 clause( 3183, [ theorem( or( not( not( X ) ), or( not( or( X, Y ) ), Y ) )
% 0.74/1.19 ) ] )
% 0.74/1.19 , clause( 3211, [ theorem( or( not( not( X ) ), or( not( or( X, Y ) ), Y )
% 0.74/1.19 ) ) ] )
% 0.74/1.19 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.74/1.19 )] ) ).
% 0.74/1.19
% 0.74/1.19
% 0.74/1.19 resolution(
% 0.74/1.19 clause( 3212, [] )
% 0.74/1.19 , clause( 8, [ ~( theorem( or( not( not( p ) ), or( not( or( p, q ) ), q )
% 0.74/1.19 ) ) ) ] )
% 0.74/1.19 , 0, clause( 3183, [ theorem( or( not( not( X ) ), or( not( or( X, Y ) ), Y
% 0.74/1.19 ) ) ) ] )
% 0.74/1.19 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, p ), :=( Y, q )] )
% 0.74/1.19 ).
% 0.74/1.19
% 0.74/1.19
% 0.74/1.19 subsumption(
% 0.74/1.19 clause( 3188, [] )
% 0.74/1.19 , clause( 3212, [] )
% 0.74/1.19 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.74/1.19
% 0.74/1.19
% 0.74/1.19 end.
% 0.74/1.19
% 0.74/1.19 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.74/1.19
% 0.74/1.19 Memory use:
% 0.74/1.19
% 0.74/1.19 space for terms: 50171
% 0.74/1.19 space for clauses: 249035
% 0.74/1.19
% 0.74/1.19
% 0.74/1.19 clauses generated: 5403
% 0.74/1.19 clauses kept: 3189
% 0.74/1.19 clauses selected: 901
% 0.74/1.19 clauses deleted: 17
% 0.74/1.19 clauses inuse deleted: 0
% 0.74/1.19
% 0.74/1.19 subsentry: 2348
% 0.74/1.19 literals s-matched: 2348
% 0.74/1.19 literals matched: 2348
% 0.74/1.19 full subsumption: 0
% 0.74/1.19
% 0.74/1.19 checksum: 469705821
% 0.74/1.19
% 0.74/1.19
% 0.74/1.19 Bliksem ended
%------------------------------------------------------------------------------