TSTP Solution File: LCL101-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL101-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n020.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:19 EDT 2022
% Result : Unsatisfiable 0.77s 1.15s
% Output : Refutation 0.77s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LCL101-1 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.13 % Command : bliksem %s
% 0.13/0.35 % Computer : n020.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % DateTime : Sat Jul 2 23:42:00 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.77/1.14 *** allocated 10000 integers for termspace/termends
% 0.77/1.14 *** allocated 10000 integers for clauses
% 0.77/1.14 *** allocated 10000 integers for justifications
% 0.77/1.14 Bliksem 1.12
% 0.77/1.14
% 0.77/1.14
% 0.77/1.14 Automatic Strategy Selection
% 0.77/1.14
% 0.77/1.14 Clauses:
% 0.77/1.14 [
% 0.77/1.14 [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), ~( 'is_a_theorem'( X ) ),
% 0.77/1.14 'is_a_theorem'( Y ) ],
% 0.77/1.14 [ 'is_a_theorem'( equivalent( equivalent( equivalent( equivalent(
% 0.77/1.14 equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z ) ), T ), T )
% 0.77/1.14 ) ],
% 0.77/1.14 [ 'is_a_theorem'( equivalent( X, equivalent( equivalent( equivalent(
% 0.77/1.14 equivalent( Y, Z ), equivalent( Y, T ) ), equivalent( Z, T ) ), X ) ) ) ]
% 0.77/1.14 ,
% 0.77/1.14 [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( a, b ), c ),
% 0.77/1.14 equivalent( equivalent( e, b ), equivalent( equivalent( a, e ), c ) ) ) )
% 0.77/1.14 ) ]
% 0.77/1.14 ] .
% 0.77/1.14
% 0.77/1.14
% 0.77/1.14 percentage equality = 0.000000, percentage horn = 1.000000
% 0.77/1.14 This is a near-Horn, non-equality problem
% 0.77/1.14
% 0.77/1.14
% 0.77/1.14 Options Used:
% 0.77/1.14
% 0.77/1.14 useres = 1
% 0.77/1.14 useparamod = 0
% 0.77/1.14 useeqrefl = 0
% 0.77/1.14 useeqfact = 0
% 0.77/1.14 usefactor = 1
% 0.77/1.14 usesimpsplitting = 0
% 0.77/1.14 usesimpdemod = 0
% 0.77/1.15 usesimpres = 4
% 0.77/1.15
% 0.77/1.15 resimpinuse = 1000
% 0.77/1.15 resimpclauses = 20000
% 0.77/1.15 substype = standard
% 0.77/1.15 backwardsubs = 1
% 0.77/1.15 selectoldest = 5
% 0.77/1.15
% 0.77/1.15 litorderings [0] = split
% 0.77/1.15 litorderings [1] = liftord
% 0.77/1.15
% 0.77/1.15 termordering = none
% 0.77/1.15
% 0.77/1.15 litapriori = 1
% 0.77/1.15 termapriori = 0
% 0.77/1.15 litaposteriori = 0
% 0.77/1.15 termaposteriori = 0
% 0.77/1.15 demodaposteriori = 0
% 0.77/1.15 ordereqreflfact = 0
% 0.77/1.15
% 0.77/1.15 litselect = negative
% 0.77/1.15
% 0.77/1.15 maxweight = 30000
% 0.77/1.15 maxdepth = 30000
% 0.77/1.15 maxlength = 115
% 0.77/1.15 maxnrvars = 195
% 0.77/1.15 excuselevel = 0
% 0.77/1.15 increasemaxweight = 0
% 0.77/1.15
% 0.77/1.15 maxselected = 10000000
% 0.77/1.15 maxnrclauses = 10000000
% 0.77/1.15
% 0.77/1.15 showgenerated = 0
% 0.77/1.15 showkept = 0
% 0.77/1.15 showselected = 0
% 0.77/1.15 showdeleted = 0
% 0.77/1.15 showresimp = 1
% 0.77/1.15 showstatus = 2000
% 0.77/1.15
% 0.77/1.15 prologoutput = 1
% 0.77/1.15 nrgoals = 5000000
% 0.77/1.15 totalproof = 1
% 0.77/1.15
% 0.77/1.15 Symbols occurring in the translation:
% 0.77/1.15
% 0.77/1.15 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.77/1.15 . [1, 2] (w:1, o:23, a:1, s:1, b:0),
% 0.77/1.15 ! [4, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.77/1.15 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.77/1.15 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.77/1.15 equivalent [41, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.77/1.15 'is_a_theorem' [42, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.77/1.15 a [45, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.77/1.15 b [46, 0] (w:1, o:14, a:1, s:1, b:0),
% 0.77/1.15 c [47, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.77/1.15 e [48, 0] (w:1, o:16, a:1, s:1, b:0).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 Starting Search:
% 0.77/1.15
% 0.77/1.15 Resimplifying inuse:
% 0.77/1.15
% 0.77/1.15 Bliksems!, er is een bewijs:
% 0.77/1.15 % SZS status Unsatisfiable
% 0.77/1.15 % SZS output start Refutation
% 0.77/1.15
% 0.77/1.15 clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.77/1.15 , ~( 'is_a_theorem'( X ) ) ] )
% 0.77/1.15 .
% 0.77/1.15 clause( 1, [ 'is_a_theorem'( equivalent( equivalent( equivalent( equivalent(
% 0.77/1.15 equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z ) ), T ), T )
% 0.77/1.15 ) ] )
% 0.77/1.15 .
% 0.77/1.15 clause( 2, [ 'is_a_theorem'( equivalent( X, equivalent( equivalent(
% 0.77/1.15 equivalent( equivalent( Y, Z ), equivalent( Y, T ) ), equivalent( Z, T )
% 0.77/1.15 ), X ) ) ) ] )
% 0.77/1.15 .
% 0.77/1.15 clause( 3, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( a, b )
% 0.77/1.15 , c ), equivalent( equivalent( e, b ), equivalent( equivalent( a, e ), c
% 0.77/1.15 ) ) ) ) ) ] )
% 0.77/1.15 .
% 0.77/1.15 clause( 4, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent( equivalent(
% 0.77/1.15 X, equivalent( equivalent( equivalent( equivalent( Y, Z ), equivalent( Y
% 0.77/1.15 , T ) ), equivalent( Z, T ) ), X ) ), U ) ) ) ] )
% 0.77/1.15 .
% 0.77/1.15 clause( 5, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent( equivalent(
% 0.77/1.15 equivalent( equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z
% 0.77/1.15 ) ), equivalent( Y, Z ) ), T ), T ), U ) ) ) ] )
% 0.77/1.15 .
% 0.77/1.15 clause( 6, [ 'is_a_theorem'( equivalent( equivalent( equivalent( equivalent(
% 0.77/1.15 X, Y ), equivalent( X, Z ) ), equivalent( Y, Z ) ), equivalent(
% 0.77/1.15 equivalent( equivalent( equivalent( equivalent( T, U ), equivalent( T, W
% 0.77/1.15 ) ), equivalent( U, W ) ), V0 ), V0 ) ) ) ] )
% 0.77/1.15 .
% 0.77/1.15 clause( 7, [ 'is_a_theorem'( equivalent( equivalent( equivalent( equivalent(
% 0.77/1.15 X, Y ), equivalent( X, Z ) ), equivalent( Y, Z ) ), equivalent(
% 0.77/1.15 equivalent( equivalent( T, U ), equivalent( T, W ) ), equivalent( U, W )
% 0.77/1.15 ) ) ) ] )
% 0.77/1.15 .
% 0.77/1.15 clause( 8, [ 'is_a_theorem'( equivalent( equivalent( equivalent( equivalent(
% 0.77/1.15 X, Y ), equivalent( X, Z ) ), equivalent( Y, Z ) ), equivalent( T,
% 0.77/1.15 equivalent( equivalent( equivalent( equivalent( U, W ), equivalent( U, V0
% 0.77/1.15 ) ), equivalent( W, V0 ) ), T ) ) ) ) ] )
% 0.77/1.15 .
% 0.77/1.15 clause( 9, [ 'is_a_theorem'( V0 ), ~( 'is_a_theorem'( equivalent(
% 0.77/1.15 equivalent( equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z
% 0.77/1.15 ) ), equivalent( Y, Z ) ), equivalent( equivalent( equivalent( T, U ),
% 0.77/1.15 equivalent( T, W ) ), equivalent( U, W ) ) ), V0 ) ) ) ] )
% 0.77/1.15 .
% 0.77/1.15 clause( 10, [ 'is_a_theorem'( V1 ), ~( 'is_a_theorem'( equivalent(
% 0.77/1.15 equivalent( equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z
% 0.77/1.15 ) ), equivalent( Y, Z ) ), equivalent( T, equivalent( equivalent(
% 0.77/1.15 equivalent( equivalent( U, W ), equivalent( U, V0 ) ), equivalent( W, V0
% 0.77/1.15 ) ), T ) ) ), V1 ) ) ) ] )
% 0.77/1.15 .
% 0.77/1.15 clause( 11, [ 'is_a_theorem'( V1 ), ~( 'is_a_theorem'( equivalent(
% 0.77/1.15 equivalent( equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z
% 0.77/1.15 ) ), equivalent( Y, Z ) ), equivalent( equivalent( equivalent(
% 0.77/1.15 equivalent( equivalent( T, U ), equivalent( T, W ) ), equivalent( U, W )
% 0.77/1.15 ), V0 ), V0 ) ), V1 ) ) ) ] )
% 0.77/1.15 .
% 0.77/1.15 clause( 12, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.77/1.15 equivalent( X, Z ) ), equivalent( Y, Z ) ) ) ] )
% 0.77/1.15 .
% 0.77/1.15 clause( 15, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.77/1.15 equivalent( equivalent( equivalent( Z, T ), equivalent( Z, U ) ),
% 0.77/1.15 equivalent( T, U ) ), equivalent( equivalent( W, X ), equivalent( W, Y )
% 0.77/1.15 ) ) ) ) ] )
% 0.77/1.15 .
% 0.77/1.15 clause( 16, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent( X
% 0.77/1.15 , Y ) ) ) ] )
% 0.77/1.15 .
% 0.77/1.15 clause( 18, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( equivalent(
% 0.77/1.15 equivalent( equivalent( X, Y ), equivalent( X, Y ) ), Z ) ) ) ] )
% 0.77/1.15 .
% 0.77/1.15 clause( 19, [ 'is_a_theorem'( equivalent( X, X ) ) ] )
% 0.77/1.15 .
% 0.77/1.15 clause( 21, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( equivalent(
% 0.77/1.15 equivalent( X, X ), Y ) ) ) ] )
% 0.77/1.15 .
% 0.77/1.15 clause( 22, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ), Z
% 0.77/1.15 ), equivalent( equivalent( equivalent( T, X ), equivalent( T, Y ) ), Z )
% 0.77/1.15 ) ) ] )
% 0.77/1.15 .
% 0.77/1.15 clause( 24, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.77/1.15 equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z ) ),
% 0.77/1.15 equivalent( T, T ) ) ) ] )
% 0.77/1.15 .
% 0.77/1.15 clause( 25, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.77/1.15 equivalent( equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z
% 0.77/1.15 ) ), equivalent( Y, Z ) ), equivalent( T, T ) ), U ) ) ) ] )
% 0.77/1.15 .
% 0.77/1.15 clause( 30, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X,
% 0.77/1.15 equivalent( equivalent( equivalent( Y, Z ), equivalent( Y, T ) ),
% 0.77/1.15 equivalent( Z, T ) ) ), equivalent( X, U ) ), U ) ) ] )
% 0.77/1.15 .
% 0.77/1.15 clause( 63, [ 'is_a_theorem'( V0 ), ~( 'is_a_theorem'( equivalent(
% 0.77/1.15 equivalent( equivalent( X, Y ), equivalent( equivalent( equivalent(
% 0.77/1.15 equivalent( Z, T ), equivalent( Z, U ) ), equivalent( T, U ) ),
% 0.77/1.15 equivalent( equivalent( W, X ), equivalent( W, Y ) ) ) ), V0 ) ) ) ] )
% 0.77/1.15 .
% 0.77/1.15 clause( 102, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.77/1.15 equivalent( Y, Z ), equivalent( Y, T ) ) ), equivalent( X, equivalent( Z
% 0.77/1.15 , T ) ) ) ) ] )
% 0.77/1.15 .
% 0.77/1.15 clause( 906, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.77/1.15 Z ), equivalent( equivalent( T, Y ), equivalent( equivalent( X, T ), Z )
% 0.77/1.15 ) ) ) ] )
% 0.77/1.15 .
% 0.77/1.15 clause( 1010, [] )
% 0.77/1.15 .
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 % SZS output end Refutation
% 0.77/1.15 found a proof!
% 0.77/1.15
% 0.77/1.15 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.77/1.15
% 0.77/1.15 initialclauses(
% 0.77/1.15 [ clause( 1012, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), ~(
% 0.77/1.15 'is_a_theorem'( X ) ), 'is_a_theorem'( Y ) ] )
% 0.77/1.15 , clause( 1013, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.77/1.15 equivalent( equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z )
% 0.77/1.15 ), T ), T ) ) ] )
% 0.77/1.15 , clause( 1014, [ 'is_a_theorem'( equivalent( X, equivalent( equivalent(
% 0.77/1.15 equivalent( equivalent( Y, Z ), equivalent( Y, T ) ), equivalent( Z, T )
% 0.77/1.15 ), X ) ) ) ] )
% 0.77/1.15 , clause( 1015, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( a
% 0.77/1.15 , b ), c ), equivalent( equivalent( e, b ), equivalent( equivalent( a, e
% 0.77/1.15 ), c ) ) ) ) ) ] )
% 0.77/1.15 ] ).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 subsumption(
% 0.77/1.15 clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.77/1.15 , ~( 'is_a_theorem'( X ) ) ] )
% 0.77/1.15 , clause( 1012, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), ~(
% 0.77/1.15 'is_a_theorem'( X ) ), 'is_a_theorem'( Y ) ] )
% 0.77/1.15 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.77/1.15 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 subsumption(
% 0.77/1.15 clause( 1, [ 'is_a_theorem'( equivalent( equivalent( equivalent( equivalent(
% 0.77/1.15 equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z ) ), T ), T )
% 0.77/1.15 ) ] )
% 0.77/1.15 , clause( 1013, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.77/1.15 equivalent( equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z )
% 0.77/1.15 ), T ), T ) ) ] )
% 0.77/1.15 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.77/1.15 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 subsumption(
% 0.77/1.15 clause( 2, [ 'is_a_theorem'( equivalent( X, equivalent( equivalent(
% 0.77/1.15 equivalent( equivalent( Y, Z ), equivalent( Y, T ) ), equivalent( Z, T )
% 0.77/1.15 ), X ) ) ) ] )
% 0.77/1.15 , clause( 1014, [ 'is_a_theorem'( equivalent( X, equivalent( equivalent(
% 0.77/1.15 equivalent( equivalent( Y, Z ), equivalent( Y, T ) ), equivalent( Z, T )
% 0.77/1.15 ), X ) ) ) ] )
% 0.77/1.15 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.77/1.15 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 subsumption(
% 0.77/1.15 clause( 3, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( a, b )
% 0.77/1.15 , c ), equivalent( equivalent( e, b ), equivalent( equivalent( a, e ), c
% 0.77/1.15 ) ) ) ) ) ] )
% 0.77/1.15 , clause( 1015, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( a
% 0.77/1.15 , b ), c ), equivalent( equivalent( e, b ), equivalent( equivalent( a, e
% 0.77/1.15 ), c ) ) ) ) ) ] )
% 0.77/1.15 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 resolution(
% 0.77/1.15 clause( 1017, [ ~( 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.77/1.15 equivalent( equivalent( equivalent( Y, Z ), equivalent( Y, T ) ),
% 0.77/1.15 equivalent( Z, T ) ), X ) ), U ) ) ), 'is_a_theorem'( U ) ] )
% 0.77/1.15 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.77/1.15 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.77/1.15 , 2, clause( 2, [ 'is_a_theorem'( equivalent( X, equivalent( equivalent(
% 0.77/1.15 equivalent( equivalent( Y, Z ), equivalent( Y, T ) ), equivalent( Z, T )
% 0.77/1.15 ), X ) ) ) ] )
% 0.77/1.15 , 0, substitution( 0, [ :=( X, equivalent( X, equivalent( equivalent(
% 0.77/1.15 equivalent( equivalent( Y, Z ), equivalent( Y, T ) ), equivalent( Z, T )
% 0.77/1.15 ), X ) ) ), :=( Y, U )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ),
% 0.77/1.15 :=( Z, Z ), :=( T, T )] )).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 subsumption(
% 0.77/1.15 clause( 4, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent( equivalent(
% 0.77/1.15 X, equivalent( equivalent( equivalent( equivalent( Y, Z ), equivalent( Y
% 0.77/1.15 , T ) ), equivalent( Z, T ) ), X ) ), U ) ) ) ] )
% 0.77/1.15 , clause( 1017, [ ~( 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.77/1.15 equivalent( equivalent( equivalent( Y, Z ), equivalent( Y, T ) ),
% 0.77/1.15 equivalent( Z, T ) ), X ) ), U ) ) ), 'is_a_theorem'( U ) ] )
% 0.77/1.15 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.77/1.15 , U )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 resolution(
% 0.77/1.15 clause( 1019, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.77/1.15 equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z ) ),
% 0.77/1.15 equivalent( Y, Z ) ), T ), T ), U ) ) ), 'is_a_theorem'( U ) ] )
% 0.77/1.15 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.77/1.15 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.77/1.15 , 2, clause( 1, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.77/1.15 equivalent( equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z )
% 0.77/1.15 ), T ), T ) ) ] )
% 0.77/1.15 , 0, substitution( 0, [ :=( X, equivalent( equivalent( equivalent(
% 0.77/1.15 equivalent( equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z )
% 0.77/1.15 ), T ), T ) ), :=( Y, U )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )
% 0.77/1.15 , :=( Z, Z ), :=( T, T )] )).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 subsumption(
% 0.77/1.15 clause( 5, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent( equivalent(
% 0.77/1.15 equivalent( equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z
% 0.77/1.15 ) ), equivalent( Y, Z ) ), T ), T ), U ) ) ) ] )
% 0.77/1.15 , clause( 1019, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.77/1.15 equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z ) ),
% 0.77/1.15 equivalent( Y, Z ) ), T ), T ), U ) ) ), 'is_a_theorem'( U ) ] )
% 0.77/1.15 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.77/1.15 , U )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 resolution(
% 0.77/1.15 clause( 1020, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.77/1.15 equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z ) ),
% 0.77/1.15 equivalent( equivalent( equivalent( equivalent( equivalent( T, U ),
% 0.77/1.15 equivalent( T, W ) ), equivalent( U, W ) ), V0 ), V0 ) ) ) ] )
% 0.77/1.15 , clause( 5, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.77/1.15 equivalent( equivalent( equivalent( equivalent( equivalent( X, Y ),
% 0.77/1.15 equivalent( X, Z ) ), equivalent( Y, Z ) ), T ), T ), U ) ) ) ] )
% 0.77/1.15 , 1, clause( 2, [ 'is_a_theorem'( equivalent( X, equivalent( equivalent(
% 0.77/1.15 equivalent( equivalent( Y, Z ), equivalent( Y, T ) ), equivalent( Z, T )
% 0.77/1.15 ), X ) ) ) ] )
% 0.77/1.15 , 0, substitution( 0, [ :=( X, T ), :=( Y, U ), :=( Z, W ), :=( T, V0 ),
% 0.77/1.15 :=( U, equivalent( equivalent( equivalent( equivalent( X, Y ), equivalent(
% 0.77/1.15 X, Z ) ), equivalent( Y, Z ) ), equivalent( equivalent( equivalent(
% 0.77/1.15 equivalent( equivalent( T, U ), equivalent( T, W ) ), equivalent( U, W )
% 0.77/1.15 ), V0 ), V0 ) ) )] ), substitution( 1, [ :=( X, equivalent( equivalent(
% 0.77/1.15 equivalent( equivalent( equivalent( T, U ), equivalent( T, W ) ),
% 0.77/1.15 equivalent( U, W ) ), V0 ), V0 ) ), :=( Y, X ), :=( Z, Y ), :=( T, Z )] )
% 0.77/1.15 ).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 subsumption(
% 0.77/1.15 clause( 6, [ 'is_a_theorem'( equivalent( equivalent( equivalent( equivalent(
% 0.77/1.15 X, Y ), equivalent( X, Z ) ), equivalent( Y, Z ) ), equivalent(
% 0.77/1.15 equivalent( equivalent( equivalent( equivalent( T, U ), equivalent( T, W
% 0.77/1.15 ) ), equivalent( U, W ) ), V0 ), V0 ) ) ) ] )
% 0.77/1.15 , clause( 1020, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.77/1.15 equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z ) ),
% 0.77/1.15 equivalent( equivalent( equivalent( equivalent( equivalent( T, U ),
% 0.77/1.15 equivalent( T, W ) ), equivalent( U, W ) ), V0 ), V0 ) ) ) ] )
% 0.77/1.15 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.77/1.15 , U ), :=( W, W ), :=( V0, V0 )] ), permutation( 0, [ ==>( 0, 0 )] )
% 0.77/1.15 ).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 resolution(
% 0.77/1.15 clause( 1021, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.77/1.15 equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z ) ),
% 0.77/1.15 equivalent( equivalent( equivalent( T, U ), equivalent( T, W ) ),
% 0.77/1.15 equivalent( U, W ) ) ) ) ] )
% 0.77/1.15 , clause( 4, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.77/1.15 equivalent( X, equivalent( equivalent( equivalent( equivalent( Y, Z ),
% 0.77/1.15 equivalent( Y, T ) ), equivalent( Z, T ) ), X ) ), U ) ) ) ] )
% 0.77/1.15 , 1, clause( 1, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.77/1.15 equivalent( equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z )
% 0.77/1.15 ), T ), T ) ) ] )
% 0.77/1.15 , 0, substitution( 0, [ :=( X, equivalent( equivalent( equivalent( T, U ),
% 0.77/1.15 equivalent( T, W ) ), equivalent( U, W ) ) ), :=( Y, X ), :=( Z, Y ),
% 0.77/1.15 :=( T, Z ), :=( U, equivalent( equivalent( equivalent( equivalent( X, Y )
% 0.77/1.15 , equivalent( X, Z ) ), equivalent( Y, Z ) ), equivalent( equivalent(
% 0.77/1.15 equivalent( T, U ), equivalent( T, W ) ), equivalent( U, W ) ) ) )] ),
% 0.77/1.15 substitution( 1, [ :=( X, T ), :=( Y, U ), :=( Z, W ), :=( T, equivalent(
% 0.77/1.15 equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z ) ),
% 0.77/1.15 equivalent( Y, Z ) ), equivalent( equivalent( equivalent( T, U ),
% 0.77/1.15 equivalent( T, W ) ), equivalent( U, W ) ) ) )] )).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 subsumption(
% 0.77/1.15 clause( 7, [ 'is_a_theorem'( equivalent( equivalent( equivalent( equivalent(
% 0.77/1.15 X, Y ), equivalent( X, Z ) ), equivalent( Y, Z ) ), equivalent(
% 0.77/1.15 equivalent( equivalent( T, U ), equivalent( T, W ) ), equivalent( U, W )
% 0.77/1.15 ) ) ) ] )
% 0.77/1.15 , clause( 1021, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.77/1.15 equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z ) ),
% 0.77/1.15 equivalent( equivalent( equivalent( T, U ), equivalent( T, W ) ),
% 0.77/1.15 equivalent( U, W ) ) ) ) ] )
% 0.77/1.15 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.77/1.15 , U ), :=( W, W )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 resolution(
% 0.77/1.15 clause( 1022, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.77/1.15 equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z ) ),
% 0.77/1.15 equivalent( T, equivalent( equivalent( equivalent( equivalent( U, W ),
% 0.77/1.15 equivalent( U, V0 ) ), equivalent( W, V0 ) ), T ) ) ) ) ] )
% 0.77/1.15 , clause( 4, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.77/1.15 equivalent( X, equivalent( equivalent( equivalent( equivalent( Y, Z ),
% 0.77/1.15 equivalent( Y, T ) ), equivalent( Z, T ) ), X ) ), U ) ) ) ] )
% 0.77/1.15 , 1, clause( 2, [ 'is_a_theorem'( equivalent( X, equivalent( equivalent(
% 0.77/1.15 equivalent( equivalent( Y, Z ), equivalent( Y, T ) ), equivalent( Z, T )
% 0.77/1.15 ), X ) ) ) ] )
% 0.77/1.15 , 0, substitution( 0, [ :=( X, T ), :=( Y, U ), :=( Z, W ), :=( T, V0 ),
% 0.77/1.15 :=( U, equivalent( equivalent( equivalent( equivalent( X, Y ), equivalent(
% 0.77/1.15 X, Z ) ), equivalent( Y, Z ) ), equivalent( T, equivalent( equivalent(
% 0.77/1.15 equivalent( equivalent( U, W ), equivalent( U, V0 ) ), equivalent( W, V0
% 0.77/1.15 ) ), T ) ) ) )] ), substitution( 1, [ :=( X, equivalent( T, equivalent(
% 0.77/1.15 equivalent( equivalent( equivalent( U, W ), equivalent( U, V0 ) ),
% 0.77/1.15 equivalent( W, V0 ) ), T ) ) ), :=( Y, X ), :=( Z, Y ), :=( T, Z )] )
% 0.77/1.15 ).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 subsumption(
% 0.77/1.15 clause( 8, [ 'is_a_theorem'( equivalent( equivalent( equivalent( equivalent(
% 0.77/1.15 X, Y ), equivalent( X, Z ) ), equivalent( Y, Z ) ), equivalent( T,
% 0.77/1.15 equivalent( equivalent( equivalent( equivalent( U, W ), equivalent( U, V0
% 0.77/1.15 ) ), equivalent( W, V0 ) ), T ) ) ) ) ] )
% 0.77/1.15 , clause( 1022, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.77/1.15 equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z ) ),
% 0.77/1.15 equivalent( T, equivalent( equivalent( equivalent( equivalent( U, W ),
% 0.77/1.15 equivalent( U, V0 ) ), equivalent( W, V0 ) ), T ) ) ) ) ] )
% 0.77/1.15 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.77/1.15 , U ), :=( W, W ), :=( V0, V0 )] ), permutation( 0, [ ==>( 0, 0 )] )
% 0.77/1.15 ).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 resolution(
% 0.77/1.15 clause( 1024, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.77/1.15 equivalent( equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z )
% 0.77/1.15 ), equivalent( equivalent( equivalent( T, U ), equivalent( T, W ) ),
% 0.77/1.15 equivalent( U, W ) ) ), V0 ) ) ), 'is_a_theorem'( V0 ) ] )
% 0.77/1.15 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.77/1.15 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.77/1.15 , 2, clause( 7, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.77/1.15 equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z ) ),
% 0.77/1.15 equivalent( equivalent( equivalent( T, U ), equivalent( T, W ) ),
% 0.77/1.15 equivalent( U, W ) ) ) ) ] )
% 0.77/1.15 , 0, substitution( 0, [ :=( X, equivalent( equivalent( equivalent(
% 0.77/1.15 equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z ) ),
% 0.77/1.15 equivalent( equivalent( equivalent( T, U ), equivalent( T, W ) ),
% 0.77/1.15 equivalent( U, W ) ) ) ), :=( Y, V0 )] ), substitution( 1, [ :=( X, X ),
% 0.77/1.15 :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U, U ), :=( W, W )] )).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 subsumption(
% 0.77/1.15 clause( 9, [ 'is_a_theorem'( V0 ), ~( 'is_a_theorem'( equivalent(
% 0.77/1.15 equivalent( equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z
% 0.77/1.15 ) ), equivalent( Y, Z ) ), equivalent( equivalent( equivalent( T, U ),
% 0.77/1.15 equivalent( T, W ) ), equivalent( U, W ) ) ), V0 ) ) ) ] )
% 0.77/1.15 , clause( 1024, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.77/1.15 equivalent( equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z )
% 0.77/1.15 ), equivalent( equivalent( equivalent( T, U ), equivalent( T, W ) ),
% 0.77/1.15 equivalent( U, W ) ) ), V0 ) ) ), 'is_a_theorem'( V0 ) ] )
% 0.77/1.15 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.77/1.15 , U ), :=( W, W ), :=( V0, V0 )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1
% 0.77/1.15 , 0 )] ) ).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 resolution(
% 0.77/1.15 clause( 1026, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.77/1.15 equivalent( equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z )
% 0.77/1.15 ), equivalent( T, equivalent( equivalent( equivalent( equivalent( U, W )
% 0.77/1.15 , equivalent( U, V0 ) ), equivalent( W, V0 ) ), T ) ) ), V1 ) ) ),
% 0.77/1.15 'is_a_theorem'( V1 ) ] )
% 0.77/1.15 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.77/1.15 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.77/1.15 , 2, clause( 8, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.77/1.15 equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z ) ),
% 0.77/1.15 equivalent( T, equivalent( equivalent( equivalent( equivalent( U, W ),
% 0.77/1.15 equivalent( U, V0 ) ), equivalent( W, V0 ) ), T ) ) ) ) ] )
% 0.77/1.15 , 0, substitution( 0, [ :=( X, equivalent( equivalent( equivalent(
% 0.77/1.15 equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z ) ),
% 0.77/1.15 equivalent( T, equivalent( equivalent( equivalent( equivalent( U, W ),
% 0.77/1.15 equivalent( U, V0 ) ), equivalent( W, V0 ) ), T ) ) ) ), :=( Y, V1 )] ),
% 0.77/1.15 substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.77/1.15 , U ), :=( W, W ), :=( V0, V0 )] )).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 subsumption(
% 0.77/1.15 clause( 10, [ 'is_a_theorem'( V1 ), ~( 'is_a_theorem'( equivalent(
% 0.77/1.15 equivalent( equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z
% 0.77/1.15 ) ), equivalent( Y, Z ) ), equivalent( T, equivalent( equivalent(
% 0.77/1.15 equivalent( equivalent( U, W ), equivalent( U, V0 ) ), equivalent( W, V0
% 0.77/1.15 ) ), T ) ) ), V1 ) ) ) ] )
% 0.77/1.15 , clause( 1026, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.77/1.15 equivalent( equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z )
% 0.77/1.15 ), equivalent( T, equivalent( equivalent( equivalent( equivalent( U, W )
% 0.77/1.15 , equivalent( U, V0 ) ), equivalent( W, V0 ) ), T ) ) ), V1 ) ) ),
% 0.77/1.15 'is_a_theorem'( V1 ) ] )
% 0.77/1.15 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.77/1.15 , U ), :=( W, W ), :=( V0, V0 ), :=( V1, V1 )] ), permutation( 0, [ ==>(
% 0.77/1.15 0, 1 ), ==>( 1, 0 )] ) ).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 resolution(
% 0.77/1.15 clause( 1028, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.77/1.15 equivalent( equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z )
% 0.77/1.15 ), equivalent( equivalent( equivalent( equivalent( equivalent( T, U ),
% 0.77/1.15 equivalent( T, W ) ), equivalent( U, W ) ), V0 ), V0 ) ), V1 ) ) ),
% 0.77/1.15 'is_a_theorem'( V1 ) ] )
% 0.77/1.15 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.77/1.15 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.77/1.15 , 2, clause( 6, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.77/1.15 equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z ) ),
% 0.77/1.15 equivalent( equivalent( equivalent( equivalent( equivalent( T, U ),
% 0.77/1.15 equivalent( T, W ) ), equivalent( U, W ) ), V0 ), V0 ) ) ) ] )
% 0.77/1.15 , 0, substitution( 0, [ :=( X, equivalent( equivalent( equivalent(
% 0.77/1.15 equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z ) ),
% 0.77/1.15 equivalent( equivalent( equivalent( equivalent( equivalent( T, U ),
% 0.77/1.15 equivalent( T, W ) ), equivalent( U, W ) ), V0 ), V0 ) ) ), :=( Y, V1 )] )
% 0.77/1.15 , substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=(
% 0.77/1.15 U, U ), :=( W, W ), :=( V0, V0 )] )).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 subsumption(
% 0.77/1.15 clause( 11, [ 'is_a_theorem'( V1 ), ~( 'is_a_theorem'( equivalent(
% 0.77/1.15 equivalent( equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z
% 0.77/1.15 ) ), equivalent( Y, Z ) ), equivalent( equivalent( equivalent(
% 0.77/1.15 equivalent( equivalent( T, U ), equivalent( T, W ) ), equivalent( U, W )
% 0.77/1.15 ), V0 ), V0 ) ), V1 ) ) ) ] )
% 0.77/1.15 , clause( 1028, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.77/1.15 equivalent( equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z )
% 0.77/1.15 ), equivalent( equivalent( equivalent( equivalent( equivalent( T, U ),
% 0.77/1.15 equivalent( T, W ) ), equivalent( U, W ) ), V0 ), V0 ) ), V1 ) ) ),
% 0.77/1.15 'is_a_theorem'( V1 ) ] )
% 0.77/1.15 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.77/1.15 , U ), :=( W, W ), :=( V0, V0 ), :=( V1, V1 )] ), permutation( 0, [ ==>(
% 0.77/1.15 0, 1 ), ==>( 1, 0 )] ) ).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 resolution(
% 0.77/1.15 clause( 1029, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y )
% 0.77/1.15 , equivalent( X, Z ) ), equivalent( Y, Z ) ) ) ] )
% 0.77/1.15 , clause( 9, [ 'is_a_theorem'( V0 ), ~( 'is_a_theorem'( equivalent(
% 0.77/1.15 equivalent( equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z
% 0.77/1.15 ) ), equivalent( Y, Z ) ), equivalent( equivalent( equivalent( T, U ),
% 0.77/1.15 equivalent( T, W ) ), equivalent( U, W ) ) ), V0 ) ) ) ] )
% 0.77/1.15 , 1, clause( 1, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.77/1.15 equivalent( equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z )
% 0.77/1.15 ), T ), T ) ) ] )
% 0.77/1.15 , 0, substitution( 0, [ :=( X, T ), :=( Y, U ), :=( Z, W ), :=( T, X ),
% 0.77/1.15 :=( U, Y ), :=( W, Z ), :=( V0, equivalent( equivalent( equivalent( X, Y
% 0.77/1.15 ), equivalent( X, Z ) ), equivalent( Y, Z ) ) )] ), substitution( 1, [
% 0.77/1.15 :=( X, T ), :=( Y, U ), :=( Z, W ), :=( T, equivalent( equivalent(
% 0.77/1.15 equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z ) ) )] )).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 subsumption(
% 0.77/1.15 clause( 12, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.77/1.15 equivalent( X, Z ) ), equivalent( Y, Z ) ) ) ] )
% 0.77/1.15 , clause( 1029, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.77/1.15 ), equivalent( X, Z ) ), equivalent( Y, Z ) ) ) ] )
% 0.77/1.15 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.77/1.15 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 resolution(
% 0.77/1.15 clause( 1030, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.77/1.15 equivalent( equivalent( equivalent( Z, T ), equivalent( Z, U ) ),
% 0.77/1.15 equivalent( T, U ) ), equivalent( equivalent( W, X ), equivalent( W, Y )
% 0.77/1.15 ) ) ) ) ] )
% 0.77/1.15 , clause( 10, [ 'is_a_theorem'( V1 ), ~( 'is_a_theorem'( equivalent(
% 0.77/1.15 equivalent( equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z
% 0.77/1.15 ) ), equivalent( Y, Z ) ), equivalent( T, equivalent( equivalent(
% 0.77/1.15 equivalent( equivalent( U, W ), equivalent( U, V0 ) ), equivalent( W, V0
% 0.77/1.15 ) ), T ) ) ), V1 ) ) ) ] )
% 0.77/1.15 , 1, clause( 12, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.77/1.15 ), equivalent( X, Z ) ), equivalent( Y, Z ) ) ) ] )
% 0.77/1.15 , 0, substitution( 0, [ :=( X, W ), :=( Y, X ), :=( Z, Y ), :=( T,
% 0.77/1.15 equivalent( equivalent( W, X ), equivalent( W, Y ) ) ), :=( U, Z ), :=( W
% 0.77/1.15 , T ), :=( V0, U ), :=( V1, equivalent( equivalent( X, Y ), equivalent(
% 0.77/1.15 equivalent( equivalent( equivalent( Z, T ), equivalent( Z, U ) ),
% 0.77/1.15 equivalent( T, U ) ), equivalent( equivalent( W, X ), equivalent( W, Y )
% 0.77/1.15 ) ) ) )] ), substitution( 1, [ :=( X, equivalent( equivalent( W, X ),
% 0.77/1.15 equivalent( W, Y ) ) ), :=( Y, equivalent( X, Y ) ), :=( Z, equivalent(
% 0.77/1.15 equivalent( equivalent( equivalent( Z, T ), equivalent( Z, U ) ),
% 0.77/1.15 equivalent( T, U ) ), equivalent( equivalent( W, X ), equivalent( W, Y )
% 0.77/1.15 ) ) )] )).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 subsumption(
% 0.77/1.15 clause( 15, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.77/1.15 equivalent( equivalent( equivalent( Z, T ), equivalent( Z, U ) ),
% 0.77/1.15 equivalent( T, U ) ), equivalent( equivalent( W, X ), equivalent( W, Y )
% 0.77/1.15 ) ) ) ) ] )
% 0.77/1.15 , clause( 1030, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.77/1.15 equivalent( equivalent( equivalent( equivalent( Z, T ), equivalent( Z, U
% 0.77/1.15 ) ), equivalent( T, U ) ), equivalent( equivalent( W, X ), equivalent( W
% 0.77/1.15 , Y ) ) ) ) ) ] )
% 0.77/1.15 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.77/1.15 , U ), :=( W, W )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 resolution(
% 0.77/1.15 clause( 1031, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.77/1.15 X, Y ) ) ) ] )
% 0.77/1.15 , clause( 9, [ 'is_a_theorem'( V0 ), ~( 'is_a_theorem'( equivalent(
% 0.77/1.15 equivalent( equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z
% 0.77/1.15 ) ), equivalent( Y, Z ) ), equivalent( equivalent( equivalent( T, U ),
% 0.77/1.15 equivalent( T, W ) ), equivalent( U, W ) ) ), V0 ) ) ) ] )
% 0.77/1.15 , 1, clause( 12, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.77/1.15 ), equivalent( X, Z ) ), equivalent( Y, Z ) ) ) ] )
% 0.77/1.15 , 0, substitution( 0, [ :=( X, Z ), :=( Y, X ), :=( Z, Y ), :=( T, Z ),
% 0.77/1.15 :=( U, X ), :=( W, Y ), :=( V0, equivalent( equivalent( X, Y ),
% 0.77/1.15 equivalent( X, Y ) ) )] ), substitution( 1, [ :=( X, equivalent(
% 0.77/1.15 equivalent( Z, X ), equivalent( Z, Y ) ) ), :=( Y, equivalent( X, Y ) ),
% 0.77/1.15 :=( Z, equivalent( X, Y ) )] )).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 subsumption(
% 0.77/1.15 clause( 16, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent( X
% 0.77/1.15 , Y ) ) ) ] )
% 0.77/1.15 , clause( 1031, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.77/1.15 equivalent( X, Y ) ) ) ] )
% 0.77/1.15 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.77/1.15 )] ) ).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 resolution(
% 0.77/1.15 clause( 1033, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.77/1.15 ), equivalent( X, Y ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.77/1.15 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.77/1.15 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.77/1.15 , 2, clause( 16, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.77/1.15 equivalent( X, Y ) ) ) ] )
% 0.77/1.15 , 0, substitution( 0, [ :=( X, equivalent( equivalent( X, Y ), equivalent(
% 0.77/1.15 X, Y ) ) ), :=( Y, Z )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )
% 0.77/1.15 ).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 subsumption(
% 0.77/1.15 clause( 18, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( equivalent(
% 0.77/1.15 equivalent( equivalent( X, Y ), equivalent( X, Y ) ), Z ) ) ) ] )
% 0.77/1.15 , clause( 1033, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( X
% 0.77/1.15 , Y ), equivalent( X, Y ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.77/1.15 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.77/1.15 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 resolution(
% 0.77/1.15 clause( 1034, [ 'is_a_theorem'( equivalent( X, X ) ) ] )
% 0.77/1.15 , clause( 18, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( equivalent(
% 0.77/1.15 equivalent( equivalent( X, Y ), equivalent( X, Y ) ), Z ) ) ) ] )
% 0.77/1.15 , 1, clause( 12, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.77/1.15 ), equivalent( X, Z ) ), equivalent( Y, Z ) ) ) ] )
% 0.77/1.15 , 0, substitution( 0, [ :=( X, Y ), :=( Y, X ), :=( Z, equivalent( X, X ) )] )
% 0.77/1.15 , substitution( 1, [ :=( X, Y ), :=( Y, X ), :=( Z, X )] )).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 subsumption(
% 0.77/1.15 clause( 19, [ 'is_a_theorem'( equivalent( X, X ) ) ] )
% 0.77/1.15 , clause( 1034, [ 'is_a_theorem'( equivalent( X, X ) ) ] )
% 0.77/1.15 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 resolution(
% 0.77/1.15 clause( 1036, [ ~( 'is_a_theorem'( equivalent( equivalent( X, X ), Y ) ) )
% 0.77/1.15 , 'is_a_theorem'( Y ) ] )
% 0.77/1.15 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.77/1.15 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.77/1.15 , 2, clause( 19, [ 'is_a_theorem'( equivalent( X, X ) ) ] )
% 0.77/1.15 , 0, substitution( 0, [ :=( X, equivalent( X, X ) ), :=( Y, Y )] ),
% 0.77/1.15 substitution( 1, [ :=( X, X )] )).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 subsumption(
% 0.77/1.15 clause( 21, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( equivalent(
% 0.77/1.15 equivalent( X, X ), Y ) ) ) ] )
% 0.77/1.15 , clause( 1036, [ ~( 'is_a_theorem'( equivalent( equivalent( X, X ), Y ) )
% 0.77/1.15 ), 'is_a_theorem'( Y ) ] )
% 0.77/1.15 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.77/1.15 ), ==>( 1, 0 )] ) ).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 resolution(
% 0.77/1.15 clause( 1037, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y )
% 0.77/1.15 , Z ), equivalent( equivalent( equivalent( T, X ), equivalent( T, Y ) ),
% 0.77/1.15 Z ) ) ) ] )
% 0.77/1.15 , clause( 11, [ 'is_a_theorem'( V1 ), ~( 'is_a_theorem'( equivalent(
% 0.77/1.15 equivalent( equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z
% 0.77/1.15 ) ), equivalent( Y, Z ) ), equivalent( equivalent( equivalent(
% 0.77/1.15 equivalent( equivalent( T, U ), equivalent( T, W ) ), equivalent( U, W )
% 0.77/1.15 ), V0 ), V0 ) ), V1 ) ) ) ] )
% 0.77/1.15 , 1, clause( 12, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.77/1.15 ), equivalent( X, Z ) ), equivalent( Y, Z ) ) ) ] )
% 0.77/1.15 , 0, substitution( 0, [ :=( X, equivalent( equivalent( T, X ), equivalent(
% 0.77/1.15 T, Y ) ) ), :=( Y, equivalent( X, Y ) ), :=( Z, Z ), :=( T, T ), :=( U, X
% 0.77/1.15 ), :=( W, Y ), :=( V0, equivalent( equivalent( equivalent( T, X ),
% 0.77/1.15 equivalent( T, Y ) ), Z ) ), :=( V1, equivalent( equivalent( equivalent(
% 0.77/1.15 X, Y ), Z ), equivalent( equivalent( equivalent( T, X ), equivalent( T, Y
% 0.77/1.15 ) ), Z ) ) )] ), substitution( 1, [ :=( X, equivalent( equivalent(
% 0.77/1.15 equivalent( equivalent( T, X ), equivalent( T, Y ) ), equivalent( X, Y )
% 0.77/1.15 ), equivalent( equivalent( equivalent( T, X ), equivalent( T, Y ) ), Z )
% 0.77/1.15 ) ), :=( Y, equivalent( equivalent( X, Y ), Z ) ), :=( Z, equivalent(
% 0.77/1.15 equivalent( equivalent( T, X ), equivalent( T, Y ) ), Z ) )] )).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 subsumption(
% 0.77/1.15 clause( 22, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ), Z
% 0.77/1.15 ), equivalent( equivalent( equivalent( T, X ), equivalent( T, Y ) ), Z )
% 0.77/1.15 ) ) ] )
% 0.77/1.15 , clause( 1037, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.77/1.15 ), Z ), equivalent( equivalent( equivalent( T, X ), equivalent( T, Y ) )
% 0.77/1.15 , Z ) ) ) ] )
% 0.77/1.15 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.77/1.15 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 resolution(
% 0.77/1.15 clause( 1038, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.77/1.15 equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z ) ),
% 0.77/1.15 equivalent( T, T ) ) ) ] )
% 0.77/1.15 , clause( 21, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( equivalent(
% 0.77/1.15 equivalent( X, X ), Y ) ) ) ] )
% 0.77/1.15 , 1, clause( 2, [ 'is_a_theorem'( equivalent( X, equivalent( equivalent(
% 0.77/1.15 equivalent( equivalent( Y, Z ), equivalent( Y, T ) ), equivalent( Z, T )
% 0.77/1.15 ), X ) ) ) ] )
% 0.77/1.15 , 0, substitution( 0, [ :=( X, T ), :=( Y, equivalent( equivalent(
% 0.77/1.15 equivalent( equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z )
% 0.77/1.15 ), equivalent( T, T ) ) )] ), substitution( 1, [ :=( X, equivalent( T, T
% 0.77/1.15 ) ), :=( Y, X ), :=( Z, Y ), :=( T, Z )] )).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 subsumption(
% 0.77/1.15 clause( 24, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.77/1.15 equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z ) ),
% 0.77/1.15 equivalent( T, T ) ) ) ] )
% 0.77/1.15 , clause( 1038, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.77/1.15 equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z ) ),
% 0.77/1.15 equivalent( T, T ) ) ) ] )
% 0.77/1.15 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.77/1.15 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 resolution(
% 0.77/1.15 clause( 1040, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.77/1.15 equivalent( equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z )
% 0.77/1.15 ), equivalent( T, T ) ), U ) ) ), 'is_a_theorem'( U ) ] )
% 0.77/1.15 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.77/1.15 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.77/1.15 , 2, clause( 24, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.77/1.15 equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z ) ),
% 0.77/1.15 equivalent( T, T ) ) ) ] )
% 0.77/1.15 , 0, substitution( 0, [ :=( X, equivalent( equivalent( equivalent(
% 0.77/1.15 equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z ) ),
% 0.77/1.15 equivalent( T, T ) ) ), :=( Y, U )] ), substitution( 1, [ :=( X, X ),
% 0.77/1.15 :=( Y, Y ), :=( Z, Z ), :=( T, T )] )).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 subsumption(
% 0.77/1.15 clause( 25, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.77/1.15 equivalent( equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z
% 0.77/1.15 ) ), equivalent( Y, Z ) ), equivalent( T, T ) ), U ) ) ) ] )
% 0.77/1.15 , clause( 1040, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.77/1.15 equivalent( equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z )
% 0.77/1.15 ), equivalent( T, T ) ), U ) ) ), 'is_a_theorem'( U ) ] )
% 0.77/1.15 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.77/1.15 , U )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 resolution(
% 0.77/1.15 clause( 1041, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X,
% 0.77/1.15 equivalent( equivalent( equivalent( Y, Z ), equivalent( Y, T ) ),
% 0.77/1.15 equivalent( Z, T ) ) ), equivalent( X, U ) ), U ) ) ] )
% 0.77/1.15 , clause( 5, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.77/1.15 equivalent( equivalent( equivalent( equivalent( equivalent( X, Y ),
% 0.77/1.15 equivalent( X, Z ) ), equivalent( Y, Z ) ), T ), T ), U ) ) ) ] )
% 0.77/1.15 , 1, clause( 22, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.77/1.15 ), Z ), equivalent( equivalent( equivalent( T, X ), equivalent( T, Y ) )
% 0.77/1.15 , Z ) ) ) ] )
% 0.77/1.15 , 0, substitution( 0, [ :=( X, Y ), :=( Y, Z ), :=( Z, T ), :=( T, U ),
% 0.77/1.15 :=( U, equivalent( equivalent( equivalent( X, equivalent( equivalent(
% 0.77/1.15 equivalent( Y, Z ), equivalent( Y, T ) ), equivalent( Z, T ) ) ),
% 0.77/1.15 equivalent( X, U ) ), U ) )] ), substitution( 1, [ :=( X, equivalent(
% 0.77/1.15 equivalent( equivalent( Y, Z ), equivalent( Y, T ) ), equivalent( Z, T )
% 0.77/1.15 ) ), :=( Y, U ), :=( Z, U ), :=( T, X )] )).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 subsumption(
% 0.77/1.15 clause( 30, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X,
% 0.77/1.15 equivalent( equivalent( equivalent( Y, Z ), equivalent( Y, T ) ),
% 0.77/1.15 equivalent( Z, T ) ) ), equivalent( X, U ) ), U ) ) ] )
% 0.77/1.15 , clause( 1041, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X,
% 0.77/1.15 equivalent( equivalent( equivalent( Y, Z ), equivalent( Y, T ) ),
% 0.77/1.15 equivalent( Z, T ) ) ), equivalent( X, U ) ), U ) ) ] )
% 0.77/1.15 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.77/1.15 , U )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 resolution(
% 0.77/1.15 clause( 1043, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.77/1.15 ), equivalent( equivalent( equivalent( equivalent( Z, T ), equivalent( Z
% 0.77/1.15 , U ) ), equivalent( T, U ) ), equivalent( equivalent( W, X ), equivalent(
% 0.77/1.15 W, Y ) ) ) ), V0 ) ) ), 'is_a_theorem'( V0 ) ] )
% 0.77/1.15 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.77/1.15 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.77/1.15 , 2, clause( 15, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.77/1.15 equivalent( equivalent( equivalent( equivalent( Z, T ), equivalent( Z, U
% 0.77/1.15 ) ), equivalent( T, U ) ), equivalent( equivalent( W, X ), equivalent( W
% 0.77/1.15 , Y ) ) ) ) ) ] )
% 0.77/1.15 , 0, substitution( 0, [ :=( X, equivalent( equivalent( X, Y ), equivalent(
% 0.77/1.15 equivalent( equivalent( equivalent( Z, T ), equivalent( Z, U ) ),
% 0.77/1.15 equivalent( T, U ) ), equivalent( equivalent( W, X ), equivalent( W, Y )
% 0.77/1.15 ) ) ) ), :=( Y, V0 )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ), :=(
% 0.77/1.15 Z, Z ), :=( T, T ), :=( U, U ), :=( W, W )] )).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 subsumption(
% 0.77/1.15 clause( 63, [ 'is_a_theorem'( V0 ), ~( 'is_a_theorem'( equivalent(
% 0.77/1.15 equivalent( equivalent( X, Y ), equivalent( equivalent( equivalent(
% 0.77/1.15 equivalent( Z, T ), equivalent( Z, U ) ), equivalent( T, U ) ),
% 0.77/1.15 equivalent( equivalent( W, X ), equivalent( W, Y ) ) ) ), V0 ) ) ) ] )
% 0.77/1.15 , clause( 1043, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( X
% 0.77/1.15 , Y ), equivalent( equivalent( equivalent( equivalent( Z, T ), equivalent(
% 0.77/1.15 Z, U ) ), equivalent( T, U ) ), equivalent( equivalent( W, X ),
% 0.77/1.15 equivalent( W, Y ) ) ) ), V0 ) ) ), 'is_a_theorem'( V0 ) ] )
% 0.77/1.15 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.77/1.15 , U ), :=( W, W ), :=( V0, V0 )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1
% 0.77/1.15 , 0 )] ) ).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 resolution(
% 0.77/1.15 clause( 1044, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.77/1.15 equivalent( Y, Z ), equivalent( Y, T ) ) ), equivalent( X, equivalent( Z
% 0.77/1.15 , T ) ) ) ) ] )
% 0.77/1.15 , clause( 25, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.77/1.15 equivalent( equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z
% 0.77/1.15 ) ), equivalent( Y, Z ) ), equivalent( T, T ) ), U ) ) ) ] )
% 0.77/1.15 , 1, clause( 30, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X,
% 0.77/1.15 equivalent( equivalent( equivalent( Y, Z ), equivalent( Y, T ) ),
% 0.77/1.15 equivalent( Z, T ) ) ), equivalent( X, U ) ), U ) ) ] )
% 0.77/1.15 , 0, substitution( 0, [ :=( X, X ), :=( Y, equivalent( equivalent( Y, Z ),
% 0.77/1.15 equivalent( Y, T ) ) ), :=( Z, equivalent( Z, T ) ), :=( T, equivalent(
% 0.77/1.15 equivalent( X, equivalent( equivalent( Y, Z ), equivalent( Y, T ) ) ),
% 0.77/1.15 equivalent( X, equivalent( Z, T ) ) ) ), :=( U, equivalent( equivalent( X
% 0.77/1.15 , equivalent( equivalent( Y, Z ), equivalent( Y, T ) ) ), equivalent( X,
% 0.77/1.15 equivalent( Z, T ) ) ) )] ), substitution( 1, [ :=( X, equivalent(
% 0.77/1.15 equivalent( X, equivalent( equivalent( Y, Z ), equivalent( Y, T ) ) ),
% 0.77/1.15 equivalent( X, equivalent( Z, T ) ) ) ), :=( Y, Y ), :=( Z, Z ), :=( T, T
% 0.77/1.15 ), :=( U, equivalent( equivalent( X, equivalent( equivalent( Y, Z ),
% 0.77/1.15 equivalent( Y, T ) ) ), equivalent( X, equivalent( Z, T ) ) ) )] )).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 subsumption(
% 0.77/1.15 clause( 102, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.77/1.15 equivalent( Y, Z ), equivalent( Y, T ) ) ), equivalent( X, equivalent( Z
% 0.77/1.15 , T ) ) ) ) ] )
% 0.77/1.15 , clause( 1044, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.77/1.15 equivalent( Y, Z ), equivalent( Y, T ) ) ), equivalent( X, equivalent( Z
% 0.77/1.15 , T ) ) ) ) ] )
% 0.77/1.15 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.77/1.15 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 resolution(
% 0.77/1.15 clause( 1045, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y )
% 0.77/1.15 , Z ), equivalent( equivalent( T, Y ), equivalent( equivalent( X, T ), Z
% 0.77/1.15 ) ) ) ) ] )
% 0.77/1.15 , clause( 63, [ 'is_a_theorem'( V0 ), ~( 'is_a_theorem'( equivalent(
% 0.77/1.15 equivalent( equivalent( X, Y ), equivalent( equivalent( equivalent(
% 0.77/1.15 equivalent( Z, T ), equivalent( Z, U ) ), equivalent( T, U ) ),
% 0.77/1.15 equivalent( equivalent( W, X ), equivalent( W, Y ) ) ) ), V0 ) ) ) ] )
% 0.77/1.15 , 1, clause( 102, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.77/1.15 equivalent( Y, Z ), equivalent( Y, T ) ) ), equivalent( X, equivalent( Z
% 0.77/1.15 , T ) ) ) ) ] )
% 0.77/1.15 , 0, substitution( 0, [ :=( X, equivalent( X, Y ) ), :=( Y, Z ), :=( Z, X )
% 0.77/1.15 , :=( T, T ), :=( U, Y ), :=( W, equivalent( X, T ) ), :=( V0, equivalent(
% 0.77/1.15 equivalent( equivalent( X, Y ), Z ), equivalent( equivalent( T, Y ),
% 0.77/1.15 equivalent( equivalent( X, T ), Z ) ) ) )] ), substitution( 1, [ :=( X,
% 0.77/1.15 equivalent( equivalent( X, Y ), Z ) ), :=( Y, equivalent( equivalent( X,
% 0.77/1.15 T ), equivalent( X, Y ) ) ), :=( Z, equivalent( T, Y ) ), :=( T,
% 0.77/1.15 equivalent( equivalent( X, T ), Z ) )] )).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 subsumption(
% 0.77/1.15 clause( 906, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.77/1.15 Z ), equivalent( equivalent( T, Y ), equivalent( equivalent( X, T ), Z )
% 0.77/1.15 ) ) ) ] )
% 0.77/1.15 , clause( 1045, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.77/1.15 ), Z ), equivalent( equivalent( T, Y ), equivalent( equivalent( X, T ),
% 0.77/1.15 Z ) ) ) ) ] )
% 0.77/1.15 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.77/1.15 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 resolution(
% 0.77/1.15 clause( 1046, [] )
% 0.77/1.15 , clause( 3, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( a, b
% 0.77/1.15 ), c ), equivalent( equivalent( e, b ), equivalent( equivalent( a, e ),
% 0.77/1.15 c ) ) ) ) ) ] )
% 0.77/1.15 , 0, clause( 906, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X,
% 0.77/1.15 Y ), Z ), equivalent( equivalent( T, Y ), equivalent( equivalent( X, T )
% 0.77/1.15 , Z ) ) ) ) ] )
% 0.77/1.15 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, a ), :=( Y, b ), :=(
% 0.77/1.15 Z, c ), :=( T, e )] )).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 subsumption(
% 0.77/1.15 clause( 1010, [] )
% 0.77/1.15 , clause( 1046, [] )
% 0.77/1.15 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 end.
% 0.77/1.15
% 0.77/1.15 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.77/1.15
% 0.77/1.15 Memory use:
% 0.77/1.15
% 0.77/1.15 space for terms: 26692
% 0.77/1.15 space for clauses: 130795
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 clauses generated: 3123
% 0.77/1.15 clauses kept: 1011
% 0.77/1.15 clauses selected: 186
% 0.77/1.15 clauses deleted: 9
% 0.77/1.15 clauses inuse deleted: 8
% 0.77/1.15
% 0.77/1.15 subsentry: 2345
% 0.77/1.15 literals s-matched: 2121
% 0.77/1.15 literals matched: 2121
% 0.77/1.15 full subsumption: 0
% 0.77/1.15
% 0.77/1.15 checksum: -1255613677
% 0.77/1.15
% 0.77/1.15
% 0.77/1.15 Bliksem ended
%------------------------------------------------------------------------------