TSTP Solution File: LCL126-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL126-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n018.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:42 EDT 2022
% Result : Unsatisfiable 0.70s 1.08s
% Output : Refutation 0.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL126-1 : TPTP v8.1.0. Released v1.0.0.
% 0.13/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n018.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % DateTime : Sun Jul 3 01:27:34 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.70/1.08 *** allocated 10000 integers for termspace/termends
% 0.70/1.08 *** allocated 10000 integers for clauses
% 0.70/1.08 *** allocated 10000 integers for justifications
% 0.70/1.08 Bliksem 1.12
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 Automatic Strategy Selection
% 0.70/1.08
% 0.70/1.08 Clauses:
% 0.70/1.08 [
% 0.70/1.08 [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), ~( 'is_a_theorem'( X ) ),
% 0.70/1.08 'is_a_theorem'( Y ) ],
% 0.70/1.08 [ 'is_a_theorem'( equivalent( X, equivalent( equivalent( X, equivalent(
% 0.70/1.08 Y, Z ) ), equivalent( Z, Y ) ) ) ) ],
% 0.70/1.08 [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent( equivalent(
% 0.70/1.08 X, Z ), equivalent( Y, Z ) ) ) ) ],
% 0.70/1.08 [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( a, b ),
% 0.70/1.08 equivalent( c, b ) ), equivalent( a, c ) ) ) ) ]
% 0.70/1.08 ] .
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 percentage equality = 0.000000, percentage horn = 1.000000
% 0.70/1.08 This is a near-Horn, non-equality problem
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 Options Used:
% 0.70/1.08
% 0.70/1.08 useres = 1
% 0.70/1.08 useparamod = 0
% 0.70/1.08 useeqrefl = 0
% 0.70/1.08 useeqfact = 0
% 0.70/1.08 usefactor = 1
% 0.70/1.08 usesimpsplitting = 0
% 0.70/1.08 usesimpdemod = 0
% 0.70/1.08 usesimpres = 4
% 0.70/1.08
% 0.70/1.08 resimpinuse = 1000
% 0.70/1.08 resimpclauses = 20000
% 0.70/1.08 substype = standard
% 0.70/1.08 backwardsubs = 1
% 0.70/1.08 selectoldest = 5
% 0.70/1.08
% 0.70/1.08 litorderings [0] = split
% 0.70/1.08 litorderings [1] = liftord
% 0.70/1.08
% 0.70/1.08 termordering = none
% 0.70/1.08
% 0.70/1.08 litapriori = 1
% 0.70/1.08 termapriori = 0
% 0.70/1.08 litaposteriori = 0
% 0.70/1.08 termaposteriori = 0
% 0.70/1.08 demodaposteriori = 0
% 0.70/1.08 ordereqreflfact = 0
% 0.70/1.08
% 0.70/1.08 litselect = negative
% 0.70/1.08
% 0.70/1.08 maxweight = 30000
% 0.70/1.08 maxdepth = 30000
% 0.70/1.08 maxlength = 115
% 0.70/1.08 maxnrvars = 195
% 0.70/1.08 excuselevel = 0
% 0.70/1.08 increasemaxweight = 0
% 0.70/1.08
% 0.70/1.08 maxselected = 10000000
% 0.70/1.08 maxnrclauses = 10000000
% 0.70/1.08
% 0.70/1.08 showgenerated = 0
% 0.70/1.08 showkept = 0
% 0.70/1.08 showselected = 0
% 0.70/1.08 showdeleted = 0
% 0.70/1.08 showresimp = 1
% 0.70/1.08 showstatus = 2000
% 0.70/1.08
% 0.70/1.08 prologoutput = 1
% 0.70/1.08 nrgoals = 5000000
% 0.70/1.08 totalproof = 1
% 0.70/1.08
% 0.70/1.08 Symbols occurring in the translation:
% 0.70/1.08
% 0.70/1.08 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.70/1.08 . [1, 2] (w:1, o:21, a:1, s:1, b:0),
% 0.70/1.08 ! [4, 1] (w:1, o:15, a:1, s:1, b:0),
% 0.70/1.08 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.70/1.08 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.70/1.08 equivalent [41, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.70/1.08 'is_a_theorem' [42, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.70/1.08 a [44, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.70/1.08 b [45, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.70/1.08 c [46, 0] (w:1, o:14, a:1, s:1, b:0).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 Starting Search:
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 Bliksems!, er is een bewijs:
% 0.70/1.08 % SZS status Unsatisfiable
% 0.70/1.08 % SZS output start Refutation
% 0.70/1.08
% 0.70/1.08 clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.70/1.08 , ~( 'is_a_theorem'( X ) ) ] )
% 0.70/1.08 .
% 0.70/1.08 clause( 1, [ 'is_a_theorem'( equivalent( X, equivalent( equivalent( X,
% 0.70/1.08 equivalent( Y, Z ) ), equivalent( Z, Y ) ) ) ) ] )
% 0.70/1.08 .
% 0.70/1.08 clause( 2, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.70/1.08 equivalent( X, Z ), equivalent( Y, Z ) ) ) ) ] )
% 0.70/1.08 .
% 0.70/1.08 clause( 3, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( a, b )
% 0.70/1.08 , equivalent( c, b ) ), equivalent( a, c ) ) ) ) ] )
% 0.70/1.08 .
% 0.70/1.08 clause( 4, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent( equivalent(
% 0.70/1.08 equivalent( X, Y ), equivalent( equivalent( X, Z ), equivalent( Y, Z ) )
% 0.70/1.08 ), T ) ) ) ] )
% 0.70/1.08 .
% 0.70/1.08 clause( 6, [ 'is_a_theorem'( equivalent( equivalent( equivalent( equivalent(
% 0.70/1.08 X, Y ), equivalent( equivalent( X, Z ), equivalent( Y, Z ) ) ),
% 0.70/1.08 equivalent( T, U ) ), equivalent( U, T ) ) ) ] )
% 0.70/1.08 .
% 0.70/1.08 clause( 7, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ), Z
% 0.70/1.08 ), equivalent( equivalent( equivalent( X, T ), equivalent( Y, T ) ), Z )
% 0.70/1.08 ) ) ] )
% 0.70/1.08 .
% 0.70/1.08 clause( 11, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.70/1.08 equivalent( Z, Y ) ), equivalent( equivalent( X, T ), equivalent( Z, T )
% 0.70/1.08 ) ) ) ] )
% 0.70/1.08 .
% 0.70/1.08 clause( 12, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.70/1.08 equivalent( equivalent( equivalent( X, Y ), Z ), equivalent( equivalent(
% 0.70/1.08 equivalent( X, T ), equivalent( Y, T ) ), Z ) ), U ) ) ) ] )
% 0.70/1.08 .
% 0.70/1.08 clause( 13, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.70/1.08 equivalent( equivalent( equivalent( X, Y ), equivalent( Z, Y ) ),
% 0.70/1.08 equivalent( equivalent( X, T ), equivalent( Z, T ) ) ), U ) ) ) ] )
% 0.70/1.08 .
% 0.70/1.08 clause( 19, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.70/1.08 equivalent( X, Y ), equivalent( Z, Y ) ), T ), equivalent( equivalent( X
% 0.70/1.08 , Z ), T ) ) ) ] )
% 0.70/1.08 .
% 0.70/1.08 clause( 22, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.70/1.08 equivalent( equivalent( X, Z ), T ), equivalent( equivalent( Y, Z ), T )
% 0.70/1.08 ) ) ) ] )
% 0.70/1.08 .
% 0.70/1.08 clause( 25, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.70/1.08 equivalent( X, Y ), Z ), T ), equivalent( equivalent( equivalent(
% 0.70/1.08 equivalent( X, U ), equivalent( Y, U ) ), Z ), T ) ) ) ] )
% 0.70/1.08 .
% 0.70/1.08 clause( 45, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.70/1.08 equivalent( X, Y ), equivalent( Z, Y ) ), T ), equivalent( equivalent(
% 0.70/1.08 equivalent( X, U ), equivalent( Z, U ) ), T ) ) ) ] )
% 0.70/1.08 .
% 0.70/1.08 clause( 60, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.70/1.08 equivalent( Z, Y ) ), equivalent( equivalent( equivalent( X, T ),
% 0.70/1.08 equivalent( U, T ) ), equivalent( Z, U ) ) ) ) ] )
% 0.70/1.08 .
% 0.70/1.08 clause( 65, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.70/1.08 equivalent( X, Y ), Z ), equivalent( T, Z ) ), equivalent( equivalent( X
% 0.70/1.08 , Y ), T ) ) ) ] )
% 0.70/1.08 .
% 0.70/1.08 clause( 77, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent( X
% 0.70/1.08 , Y ) ) ) ] )
% 0.70/1.08 .
% 0.70/1.08 clause( 79, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( equivalent(
% 0.70/1.08 equivalent( equivalent( X, Y ), equivalent( X, Y ) ), Z ) ) ) ] )
% 0.70/1.08 .
% 0.70/1.08 clause( 80, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.70/1.08 equivalent( Z, Y ) ), equivalent( X, Z ) ) ) ] )
% 0.70/1.08 .
% 0.70/1.08 clause( 97, [] )
% 0.70/1.08 .
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 % SZS output end Refutation
% 0.70/1.08 found a proof!
% 0.70/1.08
% 0.70/1.08 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.70/1.08
% 0.70/1.08 initialclauses(
% 0.70/1.08 [ clause( 99, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), ~(
% 0.70/1.08 'is_a_theorem'( X ) ), 'is_a_theorem'( Y ) ] )
% 0.70/1.08 , clause( 100, [ 'is_a_theorem'( equivalent( X, equivalent( equivalent( X,
% 0.70/1.08 equivalent( Y, Z ) ), equivalent( Z, Y ) ) ) ) ] )
% 0.70/1.08 , clause( 101, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.70/1.08 equivalent( X, Z ), equivalent( Y, Z ) ) ) ) ] )
% 0.70/1.08 , clause( 102, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( a,
% 0.70/1.08 b ), equivalent( c, b ) ), equivalent( a, c ) ) ) ) ] )
% 0.70/1.08 ] ).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 subsumption(
% 0.70/1.08 clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.70/1.08 , ~( 'is_a_theorem'( X ) ) ] )
% 0.70/1.08 , clause( 99, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), ~(
% 0.70/1.08 'is_a_theorem'( X ) ), 'is_a_theorem'( Y ) ] )
% 0.70/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.70/1.08 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 subsumption(
% 0.70/1.08 clause( 1, [ 'is_a_theorem'( equivalent( X, equivalent( equivalent( X,
% 0.70/1.08 equivalent( Y, Z ) ), equivalent( Z, Y ) ) ) ) ] )
% 0.70/1.08 , clause( 100, [ 'is_a_theorem'( equivalent( X, equivalent( equivalent( X,
% 0.70/1.08 equivalent( Y, Z ) ), equivalent( Z, Y ) ) ) ) ] )
% 0.70/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.70/1.08 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 subsumption(
% 0.70/1.08 clause( 2, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.70/1.08 equivalent( X, Z ), equivalent( Y, Z ) ) ) ) ] )
% 0.70/1.08 , clause( 101, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.70/1.08 equivalent( X, Z ), equivalent( Y, Z ) ) ) ) ] )
% 0.70/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.70/1.08 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 subsumption(
% 0.70/1.08 clause( 3, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( a, b )
% 0.70/1.08 , equivalent( c, b ) ), equivalent( a, c ) ) ) ) ] )
% 0.70/1.08 , clause( 102, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( a,
% 0.70/1.08 b ), equivalent( c, b ) ), equivalent( a, c ) ) ) ) ] )
% 0.70/1.08 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 resolution(
% 0.70/1.08 clause( 104, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.70/1.08 ), equivalent( equivalent( X, Z ), equivalent( Y, Z ) ) ), T ) ) ),
% 0.70/1.08 'is_a_theorem'( T ) ] )
% 0.70/1.08 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.70/1.08 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.70/1.08 , 2, clause( 2, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.70/1.08 equivalent( equivalent( X, Z ), equivalent( Y, Z ) ) ) ) ] )
% 0.70/1.08 , 0, substitution( 0, [ :=( X, equivalent( equivalent( X, Y ), equivalent(
% 0.70/1.08 equivalent( X, Z ), equivalent( Y, Z ) ) ) ), :=( Y, T )] ),
% 0.70/1.08 substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 subsumption(
% 0.70/1.08 clause( 4, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent( equivalent(
% 0.70/1.08 equivalent( X, Y ), equivalent( equivalent( X, Z ), equivalent( Y, Z ) )
% 0.70/1.08 ), T ) ) ) ] )
% 0.70/1.08 , clause( 104, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( X,
% 0.70/1.08 Y ), equivalent( equivalent( X, Z ), equivalent( Y, Z ) ) ), T ) ) ),
% 0.70/1.08 'is_a_theorem'( T ) ] )
% 0.70/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.70/1.08 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 resolution(
% 0.70/1.08 clause( 105, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.70/1.08 equivalent( X, Y ), equivalent( equivalent( X, Z ), equivalent( Y, Z ) )
% 0.70/1.08 ), equivalent( T, U ) ), equivalent( U, T ) ) ) ] )
% 0.70/1.08 , clause( 4, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent(
% 0.70/1.08 equivalent( equivalent( X, Y ), equivalent( equivalent( X, Z ),
% 0.70/1.08 equivalent( Y, Z ) ) ), T ) ) ) ] )
% 0.70/1.08 , 1, clause( 1, [ 'is_a_theorem'( equivalent( X, equivalent( equivalent( X
% 0.70/1.08 , equivalent( Y, Z ) ), equivalent( Z, Y ) ) ) ) ] )
% 0.70/1.08 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T,
% 0.70/1.08 equivalent( equivalent( equivalent( equivalent( X, Y ), equivalent(
% 0.70/1.08 equivalent( X, Z ), equivalent( Y, Z ) ) ), equivalent( T, U ) ),
% 0.70/1.08 equivalent( U, T ) ) )] ), substitution( 1, [ :=( X, equivalent(
% 0.70/1.08 equivalent( X, Y ), equivalent( equivalent( X, Z ), equivalent( Y, Z ) )
% 0.70/1.08 ) ), :=( Y, T ), :=( Z, U )] )).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 subsumption(
% 0.70/1.08 clause( 6, [ 'is_a_theorem'( equivalent( equivalent( equivalent( equivalent(
% 0.70/1.08 X, Y ), equivalent( equivalent( X, Z ), equivalent( Y, Z ) ) ),
% 0.70/1.08 equivalent( T, U ) ), equivalent( U, T ) ) ) ] )
% 0.70/1.08 , clause( 105, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.70/1.08 equivalent( X, Y ), equivalent( equivalent( X, Z ), equivalent( Y, Z ) )
% 0.70/1.08 ), equivalent( T, U ) ), equivalent( U, T ) ) ) ] )
% 0.70/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.70/1.08 , U )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 resolution(
% 0.70/1.08 clause( 106, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.70/1.08 Z ), equivalent( equivalent( equivalent( X, T ), equivalent( Y, T ) ), Z
% 0.70/1.08 ) ) ) ] )
% 0.70/1.08 , clause( 4, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent(
% 0.70/1.08 equivalent( equivalent( X, Y ), equivalent( equivalent( X, Z ),
% 0.70/1.08 equivalent( Y, Z ) ) ), T ) ) ) ] )
% 0.70/1.08 , 1, clause( 2, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.70/1.08 equivalent( equivalent( X, Z ), equivalent( Y, Z ) ) ) ) ] )
% 0.70/1.08 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, T ), :=( T,
% 0.70/1.08 equivalent( equivalent( equivalent( X, Y ), Z ), equivalent( equivalent(
% 0.70/1.08 equivalent( X, T ), equivalent( Y, T ) ), Z ) ) )] ), substitution( 1, [
% 0.70/1.08 :=( X, equivalent( X, Y ) ), :=( Y, equivalent( equivalent( X, T ),
% 0.70/1.08 equivalent( Y, T ) ) ), :=( Z, Z )] )).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 subsumption(
% 0.70/1.08 clause( 7, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ), Z
% 0.70/1.08 ), equivalent( equivalent( equivalent( X, T ), equivalent( Y, T ) ), Z )
% 0.70/1.08 ) ) ] )
% 0.70/1.08 , clause( 106, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y )
% 0.70/1.08 , Z ), equivalent( equivalent( equivalent( X, T ), equivalent( Y, T ) ),
% 0.70/1.08 Z ) ) ) ] )
% 0.70/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.70/1.08 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 resolution(
% 0.70/1.08 clause( 107, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.70/1.08 equivalent( Z, Y ) ), equivalent( equivalent( X, T ), equivalent( Z, T )
% 0.70/1.08 ) ) ) ] )
% 0.70/1.08 , clause( 4, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent(
% 0.70/1.08 equivalent( equivalent( X, Y ), equivalent( equivalent( X, Z ),
% 0.70/1.08 equivalent( Y, Z ) ) ), T ) ) ) ] )
% 0.70/1.08 , 1, clause( 7, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.70/1.08 ), Z ), equivalent( equivalent( equivalent( X, T ), equivalent( Y, T ) )
% 0.70/1.08 , Z ) ) ) ] )
% 0.70/1.08 , 0, substitution( 0, [ :=( X, X ), :=( Y, Z ), :=( Z, T ), :=( T,
% 0.70/1.08 equivalent( equivalent( equivalent( X, Y ), equivalent( Z, Y ) ),
% 0.70/1.08 equivalent( equivalent( X, T ), equivalent( Z, T ) ) ) )] ),
% 0.70/1.08 substitution( 1, [ :=( X, X ), :=( Y, Z ), :=( Z, equivalent( equivalent(
% 0.70/1.08 X, T ), equivalent( Z, T ) ) ), :=( T, Y )] )).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 subsumption(
% 0.70/1.08 clause( 11, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.70/1.08 equivalent( Z, Y ) ), equivalent( equivalent( X, T ), equivalent( Z, T )
% 0.70/1.08 ) ) ) ] )
% 0.70/1.08 , clause( 107, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y )
% 0.70/1.08 , equivalent( Z, Y ) ), equivalent( equivalent( X, T ), equivalent( Z, T
% 0.70/1.08 ) ) ) ) ] )
% 0.70/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.70/1.08 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 resolution(
% 0.70/1.08 clause( 109, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.70/1.08 equivalent( X, Y ), Z ), equivalent( equivalent( equivalent( X, T ),
% 0.70/1.08 equivalent( Y, T ) ), Z ) ), U ) ) ), 'is_a_theorem'( U ) ] )
% 0.70/1.08 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.70/1.08 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.70/1.08 , 2, clause( 7, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.70/1.08 ), Z ), equivalent( equivalent( equivalent( X, T ), equivalent( Y, T ) )
% 0.70/1.08 , Z ) ) ) ] )
% 0.70/1.08 , 0, substitution( 0, [ :=( X, equivalent( equivalent( equivalent( X, Y ),
% 0.70/1.08 Z ), equivalent( equivalent( equivalent( X, T ), equivalent( Y, T ) ), Z
% 0.70/1.08 ) ) ), :=( Y, U )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z,
% 0.70/1.08 Z ), :=( T, T )] )).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 subsumption(
% 0.70/1.08 clause( 12, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.70/1.08 equivalent( equivalent( equivalent( X, Y ), Z ), equivalent( equivalent(
% 0.70/1.08 equivalent( X, T ), equivalent( Y, T ) ), Z ) ), U ) ) ) ] )
% 0.70/1.08 , clause( 109, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.70/1.08 equivalent( X, Y ), Z ), equivalent( equivalent( equivalent( X, T ),
% 0.70/1.08 equivalent( Y, T ) ), Z ) ), U ) ) ), 'is_a_theorem'( U ) ] )
% 0.70/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.70/1.08 , U )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 resolution(
% 0.70/1.08 clause( 111, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.70/1.08 equivalent( X, Y ), equivalent( Z, Y ) ), equivalent( equivalent( X, T )
% 0.70/1.08 , equivalent( Z, T ) ) ), U ) ) ), 'is_a_theorem'( U ) ] )
% 0.70/1.08 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.70/1.08 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.70/1.08 , 2, clause( 11, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.70/1.08 ), equivalent( Z, Y ) ), equivalent( equivalent( X, T ), equivalent( Z,
% 0.70/1.08 T ) ) ) ) ] )
% 0.70/1.08 , 0, substitution( 0, [ :=( X, equivalent( equivalent( equivalent( X, Y ),
% 0.70/1.08 equivalent( Z, Y ) ), equivalent( equivalent( X, T ), equivalent( Z, T )
% 0.70/1.08 ) ) ), :=( Y, U )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z,
% 0.70/1.08 Z ), :=( T, T )] )).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 subsumption(
% 0.70/1.08 clause( 13, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.70/1.08 equivalent( equivalent( equivalent( X, Y ), equivalent( Z, Y ) ),
% 0.70/1.08 equivalent( equivalent( X, T ), equivalent( Z, T ) ) ), U ) ) ) ] )
% 0.70/1.08 , clause( 111, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.70/1.08 equivalent( X, Y ), equivalent( Z, Y ) ), equivalent( equivalent( X, T )
% 0.70/1.08 , equivalent( Z, T ) ) ), U ) ) ), 'is_a_theorem'( U ) ] )
% 0.70/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.70/1.08 , U )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 resolution(
% 0.70/1.08 clause( 112, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.70/1.08 equivalent( X, Y ), equivalent( Z, Y ) ), T ), equivalent( equivalent( X
% 0.70/1.08 , Z ), T ) ) ) ] )
% 0.70/1.08 , clause( 4, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent(
% 0.70/1.08 equivalent( equivalent( X, Y ), equivalent( equivalent( X, Z ),
% 0.70/1.08 equivalent( Y, Z ) ) ), T ) ) ) ] )
% 0.70/1.08 , 1, clause( 6, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.70/1.08 equivalent( X, Y ), equivalent( equivalent( X, Z ), equivalent( Y, Z ) )
% 0.70/1.08 ), equivalent( T, U ) ), equivalent( U, T ) ) ) ] )
% 0.70/1.08 , 0, substitution( 0, [ :=( X, equivalent( X, Z ) ), :=( Y, equivalent(
% 0.70/1.08 equivalent( X, Y ), equivalent( Z, Y ) ) ), :=( Z, T ), :=( T, equivalent(
% 0.70/1.08 equivalent( equivalent( equivalent( X, Y ), equivalent( Z, Y ) ), T ),
% 0.70/1.08 equivalent( equivalent( X, Z ), T ) ) )] ), substitution( 1, [ :=( X, X )
% 0.70/1.08 , :=( Y, Z ), :=( Z, Y ), :=( T, equivalent( equivalent( X, Z ), T ) ),
% 0.70/1.08 :=( U, equivalent( equivalent( equivalent( X, Y ), equivalent( Z, Y ) ),
% 0.70/1.08 T ) )] )).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 subsumption(
% 0.70/1.08 clause( 19, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.70/1.08 equivalent( X, Y ), equivalent( Z, Y ) ), T ), equivalent( equivalent( X
% 0.70/1.08 , Z ), T ) ) ) ] )
% 0.70/1.08 , clause( 112, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.70/1.08 equivalent( X, Y ), equivalent( Z, Y ) ), T ), equivalent( equivalent( X
% 0.70/1.08 , Z ), T ) ) ) ] )
% 0.70/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.70/1.08 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 resolution(
% 0.70/1.08 clause( 113, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.70/1.08 equivalent( equivalent( X, Z ), T ), equivalent( equivalent( Y, Z ), T )
% 0.70/1.08 ) ) ) ] )
% 0.70/1.08 , clause( 4, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent(
% 0.70/1.08 equivalent( equivalent( X, Y ), equivalent( equivalent( X, Z ),
% 0.70/1.08 equivalent( Y, Z ) ) ), T ) ) ) ] )
% 0.70/1.08 , 1, clause( 19, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.70/1.08 equivalent( X, Y ), equivalent( Z, Y ) ), T ), equivalent( equivalent( X
% 0.70/1.08 , Z ), T ) ) ) ] )
% 0.70/1.08 , 0, substitution( 0, [ :=( X, equivalent( X, Z ) ), :=( Y, equivalent( Y,
% 0.70/1.08 Z ) ), :=( Z, T ), :=( T, equivalent( equivalent( X, Y ), equivalent(
% 0.70/1.08 equivalent( equivalent( X, Z ), T ), equivalent( equivalent( Y, Z ), T )
% 0.70/1.08 ) ) )] ), substitution( 1, [ :=( X, X ), :=( Y, Z ), :=( Z, Y ), :=( T,
% 0.70/1.08 equivalent( equivalent( equivalent( X, Z ), T ), equivalent( equivalent(
% 0.70/1.08 Y, Z ), T ) ) )] )).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 subsumption(
% 0.70/1.08 clause( 22, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.70/1.08 equivalent( equivalent( X, Z ), T ), equivalent( equivalent( Y, Z ), T )
% 0.70/1.08 ) ) ) ] )
% 0.70/1.08 , clause( 113, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.70/1.08 equivalent( equivalent( X, Z ), T ), equivalent( equivalent( Y, Z ), T )
% 0.70/1.08 ) ) ) ] )
% 0.70/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.70/1.08 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 resolution(
% 0.70/1.08 clause( 114, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.70/1.08 equivalent( X, Y ), Z ), T ), equivalent( equivalent( equivalent(
% 0.70/1.08 equivalent( X, U ), equivalent( Y, U ) ), Z ), T ) ) ) ] )
% 0.70/1.08 , clause( 4, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent(
% 0.70/1.08 equivalent( equivalent( X, Y ), equivalent( equivalent( X, Z ),
% 0.70/1.08 equivalent( Y, Z ) ) ), T ) ) ) ] )
% 0.70/1.08 , 1, clause( 22, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.70/1.08 equivalent( equivalent( equivalent( X, Z ), T ), equivalent( equivalent(
% 0.70/1.08 Y, Z ), T ) ) ) ) ] )
% 0.70/1.08 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, U ), :=( T,
% 0.70/1.08 equivalent( equivalent( equivalent( equivalent( X, Y ), Z ), T ),
% 0.70/1.08 equivalent( equivalent( equivalent( equivalent( X, U ), equivalent( Y, U
% 0.70/1.08 ) ), Z ), T ) ) )] ), substitution( 1, [ :=( X, equivalent( X, Y ) ),
% 0.70/1.08 :=( Y, equivalent( equivalent( X, U ), equivalent( Y, U ) ) ), :=( Z, Z )
% 0.70/1.08 , :=( T, T )] )).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 subsumption(
% 0.70/1.08 clause( 25, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.70/1.08 equivalent( X, Y ), Z ), T ), equivalent( equivalent( equivalent(
% 0.70/1.08 equivalent( X, U ), equivalent( Y, U ) ), Z ), T ) ) ) ] )
% 0.70/1.08 , clause( 114, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.70/1.08 equivalent( X, Y ), Z ), T ), equivalent( equivalent( equivalent(
% 0.70/1.08 equivalent( X, U ), equivalent( Y, U ) ), Z ), T ) ) ) ] )
% 0.70/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.70/1.08 , U )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 resolution(
% 0.70/1.08 clause( 115, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.70/1.08 equivalent( X, Y ), equivalent( Z, Y ) ), T ), equivalent( equivalent(
% 0.70/1.08 equivalent( X, U ), equivalent( Z, U ) ), T ) ) ) ] )
% 0.70/1.08 , clause( 12, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.70/1.08 equivalent( equivalent( equivalent( X, Y ), Z ), equivalent( equivalent(
% 0.70/1.08 equivalent( X, T ), equivalent( Y, T ) ), Z ) ), U ) ) ) ] )
% 0.70/1.08 , 1, clause( 25, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.70/1.08 equivalent( X, Y ), Z ), T ), equivalent( equivalent( equivalent(
% 0.70/1.08 equivalent( X, U ), equivalent( Y, U ) ), Z ), T ) ) ) ] )
% 0.70/1.08 , 0, substitution( 0, [ :=( X, X ), :=( Y, Z ), :=( Z, T ), :=( T, U ),
% 0.70/1.08 :=( U, equivalent( equivalent( equivalent( equivalent( X, Y ), equivalent(
% 0.70/1.08 Z, Y ) ), T ), equivalent( equivalent( equivalent( X, U ), equivalent( Z
% 0.70/1.08 , U ) ), T ) ) )] ), substitution( 1, [ :=( X, X ), :=( Y, Z ), :=( Z, T
% 0.70/1.08 ), :=( T, equivalent( equivalent( equivalent( X, U ), equivalent( Z, U )
% 0.70/1.08 ), T ) ), :=( U, Y )] )).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 subsumption(
% 0.70/1.08 clause( 45, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.70/1.08 equivalent( X, Y ), equivalent( Z, Y ) ), T ), equivalent( equivalent(
% 0.70/1.08 equivalent( X, U ), equivalent( Z, U ) ), T ) ) ) ] )
% 0.70/1.08 , clause( 115, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.70/1.08 equivalent( X, Y ), equivalent( Z, Y ) ), T ), equivalent( equivalent(
% 0.70/1.08 equivalent( X, U ), equivalent( Z, U ) ), T ) ) ) ] )
% 0.70/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.70/1.08 , U )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 resolution(
% 0.70/1.08 clause( 116, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.70/1.08 equivalent( Z, Y ) ), equivalent( equivalent( equivalent( X, T ),
% 0.70/1.08 equivalent( U, T ) ), equivalent( Z, U ) ) ) ) ] )
% 0.70/1.08 , clause( 12, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.70/1.08 equivalent( equivalent( equivalent( X, Y ), Z ), equivalent( equivalent(
% 0.70/1.08 equivalent( X, T ), equivalent( Y, T ) ), Z ) ), U ) ) ) ] )
% 0.70/1.08 , 1, clause( 45, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.70/1.08 equivalent( X, Y ), equivalent( Z, Y ) ), T ), equivalent( equivalent(
% 0.70/1.08 equivalent( X, U ), equivalent( Z, U ) ), T ) ) ) ] )
% 0.70/1.08 , 0, substitution( 0, [ :=( X, X ), :=( Y, U ), :=( Z, equivalent( Z, U ) )
% 0.70/1.08 , :=( T, T ), :=( U, equivalent( equivalent( equivalent( X, Y ),
% 0.70/1.08 equivalent( Z, Y ) ), equivalent( equivalent( equivalent( X, T ),
% 0.70/1.08 equivalent( U, T ) ), equivalent( Z, U ) ) ) )] ), substitution( 1, [
% 0.70/1.08 :=( X, X ), :=( Y, U ), :=( Z, Z ), :=( T, equivalent( equivalent(
% 0.70/1.08 equivalent( X, T ), equivalent( U, T ) ), equivalent( Z, U ) ) ), :=( U,
% 0.70/1.08 Y )] )).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 subsumption(
% 0.70/1.08 clause( 60, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.70/1.08 equivalent( Z, Y ) ), equivalent( equivalent( equivalent( X, T ),
% 0.70/1.08 equivalent( U, T ) ), equivalent( Z, U ) ) ) ) ] )
% 0.70/1.08 , clause( 116, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y )
% 0.70/1.08 , equivalent( Z, Y ) ), equivalent( equivalent( equivalent( X, T ),
% 0.70/1.08 equivalent( U, T ) ), equivalent( Z, U ) ) ) ) ] )
% 0.70/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.70/1.08 , U )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 resolution(
% 0.70/1.08 clause( 117, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.70/1.08 equivalent( X, Y ), Z ), equivalent( T, Z ) ), equivalent( equivalent( X
% 0.70/1.08 , Y ), T ) ) ) ] )
% 0.70/1.08 , clause( 13, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.70/1.08 equivalent( equivalent( equivalent( X, Y ), equivalent( Z, Y ) ),
% 0.70/1.08 equivalent( equivalent( X, T ), equivalent( Z, T ) ) ), U ) ) ) ] )
% 0.70/1.08 , 1, clause( 60, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.70/1.08 ), equivalent( Z, Y ) ), equivalent( equivalent( equivalent( X, T ),
% 0.70/1.08 equivalent( U, T ) ), equivalent( Z, U ) ) ) ) ] )
% 0.70/1.08 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, U ), :=( T, Y ),
% 0.70/1.08 :=( U, equivalent( equivalent( equivalent( equivalent( X, Y ), Z ),
% 0.70/1.08 equivalent( T, Z ) ), equivalent( equivalent( X, Y ), T ) ) )] ),
% 0.70/1.08 substitution( 1, [ :=( X, equivalent( X, Y ) ), :=( Y, equivalent( U, Y )
% 0.70/1.08 ), :=( Z, equivalent( X, Y ) ), :=( T, Z ), :=( U, T )] )).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 subsumption(
% 0.70/1.08 clause( 65, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.70/1.08 equivalent( X, Y ), Z ), equivalent( T, Z ) ), equivalent( equivalent( X
% 0.70/1.08 , Y ), T ) ) ) ] )
% 0.70/1.08 , clause( 117, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.70/1.08 equivalent( X, Y ), Z ), equivalent( T, Z ) ), equivalent( equivalent( X
% 0.70/1.08 , Y ), T ) ) ) ] )
% 0.70/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.70/1.08 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 resolution(
% 0.70/1.08 clause( 118, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.70/1.08 X, Y ) ) ) ] )
% 0.70/1.08 , clause( 13, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.70/1.08 equivalent( equivalent( equivalent( X, Y ), equivalent( Z, Y ) ),
% 0.70/1.08 equivalent( equivalent( X, T ), equivalent( Z, T ) ) ), U ) ) ) ] )
% 0.70/1.08 , 1, clause( 65, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.70/1.08 equivalent( X, Y ), Z ), equivalent( T, Z ) ), equivalent( equivalent( X
% 0.70/1.08 , Y ), T ) ) ) ] )
% 0.70/1.08 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, Y ),
% 0.70/1.08 :=( U, equivalent( equivalent( X, Y ), equivalent( X, Y ) ) )] ),
% 0.70/1.08 substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, equivalent( Z, Y ) ),
% 0.70/1.08 :=( T, equivalent( X, Y ) )] )).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 subsumption(
% 0.70/1.08 clause( 77, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent( X
% 0.70/1.08 , Y ) ) ) ] )
% 0.70/1.08 , clause( 118, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.70/1.08 X, Y ) ) ) ] )
% 0.70/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.70/1.08 )] ) ).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 resolution(
% 0.70/1.08 clause( 120, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.70/1.08 ), equivalent( X, Y ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.70/1.08 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.70/1.08 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.70/1.08 , 2, clause( 77, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.70/1.08 equivalent( X, Y ) ) ) ] )
% 0.70/1.08 , 0, substitution( 0, [ :=( X, equivalent( equivalent( X, Y ), equivalent(
% 0.70/1.08 X, Y ) ) ), :=( Y, Z )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )
% 0.70/1.08 ).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 subsumption(
% 0.70/1.08 clause( 79, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( equivalent(
% 0.70/1.08 equivalent( equivalent( X, Y ), equivalent( X, Y ) ), Z ) ) ) ] )
% 0.70/1.08 , clause( 120, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( X,
% 0.70/1.08 Y ), equivalent( X, Y ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.70/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.70/1.08 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 resolution(
% 0.70/1.08 clause( 121, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.70/1.08 equivalent( Z, Y ) ), equivalent( X, Z ) ) ) ] )
% 0.70/1.08 , clause( 79, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( equivalent(
% 0.70/1.08 equivalent( equivalent( X, Y ), equivalent( X, Y ) ), Z ) ) ) ] )
% 0.70/1.08 , 1, clause( 60, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.70/1.08 ), equivalent( Z, Y ) ), equivalent( equivalent( equivalent( X, T ),
% 0.70/1.08 equivalent( U, T ) ), equivalent( Z, U ) ) ) ) ] )
% 0.70/1.08 , 0, substitution( 0, [ :=( X, X ), :=( Y, T ), :=( Z, equivalent(
% 0.70/1.08 equivalent( equivalent( X, Y ), equivalent( Z, Y ) ), equivalent( X, Z )
% 0.70/1.08 ) )] ), substitution( 1, [ :=( X, X ), :=( Y, T ), :=( Z, X ), :=( T, Y
% 0.70/1.08 ), :=( U, Z )] )).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 subsumption(
% 0.70/1.08 clause( 80, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.70/1.08 equivalent( Z, Y ) ), equivalent( X, Z ) ) ) ] )
% 0.70/1.08 , clause( 121, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y )
% 0.70/1.08 , equivalent( Z, Y ) ), equivalent( X, Z ) ) ) ] )
% 0.70/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.70/1.08 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 resolution(
% 0.70/1.08 clause( 122, [] )
% 0.70/1.08 , clause( 3, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( a, b
% 0.70/1.08 ), equivalent( c, b ) ), equivalent( a, c ) ) ) ) ] )
% 0.70/1.08 , 0, clause( 80, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.70/1.08 ), equivalent( Z, Y ) ), equivalent( X, Z ) ) ) ] )
% 0.70/1.08 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, a ), :=( Y, b ), :=(
% 0.70/1.08 Z, c )] )).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 subsumption(
% 0.70/1.08 clause( 97, [] )
% 0.70/1.08 , clause( 122, [] )
% 0.70/1.08 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 end.
% 0.70/1.08
% 0.70/1.08 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.70/1.08
% 0.70/1.08 Memory use:
% 0.70/1.08
% 0.70/1.08 space for terms: 2099
% 0.70/1.08 space for clauses: 12142
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 clauses generated: 153
% 0.70/1.08 clauses kept: 98
% 0.70/1.08 clauses selected: 32
% 0.70/1.08 clauses deleted: 0
% 0.70/1.08 clauses inuse deleted: 0
% 0.70/1.08
% 0.70/1.08 subsentry: 88
% 0.70/1.08 literals s-matched: 55
% 0.70/1.08 literals matched: 55
% 0.70/1.08 full subsumption: 0
% 0.70/1.08
% 0.70/1.08 checksum: -1611680824
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 Bliksem ended
%------------------------------------------------------------------------------