TSTP Solution File: LCL108-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL108-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n019.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:25 EDT 2022
% Result : Unsatisfiable 0.40s 1.07s
% Output : Refutation 0.40s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : LCL108-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.11 % Command : bliksem %s
% 0.11/0.32 % Computer : n019.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % DateTime : Mon Jul 4 07:30:23 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.40/1.07 *** allocated 10000 integers for termspace/termends
% 0.40/1.07 *** allocated 10000 integers for clauses
% 0.40/1.07 *** allocated 10000 integers for justifications
% 0.40/1.07 Bliksem 1.12
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 Automatic Strategy Selection
% 0.40/1.07
% 0.40/1.07 Clauses:
% 0.40/1.07 [
% 0.40/1.07 [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), ~( 'is_a_theorem'( X ) ),
% 0.40/1.07 'is_a_theorem'( Y ) ],
% 0.40/1.07 [ 'is_a_theorem'( equivalent( equivalent( equivalent( equivalent( X, Y )
% 0.40/1.07 , Z ), equivalent( equivalent( T, U ), equivalent( equivalent( equivalent(
% 0.40/1.07 W, U ), equivalent( W, T ) ), V0 ) ) ), equivalent( Z, equivalent(
% 0.40/1.07 equivalent( Y, X ), V0 ) ) ) ) ],
% 0.40/1.07 [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( a, b ),
% 0.40/1.07 equivalent( equivalent( b, a ), c ) ), c ) ) ) ]
% 0.40/1.07 ] .
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 percentage equality = 0.000000, percentage horn = 1.000000
% 0.40/1.07 This is a near-Horn, non-equality problem
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 Options Used:
% 0.40/1.07
% 0.40/1.07 useres = 1
% 0.40/1.07 useparamod = 0
% 0.40/1.07 useeqrefl = 0
% 0.40/1.07 useeqfact = 0
% 0.40/1.07 usefactor = 1
% 0.40/1.07 usesimpsplitting = 0
% 0.40/1.07 usesimpdemod = 0
% 0.40/1.07 usesimpres = 4
% 0.40/1.07
% 0.40/1.07 resimpinuse = 1000
% 0.40/1.07 resimpclauses = 20000
% 0.40/1.07 substype = standard
% 0.40/1.07 backwardsubs = 1
% 0.40/1.07 selectoldest = 5
% 0.40/1.07
% 0.40/1.07 litorderings [0] = split
% 0.40/1.07 litorderings [1] = liftord
% 0.40/1.07
% 0.40/1.07 termordering = none
% 0.40/1.07
% 0.40/1.07 litapriori = 1
% 0.40/1.07 termapriori = 0
% 0.40/1.07 litaposteriori = 0
% 0.40/1.07 termaposteriori = 0
% 0.40/1.07 demodaposteriori = 0
% 0.40/1.07 ordereqreflfact = 0
% 0.40/1.07
% 0.40/1.07 litselect = negative
% 0.40/1.07
% 0.40/1.07 maxweight = 30000
% 0.40/1.07 maxdepth = 30000
% 0.40/1.07 maxlength = 115
% 0.40/1.07 maxnrvars = 195
% 0.40/1.07 excuselevel = 0
% 0.40/1.07 increasemaxweight = 0
% 0.40/1.07
% 0.40/1.07 maxselected = 10000000
% 0.40/1.07 maxnrclauses = 10000000
% 0.40/1.07
% 0.40/1.07 showgenerated = 0
% 0.40/1.07 showkept = 0
% 0.40/1.07 showselected = 0
% 0.40/1.07 showdeleted = 0
% 0.40/1.07 showresimp = 1
% 0.40/1.07 showstatus = 2000
% 0.40/1.07
% 0.40/1.07 prologoutput = 1
% 0.40/1.07 nrgoals = 5000000
% 0.40/1.07 totalproof = 1
% 0.40/1.07
% 0.40/1.07 Symbols occurring in the translation:
% 0.40/1.07
% 0.40/1.07 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.40/1.07 . [1, 2] (w:1, o:25, a:1, s:1, b:0),
% 0.40/1.07 ! [4, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.40/1.07 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.40/1.07 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.40/1.07 equivalent [41, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.40/1.07 'is_a_theorem' [42, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.40/1.07 a [48, 0] (w:1, o:16, a:1, s:1, b:0),
% 0.40/1.07 b [49, 0] (w:1, o:17, a:1, s:1, b:0),
% 0.40/1.07 c [50, 0] (w:1, o:18, a:1, s:1, b:0).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 Starting Search:
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 Bliksems!, er is een bewijs:
% 0.40/1.07 % SZS status Unsatisfiable
% 0.40/1.07 % SZS output start Refutation
% 0.40/1.07
% 0.40/1.07 clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.40/1.07 , ~( 'is_a_theorem'( X ) ) ] )
% 0.40/1.07 .
% 0.40/1.07 clause( 1, [ 'is_a_theorem'( equivalent( equivalent( equivalent( equivalent(
% 0.40/1.07 X, Y ), Z ), equivalent( equivalent( T, U ), equivalent( equivalent(
% 0.40/1.07 equivalent( W, U ), equivalent( W, T ) ), V0 ) ) ), equivalent( Z,
% 0.40/1.07 equivalent( equivalent( Y, X ), V0 ) ) ) ) ] )
% 0.40/1.07 .
% 0.40/1.07 clause( 2, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( a, b )
% 0.40/1.07 , equivalent( equivalent( b, a ), c ) ), c ) ) ) ] )
% 0.40/1.07 .
% 0.40/1.07 clause( 3, [ 'is_a_theorem'( V1 ), ~( 'is_a_theorem'( equivalent(
% 0.40/1.07 equivalent( equivalent( equivalent( equivalent( X, Y ), Z ), equivalent(
% 0.40/1.07 equivalent( T, U ), equivalent( equivalent( equivalent( W, U ),
% 0.40/1.07 equivalent( W, T ) ), V0 ) ) ), equivalent( Z, equivalent( equivalent( Y
% 0.40/1.07 , X ), V0 ) ) ), V1 ) ) ) ] )
% 0.40/1.07 .
% 0.40/1.07 clause( 4, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.40/1.07 equivalent( equivalent( equivalent( Z, Y ), equivalent( Z, X ) ), T ) ),
% 0.40/1.07 equivalent( equivalent( equivalent( U, W ), equivalent( equivalent( V0, U
% 0.40/1.07 ), equivalent( V0, W ) ) ), T ) ) ) ] )
% 0.40/1.07 .
% 0.40/1.07 clause( 5, [ 'is_a_theorem'( V1 ), ~( 'is_a_theorem'( equivalent(
% 0.40/1.07 equivalent( equivalent( equivalent( X, Y ), equivalent( equivalent(
% 0.40/1.07 equivalent( Z, Y ), equivalent( Z, X ) ), T ) ), equivalent( equivalent(
% 0.40/1.07 equivalent( U, W ), equivalent( equivalent( V0, U ), equivalent( V0, W )
% 0.40/1.07 ) ), T ) ), V1 ) ) ) ] )
% 0.40/1.07 .
% 0.40/1.07 clause( 6, [ 'is_a_theorem'( equivalent( equivalent( equivalent( equivalent(
% 0.40/1.07 X, Y ), equivalent( X, Z ) ), equivalent( equivalent( equivalent( T,
% 0.40/1.07 equivalent( equivalent( U, W ), equivalent( U, V0 ) ) ), equivalent( T,
% 0.40/1.07 equivalent( W, V0 ) ) ), V1 ) ), equivalent( equivalent( Y, Z ), V1 ) ) )
% 0.40/1.07 ] )
% 0.40/1.07 .
% 0.40/1.07 clause( 7, [ 'is_a_theorem'( equivalent( equivalent( equivalent( equivalent(
% 0.40/1.07 X, equivalent( equivalent( Y, Z ), equivalent( Y, T ) ) ), equivalent( X
% 0.40/1.07 , equivalent( Z, T ) ) ), equivalent( equivalent( equivalent( U, W ),
% 0.40/1.07 equivalent( U, V0 ) ), V1 ) ), equivalent( equivalent( W, V0 ), V1 ) ) )
% 0.40/1.07 ] )
% 0.40/1.07 .
% 0.40/1.07 clause( 8, [ 'is_a_theorem'( V2 ), ~( 'is_a_theorem'( equivalent(
% 0.40/1.07 equivalent( equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z
% 0.40/1.07 ) ), equivalent( equivalent( equivalent( T, equivalent( equivalent( U, W
% 0.40/1.07 ), equivalent( U, V0 ) ) ), equivalent( T, equivalent( W, V0 ) ) ), V1 )
% 0.40/1.07 ), equivalent( equivalent( Y, Z ), V1 ) ), V2 ) ) ) ] )
% 0.40/1.07 .
% 0.40/1.07 clause( 17, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ), Z
% 0.40/1.07 ), equivalent( equivalent( equivalent( T, X ), equivalent( T, Y ) ), Z )
% 0.40/1.07 ) ) ] )
% 0.40/1.07 .
% 0.40/1.07 clause( 23, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.40/1.07 equivalent( equivalent( equivalent( X, Y ), Z ), equivalent( equivalent(
% 0.40/1.07 equivalent( T, X ), equivalent( T, Y ) ), Z ) ), U ) ) ) ] )
% 0.40/1.07 .
% 0.40/1.07 clause( 27, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.40/1.07 equivalent( Y, Z ), equivalent( Y, T ) ) ), equivalent( X, equivalent( Z
% 0.40/1.07 , T ) ) ) ) ] )
% 0.40/1.07 .
% 0.40/1.07 clause( 28, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.40/1.07 equivalent( X, equivalent( Y, Z ) ), equivalent( X, equivalent( Y, T ) )
% 0.40/1.07 ), U ), equivalent( equivalent( Z, T ), U ) ) ) ] )
% 0.40/1.07 .
% 0.40/1.07 clause( 42, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.40/1.07 equivalent( equivalent( Z, X ), T ) ), equivalent( equivalent( Z, Y ), T
% 0.40/1.07 ) ) ) ] )
% 0.40/1.07 .
% 0.40/1.07 clause( 46, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.40/1.07 equivalent( equivalent( X, equivalent( equivalent( Y, Z ), equivalent( Y
% 0.40/1.07 , T ) ) ), equivalent( X, equivalent( Z, T ) ) ), U ) ) ) ] )
% 0.40/1.07 .
% 0.40/1.07 clause( 48, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, X ), Y
% 0.40/1.07 ), Y ) ) ] )
% 0.40/1.07 .
% 0.40/1.07 clause( 54, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( equivalent(
% 0.40/1.07 equivalent( equivalent( equivalent( X, X ), Y ), Y ), Z ) ) ) ] )
% 0.40/1.07 .
% 0.40/1.07 clause( 72, [ 'is_a_theorem'( equivalent( X, X ) ) ] )
% 0.40/1.07 .
% 0.40/1.07 clause( 79, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( equivalent(
% 0.40/1.07 equivalent( X, X ), Y ) ) ) ] )
% 0.40/1.07 .
% 0.40/1.07 clause( 301, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.40/1.07 equivalent( Z, equivalent( T, X ) ), equivalent( Z, equivalent( T, Y ) )
% 0.40/1.07 ) ) ) ] )
% 0.40/1.07 .
% 0.40/1.07 clause( 309, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y,
% 0.40/1.07 equivalent( equivalent( Z, Z ), T ) ) ), equivalent( X, equivalent( Y, T
% 0.40/1.07 ) ) ) ) ] )
% 0.40/1.07 .
% 0.40/1.07 clause( 695, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.40/1.07 equivalent( Y, equivalent( Z, Z ) ), equivalent( Y, T ) ) ), equivalent(
% 0.40/1.07 X, T ) ) ) ] )
% 0.40/1.07 .
% 0.40/1.07 clause( 725, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.40/1.07 equivalent( equivalent( Y, X ), Z ) ), Z ) ) ] )
% 0.40/1.07 .
% 0.40/1.07 clause( 730, [] )
% 0.40/1.07 .
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 % SZS output end Refutation
% 0.40/1.07 found a proof!
% 0.40/1.07
% 0.40/1.07 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.40/1.07
% 0.40/1.07 initialclauses(
% 0.40/1.07 [ clause( 732, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), ~(
% 0.40/1.07 'is_a_theorem'( X ) ), 'is_a_theorem'( Y ) ] )
% 0.40/1.07 , clause( 733, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.40/1.07 equivalent( X, Y ), Z ), equivalent( equivalent( T, U ), equivalent(
% 0.40/1.07 equivalent( equivalent( W, U ), equivalent( W, T ) ), V0 ) ) ),
% 0.40/1.07 equivalent( Z, equivalent( equivalent( Y, X ), V0 ) ) ) ) ] )
% 0.40/1.07 , clause( 734, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( a,
% 0.40/1.07 b ), equivalent( equivalent( b, a ), c ) ), c ) ) ) ] )
% 0.40/1.07 ] ).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 subsumption(
% 0.40/1.07 clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.40/1.07 , ~( 'is_a_theorem'( X ) ) ] )
% 0.40/1.07 , clause( 732, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), ~(
% 0.40/1.07 'is_a_theorem'( X ) ), 'is_a_theorem'( Y ) ] )
% 0.40/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.40/1.07 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 subsumption(
% 0.40/1.07 clause( 1, [ 'is_a_theorem'( equivalent( equivalent( equivalent( equivalent(
% 0.40/1.07 X, Y ), Z ), equivalent( equivalent( T, U ), equivalent( equivalent(
% 0.40/1.07 equivalent( W, U ), equivalent( W, T ) ), V0 ) ) ), equivalent( Z,
% 0.40/1.07 equivalent( equivalent( Y, X ), V0 ) ) ) ) ] )
% 0.40/1.07 , clause( 733, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.40/1.07 equivalent( X, Y ), Z ), equivalent( equivalent( T, U ), equivalent(
% 0.40/1.07 equivalent( equivalent( W, U ), equivalent( W, T ) ), V0 ) ) ),
% 0.40/1.07 equivalent( Z, equivalent( equivalent( Y, X ), V0 ) ) ) ) ] )
% 0.40/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.40/1.07 , U ), :=( W, W ), :=( V0, V0 )] ), permutation( 0, [ ==>( 0, 0 )] )
% 0.40/1.07 ).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 subsumption(
% 0.40/1.07 clause( 2, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( a, b )
% 0.40/1.07 , equivalent( equivalent( b, a ), c ) ), c ) ) ) ] )
% 0.40/1.07 , clause( 734, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( a,
% 0.40/1.07 b ), equivalent( equivalent( b, a ), c ) ), c ) ) ) ] )
% 0.40/1.07 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 resolution(
% 0.40/1.07 clause( 736, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.40/1.07 equivalent( equivalent( X, Y ), Z ), equivalent( equivalent( T, U ),
% 0.40/1.07 equivalent( equivalent( equivalent( W, U ), equivalent( W, T ) ), V0 ) )
% 0.40/1.07 ), equivalent( Z, equivalent( equivalent( Y, X ), V0 ) ) ), V1 ) ) ),
% 0.40/1.07 'is_a_theorem'( V1 ) ] )
% 0.40/1.07 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.40/1.07 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.40/1.07 , 2, clause( 1, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.40/1.07 equivalent( X, Y ), Z ), equivalent( equivalent( T, U ), equivalent(
% 0.40/1.07 equivalent( equivalent( W, U ), equivalent( W, T ) ), V0 ) ) ),
% 0.40/1.07 equivalent( Z, equivalent( equivalent( Y, X ), V0 ) ) ) ) ] )
% 0.40/1.07 , 0, substitution( 0, [ :=( X, equivalent( equivalent( equivalent(
% 0.40/1.07 equivalent( X, Y ), Z ), equivalent( equivalent( T, U ), equivalent(
% 0.40/1.07 equivalent( equivalent( W, U ), equivalent( W, T ) ), V0 ) ) ),
% 0.40/1.07 equivalent( Z, equivalent( equivalent( Y, X ), V0 ) ) ) ), :=( Y, V1 )] )
% 0.40/1.07 , substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=(
% 0.40/1.07 U, U ), :=( W, W ), :=( V0, V0 )] )).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 subsumption(
% 0.40/1.07 clause( 3, [ 'is_a_theorem'( V1 ), ~( 'is_a_theorem'( equivalent(
% 0.40/1.07 equivalent( equivalent( equivalent( equivalent( X, Y ), Z ), equivalent(
% 0.40/1.07 equivalent( T, U ), equivalent( equivalent( equivalent( W, U ),
% 0.40/1.07 equivalent( W, T ) ), V0 ) ) ), equivalent( Z, equivalent( equivalent( Y
% 0.40/1.07 , X ), V0 ) ) ), V1 ) ) ) ] )
% 0.40/1.07 , clause( 736, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.40/1.07 equivalent( equivalent( X, Y ), Z ), equivalent( equivalent( T, U ),
% 0.40/1.07 equivalent( equivalent( equivalent( W, U ), equivalent( W, T ) ), V0 ) )
% 0.40/1.07 ), equivalent( Z, equivalent( equivalent( Y, X ), V0 ) ) ), V1 ) ) ),
% 0.40/1.07 'is_a_theorem'( V1 ) ] )
% 0.40/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.40/1.07 , U ), :=( W, W ), :=( V0, V0 ), :=( V1, V1 )] ), permutation( 0, [ ==>(
% 0.40/1.07 0, 1 ), ==>( 1, 0 )] ) ).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 resolution(
% 0.40/1.07 clause( 737, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.40/1.07 equivalent( equivalent( equivalent( Z, Y ), equivalent( Z, X ) ), T ) ),
% 0.40/1.07 equivalent( equivalent( equivalent( U, W ), equivalent( equivalent( V0, U
% 0.40/1.07 ), equivalent( V0, W ) ) ), T ) ) ) ] )
% 0.40/1.07 , clause( 3, [ 'is_a_theorem'( V1 ), ~( 'is_a_theorem'( equivalent(
% 0.40/1.07 equivalent( equivalent( equivalent( equivalent( X, Y ), Z ), equivalent(
% 0.40/1.07 equivalent( T, U ), equivalent( equivalent( equivalent( W, U ),
% 0.40/1.07 equivalent( W, T ) ), V0 ) ) ), equivalent( Z, equivalent( equivalent( Y
% 0.40/1.07 , X ), V0 ) ) ), V1 ) ) ) ] )
% 0.40/1.07 , 1, clause( 1, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.40/1.07 equivalent( X, Y ), Z ), equivalent( equivalent( T, U ), equivalent(
% 0.40/1.07 equivalent( equivalent( W, U ), equivalent( W, T ) ), V0 ) ) ),
% 0.40/1.07 equivalent( Z, equivalent( equivalent( Y, X ), V0 ) ) ) ) ] )
% 0.40/1.07 , 0, substitution( 0, [ :=( X, equivalent( V0, U ) ), :=( Y, equivalent( V0
% 0.40/1.07 , W ) ), :=( Z, equivalent( U, W ) ), :=( T, X ), :=( U, Y ), :=( W, Z )
% 0.40/1.07 , :=( V0, T ), :=( V1, equivalent( equivalent( equivalent( X, Y ),
% 0.40/1.07 equivalent( equivalent( equivalent( Z, Y ), equivalent( Z, X ) ), T ) ),
% 0.40/1.07 equivalent( equivalent( equivalent( U, W ), equivalent( equivalent( V0, U
% 0.40/1.07 ), equivalent( V0, W ) ) ), T ) ) )] ), substitution( 1, [ :=( X,
% 0.40/1.07 equivalent( equivalent( V0, U ), equivalent( V0, W ) ) ), :=( Y,
% 0.40/1.07 equivalent( U, W ) ), :=( Z, equivalent( equivalent( X, Y ), equivalent(
% 0.40/1.07 equivalent( equivalent( Z, Y ), equivalent( Z, X ) ), T ) ) ), :=( T, U )
% 0.40/1.07 , :=( U, W ), :=( W, V0 ), :=( V0, T )] )).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 subsumption(
% 0.40/1.07 clause( 4, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.40/1.07 equivalent( equivalent( equivalent( Z, Y ), equivalent( Z, X ) ), T ) ),
% 0.40/1.07 equivalent( equivalent( equivalent( U, W ), equivalent( equivalent( V0, U
% 0.40/1.07 ), equivalent( V0, W ) ) ), T ) ) ) ] )
% 0.40/1.07 , clause( 737, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y )
% 0.40/1.07 , equivalent( equivalent( equivalent( Z, Y ), equivalent( Z, X ) ), T ) )
% 0.40/1.07 , equivalent( equivalent( equivalent( U, W ), equivalent( equivalent( V0
% 0.40/1.07 , U ), equivalent( V0, W ) ) ), T ) ) ) ] )
% 0.40/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.40/1.07 , U ), :=( W, W ), :=( V0, V0 )] ), permutation( 0, [ ==>( 0, 0 )] )
% 0.40/1.07 ).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 resolution(
% 0.40/1.07 clause( 739, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.40/1.07 equivalent( X, Y ), equivalent( equivalent( equivalent( Z, Y ),
% 0.40/1.07 equivalent( Z, X ) ), T ) ), equivalent( equivalent( equivalent( U, W ),
% 0.40/1.07 equivalent( equivalent( V0, U ), equivalent( V0, W ) ) ), T ) ), V1 ) ) )
% 0.40/1.07 , 'is_a_theorem'( V1 ) ] )
% 0.40/1.07 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.40/1.07 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.40/1.07 , 2, clause( 4, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.40/1.07 ), equivalent( equivalent( equivalent( Z, Y ), equivalent( Z, X ) ), T )
% 0.40/1.07 ), equivalent( equivalent( equivalent( U, W ), equivalent( equivalent(
% 0.40/1.07 V0, U ), equivalent( V0, W ) ) ), T ) ) ) ] )
% 0.40/1.07 , 0, substitution( 0, [ :=( X, equivalent( equivalent( equivalent( X, Y ),
% 0.40/1.07 equivalent( equivalent( equivalent( Z, Y ), equivalent( Z, X ) ), T ) ),
% 0.40/1.07 equivalent( equivalent( equivalent( U, W ), equivalent( equivalent( V0, U
% 0.40/1.07 ), equivalent( V0, W ) ) ), T ) ) ), :=( Y, V1 )] ), substitution( 1, [
% 0.40/1.07 :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U, U ), :=( W, W ),
% 0.40/1.07 :=( V0, V0 )] )).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 subsumption(
% 0.40/1.07 clause( 5, [ 'is_a_theorem'( V1 ), ~( 'is_a_theorem'( equivalent(
% 0.40/1.07 equivalent( equivalent( equivalent( X, Y ), equivalent( equivalent(
% 0.40/1.07 equivalent( Z, Y ), equivalent( Z, X ) ), T ) ), equivalent( equivalent(
% 0.40/1.07 equivalent( U, W ), equivalent( equivalent( V0, U ), equivalent( V0, W )
% 0.40/1.07 ) ), T ) ), V1 ) ) ) ] )
% 0.40/1.07 , clause( 739, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.40/1.07 equivalent( X, Y ), equivalent( equivalent( equivalent( Z, Y ),
% 0.40/1.07 equivalent( Z, X ) ), T ) ), equivalent( equivalent( equivalent( U, W ),
% 0.40/1.07 equivalent( equivalent( V0, U ), equivalent( V0, W ) ) ), T ) ), V1 ) ) )
% 0.40/1.07 , 'is_a_theorem'( V1 ) ] )
% 0.40/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.40/1.07 , U ), :=( W, W ), :=( V0, V0 ), :=( V1, V1 )] ), permutation( 0, [ ==>(
% 0.40/1.07 0, 1 ), ==>( 1, 0 )] ) ).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 resolution(
% 0.40/1.07 clause( 740, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.40/1.07 equivalent( X, Y ), equivalent( X, Z ) ), equivalent( equivalent(
% 0.40/1.07 equivalent( T, equivalent( equivalent( U, W ), equivalent( U, V0 ) ) ),
% 0.40/1.07 equivalent( T, equivalent( W, V0 ) ) ), V1 ) ), equivalent( equivalent( Y
% 0.40/1.07 , Z ), V1 ) ) ) ] )
% 0.40/1.07 , clause( 5, [ 'is_a_theorem'( V1 ), ~( 'is_a_theorem'( equivalent(
% 0.40/1.07 equivalent( equivalent( equivalent( X, Y ), equivalent( equivalent(
% 0.40/1.07 equivalent( Z, Y ), equivalent( Z, X ) ), T ) ), equivalent( equivalent(
% 0.40/1.07 equivalent( U, W ), equivalent( equivalent( V0, U ), equivalent( V0, W )
% 0.40/1.07 ) ), T ) ), V1 ) ) ) ] )
% 0.40/1.07 , 1, clause( 1, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.40/1.07 equivalent( X, Y ), Z ), equivalent( equivalent( T, U ), equivalent(
% 0.40/1.07 equivalent( equivalent( W, U ), equivalent( W, T ) ), V0 ) ) ),
% 0.40/1.07 equivalent( Z, equivalent( equivalent( Y, X ), V0 ) ) ) ) ] )
% 0.40/1.07 , 0, substitution( 0, [ :=( X, Z ), :=( Y, Y ), :=( Z, X ), :=( T,
% 0.40/1.07 equivalent( equivalent( equivalent( T, equivalent( equivalent( U, W ),
% 0.40/1.07 equivalent( U, V0 ) ) ), equivalent( T, equivalent( W, V0 ) ) ), V1 ) ),
% 0.40/1.07 :=( U, W ), :=( W, V0 ), :=( V0, U ), :=( V1, equivalent( equivalent(
% 0.40/1.07 equivalent( equivalent( X, Y ), equivalent( X, Z ) ), equivalent(
% 0.40/1.07 equivalent( equivalent( T, equivalent( equivalent( U, W ), equivalent( U
% 0.40/1.07 , V0 ) ) ), equivalent( T, equivalent( W, V0 ) ) ), V1 ) ), equivalent(
% 0.40/1.07 equivalent( Y, Z ), V1 ) ) )] ), substitution( 1, [ :=( X, Z ), :=( Y, Y
% 0.40/1.07 ), :=( Z, equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z )
% 0.40/1.07 ), equivalent( equivalent( equivalent( T, equivalent( equivalent( U, W )
% 0.40/1.07 , equivalent( U, V0 ) ) ), equivalent( T, equivalent( W, V0 ) ) ), V1 ) )
% 0.40/1.07 ), :=( T, equivalent( W, V0 ) ), :=( U, equivalent( equivalent( U, W ),
% 0.40/1.07 equivalent( U, V0 ) ) ), :=( W, T ), :=( V0, V1 )] )).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 subsumption(
% 0.40/1.07 clause( 6, [ 'is_a_theorem'( equivalent( equivalent( equivalent( equivalent(
% 0.40/1.07 X, Y ), equivalent( X, Z ) ), equivalent( equivalent( equivalent( T,
% 0.40/1.07 equivalent( equivalent( U, W ), equivalent( U, V0 ) ) ), equivalent( T,
% 0.40/1.07 equivalent( W, V0 ) ) ), V1 ) ), equivalent( equivalent( Y, Z ), V1 ) ) )
% 0.40/1.07 ] )
% 0.40/1.07 , clause( 740, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.40/1.07 equivalent( X, Y ), equivalent( X, Z ) ), equivalent( equivalent(
% 0.40/1.07 equivalent( T, equivalent( equivalent( U, W ), equivalent( U, V0 ) ) ),
% 0.40/1.07 equivalent( T, equivalent( W, V0 ) ) ), V1 ) ), equivalent( equivalent( Y
% 0.40/1.07 , Z ), V1 ) ) ) ] )
% 0.40/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.40/1.07 , U ), :=( W, W ), :=( V0, V0 ), :=( V1, V1 )] ), permutation( 0, [ ==>(
% 0.40/1.07 0, 0 )] ) ).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 resolution(
% 0.40/1.07 clause( 741, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.40/1.07 equivalent( X, equivalent( equivalent( Y, Z ), equivalent( Y, T ) ) ),
% 0.40/1.07 equivalent( X, equivalent( Z, T ) ) ), equivalent( equivalent( equivalent(
% 0.40/1.07 U, W ), equivalent( U, V0 ) ), V1 ) ), equivalent( equivalent( W, V0 ),
% 0.40/1.07 V1 ) ) ) ] )
% 0.40/1.07 , clause( 3, [ 'is_a_theorem'( V1 ), ~( 'is_a_theorem'( equivalent(
% 0.40/1.07 equivalent( equivalent( equivalent( equivalent( X, Y ), Z ), equivalent(
% 0.40/1.07 equivalent( T, U ), equivalent( equivalent( equivalent( W, U ),
% 0.40/1.07 equivalent( W, T ) ), V0 ) ) ), equivalent( Z, equivalent( equivalent( Y
% 0.40/1.07 , X ), V0 ) ) ), V1 ) ) ) ] )
% 0.40/1.07 , 1, clause( 6, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.40/1.07 equivalent( X, Y ), equivalent( X, Z ) ), equivalent( equivalent(
% 0.40/1.07 equivalent( T, equivalent( equivalent( U, W ), equivalent( U, V0 ) ) ),
% 0.40/1.07 equivalent( T, equivalent( W, V0 ) ) ), V1 ) ), equivalent( equivalent( Y
% 0.40/1.07 , Z ), V1 ) ) ) ] )
% 0.40/1.07 , 0, substitution( 0, [ :=( X, V0 ), :=( Y, W ), :=( Z, equivalent(
% 0.40/1.07 equivalent( X, equivalent( equivalent( Y, Z ), equivalent( Y, T ) ) ),
% 0.40/1.07 equivalent( X, equivalent( Z, T ) ) ) ), :=( T, V0 ), :=( U, W ), :=( W,
% 0.40/1.07 U ), :=( V0, V1 ), :=( V1, equivalent( equivalent( equivalent( equivalent(
% 0.40/1.07 X, equivalent( equivalent( Y, Z ), equivalent( Y, T ) ) ), equivalent( X
% 0.40/1.07 , equivalent( Z, T ) ) ), equivalent( equivalent( equivalent( U, W ),
% 0.40/1.07 equivalent( U, V0 ) ), V1 ) ), equivalent( equivalent( W, V0 ), V1 ) ) )] )
% 0.40/1.07 , substitution( 1, [ :=( X, equivalent( V0, W ) ), :=( Y, equivalent(
% 0.40/1.07 equivalent( X, equivalent( equivalent( Y, Z ), equivalent( Y, T ) ) ),
% 0.40/1.07 equivalent( X, equivalent( Z, T ) ) ) ), :=( Z, equivalent( equivalent(
% 0.40/1.07 equivalent( U, W ), equivalent( U, V0 ) ), V1 ) ), :=( T, X ), :=( U, Y )
% 0.40/1.07 , :=( W, Z ), :=( V0, T ), :=( V1, equivalent( equivalent( W, V0 ), V1 )
% 0.40/1.07 )] )).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 subsumption(
% 0.40/1.07 clause( 7, [ 'is_a_theorem'( equivalent( equivalent( equivalent( equivalent(
% 0.40/1.07 X, equivalent( equivalent( Y, Z ), equivalent( Y, T ) ) ), equivalent( X
% 0.40/1.07 , equivalent( Z, T ) ) ), equivalent( equivalent( equivalent( U, W ),
% 0.40/1.07 equivalent( U, V0 ) ), V1 ) ), equivalent( equivalent( W, V0 ), V1 ) ) )
% 0.40/1.07 ] )
% 0.40/1.07 , clause( 741, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.40/1.07 equivalent( X, equivalent( equivalent( Y, Z ), equivalent( Y, T ) ) ),
% 0.40/1.07 equivalent( X, equivalent( Z, T ) ) ), equivalent( equivalent( equivalent(
% 0.40/1.07 U, W ), equivalent( U, V0 ) ), V1 ) ), equivalent( equivalent( W, V0 ),
% 0.40/1.07 V1 ) ) ) ] )
% 0.40/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.40/1.07 , U ), :=( W, W ), :=( V0, V0 ), :=( V1, V1 )] ), permutation( 0, [ ==>(
% 0.40/1.07 0, 0 )] ) ).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 resolution(
% 0.40/1.07 clause( 743, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.40/1.07 equivalent( equivalent( X, Y ), equivalent( X, Z ) ), equivalent(
% 0.40/1.07 equivalent( equivalent( T, equivalent( equivalent( U, W ), equivalent( U
% 0.40/1.07 , V0 ) ) ), equivalent( T, equivalent( W, V0 ) ) ), V1 ) ), equivalent(
% 0.40/1.07 equivalent( Y, Z ), V1 ) ), V2 ) ) ), 'is_a_theorem'( V2 ) ] )
% 0.40/1.07 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.40/1.07 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.40/1.07 , 2, clause( 6, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.40/1.07 equivalent( X, Y ), equivalent( X, Z ) ), equivalent( equivalent(
% 0.40/1.07 equivalent( T, equivalent( equivalent( U, W ), equivalent( U, V0 ) ) ),
% 0.40/1.07 equivalent( T, equivalent( W, V0 ) ) ), V1 ) ), equivalent( equivalent( Y
% 0.40/1.07 , Z ), V1 ) ) ) ] )
% 0.40/1.07 , 0, substitution( 0, [ :=( X, equivalent( equivalent( equivalent(
% 0.40/1.07 equivalent( X, Y ), equivalent( X, Z ) ), equivalent( equivalent(
% 0.40/1.07 equivalent( T, equivalent( equivalent( U, W ), equivalent( U, V0 ) ) ),
% 0.40/1.07 equivalent( T, equivalent( W, V0 ) ) ), V1 ) ), equivalent( equivalent( Y
% 0.40/1.07 , Z ), V1 ) ) ), :=( Y, V2 )] ), substitution( 1, [ :=( X, X ), :=( Y, Y
% 0.40/1.07 ), :=( Z, Z ), :=( T, T ), :=( U, U ), :=( W, W ), :=( V0, V0 ), :=( V1
% 0.40/1.07 , V1 )] )).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 subsumption(
% 0.40/1.07 clause( 8, [ 'is_a_theorem'( V2 ), ~( 'is_a_theorem'( equivalent(
% 0.40/1.07 equivalent( equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z
% 0.40/1.07 ) ), equivalent( equivalent( equivalent( T, equivalent( equivalent( U, W
% 0.40/1.07 ), equivalent( U, V0 ) ) ), equivalent( T, equivalent( W, V0 ) ) ), V1 )
% 0.40/1.07 ), equivalent( equivalent( Y, Z ), V1 ) ), V2 ) ) ) ] )
% 0.40/1.07 , clause( 743, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.40/1.07 equivalent( equivalent( X, Y ), equivalent( X, Z ) ), equivalent(
% 0.40/1.07 equivalent( equivalent( T, equivalent( equivalent( U, W ), equivalent( U
% 0.40/1.07 , V0 ) ) ), equivalent( T, equivalent( W, V0 ) ) ), V1 ) ), equivalent(
% 0.40/1.07 equivalent( Y, Z ), V1 ) ), V2 ) ) ), 'is_a_theorem'( V2 ) ] )
% 0.40/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.40/1.07 , U ), :=( W, W ), :=( V0, V0 ), :=( V1, V1 ), :=( V2, V2 )] ),
% 0.40/1.07 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 resolution(
% 0.40/1.07 clause( 744, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.40/1.07 Z ), equivalent( equivalent( equivalent( T, X ), equivalent( T, Y ) ), Z
% 0.40/1.07 ) ) ) ] )
% 0.40/1.07 , clause( 8, [ 'is_a_theorem'( V2 ), ~( 'is_a_theorem'( equivalent(
% 0.40/1.07 equivalent( equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z
% 0.40/1.07 ) ), equivalent( equivalent( equivalent( T, equivalent( equivalent( U, W
% 0.40/1.07 ), equivalent( U, V0 ) ) ), equivalent( T, equivalent( W, V0 ) ) ), V1 )
% 0.40/1.07 ), equivalent( equivalent( Y, Z ), V1 ) ), V2 ) ) ) ] )
% 0.40/1.07 , 1, clause( 7, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.40/1.07 equivalent( X, equivalent( equivalent( Y, Z ), equivalent( Y, T ) ) ),
% 0.40/1.07 equivalent( X, equivalent( Z, T ) ) ), equivalent( equivalent( equivalent(
% 0.40/1.07 U, W ), equivalent( U, V0 ) ), V1 ) ), equivalent( equivalent( W, V0 ),
% 0.40/1.07 V1 ) ) ) ] )
% 0.40/1.07 , 0, substitution( 0, [ :=( X, equivalent( U, equivalent( equivalent( T, X
% 0.40/1.07 ), equivalent( T, Y ) ) ) ), :=( Y, equivalent( U, equivalent( X, Y ) )
% 0.40/1.07 ), :=( Z, equivalent( U, Z ) ), :=( T, U ), :=( U, T ), :=( W, X ), :=(
% 0.40/1.07 V0, Y ), :=( V1, equivalent( equivalent( equivalent( T, X ), equivalent(
% 0.40/1.07 T, Y ) ), Z ) ), :=( V2, equivalent( equivalent( equivalent( X, Y ), Z )
% 0.40/1.07 , equivalent( equivalent( equivalent( T, X ), equivalent( T, Y ) ), Z ) )
% 0.40/1.07 )] ), substitution( 1, [ :=( X, equivalent( equivalent( U, equivalent(
% 0.40/1.07 equivalent( T, X ), equivalent( T, Y ) ) ), equivalent( U, equivalent( X
% 0.40/1.07 , Y ) ) ) ), :=( Y, U ), :=( Z, equivalent( equivalent( T, X ),
% 0.40/1.07 equivalent( T, Y ) ) ), :=( T, Z ), :=( U, U ), :=( W, equivalent( X, Y )
% 0.40/1.07 ), :=( V0, Z ), :=( V1, equivalent( equivalent( equivalent( T, X ),
% 0.40/1.07 equivalent( T, Y ) ), Z ) )] )).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 subsumption(
% 0.40/1.07 clause( 17, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ), Z
% 0.40/1.07 ), equivalent( equivalent( equivalent( T, X ), equivalent( T, Y ) ), Z )
% 0.40/1.07 ) ) ] )
% 0.40/1.07 , clause( 744, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y )
% 0.40/1.07 , Z ), equivalent( equivalent( equivalent( T, X ), equivalent( T, Y ) ),
% 0.40/1.07 Z ) ) ) ] )
% 0.40/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.40/1.07 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 resolution(
% 0.40/1.07 clause( 746, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.40/1.07 equivalent( X, Y ), Z ), equivalent( equivalent( equivalent( T, X ),
% 0.40/1.07 equivalent( T, Y ) ), Z ) ), U ) ) ), 'is_a_theorem'( U ) ] )
% 0.40/1.07 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.40/1.07 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.40/1.07 , 2, clause( 17, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.40/1.07 ), Z ), equivalent( equivalent( equivalent( T, X ), equivalent( T, Y ) )
% 0.40/1.07 , Z ) ) ) ] )
% 0.40/1.07 , 0, substitution( 0, [ :=( X, equivalent( equivalent( equivalent( X, Y ),
% 0.40/1.07 Z ), equivalent( equivalent( equivalent( T, X ), equivalent( T, Y ) ), Z
% 0.40/1.07 ) ) ), :=( Y, U )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z,
% 0.40/1.07 Z ), :=( T, T )] )).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 subsumption(
% 0.40/1.07 clause( 23, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.40/1.07 equivalent( equivalent( equivalent( X, Y ), Z ), equivalent( equivalent(
% 0.40/1.07 equivalent( T, X ), equivalent( T, Y ) ), Z ) ), U ) ) ) ] )
% 0.40/1.07 , clause( 746, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.40/1.07 equivalent( X, Y ), Z ), equivalent( equivalent( equivalent( T, X ),
% 0.40/1.07 equivalent( T, Y ) ), Z ) ), U ) ) ), 'is_a_theorem'( U ) ] )
% 0.40/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.40/1.07 , U )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 resolution(
% 0.40/1.07 clause( 747, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.40/1.07 equivalent( Y, Z ), equivalent( Y, T ) ) ), equivalent( X, equivalent( Z
% 0.40/1.07 , T ) ) ) ) ] )
% 0.40/1.07 , clause( 23, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.40/1.07 equivalent( equivalent( equivalent( X, Y ), Z ), equivalent( equivalent(
% 0.40/1.07 equivalent( T, X ), equivalent( T, Y ) ), Z ) ), U ) ) ) ] )
% 0.40/1.07 , 1, clause( 7, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.40/1.07 equivalent( X, equivalent( equivalent( Y, Z ), equivalent( Y, T ) ) ),
% 0.40/1.07 equivalent( X, equivalent( Z, T ) ) ), equivalent( equivalent( equivalent(
% 0.40/1.07 U, W ), equivalent( U, V0 ) ), V1 ) ), equivalent( equivalent( W, V0 ),
% 0.40/1.07 V1 ) ) ) ] )
% 0.40/1.07 , 0, substitution( 0, [ :=( X, X ), :=( Y, equivalent( equivalent( Y, Z ),
% 0.40/1.07 equivalent( Y, T ) ) ), :=( Z, equivalent( X, equivalent( Z, T ) ) ),
% 0.40/1.07 :=( T, U ), :=( U, equivalent( equivalent( X, equivalent( equivalent( Y,
% 0.40/1.07 Z ), equivalent( Y, T ) ) ), equivalent( X, equivalent( Z, T ) ) ) )] ),
% 0.40/1.07 substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.40/1.07 , U ), :=( W, X ), :=( V0, equivalent( equivalent( Y, Z ), equivalent( Y
% 0.40/1.07 , T ) ) ), :=( V1, equivalent( X, equivalent( Z, T ) ) )] )).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 subsumption(
% 0.40/1.07 clause( 27, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.40/1.07 equivalent( Y, Z ), equivalent( Y, T ) ) ), equivalent( X, equivalent( Z
% 0.40/1.07 , T ) ) ) ) ] )
% 0.40/1.07 , clause( 747, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.40/1.07 equivalent( Y, Z ), equivalent( Y, T ) ) ), equivalent( X, equivalent( Z
% 0.40/1.07 , T ) ) ) ) ] )
% 0.40/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.40/1.07 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 resolution(
% 0.40/1.07 clause( 748, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.40/1.07 equivalent( X, equivalent( Y, Z ) ), equivalent( X, equivalent( Y, T ) )
% 0.40/1.07 ), U ), equivalent( equivalent( Z, T ), U ) ) ) ] )
% 0.40/1.07 , clause( 23, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.40/1.07 equivalent( equivalent( equivalent( X, Y ), Z ), equivalent( equivalent(
% 0.40/1.07 equivalent( T, X ), equivalent( T, Y ) ), Z ) ), U ) ) ) ] )
% 0.40/1.07 , 1, clause( 1, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.40/1.07 equivalent( X, Y ), Z ), equivalent( equivalent( T, U ), equivalent(
% 0.40/1.07 equivalent( equivalent( W, U ), equivalent( W, T ) ), V0 ) ) ),
% 0.40/1.07 equivalent( Z, equivalent( equivalent( Y, X ), V0 ) ) ) ) ] )
% 0.40/1.07 , 0, substitution( 0, [ :=( X, T ), :=( Y, Z ), :=( Z, equivalent(
% 0.40/1.07 equivalent( equivalent( X, equivalent( Y, Z ) ), equivalent( X,
% 0.40/1.07 equivalent( Y, T ) ) ), U ) ), :=( T, Y ), :=( U, equivalent( equivalent(
% 0.40/1.07 equivalent( equivalent( X, equivalent( Y, Z ) ), equivalent( X,
% 0.40/1.07 equivalent( Y, T ) ) ), U ), equivalent( equivalent( Z, T ), U ) ) )] ),
% 0.40/1.07 substitution( 1, [ :=( X, T ), :=( Y, Z ), :=( Z, equivalent( equivalent(
% 0.40/1.07 equivalent( X, equivalent( Y, Z ) ), equivalent( X, equivalent( Y, T ) )
% 0.40/1.07 ), U ) ), :=( T, equivalent( Y, T ) ), :=( U, equivalent( Y, Z ) ), :=(
% 0.40/1.07 W, X ), :=( V0, U )] )).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 subsumption(
% 0.40/1.07 clause( 28, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.40/1.07 equivalent( X, equivalent( Y, Z ) ), equivalent( X, equivalent( Y, T ) )
% 0.40/1.07 ), U ), equivalent( equivalent( Z, T ), U ) ) ) ] )
% 0.40/1.07 , clause( 748, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.40/1.07 equivalent( X, equivalent( Y, Z ) ), equivalent( X, equivalent( Y, T ) )
% 0.40/1.07 ), U ), equivalent( equivalent( Z, T ), U ) ) ) ] )
% 0.40/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.40/1.07 , U )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 resolution(
% 0.40/1.07 clause( 749, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.40/1.07 equivalent( equivalent( Z, X ), T ) ), equivalent( equivalent( Z, Y ), T
% 0.40/1.07 ) ) ) ] )
% 0.40/1.07 , clause( 23, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.40/1.07 equivalent( equivalent( equivalent( X, Y ), Z ), equivalent( equivalent(
% 0.40/1.07 equivalent( T, X ), equivalent( T, Y ) ), Z ) ), U ) ) ) ] )
% 0.40/1.07 , 1, clause( 27, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.40/1.07 equivalent( Y, Z ), equivalent( Y, T ) ) ), equivalent( X, equivalent( Z
% 0.40/1.07 , T ) ) ) ) ] )
% 0.40/1.07 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, equivalent(
% 0.40/1.07 equivalent( Z, X ), T ) ), :=( T, Z ), :=( U, equivalent( equivalent(
% 0.40/1.07 equivalent( X, Y ), equivalent( equivalent( Z, X ), T ) ), equivalent(
% 0.40/1.07 equivalent( Z, Y ), T ) ) )] ), substitution( 1, [ :=( X, equivalent(
% 0.40/1.07 equivalent( X, Y ), equivalent( equivalent( Z, X ), T ) ) ), :=( Y,
% 0.40/1.07 equivalent( Z, X ) ), :=( Z, equivalent( Z, Y ) ), :=( T, T )] )).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 subsumption(
% 0.40/1.07 clause( 42, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.40/1.07 equivalent( equivalent( Z, X ), T ) ), equivalent( equivalent( Z, Y ), T
% 0.40/1.07 ) ) ) ] )
% 0.40/1.07 , clause( 749, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y )
% 0.40/1.07 , equivalent( equivalent( Z, X ), T ) ), equivalent( equivalent( Z, Y ),
% 0.40/1.07 T ) ) ) ] )
% 0.40/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.40/1.07 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 resolution(
% 0.40/1.07 clause( 751, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( X,
% 0.40/1.07 equivalent( equivalent( Y, Z ), equivalent( Y, T ) ) ), equivalent( X,
% 0.40/1.07 equivalent( Z, T ) ) ), U ) ) ), 'is_a_theorem'( U ) ] )
% 0.40/1.07 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.40/1.07 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.40/1.07 , 2, clause( 27, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.40/1.07 equivalent( Y, Z ), equivalent( Y, T ) ) ), equivalent( X, equivalent( Z
% 0.40/1.07 , T ) ) ) ) ] )
% 0.40/1.07 , 0, substitution( 0, [ :=( X, equivalent( equivalent( X, equivalent(
% 0.40/1.07 equivalent( Y, Z ), equivalent( Y, T ) ) ), equivalent( X, equivalent( Z
% 0.40/1.07 , T ) ) ) ), :=( Y, U )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ),
% 0.40/1.07 :=( Z, Z ), :=( T, T )] )).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 subsumption(
% 0.40/1.07 clause( 46, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.40/1.07 equivalent( equivalent( X, equivalent( equivalent( Y, Z ), equivalent( Y
% 0.40/1.07 , T ) ) ), equivalent( X, equivalent( Z, T ) ) ), U ) ) ) ] )
% 0.40/1.07 , clause( 751, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( X,
% 0.40/1.07 equivalent( equivalent( Y, Z ), equivalent( Y, T ) ) ), equivalent( X,
% 0.40/1.07 equivalent( Z, T ) ) ), U ) ) ), 'is_a_theorem'( U ) ] )
% 0.40/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.40/1.07 , U )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 resolution(
% 0.40/1.07 clause( 752, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, X ),
% 0.40/1.07 Y ), Y ) ) ] )
% 0.40/1.07 , clause( 23, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.40/1.07 equivalent( equivalent( equivalent( X, Y ), Z ), equivalent( equivalent(
% 0.40/1.07 equivalent( T, X ), equivalent( T, Y ) ), Z ) ), U ) ) ) ] )
% 0.40/1.07 , 1, clause( 42, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.40/1.07 ), equivalent( equivalent( Z, X ), T ) ), equivalent( equivalent( Z, Y )
% 0.40/1.07 , T ) ) ) ] )
% 0.40/1.07 , 0, substitution( 0, [ :=( X, X ), :=( Y, Z ), :=( Z, Y ), :=( T, X ),
% 0.40/1.07 :=( U, equivalent( equivalent( equivalent( X, X ), Y ), Y ) )] ),
% 0.40/1.07 substitution( 1, [ :=( X, equivalent( X, Z ) ), :=( Y, Y ), :=( Z,
% 0.40/1.07 equivalent( X, X ) ), :=( T, Y )] )).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 subsumption(
% 0.40/1.07 clause( 48, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, X ), Y
% 0.40/1.07 ), Y ) ) ] )
% 0.40/1.07 , clause( 752, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, X )
% 0.40/1.07 , Y ), Y ) ) ] )
% 0.40/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.40/1.07 )] ) ).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 resolution(
% 0.40/1.07 clause( 754, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.40/1.07 equivalent( X, X ), Y ), Y ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.40/1.07 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.40/1.07 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.40/1.07 , 2, clause( 48, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, X
% 0.40/1.07 ), Y ), Y ) ) ] )
% 0.40/1.07 , 0, substitution( 0, [ :=( X, equivalent( equivalent( equivalent( X, X ),
% 0.40/1.07 Y ), Y ) ), :=( Y, Z )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )
% 0.40/1.07 ).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 subsumption(
% 0.40/1.07 clause( 54, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( equivalent(
% 0.40/1.07 equivalent( equivalent( equivalent( X, X ), Y ), Y ), Z ) ) ) ] )
% 0.40/1.07 , clause( 754, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.40/1.07 equivalent( X, X ), Y ), Y ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.40/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.40/1.07 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 resolution(
% 0.40/1.07 clause( 755, [ 'is_a_theorem'( equivalent( X, X ) ) ] )
% 0.40/1.07 , clause( 54, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( equivalent(
% 0.40/1.07 equivalent( equivalent( equivalent( X, X ), Y ), Y ), Z ) ) ) ] )
% 0.40/1.07 , 1, clause( 48, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, X
% 0.40/1.07 ), Y ), Y ) ) ] )
% 0.40/1.07 , 0, substitution( 0, [ :=( X, X ), :=( Y, equivalent( X, X ) ), :=( Z,
% 0.40/1.07 equivalent( X, X ) )] ), substitution( 1, [ :=( X, equivalent( X, X ) ),
% 0.40/1.07 :=( Y, equivalent( X, X ) )] )).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 subsumption(
% 0.40/1.07 clause( 72, [ 'is_a_theorem'( equivalent( X, X ) ) ] )
% 0.40/1.07 , clause( 755, [ 'is_a_theorem'( equivalent( X, X ) ) ] )
% 0.40/1.07 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 resolution(
% 0.40/1.07 clause( 757, [ ~( 'is_a_theorem'( equivalent( equivalent( X, X ), Y ) ) ),
% 0.40/1.07 'is_a_theorem'( Y ) ] )
% 0.40/1.07 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.40/1.07 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.40/1.07 , 2, clause( 72, [ 'is_a_theorem'( equivalent( X, X ) ) ] )
% 0.40/1.07 , 0, substitution( 0, [ :=( X, equivalent( X, X ) ), :=( Y, Y )] ),
% 0.40/1.07 substitution( 1, [ :=( X, X )] )).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 subsumption(
% 0.40/1.07 clause( 79, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( equivalent(
% 0.40/1.07 equivalent( X, X ), Y ) ) ) ] )
% 0.40/1.07 , clause( 757, [ ~( 'is_a_theorem'( equivalent( equivalent( X, X ), Y ) ) )
% 0.40/1.07 , 'is_a_theorem'( Y ) ] )
% 0.40/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.40/1.07 ), ==>( 1, 0 )] ) ).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 resolution(
% 0.40/1.07 clause( 758, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.40/1.07 equivalent( Z, equivalent( T, X ) ), equivalent( Z, equivalent( T, Y ) )
% 0.40/1.07 ) ) ) ] )
% 0.40/1.07 , clause( 79, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( equivalent(
% 0.40/1.07 equivalent( X, X ), Y ) ) ) ] )
% 0.40/1.07 , 1, clause( 28, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.40/1.07 equivalent( X, equivalent( Y, Z ) ), equivalent( X, equivalent( Y, T ) )
% 0.40/1.07 ), U ), equivalent( equivalent( Z, T ), U ) ) ) ] )
% 0.40/1.07 , 0, substitution( 0, [ :=( X, equivalent( equivalent( Z, equivalent( T, X
% 0.40/1.07 ) ), equivalent( Z, equivalent( T, Y ) ) ) ), :=( Y, equivalent(
% 0.40/1.07 equivalent( X, Y ), equivalent( equivalent( Z, equivalent( T, X ) ),
% 0.40/1.07 equivalent( Z, equivalent( T, Y ) ) ) ) )] ), substitution( 1, [ :=( X, Z
% 0.40/1.07 ), :=( Y, T ), :=( Z, X ), :=( T, Y ), :=( U, equivalent( equivalent( Z
% 0.40/1.07 , equivalent( T, X ) ), equivalent( Z, equivalent( T, Y ) ) ) )] )).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 subsumption(
% 0.40/1.07 clause( 301, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.40/1.07 equivalent( Z, equivalent( T, X ) ), equivalent( Z, equivalent( T, Y ) )
% 0.40/1.07 ) ) ) ] )
% 0.40/1.07 , clause( 758, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.40/1.07 equivalent( Z, equivalent( T, X ) ), equivalent( Z, equivalent( T, Y ) )
% 0.40/1.07 ) ) ) ] )
% 0.40/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.40/1.07 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 resolution(
% 0.40/1.07 clause( 759, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y,
% 0.40/1.07 equivalent( equivalent( Z, Z ), T ) ) ), equivalent( X, equivalent( Y, T
% 0.40/1.07 ) ) ) ) ] )
% 0.40/1.07 , clause( 54, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( equivalent(
% 0.40/1.07 equivalent( equivalent( equivalent( X, X ), Y ), Y ), Z ) ) ) ] )
% 0.40/1.07 , 1, clause( 301, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.40/1.07 equivalent( equivalent( Z, equivalent( T, X ) ), equivalent( Z,
% 0.40/1.07 equivalent( T, Y ) ) ) ) ) ] )
% 0.40/1.07 , 0, substitution( 0, [ :=( X, Z ), :=( Y, T ), :=( Z, equivalent(
% 0.40/1.07 equivalent( X, equivalent( Y, equivalent( equivalent( Z, Z ), T ) ) ),
% 0.40/1.07 equivalent( X, equivalent( Y, T ) ) ) )] ), substitution( 1, [ :=( X,
% 0.40/1.07 equivalent( equivalent( Z, Z ), T ) ), :=( Y, T ), :=( Z, X ), :=( T, Y )] )
% 0.40/1.07 ).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 subsumption(
% 0.40/1.07 clause( 309, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y,
% 0.40/1.07 equivalent( equivalent( Z, Z ), T ) ) ), equivalent( X, equivalent( Y, T
% 0.40/1.07 ) ) ) ) ] )
% 0.40/1.07 , clause( 759, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y,
% 0.40/1.07 equivalent( equivalent( Z, Z ), T ) ) ), equivalent( X, equivalent( Y, T
% 0.40/1.07 ) ) ) ) ] )
% 0.40/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.40/1.07 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 resolution(
% 0.40/1.07 clause( 760, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.40/1.07 equivalent( Y, equivalent( Z, Z ) ), equivalent( Y, T ) ) ), equivalent(
% 0.40/1.07 X, T ) ) ) ] )
% 0.40/1.07 , clause( 46, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.40/1.07 equivalent( equivalent( X, equivalent( equivalent( Y, Z ), equivalent( Y
% 0.40/1.07 , T ) ) ), equivalent( X, equivalent( Z, T ) ) ), U ) ) ) ] )
% 0.40/1.07 , 1, clause( 309, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.40/1.07 Y, equivalent( equivalent( Z, Z ), T ) ) ), equivalent( X, equivalent( Y
% 0.40/1.07 , T ) ) ) ) ] )
% 0.40/1.07 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, equivalent( Z, Z ) )
% 0.40/1.07 , :=( T, T ), :=( U, equivalent( equivalent( X, equivalent( equivalent( Y
% 0.40/1.07 , equivalent( Z, Z ) ), equivalent( Y, T ) ) ), equivalent( X, T ) ) )] )
% 0.40/1.07 , substitution( 1, [ :=( X, equivalent( X, equivalent( equivalent( Y,
% 0.40/1.07 equivalent( Z, Z ) ), equivalent( Y, T ) ) ) ), :=( Y, X ), :=( Z, Z ),
% 0.40/1.07 :=( T, T )] )).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 subsumption(
% 0.40/1.07 clause( 695, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.40/1.07 equivalent( Y, equivalent( Z, Z ) ), equivalent( Y, T ) ) ), equivalent(
% 0.40/1.07 X, T ) ) ) ] )
% 0.40/1.07 , clause( 760, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.40/1.07 equivalent( Y, equivalent( Z, Z ) ), equivalent( Y, T ) ) ), equivalent(
% 0.40/1.07 X, T ) ) ) ] )
% 0.40/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.40/1.07 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 resolution(
% 0.40/1.07 clause( 761, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.40/1.07 equivalent( equivalent( Y, X ), Z ) ), Z ) ) ] )
% 0.40/1.07 , clause( 23, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.40/1.07 equivalent( equivalent( equivalent( X, Y ), Z ), equivalent( equivalent(
% 0.40/1.07 equivalent( T, X ), equivalent( T, Y ) ), Z ) ), U ) ) ) ] )
% 0.40/1.07 , 1, clause( 695, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.40/1.07 equivalent( Y, equivalent( Z, Z ) ), equivalent( Y, T ) ) ), equivalent(
% 0.40/1.07 X, T ) ) ) ] )
% 0.40/1.07 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, equivalent(
% 0.40/1.07 equivalent( Y, X ), Z ) ), :=( T, Y ), :=( U, equivalent( equivalent(
% 0.40/1.07 equivalent( X, Y ), equivalent( equivalent( Y, X ), Z ) ), Z ) )] ),
% 0.40/1.07 substitution( 1, [ :=( X, equivalent( equivalent( X, Y ), equivalent(
% 0.40/1.07 equivalent( Y, X ), Z ) ) ), :=( Y, equivalent( Y, X ) ), :=( Z, Y ),
% 0.40/1.07 :=( T, Z )] )).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 subsumption(
% 0.40/1.07 clause( 725, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.40/1.07 equivalent( equivalent( Y, X ), Z ) ), Z ) ) ] )
% 0.40/1.07 , clause( 761, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y )
% 0.40/1.07 , equivalent( equivalent( Y, X ), Z ) ), Z ) ) ] )
% 0.40/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.40/1.07 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 resolution(
% 0.40/1.07 clause( 762, [] )
% 0.40/1.07 , clause( 2, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( a, b
% 0.40/1.07 ), equivalent( equivalent( b, a ), c ) ), c ) ) ) ] )
% 0.40/1.07 , 0, clause( 725, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X,
% 0.40/1.07 Y ), equivalent( equivalent( Y, X ), Z ) ), Z ) ) ] )
% 0.40/1.07 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, a ), :=( Y, b ), :=(
% 0.40/1.07 Z, c )] )).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 subsumption(
% 0.40/1.07 clause( 730, [] )
% 0.40/1.07 , clause( 762, [] )
% 0.40/1.07 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 end.
% 0.40/1.07
% 0.40/1.07 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.40/1.07
% 0.40/1.07 Memory use:
% 0.40/1.07
% 0.40/1.07 space for terms: 18266
% 0.40/1.07 space for clauses: 95216
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 clauses generated: 1520
% 0.40/1.07 clauses kept: 731
% 0.40/1.07 clauses selected: 163
% 0.40/1.07 clauses deleted: 1
% 0.40/1.07 clauses inuse deleted: 0
% 0.40/1.07
% 0.40/1.07 subsentry: 958
% 0.40/1.07 literals s-matched: 792
% 0.40/1.07 literals matched: 791
% 0.40/1.07 full subsumption: 0
% 0.40/1.07
% 0.40/1.07 checksum: -2057090910
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 Bliksem ended
%------------------------------------------------------------------------------