TSTP Solution File: LCL257-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL257-1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n026.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:52:19 EDT 2022
% Result : Unsatisfiable 0.47s 1.14s
% Output : Refutation 0.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : LCL257-1 : TPTP v8.1.0. Released v2.0.0.
% 0.08/0.14 % Command : bliksem %s
% 0.14/0.35 % Computer : n026.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % DateTime : Sat Jul 2 16:54:35 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.47/1.14 *** allocated 10000 integers for termspace/termends
% 0.47/1.14 *** allocated 10000 integers for clauses
% 0.47/1.14 *** allocated 10000 integers for justifications
% 0.47/1.14 Bliksem 1.12
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 Automatic Strategy Selection
% 0.47/1.14
% 0.47/1.14 Clauses:
% 0.47/1.14 [
% 0.47/1.14 [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), ~( 'is_a_theorem'( X ) ),
% 0.47/1.14 'is_a_theorem'( Y ) ],
% 0.47/1.14 [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent( equivalent(
% 0.47/1.14 Z, Y ), equivalent( X, Z ) ) ) ) ],
% 0.47/1.14 [ ~( 'is_a_theorem'( equivalent( x, equivalent( equivalent( y, z ),
% 0.47/1.14 equivalent( equivalent( z, x ), y ) ) ) ) ) ]
% 0.47/1.14 ] .
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 percentage equality = 0.000000, percentage horn = 1.000000
% 0.47/1.14 This is a near-Horn, non-equality problem
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 Options Used:
% 0.47/1.14
% 0.47/1.14 useres = 1
% 0.47/1.14 useparamod = 0
% 0.47/1.14 useeqrefl = 0
% 0.47/1.14 useeqfact = 0
% 0.47/1.14 usefactor = 1
% 0.47/1.14 usesimpsplitting = 0
% 0.47/1.14 usesimpdemod = 0
% 0.47/1.14 usesimpres = 4
% 0.47/1.14
% 0.47/1.14 resimpinuse = 1000
% 0.47/1.14 resimpclauses = 20000
% 0.47/1.14 substype = standard
% 0.47/1.14 backwardsubs = 1
% 0.47/1.14 selectoldest = 5
% 0.47/1.14
% 0.47/1.14 litorderings [0] = split
% 0.47/1.14 litorderings [1] = liftord
% 0.47/1.14
% 0.47/1.14 termordering = none
% 0.47/1.14
% 0.47/1.14 litapriori = 1
% 0.47/1.14 termapriori = 0
% 0.47/1.14 litaposteriori = 0
% 0.47/1.14 termaposteriori = 0
% 0.47/1.14 demodaposteriori = 0
% 0.47/1.14 ordereqreflfact = 0
% 0.47/1.14
% 0.47/1.14 litselect = negative
% 0.47/1.14
% 0.47/1.14 maxweight = 30000
% 0.47/1.14 maxdepth = 30000
% 0.47/1.14 maxlength = 115
% 0.47/1.14 maxnrvars = 195
% 0.47/1.14 excuselevel = 0
% 0.47/1.14 increasemaxweight = 0
% 0.47/1.14
% 0.47/1.14 maxselected = 10000000
% 0.47/1.14 maxnrclauses = 10000000
% 0.47/1.14
% 0.47/1.14 showgenerated = 0
% 0.47/1.14 showkept = 0
% 0.47/1.14 showselected = 0
% 0.47/1.14 showdeleted = 0
% 0.47/1.14 showresimp = 1
% 0.47/1.14 showstatus = 2000
% 0.47/1.14
% 0.47/1.14 prologoutput = 1
% 0.47/1.14 nrgoals = 5000000
% 0.47/1.14 totalproof = 1
% 0.47/1.14
% 0.47/1.14 Symbols occurring in the translation:
% 0.47/1.14
% 0.47/1.14 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.47/1.14 . [1, 2] (w:1, o:21, a:1, s:1, b:0),
% 0.47/1.14 ! [4, 1] (w:1, o:15, a:1, s:1, b:0),
% 0.47/1.14 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.47/1.14 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.47/1.14 equivalent [41, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.47/1.14 'is_a_theorem' [42, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.47/1.14 x [44, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.47/1.14 y [45, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.47/1.14 z [46, 0] (w:1, o:14, a:1, s:1, b:0).
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 Starting Search:
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 Bliksems!, er is een bewijs:
% 0.47/1.14 % SZS status Unsatisfiable
% 0.47/1.14 % SZS output start Refutation
% 0.47/1.14
% 0.47/1.14 clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.47/1.14 , ~( 'is_a_theorem'( X ) ) ] )
% 0.47/1.14 .
% 0.47/1.14 clause( 1, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.47/1.14 equivalent( Z, Y ), equivalent( X, Z ) ) ) ) ] )
% 0.47/1.14 .
% 0.47/1.14 clause( 2, [ ~( 'is_a_theorem'( equivalent( x, equivalent( equivalent( y, z
% 0.47/1.14 ), equivalent( equivalent( z, x ), y ) ) ) ) ) ] )
% 0.47/1.14 .
% 0.47/1.14 clause( 3, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent( equivalent(
% 0.47/1.14 equivalent( X, Y ), equivalent( equivalent( Z, Y ), equivalent( X, Z ) )
% 0.47/1.14 ), T ) ) ) ] )
% 0.47/1.14 .
% 0.47/1.14 clause( 4, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.47/1.14 equivalent( Y, Z ), equivalent( T, Y ) ) ), equivalent( equivalent( T, Z
% 0.47/1.14 ), X ) ) ) ] )
% 0.47/1.14 .
% 0.47/1.14 clause( 5, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent( X
% 0.47/1.14 , Y ) ) ) ] )
% 0.47/1.14 .
% 0.47/1.14 clause( 6, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent( equivalent(
% 0.47/1.14 equivalent( X, equivalent( equivalent( Y, Z ), equivalent( T, Y ) ) ),
% 0.47/1.14 equivalent( equivalent( T, Z ), X ) ), U ) ) ) ] )
% 0.47/1.14 .
% 0.47/1.14 clause( 7, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( equivalent( equivalent(
% 0.47/1.14 equivalent( X, Y ), equivalent( X, Y ) ), Z ) ) ) ] )
% 0.47/1.14 .
% 0.47/1.14 clause( 8, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y, Z )
% 0.47/1.14 ), equivalent( equivalent( Y, Z ), X ) ) ) ] )
% 0.47/1.14 .
% 0.47/1.14 clause( 9, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.47/1.14 equivalent( Z, X ) ), equivalent( Z, Y ) ) ) ] )
% 0.47/1.14 .
% 0.47/1.14 clause( 11, [ 'is_a_theorem'( equivalent( X, X ) ) ] )
% 0.47/1.14 .
% 0.47/1.14 clause( 12, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent(
% 0.47/1.14 equivalent( equivalent( equivalent( X, Y ), equivalent( Z, X ) ),
% 0.47/1.14 equivalent( Z, Y ) ), T ) ) ) ] )
% 0.47/1.14 .
% 0.47/1.14 clause( 13, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( equivalent(
% 0.47/1.14 equivalent( X, X ), Y ) ) ) ] )
% 0.47/1.14 .
% 0.47/1.14 clause( 14, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ), Z
% 0.47/1.14 ), equivalent( Z, equivalent( equivalent( T, Y ), equivalent( X, T ) ) )
% 0.47/1.14 ) ) ] )
% 0.47/1.14 .
% 0.47/1.14 clause( 17, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent( Y
% 0.47/1.14 , X ) ) ) ] )
% 0.47/1.14 .
% 0.47/1.14 clause( 18, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( equivalent(
% 0.47/1.14 equivalent( equivalent( X, Y ), equivalent( Y, X ) ), Z ) ) ) ] )
% 0.47/1.14 .
% 0.47/1.14 clause( 19, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.47/1.14 equivalent( X, Z ), equivalent( Z, Y ) ) ) ) ] )
% 0.47/1.14 .
% 0.47/1.14 clause( 21, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ), Z
% 0.47/1.14 ), equivalent( Z, equivalent( Y, X ) ) ) ) ] )
% 0.47/1.14 .
% 0.47/1.14 clause( 25, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.47/1.14 equivalent( Z, X ) ), equivalent( Y, Z ) ) ) ] )
% 0.47/1.14 .
% 0.47/1.14 clause( 27, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent(
% 0.47/1.14 equivalent( equivalent( equivalent( X, Y ), equivalent( Z, X ) ),
% 0.47/1.14 equivalent( Y, Z ) ), T ) ) ) ] )
% 0.47/1.14 .
% 0.47/1.14 clause( 48, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.47/1.14 equivalent( Z, X ) ), equivalent( equivalent( T, Y ), equivalent( Z, T )
% 0.47/1.14 ) ) ) ] )
% 0.47/1.14 .
% 0.47/1.14 clause( 597, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.47/1.14 equivalent( Y, Z ), Y ) ), equivalent( Z, X ) ) ) ] )
% 0.47/1.14 .
% 0.47/1.14 clause( 607, [ 'is_a_theorem'( equivalent( X, equivalent( equivalent( Y, Z
% 0.47/1.14 ), equivalent( equivalent( Z, X ), Y ) ) ) ) ] )
% 0.47/1.14 .
% 0.47/1.14 clause( 952, [] )
% 0.47/1.14 .
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 % SZS output end Refutation
% 0.47/1.14 found a proof!
% 0.47/1.14
% 0.47/1.14 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.47/1.14
% 0.47/1.14 initialclauses(
% 0.47/1.14 [ clause( 954, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), ~(
% 0.47/1.14 'is_a_theorem'( X ) ), 'is_a_theorem'( Y ) ] )
% 0.47/1.14 , clause( 955, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.47/1.14 equivalent( Z, Y ), equivalent( X, Z ) ) ) ) ] )
% 0.47/1.14 , clause( 956, [ ~( 'is_a_theorem'( equivalent( x, equivalent( equivalent(
% 0.47/1.14 y, z ), equivalent( equivalent( z, x ), y ) ) ) ) ) ] )
% 0.47/1.14 ] ).
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 subsumption(
% 0.47/1.14 clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.47/1.14 , ~( 'is_a_theorem'( X ) ) ] )
% 0.47/1.14 , clause( 954, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), ~(
% 0.47/1.14 'is_a_theorem'( X ) ), 'is_a_theorem'( Y ) ] )
% 0.47/1.14 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.47/1.14 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 subsumption(
% 0.47/1.14 clause( 1, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.47/1.14 equivalent( Z, Y ), equivalent( X, Z ) ) ) ) ] )
% 0.47/1.14 , clause( 955, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.47/1.14 equivalent( Z, Y ), equivalent( X, Z ) ) ) ) ] )
% 0.47/1.14 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.47/1.14 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 subsumption(
% 0.47/1.14 clause( 2, [ ~( 'is_a_theorem'( equivalent( x, equivalent( equivalent( y, z
% 0.47/1.14 ), equivalent( equivalent( z, x ), y ) ) ) ) ) ] )
% 0.47/1.14 , clause( 956, [ ~( 'is_a_theorem'( equivalent( x, equivalent( equivalent(
% 0.47/1.14 y, z ), equivalent( equivalent( z, x ), y ) ) ) ) ) ] )
% 0.47/1.14 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 resolution(
% 0.47/1.14 clause( 958, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.47/1.14 ), equivalent( equivalent( Z, Y ), equivalent( X, Z ) ) ), T ) ) ),
% 0.47/1.14 'is_a_theorem'( T ) ] )
% 0.47/1.14 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.47/1.14 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.47/1.14 , 2, clause( 1, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.47/1.14 equivalent( equivalent( Z, Y ), equivalent( X, Z ) ) ) ) ] )
% 0.47/1.14 , 0, substitution( 0, [ :=( X, equivalent( equivalent( X, Y ), equivalent(
% 0.47/1.14 equivalent( Z, Y ), equivalent( X, Z ) ) ) ), :=( Y, T )] ),
% 0.47/1.14 substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 subsumption(
% 0.47/1.14 clause( 3, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent( equivalent(
% 0.47/1.14 equivalent( X, Y ), equivalent( equivalent( Z, Y ), equivalent( X, Z ) )
% 0.47/1.14 ), T ) ) ) ] )
% 0.47/1.14 , clause( 958, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( X,
% 0.47/1.14 Y ), equivalent( equivalent( Z, Y ), equivalent( X, Z ) ) ), T ) ) ),
% 0.47/1.14 'is_a_theorem'( T ) ] )
% 0.47/1.14 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.47/1.14 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 resolution(
% 0.47/1.14 clause( 959, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.47/1.14 equivalent( Y, Z ), equivalent( T, Y ) ) ), equivalent( equivalent( T, Z
% 0.47/1.14 ), X ) ) ) ] )
% 0.47/1.14 , clause( 3, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent(
% 0.47/1.14 equivalent( equivalent( X, Y ), equivalent( equivalent( Z, Y ),
% 0.47/1.14 equivalent( X, Z ) ) ), T ) ) ) ] )
% 0.47/1.14 , 1, clause( 1, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.47/1.14 equivalent( equivalent( Z, Y ), equivalent( X, Z ) ) ) ) ] )
% 0.47/1.14 , 0, substitution( 0, [ :=( X, T ), :=( Y, Z ), :=( Z, Y ), :=( T,
% 0.47/1.14 equivalent( equivalent( X, equivalent( equivalent( Y, Z ), equivalent( T
% 0.47/1.14 , Y ) ) ), equivalent( equivalent( T, Z ), X ) ) )] ), substitution( 1, [
% 0.47/1.14 :=( X, equivalent( T, Z ) ), :=( Y, equivalent( equivalent( Y, Z ),
% 0.47/1.14 equivalent( T, Y ) ) ), :=( Z, X )] )).
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 subsumption(
% 0.47/1.14 clause( 4, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.47/1.14 equivalent( Y, Z ), equivalent( T, Y ) ) ), equivalent( equivalent( T, Z
% 0.47/1.14 ), X ) ) ) ] )
% 0.47/1.14 , clause( 959, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.47/1.14 equivalent( Y, Z ), equivalent( T, Y ) ) ), equivalent( equivalent( T, Z
% 0.47/1.14 ), X ) ) ) ] )
% 0.47/1.14 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.47/1.14 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 resolution(
% 0.47/1.14 clause( 960, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.47/1.14 X, Y ) ) ) ] )
% 0.47/1.14 , clause( 3, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent(
% 0.47/1.14 equivalent( equivalent( X, Y ), equivalent( equivalent( Z, Y ),
% 0.47/1.14 equivalent( X, Z ) ) ), T ) ) ) ] )
% 0.47/1.14 , 1, clause( 4, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.47/1.14 equivalent( Y, Z ), equivalent( T, Y ) ) ), equivalent( equivalent( T, Z
% 0.47/1.14 ), X ) ) ) ] )
% 0.47/1.14 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T,
% 0.47/1.14 equivalent( equivalent( X, Y ), equivalent( X, Y ) ) )] ), substitution(
% 0.47/1.14 1, [ :=( X, equivalent( X, Y ) ), :=( Y, Z ), :=( Z, Y ), :=( T, X )] )
% 0.47/1.14 ).
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 subsumption(
% 0.47/1.14 clause( 5, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent( X
% 0.47/1.14 , Y ) ) ) ] )
% 0.47/1.14 , clause( 960, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.47/1.14 X, Y ) ) ) ] )
% 0.47/1.14 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.47/1.14 )] ) ).
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 resolution(
% 0.47/1.14 clause( 962, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( X,
% 0.47/1.14 equivalent( equivalent( Y, Z ), equivalent( T, Y ) ) ), equivalent(
% 0.47/1.14 equivalent( T, Z ), X ) ), U ) ) ), 'is_a_theorem'( U ) ] )
% 0.47/1.14 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.47/1.14 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.47/1.14 , 2, clause( 4, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.47/1.14 equivalent( Y, Z ), equivalent( T, Y ) ) ), equivalent( equivalent( T, Z
% 0.47/1.14 ), X ) ) ) ] )
% 0.47/1.14 , 0, substitution( 0, [ :=( X, equivalent( equivalent( X, equivalent(
% 0.47/1.14 equivalent( Y, Z ), equivalent( T, Y ) ) ), equivalent( equivalent( T, Z
% 0.47/1.14 ), X ) ) ), :=( Y, U )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ),
% 0.47/1.14 :=( Z, Z ), :=( T, T )] )).
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 subsumption(
% 0.47/1.14 clause( 6, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent( equivalent(
% 0.47/1.14 equivalent( X, equivalent( equivalent( Y, Z ), equivalent( T, Y ) ) ),
% 0.47/1.14 equivalent( equivalent( T, Z ), X ) ), U ) ) ) ] )
% 0.47/1.14 , clause( 962, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( X,
% 0.47/1.14 equivalent( equivalent( Y, Z ), equivalent( T, Y ) ) ), equivalent(
% 0.47/1.14 equivalent( T, Z ), X ) ), U ) ) ), 'is_a_theorem'( U ) ] )
% 0.47/1.14 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.47/1.14 , U )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 resolution(
% 0.47/1.14 clause( 964, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.47/1.14 ), equivalent( X, Y ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.47/1.14 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.47/1.14 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.47/1.14 , 2, clause( 5, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.47/1.14 equivalent( X, Y ) ) ) ] )
% 0.47/1.14 , 0, substitution( 0, [ :=( X, equivalent( equivalent( X, Y ), equivalent(
% 0.47/1.14 X, Y ) ) ), :=( Y, Z )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )
% 0.47/1.14 ).
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 subsumption(
% 0.47/1.14 clause( 7, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( equivalent( equivalent(
% 0.47/1.14 equivalent( X, Y ), equivalent( X, Y ) ), Z ) ) ) ] )
% 0.47/1.14 , clause( 964, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( X,
% 0.47/1.14 Y ), equivalent( X, Y ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.47/1.14 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.47/1.14 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 resolution(
% 0.47/1.14 clause( 965, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y, Z
% 0.47/1.14 ) ), equivalent( equivalent( Y, Z ), X ) ) ) ] )
% 0.47/1.14 , clause( 7, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( equivalent(
% 0.47/1.14 equivalent( equivalent( X, Y ), equivalent( X, Y ) ), Z ) ) ) ] )
% 0.47/1.14 , 1, clause( 1, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.47/1.14 equivalent( equivalent( Z, Y ), equivalent( X, Z ) ) ) ) ] )
% 0.47/1.14 , 0, substitution( 0, [ :=( X, Y ), :=( Y, Z ), :=( Z, equivalent(
% 0.47/1.14 equivalent( X, equivalent( Y, Z ) ), equivalent( equivalent( Y, Z ), X )
% 0.47/1.14 ) )] ), substitution( 1, [ :=( X, equivalent( Y, Z ) ), :=( Y,
% 0.47/1.14 equivalent( Y, Z ) ), :=( Z, X )] )).
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 subsumption(
% 0.47/1.14 clause( 8, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y, Z )
% 0.47/1.14 ), equivalent( equivalent( Y, Z ), X ) ) ) ] )
% 0.47/1.14 , clause( 965, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y,
% 0.47/1.14 Z ) ), equivalent( equivalent( Y, Z ), X ) ) ) ] )
% 0.47/1.14 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.47/1.14 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 resolution(
% 0.47/1.14 clause( 966, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.47/1.14 equivalent( Z, X ) ), equivalent( Z, Y ) ) ) ] )
% 0.47/1.14 , clause( 3, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent(
% 0.47/1.14 equivalent( equivalent( X, Y ), equivalent( equivalent( Z, Y ),
% 0.47/1.14 equivalent( X, Z ) ) ), T ) ) ) ] )
% 0.47/1.14 , 1, clause( 8, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y
% 0.47/1.14 , Z ) ), equivalent( equivalent( Y, Z ), X ) ) ) ] )
% 0.47/1.14 , 0, substitution( 0, [ :=( X, Z ), :=( Y, Y ), :=( Z, X ), :=( T,
% 0.47/1.14 equivalent( equivalent( equivalent( X, Y ), equivalent( Z, X ) ),
% 0.47/1.14 equivalent( Z, Y ) ) )] ), substitution( 1, [ :=( X, equivalent( Z, Y ) )
% 0.47/1.14 , :=( Y, equivalent( X, Y ) ), :=( Z, equivalent( Z, X ) )] )).
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 subsumption(
% 0.47/1.14 clause( 9, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.47/1.14 equivalent( Z, X ) ), equivalent( Z, Y ) ) ) ] )
% 0.47/1.14 , clause( 966, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y )
% 0.47/1.14 , equivalent( Z, X ) ), equivalent( Z, Y ) ) ) ] )
% 0.47/1.14 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.47/1.14 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 resolution(
% 0.47/1.14 clause( 967, [ 'is_a_theorem'( equivalent( X, X ) ) ] )
% 0.47/1.14 , clause( 7, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( equivalent(
% 0.47/1.14 equivalent( equivalent( X, Y ), equivalent( X, Y ) ), Z ) ) ) ] )
% 0.47/1.14 , 1, clause( 9, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.47/1.14 ), equivalent( Z, X ) ), equivalent( Z, Y ) ) ) ] )
% 0.47/1.14 , 0, substitution( 0, [ :=( X, X ), :=( Y, X ), :=( Z, equivalent( X, X ) )] )
% 0.47/1.14 , substitution( 1, [ :=( X, X ), :=( Y, X ), :=( Z, X )] )).
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 subsumption(
% 0.47/1.14 clause( 11, [ 'is_a_theorem'( equivalent( X, X ) ) ] )
% 0.47/1.14 , clause( 967, [ 'is_a_theorem'( equivalent( X, X ) ) ] )
% 0.47/1.14 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 resolution(
% 0.47/1.14 clause( 969, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.47/1.14 equivalent( X, Y ), equivalent( Z, X ) ), equivalent( Z, Y ) ), T ) ) ),
% 0.47/1.14 'is_a_theorem'( T ) ] )
% 0.47/1.14 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.47/1.14 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.47/1.14 , 2, clause( 9, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.47/1.14 ), equivalent( Z, X ) ), equivalent( Z, Y ) ) ) ] )
% 0.47/1.14 , 0, substitution( 0, [ :=( X, equivalent( equivalent( equivalent( X, Y ),
% 0.47/1.14 equivalent( Z, X ) ), equivalent( Z, Y ) ) ), :=( Y, T )] ),
% 0.47/1.14 substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 subsumption(
% 0.47/1.14 clause( 12, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent(
% 0.47/1.14 equivalent( equivalent( equivalent( X, Y ), equivalent( Z, X ) ),
% 0.47/1.14 equivalent( Z, Y ) ), T ) ) ) ] )
% 0.47/1.14 , clause( 969, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.47/1.14 equivalent( X, Y ), equivalent( Z, X ) ), equivalent( Z, Y ) ), T ) ) ),
% 0.47/1.14 'is_a_theorem'( T ) ] )
% 0.47/1.14 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.47/1.14 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 resolution(
% 0.47/1.14 clause( 971, [ ~( 'is_a_theorem'( equivalent( equivalent( X, X ), Y ) ) ),
% 0.47/1.14 'is_a_theorem'( Y ) ] )
% 0.47/1.14 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.47/1.14 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.47/1.14 , 2, clause( 11, [ 'is_a_theorem'( equivalent( X, X ) ) ] )
% 0.47/1.14 , 0, substitution( 0, [ :=( X, equivalent( X, X ) ), :=( Y, Y )] ),
% 0.47/1.14 substitution( 1, [ :=( X, X )] )).
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 subsumption(
% 0.47/1.14 clause( 13, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( equivalent(
% 0.47/1.14 equivalent( X, X ), Y ) ) ) ] )
% 0.47/1.14 , clause( 971, [ ~( 'is_a_theorem'( equivalent( equivalent( X, X ), Y ) ) )
% 0.47/1.14 , 'is_a_theorem'( Y ) ] )
% 0.47/1.14 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.47/1.14 ), ==>( 1, 0 )] ) ).
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 resolution(
% 0.47/1.14 clause( 972, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.47/1.14 Z ), equivalent( Z, equivalent( equivalent( T, Y ), equivalent( X, T ) )
% 0.47/1.14 ) ) ) ] )
% 0.47/1.14 , clause( 6, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.47/1.14 equivalent( equivalent( X, equivalent( equivalent( Y, Z ), equivalent( T
% 0.47/1.14 , Y ) ) ), equivalent( equivalent( T, Z ), X ) ), U ) ) ) ] )
% 0.47/1.14 , 1, clause( 8, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y
% 0.47/1.14 , Z ) ), equivalent( equivalent( Y, Z ), X ) ) ) ] )
% 0.47/1.14 , 0, substitution( 0, [ :=( X, Z ), :=( Y, T ), :=( Z, Y ), :=( T, X ),
% 0.47/1.14 :=( U, equivalent( equivalent( equivalent( X, Y ), Z ), equivalent( Z,
% 0.47/1.14 equivalent( equivalent( T, Y ), equivalent( X, T ) ) ) ) )] ),
% 0.47/1.14 substitution( 1, [ :=( X, equivalent( Z, equivalent( equivalent( T, Y ),
% 0.47/1.14 equivalent( X, T ) ) ) ), :=( Y, equivalent( X, Y ) ), :=( Z, Z )] )).
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 subsumption(
% 0.47/1.14 clause( 14, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ), Z
% 0.47/1.14 ), equivalent( Z, equivalent( equivalent( T, Y ), equivalent( X, T ) ) )
% 0.47/1.14 ) ) ] )
% 0.47/1.14 , clause( 972, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y )
% 0.47/1.14 , Z ), equivalent( Z, equivalent( equivalent( T, Y ), equivalent( X, T )
% 0.47/1.14 ) ) ) ) ] )
% 0.47/1.14 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.47/1.14 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 resolution(
% 0.47/1.14 clause( 973, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.47/1.14 Y, X ) ) ) ] )
% 0.47/1.14 , clause( 13, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( equivalent(
% 0.47/1.14 equivalent( X, X ), Y ) ) ) ] )
% 0.47/1.14 , 1, clause( 1, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.47/1.14 equivalent( equivalent( Z, Y ), equivalent( X, Z ) ) ) ) ] )
% 0.47/1.14 , 0, substitution( 0, [ :=( X, Y ), :=( Y, equivalent( equivalent( X, Y ),
% 0.47/1.14 equivalent( Y, X ) ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, Y ),
% 0.47/1.14 :=( Z, X )] )).
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 subsumption(
% 0.47/1.14 clause( 17, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent( Y
% 0.47/1.14 , X ) ) ) ] )
% 0.47/1.14 , clause( 973, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.47/1.14 Y, X ) ) ) ] )
% 0.47/1.14 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.47/1.14 )] ) ).
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 resolution(
% 0.47/1.14 clause( 975, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.47/1.14 ), equivalent( Y, X ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.47/1.14 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.47/1.14 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.47/1.14 , 2, clause( 17, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.47/1.14 equivalent( Y, X ) ) ) ] )
% 0.47/1.14 , 0, substitution( 0, [ :=( X, equivalent( equivalent( X, Y ), equivalent(
% 0.47/1.14 Y, X ) ) ), :=( Y, Z )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )
% 0.47/1.14 ).
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 subsumption(
% 0.47/1.14 clause( 18, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( equivalent(
% 0.47/1.14 equivalent( equivalent( X, Y ), equivalent( Y, X ) ), Z ) ) ) ] )
% 0.47/1.14 , clause( 975, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( X,
% 0.47/1.14 Y ), equivalent( Y, X ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.47/1.14 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.47/1.14 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 resolution(
% 0.47/1.14 clause( 976, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.47/1.14 equivalent( X, Z ), equivalent( Z, Y ) ) ) ) ] )
% 0.47/1.14 , clause( 18, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( equivalent(
% 0.47/1.14 equivalent( equivalent( X, Y ), equivalent( Y, X ) ), Z ) ) ) ] )
% 0.47/1.14 , 1, clause( 4, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.47/1.14 equivalent( Y, Z ), equivalent( T, Y ) ) ), equivalent( equivalent( T, Z
% 0.47/1.14 ), X ) ) ) ] )
% 0.47/1.14 , 0, substitution( 0, [ :=( X, equivalent( X, Z ) ), :=( Y, equivalent( Z,
% 0.47/1.14 Y ) ), :=( Z, equivalent( equivalent( X, Y ), equivalent( equivalent( X,
% 0.47/1.14 Z ), equivalent( Z, Y ) ) ) )] ), substitution( 1, [ :=( X, equivalent(
% 0.47/1.14 equivalent( X, Z ), equivalent( Z, Y ) ) ), :=( Y, Z ), :=( Z, Y ), :=( T
% 0.47/1.14 , X )] )).
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 subsumption(
% 0.47/1.14 clause( 19, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.47/1.14 equivalent( X, Z ), equivalent( Z, Y ) ) ) ) ] )
% 0.47/1.14 , clause( 976, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.47/1.14 equivalent( X, Z ), equivalent( Z, Y ) ) ) ) ] )
% 0.47/1.14 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.47/1.14 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 resolution(
% 0.47/1.14 clause( 977, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.47/1.14 Z ), equivalent( Z, equivalent( Y, X ) ) ) ) ] )
% 0.47/1.14 , clause( 18, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( equivalent(
% 0.47/1.14 equivalent( equivalent( X, Y ), equivalent( Y, X ) ), Z ) ) ) ] )
% 0.47/1.14 , 1, clause( 19, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.47/1.14 equivalent( equivalent( X, Z ), equivalent( Z, Y ) ) ) ) ] )
% 0.47/1.14 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, equivalent(
% 0.47/1.14 equivalent( equivalent( X, Y ), Z ), equivalent( Z, equivalent( Y, X ) )
% 0.47/1.14 ) )] ), substitution( 1, [ :=( X, equivalent( X, Y ) ), :=( Y,
% 0.47/1.14 equivalent( Y, X ) ), :=( Z, Z )] )).
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 subsumption(
% 0.47/1.14 clause( 21, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ), Z
% 0.47/1.14 ), equivalent( Z, equivalent( Y, X ) ) ) ) ] )
% 0.47/1.14 , clause( 977, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y )
% 0.47/1.14 , Z ), equivalent( Z, equivalent( Y, X ) ) ) ) ] )
% 0.47/1.14 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.47/1.14 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 resolution(
% 0.47/1.14 clause( 978, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.47/1.14 equivalent( Z, X ) ), equivalent( Y, Z ) ) ) ] )
% 0.47/1.14 , clause( 3, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent(
% 0.47/1.14 equivalent( equivalent( X, Y ), equivalent( equivalent( Z, Y ),
% 0.47/1.14 equivalent( X, Z ) ) ), T ) ) ) ] )
% 0.47/1.14 , 1, clause( 21, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.47/1.14 ), Z ), equivalent( Z, equivalent( Y, X ) ) ) ) ] )
% 0.47/1.14 , 0, substitution( 0, [ :=( X, Z ), :=( Y, Y ), :=( Z, X ), :=( T,
% 0.47/1.14 equivalent( equivalent( equivalent( X, Y ), equivalent( Z, X ) ),
% 0.47/1.14 equivalent( Y, Z ) ) )] ), substitution( 1, [ :=( X, Z ), :=( Y, Y ),
% 0.47/1.14 :=( Z, equivalent( equivalent( X, Y ), equivalent( Z, X ) ) )] )).
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 subsumption(
% 0.47/1.14 clause( 25, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.47/1.14 equivalent( Z, X ) ), equivalent( Y, Z ) ) ) ] )
% 0.47/1.14 , clause( 978, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y )
% 0.47/1.14 , equivalent( Z, X ) ), equivalent( Y, Z ) ) ) ] )
% 0.47/1.14 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.47/1.14 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 resolution(
% 0.47/1.14 clause( 980, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.47/1.14 equivalent( X, Y ), equivalent( Z, X ) ), equivalent( Y, Z ) ), T ) ) ),
% 0.47/1.14 'is_a_theorem'( T ) ] )
% 0.47/1.14 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.47/1.14 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.47/1.14 , 2, clause( 25, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.47/1.14 ), equivalent( Z, X ) ), equivalent( Y, Z ) ) ) ] )
% 0.47/1.14 , 0, substitution( 0, [ :=( X, equivalent( equivalent( equivalent( X, Y ),
% 0.47/1.14 equivalent( Z, X ) ), equivalent( Y, Z ) ) ), :=( Y, T )] ),
% 0.47/1.14 substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 subsumption(
% 0.47/1.14 clause( 27, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent(
% 0.47/1.14 equivalent( equivalent( equivalent( X, Y ), equivalent( Z, X ) ),
% 0.47/1.14 equivalent( Y, Z ) ), T ) ) ) ] )
% 0.47/1.14 , clause( 980, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.47/1.14 equivalent( X, Y ), equivalent( Z, X ) ), equivalent( Y, Z ) ), T ) ) ),
% 0.47/1.14 'is_a_theorem'( T ) ] )
% 0.47/1.14 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.47/1.14 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 resolution(
% 0.47/1.14 clause( 981, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.47/1.14 equivalent( Z, X ) ), equivalent( equivalent( T, Y ), equivalent( Z, T )
% 0.47/1.14 ) ) ) ] )
% 0.47/1.14 , clause( 3, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent(
% 0.47/1.14 equivalent( equivalent( X, Y ), equivalent( equivalent( Z, Y ),
% 0.47/1.14 equivalent( X, Z ) ) ), T ) ) ) ] )
% 0.47/1.14 , 1, clause( 14, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.47/1.14 ), Z ), equivalent( Z, equivalent( equivalent( T, Y ), equivalent( X, T
% 0.47/1.14 ) ) ) ) ) ] )
% 0.47/1.14 , 0, substitution( 0, [ :=( X, Z ), :=( Y, Y ), :=( Z, X ), :=( T,
% 0.47/1.14 equivalent( equivalent( equivalent( X, Y ), equivalent( Z, X ) ),
% 0.47/1.14 equivalent( equivalent( T, Y ), equivalent( Z, T ) ) ) )] ),
% 0.47/1.14 substitution( 1, [ :=( X, Z ), :=( Y, Y ), :=( Z, equivalent( equivalent(
% 0.47/1.14 X, Y ), equivalent( Z, X ) ) ), :=( T, T )] )).
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 subsumption(
% 0.47/1.14 clause( 48, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.47/1.14 equivalent( Z, X ) ), equivalent( equivalent( T, Y ), equivalent( Z, T )
% 0.47/1.14 ) ) ) ] )
% 0.47/1.14 , clause( 981, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y )
% 0.47/1.14 , equivalent( Z, X ) ), equivalent( equivalent( T, Y ), equivalent( Z, T
% 0.47/1.14 ) ) ) ) ] )
% 0.47/1.14 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.47/1.14 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 resolution(
% 0.47/1.14 clause( 982, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.47/1.14 equivalent( Y, Z ), Y ) ), equivalent( Z, X ) ) ) ] )
% 0.47/1.14 , clause( 27, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent(
% 0.47/1.14 equivalent( equivalent( equivalent( X, Y ), equivalent( Z, X ) ),
% 0.47/1.14 equivalent( Y, Z ) ), T ) ) ) ] )
% 0.47/1.14 , 1, clause( 48, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.47/1.14 ), equivalent( Z, X ) ), equivalent( equivalent( T, Y ), equivalent( Z,
% 0.47/1.14 T ) ) ) ) ] )
% 0.47/1.14 , 0, substitution( 0, [ :=( X, Y ), :=( Y, Z ), :=( Z, equivalent( Y, Z ) )
% 0.47/1.14 , :=( T, equivalent( equivalent( X, equivalent( equivalent( Y, Z ), Y ) )
% 0.47/1.14 , equivalent( Z, X ) ) )] ), substitution( 1, [ :=( X, equivalent( Y, Z )
% 0.47/1.14 ), :=( Y, equivalent( equivalent( Y, Z ), Y ) ), :=( Z, Z ), :=( T, X )] )
% 0.47/1.14 ).
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 subsumption(
% 0.47/1.14 clause( 597, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.47/1.14 equivalent( Y, Z ), Y ) ), equivalent( Z, X ) ) ) ] )
% 0.47/1.14 , clause( 982, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.47/1.14 equivalent( Y, Z ), Y ) ), equivalent( Z, X ) ) ) ] )
% 0.47/1.14 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.47/1.14 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 resolution(
% 0.47/1.14 clause( 983, [ 'is_a_theorem'( equivalent( X, equivalent( equivalent( Y, Z
% 0.47/1.14 ), equivalent( equivalent( Z, X ), Y ) ) ) ) ] )
% 0.47/1.14 , clause( 12, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent(
% 0.47/1.14 equivalent( equivalent( equivalent( X, Y ), equivalent( Z, X ) ),
% 0.47/1.14 equivalent( Z, Y ) ), T ) ) ) ] )
% 0.47/1.14 , 1, clause( 597, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.47/1.14 equivalent( Y, Z ), Y ) ), equivalent( Z, X ) ) ) ] )
% 0.47/1.14 , 0, substitution( 0, [ :=( X, Y ), :=( Y, Z ), :=( Z, equivalent( Z, X ) )
% 0.47/1.14 , :=( T, equivalent( X, equivalent( equivalent( Y, Z ), equivalent(
% 0.47/1.14 equivalent( Z, X ), Y ) ) ) )] ), substitution( 1, [ :=( X, equivalent(
% 0.47/1.14 equivalent( Y, Z ), equivalent( equivalent( Z, X ), Y ) ) ), :=( Y, Z ),
% 0.47/1.14 :=( Z, X )] )).
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 subsumption(
% 0.47/1.14 clause( 607, [ 'is_a_theorem'( equivalent( X, equivalent( equivalent( Y, Z
% 0.47/1.14 ), equivalent( equivalent( Z, X ), Y ) ) ) ) ] )
% 0.47/1.14 , clause( 983, [ 'is_a_theorem'( equivalent( X, equivalent( equivalent( Y,
% 0.47/1.14 Z ), equivalent( equivalent( Z, X ), Y ) ) ) ) ] )
% 0.47/1.14 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.47/1.14 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 resolution(
% 0.47/1.14 clause( 984, [] )
% 0.47/1.14 , clause( 2, [ ~( 'is_a_theorem'( equivalent( x, equivalent( equivalent( y
% 0.47/1.14 , z ), equivalent( equivalent( z, x ), y ) ) ) ) ) ] )
% 0.47/1.14 , 0, clause( 607, [ 'is_a_theorem'( equivalent( X, equivalent( equivalent(
% 0.47/1.14 Y, Z ), equivalent( equivalent( Z, X ), Y ) ) ) ) ] )
% 0.47/1.14 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, x ), :=( Y, y ), :=(
% 0.47/1.14 Z, z )] )).
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 subsumption(
% 0.47/1.14 clause( 952, [] )
% 0.47/1.14 , clause( 984, [] )
% 0.47/1.14 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 end.
% 0.47/1.14
% 0.47/1.14 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.47/1.14
% 0.47/1.14 Memory use:
% 0.47/1.14
% 0.47/1.14 space for terms: 16786
% 0.47/1.14 space for clauses: 87142
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 clauses generated: 1931
% 0.47/1.14 clauses kept: 953
% 0.47/1.14 clauses selected: 144
% 0.47/1.14 clauses deleted: 1
% 0.47/1.14 clauses inuse deleted: 0
% 0.47/1.14
% 0.47/1.14 subsentry: 1128
% 0.47/1.14 literals s-matched: 980
% 0.47/1.14 literals matched: 980
% 0.47/1.14 full subsumption: 0
% 0.47/1.14
% 0.47/1.14 checksum: 927475759
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 Bliksem ended
%------------------------------------------------------------------------------