TSTP Solution File: LCL102-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL102-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n014.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:20 EDT 2022
% Result : Unsatisfiable 0.93s 1.33s
% Output : Refutation 0.93s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : LCL102-1 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.11 % Command : bliksem %s
% 0.11/0.32 % Computer : n014.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 14:21:09 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.93/1.33 *** allocated 10000 integers for termspace/termends
% 0.93/1.33 *** allocated 10000 integers for clauses
% 0.93/1.33 *** allocated 10000 integers for justifications
% 0.93/1.33 Bliksem 1.12
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 Automatic Strategy Selection
% 0.93/1.33
% 0.93/1.33 Clauses:
% 0.93/1.33 [
% 0.93/1.33 [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), ~( 'is_a_theorem'( X ) ),
% 0.93/1.33 'is_a_theorem'( Y ) ],
% 0.93/1.33 [ 'is_a_theorem'( equivalent( equivalent( equivalent( equivalent(
% 0.93/1.33 equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z ) ), T ), T )
% 0.93/1.33 ) ],
% 0.93/1.33 [ 'is_a_theorem'( equivalent( X, equivalent( equivalent( Y, Z ),
% 0.93/1.33 equivalent( equivalent( Z, Y ), X ) ) ) ) ],
% 0.93/1.33 [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent( equivalent(
% 0.93/1.33 Z, X ), equivalent( Z, Y ) ) ) ) ],
% 0.93/1.33 [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( a, b ), c ),
% 0.93/1.33 equivalent( equivalent( e, b ), equivalent( equivalent( a, e ), c ) ) ) )
% 0.93/1.33 ) ]
% 0.93/1.33 ] .
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 percentage equality = 0.000000, percentage horn = 1.000000
% 0.93/1.33 This is a near-Horn, non-equality problem
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 Options Used:
% 0.93/1.33
% 0.93/1.33 useres = 1
% 0.93/1.33 useparamod = 0
% 0.93/1.33 useeqrefl = 0
% 0.93/1.33 useeqfact = 0
% 0.93/1.33 usefactor = 1
% 0.93/1.33 usesimpsplitting = 0
% 0.93/1.33 usesimpdemod = 0
% 0.93/1.33 usesimpres = 4
% 0.93/1.33
% 0.93/1.33 resimpinuse = 1000
% 0.93/1.33 resimpclauses = 20000
% 0.93/1.33 substype = standard
% 0.93/1.33 backwardsubs = 1
% 0.93/1.33 selectoldest = 5
% 0.93/1.33
% 0.93/1.33 litorderings [0] = split
% 0.93/1.33 litorderings [1] = liftord
% 0.93/1.33
% 0.93/1.33 termordering = none
% 0.93/1.33
% 0.93/1.33 litapriori = 1
% 0.93/1.33 termapriori = 0
% 0.93/1.33 litaposteriori = 0
% 0.93/1.33 termaposteriori = 0
% 0.93/1.33 demodaposteriori = 0
% 0.93/1.33 ordereqreflfact = 0
% 0.93/1.33
% 0.93/1.33 litselect = negative
% 0.93/1.33
% 0.93/1.33 maxweight = 30000
% 0.93/1.33 maxdepth = 30000
% 0.93/1.33 maxlength = 115
% 0.93/1.33 maxnrvars = 195
% 0.93/1.33 excuselevel = 0
% 0.93/1.33 increasemaxweight = 0
% 0.93/1.33
% 0.93/1.33 maxselected = 10000000
% 0.93/1.33 maxnrclauses = 10000000
% 0.93/1.33
% 0.93/1.33 showgenerated = 0
% 0.93/1.33 showkept = 0
% 0.93/1.33 showselected = 0
% 0.93/1.33 showdeleted = 0
% 0.93/1.33 showresimp = 1
% 0.93/1.33 showstatus = 2000
% 0.93/1.33
% 0.93/1.33 prologoutput = 1
% 0.93/1.33 nrgoals = 5000000
% 0.93/1.33 totalproof = 1
% 0.93/1.33
% 0.93/1.33 Symbols occurring in the translation:
% 0.93/1.33
% 0.93/1.33 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.93/1.33 . [1, 2] (w:1, o:23, a:1, s:1, b:0),
% 0.93/1.33 ! [4, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.93/1.33 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.93/1.33 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.93/1.33 equivalent [41, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.93/1.33 'is_a_theorem' [42, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.93/1.33 a [45, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.93/1.33 b [46, 0] (w:1, o:14, a:1, s:1, b:0),
% 0.93/1.33 c [47, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.93/1.33 e [48, 0] (w:1, o:16, a:1, s:1, b:0).
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 Starting Search:
% 0.93/1.33
% 0.93/1.33 Resimplifying inuse:
% 0.93/1.33 Done
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 Intermediate Status:
% 0.93/1.33 Generated: 6126
% 0.93/1.33 Kept: 2011
% 0.93/1.33 Inuse: 328
% 0.93/1.33 Deleted: 3
% 0.93/1.33 Deletedinuse: 2
% 0.93/1.33
% 0.93/1.33 Resimplifying inuse:
% 0.93/1.33 Done
% 0.93/1.33
% 0.93/1.33 Resimplifying inuse:
% 0.93/1.33 Done
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 Intermediate Status:
% 0.93/1.33 Generated: 11978
% 0.93/1.33 Kept: 4041
% 0.93/1.33 Inuse: 510
% 0.93/1.33 Deleted: 3
% 0.93/1.33 Deletedinuse: 2
% 0.93/1.33
% 0.93/1.33 Resimplifying inuse:
% 0.93/1.33 Done
% 0.93/1.33
% 0.93/1.33 Resimplifying inuse:
% 0.93/1.33 Done
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 Intermediate Status:
% 0.93/1.33 Generated: 16267
% 0.93/1.33 Kept: 6042
% 0.93/1.33 Inuse: 578
% 0.93/1.33 Deleted: 3
% 0.93/1.33 Deletedinuse: 2
% 0.93/1.33
% 0.93/1.33 Resimplifying inuse:
% 0.93/1.33 Done
% 0.93/1.33
% 0.93/1.33 Resimplifying inuse:
% 0.93/1.33 Done
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 Intermediate Status:
% 0.93/1.33 Generated: 23555
% 0.93/1.33 Kept: 8072
% 0.93/1.33 Inuse: 686
% 0.93/1.33 Deleted: 3
% 0.93/1.33 Deletedinuse: 2
% 0.93/1.33
% 0.93/1.33 Resimplifying inuse:
% 0.93/1.33 Done
% 0.93/1.33
% 0.93/1.33 Resimplifying inuse:
% 0.93/1.33 Done
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 Bliksems!, er is een bewijs:
% 0.93/1.33 % SZS status Unsatisfiable
% 0.93/1.33 % SZS output start Refutation
% 0.93/1.33
% 0.93/1.33 clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.93/1.33 , ~( 'is_a_theorem'( X ) ) ] )
% 0.93/1.33 .
% 0.93/1.33 clause( 1, [ 'is_a_theorem'( equivalent( equivalent( equivalent( equivalent(
% 0.93/1.33 equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z ) ), T ), T )
% 0.93/1.33 ) ] )
% 0.93/1.33 .
% 0.93/1.33 clause( 2, [ 'is_a_theorem'( equivalent( X, equivalent( equivalent( Y, Z )
% 0.93/1.33 , equivalent( equivalent( Z, Y ), X ) ) ) ) ] )
% 0.93/1.33 .
% 0.93/1.33 clause( 3, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.93/1.33 equivalent( Z, X ), equivalent( Z, Y ) ) ) ) ] )
% 0.93/1.33 .
% 0.93/1.33 clause( 4, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( a, b )
% 0.93/1.33 , c ), equivalent( equivalent( e, b ), equivalent( equivalent( a, e ), c
% 0.93/1.33 ) ) ) ) ) ] )
% 0.93/1.33 .
% 0.93/1.33 clause( 5, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent( equivalent(
% 0.93/1.33 equivalent( X, Y ), equivalent( equivalent( Z, X ), equivalent( Z, Y ) )
% 0.93/1.33 ), T ) ) ) ] )
% 0.93/1.33 .
% 0.93/1.33 clause( 6, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent( equivalent(
% 0.93/1.33 X, equivalent( equivalent( Y, Z ), equivalent( equivalent( Z, Y ), X ) )
% 0.93/1.33 ), T ) ) ) ] )
% 0.93/1.33 .
% 0.93/1.33 clause( 7, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent( equivalent(
% 0.93/1.33 equivalent( equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z
% 0.93/1.33 ) ), equivalent( Y, Z ) ), T ), T ), U ) ) ) ] )
% 0.93/1.33 .
% 0.93/1.33 clause( 8, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.93/1.33 equivalent( Y, Z ), equivalent( Y, T ) ) ), equivalent( X, equivalent( Z
% 0.93/1.33 , T ) ) ) ) ] )
% 0.93/1.33 .
% 0.93/1.33 clause( 10, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y, Z )
% 0.93/1.33 ), equivalent( X, equivalent( equivalent( T, Y ), equivalent( T, Z ) ) )
% 0.93/1.33 ) ) ] )
% 0.93/1.33 .
% 0.93/1.33 clause( 12, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.93/1.33 equivalent( equivalent( X, equivalent( equivalent( Y, Z ), equivalent( Y
% 0.93/1.33 , T ) ) ), equivalent( X, equivalent( Z, T ) ) ), U ) ) ) ] )
% 0.93/1.33 .
% 0.93/1.33 clause( 31, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.93/1.33 equivalent( equivalent( equivalent( Y, Z ), equivalent( Y, T ) ),
% 0.93/1.33 equivalent( Z, T ) ), U ) ), equivalent( X, U ) ) ) ] )
% 0.93/1.33 .
% 0.93/1.33 clause( 56, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.93/1.33 equivalent( Z, equivalent( T, X ) ), equivalent( Z, equivalent( T, Y ) )
% 0.93/1.33 ) ) ) ] )
% 0.93/1.33 .
% 0.93/1.33 clause( 62, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.93/1.33 equivalent( equivalent( X, Y ), equivalent( equivalent( Z, equivalent( T
% 0.93/1.33 , X ) ), equivalent( Z, equivalent( T, Y ) ) ) ), U ) ) ) ] )
% 0.93/1.33 .
% 0.93/1.33 clause( 72, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y,
% 0.93/1.33 equivalent( Z, equivalent( equivalent( T, U ), equivalent( T, W ) ) ) ) )
% 0.93/1.33 , equivalent( X, equivalent( Y, equivalent( Z, equivalent( U, W ) ) ) ) )
% 0.93/1.33 ) ] )
% 0.93/1.33 .
% 0.93/1.33 clause( 252, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.93/1.33 Z ), equivalent( equivalent( equivalent( T, X ), equivalent( T, Y ) ), Z
% 0.93/1.33 ) ) ) ] )
% 0.93/1.33 .
% 0.93/1.33 clause( 256, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.93/1.33 equivalent( equivalent( equivalent( X, Y ), Z ), equivalent( equivalent(
% 0.93/1.33 equivalent( T, X ), equivalent( T, Y ) ), Z ) ), U ) ) ) ] )
% 0.93/1.33 .
% 0.93/1.33 clause( 1090, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y, Z
% 0.93/1.33 ) ), equivalent( equivalent( T, equivalent( equivalent( Y, U ), X ) ),
% 0.93/1.33 equivalent( T, equivalent( U, Z ) ) ) ) ) ] )
% 0.93/1.33 .
% 0.93/1.33 clause( 1112, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.93/1.33 equivalent( equivalent( Y, Z ), T ), U ) ), equivalent( X, equivalent( T
% 0.93/1.33 , equivalent( equivalent( Z, Y ), U ) ) ) ) ) ] )
% 0.93/1.33 .
% 0.93/1.33 clause( 9796, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y )
% 0.93/1.33 , Z ), equivalent( equivalent( T, Y ), equivalent( equivalent( X, T ), Z
% 0.93/1.33 ) ) ) ) ] )
% 0.93/1.33 .
% 0.93/1.33 clause( 9864, [] )
% 0.93/1.33 .
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 % SZS output end Refutation
% 0.93/1.33 found a proof!
% 0.93/1.33
% 0.93/1.33 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.93/1.33
% 0.93/1.33 initialclauses(
% 0.93/1.33 [ clause( 9866, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), ~(
% 0.93/1.33 'is_a_theorem'( X ) ), 'is_a_theorem'( Y ) ] )
% 0.93/1.33 , clause( 9867, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.93/1.33 equivalent( equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z )
% 0.93/1.33 ), T ), T ) ) ] )
% 0.93/1.33 , clause( 9868, [ 'is_a_theorem'( equivalent( X, equivalent( equivalent( Y
% 0.93/1.33 , Z ), equivalent( equivalent( Z, Y ), X ) ) ) ) ] )
% 0.93/1.33 , clause( 9869, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.93/1.33 equivalent( equivalent( Z, X ), equivalent( Z, Y ) ) ) ) ] )
% 0.93/1.33 , clause( 9870, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( a
% 0.93/1.33 , b ), c ), equivalent( equivalent( e, b ), equivalent( equivalent( a, e
% 0.93/1.33 ), c ) ) ) ) ) ] )
% 0.93/1.33 ] ).
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 subsumption(
% 0.93/1.33 clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.93/1.33 , ~( 'is_a_theorem'( X ) ) ] )
% 0.93/1.33 , clause( 9866, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), ~(
% 0.93/1.33 'is_a_theorem'( X ) ), 'is_a_theorem'( Y ) ] )
% 0.93/1.33 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.93/1.33 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 subsumption(
% 0.93/1.33 clause( 1, [ 'is_a_theorem'( equivalent( equivalent( equivalent( equivalent(
% 0.93/1.33 equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z ) ), T ), T )
% 0.93/1.33 ) ] )
% 0.93/1.33 , clause( 9867, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.93/1.33 equivalent( equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z )
% 0.93/1.33 ), T ), T ) ) ] )
% 0.93/1.33 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.93/1.33 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 subsumption(
% 0.93/1.33 clause( 2, [ 'is_a_theorem'( equivalent( X, equivalent( equivalent( Y, Z )
% 0.93/1.33 , equivalent( equivalent( Z, Y ), X ) ) ) ) ] )
% 0.93/1.33 , clause( 9868, [ 'is_a_theorem'( equivalent( X, equivalent( equivalent( Y
% 0.93/1.33 , Z ), equivalent( equivalent( Z, Y ), X ) ) ) ) ] )
% 0.93/1.33 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.93/1.33 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 subsumption(
% 0.93/1.33 clause( 3, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.93/1.33 equivalent( Z, X ), equivalent( Z, Y ) ) ) ) ] )
% 0.93/1.33 , clause( 9869, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.93/1.33 equivalent( equivalent( Z, X ), equivalent( Z, Y ) ) ) ) ] )
% 0.93/1.33 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.93/1.33 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 subsumption(
% 0.93/1.33 clause( 4, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( a, b )
% 0.93/1.33 , c ), equivalent( equivalent( e, b ), equivalent( equivalent( a, e ), c
% 0.93/1.33 ) ) ) ) ) ] )
% 0.93/1.33 , clause( 9870, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( a
% 0.93/1.33 , b ), c ), equivalent( equivalent( e, b ), equivalent( equivalent( a, e
% 0.93/1.33 ), c ) ) ) ) ) ] )
% 0.93/1.33 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 resolution(
% 0.93/1.33 clause( 9872, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.93/1.33 ), equivalent( equivalent( Z, X ), equivalent( Z, Y ) ) ), T ) ) ),
% 0.93/1.33 'is_a_theorem'( T ) ] )
% 0.93/1.33 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.93/1.33 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.93/1.33 , 2, clause( 3, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.93/1.33 equivalent( equivalent( Z, X ), equivalent( Z, Y ) ) ) ) ] )
% 0.93/1.33 , 0, substitution( 0, [ :=( X, equivalent( equivalent( X, Y ), equivalent(
% 0.93/1.33 equivalent( Z, X ), equivalent( Z, Y ) ) ) ), :=( Y, T )] ),
% 0.93/1.33 substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 subsumption(
% 0.93/1.33 clause( 5, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent( equivalent(
% 0.93/1.33 equivalent( X, Y ), equivalent( equivalent( Z, X ), equivalent( Z, Y ) )
% 0.93/1.33 ), T ) ) ) ] )
% 0.93/1.33 , clause( 9872, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( X
% 0.93/1.33 , Y ), equivalent( equivalent( Z, X ), equivalent( Z, Y ) ) ), T ) ) ),
% 0.93/1.33 'is_a_theorem'( T ) ] )
% 0.93/1.33 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.93/1.33 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 resolution(
% 0.93/1.33 clause( 9874, [ ~( 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.93/1.33 equivalent( Y, Z ), equivalent( equivalent( Z, Y ), X ) ) ), T ) ) ),
% 0.93/1.33 'is_a_theorem'( T ) ] )
% 0.93/1.33 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.93/1.33 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.93/1.33 , 2, clause( 2, [ 'is_a_theorem'( equivalent( X, equivalent( equivalent( Y
% 0.93/1.33 , Z ), equivalent( equivalent( Z, Y ), X ) ) ) ) ] )
% 0.93/1.33 , 0, substitution( 0, [ :=( X, equivalent( X, equivalent( equivalent( Y, Z
% 0.93/1.33 ), equivalent( equivalent( Z, Y ), X ) ) ) ), :=( Y, T )] ),
% 0.93/1.33 substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 subsumption(
% 0.93/1.33 clause( 6, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent( equivalent(
% 0.93/1.33 X, equivalent( equivalent( Y, Z ), equivalent( equivalent( Z, Y ), X ) )
% 0.93/1.33 ), T ) ) ) ] )
% 0.93/1.33 , clause( 9874, [ ~( 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.93/1.33 equivalent( Y, Z ), equivalent( equivalent( Z, Y ), X ) ) ), T ) ) ),
% 0.93/1.33 'is_a_theorem'( T ) ] )
% 0.93/1.33 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.93/1.33 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 resolution(
% 0.93/1.33 clause( 9876, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.93/1.33 equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z ) ),
% 0.93/1.33 equivalent( Y, Z ) ), T ), T ), U ) ) ), 'is_a_theorem'( U ) ] )
% 0.93/1.33 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.93/1.33 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.93/1.33 , 2, clause( 1, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.93/1.33 equivalent( equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z )
% 0.93/1.33 ), T ), T ) ) ] )
% 0.93/1.33 , 0, substitution( 0, [ :=( X, equivalent( equivalent( equivalent(
% 0.93/1.33 equivalent( equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z )
% 0.93/1.33 ), T ), T ) ), :=( Y, U )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )
% 0.93/1.33 , :=( Z, Z ), :=( T, T )] )).
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 subsumption(
% 0.93/1.33 clause( 7, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent( equivalent(
% 0.93/1.33 equivalent( equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z
% 0.93/1.33 ) ), equivalent( Y, Z ) ), T ), T ), U ) ) ) ] )
% 0.93/1.33 , clause( 9876, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.93/1.33 equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z ) ),
% 0.93/1.33 equivalent( Y, Z ) ), T ), T ), U ) ) ), 'is_a_theorem'( U ) ] )
% 0.93/1.33 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.93/1.33 , U )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 resolution(
% 0.93/1.33 clause( 9877, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.93/1.33 equivalent( Y, Z ), equivalent( Y, T ) ) ), equivalent( X, equivalent( Z
% 0.93/1.33 , T ) ) ) ) ] )
% 0.93/1.33 , clause( 5, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent(
% 0.93/1.33 equivalent( equivalent( X, Y ), equivalent( equivalent( Z, X ),
% 0.93/1.33 equivalent( Z, Y ) ) ), T ) ) ) ] )
% 0.93/1.33 , 1, clause( 1, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.93/1.33 equivalent( equivalent( X, Y ), equivalent( X, Z ) ), equivalent( Y, Z )
% 0.93/1.33 ), T ), T ) ) ] )
% 0.93/1.33 , 0, substitution( 0, [ :=( X, equivalent( equivalent( Y, Z ), equivalent(
% 0.93/1.33 Y, T ) ) ), :=( Y, equivalent( Z, T ) ), :=( Z, X ), :=( T, equivalent(
% 0.93/1.33 equivalent( X, equivalent( equivalent( Y, Z ), equivalent( Y, T ) ) ),
% 0.93/1.33 equivalent( X, equivalent( Z, T ) ) ) )] ), substitution( 1, [ :=( X, Y )
% 0.93/1.33 , :=( Y, Z ), :=( Z, T ), :=( T, equivalent( equivalent( X, equivalent(
% 0.93/1.33 equivalent( Y, Z ), equivalent( Y, T ) ) ), equivalent( X, equivalent( Z
% 0.93/1.33 , T ) ) ) )] )).
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 subsumption(
% 0.93/1.33 clause( 8, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.93/1.33 equivalent( Y, Z ), equivalent( Y, T ) ) ), equivalent( X, equivalent( Z
% 0.93/1.33 , T ) ) ) ) ] )
% 0.93/1.33 , clause( 9877, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.93/1.33 equivalent( Y, Z ), equivalent( Y, T ) ) ), equivalent( X, equivalent( Z
% 0.93/1.33 , T ) ) ) ) ] )
% 0.93/1.33 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.93/1.33 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 resolution(
% 0.93/1.33 clause( 9878, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y, Z
% 0.93/1.33 ) ), equivalent( X, equivalent( equivalent( T, Y ), equivalent( T, Z ) )
% 0.93/1.33 ) ) ) ] )
% 0.93/1.33 , clause( 5, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent(
% 0.93/1.33 equivalent( equivalent( X, Y ), equivalent( equivalent( Z, X ),
% 0.93/1.33 equivalent( Z, Y ) ) ), T ) ) ) ] )
% 0.93/1.33 , 1, clause( 3, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.93/1.33 equivalent( equivalent( Z, X ), equivalent( Z, Y ) ) ) ) ] )
% 0.93/1.33 , 0, substitution( 0, [ :=( X, Y ), :=( Y, Z ), :=( Z, T ), :=( T,
% 0.93/1.33 equivalent( equivalent( X, equivalent( Y, Z ) ), equivalent( X,
% 0.93/1.33 equivalent( equivalent( T, Y ), equivalent( T, Z ) ) ) ) )] ),
% 0.93/1.33 substitution( 1, [ :=( X, equivalent( Y, Z ) ), :=( Y, equivalent(
% 0.93/1.33 equivalent( T, Y ), equivalent( T, Z ) ) ), :=( Z, X )] )).
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 subsumption(
% 0.93/1.33 clause( 10, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y, Z )
% 0.93/1.33 ), equivalent( X, equivalent( equivalent( T, Y ), equivalent( T, Z ) ) )
% 0.93/1.33 ) ) ] )
% 0.93/1.33 , clause( 9878, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y
% 0.93/1.33 , Z ) ), equivalent( X, equivalent( equivalent( T, Y ), equivalent( T, Z
% 0.93/1.33 ) ) ) ) ) ] )
% 0.93/1.33 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.93/1.33 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 resolution(
% 0.93/1.33 clause( 9880, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( X,
% 0.93/1.33 equivalent( equivalent( Y, Z ), equivalent( Y, T ) ) ), equivalent( X,
% 0.93/1.33 equivalent( Z, T ) ) ), U ) ) ), 'is_a_theorem'( U ) ] )
% 0.93/1.33 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.93/1.33 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.93/1.33 , 2, clause( 8, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.93/1.33 equivalent( Y, Z ), equivalent( Y, T ) ) ), equivalent( X, equivalent( Z
% 0.93/1.33 , T ) ) ) ) ] )
% 0.93/1.33 , 0, substitution( 0, [ :=( X, equivalent( equivalent( X, equivalent(
% 0.93/1.33 equivalent( Y, Z ), equivalent( Y, T ) ) ), equivalent( X, equivalent( Z
% 0.93/1.33 , T ) ) ) ), :=( Y, U )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ),
% 0.93/1.33 :=( Z, Z ), :=( T, T )] )).
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 subsumption(
% 0.93/1.33 clause( 12, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.93/1.33 equivalent( equivalent( X, equivalent( equivalent( Y, Z ), equivalent( Y
% 0.93/1.33 , T ) ) ), equivalent( X, equivalent( Z, T ) ) ), U ) ) ) ] )
% 0.93/1.33 , clause( 9880, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( X
% 0.93/1.33 , equivalent( equivalent( Y, Z ), equivalent( Y, T ) ) ), equivalent( X,
% 0.93/1.33 equivalent( Z, T ) ) ), U ) ) ), 'is_a_theorem'( U ) ] )
% 0.93/1.33 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.93/1.33 , U )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 resolution(
% 0.93/1.33 clause( 9881, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.93/1.33 equivalent( equivalent( equivalent( Y, Z ), equivalent( Y, T ) ),
% 0.93/1.33 equivalent( Z, T ) ), U ) ), equivalent( X, U ) ) ) ] )
% 0.93/1.33 , clause( 7, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.93/1.33 equivalent( equivalent( equivalent( equivalent( equivalent( X, Y ),
% 0.93/1.33 equivalent( X, Z ) ), equivalent( Y, Z ) ), T ), T ), U ) ) ) ] )
% 0.93/1.33 , 1, clause( 3, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.93/1.33 equivalent( equivalent( Z, X ), equivalent( Z, Y ) ) ) ) ] )
% 0.93/1.33 , 0, substitution( 0, [ :=( X, Y ), :=( Y, Z ), :=( Z, T ), :=( T, U ),
% 0.93/1.33 :=( U, equivalent( equivalent( X, equivalent( equivalent( equivalent(
% 0.93/1.33 equivalent( Y, Z ), equivalent( Y, T ) ), equivalent( Z, T ) ), U ) ),
% 0.93/1.33 equivalent( X, U ) ) )] ), substitution( 1, [ :=( X, equivalent(
% 0.93/1.33 equivalent( equivalent( equivalent( Y, Z ), equivalent( Y, T ) ),
% 0.93/1.33 equivalent( Z, T ) ), U ) ), :=( Y, U ), :=( Z, X )] )).
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 subsumption(
% 0.93/1.33 clause( 31, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.93/1.33 equivalent( equivalent( equivalent( Y, Z ), equivalent( Y, T ) ),
% 0.93/1.33 equivalent( Z, T ) ), U ) ), equivalent( X, U ) ) ) ] )
% 0.93/1.33 , clause( 9881, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.93/1.33 equivalent( equivalent( equivalent( Y, Z ), equivalent( Y, T ) ),
% 0.93/1.33 equivalent( Z, T ) ), U ) ), equivalent( X, U ) ) ) ] )
% 0.93/1.33 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.93/1.33 , U )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 resolution(
% 0.93/1.33 clause( 9882, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.93/1.33 equivalent( Z, equivalent( T, X ) ), equivalent( Z, equivalent( T, Y ) )
% 0.93/1.33 ) ) ) ] )
% 0.93/1.33 , clause( 5, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent(
% 0.93/1.33 equivalent( equivalent( X, Y ), equivalent( equivalent( Z, X ),
% 0.93/1.33 equivalent( Z, Y ) ) ), T ) ) ) ] )
% 0.93/1.33 , 1, clause( 10, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y
% 0.93/1.33 , Z ) ), equivalent( X, equivalent( equivalent( T, Y ), equivalent( T, Z
% 0.93/1.33 ) ) ) ) ) ] )
% 0.93/1.33 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, T ), :=( T,
% 0.93/1.33 equivalent( equivalent( X, Y ), equivalent( equivalent( Z, equivalent( T
% 0.93/1.33 , X ) ), equivalent( Z, equivalent( T, Y ) ) ) ) )] ), substitution( 1, [
% 0.93/1.33 :=( X, equivalent( X, Y ) ), :=( Y, equivalent( T, X ) ), :=( Z,
% 0.93/1.33 equivalent( T, Y ) ), :=( T, Z )] )).
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 subsumption(
% 0.93/1.33 clause( 56, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.93/1.33 equivalent( Z, equivalent( T, X ) ), equivalent( Z, equivalent( T, Y ) )
% 0.93/1.33 ) ) ) ] )
% 0.93/1.33 , clause( 9882, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.93/1.33 equivalent( equivalent( Z, equivalent( T, X ) ), equivalent( Z,
% 0.93/1.33 equivalent( T, Y ) ) ) ) ) ] )
% 0.93/1.33 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.93/1.33 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 resolution(
% 0.93/1.33 clause( 9884, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.93/1.33 ), equivalent( equivalent( Z, equivalent( T, X ) ), equivalent( Z,
% 0.93/1.33 equivalent( T, Y ) ) ) ), U ) ) ), 'is_a_theorem'( U ) ] )
% 0.93/1.33 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.93/1.33 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.93/1.33 , 2, clause( 56, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.93/1.33 equivalent( equivalent( Z, equivalent( T, X ) ), equivalent( Z,
% 0.93/1.33 equivalent( T, Y ) ) ) ) ) ] )
% 0.93/1.33 , 0, substitution( 0, [ :=( X, equivalent( equivalent( X, Y ), equivalent(
% 0.93/1.33 equivalent( Z, equivalent( T, X ) ), equivalent( Z, equivalent( T, Y ) )
% 0.93/1.33 ) ) ), :=( Y, U )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z,
% 0.93/1.33 Z ), :=( T, T )] )).
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 subsumption(
% 0.93/1.33 clause( 62, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.93/1.33 equivalent( equivalent( X, Y ), equivalent( equivalent( Z, equivalent( T
% 0.93/1.33 , X ) ), equivalent( Z, equivalent( T, Y ) ) ) ), U ) ) ) ] )
% 0.93/1.33 , clause( 9884, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( X
% 0.93/1.33 , Y ), equivalent( equivalent( Z, equivalent( T, X ) ), equivalent( Z,
% 0.93/1.33 equivalent( T, Y ) ) ) ), U ) ) ), 'is_a_theorem'( U ) ] )
% 0.93/1.33 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.93/1.33 , U )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 resolution(
% 0.93/1.33 clause( 9885, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y,
% 0.93/1.33 equivalent( Z, equivalent( equivalent( T, U ), equivalent( T, W ) ) ) ) )
% 0.93/1.33 , equivalent( X, equivalent( Y, equivalent( Z, equivalent( U, W ) ) ) ) )
% 0.93/1.33 ) ] )
% 0.93/1.33 , clause( 12, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.93/1.33 equivalent( equivalent( X, equivalent( equivalent( Y, Z ), equivalent( Y
% 0.93/1.33 , T ) ) ), equivalent( X, equivalent( Z, T ) ) ), U ) ) ) ] )
% 0.93/1.33 , 1, clause( 56, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.93/1.33 equivalent( equivalent( Z, equivalent( T, X ) ), equivalent( Z,
% 0.93/1.33 equivalent( T, Y ) ) ) ) ) ] )
% 0.93/1.33 , 0, substitution( 0, [ :=( X, Z ), :=( Y, T ), :=( Z, U ), :=( T, W ),
% 0.93/1.33 :=( U, equivalent( equivalent( X, equivalent( Y, equivalent( Z,
% 0.93/1.33 equivalent( equivalent( T, U ), equivalent( T, W ) ) ) ) ), equivalent( X
% 0.93/1.33 , equivalent( Y, equivalent( Z, equivalent( U, W ) ) ) ) ) )] ),
% 0.93/1.33 substitution( 1, [ :=( X, equivalent( Z, equivalent( equivalent( T, U ),
% 0.93/1.33 equivalent( T, W ) ) ) ), :=( Y, equivalent( Z, equivalent( U, W ) ) ),
% 0.93/1.33 :=( Z, X ), :=( T, Y )] )).
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 subsumption(
% 0.93/1.33 clause( 72, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y,
% 0.93/1.33 equivalent( Z, equivalent( equivalent( T, U ), equivalent( T, W ) ) ) ) )
% 0.93/1.33 , equivalent( X, equivalent( Y, equivalent( Z, equivalent( U, W ) ) ) ) )
% 0.93/1.33 ) ] )
% 0.93/1.33 , clause( 9885, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y
% 0.93/1.33 , equivalent( Z, equivalent( equivalent( T, U ), equivalent( T, W ) ) ) )
% 0.93/1.33 ), equivalent( X, equivalent( Y, equivalent( Z, equivalent( U, W ) ) ) )
% 0.93/1.33 ) ) ] )
% 0.93/1.33 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.93/1.33 , U ), :=( W, W )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 resolution(
% 0.93/1.33 clause( 9886, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y )
% 0.93/1.33 , Z ), equivalent( equivalent( equivalent( T, X ), equivalent( T, Y ) ),
% 0.93/1.33 Z ) ) ) ] )
% 0.93/1.33 , clause( 5, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent(
% 0.93/1.33 equivalent( equivalent( X, Y ), equivalent( equivalent( Z, X ),
% 0.93/1.33 equivalent( Z, Y ) ) ), T ) ) ) ] )
% 0.93/1.33 , 1, clause( 31, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.93/1.33 equivalent( equivalent( equivalent( Y, Z ), equivalent( Y, T ) ),
% 0.93/1.33 equivalent( Z, T ) ), U ) ), equivalent( X, U ) ) ) ] )
% 0.93/1.33 , 0, substitution( 0, [ :=( X, equivalent( X, Y ) ), :=( Y, Z ), :=( Z,
% 0.93/1.33 equivalent( equivalent( T, X ), equivalent( T, Y ) ) ), :=( T, equivalent(
% 0.93/1.33 equivalent( equivalent( X, Y ), Z ), equivalent( equivalent( equivalent(
% 0.93/1.33 T, X ), equivalent( T, Y ) ), Z ) ) )] ), substitution( 1, [ :=( X,
% 0.93/1.33 equivalent( equivalent( X, Y ), Z ) ), :=( Y, T ), :=( Z, X ), :=( T, Y )
% 0.93/1.33 , :=( U, equivalent( equivalent( equivalent( T, X ), equivalent( T, Y ) )
% 0.93/1.33 , Z ) )] )).
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 subsumption(
% 0.93/1.33 clause( 252, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.93/1.33 Z ), equivalent( equivalent( equivalent( T, X ), equivalent( T, Y ) ), Z
% 0.93/1.33 ) ) ) ] )
% 0.93/1.33 , clause( 9886, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.93/1.33 ), Z ), equivalent( equivalent( equivalent( T, X ), equivalent( T, Y ) )
% 0.93/1.33 , Z ) ) ) ] )
% 0.93/1.33 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.93/1.33 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 resolution(
% 0.93/1.33 clause( 9888, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.93/1.33 equivalent( X, Y ), Z ), equivalent( equivalent( equivalent( T, X ),
% 0.93/1.33 equivalent( T, Y ) ), Z ) ), U ) ) ), 'is_a_theorem'( U ) ] )
% 0.93/1.33 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.93/1.33 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.93/1.33 , 2, clause( 252, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X,
% 0.93/1.33 Y ), Z ), equivalent( equivalent( equivalent( T, X ), equivalent( T, Y )
% 0.93/1.33 ), Z ) ) ) ] )
% 0.93/1.33 , 0, substitution( 0, [ :=( X, equivalent( equivalent( equivalent( X, Y ),
% 0.93/1.33 Z ), equivalent( equivalent( equivalent( T, X ), equivalent( T, Y ) ), Z
% 0.93/1.33 ) ) ), :=( Y, U )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z,
% 0.93/1.33 Z ), :=( T, T )] )).
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 subsumption(
% 0.93/1.33 clause( 256, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.93/1.33 equivalent( equivalent( equivalent( X, Y ), Z ), equivalent( equivalent(
% 0.93/1.33 equivalent( T, X ), equivalent( T, Y ) ), Z ) ), U ) ) ) ] )
% 0.93/1.33 , clause( 9888, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.93/1.33 equivalent( X, Y ), Z ), equivalent( equivalent( equivalent( T, X ),
% 0.93/1.33 equivalent( T, Y ) ), Z ) ), U ) ) ), 'is_a_theorem'( U ) ] )
% 0.93/1.33 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.93/1.33 , U )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 resolution(
% 0.93/1.33 clause( 9889, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y, Z
% 0.93/1.33 ) ), equivalent( equivalent( T, equivalent( equivalent( Y, U ), X ) ),
% 0.93/1.33 equivalent( T, equivalent( U, Z ) ) ) ) ) ] )
% 0.93/1.33 , clause( 62, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.93/1.33 equivalent( equivalent( X, Y ), equivalent( equivalent( Z, equivalent( T
% 0.93/1.33 , X ) ), equivalent( Z, equivalent( T, Y ) ) ) ), U ) ) ) ] )
% 0.93/1.33 , 1, clause( 72, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y
% 0.93/1.33 , equivalent( Z, equivalent( equivalent( T, U ), equivalent( T, W ) ) ) )
% 0.93/1.33 ), equivalent( X, equivalent( Y, equivalent( Z, equivalent( U, W ) ) ) )
% 0.93/1.33 ) ) ] )
% 0.93/1.33 , 0, substitution( 0, [ :=( X, X ), :=( Y, equivalent( Y, Z ) ), :=( Z, T )
% 0.93/1.33 , :=( T, equivalent( Y, U ) ), :=( U, equivalent( equivalent( X,
% 0.93/1.33 equivalent( Y, Z ) ), equivalent( equivalent( T, equivalent( equivalent(
% 0.93/1.33 Y, U ), X ) ), equivalent( T, equivalent( U, Z ) ) ) ) )] ),
% 0.93/1.33 substitution( 1, [ :=( X, equivalent( X, equivalent( Y, Z ) ) ), :=( Y,
% 0.93/1.33 equivalent( T, equivalent( equivalent( Y, U ), X ) ) ), :=( Z, T ), :=( T
% 0.93/1.33 , Y ), :=( U, U ), :=( W, Z )] )).
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 subsumption(
% 0.93/1.33 clause( 1090, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y, Z
% 0.93/1.33 ) ), equivalent( equivalent( T, equivalent( equivalent( Y, U ), X ) ),
% 0.93/1.33 equivalent( T, equivalent( U, Z ) ) ) ) ) ] )
% 0.93/1.33 , clause( 9889, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y
% 0.93/1.33 , Z ) ), equivalent( equivalent( T, equivalent( equivalent( Y, U ), X ) )
% 0.93/1.33 , equivalent( T, equivalent( U, Z ) ) ) ) ) ] )
% 0.93/1.33 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.93/1.33 , U )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 resolution(
% 0.93/1.33 clause( 9890, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.93/1.33 equivalent( equivalent( Y, Z ), T ), U ) ), equivalent( X, equivalent( T
% 0.93/1.33 , equivalent( equivalent( Z, Y ), U ) ) ) ) ) ] )
% 0.93/1.33 , clause( 6, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent(
% 0.93/1.33 equivalent( X, equivalent( equivalent( Y, Z ), equivalent( equivalent( Z
% 0.93/1.33 , Y ), X ) ) ), T ) ) ) ] )
% 0.93/1.33 , 1, clause( 1090, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.93/1.33 Y, Z ) ), equivalent( equivalent( T, equivalent( equivalent( Y, U ), X )
% 0.93/1.33 ), equivalent( T, equivalent( U, Z ) ) ) ) ) ] )
% 0.93/1.33 , 0, substitution( 0, [ :=( X, U ), :=( Y, Y ), :=( Z, Z ), :=( T,
% 0.93/1.33 equivalent( equivalent( X, equivalent( equivalent( equivalent( Y, Z ), T
% 0.93/1.33 ), U ) ), equivalent( X, equivalent( T, equivalent( equivalent( Z, Y ),
% 0.93/1.33 U ) ) ) ) )] ), substitution( 1, [ :=( X, U ), :=( Y, equivalent( Y, Z )
% 0.93/1.33 ), :=( Z, equivalent( equivalent( Z, Y ), U ) ), :=( T, X ), :=( U, T )] )
% 0.93/1.33 ).
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 subsumption(
% 0.93/1.33 clause( 1112, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.93/1.33 equivalent( equivalent( Y, Z ), T ), U ) ), equivalent( X, equivalent( T
% 0.93/1.33 , equivalent( equivalent( Z, Y ), U ) ) ) ) ) ] )
% 0.93/1.33 , clause( 9890, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.93/1.33 equivalent( equivalent( Y, Z ), T ), U ) ), equivalent( X, equivalent( T
% 0.93/1.33 , equivalent( equivalent( Z, Y ), U ) ) ) ) ) ] )
% 0.93/1.33 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.93/1.33 , U )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 resolution(
% 0.93/1.33 clause( 9891, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y )
% 0.93/1.33 , Z ), equivalent( equivalent( T, Y ), equivalent( equivalent( X, T ), Z
% 0.93/1.33 ) ) ) ) ] )
% 0.93/1.33 , clause( 256, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.93/1.33 equivalent( equivalent( equivalent( X, Y ), Z ), equivalent( equivalent(
% 0.93/1.33 equivalent( T, X ), equivalent( T, Y ) ), Z ) ), U ) ) ) ] )
% 0.93/1.33 , 1, clause( 1112, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.93/1.33 equivalent( equivalent( Y, Z ), T ), U ) ), equivalent( X, equivalent( T
% 0.93/1.33 , equivalent( equivalent( Z, Y ), U ) ) ) ) ) ] )
% 0.93/1.33 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ),
% 0.93/1.33 :=( U, equivalent( equivalent( equivalent( X, Y ), Z ), equivalent(
% 0.93/1.33 equivalent( T, Y ), equivalent( equivalent( X, T ), Z ) ) ) )] ),
% 0.93/1.33 substitution( 1, [ :=( X, equivalent( equivalent( X, Y ), Z ) ), :=( Y, T
% 0.93/1.33 ), :=( Z, X ), :=( T, equivalent( T, Y ) ), :=( U, Z )] )).
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 subsumption(
% 0.93/1.33 clause( 9796, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y )
% 0.93/1.33 , Z ), equivalent( equivalent( T, Y ), equivalent( equivalent( X, T ), Z
% 0.93/1.33 ) ) ) ) ] )
% 0.93/1.33 , clause( 9891, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.93/1.33 ), Z ), equivalent( equivalent( T, Y ), equivalent( equivalent( X, T ),
% 0.93/1.33 Z ) ) ) ) ] )
% 0.93/1.33 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.93/1.33 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 resolution(
% 0.93/1.33 clause( 9892, [] )
% 0.93/1.33 , clause( 4, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( a, b
% 0.93/1.33 ), c ), equivalent( equivalent( e, b ), equivalent( equivalent( a, e ),
% 0.93/1.33 c ) ) ) ) ) ] )
% 0.93/1.33 , 0, clause( 9796, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X
% 0.93/1.33 , Y ), Z ), equivalent( equivalent( T, Y ), equivalent( equivalent( X, T
% 0.93/1.33 ), Z ) ) ) ) ] )
% 0.93/1.33 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, a ), :=( Y, b ), :=(
% 0.93/1.33 Z, c ), :=( T, e )] )).
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 subsumption(
% 0.93/1.33 clause( 9864, [] )
% 0.93/1.33 , clause( 9892, [] )
% 0.93/1.33 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 end.
% 0.93/1.33
% 0.93/1.33 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.93/1.33
% 0.93/1.33 Memory use:
% 0.93/1.33
% 0.93/1.33 space for terms: 266226
% 0.93/1.33 space for clauses: 1192302
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 clauses generated: 28015
% 0.93/1.33 clauses kept: 9865
% 0.93/1.33 clauses selected: 751
% 0.93/1.33 clauses deleted: 3
% 0.93/1.33 clauses inuse deleted: 2
% 0.93/1.33
% 0.93/1.33 subsentry: 19297
% 0.93/1.33 literals s-matched: 18153
% 0.93/1.33 literals matched: 18153
% 0.93/1.33 full subsumption: 0
% 0.93/1.33
% 0.93/1.33 checksum: 1409681477
% 0.93/1.33
% 0.93/1.33
% 0.93/1.33 Bliksem ended
%------------------------------------------------------------------------------