TSTP Solution File: LCL066-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL066-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n026.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:51 EDT 2022
% Result : Unsatisfiable 0.71s 1.11s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : LCL066-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13 % Command : bliksem %s
% 0.14/0.34 % Computer : n026.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 : Sat Jul 2 14:04:20 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.71/1.11 *** allocated 10000 integers for termspace/termends
% 0.71/1.11 *** allocated 10000 integers for clauses
% 0.71/1.11 *** allocated 10000 integers for justifications
% 0.71/1.11 Bliksem 1.12
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 Automatic Strategy Selection
% 0.71/1.11
% 0.71/1.11 Clauses:
% 0.71/1.11 [
% 0.71/1.11 [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'( X ) ),
% 0.71/1.11 'is_a_theorem'( Y ) ],
% 0.71/1.11 [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ],
% 0.71/1.11 [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) ), implies(
% 0.71/1.11 implies( X, Y ), implies( X, Z ) ) ) ) ],
% 0.71/1.11 [ 'is_a_theorem'( implies( implies( not( X ), not( Y ) ), implies( Y, X
% 0.71/1.11 ) ) ) ],
% 0.71/1.11 [ ~( 'is_a_theorem'( implies( a, implies( not( a ), b ) ) ) ) ]
% 0.71/1.11 ] .
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 percentage equality = 0.000000, percentage horn = 1.000000
% 0.71/1.11 This is a near-Horn, non-equality problem
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 Options Used:
% 0.71/1.11
% 0.71/1.11 useres = 1
% 0.71/1.11 useparamod = 0
% 0.71/1.11 useeqrefl = 0
% 0.71/1.11 useeqfact = 0
% 0.71/1.11 usefactor = 1
% 0.71/1.11 usesimpsplitting = 0
% 0.71/1.11 usesimpdemod = 0
% 0.71/1.11 usesimpres = 4
% 0.71/1.11
% 0.71/1.11 resimpinuse = 1000
% 0.71/1.11 resimpclauses = 20000
% 0.71/1.11 substype = standard
% 0.71/1.11 backwardsubs = 1
% 0.71/1.11 selectoldest = 5
% 0.71/1.11
% 0.71/1.11 litorderings [0] = split
% 0.71/1.11 litorderings [1] = liftord
% 0.71/1.11
% 0.71/1.11 termordering = none
% 0.71/1.11
% 0.71/1.11 litapriori = 1
% 0.71/1.11 termapriori = 0
% 0.71/1.11 litaposteriori = 0
% 0.71/1.11 termaposteriori = 0
% 0.71/1.11 demodaposteriori = 0
% 0.71/1.11 ordereqreflfact = 0
% 0.71/1.11
% 0.71/1.11 litselect = negative
% 0.71/1.11
% 0.71/1.11 maxweight = 30000
% 0.71/1.11 maxdepth = 30000
% 0.71/1.11 maxlength = 115
% 0.71/1.11 maxnrvars = 195
% 0.71/1.11 excuselevel = 0
% 0.71/1.11 increasemaxweight = 0
% 0.71/1.11
% 0.71/1.11 maxselected = 10000000
% 0.71/1.11 maxnrclauses = 10000000
% 0.71/1.11
% 0.71/1.11 showgenerated = 0
% 0.71/1.11 showkept = 0
% 0.71/1.11 showselected = 0
% 0.71/1.11 showdeleted = 0
% 0.71/1.11 showresimp = 1
% 0.71/1.11 showstatus = 2000
% 0.71/1.11
% 0.71/1.11 prologoutput = 1
% 0.71/1.11 nrgoals = 5000000
% 0.71/1.11 totalproof = 1
% 0.71/1.11
% 0.71/1.11 Symbols occurring in the translation:
% 0.71/1.11
% 0.71/1.11 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.71/1.11 . [1, 2] (w:1, o:21, a:1, s:1, b:0),
% 0.71/1.11 ! [4, 1] (w:1, o:14, a:1, s:1, b:0),
% 0.71/1.11 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.11 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.11 implies [41, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.71/1.11 'is_a_theorem' [42, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.71/1.11 not [44, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.71/1.11 a [45, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.71/1.11 b [46, 0] (w:1, o:13, a:1, s:1, b:0).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 Starting Search:
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 Bliksems!, er is een bewijs:
% 0.71/1.11 % SZS status Unsatisfiable
% 0.71/1.11 % SZS output start Refutation
% 0.71/1.11
% 0.71/1.11 clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y ),
% 0.71/1.11 ~( 'is_a_theorem'( X ) ) ] )
% 0.71/1.11 .
% 0.71/1.11 clause( 1, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.71/1.11 .
% 0.71/1.11 clause( 2, [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) ),
% 0.71/1.11 implies( implies( X, Y ), implies( X, Z ) ) ) ) ] )
% 0.71/1.11 .
% 0.71/1.11 clause( 3, [ 'is_a_theorem'( implies( implies( not( X ), not( Y ) ),
% 0.71/1.11 implies( Y, X ) ) ) ] )
% 0.71/1.11 .
% 0.71/1.11 clause( 4, [ ~( 'is_a_theorem'( implies( a, implies( not( a ), b ) ) ) ) ]
% 0.71/1.11 )
% 0.71/1.11 .
% 0.71/1.11 clause( 5, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X,
% 0.71/1.11 implies( Y, X ) ), Z ) ) ) ] )
% 0.71/1.11 .
% 0.71/1.11 clause( 6, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies(
% 0.71/1.11 implies( not( X ), not( Y ) ), implies( Y, X ) ), Z ) ) ) ] )
% 0.71/1.11 .
% 0.71/1.11 clause( 7, [ 'is_a_theorem'( implies( X, implies( Y, implies( Z, Y ) ) ) )
% 0.71/1.11 ] )
% 0.71/1.11 .
% 0.71/1.11 clause( 8, [ 'is_a_theorem'( implies( implies( X, Y ), implies( X, X ) ) )
% 0.71/1.11 ] )
% 0.71/1.11 .
% 0.71/1.11 clause( 9, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 0.71/1.11 implies( X, implies( Y, Z ) ), implies( implies( X, Y ), implies( X, Z )
% 0.71/1.11 ) ), T ) ) ) ] )
% 0.71/1.11 .
% 0.71/1.11 clause( 10, [ 'is_a_theorem'( implies( X, X ) ) ] )
% 0.71/1.11 .
% 0.71/1.11 clause( 12, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( implies( implies( X,
% 0.71/1.11 X ), Y ) ) ) ] )
% 0.71/1.11 .
% 0.71/1.11 clause( 13, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies( X,
% 0.71/1.11 implies( Y, implies( Z, Y ) ) ), T ) ) ) ] )
% 0.71/1.11 .
% 0.71/1.11 clause( 15, [ 'is_a_theorem'( implies( X, implies( Y, Y ) ) ) ] )
% 0.71/1.11 .
% 0.71/1.11 clause( 17, [ 'is_a_theorem'( implies( X, implies( implies( not( Y ), not(
% 0.71/1.11 Z ) ), implies( Z, Y ) ) ) ) ] )
% 0.71/1.11 .
% 0.71/1.11 clause( 18, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X,
% 0.71/1.11 implies( Y, Y ) ), Z ) ) ) ] )
% 0.71/1.11 .
% 0.71/1.11 clause( 19, [ 'is_a_theorem'( implies( X, implies( Y, implies( Z, Z ) ) ) )
% 0.71/1.11 ] )
% 0.71/1.11 .
% 0.71/1.11 clause( 20, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies( X,
% 0.71/1.11 implies( Y, implies( Z, Z ) ) ), T ) ) ) ] )
% 0.71/1.11 .
% 0.71/1.11 clause( 23, [ 'is_a_theorem'( implies( implies( implies( X, implies( Y, Z )
% 0.71/1.11 ), implies( X, Y ) ), implies( implies( X, implies( Y, Z ) ), implies( X
% 0.71/1.11 , Z ) ) ) ) ] )
% 0.71/1.11 .
% 0.71/1.11 clause( 24, [ 'is_a_theorem'( implies( X, implies( implies( Y, implies( Z,
% 0.71/1.11 T ) ), implies( implies( Y, Z ), implies( Y, T ) ) ) ) ) ] )
% 0.71/1.11 .
% 0.71/1.11 clause( 26, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies( X,
% 0.71/1.11 implies( implies( not( Y ), not( Z ) ), implies( Z, Y ) ) ), T ) ) ) ] )
% 0.71/1.11 .
% 0.71/1.11 clause( 59, [ 'is_a_theorem'( implies( implies( X, implies( implies( Y, X )
% 0.71/1.11 , Z ) ), implies( X, Z ) ) ) ] )
% 0.71/1.11 .
% 0.71/1.11 clause( 60, [ 'is_a_theorem'( implies( implies( X, implies( implies( Y, Y )
% 0.71/1.11 , Z ) ), implies( X, Z ) ) ) ] )
% 0.71/1.11 .
% 0.71/1.11 clause( 69, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( implies( implies( X,
% 0.71/1.11 implies( implies( Y, implies( Z, T ) ), implies( implies( Y, Z ), implies(
% 0.71/1.11 Y, T ) ) ) ), U ) ) ) ] )
% 0.71/1.11 .
% 0.71/1.11 clause( 86, [ 'is_a_theorem'( implies( not( X ), implies( X, Y ) ) ) ] )
% 0.71/1.11 .
% 0.71/1.11 clause( 90, [ 'is_a_theorem'( implies( implies( X, implies( not( Y ), not(
% 0.71/1.11 Z ) ) ), implies( X, implies( Z, Y ) ) ) ) ] )
% 0.71/1.11 .
% 0.71/1.11 clause( 91, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( not(
% 0.71/1.11 X ), implies( X, Y ) ), Z ) ) ) ] )
% 0.71/1.11 .
% 0.71/1.11 clause( 212, [ 'is_a_theorem'( implies( not( not( X ) ), implies( Y, X ) )
% 0.71/1.11 ) ] )
% 0.71/1.11 .
% 0.71/1.11 clause( 216, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies(
% 0.71/1.11 not( not( X ) ), implies( Y, X ) ), Z ) ) ) ] )
% 0.71/1.11 .
% 0.71/1.11 clause( 226, [ 'is_a_theorem'( implies( not( not( X ) ), X ) ) ] )
% 0.71/1.11 .
% 0.71/1.11 clause( 231, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( implies( implies(
% 0.71/1.11 not( not( X ) ), X ), Y ) ) ) ] )
% 0.71/1.11 .
% 0.71/1.11 clause( 247, [ 'is_a_theorem'( implies( X, not( not( X ) ) ) ) ] )
% 0.71/1.11 .
% 0.71/1.11 clause( 270, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( implies( implies( X
% 0.71/1.11 , not( not( X ) ) ), Y ) ) ) ] )
% 0.71/1.11 .
% 0.71/1.11 clause( 439, [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies(
% 0.71/1.11 Z, X ), implies( Z, Y ) ) ) ) ] )
% 0.71/1.11 .
% 0.71/1.11 clause( 458, [ 'is_a_theorem'( implies( implies( X, not( Y ) ), implies( X
% 0.71/1.11 , implies( Y, Z ) ) ) ) ] )
% 0.71/1.11 .
% 0.71/1.11 clause( 597, [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ] )
% 0.71/1.11 .
% 0.71/1.11 clause( 630, [] )
% 0.71/1.11 .
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 % SZS output end Refutation
% 0.71/1.11 found a proof!
% 0.71/1.11
% 0.71/1.11 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.71/1.11
% 0.71/1.11 initialclauses(
% 0.71/1.11 [ clause( 632, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'(
% 0.71/1.11 X ) ), 'is_a_theorem'( Y ) ] )
% 0.71/1.11 , clause( 633, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.71/1.11 , clause( 634, [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) ),
% 0.71/1.11 implies( implies( X, Y ), implies( X, Z ) ) ) ) ] )
% 0.71/1.11 , clause( 635, [ 'is_a_theorem'( implies( implies( not( X ), not( Y ) ),
% 0.71/1.11 implies( Y, X ) ) ) ] )
% 0.71/1.11 , clause( 636, [ ~( 'is_a_theorem'( implies( a, implies( not( a ), b ) ) )
% 0.71/1.11 ) ] )
% 0.71/1.11 ] ).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 subsumption(
% 0.71/1.11 clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y ),
% 0.71/1.11 ~( 'is_a_theorem'( X ) ) ] )
% 0.71/1.11 , clause( 632, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'(
% 0.71/1.11 X ) ), 'is_a_theorem'( Y ) ] )
% 0.71/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.11 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 subsumption(
% 0.71/1.11 clause( 1, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.71/1.11 , clause( 633, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.71/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.11 )] ) ).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 subsumption(
% 0.71/1.11 clause( 2, [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) ),
% 0.71/1.11 implies( implies( X, Y ), implies( X, Z ) ) ) ) ] )
% 0.71/1.11 , clause( 634, [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) ),
% 0.71/1.11 implies( implies( X, Y ), implies( X, Z ) ) ) ) ] )
% 0.71/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.11 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 subsumption(
% 0.71/1.11 clause( 3, [ 'is_a_theorem'( implies( implies( not( X ), not( Y ) ),
% 0.71/1.11 implies( Y, X ) ) ) ] )
% 0.71/1.11 , clause( 635, [ 'is_a_theorem'( implies( implies( not( X ), not( Y ) ),
% 0.71/1.11 implies( Y, X ) ) ) ] )
% 0.71/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.11 )] ) ).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 subsumption(
% 0.71/1.11 clause( 4, [ ~( 'is_a_theorem'( implies( a, implies( not( a ), b ) ) ) ) ]
% 0.71/1.11 )
% 0.71/1.11 , clause( 636, [ ~( 'is_a_theorem'( implies( a, implies( not( a ), b ) ) )
% 0.71/1.11 ) ] )
% 0.71/1.11 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 resolution(
% 0.71/1.11 clause( 638, [ ~( 'is_a_theorem'( implies( implies( X, implies( Y, X ) ), Z
% 0.71/1.11 ) ) ), 'is_a_theorem'( Z ) ] )
% 0.71/1.11 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.71/1.11 , ~( 'is_a_theorem'( X ) ) ] )
% 0.71/1.11 , 2, clause( 1, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.71/1.11 , 0, substitution( 0, [ :=( X, implies( X, implies( Y, X ) ) ), :=( Y, Z )] )
% 0.71/1.11 , substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 subsumption(
% 0.71/1.11 clause( 5, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X,
% 0.71/1.11 implies( Y, X ) ), Z ) ) ) ] )
% 0.71/1.11 , clause( 638, [ ~( 'is_a_theorem'( implies( implies( X, implies( Y, X ) )
% 0.71/1.11 , Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.71/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.11 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 resolution(
% 0.71/1.11 clause( 640, [ ~( 'is_a_theorem'( implies( implies( implies( not( X ), not(
% 0.71/1.11 Y ) ), implies( Y, X ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.71/1.11 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.71/1.11 , ~( 'is_a_theorem'( X ) ) ] )
% 0.71/1.11 , 2, clause( 3, [ 'is_a_theorem'( implies( implies( not( X ), not( Y ) ),
% 0.71/1.11 implies( Y, X ) ) ) ] )
% 0.71/1.11 , 0, substitution( 0, [ :=( X, implies( implies( not( X ), not( Y ) ),
% 0.71/1.11 implies( Y, X ) ) ), :=( Y, Z )] ), substitution( 1, [ :=( X, X ), :=( Y
% 0.71/1.11 , Y )] )).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 subsumption(
% 0.71/1.11 clause( 6, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies(
% 0.71/1.11 implies( not( X ), not( Y ) ), implies( Y, X ) ), Z ) ) ) ] )
% 0.71/1.11 , clause( 640, [ ~( 'is_a_theorem'( implies( implies( implies( not( X ),
% 0.71/1.11 not( Y ) ), implies( Y, X ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.71/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.11 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 resolution(
% 0.71/1.11 clause( 641, [ 'is_a_theorem'( implies( X, implies( Y, implies( Z, Y ) ) )
% 0.71/1.11 ) ] )
% 0.71/1.11 , clause( 5, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X
% 0.71/1.11 , implies( Y, X ) ), Z ) ) ) ] )
% 0.71/1.11 , 1, clause( 1, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.71/1.11 , 0, substitution( 0, [ :=( X, Y ), :=( Y, Z ), :=( Z, implies( X, implies(
% 0.71/1.11 Y, implies( Z, Y ) ) ) )] ), substitution( 1, [ :=( X, implies( Y,
% 0.71/1.11 implies( Z, Y ) ) ), :=( Y, X )] )).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 subsumption(
% 0.71/1.11 clause( 7, [ 'is_a_theorem'( implies( X, implies( Y, implies( Z, Y ) ) ) )
% 0.71/1.11 ] )
% 0.71/1.11 , clause( 641, [ 'is_a_theorem'( implies( X, implies( Y, implies( Z, Y ) )
% 0.71/1.11 ) ) ] )
% 0.71/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.11 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 resolution(
% 0.71/1.11 clause( 642, [ 'is_a_theorem'( implies( implies( X, Y ), implies( X, X ) )
% 0.71/1.11 ) ] )
% 0.71/1.11 , clause( 5, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X
% 0.71/1.11 , implies( Y, X ) ), Z ) ) ) ] )
% 0.71/1.11 , 1, clause( 2, [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) ),
% 0.71/1.11 implies( implies( X, Y ), implies( X, Z ) ) ) ) ] )
% 0.71/1.11 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, implies( implies( X
% 0.71/1.11 , Y ), implies( X, X ) ) )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )
% 0.71/1.11 , :=( Z, X )] )).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 subsumption(
% 0.71/1.11 clause( 8, [ 'is_a_theorem'( implies( implies( X, Y ), implies( X, X ) ) )
% 0.71/1.11 ] )
% 0.71/1.11 , clause( 642, [ 'is_a_theorem'( implies( implies( X, Y ), implies( X, X )
% 0.71/1.11 ) ) ] )
% 0.71/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.11 )] ) ).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 resolution(
% 0.71/1.11 clause( 644, [ ~( 'is_a_theorem'( implies( implies( implies( X, implies( Y
% 0.71/1.11 , Z ) ), implies( implies( X, Y ), implies( X, Z ) ) ), T ) ) ),
% 0.71/1.11 'is_a_theorem'( T ) ] )
% 0.71/1.11 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.71/1.11 , ~( 'is_a_theorem'( X ) ) ] )
% 0.71/1.11 , 2, clause( 2, [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) ),
% 0.71/1.11 implies( implies( X, Y ), implies( X, Z ) ) ) ) ] )
% 0.71/1.11 , 0, substitution( 0, [ :=( X, implies( implies( X, implies( Y, Z ) ),
% 0.71/1.11 implies( implies( X, Y ), implies( X, Z ) ) ) ), :=( Y, T )] ),
% 0.71/1.11 substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 subsumption(
% 0.71/1.11 clause( 9, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 0.71/1.11 implies( X, implies( Y, Z ) ), implies( implies( X, Y ), implies( X, Z )
% 0.71/1.11 ) ), T ) ) ) ] )
% 0.71/1.11 , clause( 644, [ ~( 'is_a_theorem'( implies( implies( implies( X, implies(
% 0.71/1.11 Y, Z ) ), implies( implies( X, Y ), implies( X, Z ) ) ), T ) ) ),
% 0.71/1.11 'is_a_theorem'( T ) ] )
% 0.71/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.71/1.11 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 resolution(
% 0.71/1.11 clause( 645, [ 'is_a_theorem'( implies( X, X ) ) ] )
% 0.71/1.11 , clause( 5, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X
% 0.71/1.11 , implies( Y, X ) ), Z ) ) ) ] )
% 0.71/1.11 , 1, clause( 8, [ 'is_a_theorem'( implies( implies( X, Y ), implies( X, X )
% 0.71/1.11 ) ) ] )
% 0.71/1.11 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, implies( X, X ) )] )
% 0.71/1.11 , substitution( 1, [ :=( X, X ), :=( Y, implies( Y, X ) )] )).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 subsumption(
% 0.71/1.11 clause( 10, [ 'is_a_theorem'( implies( X, X ) ) ] )
% 0.71/1.11 , clause( 645, [ 'is_a_theorem'( implies( X, X ) ) ] )
% 0.71/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 resolution(
% 0.71/1.11 clause( 647, [ ~( 'is_a_theorem'( implies( implies( X, X ), Y ) ) ),
% 0.71/1.11 'is_a_theorem'( Y ) ] )
% 0.71/1.11 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.71/1.11 , ~( 'is_a_theorem'( X ) ) ] )
% 0.71/1.11 , 2, clause( 10, [ 'is_a_theorem'( implies( X, X ) ) ] )
% 0.71/1.11 , 0, substitution( 0, [ :=( X, implies( X, X ) ), :=( Y, Y )] ),
% 0.71/1.11 substitution( 1, [ :=( X, X )] )).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 subsumption(
% 0.71/1.11 clause( 12, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( implies( implies( X,
% 0.71/1.11 X ), Y ) ) ) ] )
% 0.71/1.11 , clause( 647, [ ~( 'is_a_theorem'( implies( implies( X, X ), Y ) ) ),
% 0.71/1.11 'is_a_theorem'( Y ) ] )
% 0.71/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.71/1.11 ), ==>( 1, 0 )] ) ).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 resolution(
% 0.71/1.11 clause( 649, [ ~( 'is_a_theorem'( implies( implies( X, implies( Y, implies(
% 0.71/1.11 Z, Y ) ) ), T ) ) ), 'is_a_theorem'( T ) ] )
% 0.71/1.11 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.71/1.11 , ~( 'is_a_theorem'( X ) ) ] )
% 0.71/1.11 , 2, clause( 7, [ 'is_a_theorem'( implies( X, implies( Y, implies( Z, Y ) )
% 0.71/1.11 ) ) ] )
% 0.71/1.11 , 0, substitution( 0, [ :=( X, implies( X, implies( Y, implies( Z, Y ) ) )
% 0.71/1.11 ), :=( Y, T )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )
% 0.71/1.11 ).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 subsumption(
% 0.71/1.11 clause( 13, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies( X,
% 0.71/1.11 implies( Y, implies( Z, Y ) ) ), T ) ) ) ] )
% 0.71/1.11 , clause( 649, [ ~( 'is_a_theorem'( implies( implies( X, implies( Y,
% 0.71/1.11 implies( Z, Y ) ) ), T ) ) ), 'is_a_theorem'( T ) ] )
% 0.71/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.71/1.11 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 resolution(
% 0.71/1.11 clause( 650, [ 'is_a_theorem'( implies( X, implies( Y, Y ) ) ) ] )
% 0.71/1.11 , clause( 12, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( implies( implies( X
% 0.71/1.11 , X ), Y ) ) ) ] )
% 0.71/1.11 , 1, clause( 1, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.71/1.11 , 0, substitution( 0, [ :=( X, Y ), :=( Y, implies( X, implies( Y, Y ) ) )] )
% 0.71/1.11 , substitution( 1, [ :=( X, implies( Y, Y ) ), :=( Y, X )] )).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 subsumption(
% 0.71/1.11 clause( 15, [ 'is_a_theorem'( implies( X, implies( Y, Y ) ) ) ] )
% 0.71/1.11 , clause( 650, [ 'is_a_theorem'( implies( X, implies( Y, Y ) ) ) ] )
% 0.71/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.11 )] ) ).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 resolution(
% 0.71/1.11 clause( 651, [ 'is_a_theorem'( implies( X, implies( implies( not( Y ), not(
% 0.71/1.11 Z ) ), implies( Z, Y ) ) ) ) ] )
% 0.71/1.11 , clause( 6, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies(
% 0.71/1.11 implies( not( X ), not( Y ) ), implies( Y, X ) ), Z ) ) ) ] )
% 0.71/1.11 , 1, clause( 1, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.71/1.11 , 0, substitution( 0, [ :=( X, Y ), :=( Y, Z ), :=( Z, implies( X, implies(
% 0.71/1.11 implies( not( Y ), not( Z ) ), implies( Z, Y ) ) ) )] ), substitution( 1
% 0.71/1.11 , [ :=( X, implies( implies( not( Y ), not( Z ) ), implies( Z, Y ) ) ),
% 0.71/1.11 :=( Y, X )] )).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 subsumption(
% 0.71/1.11 clause( 17, [ 'is_a_theorem'( implies( X, implies( implies( not( Y ), not(
% 0.71/1.11 Z ) ), implies( Z, Y ) ) ) ) ] )
% 0.71/1.11 , clause( 651, [ 'is_a_theorem'( implies( X, implies( implies( not( Y ),
% 0.71/1.11 not( Z ) ), implies( Z, Y ) ) ) ) ] )
% 0.71/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.11 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 resolution(
% 0.71/1.11 clause( 653, [ ~( 'is_a_theorem'( implies( implies( X, implies( Y, Y ) ), Z
% 0.71/1.11 ) ) ), 'is_a_theorem'( Z ) ] )
% 0.71/1.11 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.71/1.11 , ~( 'is_a_theorem'( X ) ) ] )
% 0.71/1.11 , 2, clause( 15, [ 'is_a_theorem'( implies( X, implies( Y, Y ) ) ) ] )
% 0.71/1.11 , 0, substitution( 0, [ :=( X, implies( X, implies( Y, Y ) ) ), :=( Y, Z )] )
% 0.71/1.11 , substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 subsumption(
% 0.71/1.11 clause( 18, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X,
% 0.71/1.11 implies( Y, Y ) ), Z ) ) ) ] )
% 0.71/1.11 , clause( 653, [ ~( 'is_a_theorem'( implies( implies( X, implies( Y, Y ) )
% 0.71/1.11 , Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.71/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.11 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 resolution(
% 0.71/1.11 clause( 654, [ 'is_a_theorem'( implies( X, implies( Y, implies( Z, Z ) ) )
% 0.71/1.11 ) ] )
% 0.71/1.11 , clause( 18, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X
% 0.71/1.11 , implies( Y, Y ) ), Z ) ) ) ] )
% 0.71/1.11 , 1, clause( 1, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.71/1.11 , 0, substitution( 0, [ :=( X, Y ), :=( Y, Z ), :=( Z, implies( X, implies(
% 0.71/1.11 Y, implies( Z, Z ) ) ) )] ), substitution( 1, [ :=( X, implies( Y,
% 0.71/1.11 implies( Z, Z ) ) ), :=( Y, X )] )).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 subsumption(
% 0.71/1.11 clause( 19, [ 'is_a_theorem'( implies( X, implies( Y, implies( Z, Z ) ) ) )
% 0.71/1.11 ] )
% 0.71/1.11 , clause( 654, [ 'is_a_theorem'( implies( X, implies( Y, implies( Z, Z ) )
% 0.71/1.11 ) ) ] )
% 0.71/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.11 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 resolution(
% 0.71/1.11 clause( 656, [ ~( 'is_a_theorem'( implies( implies( X, implies( Y, implies(
% 0.71/1.11 Z, Z ) ) ), T ) ) ), 'is_a_theorem'( T ) ] )
% 0.71/1.11 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.71/1.11 , ~( 'is_a_theorem'( X ) ) ] )
% 0.71/1.11 , 2, clause( 19, [ 'is_a_theorem'( implies( X, implies( Y, implies( Z, Z )
% 0.71/1.11 ) ) ) ] )
% 0.71/1.11 , 0, substitution( 0, [ :=( X, implies( X, implies( Y, implies( Z, Z ) ) )
% 0.71/1.11 ), :=( Y, T )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )
% 0.71/1.11 ).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 subsumption(
% 0.71/1.11 clause( 20, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies( X,
% 0.71/1.11 implies( Y, implies( Z, Z ) ) ), T ) ) ) ] )
% 0.71/1.11 , clause( 656, [ ~( 'is_a_theorem'( implies( implies( X, implies( Y,
% 0.71/1.11 implies( Z, Z ) ) ), T ) ) ), 'is_a_theorem'( T ) ] )
% 0.71/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.71/1.11 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 resolution(
% 0.71/1.11 clause( 657, [ 'is_a_theorem'( implies( implies( implies( X, implies( Y, Z
% 0.71/1.11 ) ), implies( X, Y ) ), implies( implies( X, implies( Y, Z ) ), implies(
% 0.71/1.11 X, Z ) ) ) ) ] )
% 0.71/1.11 , clause( 9, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 0.71/1.11 implies( X, implies( Y, Z ) ), implies( implies( X, Y ), implies( X, Z )
% 0.71/1.11 ) ), T ) ) ) ] )
% 0.71/1.11 , 1, clause( 2, [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) ),
% 0.71/1.11 implies( implies( X, Y ), implies( X, Z ) ) ) ) ] )
% 0.71/1.11 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, implies(
% 0.71/1.11 implies( implies( X, implies( Y, Z ) ), implies( X, Y ) ), implies(
% 0.71/1.11 implies( X, implies( Y, Z ) ), implies( X, Z ) ) ) )] ), substitution( 1
% 0.71/1.11 , [ :=( X, implies( X, implies( Y, Z ) ) ), :=( Y, implies( X, Y ) ),
% 0.71/1.11 :=( Z, implies( X, Z ) )] )).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 subsumption(
% 0.71/1.11 clause( 23, [ 'is_a_theorem'( implies( implies( implies( X, implies( Y, Z )
% 0.71/1.11 ), implies( X, Y ) ), implies( implies( X, implies( Y, Z ) ), implies( X
% 0.71/1.11 , Z ) ) ) ) ] )
% 0.71/1.11 , clause( 657, [ 'is_a_theorem'( implies( implies( implies( X, implies( Y,
% 0.71/1.11 Z ) ), implies( X, Y ) ), implies( implies( X, implies( Y, Z ) ), implies(
% 0.71/1.11 X, Z ) ) ) ) ] )
% 0.71/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.11 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 resolution(
% 0.71/1.11 clause( 658, [ 'is_a_theorem'( implies( X, implies( implies( Y, implies( Z
% 0.71/1.11 , T ) ), implies( implies( Y, Z ), implies( Y, T ) ) ) ) ) ] )
% 0.71/1.11 , clause( 9, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 0.71/1.11 implies( X, implies( Y, Z ) ), implies( implies( X, Y ), implies( X, Z )
% 0.71/1.11 ) ), T ) ) ) ] )
% 0.71/1.11 , 1, clause( 1, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.71/1.11 , 0, substitution( 0, [ :=( X, Y ), :=( Y, Z ), :=( Z, T ), :=( T, implies(
% 0.71/1.11 X, implies( implies( Y, implies( Z, T ) ), implies( implies( Y, Z ),
% 0.71/1.11 implies( Y, T ) ) ) ) )] ), substitution( 1, [ :=( X, implies( implies( Y
% 0.71/1.11 , implies( Z, T ) ), implies( implies( Y, Z ), implies( Y, T ) ) ) ),
% 0.71/1.11 :=( Y, X )] )).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 subsumption(
% 0.71/1.11 clause( 24, [ 'is_a_theorem'( implies( X, implies( implies( Y, implies( Z,
% 0.71/1.11 T ) ), implies( implies( Y, Z ), implies( Y, T ) ) ) ) ) ] )
% 0.71/1.11 , clause( 658, [ 'is_a_theorem'( implies( X, implies( implies( Y, implies(
% 0.71/1.11 Z, T ) ), implies( implies( Y, Z ), implies( Y, T ) ) ) ) ) ] )
% 0.71/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.71/1.11 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 resolution(
% 0.71/1.11 clause( 660, [ ~( 'is_a_theorem'( implies( implies( X, implies( implies(
% 0.71/1.11 not( Y ), not( Z ) ), implies( Z, Y ) ) ), T ) ) ), 'is_a_theorem'( T ) ]
% 0.71/1.11 )
% 0.71/1.11 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.71/1.11 , ~( 'is_a_theorem'( X ) ) ] )
% 0.71/1.11 , 2, clause( 17, [ 'is_a_theorem'( implies( X, implies( implies( not( Y ),
% 0.71/1.11 not( Z ) ), implies( Z, Y ) ) ) ) ] )
% 0.71/1.11 , 0, substitution( 0, [ :=( X, implies( X, implies( implies( not( Y ), not(
% 0.71/1.11 Z ) ), implies( Z, Y ) ) ) ), :=( Y, T )] ), substitution( 1, [ :=( X, X
% 0.71/1.11 ), :=( Y, Y ), :=( Z, Z )] )).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 subsumption(
% 0.71/1.11 clause( 26, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies( X,
% 0.71/1.11 implies( implies( not( Y ), not( Z ) ), implies( Z, Y ) ) ), T ) ) ) ] )
% 0.71/1.11 , clause( 660, [ ~( 'is_a_theorem'( implies( implies( X, implies( implies(
% 0.71/1.11 not( Y ), not( Z ) ), implies( Z, Y ) ) ), T ) ) ), 'is_a_theorem'( T ) ]
% 0.71/1.11 )
% 0.71/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.71/1.11 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 resolution(
% 0.71/1.11 clause( 661, [ 'is_a_theorem'( implies( implies( X, implies( implies( Y, X
% 0.71/1.11 ), Z ) ), implies( X, Z ) ) ) ] )
% 0.71/1.11 , clause( 13, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies( X
% 0.71/1.11 , implies( Y, implies( Z, Y ) ) ), T ) ) ) ] )
% 0.71/1.11 , 1, clause( 23, [ 'is_a_theorem'( implies( implies( implies( X, implies( Y
% 0.71/1.11 , Z ) ), implies( X, Y ) ), implies( implies( X, implies( Y, Z ) ),
% 0.71/1.11 implies( X, Z ) ) ) ) ] )
% 0.71/1.11 , 0, substitution( 0, [ :=( X, implies( X, implies( implies( Y, X ), Z ) )
% 0.71/1.11 ), :=( Y, X ), :=( Z, Y ), :=( T, implies( implies( X, implies( implies(
% 0.71/1.11 Y, X ), Z ) ), implies( X, Z ) ) )] ), substitution( 1, [ :=( X, X ),
% 0.71/1.11 :=( Y, implies( Y, X ) ), :=( Z, Z )] )).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 subsumption(
% 0.71/1.11 clause( 59, [ 'is_a_theorem'( implies( implies( X, implies( implies( Y, X )
% 0.71/1.11 , Z ) ), implies( X, Z ) ) ) ] )
% 0.71/1.11 , clause( 661, [ 'is_a_theorem'( implies( implies( X, implies( implies( Y,
% 0.71/1.11 X ), Z ) ), implies( X, Z ) ) ) ] )
% 0.71/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.11 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 resolution(
% 0.71/1.11 clause( 662, [ 'is_a_theorem'( implies( implies( X, implies( implies( Y, Y
% 0.71/1.11 ), Z ) ), implies( X, Z ) ) ) ] )
% 0.71/1.11 , clause( 20, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies( X
% 0.71/1.11 , implies( Y, implies( Z, Z ) ) ), T ) ) ) ] )
% 0.71/1.11 , 1, clause( 23, [ 'is_a_theorem'( implies( implies( implies( X, implies( Y
% 0.71/1.11 , Z ) ), implies( X, Y ) ), implies( implies( X, implies( Y, Z ) ),
% 0.71/1.11 implies( X, Z ) ) ) ) ] )
% 0.71/1.11 , 0, substitution( 0, [ :=( X, implies( X, implies( implies( Y, Y ), Z ) )
% 0.71/1.11 ), :=( Y, X ), :=( Z, Y ), :=( T, implies( implies( X, implies( implies(
% 0.71/1.11 Y, Y ), Z ) ), implies( X, Z ) ) )] ), substitution( 1, [ :=( X, X ),
% 0.71/1.11 :=( Y, implies( Y, Y ) ), :=( Z, Z )] )).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 subsumption(
% 0.71/1.11 clause( 60, [ 'is_a_theorem'( implies( implies( X, implies( implies( Y, Y )
% 0.71/1.11 , Z ) ), implies( X, Z ) ) ) ] )
% 0.71/1.11 , clause( 662, [ 'is_a_theorem'( implies( implies( X, implies( implies( Y,
% 0.71/1.11 Y ), Z ) ), implies( X, Z ) ) ) ] )
% 0.71/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.11 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 resolution(
% 0.71/1.11 clause( 664, [ ~( 'is_a_theorem'( implies( implies( X, implies( implies( Y
% 0.71/1.11 , implies( Z, T ) ), implies( implies( Y, Z ), implies( Y, T ) ) ) ), U )
% 0.71/1.11 ) ), 'is_a_theorem'( U ) ] )
% 0.71/1.11 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.71/1.11 , ~( 'is_a_theorem'( X ) ) ] )
% 0.71/1.11 , 2, clause( 24, [ 'is_a_theorem'( implies( X, implies( implies( Y, implies(
% 0.71/1.11 Z, T ) ), implies( implies( Y, Z ), implies( Y, T ) ) ) ) ) ] )
% 0.71/1.11 , 0, substitution( 0, [ :=( X, implies( X, implies( implies( Y, implies( Z
% 0.71/1.11 , T ) ), implies( implies( Y, Z ), implies( Y, T ) ) ) ) ), :=( Y, U )] )
% 0.71/1.11 , substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] )
% 0.71/1.11 ).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 subsumption(
% 0.71/1.11 clause( 69, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( implies( implies( X,
% 0.71/1.11 implies( implies( Y, implies( Z, T ) ), implies( implies( Y, Z ), implies(
% 0.71/1.11 Y, T ) ) ) ), U ) ) ) ] )
% 0.71/1.11 , clause( 664, [ ~( 'is_a_theorem'( implies( implies( X, implies( implies(
% 0.71/1.11 Y, implies( Z, T ) ), implies( implies( Y, Z ), implies( Y, T ) ) ) ), U
% 0.71/1.11 ) ) ), 'is_a_theorem'( U ) ] )
% 0.71/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.71/1.11 , U )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 resolution(
% 0.71/1.11 clause( 665, [ 'is_a_theorem'( implies( not( X ), implies( X, Y ) ) ) ] )
% 0.71/1.11 , clause( 26, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies( X
% 0.71/1.11 , implies( implies( not( Y ), not( Z ) ), implies( Z, Y ) ) ), T ) ) ) ]
% 0.71/1.11 )
% 0.71/1.11 , 1, clause( 59, [ 'is_a_theorem'( implies( implies( X, implies( implies( Y
% 0.71/1.11 , X ), Z ) ), implies( X, Z ) ) ) ] )
% 0.71/1.11 , 0, substitution( 0, [ :=( X, not( X ) ), :=( Y, Y ), :=( Z, X ), :=( T,
% 0.71/1.11 implies( not( X ), implies( X, Y ) ) )] ), substitution( 1, [ :=( X, not(
% 0.71/1.11 X ) ), :=( Y, not( Y ) ), :=( Z, implies( X, Y ) )] )).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 subsumption(
% 0.71/1.11 clause( 86, [ 'is_a_theorem'( implies( not( X ), implies( X, Y ) ) ) ] )
% 0.71/1.11 , clause( 665, [ 'is_a_theorem'( implies( not( X ), implies( X, Y ) ) ) ]
% 0.71/1.11 )
% 0.71/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.11 )] ) ).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 resolution(
% 0.71/1.11 clause( 666, [ 'is_a_theorem'( implies( implies( X, implies( not( Y ), not(
% 0.71/1.11 Z ) ) ), implies( X, implies( Z, Y ) ) ) ) ] )
% 0.71/1.11 , clause( 26, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies( X
% 0.71/1.11 , implies( implies( not( Y ), not( Z ) ), implies( Z, Y ) ) ), T ) ) ) ]
% 0.71/1.11 )
% 0.71/1.11 , 1, clause( 2, [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) ),
% 0.71/1.11 implies( implies( X, Y ), implies( X, Z ) ) ) ) ] )
% 0.71/1.11 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, implies(
% 0.71/1.11 implies( X, implies( not( Y ), not( Z ) ) ), implies( X, implies( Z, Y )
% 0.71/1.11 ) ) )] ), substitution( 1, [ :=( X, X ), :=( Y, implies( not( Y ), not(
% 0.71/1.11 Z ) ) ), :=( Z, implies( Z, Y ) )] )).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 subsumption(
% 0.71/1.11 clause( 90, [ 'is_a_theorem'( implies( implies( X, implies( not( Y ), not(
% 0.71/1.11 Z ) ) ), implies( X, implies( Z, Y ) ) ) ) ] )
% 0.71/1.11 , clause( 666, [ 'is_a_theorem'( implies( implies( X, implies( not( Y ),
% 0.71/1.11 not( Z ) ) ), implies( X, implies( Z, Y ) ) ) ) ] )
% 0.71/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.11 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 resolution(
% 0.71/1.11 clause( 668, [ ~( 'is_a_theorem'( implies( implies( not( X ), implies( X, Y
% 0.71/1.11 ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.71/1.11 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.71/1.11 , ~( 'is_a_theorem'( X ) ) ] )
% 0.71/1.11 , 2, clause( 86, [ 'is_a_theorem'( implies( not( X ), implies( X, Y ) ) ) ]
% 0.71/1.11 )
% 0.71/1.11 , 0, substitution( 0, [ :=( X, implies( not( X ), implies( X, Y ) ) ), :=(
% 0.71/1.11 Y, Z )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 subsumption(
% 0.71/1.11 clause( 91, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( not(
% 0.71/1.11 X ), implies( X, Y ) ), Z ) ) ) ] )
% 0.71/1.11 , clause( 668, [ ~( 'is_a_theorem'( implies( implies( not( X ), implies( X
% 0.71/1.11 , Y ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.71/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.11 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 resolution(
% 0.71/1.11 clause( 669, [ 'is_a_theorem'( implies( not( not( X ) ), implies( Y, X ) )
% 0.71/1.11 ) ] )
% 0.71/1.11 , clause( 91, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies(
% 0.71/1.11 not( X ), implies( X, Y ) ), Z ) ) ) ] )
% 0.71/1.11 , 1, clause( 90, [ 'is_a_theorem'( implies( implies( X, implies( not( Y ),
% 0.71/1.11 not( Z ) ) ), implies( X, implies( Z, Y ) ) ) ) ] )
% 0.71/1.11 , 0, substitution( 0, [ :=( X, not( X ) ), :=( Y, not( Y ) ), :=( Z,
% 0.71/1.11 implies( not( not( X ) ), implies( Y, X ) ) )] ), substitution( 1, [ :=(
% 0.71/1.11 X, not( not( X ) ) ), :=( Y, X ), :=( Z, Y )] )).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 subsumption(
% 0.71/1.11 clause( 212, [ 'is_a_theorem'( implies( not( not( X ) ), implies( Y, X ) )
% 0.71/1.11 ) ] )
% 0.71/1.11 , clause( 669, [ 'is_a_theorem'( implies( not( not( X ) ), implies( Y, X )
% 0.71/1.11 ) ) ] )
% 0.71/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.11 )] ) ).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 resolution(
% 0.71/1.11 clause( 671, [ ~( 'is_a_theorem'( implies( implies( not( not( X ) ),
% 0.71/1.11 implies( Y, X ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.71/1.11 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.71/1.11 , ~( 'is_a_theorem'( X ) ) ] )
% 0.71/1.11 , 2, clause( 212, [ 'is_a_theorem'( implies( not( not( X ) ), implies( Y, X
% 0.71/1.11 ) ) ) ] )
% 0.71/1.11 , 0, substitution( 0, [ :=( X, implies( not( not( X ) ), implies( Y, X ) )
% 0.71/1.11 ), :=( Y, Z )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 subsumption(
% 0.71/1.11 clause( 216, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies(
% 0.71/1.11 not( not( X ) ), implies( Y, X ) ), Z ) ) ) ] )
% 0.71/1.11 , clause( 671, [ ~( 'is_a_theorem'( implies( implies( not( not( X ) ),
% 0.71/1.11 implies( Y, X ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.71/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.11 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 resolution(
% 0.71/1.11 clause( 672, [ 'is_a_theorem'( implies( not( not( X ) ), X ) ) ] )
% 0.71/1.11 , clause( 216, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies(
% 0.71/1.11 not( not( X ) ), implies( Y, X ) ), Z ) ) ) ] )
% 0.71/1.11 , 1, clause( 60, [ 'is_a_theorem'( implies( implies( X, implies( implies( Y
% 0.71/1.11 , Y ), Z ) ), implies( X, Z ) ) ) ] )
% 0.71/1.11 , 0, substitution( 0, [ :=( X, X ), :=( Y, implies( Y, Y ) ), :=( Z,
% 0.71/1.11 implies( not( not( X ) ), X ) )] ), substitution( 1, [ :=( X, not( not( X
% 0.71/1.11 ) ) ), :=( Y, Y ), :=( Z, X )] )).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 subsumption(
% 0.71/1.11 clause( 226, [ 'is_a_theorem'( implies( not( not( X ) ), X ) ) ] )
% 0.71/1.11 , clause( 672, [ 'is_a_theorem'( implies( not( not( X ) ), X ) ) ] )
% 0.71/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 resolution(
% 0.71/1.11 clause( 674, [ ~( 'is_a_theorem'( implies( implies( not( not( X ) ), X ), Y
% 0.71/1.11 ) ) ), 'is_a_theorem'( Y ) ] )
% 0.71/1.11 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.71/1.11 , ~( 'is_a_theorem'( X ) ) ] )
% 0.71/1.11 , 2, clause( 226, [ 'is_a_theorem'( implies( not( not( X ) ), X ) ) ] )
% 0.71/1.11 , 0, substitution( 0, [ :=( X, implies( not( not( X ) ), X ) ), :=( Y, Y )] )
% 0.71/1.11 , substitution( 1, [ :=( X, X )] )).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 subsumption(
% 0.71/1.11 clause( 231, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( implies( implies(
% 0.71/1.11 not( not( X ) ), X ), Y ) ) ) ] )
% 0.71/1.11 , clause( 674, [ ~( 'is_a_theorem'( implies( implies( not( not( X ) ), X )
% 0.71/1.11 , Y ) ) ), 'is_a_theorem'( Y ) ] )
% 0.71/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.71/1.11 ), ==>( 1, 0 )] ) ).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 resolution(
% 0.71/1.11 clause( 675, [ 'is_a_theorem'( implies( X, not( not( X ) ) ) ) ] )
% 0.71/1.11 , clause( 231, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( implies( implies(
% 0.71/1.11 not( not( X ) ), X ), Y ) ) ) ] )
% 0.71/1.11 , 1, clause( 3, [ 'is_a_theorem'( implies( implies( not( X ), not( Y ) ),
% 0.71/1.11 implies( Y, X ) ) ) ] )
% 0.71/1.11 , 0, substitution( 0, [ :=( X, not( X ) ), :=( Y, implies( X, not( not( X )
% 0.71/1.11 ) ) )] ), substitution( 1, [ :=( X, not( not( X ) ) ), :=( Y, X )] )
% 0.71/1.11 ).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 subsumption(
% 0.71/1.11 clause( 247, [ 'is_a_theorem'( implies( X, not( not( X ) ) ) ) ] )
% 0.71/1.11 , clause( 675, [ 'is_a_theorem'( implies( X, not( not( X ) ) ) ) ] )
% 0.71/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 resolution(
% 0.71/1.11 clause( 677, [ ~( 'is_a_theorem'( implies( implies( X, not( not( X ) ) ), Y
% 0.71/1.11 ) ) ), 'is_a_theorem'( Y ) ] )
% 0.71/1.11 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.71/1.11 , ~( 'is_a_theorem'( X ) ) ] )
% 0.71/1.11 , 2, clause( 247, [ 'is_a_theorem'( implies( X, not( not( X ) ) ) ) ] )
% 0.71/1.11 , 0, substitution( 0, [ :=( X, implies( X, not( not( X ) ) ) ), :=( Y, Y )] )
% 0.71/1.11 , substitution( 1, [ :=( X, X )] )).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 subsumption(
% 0.71/1.11 clause( 270, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( implies( implies( X
% 0.71/1.11 , not( not( X ) ) ), Y ) ) ) ] )
% 0.71/1.11 , clause( 677, [ ~( 'is_a_theorem'( implies( implies( X, not( not( X ) ) )
% 0.71/1.11 , Y ) ) ), 'is_a_theorem'( Y ) ] )
% 0.71/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.71/1.11 ), ==>( 1, 0 )] ) ).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 resolution(
% 0.71/1.11 clause( 678, [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies(
% 0.71/1.11 Z, X ), implies( Z, Y ) ) ) ) ] )
% 0.71/1.11 , clause( 69, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( implies( implies( X
% 0.71/1.11 , implies( implies( Y, implies( Z, T ) ), implies( implies( Y, Z ),
% 0.71/1.11 implies( Y, T ) ) ) ), U ) ) ) ] )
% 0.71/1.11 , 1, clause( 59, [ 'is_a_theorem'( implies( implies( X, implies( implies( Y
% 0.71/1.11 , X ), Z ) ), implies( X, Z ) ) ) ] )
% 0.71/1.11 , 0, substitution( 0, [ :=( X, implies( X, Y ) ), :=( Y, Z ), :=( Z, X ),
% 0.71/1.11 :=( T, Y ), :=( U, implies( implies( X, Y ), implies( implies( Z, X ),
% 0.71/1.11 implies( Z, Y ) ) ) )] ), substitution( 1, [ :=( X, implies( X, Y ) ),
% 0.71/1.11 :=( Y, Z ), :=( Z, implies( implies( Z, X ), implies( Z, Y ) ) )] )).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 subsumption(
% 0.71/1.11 clause( 439, [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies(
% 0.71/1.11 Z, X ), implies( Z, Y ) ) ) ) ] )
% 0.71/1.11 , clause( 678, [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies(
% 0.71/1.11 Z, X ), implies( Z, Y ) ) ) ) ] )
% 0.71/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.11 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 resolution(
% 0.71/1.11 clause( 679, [ 'is_a_theorem'( implies( implies( X, not( Y ) ), implies( X
% 0.71/1.11 , implies( Y, Z ) ) ) ) ] )
% 0.71/1.11 , clause( 91, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies(
% 0.71/1.11 not( X ), implies( X, Y ) ), Z ) ) ) ] )
% 0.71/1.11 , 1, clause( 439, [ 'is_a_theorem'( implies( implies( X, Y ), implies(
% 0.71/1.11 implies( Z, X ), implies( Z, Y ) ) ) ) ] )
% 0.71/1.11 , 0, substitution( 0, [ :=( X, Y ), :=( Y, Z ), :=( Z, implies( implies( X
% 0.71/1.11 , not( Y ) ), implies( X, implies( Y, Z ) ) ) )] ), substitution( 1, [
% 0.71/1.11 :=( X, not( Y ) ), :=( Y, implies( Y, Z ) ), :=( Z, X )] )).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 subsumption(
% 0.71/1.11 clause( 458, [ 'is_a_theorem'( implies( implies( X, not( Y ) ), implies( X
% 0.71/1.11 , implies( Y, Z ) ) ) ) ] )
% 0.71/1.11 , clause( 679, [ 'is_a_theorem'( implies( implies( X, not( Y ) ), implies(
% 0.71/1.11 X, implies( Y, Z ) ) ) ) ] )
% 0.71/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.11 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 resolution(
% 0.71/1.11 clause( 680, [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ] )
% 0.71/1.11 , clause( 270, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( implies( implies(
% 0.71/1.11 X, not( not( X ) ) ), Y ) ) ) ] )
% 0.71/1.11 , 1, clause( 458, [ 'is_a_theorem'( implies( implies( X, not( Y ) ),
% 0.71/1.11 implies( X, implies( Y, Z ) ) ) ) ] )
% 0.71/1.11 , 0, substitution( 0, [ :=( X, X ), :=( Y, implies( X, implies( not( X ), Y
% 0.71/1.11 ) ) )] ), substitution( 1, [ :=( X, X ), :=( Y, not( X ) ), :=( Z, Y )] )
% 0.71/1.11 ).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 subsumption(
% 0.71/1.11 clause( 597, [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ] )
% 0.71/1.11 , clause( 680, [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ]
% 0.71/1.11 )
% 0.71/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.11 )] ) ).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 resolution(
% 0.71/1.11 clause( 681, [] )
% 0.71/1.11 , clause( 4, [ ~( 'is_a_theorem'( implies( a, implies( not( a ), b ) ) ) )
% 0.71/1.11 ] )
% 0.71/1.11 , 0, clause( 597, [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) )
% 0.71/1.11 ] )
% 0.71/1.11 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, a ), :=( Y, b )] )
% 0.71/1.11 ).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 subsumption(
% 0.71/1.11 clause( 630, [] )
% 0.71/1.11 , clause( 681, [] )
% 0.71/1.11 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 end.
% 0.71/1.11
% 0.71/1.11 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.71/1.11
% 0.71/1.11 Memory use:
% 0.71/1.11
% 0.71/1.11 space for terms: 9443
% 0.71/1.11 space for clauses: 54016
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 clauses generated: 3269
% 0.71/1.11 clauses kept: 631
% 0.71/1.11 clauses selected: 188
% 0.71/1.11 clauses deleted: 4
% 0.71/1.11 clauses inuse deleted: 0
% 0.71/1.11
% 0.71/1.11 subsentry: 2842
% 0.71/1.11 literals s-matched: 2643
% 0.71/1.11 literals matched: 2643
% 0.71/1.11 full subsumption: 0
% 0.71/1.11
% 0.71/1.11 checksum: -444987020
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 Bliksem ended
%------------------------------------------------------------------------------