TSTP Solution File: LCL112-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL112-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:50:30 EDT 2022
% Result : Unsatisfiable 0.71s 1.09s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL112-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13 % 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 : Sat Jul 2 17:16:44 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.71/1.09 *** allocated 10000 integers for termspace/termends
% 0.71/1.09 *** allocated 10000 integers for clauses
% 0.71/1.09 *** allocated 10000 integers for justifications
% 0.71/1.09 Bliksem 1.12
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 Automatic Strategy Selection
% 0.71/1.09
% 0.71/1.09 Clauses:
% 0.71/1.09 [
% 0.71/1.09 [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'( X ) ),
% 0.71/1.09 'is_a_theorem'( Y ) ],
% 0.71/1.09 [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ],
% 0.71/1.09 [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies( Y, Z ),
% 0.71/1.09 implies( X, Z ) ) ) ) ],
% 0.71/1.09 [ 'is_a_theorem'( implies( implies( implies( X, Y ), Y ), implies(
% 0.71/1.09 implies( Y, X ), X ) ) ) ],
% 0.71/1.09 [ 'is_a_theorem'( implies( implies( not( X ), not( Y ) ), implies( Y, X
% 0.71/1.09 ) ) ) ],
% 0.71/1.09 [ ~( 'is_a_theorem'( implies( a, not( not( a ) ) ) ) ) ]
% 0.71/1.09 ] .
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 percentage equality = 0.000000, percentage horn = 1.000000
% 0.71/1.09 This is a near-Horn, non-equality problem
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 Options Used:
% 0.71/1.09
% 0.71/1.09 useres = 1
% 0.71/1.09 useparamod = 0
% 0.71/1.09 useeqrefl = 0
% 0.71/1.09 useeqfact = 0
% 0.71/1.09 usefactor = 1
% 0.71/1.09 usesimpsplitting = 0
% 0.71/1.09 usesimpdemod = 0
% 0.71/1.09 usesimpres = 4
% 0.71/1.09
% 0.71/1.09 resimpinuse = 1000
% 0.71/1.09 resimpclauses = 20000
% 0.71/1.09 substype = standard
% 0.71/1.09 backwardsubs = 1
% 0.71/1.09 selectoldest = 5
% 0.71/1.09
% 0.71/1.09 litorderings [0] = split
% 0.71/1.09 litorderings [1] = liftord
% 0.71/1.09
% 0.71/1.09 termordering = none
% 0.71/1.09
% 0.71/1.09 litapriori = 1
% 0.71/1.09 termapriori = 0
% 0.71/1.09 litaposteriori = 0
% 0.71/1.09 termaposteriori = 0
% 0.71/1.09 demodaposteriori = 0
% 0.71/1.09 ordereqreflfact = 0
% 0.71/1.09
% 0.71/1.09 litselect = negative
% 0.71/1.09
% 0.71/1.09 maxweight = 30000
% 0.71/1.09 maxdepth = 30000
% 0.71/1.09 maxlength = 115
% 0.71/1.09 maxnrvars = 195
% 0.71/1.09 excuselevel = 0
% 0.71/1.09 increasemaxweight = 0
% 0.71/1.09
% 0.71/1.09 maxselected = 10000000
% 0.71/1.09 maxnrclauses = 10000000
% 0.71/1.09
% 0.71/1.09 showgenerated = 0
% 0.71/1.09 showkept = 0
% 0.71/1.09 showselected = 0
% 0.71/1.09 showdeleted = 0
% 0.71/1.09 showresimp = 1
% 0.71/1.09 showstatus = 2000
% 0.71/1.09
% 0.71/1.09 prologoutput = 1
% 0.71/1.09 nrgoals = 5000000
% 0.71/1.09 totalproof = 1
% 0.71/1.09
% 0.71/1.09 Symbols occurring in the translation:
% 0.71/1.09
% 0.71/1.09 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.71/1.09 . [1, 2] (w:1, o:20, a:1, s:1, b:0),
% 0.71/1.09 ! [4, 1] (w:1, o:13, a:1, s:1, b:0),
% 0.71/1.09 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.09 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.09 implies [41, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.71/1.09 'is_a_theorem' [42, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.71/1.09 not [44, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.71/1.09 a [45, 0] (w:1, o:12, a:1, s:1, b:0).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 Starting Search:
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 Bliksems!, er is een bewijs:
% 0.71/1.09 % SZS status Unsatisfiable
% 0.71/1.09 % SZS output start Refutation
% 0.71/1.09
% 0.71/1.09 clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y ),
% 0.71/1.09 ~( 'is_a_theorem'( X ) ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 1, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 2, [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies( Y
% 0.71/1.09 , Z ), implies( X, Z ) ) ) ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 3, [ 'is_a_theorem'( implies( implies( implies( X, Y ), Y ),
% 0.71/1.09 implies( implies( Y, X ), X ) ) ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 4, [ 'is_a_theorem'( implies( implies( not( X ), not( Y ) ),
% 0.71/1.09 implies( Y, X ) ) ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 5, [ ~( 'is_a_theorem'( implies( a, not( not( a ) ) ) ) ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 6, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X,
% 0.71/1.09 implies( Y, X ) ), Z ) ) ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 7, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies(
% 0.71/1.09 implies( not( X ), not( Y ) ), implies( Y, X ) ), Z ) ) ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 8, [ 'is_a_theorem'( implies( X, implies( Y, implies( Z, Y ) ) ) )
% 0.71/1.09 ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 9, [ 'is_a_theorem'( implies( implies( implies( X, Y ), Z ),
% 0.71/1.09 implies( Y, Z ) ) ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 11, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies( X,
% 0.71/1.09 implies( Y, implies( Z, Y ) ) ), T ) ) ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 30, [ 'is_a_theorem'( implies( not( X ), implies( X, Y ) ) ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 33, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( not(
% 0.71/1.09 X ), implies( X, Y ) ), Z ) ) ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 36, [ 'is_a_theorem'( implies( implies( implies( X, Y ), Z ),
% 0.71/1.09 implies( not( X ), Z ) ) ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 39, [ 'is_a_theorem'( implies( not( not( X ) ), implies( Y, X ) ) )
% 0.71/1.09 ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 49, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( not(
% 0.71/1.09 not( X ) ), implies( Y, X ) ), Z ) ) ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 60, [ 'is_a_theorem'( implies( implies( implies( X, implies( Y, X )
% 0.71/1.09 ), Z ), Z ) ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 61, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 0.71/1.09 implies( implies( X, implies( Y, X ) ), Z ), Z ), T ) ) ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 419, [ 'is_a_theorem'( implies( implies( implies( X, Y ), Z ),
% 0.71/1.09 implies( not( not( Y ) ), Z ) ) ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 686, [ 'is_a_theorem'( implies( not( not( X ) ), X ) ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 708, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( implies( implies(
% 0.71/1.09 not( not( X ) ), X ), Y ) ) ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 738, [ 'is_a_theorem'( implies( X, not( not( X ) ) ) ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 766, [] )
% 0.71/1.09 .
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 % SZS output end Refutation
% 0.71/1.09 found a proof!
% 0.71/1.09
% 0.71/1.09 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.71/1.09
% 0.71/1.09 initialclauses(
% 0.71/1.09 [ clause( 768, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'(
% 0.71/1.09 X ) ), 'is_a_theorem'( Y ) ] )
% 0.71/1.09 , clause( 769, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.71/1.09 , clause( 770, [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies(
% 0.71/1.09 Y, Z ), implies( X, Z ) ) ) ) ] )
% 0.71/1.09 , clause( 771, [ 'is_a_theorem'( implies( implies( implies( X, Y ), Y ),
% 0.71/1.09 implies( implies( Y, X ), X ) ) ) ] )
% 0.71/1.09 , clause( 772, [ 'is_a_theorem'( implies( implies( not( X ), not( Y ) ),
% 0.71/1.09 implies( Y, X ) ) ) ] )
% 0.71/1.09 , clause( 773, [ ~( 'is_a_theorem'( implies( a, not( not( a ) ) ) ) ) ] )
% 0.71/1.09 ] ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y ),
% 0.71/1.09 ~( 'is_a_theorem'( X ) ) ] )
% 0.71/1.09 , clause( 768, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'(
% 0.71/1.09 X ) ), 'is_a_theorem'( Y ) ] )
% 0.71/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.09 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 1, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.71/1.09 , clause( 769, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.71/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.09 )] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 2, [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies( Y
% 0.71/1.09 , Z ), implies( X, Z ) ) ) ) ] )
% 0.71/1.09 , clause( 770, [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies(
% 0.71/1.09 Y, Z ), implies( X, Z ) ) ) ) ] )
% 0.71/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.09 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 3, [ 'is_a_theorem'( implies( implies( implies( X, Y ), Y ),
% 0.71/1.09 implies( implies( Y, X ), X ) ) ) ] )
% 0.71/1.09 , clause( 771, [ 'is_a_theorem'( implies( implies( implies( X, Y ), Y ),
% 0.71/1.09 implies( implies( Y, X ), X ) ) ) ] )
% 0.71/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.09 )] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 4, [ 'is_a_theorem'( implies( implies( not( X ), not( Y ) ),
% 0.71/1.09 implies( Y, X ) ) ) ] )
% 0.71/1.09 , clause( 772, [ 'is_a_theorem'( implies( implies( not( X ), not( Y ) ),
% 0.71/1.09 implies( Y, X ) ) ) ] )
% 0.71/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.09 )] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 5, [ ~( 'is_a_theorem'( implies( a, not( not( a ) ) ) ) ) ] )
% 0.71/1.09 , clause( 773, [ ~( 'is_a_theorem'( implies( a, not( not( a ) ) ) ) ) ] )
% 0.71/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 resolution(
% 0.71/1.09 clause( 775, [ ~( 'is_a_theorem'( implies( implies( X, implies( Y, X ) ), Z
% 0.71/1.09 ) ) ), 'is_a_theorem'( Z ) ] )
% 0.71/1.09 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.71/1.09 , ~( 'is_a_theorem'( X ) ) ] )
% 0.71/1.09 , 2, clause( 1, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.71/1.09 , 0, substitution( 0, [ :=( X, implies( X, implies( Y, X ) ) ), :=( Y, Z )] )
% 0.71/1.09 , substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 6, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X,
% 0.71/1.09 implies( Y, X ) ), Z ) ) ) ] )
% 0.71/1.09 , clause( 775, [ ~( 'is_a_theorem'( implies( implies( X, implies( Y, X ) )
% 0.71/1.09 , Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.71/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.09 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 resolution(
% 0.71/1.09 clause( 777, [ ~( 'is_a_theorem'( implies( implies( implies( not( X ), not(
% 0.71/1.09 Y ) ), implies( Y, X ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.71/1.09 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.71/1.09 , ~( 'is_a_theorem'( X ) ) ] )
% 0.71/1.09 , 2, clause( 4, [ 'is_a_theorem'( implies( implies( not( X ), not( Y ) ),
% 0.71/1.09 implies( Y, X ) ) ) ] )
% 0.71/1.09 , 0, substitution( 0, [ :=( X, implies( implies( not( X ), not( Y ) ),
% 0.71/1.09 implies( Y, X ) ) ), :=( Y, Z )] ), substitution( 1, [ :=( X, X ), :=( Y
% 0.71/1.09 , Y )] )).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 7, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies(
% 0.71/1.09 implies( not( X ), not( Y ) ), implies( Y, X ) ), Z ) ) ) ] )
% 0.71/1.09 , clause( 777, [ ~( 'is_a_theorem'( implies( implies( implies( not( X ),
% 0.71/1.09 not( Y ) ), implies( Y, X ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.71/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.09 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 resolution(
% 0.71/1.09 clause( 778, [ 'is_a_theorem'( implies( X, implies( Y, implies( Z, Y ) ) )
% 0.71/1.09 ) ] )
% 0.71/1.09 , clause( 6, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X
% 0.71/1.09 , implies( Y, X ) ), Z ) ) ) ] )
% 0.71/1.09 , 1, clause( 1, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.71/1.09 , 0, substitution( 0, [ :=( X, Y ), :=( Y, Z ), :=( Z, implies( X, implies(
% 0.71/1.09 Y, implies( Z, Y ) ) ) )] ), substitution( 1, [ :=( X, implies( Y,
% 0.71/1.09 implies( Z, Y ) ) ), :=( Y, X )] )).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 8, [ 'is_a_theorem'( implies( X, implies( Y, implies( Z, Y ) ) ) )
% 0.71/1.09 ] )
% 0.71/1.09 , clause( 778, [ 'is_a_theorem'( implies( X, implies( Y, implies( Z, Y ) )
% 0.71/1.09 ) ) ] )
% 0.71/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.09 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 resolution(
% 0.71/1.09 clause( 779, [ 'is_a_theorem'( implies( implies( implies( X, Y ), Z ),
% 0.71/1.09 implies( Y, Z ) ) ) ] )
% 0.71/1.09 , clause( 6, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X
% 0.71/1.09 , implies( Y, X ) ), Z ) ) ) ] )
% 0.71/1.09 , 1, clause( 2, [ 'is_a_theorem'( implies( implies( X, Y ), implies(
% 0.71/1.09 implies( Y, Z ), implies( X, Z ) ) ) ) ] )
% 0.71/1.09 , 0, substitution( 0, [ :=( X, Y ), :=( Y, X ), :=( Z, implies( implies(
% 0.71/1.09 implies( X, Y ), Z ), implies( Y, Z ) ) )] ), substitution( 1, [ :=( X, Y
% 0.71/1.09 ), :=( Y, implies( X, Y ) ), :=( Z, Z )] )).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 9, [ 'is_a_theorem'( implies( implies( implies( X, Y ), Z ),
% 0.71/1.09 implies( Y, Z ) ) ) ] )
% 0.71/1.09 , clause( 779, [ 'is_a_theorem'( implies( implies( implies( X, Y ), Z ),
% 0.71/1.09 implies( Y, Z ) ) ) ] )
% 0.71/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.09 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 resolution(
% 0.71/1.09 clause( 781, [ ~( 'is_a_theorem'( implies( implies( X, implies( Y, implies(
% 0.71/1.09 Z, Y ) ) ), T ) ) ), 'is_a_theorem'( T ) ] )
% 0.71/1.09 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.71/1.09 , ~( 'is_a_theorem'( X ) ) ] )
% 0.71/1.09 , 2, clause( 8, [ 'is_a_theorem'( implies( X, implies( Y, implies( Z, Y ) )
% 0.71/1.09 ) ) ] )
% 0.71/1.09 , 0, substitution( 0, [ :=( X, implies( X, implies( Y, implies( Z, Y ) ) )
% 0.71/1.09 ), :=( Y, T )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )
% 0.71/1.09 ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 11, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies( X,
% 0.71/1.09 implies( Y, implies( Z, Y ) ) ), T ) ) ) ] )
% 0.71/1.09 , clause( 781, [ ~( 'is_a_theorem'( implies( implies( X, implies( Y,
% 0.71/1.09 implies( Z, Y ) ) ), T ) ) ), 'is_a_theorem'( T ) ] )
% 0.71/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.71/1.09 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 resolution(
% 0.71/1.09 clause( 782, [ 'is_a_theorem'( implies( not( X ), implies( X, Y ) ) ) ] )
% 0.71/1.09 , clause( 7, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies(
% 0.71/1.09 implies( not( X ), not( Y ) ), implies( Y, X ) ), Z ) ) ) ] )
% 0.71/1.09 , 1, clause( 9, [ 'is_a_theorem'( implies( implies( implies( X, Y ), Z ),
% 0.71/1.09 implies( Y, Z ) ) ) ] )
% 0.71/1.09 , 0, substitution( 0, [ :=( X, Y ), :=( Y, X ), :=( Z, implies( not( X ),
% 0.71/1.09 implies( X, Y ) ) )] ), substitution( 1, [ :=( X, not( Y ) ), :=( Y, not(
% 0.71/1.09 X ) ), :=( Z, implies( X, Y ) )] )).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 30, [ 'is_a_theorem'( implies( not( X ), implies( X, Y ) ) ) ] )
% 0.71/1.09 , clause( 782, [ 'is_a_theorem'( implies( not( X ), implies( X, Y ) ) ) ]
% 0.71/1.09 )
% 0.71/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.09 )] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 resolution(
% 0.71/1.09 clause( 784, [ ~( 'is_a_theorem'( implies( implies( not( X ), implies( X, Y
% 0.71/1.09 ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.71/1.09 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.71/1.09 , ~( 'is_a_theorem'( X ) ) ] )
% 0.71/1.09 , 2, clause( 30, [ 'is_a_theorem'( implies( not( X ), implies( X, Y ) ) ) ]
% 0.71/1.09 )
% 0.71/1.09 , 0, substitution( 0, [ :=( X, implies( not( X ), implies( X, Y ) ) ), :=(
% 0.71/1.09 Y, Z )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 33, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( not(
% 0.71/1.09 X ), implies( X, Y ) ), Z ) ) ) ] )
% 0.71/1.09 , clause( 784, [ ~( 'is_a_theorem'( implies( implies( not( X ), implies( X
% 0.71/1.09 , Y ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.71/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.09 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 resolution(
% 0.71/1.09 clause( 785, [ 'is_a_theorem'( implies( implies( implies( X, Y ), Z ),
% 0.71/1.09 implies( not( X ), Z ) ) ) ] )
% 0.71/1.09 , clause( 33, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies(
% 0.71/1.09 not( X ), implies( X, Y ) ), Z ) ) ) ] )
% 0.71/1.09 , 1, clause( 2, [ 'is_a_theorem'( implies( implies( X, Y ), implies(
% 0.71/1.09 implies( Y, Z ), implies( X, Z ) ) ) ) ] )
% 0.71/1.09 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, implies( implies(
% 0.71/1.09 implies( X, Y ), Z ), implies( not( X ), Z ) ) )] ), substitution( 1, [
% 0.71/1.09 :=( X, not( X ) ), :=( Y, implies( X, Y ) ), :=( Z, Z )] )).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 subsumption(
% 0.71/1.10 clause( 36, [ 'is_a_theorem'( implies( implies( implies( X, Y ), Z ),
% 0.71/1.10 implies( not( X ), Z ) ) ) ] )
% 0.71/1.10 , clause( 785, [ 'is_a_theorem'( implies( implies( implies( X, Y ), Z ),
% 0.71/1.10 implies( not( X ), Z ) ) ) ] )
% 0.71/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.10 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 resolution(
% 0.71/1.10 clause( 786, [ 'is_a_theorem'( implies( not( not( X ) ), implies( Y, X ) )
% 0.71/1.10 ) ] )
% 0.71/1.10 , clause( 7, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies(
% 0.71/1.10 implies( not( X ), not( Y ) ), implies( Y, X ) ), Z ) ) ) ] )
% 0.71/1.10 , 1, clause( 36, [ 'is_a_theorem'( implies( implies( implies( X, Y ), Z ),
% 0.71/1.10 implies( not( X ), Z ) ) ) ] )
% 0.71/1.10 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, implies( not( not( X
% 0.71/1.10 ) ), implies( Y, X ) ) )] ), substitution( 1, [ :=( X, not( X ) ), :=( Y
% 0.71/1.10 , not( Y ) ), :=( Z, implies( Y, X ) )] )).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 subsumption(
% 0.71/1.10 clause( 39, [ 'is_a_theorem'( implies( not( not( X ) ), implies( Y, X ) ) )
% 0.71/1.10 ] )
% 0.71/1.10 , clause( 786, [ 'is_a_theorem'( implies( not( not( X ) ), implies( Y, X )
% 0.71/1.10 ) ) ] )
% 0.71/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.10 )] ) ).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 resolution(
% 0.71/1.10 clause( 788, [ ~( 'is_a_theorem'( implies( implies( not( not( X ) ),
% 0.71/1.10 implies( Y, X ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.71/1.10 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.71/1.10 , ~( 'is_a_theorem'( X ) ) ] )
% 0.71/1.10 , 2, clause( 39, [ 'is_a_theorem'( implies( not( not( X ) ), implies( Y, X
% 0.71/1.10 ) ) ) ] )
% 0.71/1.10 , 0, substitution( 0, [ :=( X, implies( not( not( X ) ), implies( Y, X ) )
% 0.71/1.10 ), :=( Y, Z )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 subsumption(
% 0.71/1.10 clause( 49, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( not(
% 0.71/1.10 not( X ) ), implies( Y, X ) ), Z ) ) ) ] )
% 0.71/1.10 , clause( 788, [ ~( 'is_a_theorem'( implies( implies( not( not( X ) ),
% 0.71/1.10 implies( Y, X ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.71/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.10 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 resolution(
% 0.71/1.10 clause( 789, [ 'is_a_theorem'( implies( implies( implies( X, implies( Y, X
% 0.71/1.10 ) ), Z ), Z ) ) ] )
% 0.71/1.10 , clause( 11, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies( X
% 0.71/1.10 , implies( Y, implies( Z, Y ) ) ), T ) ) ) ] )
% 0.71/1.10 , 1, clause( 3, [ 'is_a_theorem'( implies( implies( implies( X, Y ), Y ),
% 0.71/1.10 implies( implies( Y, X ), X ) ) ) ] )
% 0.71/1.10 , 0, substitution( 0, [ :=( X, implies( Z, implies( X, implies( Y, X ) ) )
% 0.71/1.10 ), :=( Y, X ), :=( Z, Y ), :=( T, implies( implies( implies( X, implies(
% 0.71/1.10 Y, X ) ), Z ), Z ) )] ), substitution( 1, [ :=( X, Z ), :=( Y, implies( X
% 0.71/1.10 , implies( Y, X ) ) )] )).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 subsumption(
% 0.71/1.10 clause( 60, [ 'is_a_theorem'( implies( implies( implies( X, implies( Y, X )
% 0.71/1.10 ), Z ), Z ) ) ] )
% 0.71/1.10 , clause( 789, [ 'is_a_theorem'( implies( implies( implies( X, implies( Y,
% 0.71/1.10 X ) ), Z ), Z ) ) ] )
% 0.71/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.10 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 resolution(
% 0.71/1.10 clause( 791, [ ~( 'is_a_theorem'( implies( implies( implies( implies( X,
% 0.71/1.10 implies( Y, X ) ), Z ), Z ), T ) ) ), 'is_a_theorem'( T ) ] )
% 0.71/1.10 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.71/1.10 , ~( 'is_a_theorem'( X ) ) ] )
% 0.71/1.10 , 2, clause( 60, [ 'is_a_theorem'( implies( implies( implies( X, implies( Y
% 0.71/1.10 , X ) ), Z ), Z ) ) ] )
% 0.71/1.10 , 0, substitution( 0, [ :=( X, implies( implies( implies( X, implies( Y, X
% 0.71/1.10 ) ), Z ), Z ) ), :=( Y, T )] ), substitution( 1, [ :=( X, X ), :=( Y, Y
% 0.71/1.10 ), :=( Z, Z )] )).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 subsumption(
% 0.71/1.10 clause( 61, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 0.71/1.10 implies( implies( X, implies( Y, X ) ), Z ), Z ), T ) ) ) ] )
% 0.71/1.10 , clause( 791, [ ~( 'is_a_theorem'( implies( implies( implies( implies( X,
% 0.71/1.10 implies( Y, X ) ), Z ), Z ), T ) ) ), 'is_a_theorem'( T ) ] )
% 0.71/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.71/1.10 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 resolution(
% 0.71/1.10 clause( 792, [ 'is_a_theorem'( implies( implies( implies( X, Y ), Z ),
% 0.71/1.10 implies( not( not( Y ) ), Z ) ) ) ] )
% 0.71/1.10 , clause( 49, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies(
% 0.71/1.10 not( not( X ) ), implies( Y, X ) ), Z ) ) ) ] )
% 0.71/1.10 , 1, clause( 2, [ 'is_a_theorem'( implies( implies( X, Y ), implies(
% 0.71/1.10 implies( Y, Z ), implies( X, Z ) ) ) ) ] )
% 0.71/1.10 , 0, substitution( 0, [ :=( X, Y ), :=( Y, X ), :=( Z, implies( implies(
% 0.71/1.10 implies( X, Y ), Z ), implies( not( not( Y ) ), Z ) ) )] ),
% 0.71/1.10 substitution( 1, [ :=( X, not( not( Y ) ) ), :=( Y, implies( X, Y ) ),
% 0.71/1.10 :=( Z, Z )] )).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 subsumption(
% 0.71/1.10 clause( 419, [ 'is_a_theorem'( implies( implies( implies( X, Y ), Z ),
% 0.71/1.10 implies( not( not( Y ) ), Z ) ) ) ] )
% 0.71/1.10 , clause( 792, [ 'is_a_theorem'( implies( implies( implies( X, Y ), Z ),
% 0.71/1.10 implies( not( not( Y ) ), Z ) ) ) ] )
% 0.71/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.10 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 resolution(
% 0.71/1.10 clause( 793, [ 'is_a_theorem'( implies( not( not( X ) ), X ) ) ] )
% 0.71/1.10 , clause( 61, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 0.71/1.10 implies( implies( X, implies( Y, X ) ), Z ), Z ), T ) ) ) ] )
% 0.71/1.10 , 1, clause( 419, [ 'is_a_theorem'( implies( implies( implies( X, Y ), Z )
% 0.71/1.10 , implies( not( not( Y ) ), Z ) ) ) ] )
% 0.71/1.10 , 0, substitution( 0, [ :=( X, Y ), :=( Y, Z ), :=( Z, X ), :=( T, implies(
% 0.71/1.10 not( not( X ) ), X ) )] ), substitution( 1, [ :=( X, implies( Y, implies(
% 0.71/1.10 Z, Y ) ) ), :=( Y, X ), :=( Z, X )] )).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 subsumption(
% 0.71/1.10 clause( 686, [ 'is_a_theorem'( implies( not( not( X ) ), X ) ) ] )
% 0.71/1.10 , clause( 793, [ 'is_a_theorem'( implies( not( not( X ) ), X ) ) ] )
% 0.71/1.10 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 resolution(
% 0.71/1.10 clause( 795, [ ~( 'is_a_theorem'( implies( implies( not( not( X ) ), X ), Y
% 0.71/1.10 ) ) ), 'is_a_theorem'( Y ) ] )
% 0.71/1.10 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.71/1.10 , ~( 'is_a_theorem'( X ) ) ] )
% 0.71/1.10 , 2, clause( 686, [ 'is_a_theorem'( implies( not( not( X ) ), X ) ) ] )
% 0.71/1.10 , 0, substitution( 0, [ :=( X, implies( not( not( X ) ), X ) ), :=( Y, Y )] )
% 0.71/1.10 , substitution( 1, [ :=( X, X )] )).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 subsumption(
% 0.71/1.10 clause( 708, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( implies( implies(
% 0.71/1.10 not( not( X ) ), X ), Y ) ) ) ] )
% 0.71/1.10 , clause( 795, [ ~( 'is_a_theorem'( implies( implies( not( not( X ) ), X )
% 0.71/1.10 , Y ) ) ), 'is_a_theorem'( Y ) ] )
% 0.71/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.71/1.10 ), ==>( 1, 0 )] ) ).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 resolution(
% 0.71/1.10 clause( 796, [ 'is_a_theorem'( implies( X, not( not( X ) ) ) ) ] )
% 0.71/1.10 , clause( 708, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( implies( implies(
% 0.71/1.10 not( not( X ) ), X ), Y ) ) ) ] )
% 0.71/1.10 , 1, clause( 4, [ 'is_a_theorem'( implies( implies( not( X ), not( Y ) ),
% 0.71/1.10 implies( Y, X ) ) ) ] )
% 0.71/1.10 , 0, substitution( 0, [ :=( X, not( X ) ), :=( Y, implies( X, not( not( X )
% 0.71/1.10 ) ) )] ), substitution( 1, [ :=( X, not( not( X ) ) ), :=( Y, X )] )
% 0.71/1.10 ).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 subsumption(
% 0.71/1.10 clause( 738, [ 'is_a_theorem'( implies( X, not( not( X ) ) ) ) ] )
% 0.71/1.10 , clause( 796, [ 'is_a_theorem'( implies( X, not( not( X ) ) ) ) ] )
% 0.71/1.10 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 resolution(
% 0.71/1.10 clause( 797, [] )
% 0.71/1.10 , clause( 5, [ ~( 'is_a_theorem'( implies( a, not( not( a ) ) ) ) ) ] )
% 0.71/1.10 , 0, clause( 738, [ 'is_a_theorem'( implies( X, not( not( X ) ) ) ) ] )
% 0.71/1.10 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, a )] )).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 subsumption(
% 0.71/1.10 clause( 766, [] )
% 0.71/1.10 , clause( 797, [] )
% 0.71/1.10 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 end.
% 0.71/1.10
% 0.71/1.10 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.71/1.10
% 0.71/1.10 Memory use:
% 0.71/1.10
% 0.71/1.10 space for terms: 11324
% 0.71/1.10 space for clauses: 62190
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 clauses generated: 2265
% 0.71/1.10 clauses kept: 767
% 0.71/1.10 clauses selected: 163
% 0.71/1.10 clauses deleted: 2
% 0.71/1.10 clauses inuse deleted: 0
% 0.71/1.10
% 0.71/1.10 subsentry: 1668
% 0.71/1.10 literals s-matched: 1500
% 0.71/1.10 literals matched: 1500
% 0.71/1.10 full subsumption: 0
% 0.71/1.10
% 0.71/1.10 checksum: 177527686
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Bliksem ended
%------------------------------------------------------------------------------