TSTP Solution File: LCL097-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL097-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n021.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:16 EDT 2022
% Result : Unsatisfiable 0.89s 1.33s
% Output : Refutation 0.89s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : LCL097-1 : TPTP v8.1.0. Released v1.0.0.
% 0.08/0.15 % Command : bliksem %s
% 0.16/0.37 % Computer : n021.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % DateTime : Mon Jul 4 06:15:46 EDT 2022
% 0.16/0.37 % CPUTime :
% 0.89/1.33 *** allocated 10000 integers for termspace/termends
% 0.89/1.33 *** allocated 10000 integers for clauses
% 0.89/1.33 *** allocated 10000 integers for justifications
% 0.89/1.33 Bliksem 1.12
% 0.89/1.33
% 0.89/1.33
% 0.89/1.33 Automatic Strategy Selection
% 0.89/1.33
% 0.89/1.33 Clauses:
% 0.89/1.33 [
% 0.89/1.33 [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), ~( 'is_a_theorem'( X ) ),
% 0.89/1.33 'is_a_theorem'( Y ) ],
% 0.89/1.33 [ 'is_a_theorem'( equivalent( equivalent( equivalent( equivalent(
% 0.89/1.33 equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z ) ), T ), T )
% 0.89/1.33 ) ],
% 0.89/1.33 [ 'is_a_theorem'( equivalent( equivalent( equivalent( equivalent(
% 0.89/1.33 equivalent( equivalent( X, Y ), equivalent( X, Z ) ), T ), equivalent(
% 0.89/1.33 equivalent( Y, Z ), T ) ), U ), U ) ) ],
% 0.89/1.33 [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( equivalent( a,
% 0.89/1.33 b ), c ), e ), equivalent( equivalent( equivalent( a, falsehood ), c ),
% 0.89/1.33 equivalent( equivalent( b, falsehood ), e ) ) ) ) ) ]
% 0.89/1.33 ] .
% 0.89/1.33
% 0.89/1.33
% 0.89/1.33 percentage equality = 0.000000, percentage horn = 1.000000
% 0.89/1.33 This is a near-Horn, non-equality problem
% 0.89/1.33
% 0.89/1.33
% 0.89/1.33 Options Used:
% 0.89/1.33
% 0.89/1.33 useres = 1
% 0.89/1.33 useparamod = 0
% 0.89/1.33 useeqrefl = 0
% 0.89/1.33 useeqfact = 0
% 0.89/1.33 usefactor = 1
% 0.89/1.33 usesimpsplitting = 0
% 0.89/1.33 usesimpdemod = 0
% 0.89/1.33 usesimpres = 4
% 0.89/1.33
% 0.89/1.33 resimpinuse = 1000
% 0.89/1.33 resimpclauses = 20000
% 0.89/1.33 substype = standard
% 0.89/1.33 backwardsubs = 1
% 0.89/1.33 selectoldest = 5
% 0.89/1.33
% 0.89/1.33 litorderings [0] = split
% 0.89/1.33 litorderings [1] = liftord
% 0.89/1.33
% 0.89/1.33 termordering = none
% 0.89/1.33
% 0.89/1.33 litapriori = 1
% 0.89/1.33 termapriori = 0
% 0.89/1.33 litaposteriori = 0
% 0.89/1.33 termaposteriori = 0
% 0.89/1.33 demodaposteriori = 0
% 0.89/1.33 ordereqreflfact = 0
% 0.89/1.33
% 0.89/1.33 litselect = negative
% 0.89/1.33
% 0.89/1.33 maxweight = 30000
% 0.89/1.33 maxdepth = 30000
% 0.89/1.33 maxlength = 115
% 0.89/1.33 maxnrvars = 195
% 0.89/1.33 excuselevel = 0
% 0.89/1.33 increasemaxweight = 0
% 0.89/1.33
% 0.89/1.33 maxselected = 10000000
% 0.89/1.33 maxnrclauses = 10000000
% 0.89/1.33
% 0.89/1.33 showgenerated = 0
% 0.89/1.33 showkept = 0
% 0.89/1.33 showselected = 0
% 0.89/1.33 showdeleted = 0
% 0.89/1.33 showresimp = 1
% 0.89/1.33 showstatus = 2000
% 0.89/1.33
% 0.89/1.33 prologoutput = 1
% 0.89/1.33 nrgoals = 5000000
% 0.89/1.33 totalproof = 1
% 0.89/1.33
% 0.89/1.33 Symbols occurring in the translation:
% 0.89/1.33
% 0.89/1.33 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.89/1.33 . [1, 2] (w:1, o:25, a:1, s:1, b:0),
% 0.89/1.33 ! [4, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.89/1.33 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.89/1.33 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.89/1.33 equivalent [41, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.89/1.33 'is_a_theorem' [42, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.89/1.33 a [46, 0] (w:1, o:14, a:1, s:1, b:0),
% 0.89/1.33 b [47, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.89/1.33 c [48, 0] (w:1, o:16, a:1, s:1, b:0),
% 0.89/1.33 e [49, 0] (w:1, o:17, a:1, s:1, b:0),
% 0.89/1.33 falsehood [50, 0] (w:1, o:18, a:1, s:1, b:0).
% 0.89/1.33
% 0.89/1.33
% 0.89/1.33 Starting Search:
% 0.89/1.33
% 0.89/1.33 Resimplifying inuse:
% 0.89/1.33 Done
% 0.89/1.33
% 0.89/1.33
% 0.89/1.33 Intermediate Status:
% 0.89/1.33 Generated: 5696
% 0.89/1.33 Kept: 2054
% 0.89/1.33 Inuse: 282
% 0.89/1.33 Deleted: 2
% 0.89/1.33 Deletedinuse: 2
% 0.89/1.33
% 0.89/1.33 Resimplifying inuse:
% 0.89/1.33 Done
% 0.89/1.33
% 0.89/1.33 Resimplifying inuse:
% 0.89/1.33 Done
% 0.89/1.33
% 0.89/1.33
% 0.89/1.33 Intermediate Status:
% 0.89/1.33 Generated: 10119
% 0.89/1.33 Kept: 4056
% 0.89/1.33 Inuse: 387
% 0.89/1.33 Deleted: 2
% 0.89/1.33 Deletedinuse: 2
% 0.89/1.33
% 0.89/1.33 Resimplifying inuse:
% 0.89/1.33 Done
% 0.89/1.33
% 0.89/1.33 Resimplifying inuse:
% 0.89/1.33 Done
% 0.89/1.33
% 0.89/1.33
% 0.89/1.33 Intermediate Status:
% 0.89/1.33 Generated: 15323
% 0.89/1.33 Kept: 6077
% 0.89/1.33 Inuse: 468
% 0.89/1.33 Deleted: 2
% 0.89/1.33 Deletedinuse: 2
% 0.89/1.33
% 0.89/1.33 Resimplifying inuse:
% 0.89/1.33 Done
% 0.89/1.33
% 0.89/1.33 Resimplifying inuse:
% 0.89/1.33 Done
% 0.89/1.33
% 0.89/1.33
% 0.89/1.33 Intermediate Status:
% 0.89/1.33 Generated: 19173
% 0.89/1.33 Kept: 8085
% 0.89/1.33 Inuse: 532
% 0.89/1.33 Deleted: 2
% 0.89/1.33 Deletedinuse: 2
% 0.89/1.33
% 0.89/1.33 Resimplifying inuse:
% 0.89/1.33 Done
% 0.89/1.33
% 0.89/1.33
% 0.89/1.33 Bliksems!, er is een bewijs:
% 0.89/1.33 % SZS status Unsatisfiable
% 0.89/1.33 % SZS output start Refutation
% 0.89/1.33
% 0.89/1.33 clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.89/1.33 , ~( 'is_a_theorem'( X ) ) ] )
% 0.89/1.33 .
% 0.89/1.33 clause( 1, [ 'is_a_theorem'( equivalent( equivalent( equivalent( equivalent(
% 0.89/1.33 equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z ) ), T ), T )
% 0.89/1.33 ) ] )
% 0.89/1.33 .
% 0.89/1.33 clause( 2, [ 'is_a_theorem'( equivalent( equivalent( equivalent( equivalent(
% 0.89/1.33 equivalent( equivalent( X, Y ), equivalent( X, Z ) ), T ), equivalent(
% 0.89/1.33 equivalent( Y, Z ), T ) ), U ), U ) ) ] )
% 0.89/1.33 .
% 0.89/1.33 clause( 3, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.89/1.33 equivalent( a, b ), c ), e ), equivalent( equivalent( equivalent( a,
% 0.89/1.33 falsehood ), c ), equivalent( equivalent( b, falsehood ), e ) ) ) ) ) ]
% 0.89/1.33 )
% 0.89/1.33 .
% 0.89/1.33 clause( 4, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent( equivalent(
% 0.89/1.33 equivalent( equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z
% 0.89/1.33 ) ), equivalent( Y, Z ) ), T ), T ), U ) ) ) ] )
% 0.89/1.33 .
% 0.89/1.33 clause( 5, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( equivalent( equivalent(
% 0.89/1.33 equivalent( equivalent( equivalent( equivalent( equivalent( X, Y ),
% 0.89/1.33 equivalent( X, Z ) ), T ), equivalent( equivalent( Y, Z ), T ) ), U ), U
% 0.89/1.33 ), W ) ) ) ] )
% 0.89/1.33 .
% 0.89/1.33 clause( 6, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent( X
% 0.89/1.33 , Y ) ) ) ] )
% 0.89/1.33 .
% 0.89/1.33 clause( 7, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ), Z
% 0.89/1.33 ), equivalent( equivalent( T, Y ), equivalent( equivalent( X, T ), Z ) )
% 0.89/1.33 ) ) ] )
% 0.89/1.33 .
% 0.89/1.33 clause( 8, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( equivalent( equivalent(
% 0.89/1.33 equivalent( X, Y ), equivalent( X, Y ) ), Z ) ) ) ] )
% 0.89/1.33 .
% 0.89/1.33 clause( 9, [ 'is_a_theorem'( equivalent( equivalent( equivalent( equivalent(
% 0.89/1.33 X, Y ), equivalent( X, Z ) ), T ), equivalent( equivalent( Y, Z ), T ) )
% 0.89/1.33 ) ] )
% 0.89/1.33 .
% 0.89/1.33 clause( 14, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.89/1.33 equivalent( Z, X ), equivalent( Z, Y ) ) ) ) ] )
% 0.89/1.33 .
% 0.89/1.33 clause( 17, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.89/1.33 equivalent( equivalent( equivalent( X, Y ), Z ), equivalent( equivalent(
% 0.89/1.33 T, Y ), equivalent( equivalent( X, T ), Z ) ) ), U ) ) ) ] )
% 0.89/1.33 .
% 0.89/1.33 clause( 20, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent(
% 0.89/1.33 equivalent( equivalent( X, Y ), equivalent( equivalent( Z, X ),
% 0.89/1.33 equivalent( Z, Y ) ) ), T ) ) ) ] )
% 0.89/1.33 .
% 0.89/1.33 clause( 23, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.89/1.33 equivalent( equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z
% 0.89/1.33 ) ), T ), equivalent( equivalent( Y, Z ), T ) ), U ) ) ) ] )
% 0.89/1.33 .
% 0.89/1.33 clause( 45, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.89/1.33 equivalent( Z, equivalent( T, X ) ), equivalent( Z, equivalent( T, Y ) )
% 0.89/1.33 ) ) ) ] )
% 0.89/1.33 .
% 0.89/1.33 clause( 177, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y,
% 0.89/1.33 equivalent( equivalent( equivalent( Z, T ), equivalent( Z, U ) ), W ) ) )
% 0.89/1.33 , equivalent( X, equivalent( Y, equivalent( equivalent( T, U ), W ) ) ) )
% 0.89/1.33 ) ] )
% 0.89/1.33 .
% 0.89/1.33 clause( 8227, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.89/1.33 equivalent( X, Y ), Z ), T ), equivalent( equivalent( equivalent( X, U )
% 0.89/1.33 , Z ), equivalent( equivalent( Y, U ), T ) ) ) ) ] )
% 0.89/1.33 .
% 0.89/1.33 clause( 8247, [] )
% 0.89/1.33 .
% 0.89/1.33
% 0.89/1.33
% 0.89/1.33 % SZS output end Refutation
% 0.89/1.33 found a proof!
% 0.89/1.33
% 0.89/1.33 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.89/1.33
% 0.89/1.33 initialclauses(
% 0.89/1.33 [ clause( 8249, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), ~(
% 0.89/1.33 'is_a_theorem'( X ) ), 'is_a_theorem'( Y ) ] )
% 0.89/1.33 , clause( 8250, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.89/1.33 equivalent( equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z )
% 0.89/1.33 ), T ), T ) ) ] )
% 0.89/1.33 , clause( 8251, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.89/1.33 equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z ) ), T ),
% 0.89/1.33 equivalent( equivalent( Y, Z ), T ) ), U ), U ) ) ] )
% 0.89/1.33 , clause( 8252, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.89/1.33 equivalent( a, b ), c ), e ), equivalent( equivalent( equivalent( a,
% 0.89/1.33 falsehood ), c ), equivalent( equivalent( b, falsehood ), e ) ) ) ) ) ]
% 0.89/1.33 )
% 0.89/1.33 ] ).
% 0.89/1.33
% 0.89/1.33
% 0.89/1.33
% 0.89/1.33 subsumption(
% 0.89/1.33 clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.89/1.33 , ~( 'is_a_theorem'( X ) ) ] )
% 0.89/1.33 , clause( 8249, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), ~(
% 0.89/1.33 'is_a_theorem'( X ) ), 'is_a_theorem'( Y ) ] )
% 0.89/1.33 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.89/1.33 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.89/1.33
% 0.89/1.33
% 0.89/1.33 subsumption(
% 0.89/1.33 clause( 1, [ 'is_a_theorem'( equivalent( equivalent( equivalent( equivalent(
% 0.89/1.33 equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z ) ), T ), T )
% 0.89/1.33 ) ] )
% 0.89/1.33 , clause( 8250, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.89/1.33 equivalent( equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z )
% 0.89/1.33 ), T ), T ) ) ] )
% 0.89/1.33 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.89/1.33 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.89/1.33
% 0.89/1.33
% 0.89/1.33 subsumption(
% 0.89/1.33 clause( 2, [ 'is_a_theorem'( equivalent( equivalent( equivalent( equivalent(
% 0.89/1.33 equivalent( equivalent( X, Y ), equivalent( X, Z ) ), T ), equivalent(
% 0.89/1.33 equivalent( Y, Z ), T ) ), U ), U ) ) ] )
% 0.89/1.33 , clause( 8251, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.89/1.33 equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z ) ), T ),
% 0.89/1.33 equivalent( equivalent( Y, Z ), T ) ), U ), U ) ) ] )
% 0.89/1.33 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.89/1.33 , U )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.89/1.33
% 0.89/1.33
% 0.89/1.33 subsumption(
% 0.89/1.33 clause( 3, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.89/1.33 equivalent( a, b ), c ), e ), equivalent( equivalent( equivalent( a,
% 0.89/1.33 falsehood ), c ), equivalent( equivalent( b, falsehood ), e ) ) ) ) ) ]
% 0.89/1.33 )
% 0.89/1.33 , clause( 8252, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.89/1.33 equivalent( a, b ), c ), e ), equivalent( equivalent( equivalent( a,
% 0.89/1.33 falsehood ), c ), equivalent( equivalent( b, falsehood ), e ) ) ) ) ) ]
% 0.89/1.33 )
% 0.89/1.33 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.89/1.33
% 0.89/1.33
% 0.89/1.33 resolution(
% 0.89/1.33 clause( 8254, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.89/1.33 equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z ) ),
% 0.89/1.33 equivalent( Y, Z ) ), T ), T ), U ) ) ), 'is_a_theorem'( U ) ] )
% 0.89/1.33 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.89/1.33 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.89/1.33 , 2, clause( 1, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.89/1.33 equivalent( equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z )
% 0.89/1.33 ), T ), T ) ) ] )
% 0.89/1.33 , 0, substitution( 0, [ :=( X, equivalent( equivalent( equivalent(
% 0.89/1.33 equivalent( equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z )
% 0.89/1.33 ), T ), T ) ), :=( Y, U )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )
% 0.89/1.33 , :=( Z, Z ), :=( T, T )] )).
% 0.89/1.33
% 0.89/1.33
% 0.89/1.33 subsumption(
% 0.89/1.33 clause( 4, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent( equivalent(
% 0.89/1.33 equivalent( equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z
% 0.89/1.33 ) ), equivalent( Y, Z ) ), T ), T ), U ) ) ) ] )
% 0.89/1.33 , clause( 8254, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.89/1.33 equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z ) ),
% 0.89/1.33 equivalent( Y, Z ) ), T ), T ), U ) ) ), 'is_a_theorem'( U ) ] )
% 0.89/1.33 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.89/1.33 , U )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.89/1.33
% 0.89/1.33
% 0.89/1.33 resolution(
% 0.89/1.33 clause( 8256, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.89/1.33 equivalent( equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z
% 0.89/1.33 ) ), T ), equivalent( equivalent( Y, Z ), T ) ), U ), U ), W ) ) ),
% 0.89/1.33 'is_a_theorem'( W ) ] )
% 0.89/1.33 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.89/1.33 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.89/1.33 , 2, clause( 2, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.89/1.33 equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z ) ), T ),
% 0.89/1.33 equivalent( equivalent( Y, Z ), T ) ), U ), U ) ) ] )
% 0.89/1.33 , 0, substitution( 0, [ :=( X, equivalent( equivalent( equivalent(
% 0.89/1.33 equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z ) ), T ),
% 0.89/1.33 equivalent( equivalent( Y, Z ), T ) ), U ), U ) ), :=( Y, W )] ),
% 0.89/1.33 substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.89/1.33 , U )] )).
% 0.89/1.33
% 0.89/1.33
% 0.89/1.33 subsumption(
% 0.89/1.33 clause( 5, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( equivalent( equivalent(
% 0.89/1.33 equivalent( equivalent( equivalent( equivalent( equivalent( X, Y ),
% 0.89/1.33 equivalent( X, Z ) ), T ), equivalent( equivalent( Y, Z ), T ) ), U ), U
% 0.89/1.33 ), W ) ) ) ] )
% 0.89/1.33 , clause( 8256, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.89/1.33 equivalent( equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z
% 0.89/1.33 ) ), T ), equivalent( equivalent( Y, Z ), T ) ), U ), U ), W ) ) ),
% 0.89/1.33 'is_a_theorem'( W ) ] )
% 0.89/1.33 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.89/1.33 , U ), :=( W, W )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.89/1.33
% 0.89/1.33
% 0.89/1.33 resolution(
% 0.89/1.33 clause( 8257, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.89/1.33 X, Y ) ) ) ] )
% 0.89/1.33 , clause( 4, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.89/1.33 equivalent( equivalent( equivalent( equivalent( equivalent( X, Y ),
% 0.89/1.33 equivalent( X, Z ) ), equivalent( Y, Z ) ), T ), T ), U ) ) ) ] )
% 0.89/1.33 , 1, clause( 2, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.89/1.33 equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z ) ), T ),
% 0.89/1.33 equivalent( equivalent( Y, Z ), T ) ), U ), U ) ) ] )
% 0.89/1.33 , 0, substitution( 0, [ :=( X, Z ), :=( Y, X ), :=( Z, Y ), :=( T,
% 0.89/1.33 equivalent( equivalent( X, Y ), equivalent( X, Y ) ) ), :=( U, equivalent(
% 0.89/1.33 equivalent( X, Y ), equivalent( X, Y ) ) )] ), substitution( 1, [ :=( X,
% 0.89/1.33 Z ), :=( Y, X ), :=( Z, Y ), :=( T, equivalent( X, Y ) ), :=( U,
% 0.89/1.33 equivalent( equivalent( X, Y ), equivalent( X, Y ) ) )] )).
% 0.89/1.33
% 0.89/1.33
% 0.89/1.33 subsumption(
% 0.89/1.33 clause( 6, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent( X
% 0.89/1.33 , Y ) ) ) ] )
% 0.89/1.33 , clause( 8257, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.89/1.33 equivalent( X, Y ) ) ) ] )
% 0.89/1.33 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.89/1.33 )] ) ).
% 0.89/1.33
% 0.89/1.33
% 0.89/1.33 resolution(
% 0.89/1.33 clause( 8258, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y )
% 0.89/1.33 , Z ), equivalent( equivalent( T, Y ), equivalent( equivalent( X, T ), Z
% 0.89/1.33 ) ) ) ) ] )
% 0.89/1.33 , clause( 5, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( equivalent(
% 0.89/1.33 equivalent( equivalent( equivalent( equivalent( equivalent( equivalent( X
% 0.89/1.33 , Y ), equivalent( X, Z ) ), T ), equivalent( equivalent( Y, Z ), T ) ),
% 0.89/1.33 U ), U ), W ) ) ) ] )
% 0.89/1.33 , 1, clause( 2, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.89/1.33 equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z ) ), T ),
% 0.89/1.33 equivalent( equivalent( Y, Z ), T ) ), U ), U ) ) ] )
% 0.89/1.33 , 0, substitution( 0, [ :=( X, X ), :=( Y, T ), :=( Z, Y ), :=( T,
% 0.89/1.33 equivalent( equivalent( X, T ), Z ) ), :=( U, equivalent( equivalent(
% 0.89/1.33 equivalent( X, Y ), Z ), equivalent( equivalent( T, Y ), equivalent(
% 0.89/1.33 equivalent( X, T ), Z ) ) ) ), :=( W, equivalent( equivalent( equivalent(
% 0.89/1.33 X, Y ), Z ), equivalent( equivalent( T, Y ), equivalent( equivalent( X, T
% 0.89/1.33 ), Z ) ) ) )] ), substitution( 1, [ :=( X, equivalent( X, T ) ), :=( Y,
% 0.89/1.33 equivalent( X, Y ) ), :=( Z, Z ), :=( T, equivalent( equivalent( T, Y ),
% 0.89/1.33 equivalent( equivalent( X, T ), Z ) ) ), :=( U, equivalent( equivalent(
% 0.89/1.33 equivalent( X, Y ), Z ), equivalent( equivalent( T, Y ), equivalent(
% 0.89/1.33 equivalent( X, T ), Z ) ) ) )] )).
% 0.89/1.33
% 0.89/1.33
% 0.89/1.33 subsumption(
% 0.89/1.33 clause( 7, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ), Z
% 0.89/1.33 ), equivalent( equivalent( T, Y ), equivalent( equivalent( X, T ), Z ) )
% 0.89/1.33 ) ) ] )
% 0.89/1.33 , clause( 8258, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.89/1.33 ), Z ), equivalent( equivalent( T, Y ), equivalent( equivalent( X, T ),
% 0.89/1.33 Z ) ) ) ) ] )
% 0.89/1.33 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.89/1.33 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.89/1.33
% 0.89/1.33
% 0.89/1.33 resolution(
% 0.89/1.33 clause( 8260, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.89/1.33 ), equivalent( X, Y ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.89/1.33 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.89/1.33 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.89/1.33 , 2, clause( 6, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.89/1.33 equivalent( X, Y ) ) ) ] )
% 0.89/1.33 , 0, substitution( 0, [ :=( X, equivalent( equivalent( X, Y ), equivalent(
% 0.89/1.33 X, Y ) ) ), :=( Y, Z )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )
% 0.89/1.33 ).
% 0.89/1.33
% 0.89/1.33
% 0.89/1.33 subsumption(
% 0.89/1.33 clause( 8, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( equivalent( equivalent(
% 0.89/1.33 equivalent( X, Y ), equivalent( X, Y ) ), Z ) ) ) ] )
% 0.89/1.33 , clause( 8260, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( X
% 0.89/1.33 , Y ), equivalent( X, Y ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.89/1.33 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.89/1.33 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.89/1.33
% 0.89/1.33
% 0.89/1.33 resolution(
% 0.89/1.33 clause( 8261, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.89/1.33 equivalent( X, Y ), equivalent( X, Z ) ), T ), equivalent( equivalent( Y
% 0.89/1.33 , Z ), T ) ) ) ] )
% 0.89/1.33 , clause( 8, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( equivalent(
% 0.89/1.33 equivalent( equivalent( X, Y ), equivalent( X, Y ) ), Z ) ) ) ] )
% 0.89/1.33 , 1, clause( 2, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.89/1.33 equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z ) ), T ),
% 0.89/1.33 equivalent( equivalent( Y, Z ), T ) ), U ), U ) ) ] )
% 0.89/1.33 , 0, substitution( 0, [ :=( X, equivalent( equivalent( equivalent( X, Y ),
% 0.89/1.33 equivalent( X, Z ) ), T ) ), :=( Y, equivalent( equivalent( Y, Z ), T ) )
% 0.89/1.33 , :=( Z, equivalent( equivalent( equivalent( equivalent( X, Y ),
% 0.89/1.33 equivalent( X, Z ) ), T ), equivalent( equivalent( Y, Z ), T ) ) )] ),
% 0.89/1.33 substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.89/1.33 , equivalent( equivalent( equivalent( equivalent( X, Y ), equivalent( X,
% 0.89/1.33 Z ) ), T ), equivalent( equivalent( Y, Z ), T ) ) )] )).
% 0.89/1.33
% 0.89/1.33
% 0.89/1.33 subsumption(
% 0.89/1.33 clause( 9, [ 'is_a_theorem'( equivalent( equivalent( equivalent( equivalent(
% 0.89/1.33 X, Y ), equivalent( X, Z ) ), T ), equivalent( equivalent( Y, Z ), T ) )
% 0.89/1.33 ) ] )
% 0.89/1.33 , clause( 8261, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.89/1.33 equivalent( X, Y ), equivalent( X, Z ) ), T ), equivalent( equivalent( Y
% 0.89/1.33 , Z ), T ) ) ) ] )
% 0.89/1.33 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.89/1.33 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.89/1.33
% 0.89/1.33
% 0.89/1.33 resolution(
% 0.89/1.33 clause( 8262, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.89/1.33 equivalent( Z, X ), equivalent( Z, Y ) ) ) ) ] )
% 0.89/1.33 , clause( 8, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( equivalent(
% 0.89/1.33 equivalent( equivalent( X, Y ), equivalent( X, Y ) ), Z ) ) ) ] )
% 0.89/1.33 , 1, clause( 7, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.89/1.33 ), Z ), equivalent( equivalent( T, Y ), equivalent( equivalent( X, T ),
% 0.89/1.33 Z ) ) ) ) ] )
% 0.89/1.33 , 0, substitution( 0, [ :=( X, Z ), :=( Y, Y ), :=( Z, equivalent(
% 0.89/1.33 equivalent( X, Y ), equivalent( equivalent( Z, X ), equivalent( Z, Y ) )
% 0.89/1.33 ) )] ), substitution( 1, [ :=( X, Z ), :=( Y, Y ), :=( Z, equivalent( Z
% 0.89/1.33 , Y ) ), :=( T, X )] )).
% 0.89/1.33
% 0.89/1.33
% 0.89/1.33 subsumption(
% 0.89/1.33 clause( 14, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.89/1.33 equivalent( Z, X ), equivalent( Z, Y ) ) ) ) ] )
% 0.89/1.33 , clause( 8262, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.89/1.33 equivalent( equivalent( Z, X ), equivalent( Z, Y ) ) ) ) ] )
% 0.89/1.33 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.89/1.33 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.89/1.33
% 0.89/1.33
% 0.89/1.33 resolution(
% 0.89/1.33 clause( 8264, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.89/1.33 equivalent( X, Y ), Z ), equivalent( equivalent( T, Y ), equivalent(
% 0.89/1.33 equivalent( X, T ), Z ) ) ), U ) ) ), 'is_a_theorem'( U ) ] )
% 0.89/1.33 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.89/1.33 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.89/1.33 , 2, clause( 7, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.89/1.33 ), Z ), equivalent( equivalent( T, Y ), equivalent( equivalent( X, T ),
% 0.89/1.33 Z ) ) ) ) ] )
% 0.89/1.33 , 0, substitution( 0, [ :=( X, equivalent( equivalent( equivalent( X, Y ),
% 0.89/1.33 Z ), equivalent( equivalent( T, Y ), equivalent( equivalent( X, T ), Z )
% 0.89/1.33 ) ) ), :=( Y, U )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z,
% 0.89/1.33 Z ), :=( T, T )] )).
% 0.89/1.33
% 0.89/1.33
% 0.89/1.33 subsumption(
% 0.89/1.33 clause( 17, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.89/1.33 equivalent( equivalent( equivalent( X, Y ), Z ), equivalent( equivalent(
% 0.89/1.33 T, Y ), equivalent( equivalent( X, T ), Z ) ) ), U ) ) ) ] )
% 0.89/1.33 , clause( 8264, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.89/1.33 equivalent( X, Y ), Z ), equivalent( equivalent( T, Y ), equivalent(
% 0.89/1.33 equivalent( X, T ), Z ) ) ), U ) ) ), 'is_a_theorem'( U ) ] )
% 0.89/1.33 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.89/1.33 , U )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.89/1.33
% 0.89/1.33
% 0.89/1.33 resolution(
% 0.89/1.33 clause( 8266, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.89/1.33 ), equivalent( equivalent( Z, X ), equivalent( Z, Y ) ) ), T ) ) ),
% 0.89/1.33 'is_a_theorem'( T ) ] )
% 0.89/1.33 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.89/1.33 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.89/1.33 , 2, clause( 14, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.89/1.33 equivalent( equivalent( Z, X ), equivalent( Z, Y ) ) ) ) ] )
% 0.89/1.33 , 0, substitution( 0, [ :=( X, equivalent( equivalent( X, Y ), equivalent(
% 0.89/1.33 equivalent( Z, X ), equivalent( Z, Y ) ) ) ), :=( Y, T )] ),
% 0.89/1.33 substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.89/1.33
% 0.89/1.33
% 0.89/1.33 subsumption(
% 0.89/1.33 clause( 20, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent(
% 0.89/1.33 equivalent( equivalent( X, Y ), equivalent( equivalent( Z, X ),
% 0.89/1.33 equivalent( Z, Y ) ) ), T ) ) ) ] )
% 0.89/1.33 , clause( 8266, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( X
% 0.89/1.33 , Y ), equivalent( equivalent( Z, X ), equivalent( Z, Y ) ) ), T ) ) ),
% 0.89/1.33 'is_a_theorem'( T ) ] )
% 0.89/1.33 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.89/1.33 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.89/1.33
% 0.89/1.33
% 0.89/1.33 resolution(
% 0.89/1.33 clause( 8268, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.89/1.33 equivalent( equivalent( X, Y ), equivalent( X, Z ) ), T ), equivalent(
% 0.89/1.33 equivalent( Y, Z ), T ) ), U ) ) ), 'is_a_theorem'( U ) ] )
% 0.89/1.33 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.89/1.33 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.89/1.33 , 2, clause( 9, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.89/1.33 equivalent( X, Y ), equivalent( X, Z ) ), T ), equivalent( equivalent( Y
% 0.89/1.33 , Z ), T ) ) ) ] )
% 0.89/1.33 , 0, substitution( 0, [ :=( X, equivalent( equivalent( equivalent(
% 0.89/1.33 equivalent( X, Y ), equivalent( X, Z ) ), T ), equivalent( equivalent( Y
% 0.89/1.33 , Z ), T ) ) ), :=( Y, U )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )
% 0.89/1.33 , :=( Z, Z ), :=( T, T )] )).
% 0.89/1.33
% 0.89/1.33
% 0.89/1.33 subsumption(
% 0.89/1.33 clause( 23, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.89/1.33 equivalent( equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z
% 0.89/1.33 ) ), T ), equivalent( equivalent( Y, Z ), T ) ), U ) ) ) ] )
% 0.89/1.33 , clause( 8268, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.89/1.33 equivalent( equivalent( X, Y ), equivalent( X, Z ) ), T ), equivalent(
% 0.89/1.33 equivalent( Y, Z ), T ) ), U ) ) ), 'is_a_theorem'( U ) ] )
% 0.89/1.33 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.89/1.33 , U )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.89/1.33
% 0.89/1.33
% 0.89/1.33 resolution(
% 0.89/1.33 clause( 8269, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.89/1.33 equivalent( Z, equivalent( T, X ) ), equivalent( Z, equivalent( T, Y ) )
% 0.89/1.33 ) ) ) ] )
% 0.89/1.33 , clause( 20, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent(
% 0.89/1.33 equivalent( equivalent( X, Y ), equivalent( equivalent( Z, X ),
% 0.89/1.33 equivalent( Z, Y ) ) ), T ) ) ) ] )
% 0.89/1.33 , 1, clause( 9, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.89/1.33 equivalent( X, Y ), equivalent( X, Z ) ), T ), equivalent( equivalent( Y
% 0.89/1.33 , Z ), T ) ) ) ] )
% 0.89/1.33 , 0, substitution( 0, [ :=( X, equivalent( T, X ) ), :=( Y, equivalent( T,
% 0.89/1.33 Y ) ), :=( Z, Z ), :=( T, equivalent( equivalent( X, Y ), equivalent(
% 0.89/1.33 equivalent( Z, equivalent( T, X ) ), equivalent( Z, equivalent( T, Y ) )
% 0.89/1.33 ) ) )] ), substitution( 1, [ :=( X, T ), :=( Y, X ), :=( Z, Y ), :=( T,
% 0.89/1.33 equivalent( equivalent( Z, equivalent( T, X ) ), equivalent( Z,
% 0.89/1.33 equivalent( T, Y ) ) ) )] )).
% 0.89/1.33
% 0.89/1.33
% 0.89/1.33 subsumption(
% 0.89/1.33 clause( 45, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.89/1.33 equivalent( Z, equivalent( T, X ) ), equivalent( Z, equivalent( T, Y ) )
% 0.89/1.33 ) ) ) ] )
% 0.89/1.33 , clause( 8269, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.89/1.33 equivalent( equivalent( Z, equivalent( T, X ) ), equivalent( Z,
% 0.89/1.33 equivalent( T, Y ) ) ) ) ) ] )
% 0.89/1.33 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.89/1.33 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.89/1.33
% 0.89/1.33
% 0.89/1.33 resolution(
% 0.89/1.33 clause( 8270, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y,
% 0.89/1.33 equivalent( equivalent( equivalent( Z, T ), equivalent( Z, U ) ), W ) ) )
% 0.89/1.33 , equivalent( X, equivalent( Y, equivalent( equivalent( T, U ), W ) ) ) )
% 0.89/1.33 ) ] )
% 0.89/1.33 , clause( 23, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.89/1.33 equivalent( equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z
% 0.89/1.33 ) ), T ), equivalent( equivalent( Y, Z ), T ) ), U ) ) ) ] )
% 0.89/1.33 , 1, clause( 45, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.89/1.33 equivalent( equivalent( Z, equivalent( T, X ) ), equivalent( Z,
% 0.89/1.33 equivalent( T, Y ) ) ) ) ) ] )
% 0.89/1.33 , 0, substitution( 0, [ :=( X, Z ), :=( Y, T ), :=( Z, U ), :=( T, W ),
% 0.89/1.33 :=( U, equivalent( equivalent( X, equivalent( Y, equivalent( equivalent(
% 0.89/1.33 equivalent( Z, T ), equivalent( Z, U ) ), W ) ) ), equivalent( X,
% 0.89/1.33 equivalent( Y, equivalent( equivalent( T, U ), W ) ) ) ) )] ),
% 0.89/1.33 substitution( 1, [ :=( X, equivalent( equivalent( equivalent( Z, T ),
% 0.89/1.33 equivalent( Z, U ) ), W ) ), :=( Y, equivalent( equivalent( T, U ), W ) )
% 0.89/1.33 , :=( Z, X ), :=( T, Y )] )).
% 0.89/1.33
% 0.89/1.33
% 0.89/1.33 subsumption(
% 0.89/1.33 clause( 177, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y,
% 0.89/1.33 equivalent( equivalent( equivalent( Z, T ), equivalent( Z, U ) ), W ) ) )
% 0.89/1.33 , equivalent( X, equivalent( Y, equivalent( equivalent( T, U ), W ) ) ) )
% 0.89/1.33 ) ] )
% 0.89/1.33 , clause( 8270, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y
% 0.89/1.33 , equivalent( equivalent( equivalent( Z, T ), equivalent( Z, U ) ), W ) )
% 0.89/1.33 ), equivalent( X, equivalent( Y, equivalent( equivalent( T, U ), W ) ) )
% 0.89/1.33 ) ) ] )
% 0.89/1.33 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.89/1.33 , U ), :=( W, W )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.89/1.33
% 0.89/1.33
% 0.89/1.33 resolution(
% 0.89/1.33 clause( 8271, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.89/1.33 equivalent( X, Y ), Z ), T ), equivalent( equivalent( equivalent( X, U )
% 0.89/1.33 , Z ), equivalent( equivalent( Y, U ), T ) ) ) ) ] )
% 0.89/1.33 , clause( 17, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.89/1.33 equivalent( equivalent( equivalent( X, Y ), Z ), equivalent( equivalent(
% 0.89/1.33 T, Y ), equivalent( equivalent( X, T ), Z ) ) ), U ) ) ) ] )
% 0.89/1.33 , 1, clause( 177, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.89/1.33 Y, equivalent( equivalent( equivalent( Z, T ), equivalent( Z, U ) ), W )
% 0.89/1.33 ) ), equivalent( X, equivalent( Y, equivalent( equivalent( T, U ), W ) )
% 0.89/1.33 ) ) ) ] )
% 0.89/1.33 , 0, substitution( 0, [ :=( X, equivalent( X, Y ) ), :=( Y, Z ), :=( Z, T )
% 0.89/1.33 , :=( T, equivalent( X, U ) ), :=( U, equivalent( equivalent( equivalent(
% 0.89/1.33 equivalent( X, Y ), Z ), T ), equivalent( equivalent( equivalent( X, U )
% 0.89/1.33 , Z ), equivalent( equivalent( Y, U ), T ) ) ) )] ), substitution( 1, [
% 0.89/1.33 :=( X, equivalent( equivalent( equivalent( X, Y ), Z ), T ) ), :=( Y,
% 0.89/1.33 equivalent( equivalent( X, U ), Z ) ), :=( Z, X ), :=( T, Y ), :=( U, U )
% 0.89/1.33 , :=( W, T )] )).
% 0.89/1.33
% 0.89/1.33
% 0.89/1.33 subsumption(
% 0.89/1.33 clause( 8227, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.89/1.33 equivalent( X, Y ), Z ), T ), equivalent( equivalent( equivalent( X, U )
% 0.89/1.33 , Z ), equivalent( equivalent( Y, U ), T ) ) ) ) ] )
% 0.89/1.33 , clause( 8271, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.89/1.33 equivalent( X, Y ), Z ), T ), equivalent( equivalent( equivalent( X, U )
% 0.89/1.33 , Z ), equivalent( equivalent( Y, U ), T ) ) ) ) ] )
% 0.89/1.33 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.89/1.33 , U )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.89/1.33
% 0.89/1.33
% 0.89/1.33 resolution(
% 0.89/1.33 clause( 8272, [] )
% 0.89/1.33 , clause( 3, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.89/1.33 equivalent( a, b ), c ), e ), equivalent( equivalent( equivalent( a,
% 0.89/1.33 falsehood ), c ), equivalent( equivalent( b, falsehood ), e ) ) ) ) ) ]
% 0.89/1.33 )
% 0.89/1.33 , 0, clause( 8227, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.89/1.33 equivalent( X, Y ), Z ), T ), equivalent( equivalent( equivalent( X, U )
% 0.89/1.33 , Z ), equivalent( equivalent( Y, U ), T ) ) ) ) ] )
% 0.89/1.33 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, a ), :=( Y, b ), :=(
% 0.89/1.33 Z, c ), :=( T, e ), :=( U, falsehood )] )).
% 0.89/1.33
% 0.89/1.33
% 0.89/1.33 subsumption(
% 0.89/1.33 clause( 8247, [] )
% 0.89/1.33 , clause( 8272, [] )
% 0.89/1.33 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.89/1.33
% 0.89/1.33
% 0.89/1.33 end.
% 0.89/1.33
% 0.89/1.33 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.89/1.33
% 0.89/1.33 Memory use:
% 0.89/1.33
% 0.89/1.33 space for terms: 200657
% 0.89/1.33 space for clauses: 917782
% 0.89/1.33
% 0.89/1.33
% 0.89/1.33 clauses generated: 20036
% 0.89/1.33 clauses kept: 8248
% 0.89/1.33 clauses selected: 552
% 0.89/1.33 clauses deleted: 2
% 0.89/1.33 clauses inuse deleted: 2
% 0.89/1.33
% 0.89/1.33 subsentry: 12678
% 0.89/1.33 literals s-matched: 11790
% 0.89/1.33 literals matched: 11790
% 0.89/1.33 full subsumption: 0
% 0.89/1.33
% 0.89/1.33 checksum: 1267434046
% 0.89/1.33
% 0.89/1.33
% 0.89/1.33 Bliksem ended
%------------------------------------------------------------------------------