TSTP Solution File: LCL077-2 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL077-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n009.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.07s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL077-2 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n009.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 : Mon Jul 4 10:59:22 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.71/1.07 *** allocated 10000 integers for termspace/termends
% 0.71/1.07 *** allocated 10000 integers for clauses
% 0.71/1.07 *** allocated 10000 integers for justifications
% 0.71/1.07 Bliksem 1.12
% 0.71/1.07
% 0.71/1.07
% 0.71/1.07 Automatic Strategy Selection
% 0.71/1.07
% 0.71/1.07 Clauses:
% 0.71/1.07 [
% 0.71/1.07 [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'( X ) ),
% 0.71/1.07 'is_a_theorem'( Y ) ],
% 0.71/1.07 [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ],
% 0.71/1.07 [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) ), implies(
% 0.71/1.07 implies( X, Y ), implies( X, Z ) ) ) ) ],
% 0.71/1.07 [ 'is_a_theorem'( implies( implies( not( X ), not( Y ) ), implies( Y, X
% 0.71/1.07 ) ) ) ],
% 0.71/1.07 [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'( implies( Y
% 0.71/1.07 , Z ) ) ), 'is_a_theorem'( implies( X, Z ) ) ],
% 0.71/1.07 [ ~( 'is_a_theorem'( implies( not( not( a ) ), a ) ) ) ]
% 0.71/1.07 ] .
% 0.71/1.07
% 0.71/1.07
% 0.71/1.07 percentage equality = 0.000000, percentage horn = 1.000000
% 0.71/1.07 This is a near-Horn, non-equality problem
% 0.71/1.07
% 0.71/1.07
% 0.71/1.07 Options Used:
% 0.71/1.07
% 0.71/1.07 useres = 1
% 0.71/1.07 useparamod = 0
% 0.71/1.07 useeqrefl = 0
% 0.71/1.07 useeqfact = 0
% 0.71/1.07 usefactor = 1
% 0.71/1.07 usesimpsplitting = 0
% 0.71/1.07 usesimpdemod = 0
% 0.71/1.07 usesimpres = 4
% 0.71/1.07
% 0.71/1.07 resimpinuse = 1000
% 0.71/1.07 resimpclauses = 20000
% 0.71/1.07 substype = standard
% 0.71/1.07 backwardsubs = 1
% 0.71/1.07 selectoldest = 5
% 0.71/1.07
% 0.71/1.07 litorderings [0] = split
% 0.71/1.07 litorderings [1] = liftord
% 0.71/1.07
% 0.71/1.07 termordering = none
% 0.71/1.07
% 0.71/1.07 litapriori = 1
% 0.71/1.07 termapriori = 0
% 0.71/1.07 litaposteriori = 0
% 0.71/1.07 termaposteriori = 0
% 0.71/1.07 demodaposteriori = 0
% 0.71/1.07 ordereqreflfact = 0
% 0.71/1.07
% 0.71/1.07 litselect = negative
% 0.71/1.07
% 0.71/1.07 maxweight = 30000
% 0.71/1.07 maxdepth = 30000
% 0.71/1.07 maxlength = 115
% 0.71/1.07 maxnrvars = 195
% 0.71/1.07 excuselevel = 0
% 0.71/1.07 increasemaxweight = 0
% 0.71/1.07
% 0.71/1.07 maxselected = 10000000
% 0.71/1.07 maxnrclauses = 10000000
% 0.71/1.07
% 0.71/1.07 showgenerated = 0
% 0.71/1.07 showkept = 0
% 0.71/1.07 showselected = 0
% 0.71/1.07 showdeleted = 0
% 0.71/1.07 showresimp = 1
% 0.71/1.07 showstatus = 2000
% 0.71/1.07
% 0.71/1.07 prologoutput = 1
% 0.71/1.07 nrgoals = 5000000
% 0.71/1.07 totalproof = 1
% 0.71/1.07
% 0.71/1.07 Symbols occurring in the translation:
% 0.71/1.07
% 0.71/1.07 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.71/1.07 . [1, 2] (w:1, o:23, a:1, s:1, b:0),
% 0.71/1.07 ! [4, 1] (w:1, o:16, a:1, s:1, b:0),
% 0.71/1.07 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.07 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.07 implies [41, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.71/1.07 'is_a_theorem' [42, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.71/1.07 not [44, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.71/1.07 a [48, 0] (w:1, o:15, a:1, s:1, b:0).
% 0.71/1.07
% 0.71/1.07
% 0.71/1.07 Starting Search:
% 0.71/1.07
% 0.71/1.07
% 0.71/1.07 Bliksems!, er is een bewijs:
% 0.71/1.07 % SZS status Unsatisfiable
% 0.71/1.07 % SZS output start Refutation
% 0.71/1.07
% 0.71/1.07 clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y ),
% 0.71/1.07 ~( 'is_a_theorem'( X ) ) ] )
% 0.71/1.07 .
% 0.71/1.07 clause( 1, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.71/1.07 .
% 0.71/1.07 clause( 2, [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) ),
% 0.71/1.07 implies( implies( X, Y ), implies( X, Z ) ) ) ) ] )
% 0.71/1.07 .
% 0.71/1.07 clause( 3, [ 'is_a_theorem'( implies( implies( not( X ), not( Y ) ),
% 0.71/1.07 implies( Y, X ) ) ) ] )
% 0.71/1.07 .
% 0.71/1.07 clause( 4, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'(
% 0.71/1.07 implies( X, Z ) ), ~( 'is_a_theorem'( implies( Y, Z ) ) ) ] )
% 0.71/1.07 .
% 0.71/1.07 clause( 5, [ ~( 'is_a_theorem'( implies( not( not( a ) ), a ) ) ) ] )
% 0.71/1.07 .
% 0.71/1.07 clause( 6, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X,
% 0.71/1.07 implies( Y, X ) ), Z ) ) ) ] )
% 0.71/1.07 .
% 0.71/1.07 clause( 9, [ 'is_a_theorem'( implies( implies( X, Y ), implies( X, X ) ) )
% 0.71/1.07 ] )
% 0.71/1.07 .
% 0.71/1.07 clause( 11, [ 'is_a_theorem'( implies( X, X ) ) ] )
% 0.71/1.07 .
% 0.71/1.07 clause( 13, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( implies( implies( X,
% 0.71/1.07 X ), Y ) ) ) ] )
% 0.71/1.07 .
% 0.71/1.07 clause( 15, [ 'is_a_theorem'( implies( implies( implies( X, Y ), X ),
% 0.71/1.07 implies( implies( X, Y ), Y ) ) ) ] )
% 0.71/1.07 .
% 0.71/1.07 clause( 16, [ 'is_a_theorem'( implies( X, implies( Y, Y ) ) ) ] )
% 0.71/1.07 .
% 0.71/1.07 clause( 18, [ 'is_a_theorem'( implies( X, implies( Z, Y ) ) ), ~(
% 0.71/1.07 'is_a_theorem'( implies( X, implies( not( Y ), not( Z ) ) ) ) ) ] )
% 0.71/1.07 .
% 0.71/1.07 clause( 20, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X,
% 0.71/1.07 implies( Y, Y ) ), Z ) ) ) ] )
% 0.71/1.07 .
% 0.71/1.07 clause( 49, [ 'is_a_theorem'( implies( implies( implies( X, X ), Y ), Y ) )
% 0.71/1.07 ] )
% 0.71/1.07 .
% 0.71/1.07 clause( 54, [ 'is_a_theorem'( implies( X, Z ) ), ~( 'is_a_theorem'( implies(
% 0.71/1.07 X, implies( implies( Y, Y ), Z ) ) ) ) ] )
% 0.71/1.07 .
% 0.71/1.07 clause( 122, [ 'is_a_theorem'( implies( not( X ), implies( X, Y ) ) ) ] )
% 0.71/1.07 .
% 0.71/1.07 clause( 123, [ 'is_a_theorem'( implies( not( not( X ) ), implies( Y, X ) )
% 0.71/1.07 ) ] )
% 0.71/1.07 .
% 0.71/1.07 clause( 473, [ 'is_a_theorem'( implies( not( not( X ) ), X ) ) ] )
% 0.71/1.07 .
% 0.71/1.07 clause( 484, [] )
% 0.71/1.07 .
% 0.71/1.07
% 0.71/1.07
% 0.71/1.07 % SZS output end Refutation
% 0.71/1.07 found a proof!
% 0.71/1.07
% 0.71/1.07 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.71/1.07
% 0.71/1.07 initialclauses(
% 0.71/1.07 [ clause( 486, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'(
% 0.71/1.07 X ) ), 'is_a_theorem'( Y ) ] )
% 0.71/1.07 , clause( 487, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.71/1.07 , clause( 488, [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) ),
% 0.71/1.07 implies( implies( X, Y ), implies( X, Z ) ) ) ) ] )
% 0.71/1.07 , clause( 489, [ 'is_a_theorem'( implies( implies( not( X ), not( Y ) ),
% 0.71/1.07 implies( Y, X ) ) ) ] )
% 0.71/1.07 , clause( 490, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'(
% 0.71/1.07 implies( Y, Z ) ) ), 'is_a_theorem'( implies( X, Z ) ) ] )
% 0.71/1.07 , clause( 491, [ ~( 'is_a_theorem'( implies( not( not( a ) ), a ) ) ) ] )
% 0.71/1.07 ] ).
% 0.71/1.07
% 0.71/1.07
% 0.71/1.07
% 0.71/1.07 subsumption(
% 0.71/1.07 clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y ),
% 0.71/1.07 ~( 'is_a_theorem'( X ) ) ] )
% 0.71/1.07 , clause( 486, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'(
% 0.71/1.07 X ) ), 'is_a_theorem'( Y ) ] )
% 0.71/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.07 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.71/1.07
% 0.71/1.07
% 0.71/1.07 subsumption(
% 0.71/1.07 clause( 1, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.71/1.07 , clause( 487, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.71/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.07 )] ) ).
% 0.71/1.07
% 0.71/1.07
% 0.71/1.07 subsumption(
% 0.71/1.07 clause( 2, [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) ),
% 0.71/1.07 implies( implies( X, Y ), implies( X, Z ) ) ) ) ] )
% 0.71/1.07 , clause( 488, [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) ),
% 0.71/1.07 implies( implies( X, Y ), implies( X, Z ) ) ) ) ] )
% 0.71/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.07 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.07
% 0.71/1.07
% 0.71/1.07 subsumption(
% 0.71/1.07 clause( 3, [ 'is_a_theorem'( implies( implies( not( X ), not( Y ) ),
% 0.71/1.07 implies( Y, X ) ) ) ] )
% 0.71/1.07 , clause( 489, [ 'is_a_theorem'( implies( implies( not( X ), not( Y ) ),
% 0.71/1.07 implies( Y, X ) ) ) ] )
% 0.71/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.07 )] ) ).
% 0.71/1.07
% 0.71/1.07
% 0.71/1.07 subsumption(
% 0.71/1.07 clause( 4, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'(
% 0.71/1.07 implies( X, Z ) ), ~( 'is_a_theorem'( implies( Y, Z ) ) ) ] )
% 0.71/1.07 , clause( 490, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'(
% 0.71/1.07 implies( Y, Z ) ) ), 'is_a_theorem'( implies( X, Z ) ) ] )
% 0.71/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.07 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.71/1.07
% 0.71/1.07
% 0.71/1.07 subsumption(
% 0.71/1.07 clause( 5, [ ~( 'is_a_theorem'( implies( not( not( a ) ), a ) ) ) ] )
% 0.71/1.07 , clause( 491, [ ~( 'is_a_theorem'( implies( not( not( a ) ), a ) ) ) ] )
% 0.71/1.07 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.07
% 0.71/1.07
% 0.71/1.07 resolution(
% 0.71/1.07 clause( 495, [ ~( 'is_a_theorem'( implies( implies( X, implies( Y, X ) ), Z
% 0.71/1.07 ) ) ), 'is_a_theorem'( Z ) ] )
% 0.71/1.07 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.71/1.07 , ~( 'is_a_theorem'( X ) ) ] )
% 0.71/1.07 , 2, clause( 1, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.71/1.07 , 0, substitution( 0, [ :=( X, implies( X, implies( Y, X ) ) ), :=( Y, Z )] )
% 0.71/1.07 , substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.71/1.07
% 0.71/1.07
% 0.71/1.07 subsumption(
% 0.71/1.07 clause( 6, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X,
% 0.71/1.07 implies( Y, X ) ), Z ) ) ) ] )
% 0.71/1.07 , clause( 495, [ ~( 'is_a_theorem'( implies( implies( X, implies( Y, X ) )
% 0.71/1.07 , Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.71/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.07 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.71/1.07
% 0.71/1.07
% 0.71/1.07 resolution(
% 0.71/1.07 clause( 496, [ 'is_a_theorem'( implies( implies( X, Y ), implies( X, X ) )
% 0.71/1.07 ) ] )
% 0.71/1.07 , clause( 6, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X
% 0.71/1.07 , implies( Y, X ) ), Z ) ) ) ] )
% 0.71/1.07 , 1, clause( 2, [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) ),
% 0.71/1.07 implies( implies( X, Y ), implies( X, Z ) ) ) ) ] )
% 0.71/1.07 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, implies( implies( X
% 0.71/1.07 , Y ), implies( X, X ) ) )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )
% 0.71/1.07 , :=( Z, X )] )).
% 0.71/1.07
% 0.71/1.07
% 0.71/1.07 subsumption(
% 0.71/1.07 clause( 9, [ 'is_a_theorem'( implies( implies( X, Y ), implies( X, X ) ) )
% 0.71/1.07 ] )
% 0.71/1.07 , clause( 496, [ 'is_a_theorem'( implies( implies( X, Y ), implies( X, X )
% 0.71/1.07 ) ) ] )
% 0.71/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.07 )] ) ).
% 0.71/1.07
% 0.71/1.07
% 0.71/1.07 resolution(
% 0.71/1.07 clause( 497, [ 'is_a_theorem'( implies( X, X ) ) ] )
% 0.71/1.07 , clause( 6, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X
% 0.71/1.07 , implies( Y, X ) ), Z ) ) ) ] )
% 0.71/1.07 , 1, clause( 9, [ 'is_a_theorem'( implies( implies( X, Y ), implies( X, X )
% 0.71/1.07 ) ) ] )
% 0.71/1.07 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, implies( X, X ) )] )
% 0.71/1.07 , substitution( 1, [ :=( X, X ), :=( Y, implies( Y, X ) )] )).
% 0.71/1.07
% 0.71/1.07
% 0.71/1.07 subsumption(
% 0.71/1.07 clause( 11, [ 'is_a_theorem'( implies( X, X ) ) ] )
% 0.71/1.07 , clause( 497, [ 'is_a_theorem'( implies( X, X ) ) ] )
% 0.71/1.07 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.07
% 0.71/1.07
% 0.71/1.07 resolution(
% 0.71/1.07 clause( 499, [ ~( 'is_a_theorem'( implies( implies( X, X ), Y ) ) ),
% 0.71/1.07 'is_a_theorem'( Y ) ] )
% 0.71/1.07 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.71/1.07 , ~( 'is_a_theorem'( X ) ) ] )
% 0.71/1.07 , 2, clause( 11, [ 'is_a_theorem'( implies( X, X ) ) ] )
% 0.71/1.07 , 0, substitution( 0, [ :=( X, implies( X, X ) ), :=( Y, Y )] ),
% 0.71/1.07 substitution( 1, [ :=( X, X )] )).
% 0.71/1.07
% 0.71/1.07
% 0.71/1.07 subsumption(
% 0.71/1.07 clause( 13, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( implies( implies( X,
% 0.71/1.07 X ), Y ) ) ) ] )
% 0.71/1.07 , clause( 499, [ ~( 'is_a_theorem'( implies( implies( X, X ), Y ) ) ),
% 0.71/1.07 'is_a_theorem'( Y ) ] )
% 0.71/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.71/1.07 ), ==>( 1, 0 )] ) ).
% 0.71/1.07
% 0.71/1.07
% 0.71/1.07 resolution(
% 0.71/1.07 clause( 500, [ 'is_a_theorem'( implies( implies( implies( X, Y ), X ),
% 0.71/1.07 implies( implies( X, Y ), Y ) ) ) ] )
% 0.71/1.07 , clause( 13, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( implies( implies( X
% 0.71/1.07 , X ), Y ) ) ) ] )
% 0.71/1.07 , 1, clause( 2, [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) ),
% 0.71/1.07 implies( implies( X, Y ), implies( X, Z ) ) ) ) ] )
% 0.71/1.07 , 0, substitution( 0, [ :=( X, implies( X, Y ) ), :=( Y, implies( implies(
% 0.71/1.07 implies( X, Y ), X ), implies( implies( X, Y ), Y ) ) )] ),
% 0.71/1.07 substitution( 1, [ :=( X, implies( X, Y ) ), :=( Y, X ), :=( Z, Y )] )
% 0.71/1.07 ).
% 0.71/1.07
% 0.71/1.07
% 0.71/1.07 subsumption(
% 0.71/1.07 clause( 15, [ 'is_a_theorem'( implies( implies( implies( X, Y ), X ),
% 0.71/1.07 implies( implies( X, Y ), Y ) ) ) ] )
% 0.71/1.07 , clause( 500, [ 'is_a_theorem'( implies( implies( implies( X, Y ), X ),
% 0.71/1.07 implies( implies( X, Y ), Y ) ) ) ] )
% 0.71/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.07 )] ) ).
% 0.71/1.07
% 0.71/1.07
% 0.71/1.07 resolution(
% 0.71/1.07 clause( 501, [ 'is_a_theorem'( implies( X, implies( Y, Y ) ) ) ] )
% 0.71/1.07 , clause( 13, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( implies( implies( X
% 0.71/1.07 , X ), Y ) ) ) ] )
% 0.71/1.07 , 1, clause( 1, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.71/1.07 , 0, substitution( 0, [ :=( X, Y ), :=( Y, implies( X, implies( Y, Y ) ) )] )
% 0.71/1.07 , substitution( 1, [ :=( X, implies( Y, Y ) ), :=( Y, X )] )).
% 0.71/1.07
% 0.71/1.07
% 0.71/1.07 subsumption(
% 0.71/1.07 clause( 16, [ 'is_a_theorem'( implies( X, implies( Y, Y ) ) ) ] )
% 0.71/1.07 , clause( 501, [ 'is_a_theorem'( implies( X, implies( Y, Y ) ) ) ] )
% 0.71/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.07 )] ) ).
% 0.71/1.07
% 0.71/1.07
% 0.71/1.07 resolution(
% 0.71/1.07 clause( 503, [ ~( 'is_a_theorem'( implies( X, implies( not( Y ), not( Z ) )
% 0.71/1.07 ) ) ), 'is_a_theorem'( implies( X, implies( Z, Y ) ) ) ] )
% 0.71/1.07 , clause( 4, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'(
% 0.71/1.07 implies( X, Z ) ), ~( 'is_a_theorem'( implies( Y, Z ) ) ) ] )
% 0.71/1.07 , 2, clause( 3, [ 'is_a_theorem'( implies( implies( not( X ), not( Y ) ),
% 0.71/1.07 implies( Y, X ) ) ) ] )
% 0.71/1.07 , 0, substitution( 0, [ :=( X, X ), :=( Y, implies( not( Y ), not( Z ) ) )
% 0.71/1.07 , :=( Z, implies( Z, Y ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, Z )] )
% 0.71/1.07 ).
% 0.71/1.07
% 0.71/1.07
% 0.71/1.07 subsumption(
% 0.71/1.07 clause( 18, [ 'is_a_theorem'( implies( X, implies( Z, Y ) ) ), ~(
% 0.71/1.07 'is_a_theorem'( implies( X, implies( not( Y ), not( Z ) ) ) ) ) ] )
% 0.71/1.07 , clause( 503, [ ~( 'is_a_theorem'( implies( X, implies( not( Y ), not( Z )
% 0.71/1.07 ) ) ) ), 'is_a_theorem'( implies( X, implies( Z, Y ) ) ) ] )
% 0.71/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.07 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.71/1.07
% 0.71/1.07
% 0.71/1.07 resolution(
% 0.71/1.07 clause( 505, [ ~( 'is_a_theorem'( implies( implies( X, implies( Y, Y ) ), Z
% 0.71/1.07 ) ) ), 'is_a_theorem'( Z ) ] )
% 0.71/1.07 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.71/1.07 , ~( 'is_a_theorem'( X ) ) ] )
% 0.71/1.07 , 2, clause( 16, [ 'is_a_theorem'( implies( X, implies( Y, Y ) ) ) ] )
% 0.71/1.07 , 0, substitution( 0, [ :=( X, implies( X, implies( Y, Y ) ) ), :=( Y, Z )] )
% 0.71/1.07 , substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.71/1.07
% 0.71/1.07
% 0.71/1.07 subsumption(
% 0.71/1.07 clause( 20, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X,
% 0.71/1.07 implies( Y, Y ) ), Z ) ) ) ] )
% 0.71/1.07 , clause( 505, [ ~( 'is_a_theorem'( implies( implies( X, implies( Y, Y ) )
% 0.71/1.07 , Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.71/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.07 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.71/1.07
% 0.71/1.07
% 0.71/1.07 resolution(
% 0.71/1.07 clause( 506, [ 'is_a_theorem'( implies( implies( implies( X, X ), Y ), Y )
% 0.71/1.07 ) ] )
% 0.71/1.07 , clause( 20, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X
% 0.71/1.07 , implies( Y, Y ) ), Z ) ) ) ] )
% 0.71/1.07 , 1, clause( 15, [ 'is_a_theorem'( implies( implies( implies( X, Y ), X ),
% 0.71/1.07 implies( implies( X, Y ), Y ) ) ) ] )
% 0.71/1.07 , 0, substitution( 0, [ :=( X, implies( implies( X, X ), Y ) ), :=( Y, X )
% 0.71/1.07 , :=( Z, implies( implies( implies( X, X ), Y ), Y ) )] ), substitution(
% 0.71/1.07 1, [ :=( X, implies( X, X ) ), :=( Y, Y )] )).
% 0.71/1.07
% 0.71/1.07
% 0.71/1.07 subsumption(
% 0.71/1.07 clause( 49, [ 'is_a_theorem'( implies( implies( implies( X, X ), Y ), Y ) )
% 0.71/1.07 ] )
% 0.71/1.07 , clause( 506, [ 'is_a_theorem'( implies( implies( implies( X, X ), Y ), Y
% 0.71/1.07 ) ) ] )
% 0.71/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.07 )] ) ).
% 0.71/1.07
% 0.71/1.07
% 0.71/1.07 resolution(
% 0.71/1.07 clause( 508, [ ~( 'is_a_theorem'( implies( X, implies( implies( Y, Y ), Z )
% 0.71/1.07 ) ) ), 'is_a_theorem'( implies( X, Z ) ) ] )
% 0.71/1.07 , clause( 4, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'(
% 0.71/1.07 implies( X, Z ) ), ~( 'is_a_theorem'( implies( Y, Z ) ) ) ] )
% 0.71/1.07 , 2, clause( 49, [ 'is_a_theorem'( implies( implies( implies( X, X ), Y ),
% 0.71/1.07 Y ) ) ] )
% 0.71/1.07 , 0, substitution( 0, [ :=( X, X ), :=( Y, implies( implies( Y, Y ), Z ) )
% 0.71/1.07 , :=( Z, Z )] ), substitution( 1, [ :=( X, Y ), :=( Y, Z )] )).
% 0.71/1.07
% 0.71/1.07
% 0.71/1.07 subsumption(
% 0.71/1.07 clause( 54, [ 'is_a_theorem'( implies( X, Z ) ), ~( 'is_a_theorem'( implies(
% 0.71/1.07 X, implies( implies( Y, Y ), Z ) ) ) ) ] )
% 0.71/1.07 , clause( 508, [ ~( 'is_a_theorem'( implies( X, implies( implies( Y, Y ), Z
% 0.71/1.07 ) ) ) ), 'is_a_theorem'( implies( X, Z ) ) ] )
% 0.71/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.07 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.71/1.07
% 0.71/1.07
% 0.71/1.07 resolution(
% 0.71/1.07 clause( 509, [ 'is_a_theorem'( implies( not( X ), implies( X, Y ) ) ) ] )
% 0.71/1.07 , clause( 18, [ 'is_a_theorem'( implies( X, implies( Z, Y ) ) ), ~(
% 0.71/1.07 'is_a_theorem'( implies( X, implies( not( Y ), not( Z ) ) ) ) ) ] )
% 0.71/1.07 , 1, clause( 1, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.71/1.07 , 0, substitution( 0, [ :=( X, not( X ) ), :=( Y, Y ), :=( Z, X )] ),
% 0.71/1.07 substitution( 1, [ :=( X, not( X ) ), :=( Y, not( Y ) )] )).
% 0.71/1.07
% 0.71/1.07
% 0.71/1.07 subsumption(
% 0.71/1.07 clause( 122, [ 'is_a_theorem'( implies( not( X ), implies( X, Y ) ) ) ] )
% 0.71/1.07 , clause( 509, [ 'is_a_theorem'( implies( not( X ), implies( X, Y ) ) ) ]
% 0.71/1.07 )
% 0.71/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.07 )] ) ).
% 0.71/1.07
% 0.71/1.07
% 0.71/1.07 resolution(
% 0.71/1.07 clause( 510, [ 'is_a_theorem'( implies( not( not( X ) ), implies( Y, X ) )
% 0.71/1.07 ) ] )
% 0.71/1.07 , clause( 18, [ 'is_a_theorem'( implies( X, implies( Z, Y ) ) ), ~(
% 0.71/1.07 'is_a_theorem'( implies( X, implies( not( Y ), not( Z ) ) ) ) ) ] )
% 0.71/1.07 , 1, clause( 122, [ 'is_a_theorem'( implies( not( X ), implies( X, Y ) ) )
% 0.71/1.07 ] )
% 0.71/1.07 , 0, substitution( 0, [ :=( X, not( not( X ) ) ), :=( Y, X ), :=( Z, Y )] )
% 0.71/1.07 , substitution( 1, [ :=( X, not( X ) ), :=( Y, not( Y ) )] )).
% 0.71/1.07
% 0.71/1.07
% 0.71/1.07 subsumption(
% 0.71/1.07 clause( 123, [ 'is_a_theorem'( implies( not( not( X ) ), implies( Y, X ) )
% 0.71/1.07 ) ] )
% 0.71/1.07 , clause( 510, [ 'is_a_theorem'( implies( not( not( X ) ), implies( Y, X )
% 0.71/1.07 ) ) ] )
% 0.71/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.07 )] ) ).
% 0.71/1.07
% 0.71/1.07
% 0.71/1.07 resolution(
% 0.71/1.07 clause( 511, [ 'is_a_theorem'( implies( not( not( X ) ), X ) ) ] )
% 0.71/1.07 , clause( 54, [ 'is_a_theorem'( implies( X, Z ) ), ~( 'is_a_theorem'(
% 0.71/1.07 implies( X, implies( implies( Y, Y ), Z ) ) ) ) ] )
% 0.71/1.07 , 1, clause( 123, [ 'is_a_theorem'( implies( not( not( X ) ), implies( Y, X
% 0.71/1.07 ) ) ) ] )
% 0.71/1.07 , 0, substitution( 0, [ :=( X, not( not( X ) ) ), :=( Y, Y ), :=( Z, X )] )
% 0.71/1.07 , substitution( 1, [ :=( X, X ), :=( Y, implies( Y, Y ) )] )).
% 0.71/1.07
% 0.71/1.07
% 0.71/1.07 subsumption(
% 0.71/1.07 clause( 473, [ 'is_a_theorem'( implies( not( not( X ) ), X ) ) ] )
% 0.71/1.07 , clause( 511, [ 'is_a_theorem'( implies( not( not( X ) ), X ) ) ] )
% 0.71/1.07 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.07
% 0.71/1.07
% 0.71/1.07 resolution(
% 0.71/1.07 clause( 512, [] )
% 0.71/1.07 , clause( 5, [ ~( 'is_a_theorem'( implies( not( not( a ) ), a ) ) ) ] )
% 0.71/1.07 , 0, clause( 473, [ 'is_a_theorem'( implies( not( not( X ) ), X ) ) ] )
% 0.71/1.07 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, a )] )).
% 0.71/1.07
% 0.71/1.07
% 0.71/1.07 subsumption(
% 0.71/1.07 clause( 484, [] )
% 0.71/1.07 , clause( 512, [] )
% 0.71/1.07 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.71/1.07
% 0.71/1.07
% 0.71/1.07 end.
% 0.71/1.07
% 0.71/1.07 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.71/1.07
% 0.71/1.07 Memory use:
% 0.71/1.07
% 0.71/1.07 space for terms: 7404
% 0.71/1.07 space for clauses: 38273
% 0.71/1.07
% 0.71/1.07
% 0.71/1.07 clauses generated: 1298
% 0.71/1.07 clauses kept: 485
% 0.71/1.07 clauses selected: 110
% 0.71/1.07 clauses deleted: 2
% 0.71/1.07 clauses inuse deleted: 0
% 0.71/1.07
% 0.71/1.07 subsentry: 1293
% 0.71/1.07 literals s-matched: 1004
% 0.71/1.07 literals matched: 1004
% 0.71/1.07 full subsumption: 4
% 0.71/1.07
% 0.71/1.07 checksum: 2029047574
% 0.71/1.07
% 0.71/1.07
% 0.71/1.07 Bliksem ended
%------------------------------------------------------------------------------