TSTP Solution File: LCL077-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL077-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n016.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:59 EDT 2022
% Result : Unsatisfiable 0.71s 1.06s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : LCL077-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n016.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % DateTime : Sun Jul 3 12:59:45 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.71/1.06 *** allocated 10000 integers for termspace/termends
% 0.71/1.06 *** allocated 10000 integers for clauses
% 0.71/1.06 *** allocated 10000 integers for justifications
% 0.71/1.06 Bliksem 1.12
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 Automatic Strategy Selection
% 0.71/1.06
% 0.71/1.06 Clauses:
% 0.71/1.06 [
% 0.71/1.06 [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'( X ) ),
% 0.71/1.06 'is_a_theorem'( Y ) ],
% 0.71/1.06 [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ],
% 0.71/1.06 [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) ), implies(
% 0.71/1.06 implies( X, Y ), implies( X, Z ) ) ) ) ],
% 0.71/1.06 [ 'is_a_theorem'( implies( implies( not( X ), not( Y ) ), implies( Y, X
% 0.71/1.06 ) ) ) ],
% 0.71/1.06 [ ~( 'is_a_theorem'( implies( not( not( a ) ), a ) ) ) ]
% 0.71/1.06 ] .
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 percentage equality = 0.000000, percentage horn = 1.000000
% 0.71/1.06 This is a near-Horn, non-equality problem
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 Options Used:
% 0.71/1.06
% 0.71/1.06 useres = 1
% 0.71/1.06 useparamod = 0
% 0.71/1.06 useeqrefl = 0
% 0.71/1.06 useeqfact = 0
% 0.71/1.06 usefactor = 1
% 0.71/1.06 usesimpsplitting = 0
% 0.71/1.06 usesimpdemod = 0
% 0.71/1.06 usesimpres = 4
% 0.71/1.06
% 0.71/1.06 resimpinuse = 1000
% 0.71/1.06 resimpclauses = 20000
% 0.71/1.06 substype = standard
% 0.71/1.06 backwardsubs = 1
% 0.71/1.06 selectoldest = 5
% 0.71/1.06
% 0.71/1.06 litorderings [0] = split
% 0.71/1.06 litorderings [1] = liftord
% 0.71/1.06
% 0.71/1.06 termordering = none
% 0.71/1.06
% 0.71/1.06 litapriori = 1
% 0.71/1.06 termapriori = 0
% 0.71/1.06 litaposteriori = 0
% 0.71/1.06 termaposteriori = 0
% 0.71/1.06 demodaposteriori = 0
% 0.71/1.06 ordereqreflfact = 0
% 0.71/1.06
% 0.71/1.06 litselect = negative
% 0.71/1.06
% 0.71/1.06 maxweight = 30000
% 0.71/1.06 maxdepth = 30000
% 0.71/1.06 maxlength = 115
% 0.71/1.06 maxnrvars = 195
% 0.71/1.06 excuselevel = 0
% 0.71/1.06 increasemaxweight = 0
% 0.71/1.06
% 0.71/1.06 maxselected = 10000000
% 0.71/1.06 maxnrclauses = 10000000
% 0.71/1.06
% 0.71/1.06 showgenerated = 0
% 0.71/1.06 showkept = 0
% 0.71/1.06 showselected = 0
% 0.71/1.06 showdeleted = 0
% 0.71/1.06 showresimp = 1
% 0.71/1.06 showstatus = 2000
% 0.71/1.06
% 0.71/1.06 prologoutput = 1
% 0.71/1.06 nrgoals = 5000000
% 0.71/1.06 totalproof = 1
% 0.71/1.06
% 0.71/1.06 Symbols occurring in the translation:
% 0.71/1.06
% 0.71/1.06 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.71/1.06 . [1, 2] (w:1, o:20, a:1, s:1, b:0),
% 0.71/1.06 ! [4, 1] (w:1, o:13, a:1, s:1, b:0),
% 0.71/1.06 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.06 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.06 implies [41, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.71/1.06 'is_a_theorem' [42, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.71/1.06 not [44, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.71/1.06 a [45, 0] (w:1, o:12, a:1, s:1, b:0).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 Starting Search:
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 Bliksems!, er is een bewijs:
% 0.71/1.06 % SZS status Unsatisfiable
% 0.71/1.06 % SZS output start Refutation
% 0.71/1.06
% 0.71/1.06 clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y ),
% 0.71/1.06 ~( 'is_a_theorem'( X ) ) ] )
% 0.71/1.06 .
% 0.71/1.06 clause( 1, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.71/1.06 .
% 0.71/1.06 clause( 2, [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) ),
% 0.71/1.06 implies( implies( X, Y ), implies( X, Z ) ) ) ) ] )
% 0.71/1.06 .
% 0.71/1.06 clause( 3, [ 'is_a_theorem'( implies( implies( not( X ), not( Y ) ),
% 0.71/1.06 implies( Y, X ) ) ) ] )
% 0.71/1.06 .
% 0.71/1.06 clause( 4, [ ~( 'is_a_theorem'( implies( not( not( a ) ), a ) ) ) ] )
% 0.71/1.06 .
% 0.71/1.06 clause( 5, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X,
% 0.71/1.06 implies( Y, X ) ), Z ) ) ) ] )
% 0.71/1.06 .
% 0.71/1.06 clause( 6, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies(
% 0.71/1.06 implies( not( X ), not( Y ) ), implies( Y, X ) ), Z ) ) ) ] )
% 0.71/1.06 .
% 0.71/1.06 clause( 7, [ 'is_a_theorem'( implies( X, implies( Y, implies( Z, Y ) ) ) )
% 0.71/1.06 ] )
% 0.71/1.06 .
% 0.71/1.06 clause( 8, [ 'is_a_theorem'( implies( implies( X, Y ), implies( X, X ) ) )
% 0.71/1.06 ] )
% 0.71/1.06 .
% 0.71/1.06 clause( 9, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 0.71/1.06 implies( X, implies( Y, Z ) ), implies( implies( X, Y ), implies( X, Z )
% 0.71/1.06 ) ), T ) ) ) ] )
% 0.71/1.06 .
% 0.71/1.06 clause( 10, [ 'is_a_theorem'( implies( X, X ) ) ] )
% 0.71/1.06 .
% 0.71/1.06 clause( 12, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( implies( implies( X,
% 0.71/1.06 X ), Y ) ) ) ] )
% 0.71/1.06 .
% 0.71/1.06 clause( 13, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies( X,
% 0.71/1.06 implies( Y, implies( Z, Y ) ) ), T ) ) ) ] )
% 0.71/1.06 .
% 0.71/1.06 clause( 15, [ 'is_a_theorem'( implies( X, implies( Y, Y ) ) ) ] )
% 0.71/1.06 .
% 0.71/1.06 clause( 17, [ 'is_a_theorem'( implies( X, implies( implies( not( Y ), not(
% 0.71/1.06 Z ) ), implies( Z, Y ) ) ) ) ] )
% 0.71/1.06 .
% 0.71/1.06 clause( 18, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X,
% 0.71/1.06 implies( Y, Y ) ), Z ) ) ) ] )
% 0.71/1.06 .
% 0.71/1.06 clause( 19, [ 'is_a_theorem'( implies( X, implies( Y, implies( Z, Z ) ) ) )
% 0.71/1.06 ] )
% 0.71/1.06 .
% 0.71/1.06 clause( 20, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies( X,
% 0.71/1.06 implies( Y, implies( Z, Z ) ) ), T ) ) ) ] )
% 0.71/1.06 .
% 0.71/1.06 clause( 23, [ 'is_a_theorem'( implies( implies( implies( X, implies( Y, Z )
% 0.71/1.06 ), implies( X, Y ) ), implies( implies( X, implies( Y, Z ) ), implies( X
% 0.71/1.06 , Z ) ) ) ) ] )
% 0.71/1.06 .
% 0.71/1.06 clause( 26, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies( X,
% 0.71/1.06 implies( implies( not( Y ), not( Z ) ), implies( Z, Y ) ) ), T ) ) ) ] )
% 0.71/1.06 .
% 0.71/1.06 clause( 59, [ 'is_a_theorem'( implies( implies( X, implies( implies( Y, X )
% 0.71/1.06 , Z ) ), implies( X, Z ) ) ) ] )
% 0.71/1.06 .
% 0.71/1.06 clause( 60, [ 'is_a_theorem'( implies( implies( X, implies( implies( Y, Y )
% 0.71/1.06 , Z ) ), implies( X, Z ) ) ) ] )
% 0.71/1.06 .
% 0.71/1.06 clause( 86, [ 'is_a_theorem'( implies( not( X ), implies( X, Y ) ) ) ] )
% 0.71/1.06 .
% 0.71/1.06 clause( 90, [ 'is_a_theorem'( implies( implies( X, implies( not( Y ), not(
% 0.71/1.06 Z ) ) ), implies( X, implies( Z, Y ) ) ) ) ] )
% 0.71/1.06 .
% 0.71/1.06 clause( 91, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( not(
% 0.71/1.06 X ), implies( X, Y ) ), Z ) ) ) ] )
% 0.71/1.06 .
% 0.71/1.06 clause( 212, [ 'is_a_theorem'( implies( not( not( X ) ), implies( Y, X ) )
% 0.71/1.06 ) ] )
% 0.71/1.06 .
% 0.71/1.06 clause( 216, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies(
% 0.71/1.06 not( not( X ) ), implies( Y, X ) ), Z ) ) ) ] )
% 0.71/1.06 .
% 0.71/1.06 clause( 226, [ 'is_a_theorem'( implies( not( not( X ) ), X ) ) ] )
% 0.71/1.06 .
% 0.71/1.06 clause( 232, [] )
% 0.71/1.06 .
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 % SZS output end Refutation
% 0.71/1.06 found a proof!
% 0.71/1.06
% 0.71/1.06 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.71/1.06
% 0.71/1.06 initialclauses(
% 0.71/1.06 [ clause( 234, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'(
% 0.71/1.06 X ) ), 'is_a_theorem'( Y ) ] )
% 0.71/1.06 , clause( 235, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.71/1.06 , clause( 236, [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) ),
% 0.71/1.06 implies( implies( X, Y ), implies( X, Z ) ) ) ) ] )
% 0.71/1.06 , clause( 237, [ 'is_a_theorem'( implies( implies( not( X ), not( Y ) ),
% 0.71/1.06 implies( Y, X ) ) ) ] )
% 0.71/1.06 , clause( 238, [ ~( 'is_a_theorem'( implies( not( not( a ) ), a ) ) ) ] )
% 0.71/1.06 ] ).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 subsumption(
% 0.71/1.06 clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y ),
% 0.71/1.06 ~( 'is_a_theorem'( X ) ) ] )
% 0.71/1.06 , clause( 234, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'(
% 0.71/1.06 X ) ), 'is_a_theorem'( Y ) ] )
% 0.71/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.06 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 subsumption(
% 0.71/1.06 clause( 1, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.71/1.06 , clause( 235, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.71/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.06 )] ) ).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 subsumption(
% 0.71/1.06 clause( 2, [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) ),
% 0.71/1.06 implies( implies( X, Y ), implies( X, Z ) ) ) ) ] )
% 0.71/1.06 , clause( 236, [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) ),
% 0.71/1.06 implies( implies( X, Y ), implies( X, Z ) ) ) ) ] )
% 0.71/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.06 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 subsumption(
% 0.71/1.06 clause( 3, [ 'is_a_theorem'( implies( implies( not( X ), not( Y ) ),
% 0.71/1.06 implies( Y, X ) ) ) ] )
% 0.71/1.06 , clause( 237, [ 'is_a_theorem'( implies( implies( not( X ), not( Y ) ),
% 0.71/1.06 implies( Y, X ) ) ) ] )
% 0.71/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.06 )] ) ).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 subsumption(
% 0.71/1.06 clause( 4, [ ~( 'is_a_theorem'( implies( not( not( a ) ), a ) ) ) ] )
% 0.71/1.06 , clause( 238, [ ~( 'is_a_theorem'( implies( not( not( a ) ), a ) ) ) ] )
% 0.71/1.06 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 resolution(
% 0.71/1.06 clause( 240, [ ~( 'is_a_theorem'( implies( implies( X, implies( Y, X ) ), Z
% 0.71/1.06 ) ) ), 'is_a_theorem'( Z ) ] )
% 0.71/1.06 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.71/1.06 , ~( 'is_a_theorem'( X ) ) ] )
% 0.71/1.06 , 2, clause( 1, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.71/1.06 , 0, substitution( 0, [ :=( X, implies( X, implies( Y, X ) ) ), :=( Y, Z )] )
% 0.71/1.06 , substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 subsumption(
% 0.71/1.06 clause( 5, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X,
% 0.71/1.06 implies( Y, X ) ), Z ) ) ) ] )
% 0.71/1.06 , clause( 240, [ ~( 'is_a_theorem'( implies( implies( X, implies( Y, X ) )
% 0.71/1.06 , Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.71/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.06 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 resolution(
% 0.71/1.06 clause( 242, [ ~( 'is_a_theorem'( implies( implies( implies( not( X ), not(
% 0.71/1.06 Y ) ), implies( Y, X ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.71/1.06 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.71/1.06 , ~( 'is_a_theorem'( X ) ) ] )
% 0.71/1.06 , 2, clause( 3, [ 'is_a_theorem'( implies( implies( not( X ), not( Y ) ),
% 0.71/1.06 implies( Y, X ) ) ) ] )
% 0.71/1.06 , 0, substitution( 0, [ :=( X, implies( implies( not( X ), not( Y ) ),
% 0.71/1.06 implies( Y, X ) ) ), :=( Y, Z )] ), substitution( 1, [ :=( X, X ), :=( Y
% 0.71/1.06 , Y )] )).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 subsumption(
% 0.71/1.06 clause( 6, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies(
% 0.71/1.06 implies( not( X ), not( Y ) ), implies( Y, X ) ), Z ) ) ) ] )
% 0.71/1.06 , clause( 242, [ ~( 'is_a_theorem'( implies( implies( implies( not( X ),
% 0.71/1.06 not( Y ) ), implies( Y, X ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.71/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.06 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 resolution(
% 0.71/1.06 clause( 243, [ 'is_a_theorem'( implies( X, implies( Y, implies( Z, Y ) ) )
% 0.71/1.06 ) ] )
% 0.71/1.06 , clause( 5, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X
% 0.71/1.06 , implies( Y, X ) ), Z ) ) ) ] )
% 0.71/1.06 , 1, clause( 1, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.71/1.06 , 0, substitution( 0, [ :=( X, Y ), :=( Y, Z ), :=( Z, implies( X, implies(
% 0.71/1.06 Y, implies( Z, Y ) ) ) )] ), substitution( 1, [ :=( X, implies( Y,
% 0.71/1.06 implies( Z, Y ) ) ), :=( Y, X )] )).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 subsumption(
% 0.71/1.06 clause( 7, [ 'is_a_theorem'( implies( X, implies( Y, implies( Z, Y ) ) ) )
% 0.71/1.06 ] )
% 0.71/1.06 , clause( 243, [ 'is_a_theorem'( implies( X, implies( Y, implies( Z, Y ) )
% 0.71/1.06 ) ) ] )
% 0.71/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.06 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 resolution(
% 0.71/1.06 clause( 244, [ 'is_a_theorem'( implies( implies( X, Y ), implies( X, X ) )
% 0.71/1.06 ) ] )
% 0.71/1.06 , clause( 5, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X
% 0.71/1.06 , implies( Y, X ) ), Z ) ) ) ] )
% 0.71/1.06 , 1, clause( 2, [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) ),
% 0.71/1.06 implies( implies( X, Y ), implies( X, Z ) ) ) ) ] )
% 0.71/1.06 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, implies( implies( X
% 0.71/1.06 , Y ), implies( X, X ) ) )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )
% 0.71/1.06 , :=( Z, X )] )).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 subsumption(
% 0.71/1.06 clause( 8, [ 'is_a_theorem'( implies( implies( X, Y ), implies( X, X ) ) )
% 0.71/1.06 ] )
% 0.71/1.06 , clause( 244, [ 'is_a_theorem'( implies( implies( X, Y ), implies( X, X )
% 0.71/1.06 ) ) ] )
% 0.71/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.06 )] ) ).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 resolution(
% 0.71/1.06 clause( 246, [ ~( 'is_a_theorem'( implies( implies( implies( X, implies( Y
% 0.71/1.06 , Z ) ), implies( implies( X, Y ), implies( X, Z ) ) ), T ) ) ),
% 0.71/1.06 'is_a_theorem'( T ) ] )
% 0.71/1.06 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.71/1.06 , ~( 'is_a_theorem'( X ) ) ] )
% 0.71/1.06 , 2, clause( 2, [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) ),
% 0.71/1.06 implies( implies( X, Y ), implies( X, Z ) ) ) ) ] )
% 0.71/1.06 , 0, substitution( 0, [ :=( X, implies( implies( X, implies( Y, Z ) ),
% 0.71/1.06 implies( implies( X, Y ), implies( X, Z ) ) ) ), :=( Y, T )] ),
% 0.71/1.06 substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 subsumption(
% 0.71/1.06 clause( 9, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 0.71/1.06 implies( X, implies( Y, Z ) ), implies( implies( X, Y ), implies( X, Z )
% 0.71/1.06 ) ), T ) ) ) ] )
% 0.71/1.06 , clause( 246, [ ~( 'is_a_theorem'( implies( implies( implies( X, implies(
% 0.71/1.06 Y, Z ) ), implies( implies( X, Y ), implies( X, Z ) ) ), T ) ) ),
% 0.71/1.06 'is_a_theorem'( T ) ] )
% 0.71/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.71/1.06 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 resolution(
% 0.71/1.06 clause( 247, [ 'is_a_theorem'( implies( X, X ) ) ] )
% 0.71/1.06 , clause( 5, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X
% 0.71/1.06 , implies( Y, X ) ), Z ) ) ) ] )
% 0.71/1.06 , 1, clause( 8, [ 'is_a_theorem'( implies( implies( X, Y ), implies( X, X )
% 0.71/1.06 ) ) ] )
% 0.71/1.06 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, implies( X, X ) )] )
% 0.71/1.06 , substitution( 1, [ :=( X, X ), :=( Y, implies( Y, X ) )] )).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 subsumption(
% 0.71/1.06 clause( 10, [ 'is_a_theorem'( implies( X, X ) ) ] )
% 0.71/1.06 , clause( 247, [ 'is_a_theorem'( implies( X, X ) ) ] )
% 0.71/1.06 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 resolution(
% 0.71/1.06 clause( 249, [ ~( 'is_a_theorem'( implies( implies( X, X ), Y ) ) ),
% 0.71/1.06 'is_a_theorem'( Y ) ] )
% 0.71/1.06 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.71/1.06 , ~( 'is_a_theorem'( X ) ) ] )
% 0.71/1.06 , 2, clause( 10, [ 'is_a_theorem'( implies( X, X ) ) ] )
% 0.71/1.06 , 0, substitution( 0, [ :=( X, implies( X, X ) ), :=( Y, Y )] ),
% 0.71/1.06 substitution( 1, [ :=( X, X )] )).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 subsumption(
% 0.71/1.06 clause( 12, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( implies( implies( X,
% 0.71/1.06 X ), Y ) ) ) ] )
% 0.71/1.06 , clause( 249, [ ~( 'is_a_theorem'( implies( implies( X, X ), Y ) ) ),
% 0.71/1.06 'is_a_theorem'( Y ) ] )
% 0.71/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.71/1.06 ), ==>( 1, 0 )] ) ).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 resolution(
% 0.71/1.06 clause( 251, [ ~( 'is_a_theorem'( implies( implies( X, implies( Y, implies(
% 0.71/1.06 Z, Y ) ) ), T ) ) ), 'is_a_theorem'( T ) ] )
% 0.71/1.06 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.71/1.06 , ~( 'is_a_theorem'( X ) ) ] )
% 0.71/1.06 , 2, clause( 7, [ 'is_a_theorem'( implies( X, implies( Y, implies( Z, Y ) )
% 0.71/1.06 ) ) ] )
% 0.71/1.06 , 0, substitution( 0, [ :=( X, implies( X, implies( Y, implies( Z, Y ) ) )
% 0.71/1.06 ), :=( Y, T )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )
% 0.71/1.06 ).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 subsumption(
% 0.71/1.06 clause( 13, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies( X,
% 0.71/1.06 implies( Y, implies( Z, Y ) ) ), T ) ) ) ] )
% 0.71/1.06 , clause( 251, [ ~( 'is_a_theorem'( implies( implies( X, implies( Y,
% 0.71/1.06 implies( Z, Y ) ) ), T ) ) ), 'is_a_theorem'( T ) ] )
% 0.71/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.71/1.06 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 resolution(
% 0.71/1.06 clause( 252, [ 'is_a_theorem'( implies( X, implies( Y, Y ) ) ) ] )
% 0.71/1.06 , clause( 12, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( implies( implies( X
% 0.71/1.06 , X ), Y ) ) ) ] )
% 0.71/1.06 , 1, clause( 1, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.71/1.06 , 0, substitution( 0, [ :=( X, Y ), :=( Y, implies( X, implies( Y, Y ) ) )] )
% 0.71/1.06 , substitution( 1, [ :=( X, implies( Y, Y ) ), :=( Y, X )] )).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 subsumption(
% 0.71/1.06 clause( 15, [ 'is_a_theorem'( implies( X, implies( Y, Y ) ) ) ] )
% 0.71/1.06 , clause( 252, [ 'is_a_theorem'( implies( X, implies( Y, Y ) ) ) ] )
% 0.71/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.06 )] ) ).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 resolution(
% 0.71/1.06 clause( 253, [ 'is_a_theorem'( implies( X, implies( implies( not( Y ), not(
% 0.71/1.06 Z ) ), implies( Z, Y ) ) ) ) ] )
% 0.71/1.06 , clause( 6, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies(
% 0.71/1.06 implies( not( X ), not( Y ) ), implies( Y, X ) ), Z ) ) ) ] )
% 0.71/1.06 , 1, clause( 1, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.71/1.06 , 0, substitution( 0, [ :=( X, Y ), :=( Y, Z ), :=( Z, implies( X, implies(
% 0.71/1.06 implies( not( Y ), not( Z ) ), implies( Z, Y ) ) ) )] ), substitution( 1
% 0.71/1.06 , [ :=( X, implies( implies( not( Y ), not( Z ) ), implies( Z, Y ) ) ),
% 0.71/1.06 :=( Y, X )] )).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 subsumption(
% 0.71/1.06 clause( 17, [ 'is_a_theorem'( implies( X, implies( implies( not( Y ), not(
% 0.71/1.06 Z ) ), implies( Z, Y ) ) ) ) ] )
% 0.71/1.06 , clause( 253, [ 'is_a_theorem'( implies( X, implies( implies( not( Y ),
% 0.71/1.06 not( Z ) ), implies( Z, Y ) ) ) ) ] )
% 0.71/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.06 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 resolution(
% 0.71/1.06 clause( 255, [ ~( 'is_a_theorem'( implies( implies( X, implies( Y, Y ) ), Z
% 0.71/1.06 ) ) ), 'is_a_theorem'( Z ) ] )
% 0.71/1.06 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.71/1.06 , ~( 'is_a_theorem'( X ) ) ] )
% 0.71/1.06 , 2, clause( 15, [ 'is_a_theorem'( implies( X, implies( Y, Y ) ) ) ] )
% 0.71/1.06 , 0, substitution( 0, [ :=( X, implies( X, implies( Y, Y ) ) ), :=( Y, Z )] )
% 0.71/1.06 , substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 subsumption(
% 0.71/1.06 clause( 18, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X,
% 0.71/1.06 implies( Y, Y ) ), Z ) ) ) ] )
% 0.71/1.06 , clause( 255, [ ~( 'is_a_theorem'( implies( implies( X, implies( Y, Y ) )
% 0.71/1.06 , Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.71/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.06 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 resolution(
% 0.71/1.06 clause( 256, [ 'is_a_theorem'( implies( X, implies( Y, implies( Z, Z ) ) )
% 0.71/1.06 ) ] )
% 0.71/1.06 , clause( 18, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X
% 0.71/1.06 , implies( Y, Y ) ), Z ) ) ) ] )
% 0.71/1.06 , 1, clause( 1, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.71/1.06 , 0, substitution( 0, [ :=( X, Y ), :=( Y, Z ), :=( Z, implies( X, implies(
% 0.71/1.06 Y, implies( Z, Z ) ) ) )] ), substitution( 1, [ :=( X, implies( Y,
% 0.71/1.06 implies( Z, Z ) ) ), :=( Y, X )] )).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 subsumption(
% 0.71/1.06 clause( 19, [ 'is_a_theorem'( implies( X, implies( Y, implies( Z, Z ) ) ) )
% 0.71/1.06 ] )
% 0.71/1.06 , clause( 256, [ 'is_a_theorem'( implies( X, implies( Y, implies( Z, Z ) )
% 0.71/1.06 ) ) ] )
% 0.71/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.06 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 resolution(
% 0.71/1.06 clause( 258, [ ~( 'is_a_theorem'( implies( implies( X, implies( Y, implies(
% 0.71/1.06 Z, Z ) ) ), T ) ) ), 'is_a_theorem'( T ) ] )
% 0.71/1.06 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.71/1.06 , ~( 'is_a_theorem'( X ) ) ] )
% 0.71/1.06 , 2, clause( 19, [ 'is_a_theorem'( implies( X, implies( Y, implies( Z, Z )
% 0.71/1.06 ) ) ) ] )
% 0.71/1.06 , 0, substitution( 0, [ :=( X, implies( X, implies( Y, implies( Z, Z ) ) )
% 0.71/1.06 ), :=( Y, T )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )
% 0.71/1.06 ).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 subsumption(
% 0.71/1.06 clause( 20, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies( X,
% 0.71/1.06 implies( Y, implies( Z, Z ) ) ), T ) ) ) ] )
% 0.71/1.06 , clause( 258, [ ~( 'is_a_theorem'( implies( implies( X, implies( Y,
% 0.71/1.06 implies( Z, Z ) ) ), T ) ) ), 'is_a_theorem'( T ) ] )
% 0.71/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.71/1.06 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 resolution(
% 0.71/1.06 clause( 259, [ 'is_a_theorem'( implies( implies( implies( X, implies( Y, Z
% 0.71/1.06 ) ), implies( X, Y ) ), implies( implies( X, implies( Y, Z ) ), implies(
% 0.71/1.06 X, Z ) ) ) ) ] )
% 0.71/1.06 , clause( 9, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 0.71/1.06 implies( X, implies( Y, Z ) ), implies( implies( X, Y ), implies( X, Z )
% 0.71/1.06 ) ), T ) ) ) ] )
% 0.71/1.06 , 1, clause( 2, [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) ),
% 0.71/1.06 implies( implies( X, Y ), implies( X, Z ) ) ) ) ] )
% 0.71/1.06 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, implies(
% 0.71/1.06 implies( implies( X, implies( Y, Z ) ), implies( X, Y ) ), implies(
% 0.71/1.06 implies( X, implies( Y, Z ) ), implies( X, Z ) ) ) )] ), substitution( 1
% 0.71/1.06 , [ :=( X, implies( X, implies( Y, Z ) ) ), :=( Y, implies( X, Y ) ),
% 0.71/1.06 :=( Z, implies( X, Z ) )] )).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 subsumption(
% 0.71/1.06 clause( 23, [ 'is_a_theorem'( implies( implies( implies( X, implies( Y, Z )
% 0.71/1.06 ), implies( X, Y ) ), implies( implies( X, implies( Y, Z ) ), implies( X
% 0.71/1.06 , Z ) ) ) ) ] )
% 0.71/1.06 , clause( 259, [ 'is_a_theorem'( implies( implies( implies( X, implies( Y,
% 0.71/1.06 Z ) ), implies( X, Y ) ), implies( implies( X, implies( Y, Z ) ), implies(
% 0.71/1.06 X, Z ) ) ) ) ] )
% 0.71/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.06 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 resolution(
% 0.71/1.06 clause( 261, [ ~( 'is_a_theorem'( implies( implies( X, implies( implies(
% 0.71/1.06 not( Y ), not( Z ) ), implies( Z, Y ) ) ), T ) ) ), 'is_a_theorem'( T ) ]
% 0.71/1.06 )
% 0.71/1.06 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.71/1.06 , ~( 'is_a_theorem'( X ) ) ] )
% 0.71/1.06 , 2, clause( 17, [ 'is_a_theorem'( implies( X, implies( implies( not( Y ),
% 0.71/1.06 not( Z ) ), implies( Z, Y ) ) ) ) ] )
% 0.71/1.06 , 0, substitution( 0, [ :=( X, implies( X, implies( implies( not( Y ), not(
% 0.71/1.06 Z ) ), implies( Z, Y ) ) ) ), :=( Y, T )] ), substitution( 1, [ :=( X, X
% 0.71/1.06 ), :=( Y, Y ), :=( Z, Z )] )).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 subsumption(
% 0.71/1.06 clause( 26, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies( X,
% 0.71/1.06 implies( implies( not( Y ), not( Z ) ), implies( Z, Y ) ) ), T ) ) ) ] )
% 0.71/1.06 , clause( 261, [ ~( 'is_a_theorem'( implies( implies( X, implies( implies(
% 0.71/1.06 not( Y ), not( Z ) ), implies( Z, Y ) ) ), T ) ) ), 'is_a_theorem'( T ) ]
% 0.71/1.06 )
% 0.71/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.71/1.06 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 resolution(
% 0.71/1.06 clause( 262, [ 'is_a_theorem'( implies( implies( X, implies( implies( Y, X
% 0.71/1.06 ), Z ) ), implies( X, Z ) ) ) ] )
% 0.71/1.06 , clause( 13, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies( X
% 0.71/1.06 , implies( Y, implies( Z, Y ) ) ), T ) ) ) ] )
% 0.71/1.06 , 1, clause( 23, [ 'is_a_theorem'( implies( implies( implies( X, implies( Y
% 0.71/1.06 , Z ) ), implies( X, Y ) ), implies( implies( X, implies( Y, Z ) ),
% 0.71/1.06 implies( X, Z ) ) ) ) ] )
% 0.71/1.06 , 0, substitution( 0, [ :=( X, implies( X, implies( implies( Y, X ), Z ) )
% 0.71/1.06 ), :=( Y, X ), :=( Z, Y ), :=( T, implies( implies( X, implies( implies(
% 0.71/1.06 Y, X ), Z ) ), implies( X, Z ) ) )] ), substitution( 1, [ :=( X, X ),
% 0.71/1.06 :=( Y, implies( Y, X ) ), :=( Z, Z )] )).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 subsumption(
% 0.71/1.06 clause( 59, [ 'is_a_theorem'( implies( implies( X, implies( implies( Y, X )
% 0.71/1.06 , Z ) ), implies( X, Z ) ) ) ] )
% 0.71/1.06 , clause( 262, [ 'is_a_theorem'( implies( implies( X, implies( implies( Y,
% 0.71/1.06 X ), Z ) ), implies( X, Z ) ) ) ] )
% 0.71/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.06 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 resolution(
% 0.71/1.06 clause( 263, [ 'is_a_theorem'( implies( implies( X, implies( implies( Y, Y
% 0.71/1.06 ), Z ) ), implies( X, Z ) ) ) ] )
% 0.71/1.06 , clause( 20, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies( X
% 0.71/1.06 , implies( Y, implies( Z, Z ) ) ), T ) ) ) ] )
% 0.71/1.06 , 1, clause( 23, [ 'is_a_theorem'( implies( implies( implies( X, implies( Y
% 0.71/1.06 , Z ) ), implies( X, Y ) ), implies( implies( X, implies( Y, Z ) ),
% 0.71/1.06 implies( X, Z ) ) ) ) ] )
% 0.71/1.06 , 0, substitution( 0, [ :=( X, implies( X, implies( implies( Y, Y ), Z ) )
% 0.71/1.06 ), :=( Y, X ), :=( Z, Y ), :=( T, implies( implies( X, implies( implies(
% 0.71/1.06 Y, Y ), Z ) ), implies( X, Z ) ) )] ), substitution( 1, [ :=( X, X ),
% 0.71/1.06 :=( Y, implies( Y, Y ) ), :=( Z, Z )] )).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 subsumption(
% 0.71/1.06 clause( 60, [ 'is_a_theorem'( implies( implies( X, implies( implies( Y, Y )
% 0.71/1.06 , Z ) ), implies( X, Z ) ) ) ] )
% 0.71/1.06 , clause( 263, [ 'is_a_theorem'( implies( implies( X, implies( implies( Y,
% 0.71/1.06 Y ), Z ) ), implies( X, Z ) ) ) ] )
% 0.71/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.06 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 resolution(
% 0.71/1.06 clause( 264, [ 'is_a_theorem'( implies( not( X ), implies( X, Y ) ) ) ] )
% 0.71/1.06 , clause( 26, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies( X
% 0.71/1.06 , implies( implies( not( Y ), not( Z ) ), implies( Z, Y ) ) ), T ) ) ) ]
% 0.71/1.06 )
% 0.71/1.06 , 1, clause( 59, [ 'is_a_theorem'( implies( implies( X, implies( implies( Y
% 0.71/1.06 , X ), Z ) ), implies( X, Z ) ) ) ] )
% 0.71/1.06 , 0, substitution( 0, [ :=( X, not( X ) ), :=( Y, Y ), :=( Z, X ), :=( T,
% 0.71/1.06 implies( not( X ), implies( X, Y ) ) )] ), substitution( 1, [ :=( X, not(
% 0.71/1.06 X ) ), :=( Y, not( Y ) ), :=( Z, implies( X, Y ) )] )).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 subsumption(
% 0.71/1.06 clause( 86, [ 'is_a_theorem'( implies( not( X ), implies( X, Y ) ) ) ] )
% 0.71/1.06 , clause( 264, [ 'is_a_theorem'( implies( not( X ), implies( X, Y ) ) ) ]
% 0.71/1.06 )
% 0.71/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.06 )] ) ).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 resolution(
% 0.71/1.06 clause( 265, [ 'is_a_theorem'( implies( implies( X, implies( not( Y ), not(
% 0.71/1.06 Z ) ) ), implies( X, implies( Z, Y ) ) ) ) ] )
% 0.71/1.06 , clause( 26, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies( X
% 0.71/1.06 , implies( implies( not( Y ), not( Z ) ), implies( Z, Y ) ) ), T ) ) ) ]
% 0.71/1.06 )
% 0.71/1.06 , 1, clause( 2, [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) ),
% 0.71/1.06 implies( implies( X, Y ), implies( X, Z ) ) ) ) ] )
% 0.71/1.06 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, implies(
% 0.71/1.06 implies( X, implies( not( Y ), not( Z ) ) ), implies( X, implies( Z, Y )
% 0.71/1.06 ) ) )] ), substitution( 1, [ :=( X, X ), :=( Y, implies( not( Y ), not(
% 0.71/1.06 Z ) ) ), :=( Z, implies( Z, Y ) )] )).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 subsumption(
% 0.71/1.06 clause( 90, [ 'is_a_theorem'( implies( implies( X, implies( not( Y ), not(
% 0.71/1.06 Z ) ) ), implies( X, implies( Z, Y ) ) ) ) ] )
% 0.71/1.06 , clause( 265, [ 'is_a_theorem'( implies( implies( X, implies( not( Y ),
% 0.71/1.06 not( Z ) ) ), implies( X, implies( Z, Y ) ) ) ) ] )
% 0.71/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.06 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 resolution(
% 0.71/1.06 clause( 267, [ ~( 'is_a_theorem'( implies( implies( not( X ), implies( X, Y
% 0.71/1.06 ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.71/1.06 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.71/1.06 , ~( 'is_a_theorem'( X ) ) ] )
% 0.71/1.06 , 2, clause( 86, [ 'is_a_theorem'( implies( not( X ), implies( X, Y ) ) ) ]
% 0.71/1.06 )
% 0.71/1.06 , 0, substitution( 0, [ :=( X, implies( not( X ), implies( X, Y ) ) ), :=(
% 0.71/1.06 Y, Z )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 subsumption(
% 0.71/1.06 clause( 91, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( not(
% 0.71/1.06 X ), implies( X, Y ) ), Z ) ) ) ] )
% 0.71/1.06 , clause( 267, [ ~( 'is_a_theorem'( implies( implies( not( X ), implies( X
% 0.71/1.06 , Y ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.71/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.06 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 resolution(
% 0.71/1.06 clause( 268, [ 'is_a_theorem'( implies( not( not( X ) ), implies( Y, X ) )
% 0.71/1.06 ) ] )
% 0.71/1.06 , clause( 91, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies(
% 0.71/1.06 not( X ), implies( X, Y ) ), Z ) ) ) ] )
% 0.71/1.06 , 1, clause( 90, [ 'is_a_theorem'( implies( implies( X, implies( not( Y ),
% 0.71/1.06 not( Z ) ) ), implies( X, implies( Z, Y ) ) ) ) ] )
% 0.71/1.06 , 0, substitution( 0, [ :=( X, not( X ) ), :=( Y, not( Y ) ), :=( Z,
% 0.71/1.06 implies( not( not( X ) ), implies( Y, X ) ) )] ), substitution( 1, [ :=(
% 0.71/1.06 X, not( not( X ) ) ), :=( Y, X ), :=( Z, Y )] )).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 subsumption(
% 0.71/1.06 clause( 212, [ 'is_a_theorem'( implies( not( not( X ) ), implies( Y, X ) )
% 0.71/1.06 ) ] )
% 0.71/1.06 , clause( 268, [ 'is_a_theorem'( implies( not( not( X ) ), implies( Y, X )
% 0.71/1.06 ) ) ] )
% 0.71/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.06 )] ) ).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 resolution(
% 0.71/1.06 clause( 270, [ ~( 'is_a_theorem'( implies( implies( not( not( X ) ),
% 0.71/1.06 implies( Y, X ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.71/1.06 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.71/1.06 , ~( 'is_a_theorem'( X ) ) ] )
% 0.71/1.06 , 2, clause( 212, [ 'is_a_theorem'( implies( not( not( X ) ), implies( Y, X
% 0.71/1.06 ) ) ) ] )
% 0.71/1.06 , 0, substitution( 0, [ :=( X, implies( not( not( X ) ), implies( Y, X ) )
% 0.71/1.06 ), :=( Y, Z )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 subsumption(
% 0.71/1.06 clause( 216, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies(
% 0.71/1.06 not( not( X ) ), implies( Y, X ) ), Z ) ) ) ] )
% 0.71/1.06 , clause( 270, [ ~( 'is_a_theorem'( implies( implies( not( not( X ) ),
% 0.71/1.06 implies( Y, X ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.71/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.06 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 resolution(
% 0.71/1.06 clause( 271, [ 'is_a_theorem'( implies( not( not( X ) ), X ) ) ] )
% 0.71/1.06 , clause( 216, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies(
% 0.71/1.06 not( not( X ) ), implies( Y, X ) ), Z ) ) ) ] )
% 0.71/1.06 , 1, clause( 60, [ 'is_a_theorem'( implies( implies( X, implies( implies( Y
% 0.71/1.06 , Y ), Z ) ), implies( X, Z ) ) ) ] )
% 0.71/1.06 , 0, substitution( 0, [ :=( X, X ), :=( Y, implies( Y, Y ) ), :=( Z,
% 0.71/1.06 implies( not( not( X ) ), X ) )] ), substitution( 1, [ :=( X, not( not( X
% 0.71/1.06 ) ) ), :=( Y, Y ), :=( Z, X )] )).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 subsumption(
% 0.71/1.06 clause( 226, [ 'is_a_theorem'( implies( not( not( X ) ), X ) ) ] )
% 0.71/1.06 , clause( 271, [ 'is_a_theorem'( implies( not( not( X ) ), X ) ) ] )
% 0.71/1.06 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 resolution(
% 0.71/1.06 clause( 272, [] )
% 0.71/1.06 , clause( 4, [ ~( 'is_a_theorem'( implies( not( not( a ) ), a ) ) ) ] )
% 0.71/1.06 , 0, clause( 226, [ 'is_a_theorem'( implies( not( not( X ) ), X ) ) ] )
% 0.71/1.06 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, a )] )).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 subsumption(
% 0.71/1.06 clause( 232, [] )
% 0.71/1.06 , clause( 272, [] )
% 0.71/1.06 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 end.
% 0.71/1.06
% 0.71/1.06 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.71/1.06
% 0.71/1.06 Memory use:
% 0.71/1.06
% 0.71/1.06 space for terms: 3512
% 0.71/1.06 space for clauses: 20684
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 clauses generated: 1223
% 0.71/1.06 clauses kept: 233
% 0.71/1.06 clauses selected: 100
% 0.71/1.06 clauses deleted: 3
% 0.71/1.06 clauses inuse deleted: 0
% 0.71/1.06
% 0.71/1.06 subsentry: 1102
% 0.71/1.06 literals s-matched: 994
% 0.71/1.06 literals matched: 994
% 0.71/1.06 full subsumption: 0
% 0.71/1.06
% 0.71/1.06 checksum: -554234315
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 Bliksem ended
%------------------------------------------------------------------------------