TSTP Solution File: LCL033-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL033-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:27 EDT 2022
% Result : Unsatisfiable 0.67s 1.07s
% Output : Refutation 0.67s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL033-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/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 10:53:45 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.67/1.07 *** allocated 10000 integers for termspace/termends
% 0.67/1.07 *** allocated 10000 integers for clauses
% 0.67/1.07 *** allocated 10000 integers for justifications
% 0.67/1.07 Bliksem 1.12
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 Automatic Strategy Selection
% 0.67/1.07
% 0.67/1.07 Clauses:
% 0.67/1.07 [
% 0.67/1.07 [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'( X ) ),
% 0.67/1.07 'is_a_theorem'( Y ) ],
% 0.67/1.07 [ 'is_a_theorem'( implies( implies( implies( implies( implies( X, Y ),
% 0.67/1.07 implies( Z, falsehood ) ), T ), U ), implies( implies( U, X ), implies( Z
% 0.67/1.07 , X ) ) ) ) ],
% 0.67/1.07 [ ~( 'is_a_theorem'( implies( a, implies( b, a ) ) ) ) ]
% 0.67/1.07 ] .
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 percentage equality = 0.000000, percentage horn = 1.000000
% 0.67/1.07 This is a near-Horn, non-equality problem
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 Options Used:
% 0.67/1.07
% 0.67/1.07 useres = 1
% 0.67/1.07 useparamod = 0
% 0.67/1.07 useeqrefl = 0
% 0.67/1.07 useeqfact = 0
% 0.67/1.07 usefactor = 1
% 0.67/1.07 usesimpsplitting = 0
% 0.67/1.07 usesimpdemod = 0
% 0.67/1.07 usesimpres = 4
% 0.67/1.07
% 0.67/1.07 resimpinuse = 1000
% 0.67/1.07 resimpclauses = 20000
% 0.67/1.07 substype = standard
% 0.67/1.07 backwardsubs = 1
% 0.67/1.07 selectoldest = 5
% 0.67/1.07
% 0.67/1.07 litorderings [0] = split
% 0.67/1.07 litorderings [1] = liftord
% 0.67/1.07
% 0.67/1.07 termordering = none
% 0.67/1.07
% 0.67/1.07 litapriori = 1
% 0.67/1.07 termapriori = 0
% 0.67/1.07 litaposteriori = 0
% 0.67/1.07 termaposteriori = 0
% 0.67/1.07 demodaposteriori = 0
% 0.67/1.07 ordereqreflfact = 0
% 0.67/1.07
% 0.67/1.07 litselect = negative
% 0.67/1.07
% 0.67/1.07 maxweight = 30000
% 0.67/1.07 maxdepth = 30000
% 0.67/1.07 maxlength = 115
% 0.67/1.07 maxnrvars = 195
% 0.67/1.07 excuselevel = 0
% 0.67/1.07 increasemaxweight = 0
% 0.67/1.07
% 0.67/1.07 maxselected = 10000000
% 0.67/1.07 maxnrclauses = 10000000
% 0.67/1.07
% 0.67/1.07 showgenerated = 0
% 0.67/1.07 showkept = 0
% 0.67/1.07 showselected = 0
% 0.67/1.07 showdeleted = 0
% 0.67/1.07 showresimp = 1
% 0.67/1.07 showstatus = 2000
% 0.67/1.07
% 0.67/1.07 prologoutput = 1
% 0.67/1.07 nrgoals = 5000000
% 0.67/1.07 totalproof = 1
% 0.67/1.07
% 0.67/1.07 Symbols occurring in the translation:
% 0.67/1.07
% 0.67/1.07 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.67/1.07 . [1, 2] (w:1, o:23, a:1, s:1, b:0),
% 0.67/1.07 ! [4, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.67/1.07 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.67/1.07 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.67/1.07 implies [41, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.67/1.07 'is_a_theorem' [42, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.67/1.07 falsehood [44, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.67/1.07 a [47, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.67/1.07 b [48, 0] (w:1, o:16, a:1, s:1, b:0).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 Starting Search:
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 Bliksems!, er is een bewijs:
% 0.67/1.07 % SZS status Unsatisfiable
% 0.67/1.07 % SZS output start Refutation
% 0.67/1.07
% 0.67/1.07 clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y ),
% 0.67/1.07 ~( 'is_a_theorem'( X ) ) ] )
% 0.67/1.07 .
% 0.67/1.07 clause( 1, [ 'is_a_theorem'( implies( implies( implies( implies( implies( X
% 0.67/1.07 , Y ), implies( Z, falsehood ) ), T ), U ), implies( implies( U, X ),
% 0.67/1.07 implies( Z, X ) ) ) ) ] )
% 0.67/1.07 .
% 0.67/1.07 clause( 2, [ ~( 'is_a_theorem'( implies( a, implies( b, a ) ) ) ) ] )
% 0.67/1.07 .
% 0.67/1.07 clause( 3, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( implies( implies(
% 0.67/1.07 implies( implies( implies( implies( X, Y ), implies( Z, falsehood ) ), T
% 0.67/1.07 ), U ), implies( implies( U, X ), implies( Z, X ) ) ), W ) ) ) ] )
% 0.67/1.07 .
% 0.67/1.07 clause( 4, [ 'is_a_theorem'( implies( implies( implies( implies( X, Y ),
% 0.67/1.07 implies( Z, Y ) ), implies( Y, T ) ), implies( U, implies( Y, T ) ) ) ) ]
% 0.67/1.07 )
% 0.67/1.07 .
% 0.67/1.07 clause( 5, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( implies( implies(
% 0.67/1.07 implies( implies( implies( X, Y ), implies( Z, Y ) ), implies( Y, T ) ),
% 0.67/1.07 implies( U, implies( Y, T ) ) ), W ) ) ) ] )
% 0.67/1.07 .
% 0.67/1.07 clause( 7, [ 'is_a_theorem'( implies( implies( implies( X, implies(
% 0.67/1.07 falsehood, Y ) ), Z ), implies( T, Z ) ) ) ] )
% 0.67/1.07 .
% 0.67/1.07 clause( 8, [ 'is_a_theorem'( implies( X, implies( Y, implies( falsehood, Z
% 0.67/1.07 ) ) ) ) ] )
% 0.67/1.07 .
% 0.67/1.07 clause( 11, [ 'is_a_theorem'( implies( X, implies( falsehood, Y ) ) ) ] )
% 0.67/1.07 .
% 0.67/1.07 clause( 14, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X,
% 0.67/1.07 implies( falsehood, Y ) ), Z ) ) ) ] )
% 0.67/1.07 .
% 0.67/1.07 clause( 21, [ 'is_a_theorem'( implies( implies( implies( falsehood, X ), Y
% 0.67/1.07 ), implies( Z, Y ) ) ) ] )
% 0.67/1.07 .
% 0.67/1.07 clause( 22, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 0.67/1.07 implies( implies( falsehood, X ), Y ), implies( Z, Y ) ), T ) ) ) ] )
% 0.67/1.07 .
% 0.67/1.07 clause( 26, [ 'is_a_theorem'( implies( X, implies( Y, implies( Z, Y ) ) ) )
% 0.67/1.07 ] )
% 0.67/1.07 .
% 0.67/1.07 clause( 27, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.67/1.07 .
% 0.67/1.07 clause( 34, [] )
% 0.67/1.07 .
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 % SZS output end Refutation
% 0.67/1.07 found a proof!
% 0.67/1.07
% 0.67/1.07 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.67/1.07
% 0.67/1.07 initialclauses(
% 0.67/1.07 [ clause( 36, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'(
% 0.67/1.07 X ) ), 'is_a_theorem'( Y ) ] )
% 0.67/1.07 , clause( 37, [ 'is_a_theorem'( implies( implies( implies( implies( implies(
% 0.67/1.07 X, Y ), implies( Z, falsehood ) ), T ), U ), implies( implies( U, X ),
% 0.67/1.07 implies( Z, X ) ) ) ) ] )
% 0.67/1.07 , clause( 38, [ ~( 'is_a_theorem'( implies( a, implies( b, a ) ) ) ) ] )
% 0.67/1.07 ] ).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 subsumption(
% 0.67/1.07 clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y ),
% 0.67/1.07 ~( 'is_a_theorem'( X ) ) ] )
% 0.67/1.07 , clause( 36, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'(
% 0.67/1.07 X ) ), 'is_a_theorem'( Y ) ] )
% 0.67/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.67/1.07 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 subsumption(
% 0.67/1.07 clause( 1, [ 'is_a_theorem'( implies( implies( implies( implies( implies( X
% 0.67/1.07 , Y ), implies( Z, falsehood ) ), T ), U ), implies( implies( U, X ),
% 0.67/1.07 implies( Z, X ) ) ) ) ] )
% 0.67/1.07 , clause( 37, [ 'is_a_theorem'( implies( implies( implies( implies( implies(
% 0.67/1.07 X, Y ), implies( Z, falsehood ) ), T ), U ), implies( implies( U, X ),
% 0.67/1.07 implies( Z, X ) ) ) ) ] )
% 0.67/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.67/1.07 , U )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 subsumption(
% 0.67/1.07 clause( 2, [ ~( 'is_a_theorem'( implies( a, implies( b, a ) ) ) ) ] )
% 0.67/1.07 , clause( 38, [ ~( 'is_a_theorem'( implies( a, implies( b, a ) ) ) ) ] )
% 0.67/1.07 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 resolution(
% 0.67/1.07 clause( 40, [ ~( 'is_a_theorem'( implies( implies( implies( implies(
% 0.67/1.07 implies( implies( X, Y ), implies( Z, falsehood ) ), T ), U ), implies(
% 0.67/1.07 implies( U, X ), implies( Z, X ) ) ), W ) ) ), 'is_a_theorem'( W ) ] )
% 0.67/1.07 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.67/1.07 , ~( 'is_a_theorem'( X ) ) ] )
% 0.67/1.07 , 2, clause( 1, [ 'is_a_theorem'( implies( implies( implies( implies(
% 0.67/1.07 implies( X, Y ), implies( Z, falsehood ) ), T ), U ), implies( implies( U
% 0.67/1.07 , X ), implies( Z, X ) ) ) ) ] )
% 0.67/1.07 , 0, substitution( 0, [ :=( X, implies( implies( implies( implies( implies(
% 0.67/1.07 X, Y ), implies( Z, falsehood ) ), T ), U ), implies( implies( U, X ),
% 0.67/1.07 implies( Z, X ) ) ) ), :=( Y, W )] ), substitution( 1, [ :=( X, X ), :=(
% 0.67/1.07 Y, Y ), :=( Z, Z ), :=( T, T ), :=( U, U )] )).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 subsumption(
% 0.67/1.07 clause( 3, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( implies( implies(
% 0.67/1.07 implies( implies( implies( implies( X, Y ), implies( Z, falsehood ) ), T
% 0.67/1.07 ), U ), implies( implies( U, X ), implies( Z, X ) ) ), W ) ) ) ] )
% 0.67/1.07 , clause( 40, [ ~( 'is_a_theorem'( implies( implies( implies( implies(
% 0.67/1.07 implies( implies( X, Y ), implies( Z, falsehood ) ), T ), U ), implies(
% 0.67/1.07 implies( U, X ), implies( Z, X ) ) ), W ) ) ), 'is_a_theorem'( W ) ] )
% 0.67/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.67/1.07 , U ), :=( W, W )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 resolution(
% 0.67/1.07 clause( 41, [ 'is_a_theorem'( implies( implies( implies( implies( X, Y ),
% 0.67/1.07 implies( Z, Y ) ), implies( Y, T ) ), implies( U, implies( Y, T ) ) ) ) ]
% 0.67/1.07 )
% 0.67/1.07 , clause( 3, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( implies( implies(
% 0.67/1.07 implies( implies( implies( implies( X, Y ), implies( Z, falsehood ) ), T
% 0.67/1.07 ), U ), implies( implies( U, X ), implies( Z, X ) ) ), W ) ) ) ] )
% 0.67/1.07 , 1, clause( 1, [ 'is_a_theorem'( implies( implies( implies( implies(
% 0.67/1.07 implies( X, Y ), implies( Z, falsehood ) ), T ), U ), implies( implies( U
% 0.67/1.07 , X ), implies( Z, X ) ) ) ) ] )
% 0.67/1.07 , 0, substitution( 0, [ :=( X, Y ), :=( Y, T ), :=( Z, Z ), :=( T, implies(
% 0.67/1.07 U, falsehood ) ), :=( U, X ), :=( W, implies( implies( implies( implies(
% 0.67/1.07 X, Y ), implies( Z, Y ) ), implies( Y, T ) ), implies( U, implies( Y, T )
% 0.67/1.07 ) ) )] ), substitution( 1, [ :=( X, implies( Y, T ) ), :=( Y, implies( Z
% 0.67/1.07 , falsehood ) ), :=( Z, U ), :=( T, X ), :=( U, implies( implies( X, Y )
% 0.67/1.07 , implies( Z, Y ) ) )] )).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 subsumption(
% 0.67/1.07 clause( 4, [ 'is_a_theorem'( implies( implies( implies( implies( X, Y ),
% 0.67/1.07 implies( Z, Y ) ), implies( Y, T ) ), implies( U, implies( Y, T ) ) ) ) ]
% 0.67/1.07 )
% 0.67/1.07 , clause( 41, [ 'is_a_theorem'( implies( implies( implies( implies( X, Y )
% 0.67/1.07 , implies( Z, Y ) ), implies( Y, T ) ), implies( U, implies( Y, T ) ) ) )
% 0.67/1.07 ] )
% 0.67/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.67/1.07 , U )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 resolution(
% 0.67/1.07 clause( 43, [ ~( 'is_a_theorem'( implies( implies( implies( implies(
% 0.67/1.07 implies( X, Y ), implies( Z, Y ) ), implies( Y, T ) ), implies( U,
% 0.67/1.07 implies( Y, T ) ) ), W ) ) ), 'is_a_theorem'( W ) ] )
% 0.67/1.07 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.67/1.07 , ~( 'is_a_theorem'( X ) ) ] )
% 0.67/1.07 , 2, clause( 4, [ 'is_a_theorem'( implies( implies( implies( implies( X, Y
% 0.67/1.07 ), implies( Z, Y ) ), implies( Y, T ) ), implies( U, implies( Y, T ) ) )
% 0.67/1.07 ) ] )
% 0.67/1.07 , 0, substitution( 0, [ :=( X, implies( implies( implies( implies( X, Y ),
% 0.67/1.07 implies( Z, Y ) ), implies( Y, T ) ), implies( U, implies( Y, T ) ) ) ),
% 0.67/1.07 :=( Y, W )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ),
% 0.67/1.07 :=( T, T ), :=( U, U )] )).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 subsumption(
% 0.67/1.07 clause( 5, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( implies( implies(
% 0.67/1.07 implies( implies( implies( X, Y ), implies( Z, Y ) ), implies( Y, T ) ),
% 0.67/1.07 implies( U, implies( Y, T ) ) ), W ) ) ) ] )
% 0.67/1.07 , clause( 43, [ ~( 'is_a_theorem'( implies( implies( implies( implies(
% 0.67/1.07 implies( X, Y ), implies( Z, Y ) ), implies( Y, T ) ), implies( U,
% 0.67/1.07 implies( Y, T ) ) ), W ) ) ), 'is_a_theorem'( W ) ] )
% 0.67/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.67/1.07 , U ), :=( W, W )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 resolution(
% 0.67/1.07 clause( 44, [ 'is_a_theorem'( implies( implies( implies( X, implies(
% 0.67/1.07 falsehood, Y ) ), Z ), implies( T, Z ) ) ) ] )
% 0.67/1.07 , clause( 5, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( implies( implies(
% 0.67/1.07 implies( implies( implies( X, Y ), implies( Z, Y ) ), implies( Y, T ) ),
% 0.67/1.07 implies( U, implies( Y, T ) ) ), W ) ) ) ] )
% 0.67/1.07 , 1, clause( 1, [ 'is_a_theorem'( implies( implies( implies( implies(
% 0.67/1.07 implies( X, Y ), implies( Z, falsehood ) ), T ), U ), implies( implies( U
% 0.67/1.07 , X ), implies( Z, X ) ) ) ) ] )
% 0.67/1.07 , 0, substitution( 0, [ :=( X, Z ), :=( Y, falsehood ), :=( Z, T ), :=( T,
% 0.67/1.07 Y ), :=( U, X ), :=( W, implies( implies( implies( X, implies( falsehood
% 0.67/1.07 , Y ) ), Z ), implies( T, Z ) ) )] ), substitution( 1, [ :=( X, Z ), :=(
% 0.67/1.07 Y, falsehood ), :=( Z, T ), :=( T, implies( falsehood, Y ) ), :=( U,
% 0.67/1.07 implies( X, implies( falsehood, Y ) ) )] )).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 subsumption(
% 0.67/1.07 clause( 7, [ 'is_a_theorem'( implies( implies( implies( X, implies(
% 0.67/1.07 falsehood, Y ) ), Z ), implies( T, Z ) ) ) ] )
% 0.67/1.07 , clause( 44, [ 'is_a_theorem'( implies( implies( implies( X, implies(
% 0.67/1.07 falsehood, Y ) ), Z ), implies( T, Z ) ) ) ] )
% 0.67/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.67/1.07 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 resolution(
% 0.67/1.07 clause( 45, [ 'is_a_theorem'( implies( X, implies( Y, implies( falsehood, Z
% 0.67/1.07 ) ) ) ) ] )
% 0.67/1.07 , clause( 5, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( implies( implies(
% 0.67/1.07 implies( implies( implies( X, Y ), implies( Z, Y ) ), implies( Y, T ) ),
% 0.67/1.07 implies( U, implies( Y, T ) ) ), W ) ) ) ] )
% 0.67/1.07 , 1, clause( 7, [ 'is_a_theorem'( implies( implies( implies( X, implies(
% 0.67/1.07 falsehood, Y ) ), Z ), implies( T, Z ) ) ) ] )
% 0.67/1.07 , 0, substitution( 0, [ :=( X, T ), :=( Y, falsehood ), :=( Z, U ), :=( T,
% 0.67/1.07 Z ), :=( U, Y ), :=( W, implies( X, implies( Y, implies( falsehood, Z ) )
% 0.67/1.07 ) )] ), substitution( 1, [ :=( X, implies( implies( T, falsehood ),
% 0.67/1.07 implies( U, falsehood ) ) ), :=( Y, Z ), :=( Z, implies( Y, implies(
% 0.67/1.07 falsehood, Z ) ) ), :=( T, X )] )).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 subsumption(
% 0.67/1.07 clause( 8, [ 'is_a_theorem'( implies( X, implies( Y, implies( falsehood, Z
% 0.67/1.07 ) ) ) ) ] )
% 0.67/1.07 , clause( 45, [ 'is_a_theorem'( implies( X, implies( Y, implies( falsehood
% 0.67/1.07 , Z ) ) ) ) ] )
% 0.67/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.67/1.07 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 resolution(
% 0.67/1.07 clause( 46, [ 'is_a_theorem'( implies( X, implies( falsehood, Y ) ) ) ] )
% 0.67/1.07 , clause( 5, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( implies( implies(
% 0.67/1.07 implies( implies( implies( X, Y ), implies( Z, Y ) ), implies( Y, T ) ),
% 0.67/1.07 implies( U, implies( Y, T ) ) ), W ) ) ) ] )
% 0.67/1.07 , 1, clause( 8, [ 'is_a_theorem'( implies( X, implies( Y, implies(
% 0.67/1.07 falsehood, Z ) ) ) ) ] )
% 0.67/1.07 , 0, substitution( 0, [ :=( X, Z ), :=( Y, T ), :=( Z, U ), :=( T, W ),
% 0.67/1.07 :=( U, V0 ), :=( W, implies( X, implies( falsehood, Y ) ) )] ),
% 0.67/1.07 substitution( 1, [ :=( X, implies( implies( implies( implies( Z, T ),
% 0.67/1.07 implies( U, T ) ), implies( T, W ) ), implies( V0, implies( T, W ) ) ) )
% 0.67/1.07 , :=( Y, X ), :=( Z, Y )] )).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 subsumption(
% 0.67/1.07 clause( 11, [ 'is_a_theorem'( implies( X, implies( falsehood, Y ) ) ) ] )
% 0.67/1.07 , clause( 46, [ 'is_a_theorem'( implies( X, implies( falsehood, Y ) ) ) ]
% 0.67/1.07 )
% 0.67/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.67/1.07 )] ) ).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 resolution(
% 0.67/1.07 clause( 48, [ ~( 'is_a_theorem'( implies( implies( X, implies( falsehood, Y
% 0.67/1.07 ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.67/1.07 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.67/1.07 , ~( 'is_a_theorem'( X ) ) ] )
% 0.67/1.07 , 2, clause( 11, [ 'is_a_theorem'( implies( X, implies( falsehood, Y ) ) )
% 0.67/1.07 ] )
% 0.67/1.07 , 0, substitution( 0, [ :=( X, implies( X, implies( falsehood, Y ) ) ),
% 0.67/1.07 :=( Y, Z )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 subsumption(
% 0.67/1.07 clause( 14, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X,
% 0.67/1.07 implies( falsehood, Y ) ), Z ) ) ) ] )
% 0.67/1.07 , clause( 48, [ ~( 'is_a_theorem'( implies( implies( X, implies( falsehood
% 0.67/1.07 , Y ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.67/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.67/1.07 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 resolution(
% 0.67/1.07 clause( 49, [ 'is_a_theorem'( implies( implies( implies( falsehood, X ), Y
% 0.67/1.07 ), implies( Z, Y ) ) ) ] )
% 0.67/1.07 , clause( 14, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X
% 0.67/1.07 , implies( falsehood, Y ) ), Z ) ) ) ] )
% 0.67/1.07 , 1, clause( 1, [ 'is_a_theorem'( implies( implies( implies( implies(
% 0.67/1.07 implies( X, Y ), implies( Z, falsehood ) ), T ), U ), implies( implies( U
% 0.67/1.07 , X ), implies( Z, X ) ) ) ) ] )
% 0.67/1.07 , 0, substitution( 0, [ :=( X, implies( implies( implies( Y, T ), implies(
% 0.67/1.07 Z, falsehood ) ), U ) ), :=( Y, X ), :=( Z, implies( implies( implies(
% 0.67/1.07 falsehood, X ), Y ), implies( Z, Y ) ) )] ), substitution( 1, [ :=( X, Y
% 0.67/1.07 ), :=( Y, T ), :=( Z, Z ), :=( T, U ), :=( U, implies( falsehood, X ) )] )
% 0.67/1.07 ).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 subsumption(
% 0.67/1.07 clause( 21, [ 'is_a_theorem'( implies( implies( implies( falsehood, X ), Y
% 0.67/1.07 ), implies( Z, Y ) ) ) ] )
% 0.67/1.07 , clause( 49, [ 'is_a_theorem'( implies( implies( implies( falsehood, X ),
% 0.67/1.07 Y ), implies( Z, Y ) ) ) ] )
% 0.67/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.67/1.07 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 resolution(
% 0.67/1.07 clause( 51, [ ~( 'is_a_theorem'( implies( implies( implies( implies(
% 0.67/1.07 falsehood, X ), Y ), implies( Z, Y ) ), T ) ) ), 'is_a_theorem'( T ) ] )
% 0.67/1.07 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.67/1.07 , ~( 'is_a_theorem'( X ) ) ] )
% 0.67/1.07 , 2, clause( 21, [ 'is_a_theorem'( implies( implies( implies( falsehood, X
% 0.67/1.07 ), Y ), implies( Z, Y ) ) ) ] )
% 0.67/1.07 , 0, substitution( 0, [ :=( X, implies( implies( implies( falsehood, X ), Y
% 0.67/1.07 ), implies( Z, Y ) ) ), :=( Y, T )] ), substitution( 1, [ :=( X, X ),
% 0.67/1.07 :=( Y, Y ), :=( Z, Z )] )).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 subsumption(
% 0.67/1.07 clause( 22, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 0.67/1.07 implies( implies( falsehood, X ), Y ), implies( Z, Y ) ), T ) ) ) ] )
% 0.67/1.07 , clause( 51, [ ~( 'is_a_theorem'( implies( implies( implies( implies(
% 0.67/1.07 falsehood, X ), Y ), implies( Z, Y ) ), T ) ) ), 'is_a_theorem'( T ) ] )
% 0.67/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.67/1.07 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 resolution(
% 0.67/1.07 clause( 52, [ 'is_a_theorem'( implies( X, implies( Y, implies( Z, Y ) ) ) )
% 0.67/1.07 ] )
% 0.67/1.07 , clause( 22, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 0.67/1.07 implies( implies( falsehood, X ), Y ), implies( Z, Y ) ), T ) ) ) ] )
% 0.67/1.07 , 1, clause( 4, [ 'is_a_theorem'( implies( implies( implies( implies( X, Y
% 0.67/1.07 ), implies( Z, Y ) ), implies( Y, T ) ), implies( U, implies( Y, T ) ) )
% 0.67/1.07 ) ] )
% 0.67/1.07 , 0, substitution( 0, [ :=( X, Y ), :=( Y, implies( Z, Y ) ), :=( Z, Y ),
% 0.67/1.07 :=( T, implies( X, implies( Y, implies( Z, Y ) ) ) )] ), substitution( 1
% 0.67/1.07 , [ :=( X, falsehood ), :=( Y, Y ), :=( Z, Z ), :=( T, implies( Z, Y ) )
% 0.67/1.07 , :=( U, X )] )).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 subsumption(
% 0.67/1.07 clause( 26, [ 'is_a_theorem'( implies( X, implies( Y, implies( Z, Y ) ) ) )
% 0.67/1.07 ] )
% 0.67/1.07 , clause( 52, [ 'is_a_theorem'( implies( X, implies( Y, implies( Z, Y ) ) )
% 0.67/1.07 ) ] )
% 0.67/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.67/1.07 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 resolution(
% 0.67/1.07 clause( 53, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.67/1.07 , clause( 22, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 0.67/1.07 implies( implies( falsehood, X ), Y ), implies( Z, Y ) ), T ) ) ) ] )
% 0.67/1.07 , 1, clause( 26, [ 'is_a_theorem'( implies( X, implies( Y, implies( Z, Y )
% 0.67/1.07 ) ) ) ] )
% 0.67/1.07 , 0, substitution( 0, [ :=( X, Z ), :=( Y, T ), :=( Z, U ), :=( T, implies(
% 0.67/1.07 X, implies( Y, X ) ) )] ), substitution( 1, [ :=( X, implies( implies(
% 0.67/1.07 implies( falsehood, Z ), T ), implies( U, T ) ) ), :=( Y, X ), :=( Z, Y )] )
% 0.67/1.07 ).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 subsumption(
% 0.67/1.07 clause( 27, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.67/1.07 , clause( 53, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.67/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.67/1.07 )] ) ).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 resolution(
% 0.67/1.07 clause( 54, [] )
% 0.67/1.07 , clause( 2, [ ~( 'is_a_theorem'( implies( a, implies( b, a ) ) ) ) ] )
% 0.67/1.07 , 0, clause( 27, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.67/1.07 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, a ), :=( Y, b )] )
% 0.67/1.07 ).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 subsumption(
% 0.67/1.07 clause( 34, [] )
% 0.67/1.07 , clause( 54, [] )
% 0.67/1.07 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 end.
% 0.67/1.07
% 0.67/1.07 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.67/1.07
% 0.67/1.07 Memory use:
% 0.67/1.07
% 0.67/1.07 space for terms: 577
% 0.67/1.07 space for clauses: 3697
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 clauses generated: 90
% 0.67/1.07 clauses kept: 35
% 0.67/1.07 clauses selected: 22
% 0.67/1.07 clauses deleted: 0
% 0.67/1.07 clauses inuse deleted: 0
% 0.67/1.07
% 0.67/1.07 subsentry: 79
% 0.67/1.07 literals s-matched: 55
% 0.67/1.07 literals matched: 55
% 0.67/1.07 full subsumption: 0
% 0.67/1.07
% 0.67/1.07 checksum: -1897581064
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 Bliksem ended
%------------------------------------------------------------------------------