TSTP Solution File: LCL041-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL041-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n017.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:49:32 EDT 2022
% Result : Unsatisfiable 0.44s 1.09s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LCL041-1 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.13 % Command : bliksem %s
% 0.12/0.34 % Computer : n017.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 : Sat Jul 2 18:22:40 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.44/1.09 *** allocated 10000 integers for termspace/termends
% 0.44/1.09 *** allocated 10000 integers for clauses
% 0.44/1.09 *** allocated 10000 integers for justifications
% 0.44/1.09 Bliksem 1.12
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 Automatic Strategy Selection
% 0.44/1.09
% 0.44/1.09 Clauses:
% 0.44/1.09 [
% 0.44/1.09 [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'( X ) ),
% 0.44/1.09 'is_a_theorem'( Y ) ],
% 0.44/1.09 [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ],
% 0.44/1.09 [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ],
% 0.44/1.09 [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) ), implies( Y,
% 0.44/1.09 implies( X, Z ) ) ) ) ],
% 0.44/1.09 [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies( Z, X ),
% 0.44/1.09 implies( Z, Y ) ) ) ) ],
% 0.44/1.09 [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies( not( X ),
% 0.44/1.09 Y ), Y ) ) ) ],
% 0.44/1.09 [ ~( 'is_a_theorem'( implies( implies( a, implies( a, b ) ), implies( a
% 0.44/1.09 , b ) ) ) ) ]
% 0.44/1.09 ] .
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 percentage equality = 0.000000, percentage horn = 1.000000
% 0.44/1.09 This is a near-Horn, non-equality problem
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 Options Used:
% 0.44/1.09
% 0.44/1.09 useres = 1
% 0.44/1.09 useparamod = 0
% 0.44/1.09 useeqrefl = 0
% 0.44/1.09 useeqfact = 0
% 0.44/1.09 usefactor = 1
% 0.44/1.09 usesimpsplitting = 0
% 0.44/1.09 usesimpdemod = 0
% 0.44/1.09 usesimpres = 4
% 0.44/1.09
% 0.44/1.09 resimpinuse = 1000
% 0.44/1.09 resimpclauses = 20000
% 0.44/1.09 substype = standard
% 0.44/1.09 backwardsubs = 1
% 0.44/1.09 selectoldest = 5
% 0.44/1.09
% 0.44/1.09 litorderings [0] = split
% 0.44/1.09 litorderings [1] = liftord
% 0.44/1.09
% 0.44/1.09 termordering = none
% 0.44/1.09
% 0.44/1.09 litapriori = 1
% 0.44/1.09 termapriori = 0
% 0.44/1.09 litaposteriori = 0
% 0.44/1.09 termaposteriori = 0
% 0.44/1.09 demodaposteriori = 0
% 0.44/1.09 ordereqreflfact = 0
% 0.44/1.09
% 0.44/1.09 litselect = negative
% 0.44/1.09
% 0.44/1.09 maxweight = 30000
% 0.44/1.09 maxdepth = 30000
% 0.44/1.09 maxlength = 115
% 0.44/1.09 maxnrvars = 195
% 0.44/1.09 excuselevel = 0
% 0.44/1.09 increasemaxweight = 0
% 0.44/1.09
% 0.44/1.09 maxselected = 10000000
% 0.44/1.09 maxnrclauses = 10000000
% 0.44/1.09
% 0.44/1.09 showgenerated = 0
% 0.44/1.09 showkept = 0
% 0.44/1.09 showselected = 0
% 0.44/1.09 showdeleted = 0
% 0.44/1.09 showresimp = 1
% 0.44/1.09 showstatus = 2000
% 0.44/1.09
% 0.44/1.09 prologoutput = 1
% 0.44/1.09 nrgoals = 5000000
% 0.44/1.09 totalproof = 1
% 0.44/1.09
% 0.44/1.09 Symbols occurring in the translation:
% 0.44/1.09
% 0.44/1.09 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.44/1.09 . [1, 2] (w:1, o:21, a:1, s:1, b:0),
% 0.44/1.09 ! [4, 1] (w:1, o:14, a:1, s:1, b:0),
% 0.44/1.09 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.44/1.09 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.44/1.09 implies [41, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.44/1.09 'is_a_theorem' [42, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.44/1.09 not [43, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.44/1.09 a [45, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.44/1.09 b [46, 0] (w:1, o:13, a:1, s:1, b:0).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 Starting Search:
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 Bliksems!, er is een bewijs:
% 0.44/1.09 % SZS status Unsatisfiable
% 0.44/1.09 % SZS output start Refutation
% 0.44/1.09
% 0.44/1.09 clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y ),
% 0.44/1.09 ~( 'is_a_theorem'( X ) ) ] )
% 0.44/1.09 .
% 0.44/1.09 clause( 1, [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ] )
% 0.44/1.09 .
% 0.44/1.09 clause( 3, [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) ),
% 0.44/1.09 implies( Y, implies( X, Z ) ) ) ) ] )
% 0.44/1.09 .
% 0.44/1.09 clause( 5, [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies(
% 0.44/1.09 not( X ), Y ), Y ) ) ) ] )
% 0.44/1.09 .
% 0.44/1.09 clause( 6, [ ~( 'is_a_theorem'( implies( implies( a, implies( a, b ) ),
% 0.44/1.09 implies( a, b ) ) ) ) ] )
% 0.44/1.09 .
% 0.44/1.09 clause( 7, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X,
% 0.44/1.09 implies( not( X ), Y ) ), Z ) ) ) ] )
% 0.44/1.09 .
% 0.44/1.09 clause( 29, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies(
% 0.44/1.09 implies( X, Y ), implies( implies( not( X ), Y ), Y ) ), Z ) ) ) ] )
% 0.44/1.09 .
% 0.44/1.09 clause( 42, [ 'is_a_theorem'( implies( not( X ), implies( X, Y ) ) ) ] )
% 0.44/1.09 .
% 0.44/1.09 clause( 45, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( not(
% 0.44/1.09 X ), implies( X, Y ) ), Z ) ) ) ] )
% 0.44/1.09 .
% 0.44/1.09 clause( 214, [ 'is_a_theorem'( implies( implies( not( X ), Y ), implies(
% 0.44/1.09 implies( X, Y ), Y ) ) ) ] )
% 0.44/1.09 .
% 0.44/1.09 clause( 386, [ 'is_a_theorem'( implies( implies( X, implies( X, Y ) ),
% 0.44/1.09 implies( X, Y ) ) ) ] )
% 0.44/1.09 .
% 0.44/1.09 clause( 402, [] )
% 0.44/1.09 .
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 % SZS output end Refutation
% 0.44/1.09 found a proof!
% 0.44/1.09
% 0.44/1.09 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.44/1.09
% 0.44/1.09 initialclauses(
% 0.44/1.09 [ clause( 404, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'(
% 0.44/1.09 X ) ), 'is_a_theorem'( Y ) ] )
% 0.44/1.09 , clause( 405, [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ]
% 0.44/1.09 )
% 0.44/1.09 , clause( 406, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.44/1.09 , clause( 407, [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) ),
% 0.44/1.09 implies( Y, implies( X, Z ) ) ) ) ] )
% 0.44/1.09 , clause( 408, [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies(
% 0.44/1.09 Z, X ), implies( Z, Y ) ) ) ) ] )
% 0.44/1.09 , clause( 409, [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies(
% 0.44/1.09 not( X ), Y ), Y ) ) ) ] )
% 0.44/1.09 , clause( 410, [ ~( 'is_a_theorem'( implies( implies( a, implies( a, b ) )
% 0.44/1.09 , implies( a, b ) ) ) ) ] )
% 0.44/1.09 ] ).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 subsumption(
% 0.44/1.09 clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y ),
% 0.44/1.09 ~( 'is_a_theorem'( X ) ) ] )
% 0.44/1.09 , clause( 404, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'(
% 0.44/1.09 X ) ), 'is_a_theorem'( Y ) ] )
% 0.44/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.44/1.09 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 subsumption(
% 0.44/1.09 clause( 1, [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ] )
% 0.44/1.09 , clause( 405, [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ]
% 0.44/1.09 )
% 0.44/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.44/1.09 )] ) ).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 subsumption(
% 0.44/1.09 clause( 3, [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) ),
% 0.44/1.09 implies( Y, implies( X, Z ) ) ) ) ] )
% 0.44/1.09 , clause( 407, [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) ),
% 0.44/1.09 implies( Y, implies( X, Z ) ) ) ) ] )
% 0.44/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.44/1.09 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 subsumption(
% 0.44/1.09 clause( 5, [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies(
% 0.44/1.09 not( X ), Y ), Y ) ) ) ] )
% 0.44/1.09 , clause( 409, [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies(
% 0.44/1.09 not( X ), Y ), Y ) ) ) ] )
% 0.44/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.44/1.09 )] ) ).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 subsumption(
% 0.44/1.09 clause( 6, [ ~( 'is_a_theorem'( implies( implies( a, implies( a, b ) ),
% 0.44/1.09 implies( a, b ) ) ) ) ] )
% 0.44/1.09 , clause( 410, [ ~( 'is_a_theorem'( implies( implies( a, implies( a, b ) )
% 0.44/1.09 , implies( a, b ) ) ) ) ] )
% 0.44/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 resolution(
% 0.44/1.09 clause( 412, [ ~( 'is_a_theorem'( implies( implies( X, implies( not( X ), Y
% 0.44/1.09 ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.44/1.09 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.44/1.09 , ~( 'is_a_theorem'( X ) ) ] )
% 0.44/1.09 , 2, clause( 1, [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ]
% 0.44/1.09 )
% 0.44/1.09 , 0, substitution( 0, [ :=( X, implies( X, implies( not( X ), Y ) ) ), :=(
% 0.44/1.09 Y, Z )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 subsumption(
% 0.44/1.09 clause( 7, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X,
% 0.44/1.09 implies( not( X ), Y ) ), Z ) ) ) ] )
% 0.44/1.09 , clause( 412, [ ~( 'is_a_theorem'( implies( implies( X, implies( not( X )
% 0.44/1.09 , Y ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.44/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.44/1.09 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 resolution(
% 0.44/1.09 clause( 414, [ ~( 'is_a_theorem'( implies( implies( implies( X, Y ),
% 0.44/1.09 implies( implies( not( X ), Y ), Y ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.44/1.09 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.44/1.09 , ~( 'is_a_theorem'( X ) ) ] )
% 0.44/1.09 , 2, clause( 5, [ 'is_a_theorem'( implies( implies( X, Y ), implies(
% 0.44/1.09 implies( not( X ), Y ), Y ) ) ) ] )
% 0.44/1.09 , 0, substitution( 0, [ :=( X, implies( implies( X, Y ), implies( implies(
% 0.44/1.09 not( X ), Y ), Y ) ) ), :=( Y, Z )] ), substitution( 1, [ :=( X, X ),
% 0.44/1.09 :=( Y, Y )] )).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 subsumption(
% 0.44/1.09 clause( 29, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies(
% 0.44/1.09 implies( X, Y ), implies( implies( not( X ), Y ), Y ) ), Z ) ) ) ] )
% 0.44/1.09 , clause( 414, [ ~( 'is_a_theorem'( implies( implies( implies( X, Y ),
% 0.44/1.09 implies( implies( not( X ), Y ), Y ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.44/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.44/1.09 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 resolution(
% 0.44/1.09 clause( 415, [ 'is_a_theorem'( implies( not( X ), implies( X, Y ) ) ) ] )
% 0.44/1.09 , clause( 7, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X
% 0.44/1.09 , implies( not( X ), Y ) ), Z ) ) ) ] )
% 0.44/1.09 , 1, clause( 3, [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) ),
% 0.44/1.09 implies( Y, implies( X, Z ) ) ) ) ] )
% 0.44/1.09 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, implies( not( X ),
% 0.44/1.09 implies( X, Y ) ) )] ), substitution( 1, [ :=( X, X ), :=( Y, not( X ) )
% 0.44/1.09 , :=( Z, Y )] )).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 subsumption(
% 0.44/1.09 clause( 42, [ 'is_a_theorem'( implies( not( X ), implies( X, Y ) ) ) ] )
% 0.44/1.09 , clause( 415, [ 'is_a_theorem'( implies( not( X ), implies( X, Y ) ) ) ]
% 0.44/1.09 )
% 0.44/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.44/1.09 )] ) ).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 resolution(
% 0.44/1.09 clause( 417, [ ~( 'is_a_theorem'( implies( implies( not( X ), implies( X, Y
% 0.44/1.09 ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.44/1.09 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.44/1.09 , ~( 'is_a_theorem'( X ) ) ] )
% 0.44/1.09 , 2, clause( 42, [ 'is_a_theorem'( implies( not( X ), implies( X, Y ) ) ) ]
% 0.44/1.09 )
% 0.44/1.09 , 0, substitution( 0, [ :=( X, implies( not( X ), implies( X, Y ) ) ), :=(
% 0.44/1.09 Y, Z )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 subsumption(
% 0.44/1.09 clause( 45, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( not(
% 0.44/1.09 X ), implies( X, Y ) ), Z ) ) ) ] )
% 0.44/1.09 , clause( 417, [ ~( 'is_a_theorem'( implies( implies( not( X ), implies( X
% 0.44/1.09 , Y ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.44/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.44/1.09 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 resolution(
% 0.44/1.09 clause( 418, [ 'is_a_theorem'( implies( implies( not( X ), Y ), implies(
% 0.44/1.09 implies( X, Y ), Y ) ) ) ] )
% 0.44/1.09 , clause( 29, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies(
% 0.44/1.09 implies( X, Y ), implies( implies( not( X ), Y ), Y ) ), Z ) ) ) ] )
% 0.44/1.09 , 1, clause( 3, [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) ),
% 0.44/1.09 implies( Y, implies( X, Z ) ) ) ) ] )
% 0.44/1.09 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, implies( implies(
% 0.44/1.09 not( X ), Y ), implies( implies( X, Y ), Y ) ) )] ), substitution( 1, [
% 0.44/1.09 :=( X, implies( X, Y ) ), :=( Y, implies( not( X ), Y ) ), :=( Z, Y )] )
% 0.44/1.09 ).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 subsumption(
% 0.44/1.09 clause( 214, [ 'is_a_theorem'( implies( implies( not( X ), Y ), implies(
% 0.44/1.09 implies( X, Y ), Y ) ) ) ] )
% 0.44/1.09 , clause( 418, [ 'is_a_theorem'( implies( implies( not( X ), Y ), implies(
% 0.44/1.09 implies( X, Y ), Y ) ) ) ] )
% 0.44/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.44/1.09 )] ) ).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 resolution(
% 0.44/1.09 clause( 419, [ 'is_a_theorem'( implies( implies( X, implies( X, Y ) ),
% 0.44/1.09 implies( X, Y ) ) ) ] )
% 0.44/1.09 , clause( 45, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies(
% 0.44/1.09 not( X ), implies( X, Y ) ), Z ) ) ) ] )
% 0.44/1.09 , 1, clause( 214, [ 'is_a_theorem'( implies( implies( not( X ), Y ),
% 0.44/1.09 implies( implies( X, Y ), Y ) ) ) ] )
% 0.44/1.09 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, implies( implies( X
% 0.44/1.09 , implies( X, Y ) ), implies( X, Y ) ) )] ), substitution( 1, [ :=( X, X
% 0.44/1.09 ), :=( Y, implies( X, Y ) )] )).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 subsumption(
% 0.44/1.09 clause( 386, [ 'is_a_theorem'( implies( implies( X, implies( X, Y ) ),
% 0.44/1.09 implies( X, Y ) ) ) ] )
% 0.44/1.09 , clause( 419, [ 'is_a_theorem'( implies( implies( X, implies( X, Y ) ),
% 0.44/1.09 implies( X, Y ) ) ) ] )
% 0.44/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.44/1.09 )] ) ).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 resolution(
% 0.44/1.09 clause( 420, [] )
% 0.44/1.09 , clause( 6, [ ~( 'is_a_theorem'( implies( implies( a, implies( a, b ) ),
% 0.44/1.09 implies( a, b ) ) ) ) ] )
% 0.44/1.09 , 0, clause( 386, [ 'is_a_theorem'( implies( implies( X, implies( X, Y ) )
% 0.44/1.09 , implies( X, Y ) ) ) ] )
% 0.44/1.09 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, a ), :=( Y, b )] )
% 0.44/1.09 ).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 subsumption(
% 0.44/1.09 clause( 402, [] )
% 0.44/1.09 , clause( 420, [] )
% 0.44/1.09 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 end.
% 0.44/1.09
% 0.44/1.09 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.44/1.09
% 0.44/1.09 Memory use:
% 0.44/1.09
% 0.44/1.09 space for terms: 5457
% 0.44/1.09 space for clauses: 32669
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 clauses generated: 1061
% 0.44/1.09 clauses kept: 403
% 0.44/1.09 clauses selected: 109
% 0.44/1.09 clauses deleted: 0
% 0.44/1.09 clauses inuse deleted: 0
% 0.44/1.09
% 0.44/1.09 subsentry: 767
% 0.44/1.09 literals s-matched: 658
% 0.44/1.09 literals matched: 658
% 0.44/1.09 full subsumption: 0
% 0.44/1.09
% 0.44/1.09 checksum: -713227208
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 Bliksem ended
%------------------------------------------------------------------------------