TSTP Solution File: LCL186-10 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL186-10 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n028.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:24 EDT 2022
% Result : Unsatisfiable 0.70s 1.09s
% Output : Refutation 0.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LCL186-10 : TPTP v8.1.0. Released v7.5.0.
% 0.04/0.13 % Command : bliksem %s
% 0.12/0.34 % Computer : n028.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 03:57:04 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.70/1.09 *** allocated 10000 integers for termspace/termends
% 0.70/1.09 *** allocated 10000 integers for clauses
% 0.70/1.09 *** allocated 10000 integers for justifications
% 0.70/1.09 Bliksem 1.12
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Automatic Strategy Selection
% 0.70/1.09
% 0.70/1.09 Clauses:
% 0.70/1.09 [
% 0.70/1.09 [ =( ifeq( X, X, Y, Z ), Y ) ],
% 0.70/1.09 [ =( axiom( or( not( or( X, X ) ), X ) ), true ) ],
% 0.70/1.09 [ =( axiom( or( not( X ), or( Y, X ) ) ), true ) ],
% 0.70/1.09 [ =( axiom( or( not( or( X, Y ) ), or( Y, X ) ) ), true ) ],
% 0.70/1.09 [ =( axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) ),
% 0.70/1.09 true ) ],
% 0.70/1.09 [ =( axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) ), or( Z,
% 0.70/1.09 Y ) ) ) ), true ) ],
% 0.70/1.09 [ =( ifeq( axiom( X ), true, theorem( X ), true ), true ) ],
% 0.70/1.09 [ =( ifeq( theorem( X ), true, ifeq( axiom( or( not( X ), Y ) ), true,
% 0.70/1.09 theorem( Y ), true ), true ), true ) ],
% 0.70/1.09 [ =( ifeq( theorem( or( not( X ), Y ) ), true, ifeq( axiom( or( not( Z )
% 0.70/1.09 , X ) ), true, theorem( or( not( Z ), Y ) ), true ), true ), true ) ]
% 0.70/1.09 ,
% 0.70/1.09 [ ~( =( theorem( or( not( not( p ) ), or( not( p ), q ) ) ), true ) ) ]
% 0.70/1.09
% 0.70/1.09 ] .
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 percentage equality = 1.000000, percentage horn = 1.000000
% 0.70/1.09 This is a pure equality problem
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Options Used:
% 0.70/1.09
% 0.70/1.09 useres = 1
% 0.70/1.09 useparamod = 1
% 0.70/1.09 useeqrefl = 1
% 0.70/1.09 useeqfact = 1
% 0.70/1.09 usefactor = 1
% 0.70/1.09 usesimpsplitting = 0
% 0.70/1.09 usesimpdemod = 5
% 0.70/1.09 usesimpres = 3
% 0.70/1.09
% 0.70/1.09 resimpinuse = 1000
% 0.70/1.09 resimpclauses = 20000
% 0.70/1.09 substype = eqrewr
% 0.70/1.09 backwardsubs = 1
% 0.70/1.09 selectoldest = 5
% 0.70/1.09
% 0.70/1.09 litorderings [0] = split
% 0.70/1.09 litorderings [1] = extend the termordering, first sorting on arguments
% 0.70/1.09
% 0.70/1.09 termordering = kbo
% 0.70/1.09
% 0.70/1.09 litapriori = 0
% 0.70/1.09 termapriori = 1
% 0.70/1.09 litaposteriori = 0
% 0.70/1.09 termaposteriori = 0
% 0.70/1.09 demodaposteriori = 0
% 0.70/1.09 ordereqreflfact = 0
% 0.70/1.09
% 0.70/1.09 litselect = negord
% 0.70/1.09
% 0.70/1.09 maxweight = 15
% 0.70/1.09 maxdepth = 30000
% 0.70/1.09 maxlength = 115
% 0.70/1.09 maxnrvars = 195
% 0.70/1.09 excuselevel = 1
% 0.70/1.09 increasemaxweight = 1
% 0.70/1.09
% 0.70/1.09 maxselected = 10000000
% 0.70/1.09 maxnrclauses = 10000000
% 0.70/1.09
% 0.70/1.09 showgenerated = 0
% 0.70/1.09 showkept = 0
% 0.70/1.09 showselected = 0
% 0.70/1.09 showdeleted = 0
% 0.70/1.09 showresimp = 1
% 0.70/1.09 showstatus = 2000
% 0.70/1.09
% 0.70/1.09 prologoutput = 1
% 0.70/1.09 nrgoals = 5000000
% 0.70/1.09 totalproof = 1
% 0.70/1.09
% 0.70/1.09 Symbols occurring in the translation:
% 0.70/1.09
% 0.70/1.09 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.70/1.09 . [1, 2] (w:1, o:26, a:1, s:1, b:0),
% 0.70/1.09 ! [4, 1] (w:0, o:18, a:1, s:1, b:0),
% 0.70/1.09 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.70/1.09 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.70/1.09 ifeq [42, 4] (w:1, o:52, a:1, s:1, b:0),
% 0.70/1.09 or [43, 2] (w:1, o:51, a:1, s:1, b:0),
% 0.70/1.09 not [44, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.70/1.09 axiom [45, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.70/1.09 true [46, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.70/1.09 theorem [48, 1] (w:1, o:25, a:1, s:1, b:0),
% 0.70/1.09 p [51, 0] (w:1, o:16, a:1, s:1, b:0),
% 0.70/1.09 q [52, 0] (w:1, o:17, a:1, s:1, b:0).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Starting Search:
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Bliksems!, er is een bewijs:
% 0.70/1.09 % SZS status Unsatisfiable
% 0.70/1.09 % SZS output start Refutation
% 0.70/1.09
% 0.70/1.09 clause( 0, [ =( ifeq( X, X, Y, Z ), Y ) ] )
% 0.70/1.09 .
% 0.70/1.09 clause( 2, [ =( axiom( or( not( X ), or( Y, X ) ) ), true ) ] )
% 0.70/1.09 .
% 0.70/1.09 clause( 3, [ =( axiom( or( not( or( X, Y ) ), or( Y, X ) ) ), true ) ] )
% 0.70/1.09 .
% 0.70/1.09 clause( 6, [ =( ifeq( axiom( X ), true, theorem( X ), true ), true ) ] )
% 0.70/1.09 .
% 0.70/1.09 clause( 8, [ =( ifeq( theorem( or( not( X ), Y ) ), true, ifeq( axiom( or(
% 0.70/1.09 not( Z ), X ) ), true, theorem( or( not( Z ), Y ) ), true ), true ), true
% 0.70/1.09 ) ] )
% 0.70/1.09 .
% 0.70/1.09 clause( 9, [ ~( =( theorem( or( not( not( p ) ), or( not( p ), q ) ) ),
% 0.70/1.09 true ) ) ] )
% 0.70/1.09 .
% 0.70/1.09 clause( 12, [ =( theorem( or( not( or( X, Y ) ), or( Y, X ) ) ), true ) ]
% 0.70/1.09 )
% 0.70/1.09 .
% 0.70/1.09 clause( 31, [ =( ifeq( theorem( or( not( or( Y, X ) ), Z ) ), true, theorem(
% 0.70/1.09 or( not( X ), Z ) ), true ), true ) ] )
% 0.70/1.09 .
% 0.70/1.09 clause( 148, [ =( theorem( or( not( Y ), or( Y, X ) ) ), true ) ] )
% 0.70/1.09 .
% 0.70/1.09 clause( 149, [] )
% 0.70/1.09 .
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 % SZS output end Refutation
% 0.70/1.09 found a proof!
% 0.70/1.09
% 0.70/1.09 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.70/1.09
% 0.70/1.09 initialclauses(
% 0.70/1.09 [ clause( 151, [ =( ifeq( X, X, Y, Z ), Y ) ] )
% 0.70/1.09 , clause( 152, [ =( axiom( or( not( or( X, X ) ), X ) ), true ) ] )
% 0.70/1.09 , clause( 153, [ =( axiom( or( not( X ), or( Y, X ) ) ), true ) ] )
% 0.70/1.09 , clause( 154, [ =( axiom( or( not( or( X, Y ) ), or( Y, X ) ) ), true ) ]
% 0.70/1.09 )
% 0.70/1.09 , clause( 155, [ =( axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z
% 0.70/1.09 ) ) ) ), true ) ] )
% 0.70/1.09 , clause( 156, [ =( axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X
% 0.70/1.09 ) ), or( Z, Y ) ) ) ), true ) ] )
% 0.70/1.09 , clause( 157, [ =( ifeq( axiom( X ), true, theorem( X ), true ), true ) ]
% 0.70/1.09 )
% 0.70/1.09 , clause( 158, [ =( ifeq( theorem( X ), true, ifeq( axiom( or( not( X ), Y
% 0.70/1.09 ) ), true, theorem( Y ), true ), true ), true ) ] )
% 0.70/1.09 , clause( 159, [ =( ifeq( theorem( or( not( X ), Y ) ), true, ifeq( axiom(
% 0.70/1.09 or( not( Z ), X ) ), true, theorem( or( not( Z ), Y ) ), true ), true ),
% 0.70/1.09 true ) ] )
% 0.70/1.09 , clause( 160, [ ~( =( theorem( or( not( not( p ) ), or( not( p ), q ) ) )
% 0.70/1.09 , true ) ) ] )
% 0.70/1.09 ] ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 subsumption(
% 0.70/1.09 clause( 0, [ =( ifeq( X, X, Y, Z ), Y ) ] )
% 0.70/1.09 , clause( 151, [ =( ifeq( X, X, Y, Z ), Y ) ] )
% 0.70/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.70/1.09 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 subsumption(
% 0.70/1.09 clause( 2, [ =( axiom( or( not( X ), or( Y, X ) ) ), true ) ] )
% 0.70/1.09 , clause( 153, [ =( axiom( or( not( X ), or( Y, X ) ) ), true ) ] )
% 0.70/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.70/1.09 )] ) ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 subsumption(
% 0.70/1.09 clause( 3, [ =( axiom( or( not( or( X, Y ) ), or( Y, X ) ) ), true ) ] )
% 0.70/1.09 , clause( 154, [ =( axiom( or( not( or( X, Y ) ), or( Y, X ) ) ), true ) ]
% 0.70/1.09 )
% 0.70/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.70/1.09 )] ) ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 subsumption(
% 0.70/1.09 clause( 6, [ =( ifeq( axiom( X ), true, theorem( X ), true ), true ) ] )
% 0.70/1.09 , clause( 157, [ =( ifeq( axiom( X ), true, theorem( X ), true ), true ) ]
% 0.70/1.09 )
% 0.70/1.09 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 subsumption(
% 0.70/1.09 clause( 8, [ =( ifeq( theorem( or( not( X ), Y ) ), true, ifeq( axiom( or(
% 0.70/1.09 not( Z ), X ) ), true, theorem( or( not( Z ), Y ) ), true ), true ), true
% 0.70/1.09 ) ] )
% 0.70/1.09 , clause( 159, [ =( ifeq( theorem( or( not( X ), Y ) ), true, ifeq( axiom(
% 0.70/1.09 or( not( Z ), X ) ), true, theorem( or( not( Z ), Y ) ), true ), true ),
% 0.70/1.09 true ) ] )
% 0.70/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.70/1.09 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 subsumption(
% 0.70/1.09 clause( 9, [ ~( =( theorem( or( not( not( p ) ), or( not( p ), q ) ) ),
% 0.70/1.09 true ) ) ] )
% 0.70/1.09 , clause( 160, [ ~( =( theorem( or( not( not( p ) ), or( not( p ), q ) ) )
% 0.70/1.09 , true ) ) ] )
% 0.70/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 eqswap(
% 0.70/1.09 clause( 196, [ =( true, ifeq( axiom( X ), true, theorem( X ), true ) ) ] )
% 0.70/1.09 , clause( 6, [ =( ifeq( axiom( X ), true, theorem( X ), true ), true ) ] )
% 0.70/1.09 , 0, substitution( 0, [ :=( X, X )] )).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 paramod(
% 0.70/1.09 clause( 198, [ =( true, ifeq( true, true, theorem( or( not( or( X, Y ) ),
% 0.70/1.09 or( Y, X ) ) ), true ) ) ] )
% 0.70/1.09 , clause( 3, [ =( axiom( or( not( or( X, Y ) ), or( Y, X ) ) ), true ) ] )
% 0.70/1.09 , 0, clause( 196, [ =( true, ifeq( axiom( X ), true, theorem( X ), true ) )
% 0.70/1.09 ] )
% 0.70/1.09 , 0, 3, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [
% 0.70/1.09 :=( X, or( not( or( X, Y ) ), or( Y, X ) ) )] )).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 paramod(
% 0.70/1.09 clause( 199, [ =( true, theorem( or( not( or( X, Y ) ), or( Y, X ) ) ) ) ]
% 0.70/1.09 )
% 0.70/1.09 , clause( 0, [ =( ifeq( X, X, Y, Z ), Y ) ] )
% 0.70/1.09 , 0, clause( 198, [ =( true, ifeq( true, true, theorem( or( not( or( X, Y )
% 0.70/1.09 ), or( Y, X ) ) ), true ) ) ] )
% 0.70/1.09 , 0, 2, substitution( 0, [ :=( X, true ), :=( Y, theorem( or( not( or( X, Y
% 0.70/1.09 ) ), or( Y, X ) ) ) ), :=( Z, true )] ), substitution( 1, [ :=( X, X ),
% 0.70/1.09 :=( Y, Y )] )).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 eqswap(
% 0.70/1.09 clause( 200, [ =( theorem( or( not( or( X, Y ) ), or( Y, X ) ) ), true ) ]
% 0.70/1.09 )
% 0.70/1.09 , clause( 199, [ =( true, theorem( or( not( or( X, Y ) ), or( Y, X ) ) ) )
% 0.70/1.09 ] )
% 0.70/1.09 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 subsumption(
% 0.70/1.09 clause( 12, [ =( theorem( or( not( or( X, Y ) ), or( Y, X ) ) ), true ) ]
% 0.70/1.09 )
% 0.70/1.09 , clause( 200, [ =( theorem( or( not( or( X, Y ) ), or( Y, X ) ) ), true )
% 0.70/1.09 ] )
% 0.70/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.70/1.09 )] ) ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 eqswap(
% 0.70/1.09 clause( 202, [ =( true, ifeq( theorem( or( not( X ), Y ) ), true, ifeq(
% 0.70/1.09 axiom( or( not( Z ), X ) ), true, theorem( or( not( Z ), Y ) ), true ),
% 0.70/1.09 true ) ) ] )
% 0.70/1.09 , clause( 8, [ =( ifeq( theorem( or( not( X ), Y ) ), true, ifeq( axiom( or(
% 0.70/1.09 not( Z ), X ) ), true, theorem( or( not( Z ), Y ) ), true ), true ), true
% 0.70/1.09 ) ] )
% 0.70/1.09 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 paramod(
% 0.70/1.09 clause( 204, [ =( true, ifeq( theorem( or( not( or( X, Y ) ), Z ) ), true,
% 0.70/1.09 ifeq( true, true, theorem( or( not( Y ), Z ) ), true ), true ) ) ] )
% 0.70/1.09 , clause( 2, [ =( axiom( or( not( X ), or( Y, X ) ) ), true ) ] )
% 0.70/1.09 , 0, clause( 202, [ =( true, ifeq( theorem( or( not( X ), Y ) ), true, ifeq(
% 0.70/1.09 axiom( or( not( Z ), X ) ), true, theorem( or( not( Z ), Y ) ), true ),
% 0.70/1.09 true ) ) ] )
% 0.70/1.09 , 0, 12, substitution( 0, [ :=( X, Y ), :=( Y, X )] ), substitution( 1, [
% 0.70/1.09 :=( X, or( X, Y ) ), :=( Y, Z ), :=( Z, Y )] )).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 paramod(
% 0.70/1.09 clause( 205, [ =( true, ifeq( theorem( or( not( or( X, Y ) ), Z ) ), true,
% 0.70/1.09 theorem( or( not( Y ), Z ) ), true ) ) ] )
% 0.70/1.09 , clause( 0, [ =( ifeq( X, X, Y, Z ), Y ) ] )
% 0.70/1.09 , 0, clause( 204, [ =( true, ifeq( theorem( or( not( or( X, Y ) ), Z ) ),
% 0.70/1.09 true, ifeq( true, true, theorem( or( not( Y ), Z ) ), true ), true ) ) ]
% 0.70/1.09 )
% 0.70/1.09 , 0, 11, substitution( 0, [ :=( X, true ), :=( Y, theorem( or( not( Y ), Z
% 0.70/1.09 ) ) ), :=( Z, true )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ), :=(
% 0.70/1.09 Z, Z )] )).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 eqswap(
% 0.70/1.09 clause( 206, [ =( ifeq( theorem( or( not( or( X, Y ) ), Z ) ), true,
% 0.70/1.09 theorem( or( not( Y ), Z ) ), true ), true ) ] )
% 0.70/1.09 , clause( 205, [ =( true, ifeq( theorem( or( not( or( X, Y ) ), Z ) ), true
% 0.70/1.09 , theorem( or( not( Y ), Z ) ), true ) ) ] )
% 0.70/1.09 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 subsumption(
% 0.70/1.09 clause( 31, [ =( ifeq( theorem( or( not( or( Y, X ) ), Z ) ), true, theorem(
% 0.70/1.09 or( not( X ), Z ) ), true ), true ) ] )
% 0.70/1.09 , clause( 206, [ =( ifeq( theorem( or( not( or( X, Y ) ), Z ) ), true,
% 0.70/1.09 theorem( or( not( Y ), Z ) ), true ), true ) ] )
% 0.70/1.09 , substitution( 0, [ :=( X, Y ), :=( Y, X ), :=( Z, Z )] ),
% 0.70/1.09 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 eqswap(
% 0.70/1.09 clause( 208, [ =( true, ifeq( theorem( or( not( or( X, Y ) ), Z ) ), true,
% 0.70/1.09 theorem( or( not( Y ), Z ) ), true ) ) ] )
% 0.70/1.09 , clause( 31, [ =( ifeq( theorem( or( not( or( Y, X ) ), Z ) ), true,
% 0.70/1.09 theorem( or( not( X ), Z ) ), true ), true ) ] )
% 0.70/1.09 , 0, substitution( 0, [ :=( X, Y ), :=( Y, X ), :=( Z, Z )] )).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 paramod(
% 0.70/1.09 clause( 210, [ =( true, ifeq( true, true, theorem( or( not( Y ), or( Y, X )
% 0.70/1.09 ) ), true ) ) ] )
% 0.70/1.09 , clause( 12, [ =( theorem( or( not( or( X, Y ) ), or( Y, X ) ) ), true ) ]
% 0.70/1.09 )
% 0.70/1.09 , 0, clause( 208, [ =( true, ifeq( theorem( or( not( or( X, Y ) ), Z ) ),
% 0.70/1.09 true, theorem( or( not( Y ), Z ) ), true ) ) ] )
% 0.70/1.09 , 0, 3, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [
% 0.70/1.09 :=( X, X ), :=( Y, Y ), :=( Z, or( Y, X ) )] )).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 paramod(
% 0.70/1.09 clause( 212, [ =( true, theorem( or( not( X ), or( X, Y ) ) ) ) ] )
% 0.70/1.09 , clause( 0, [ =( ifeq( X, X, Y, Z ), Y ) ] )
% 0.70/1.09 , 0, clause( 210, [ =( true, ifeq( true, true, theorem( or( not( Y ), or( Y
% 0.70/1.09 , X ) ) ), true ) ) ] )
% 0.70/1.09 , 0, 2, substitution( 0, [ :=( X, true ), :=( Y, theorem( or( not( X ), or(
% 0.70/1.09 X, Y ) ) ) ), :=( Z, true )] ), substitution( 1, [ :=( X, Y ), :=( Y, X )] )
% 0.70/1.09 ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 eqswap(
% 0.70/1.09 clause( 213, [ =( theorem( or( not( X ), or( X, Y ) ) ), true ) ] )
% 0.70/1.09 , clause( 212, [ =( true, theorem( or( not( X ), or( X, Y ) ) ) ) ] )
% 0.70/1.09 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 subsumption(
% 0.70/1.09 clause( 148, [ =( theorem( or( not( Y ), or( Y, X ) ) ), true ) ] )
% 0.70/1.09 , clause( 213, [ =( theorem( or( not( X ), or( X, Y ) ) ), true ) ] )
% 0.70/1.09 , substitution( 0, [ :=( X, Y ), :=( Y, X )] ), permutation( 0, [ ==>( 0, 0
% 0.70/1.09 )] ) ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 eqswap(
% 0.70/1.09 clause( 214, [ =( true, theorem( or( not( X ), or( X, Y ) ) ) ) ] )
% 0.70/1.09 , clause( 148, [ =( theorem( or( not( Y ), or( Y, X ) ) ), true ) ] )
% 0.70/1.09 , 0, substitution( 0, [ :=( X, Y ), :=( Y, X )] )).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 eqswap(
% 0.70/1.09 clause( 215, [ ~( =( true, theorem( or( not( not( p ) ), or( not( p ), q )
% 0.70/1.09 ) ) ) ) ] )
% 0.70/1.09 , clause( 9, [ ~( =( theorem( or( not( not( p ) ), or( not( p ), q ) ) ),
% 0.70/1.09 true ) ) ] )
% 0.70/1.09 , 0, substitution( 0, [] )).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 resolution(
% 0.70/1.09 clause( 216, [] )
% 0.70/1.09 , clause( 215, [ ~( =( true, theorem( or( not( not( p ) ), or( not( p ), q
% 0.70/1.09 ) ) ) ) ) ] )
% 0.70/1.09 , 0, clause( 214, [ =( true, theorem( or( not( X ), or( X, Y ) ) ) ) ] )
% 0.70/1.09 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, not( p ) ), :=( Y, q
% 0.70/1.09 )] )).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 subsumption(
% 0.70/1.09 clause( 149, [] )
% 0.70/1.09 , clause( 216, [] )
% 0.70/1.09 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 end.
% 0.70/1.09
% 0.70/1.09 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.70/1.09
% 0.70/1.09 Memory use:
% 0.70/1.09
% 0.70/1.09 space for terms: 2238
% 0.70/1.09 space for clauses: 17331
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 clauses generated: 1283
% 0.70/1.09 clauses kept: 150
% 0.70/1.09 clauses selected: 59
% 0.70/1.09 clauses deleted: 3
% 0.70/1.09 clauses inuse deleted: 0
% 0.70/1.09
% 0.70/1.09 subsentry: 250
% 0.70/1.09 literals s-matched: 119
% 0.70/1.09 literals matched: 119
% 0.70/1.09 full subsumption: 0
% 0.70/1.09
% 0.70/1.09 checksum: -1600035761
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Bliksem ended
%------------------------------------------------------------------------------