TSTP Solution File: LCL362-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL362-1 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n023.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:53:01 EDT 2022
% Result : Unsatisfiable 0.70s 1.11s
% Output : Refutation 0.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LCL362-1 : TPTP v8.1.0. Released v2.3.0.
% 0.04/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n023.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % DateTime : Mon Jul 4 18:03:57 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.70/1.11 *** allocated 10000 integers for termspace/termends
% 0.70/1.11 *** allocated 10000 integers for clauses
% 0.70/1.11 *** allocated 10000 integers for justifications
% 0.70/1.11 Bliksem 1.12
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 Automatic Strategy Selection
% 0.70/1.11
% 0.70/1.11 Clauses:
% 0.70/1.11 [
% 0.70/1.11 [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'( X ) ),
% 0.70/1.11 'is_a_theorem'( Y ) ],
% 0.70/1.11 [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies( Y, Z ),
% 0.70/1.11 implies( X, Z ) ) ) ) ],
% 0.70/1.11 [ 'is_a_theorem'( implies( implies( not( X ), X ), X ) ) ],
% 0.70/1.11 [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ],
% 0.70/1.11 [ ~( 'is_a_theorem'( implies( implies( x, implies( implies( not( y ), y
% 0.70/1.11 ), y ) ), implies( implies( not( y ), y ), y ) ) ) ) ]
% 0.70/1.11 ] .
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 percentage equality = 0.000000, percentage horn = 1.000000
% 0.70/1.11 This is a near-Horn, non-equality problem
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 Options Used:
% 0.70/1.11
% 0.70/1.11 useres = 1
% 0.70/1.11 useparamod = 0
% 0.70/1.11 useeqrefl = 0
% 0.70/1.11 useeqfact = 0
% 0.70/1.11 usefactor = 1
% 0.70/1.11 usesimpsplitting = 0
% 0.70/1.11 usesimpdemod = 0
% 0.70/1.11 usesimpres = 4
% 0.70/1.11
% 0.70/1.11 resimpinuse = 1000
% 0.70/1.11 resimpclauses = 20000
% 0.70/1.11 substype = standard
% 0.70/1.11 backwardsubs = 1
% 0.70/1.11 selectoldest = 5
% 0.70/1.11
% 0.70/1.11 litorderings [0] = split
% 0.70/1.11 litorderings [1] = liftord
% 0.70/1.11
% 0.70/1.11 termordering = none
% 0.70/1.11
% 0.70/1.11 litapriori = 1
% 0.70/1.11 termapriori = 0
% 0.70/1.11 litaposteriori = 0
% 0.70/1.11 termaposteriori = 0
% 0.70/1.11 demodaposteriori = 0
% 0.70/1.11 ordereqreflfact = 0
% 0.70/1.11
% 0.70/1.11 litselect = negative
% 0.70/1.11
% 0.70/1.11 maxweight = 30000
% 0.70/1.11 maxdepth = 30000
% 0.70/1.11 maxlength = 115
% 0.70/1.11 maxnrvars = 195
% 0.70/1.11 excuselevel = 0
% 0.70/1.11 increasemaxweight = 0
% 0.70/1.11
% 0.70/1.11 maxselected = 10000000
% 0.70/1.11 maxnrclauses = 10000000
% 0.70/1.11
% 0.70/1.11 showgenerated = 0
% 0.70/1.11 showkept = 0
% 0.70/1.11 showselected = 0
% 0.70/1.11 showdeleted = 0
% 0.70/1.11 showresimp = 1
% 0.70/1.11 showstatus = 2000
% 0.70/1.11
% 0.70/1.11 prologoutput = 1
% 0.70/1.11 nrgoals = 5000000
% 0.70/1.11 totalproof = 1
% 0.70/1.11
% 0.70/1.11 Symbols occurring in the translation:
% 0.70/1.11
% 0.70/1.11 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.70/1.11 . [1, 2] (w:1, o:21, a:1, s:1, b:0),
% 0.70/1.11 ! [4, 1] (w:1, o:14, a:1, s:1, b:0),
% 0.70/1.11 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.70/1.11 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.70/1.11 implies [41, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.70/1.11 'is_a_theorem' [42, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.70/1.11 not [44, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.70/1.11 x [45, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.70/1.11 y [46, 0] (w:1, o:13, a:1, s:1, b:0).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 Starting Search:
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 Bliksems!, er is een bewijs:
% 0.70/1.11 % SZS status Unsatisfiable
% 0.70/1.11 % SZS output start Refutation
% 0.70/1.11
% 0.70/1.11 clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y ),
% 0.70/1.11 ~( 'is_a_theorem'( X ) ) ] )
% 0.70/1.11 .
% 0.70/1.11 clause( 1, [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies( Y
% 0.70/1.11 , Z ), implies( X, Z ) ) ) ) ] )
% 0.70/1.11 .
% 0.70/1.11 clause( 2, [ 'is_a_theorem'( implies( implies( not( X ), X ), X ) ) ] )
% 0.70/1.11 .
% 0.70/1.11 clause( 3, [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ] )
% 0.70/1.11 .
% 0.70/1.11 clause( 4, [ ~( 'is_a_theorem'( implies( implies( x, implies( implies( not(
% 0.70/1.11 y ), y ), y ) ), implies( implies( not( y ), y ), y ) ) ) ) ] )
% 0.70/1.11 .
% 0.70/1.11 clause( 5, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( implies( implies(
% 0.70/1.11 implies( not( X ), X ), X ), Y ) ) ) ] )
% 0.70/1.11 .
% 0.70/1.11 clause( 6, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X,
% 0.70/1.11 implies( not( X ), Y ) ), Z ) ) ) ] )
% 0.70/1.11 .
% 0.70/1.11 clause( 7, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 0.70/1.11 implies( X, Y ), implies( implies( Y, Z ), implies( X, Z ) ) ), T ) ) ) ]
% 0.70/1.11 )
% 0.70/1.11 .
% 0.70/1.11 clause( 8, [ 'is_a_theorem'( implies( implies( implies( not( X ), Y ), Z )
% 0.70/1.11 , implies( X, Z ) ) ) ] )
% 0.70/1.11 .
% 0.70/1.11 clause( 12, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 0.70/1.11 implies( implies( not( X ), Y ), Z ), implies( X, Z ) ), T ) ) ) ] )
% 0.70/1.11 .
% 0.70/1.11 clause( 16, [ 'is_a_theorem'( implies( X, X ) ) ] )
% 0.70/1.11 .
% 0.70/1.11 clause( 21, [ 'is_a_theorem'( implies( implies( implies( implies( X, Y ),
% 0.70/1.11 implies( Z, Y ) ), T ), implies( implies( Z, X ), T ) ) ) ] )
% 0.70/1.11 .
% 0.70/1.11 clause( 23, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( implies( implies( X,
% 0.70/1.11 X ), Y ) ) ) ] )
% 0.70/1.11 .
% 0.70/1.11 clause( 25, [ 'is_a_theorem'( implies( not( implies( X, X ) ), Y ) ) ] )
% 0.70/1.11 .
% 0.70/1.11 clause( 26, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( not(
% 0.70/1.11 implies( X, X ) ), Y ), Z ) ) ) ] )
% 0.70/1.11 .
% 0.70/1.11 clause( 94, [ 'is_a_theorem'( implies( implies( X, not( Y ) ), implies( Y,
% 0.70/1.11 implies( X, Z ) ) ) ) ] )
% 0.70/1.11 .
% 0.70/1.11 clause( 98, [ 'is_a_theorem'( implies( X, implies( not( implies( Y, Y ) ),
% 0.70/1.11 Z ) ) ) ] )
% 0.70/1.11 .
% 0.70/1.11 clause( 102, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies( X
% 0.70/1.11 , implies( not( implies( Y, Y ) ), Z ) ), T ) ) ) ] )
% 0.70/1.11 .
% 0.70/1.11 clause( 123, [ 'is_a_theorem'( implies( implies( implies( not( implies( X,
% 0.70/1.11 X ) ), Y ), Z ), implies( T, Z ) ) ) ] )
% 0.70/1.11 .
% 0.70/1.11 clause( 133, [ 'is_a_theorem'( implies( X, implies( Y, Y ) ) ) ] )
% 0.70/1.11 .
% 0.70/1.11 clause( 135, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X
% 0.70/1.11 , implies( Y, Y ) ), Z ) ) ) ] )
% 0.70/1.11 .
% 0.70/1.11 clause( 142, [ 'is_a_theorem'( implies( implies( implies( X, X ), Y ),
% 0.70/1.11 implies( Z, Y ) ) ) ] )
% 0.70/1.11 .
% 0.70/1.11 clause( 146, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 0.70/1.11 implies( implies( X, X ), Y ), implies( Z, Y ) ), T ) ) ) ] )
% 0.70/1.11 .
% 0.70/1.11 clause( 180, [ 'is_a_theorem'( implies( implies( X, Y ), implies( Z,
% 0.70/1.11 implies( X, Y ) ) ) ) ] )
% 0.70/1.11 .
% 0.70/1.11 clause( 206, [ 'is_a_theorem'( implies( X, implies( implies( not( Y ), Y )
% 0.70/1.11 , Y ) ) ) ] )
% 0.70/1.11 .
% 0.70/1.11 clause( 208, [] )
% 0.70/1.11 .
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 % SZS output end Refutation
% 0.70/1.11 found a proof!
% 0.70/1.11
% 0.70/1.11 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.70/1.11
% 0.70/1.11 initialclauses(
% 0.70/1.11 [ clause( 210, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'(
% 0.70/1.11 X ) ), 'is_a_theorem'( Y ) ] )
% 0.70/1.11 , clause( 211, [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies(
% 0.70/1.11 Y, Z ), implies( X, Z ) ) ) ) ] )
% 0.70/1.11 , clause( 212, [ 'is_a_theorem'( implies( implies( not( X ), X ), X ) ) ]
% 0.70/1.11 )
% 0.70/1.11 , clause( 213, [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ]
% 0.70/1.11 )
% 0.70/1.11 , clause( 214, [ ~( 'is_a_theorem'( implies( implies( x, implies( implies(
% 0.70/1.11 not( y ), y ), y ) ), implies( implies( not( y ), y ), y ) ) ) ) ] )
% 0.70/1.11 ] ).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 subsumption(
% 0.70/1.11 clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y ),
% 0.70/1.11 ~( 'is_a_theorem'( X ) ) ] )
% 0.70/1.11 , clause( 210, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'(
% 0.70/1.11 X ) ), 'is_a_theorem'( Y ) ] )
% 0.70/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.70/1.11 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 subsumption(
% 0.70/1.11 clause( 1, [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies( Y
% 0.70/1.11 , Z ), implies( X, Z ) ) ) ) ] )
% 0.70/1.11 , clause( 211, [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies(
% 0.70/1.11 Y, Z ), implies( X, Z ) ) ) ) ] )
% 0.70/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.70/1.11 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 subsumption(
% 0.70/1.11 clause( 2, [ 'is_a_theorem'( implies( implies( not( X ), X ), X ) ) ] )
% 0.70/1.11 , clause( 212, [ 'is_a_theorem'( implies( implies( not( X ), X ), X ) ) ]
% 0.70/1.11 )
% 0.70/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 subsumption(
% 0.70/1.11 clause( 3, [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ] )
% 0.70/1.11 , clause( 213, [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ]
% 0.70/1.11 )
% 0.70/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.70/1.11 )] ) ).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 subsumption(
% 0.70/1.11 clause( 4, [ ~( 'is_a_theorem'( implies( implies( x, implies( implies( not(
% 0.70/1.11 y ), y ), y ) ), implies( implies( not( y ), y ), y ) ) ) ) ] )
% 0.70/1.11 , clause( 214, [ ~( 'is_a_theorem'( implies( implies( x, implies( implies(
% 0.70/1.11 not( y ), y ), y ) ), implies( implies( not( y ), y ), y ) ) ) ) ] )
% 0.70/1.11 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 resolution(
% 0.70/1.11 clause( 216, [ ~( 'is_a_theorem'( implies( implies( implies( not( X ), X )
% 0.70/1.11 , X ), Y ) ) ), 'is_a_theorem'( Y ) ] )
% 0.70/1.11 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.70/1.11 , ~( 'is_a_theorem'( X ) ) ] )
% 0.70/1.11 , 2, clause( 2, [ 'is_a_theorem'( implies( implies( not( X ), X ), X ) ) ]
% 0.70/1.11 )
% 0.70/1.11 , 0, substitution( 0, [ :=( X, implies( implies( not( X ), X ), X ) ), :=(
% 0.70/1.11 Y, Y )] ), substitution( 1, [ :=( X, X )] )).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 subsumption(
% 0.70/1.11 clause( 5, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( implies( implies(
% 0.70/1.11 implies( not( X ), X ), X ), Y ) ) ) ] )
% 0.70/1.11 , clause( 216, [ ~( 'is_a_theorem'( implies( implies( implies( not( X ), X
% 0.70/1.11 ), X ), Y ) ) ), 'is_a_theorem'( Y ) ] )
% 0.70/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.70/1.11 ), ==>( 1, 0 )] ) ).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 resolution(
% 0.70/1.11 clause( 218, [ ~( 'is_a_theorem'( implies( implies( X, implies( not( X ), Y
% 0.70/1.11 ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.70/1.11 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.70/1.11 , ~( 'is_a_theorem'( X ) ) ] )
% 0.70/1.11 , 2, clause( 3, [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ]
% 0.70/1.11 )
% 0.70/1.11 , 0, substitution( 0, [ :=( X, implies( X, implies( not( X ), Y ) ) ), :=(
% 0.70/1.11 Y, Z )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 subsumption(
% 0.70/1.11 clause( 6, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X,
% 0.70/1.11 implies( not( X ), Y ) ), Z ) ) ) ] )
% 0.70/1.11 , clause( 218, [ ~( 'is_a_theorem'( implies( implies( X, implies( not( X )
% 0.70/1.11 , Y ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.70/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.70/1.11 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 resolution(
% 0.70/1.11 clause( 220, [ ~( 'is_a_theorem'( implies( implies( implies( X, Y ),
% 0.70/1.11 implies( implies( Y, Z ), implies( X, Z ) ) ), T ) ) ), 'is_a_theorem'( T
% 0.70/1.11 ) ] )
% 0.70/1.11 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.70/1.11 , ~( 'is_a_theorem'( X ) ) ] )
% 0.70/1.11 , 2, clause( 1, [ 'is_a_theorem'( implies( implies( X, Y ), implies(
% 0.70/1.11 implies( Y, Z ), implies( X, Z ) ) ) ) ] )
% 0.70/1.11 , 0, substitution( 0, [ :=( X, implies( implies( X, Y ), implies( implies(
% 0.70/1.11 Y, Z ), implies( X, Z ) ) ) ), :=( Y, T )] ), substitution( 1, [ :=( X, X
% 0.70/1.11 ), :=( Y, Y ), :=( Z, Z )] )).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 subsumption(
% 0.70/1.11 clause( 7, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 0.70/1.11 implies( X, Y ), implies( implies( Y, Z ), implies( X, Z ) ) ), T ) ) ) ]
% 0.70/1.11 )
% 0.70/1.11 , clause( 220, [ ~( 'is_a_theorem'( implies( implies( implies( X, Y ),
% 0.70/1.11 implies( implies( Y, Z ), implies( X, Z ) ) ), T ) ) ), 'is_a_theorem'( T
% 0.70/1.11 ) ] )
% 0.70/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.70/1.11 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 resolution(
% 0.70/1.11 clause( 221, [ 'is_a_theorem'( implies( implies( implies( not( X ), Y ), Z
% 0.70/1.11 ), implies( X, Z ) ) ) ] )
% 0.70/1.11 , clause( 6, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X
% 0.70/1.11 , implies( not( X ), Y ) ), Z ) ) ) ] )
% 0.70/1.11 , 1, clause( 1, [ 'is_a_theorem'( implies( implies( X, Y ), implies(
% 0.70/1.11 implies( Y, Z ), implies( X, Z ) ) ) ) ] )
% 0.70/1.11 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, implies( implies(
% 0.70/1.11 implies( not( X ), Y ), Z ), implies( X, Z ) ) )] ), substitution( 1, [
% 0.70/1.11 :=( X, X ), :=( Y, implies( not( X ), Y ) ), :=( Z, Z )] )).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 subsumption(
% 0.70/1.11 clause( 8, [ 'is_a_theorem'( implies( implies( implies( not( X ), Y ), Z )
% 0.70/1.11 , implies( X, Z ) ) ) ] )
% 0.70/1.11 , clause( 221, [ 'is_a_theorem'( implies( implies( implies( not( X ), Y ),
% 0.70/1.11 Z ), implies( X, Z ) ) ) ] )
% 0.70/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.70/1.11 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 resolution(
% 0.70/1.11 clause( 223, [ ~( 'is_a_theorem'( implies( implies( implies( implies( not(
% 0.70/1.11 X ), Y ), Z ), implies( X, Z ) ), T ) ) ), 'is_a_theorem'( T ) ] )
% 0.70/1.11 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.70/1.11 , ~( 'is_a_theorem'( X ) ) ] )
% 0.70/1.11 , 2, clause( 8, [ 'is_a_theorem'( implies( implies( implies( not( X ), Y )
% 0.70/1.11 , Z ), implies( X, Z ) ) ) ] )
% 0.70/1.11 , 0, substitution( 0, [ :=( X, implies( implies( implies( not( X ), Y ), Z
% 0.70/1.11 ), implies( X, Z ) ) ), :=( Y, T )] ), substitution( 1, [ :=( X, X ),
% 0.70/1.11 :=( Y, Y ), :=( Z, Z )] )).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 subsumption(
% 0.70/1.11 clause( 12, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 0.70/1.11 implies( implies( not( X ), Y ), Z ), implies( X, Z ) ), T ) ) ) ] )
% 0.70/1.11 , clause( 223, [ ~( 'is_a_theorem'( implies( implies( implies( implies( not(
% 0.70/1.11 X ), Y ), Z ), implies( X, Z ) ), T ) ) ), 'is_a_theorem'( T ) ] )
% 0.70/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.70/1.11 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 resolution(
% 0.70/1.11 clause( 224, [ 'is_a_theorem'( implies( X, X ) ) ] )
% 0.70/1.11 , clause( 5, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( implies( implies(
% 0.70/1.11 implies( not( X ), X ), X ), Y ) ) ) ] )
% 0.70/1.11 , 1, clause( 8, [ 'is_a_theorem'( implies( implies( implies( not( X ), Y )
% 0.70/1.11 , Z ), implies( X, Z ) ) ) ] )
% 0.70/1.11 , 0, substitution( 0, [ :=( X, X ), :=( Y, implies( X, X ) )] ),
% 0.70/1.11 substitution( 1, [ :=( X, X ), :=( Y, X ), :=( Z, X )] )).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 subsumption(
% 0.70/1.11 clause( 16, [ 'is_a_theorem'( implies( X, X ) ) ] )
% 0.70/1.11 , clause( 224, [ 'is_a_theorem'( implies( X, X ) ) ] )
% 0.70/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 resolution(
% 0.70/1.11 clause( 225, [ 'is_a_theorem'( implies( implies( implies( implies( X, Y ),
% 0.70/1.11 implies( Z, Y ) ), T ), implies( implies( Z, X ), T ) ) ) ] )
% 0.70/1.11 , clause( 7, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 0.70/1.11 implies( X, Y ), implies( implies( Y, Z ), implies( X, Z ) ) ), T ) ) ) ]
% 0.70/1.11 )
% 0.70/1.11 , 1, clause( 1, [ 'is_a_theorem'( implies( implies( X, Y ), implies(
% 0.70/1.11 implies( Y, Z ), implies( X, Z ) ) ) ) ] )
% 0.70/1.11 , 0, substitution( 0, [ :=( X, Z ), :=( Y, X ), :=( Z, Y ), :=( T, implies(
% 0.70/1.11 implies( implies( implies( X, Y ), implies( Z, Y ) ), T ), implies(
% 0.70/1.11 implies( Z, X ), T ) ) )] ), substitution( 1, [ :=( X, implies( Z, X ) )
% 0.70/1.11 , :=( Y, implies( implies( X, Y ), implies( Z, Y ) ) ), :=( Z, T )] )
% 0.70/1.11 ).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 subsumption(
% 0.70/1.11 clause( 21, [ 'is_a_theorem'( implies( implies( implies( implies( X, Y ),
% 0.70/1.11 implies( Z, Y ) ), T ), implies( implies( Z, X ), T ) ) ) ] )
% 0.70/1.11 , clause( 225, [ 'is_a_theorem'( implies( implies( implies( implies( X, Y )
% 0.70/1.11 , implies( Z, Y ) ), T ), implies( implies( Z, X ), T ) ) ) ] )
% 0.70/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.70/1.11 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 resolution(
% 0.70/1.11 clause( 227, [ ~( 'is_a_theorem'( implies( implies( X, X ), Y ) ) ),
% 0.70/1.11 'is_a_theorem'( Y ) ] )
% 0.70/1.11 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.70/1.11 , ~( 'is_a_theorem'( X ) ) ] )
% 0.70/1.11 , 2, clause( 16, [ 'is_a_theorem'( implies( X, X ) ) ] )
% 0.70/1.11 , 0, substitution( 0, [ :=( X, implies( X, X ) ), :=( Y, Y )] ),
% 0.70/1.11 substitution( 1, [ :=( X, X )] )).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 subsumption(
% 0.70/1.11 clause( 23, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( implies( implies( X,
% 0.70/1.11 X ), Y ) ) ) ] )
% 0.70/1.11 , clause( 227, [ ~( 'is_a_theorem'( implies( implies( X, X ), Y ) ) ),
% 0.70/1.11 'is_a_theorem'( Y ) ] )
% 0.70/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.70/1.11 ), ==>( 1, 0 )] ) ).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 resolution(
% 0.70/1.11 clause( 228, [ 'is_a_theorem'( implies( not( implies( X, X ) ), Y ) ) ] )
% 0.70/1.11 , clause( 23, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( implies( implies( X
% 0.70/1.11 , X ), Y ) ) ) ] )
% 0.70/1.11 , 1, clause( 3, [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ]
% 0.70/1.11 )
% 0.70/1.11 , 0, substitution( 0, [ :=( X, X ), :=( Y, implies( not( implies( X, X ) )
% 0.70/1.11 , Y ) )] ), substitution( 1, [ :=( X, implies( X, X ) ), :=( Y, Y )] )
% 0.70/1.11 ).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 subsumption(
% 0.70/1.11 clause( 25, [ 'is_a_theorem'( implies( not( implies( X, X ) ), Y ) ) ] )
% 0.70/1.11 , clause( 228, [ 'is_a_theorem'( implies( not( implies( X, X ) ), Y ) ) ]
% 0.70/1.11 )
% 0.70/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.70/1.11 )] ) ).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 resolution(
% 0.70/1.11 clause( 230, [ ~( 'is_a_theorem'( implies( implies( not( implies( X, X ) )
% 0.70/1.11 , Y ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.70/1.11 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.70/1.11 , ~( 'is_a_theorem'( X ) ) ] )
% 0.70/1.11 , 2, clause( 25, [ 'is_a_theorem'( implies( not( implies( X, X ) ), Y ) ) ]
% 0.70/1.11 )
% 0.70/1.11 , 0, substitution( 0, [ :=( X, implies( not( implies( X, X ) ), Y ) ), :=(
% 0.70/1.11 Y, Z )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 subsumption(
% 0.70/1.11 clause( 26, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( not(
% 0.70/1.11 implies( X, X ) ), Y ), Z ) ) ) ] )
% 0.70/1.11 , clause( 230, [ ~( 'is_a_theorem'( implies( implies( not( implies( X, X )
% 0.70/1.11 ), Y ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.70/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.70/1.11 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 resolution(
% 0.70/1.11 clause( 231, [ 'is_a_theorem'( implies( implies( X, not( Y ) ), implies( Y
% 0.70/1.11 , implies( X, Z ) ) ) ) ] )
% 0.70/1.11 , clause( 12, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 0.70/1.11 implies( implies( not( X ), Y ), Z ), implies( X, Z ) ), T ) ) ) ] )
% 0.70/1.11 , 1, clause( 21, [ 'is_a_theorem'( implies( implies( implies( implies( X, Y
% 0.70/1.11 ), implies( Z, Y ) ), T ), implies( implies( Z, X ), T ) ) ) ] )
% 0.70/1.11 , 0, substitution( 0, [ :=( X, Y ), :=( Y, Z ), :=( Z, implies( X, Z ) ),
% 0.70/1.11 :=( T, implies( implies( X, not( Y ) ), implies( Y, implies( X, Z ) ) ) )] )
% 0.70/1.11 , substitution( 1, [ :=( X, not( Y ) ), :=( Y, Z ), :=( Z, X ), :=( T,
% 0.70/1.11 implies( Y, implies( X, Z ) ) )] )).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 subsumption(
% 0.70/1.11 clause( 94, [ 'is_a_theorem'( implies( implies( X, not( Y ) ), implies( Y,
% 0.70/1.11 implies( X, Z ) ) ) ) ] )
% 0.70/1.11 , clause( 231, [ 'is_a_theorem'( implies( implies( X, not( Y ) ), implies(
% 0.70/1.11 Y, implies( X, Z ) ) ) ) ] )
% 0.70/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.70/1.11 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 resolution(
% 0.70/1.11 clause( 232, [ 'is_a_theorem'( implies( X, implies( not( implies( Y, Y ) )
% 0.70/1.11 , Z ) ) ) ] )
% 0.70/1.11 , clause( 26, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies(
% 0.70/1.11 not( implies( X, X ) ), Y ), Z ) ) ) ] )
% 0.70/1.11 , 1, clause( 94, [ 'is_a_theorem'( implies( implies( X, not( Y ) ), implies(
% 0.70/1.11 Y, implies( X, Z ) ) ) ) ] )
% 0.70/1.11 , 0, substitution( 0, [ :=( X, Y ), :=( Y, not( X ) ), :=( Z, implies( X,
% 0.70/1.11 implies( not( implies( Y, Y ) ), Z ) ) )] ), substitution( 1, [ :=( X,
% 0.70/1.11 not( implies( Y, Y ) ) ), :=( Y, X ), :=( Z, Z )] )).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 subsumption(
% 0.70/1.11 clause( 98, [ 'is_a_theorem'( implies( X, implies( not( implies( Y, Y ) ),
% 0.70/1.11 Z ) ) ) ] )
% 0.70/1.11 , clause( 232, [ 'is_a_theorem'( implies( X, implies( not( implies( Y, Y )
% 0.70/1.11 ), Z ) ) ) ] )
% 0.70/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.70/1.11 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 resolution(
% 0.70/1.11 clause( 234, [ ~( 'is_a_theorem'( implies( implies( X, implies( not(
% 0.70/1.11 implies( Y, Y ) ), Z ) ), T ) ) ), 'is_a_theorem'( T ) ] )
% 0.70/1.11 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.70/1.11 , ~( 'is_a_theorem'( X ) ) ] )
% 0.70/1.11 , 2, clause( 98, [ 'is_a_theorem'( implies( X, implies( not( implies( Y, Y
% 0.70/1.11 ) ), Z ) ) ) ] )
% 0.70/1.11 , 0, substitution( 0, [ :=( X, implies( X, implies( not( implies( Y, Y ) )
% 0.70/1.11 , Z ) ) ), :=( Y, T )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ), :=(
% 0.70/1.11 Z, Z )] )).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 subsumption(
% 0.70/1.11 clause( 102, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies( X
% 0.70/1.11 , implies( not( implies( Y, Y ) ), Z ) ), T ) ) ) ] )
% 0.70/1.11 , clause( 234, [ ~( 'is_a_theorem'( implies( implies( X, implies( not(
% 0.70/1.11 implies( Y, Y ) ), Z ) ), T ) ) ), 'is_a_theorem'( T ) ] )
% 0.70/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.70/1.11 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 resolution(
% 0.70/1.11 clause( 235, [ 'is_a_theorem'( implies( implies( implies( not( implies( X,
% 0.70/1.11 X ) ), Y ), Z ), implies( T, Z ) ) ) ] )
% 0.70/1.11 , clause( 102, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 0.70/1.11 X, implies( not( implies( Y, Y ) ), Z ) ), T ) ) ) ] )
% 0.70/1.11 , 1, clause( 1, [ 'is_a_theorem'( implies( implies( X, Y ), implies(
% 0.70/1.11 implies( Y, Z ), implies( X, Z ) ) ) ) ] )
% 0.70/1.11 , 0, substitution( 0, [ :=( X, T ), :=( Y, X ), :=( Z, Y ), :=( T, implies(
% 0.70/1.11 implies( implies( not( implies( X, X ) ), Y ), Z ), implies( T, Z ) ) )] )
% 0.70/1.11 , substitution( 1, [ :=( X, T ), :=( Y, implies( not( implies( X, X ) ),
% 0.70/1.11 Y ) ), :=( Z, Z )] )).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 subsumption(
% 0.70/1.11 clause( 123, [ 'is_a_theorem'( implies( implies( implies( not( implies( X,
% 0.70/1.11 X ) ), Y ), Z ), implies( T, Z ) ) ) ] )
% 0.70/1.11 , clause( 235, [ 'is_a_theorem'( implies( implies( implies( not( implies( X
% 0.70/1.11 , X ) ), Y ), Z ), implies( T, Z ) ) ) ] )
% 0.70/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.70/1.11 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 resolution(
% 0.70/1.11 clause( 236, [ 'is_a_theorem'( implies( X, implies( Y, Y ) ) ) ] )
% 0.70/1.11 , clause( 5, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( implies( implies(
% 0.70/1.11 implies( not( X ), X ), X ), Y ) ) ) ] )
% 0.70/1.11 , 1, clause( 123, [ 'is_a_theorem'( implies( implies( implies( not( implies(
% 0.70/1.11 X, X ) ), Y ), Z ), implies( T, Z ) ) ) ] )
% 0.70/1.11 , 0, substitution( 0, [ :=( X, implies( Y, Y ) ), :=( Y, implies( X,
% 0.70/1.11 implies( Y, Y ) ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, implies( Y
% 0.70/1.11 , Y ) ), :=( Z, implies( Y, Y ) ), :=( T, X )] )).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 subsumption(
% 0.70/1.11 clause( 133, [ 'is_a_theorem'( implies( X, implies( Y, Y ) ) ) ] )
% 0.70/1.11 , clause( 236, [ 'is_a_theorem'( implies( X, implies( Y, Y ) ) ) ] )
% 0.70/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.70/1.11 )] ) ).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 resolution(
% 0.70/1.11 clause( 238, [ ~( 'is_a_theorem'( implies( implies( X, implies( Y, Y ) ), Z
% 0.70/1.11 ) ) ), 'is_a_theorem'( Z ) ] )
% 0.70/1.11 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.70/1.11 , ~( 'is_a_theorem'( X ) ) ] )
% 0.70/1.11 , 2, clause( 133, [ 'is_a_theorem'( implies( X, implies( Y, Y ) ) ) ] )
% 0.70/1.11 , 0, substitution( 0, [ :=( X, implies( X, implies( Y, Y ) ) ), :=( Y, Z )] )
% 0.70/1.11 , substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 subsumption(
% 0.70/1.11 clause( 135, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X
% 0.70/1.11 , implies( Y, Y ) ), Z ) ) ) ] )
% 0.70/1.11 , clause( 238, [ ~( 'is_a_theorem'( implies( implies( X, implies( Y, Y ) )
% 0.70/1.11 , Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.70/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.70/1.11 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 resolution(
% 0.70/1.11 clause( 239, [ 'is_a_theorem'( implies( implies( implies( X, X ), Y ),
% 0.70/1.11 implies( Z, Y ) ) ) ] )
% 0.70/1.11 , clause( 135, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies(
% 0.70/1.11 X, implies( Y, Y ) ), Z ) ) ) ] )
% 0.70/1.11 , 1, clause( 1, [ 'is_a_theorem'( implies( implies( X, Y ), implies(
% 0.70/1.11 implies( Y, Z ), implies( X, Z ) ) ) ) ] )
% 0.70/1.11 , 0, substitution( 0, [ :=( X, Z ), :=( Y, X ), :=( Z, implies( implies(
% 0.70/1.11 implies( X, X ), Y ), implies( Z, Y ) ) )] ), substitution( 1, [ :=( X, Z
% 0.70/1.11 ), :=( Y, implies( X, X ) ), :=( Z, Y )] )).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 subsumption(
% 0.70/1.11 clause( 142, [ 'is_a_theorem'( implies( implies( implies( X, X ), Y ),
% 0.70/1.11 implies( Z, Y ) ) ) ] )
% 0.70/1.11 , clause( 239, [ 'is_a_theorem'( implies( implies( implies( X, X ), Y ),
% 0.70/1.11 implies( Z, Y ) ) ) ] )
% 0.70/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.70/1.11 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 resolution(
% 0.70/1.11 clause( 241, [ ~( 'is_a_theorem'( implies( implies( implies( implies( X, X
% 0.70/1.11 ), Y ), implies( Z, Y ) ), T ) ) ), 'is_a_theorem'( T ) ] )
% 0.70/1.11 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.70/1.11 , ~( 'is_a_theorem'( X ) ) ] )
% 0.70/1.11 , 2, clause( 142, [ 'is_a_theorem'( implies( implies( implies( X, X ), Y )
% 0.70/1.11 , implies( Z, Y ) ) ) ] )
% 0.70/1.11 , 0, substitution( 0, [ :=( X, implies( implies( implies( X, X ), Y ),
% 0.70/1.11 implies( Z, Y ) ) ), :=( Y, T )] ), substitution( 1, [ :=( X, X ), :=( Y
% 0.70/1.11 , Y ), :=( Z, Z )] )).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 subsumption(
% 0.70/1.11 clause( 146, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 0.70/1.11 implies( implies( X, X ), Y ), implies( Z, Y ) ), T ) ) ) ] )
% 0.70/1.11 , clause( 241, [ ~( 'is_a_theorem'( implies( implies( implies( implies( X,
% 0.70/1.11 X ), Y ), implies( Z, Y ) ), T ) ) ), 'is_a_theorem'( T ) ] )
% 0.70/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.70/1.11 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 resolution(
% 0.70/1.11 clause( 242, [ 'is_a_theorem'( implies( implies( X, Y ), implies( Z,
% 0.70/1.11 implies( X, Y ) ) ) ) ] )
% 0.70/1.11 , clause( 146, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 0.70/1.11 implies( implies( X, X ), Y ), implies( Z, Y ) ), T ) ) ) ] )
% 0.70/1.11 , 1, clause( 21, [ 'is_a_theorem'( implies( implies( implies( implies( X, Y
% 0.70/1.11 ), implies( Z, Y ) ), T ), implies( implies( Z, X ), T ) ) ) ] )
% 0.70/1.11 , 0, substitution( 0, [ :=( X, Y ), :=( Y, implies( X, Y ) ), :=( Z, Z ),
% 0.70/1.11 :=( T, implies( implies( X, Y ), implies( Z, implies( X, Y ) ) ) )] ),
% 0.70/1.11 substitution( 1, [ :=( X, Y ), :=( Y, Y ), :=( Z, X ), :=( T, implies( Z
% 0.70/1.11 , implies( X, Y ) ) )] )).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 subsumption(
% 0.70/1.11 clause( 180, [ 'is_a_theorem'( implies( implies( X, Y ), implies( Z,
% 0.70/1.11 implies( X, Y ) ) ) ) ] )
% 0.70/1.11 , clause( 242, [ 'is_a_theorem'( implies( implies( X, Y ), implies( Z,
% 0.70/1.11 implies( X, Y ) ) ) ) ] )
% 0.70/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.70/1.11 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 resolution(
% 0.70/1.11 clause( 243, [ 'is_a_theorem'( implies( X, implies( implies( not( Y ), Y )
% 0.70/1.11 , Y ) ) ) ] )
% 0.70/1.11 , clause( 5, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( implies( implies(
% 0.70/1.11 implies( not( X ), X ), X ), Y ) ) ) ] )
% 0.70/1.11 , 1, clause( 180, [ 'is_a_theorem'( implies( implies( X, Y ), implies( Z,
% 0.70/1.11 implies( X, Y ) ) ) ) ] )
% 0.70/1.11 , 0, substitution( 0, [ :=( X, Y ), :=( Y, implies( X, implies( implies(
% 0.70/1.11 not( Y ), Y ), Y ) ) )] ), substitution( 1, [ :=( X, implies( not( Y ), Y
% 0.70/1.11 ) ), :=( Y, Y ), :=( Z, X )] )).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 subsumption(
% 0.70/1.11 clause( 206, [ 'is_a_theorem'( implies( X, implies( implies( not( Y ), Y )
% 0.70/1.11 , Y ) ) ) ] )
% 0.70/1.11 , clause( 243, [ 'is_a_theorem'( implies( X, implies( implies( not( Y ), Y
% 0.70/1.11 ), Y ) ) ) ] )
% 0.70/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.70/1.11 )] ) ).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 resolution(
% 0.70/1.11 clause( 244, [] )
% 0.70/1.11 , clause( 4, [ ~( 'is_a_theorem'( implies( implies( x, implies( implies(
% 0.70/1.11 not( y ), y ), y ) ), implies( implies( not( y ), y ), y ) ) ) ) ] )
% 0.70/1.11 , 0, clause( 206, [ 'is_a_theorem'( implies( X, implies( implies( not( Y )
% 0.70/1.11 , Y ), Y ) ) ) ] )
% 0.70/1.11 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, implies( x, implies(
% 0.70/1.11 implies( not( y ), y ), y ) ) ), :=( Y, y )] )).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 subsumption(
% 0.70/1.11 clause( 208, [] )
% 0.70/1.11 , clause( 244, [] )
% 0.70/1.11 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 end.
% 0.70/1.11
% 0.70/1.11 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.70/1.11
% 0.70/1.11 Memory use:
% 0.70/1.11
% 0.70/1.11 space for terms: 3459
% 0.70/1.11 space for clauses: 20881
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 clauses generated: 669
% 0.70/1.11 clauses kept: 209
% 0.70/1.11 clauses selected: 79
% 0.70/1.11 clauses deleted: 0
% 0.70/1.11 clauses inuse deleted: 0
% 0.70/1.11
% 0.70/1.11 subsentry: 545
% 0.70/1.11 literals s-matched: 461
% 0.70/1.11 literals matched: 461
% 0.70/1.11 full subsumption: 0
% 0.70/1.11
% 0.70/1.11 checksum: 1604871099
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 Bliksem ended
%------------------------------------------------------------------------------