TSTP Solution File: LCL011-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL011-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n009.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:49:08 EDT 2022
% Result : Unsatisfiable 0.42s 1.12s
% Output : Refutation 0.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL011-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n009.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % DateTime : Sun Jul 3 22:07:22 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.42/1.12 *** allocated 10000 integers for termspace/termends
% 0.42/1.12 *** allocated 10000 integers for clauses
% 0.42/1.12 *** allocated 10000 integers for justifications
% 0.42/1.12 Bliksem 1.12
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 Automatic Strategy Selection
% 0.42/1.12
% 0.42/1.12 Clauses:
% 0.42/1.12 [
% 0.42/1.12 [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), ~( 'is_a_theorem'( X ) ),
% 0.42/1.12 'is_a_theorem'( Y ) ],
% 0.42/1.12 [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent( equivalent(
% 0.42/1.12 Z, X ), equivalent( Y, Z ) ) ) ) ],
% 0.42/1.12 [ ~( 'is_a_theorem'( equivalent( equivalent( a, b ), equivalent(
% 0.42/1.12 equivalent( a, c ), equivalent( c, b ) ) ) ) ) ]
% 0.42/1.12 ] .
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 percentage equality = 0.000000, percentage horn = 1.000000
% 0.42/1.12 This is a near-Horn, non-equality problem
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 Options Used:
% 0.42/1.12
% 0.42/1.12 useres = 1
% 0.42/1.12 useparamod = 0
% 0.42/1.12 useeqrefl = 0
% 0.42/1.12 useeqfact = 0
% 0.42/1.12 usefactor = 1
% 0.42/1.12 usesimpsplitting = 0
% 0.42/1.12 usesimpdemod = 0
% 0.42/1.12 usesimpres = 4
% 0.42/1.12
% 0.42/1.12 resimpinuse = 1000
% 0.42/1.12 resimpclauses = 20000
% 0.42/1.12 substype = standard
% 0.42/1.12 backwardsubs = 1
% 0.42/1.12 selectoldest = 5
% 0.42/1.12
% 0.42/1.12 litorderings [0] = split
% 0.42/1.12 litorderings [1] = liftord
% 0.42/1.12
% 0.42/1.12 termordering = none
% 0.42/1.12
% 0.42/1.12 litapriori = 1
% 0.42/1.12 termapriori = 0
% 0.42/1.12 litaposteriori = 0
% 0.42/1.12 termaposteriori = 0
% 0.42/1.12 demodaposteriori = 0
% 0.42/1.12 ordereqreflfact = 0
% 0.42/1.12
% 0.42/1.12 litselect = negative
% 0.42/1.12
% 0.42/1.12 maxweight = 30000
% 0.42/1.12 maxdepth = 30000
% 0.42/1.12 maxlength = 115
% 0.42/1.12 maxnrvars = 195
% 0.42/1.12 excuselevel = 0
% 0.42/1.12 increasemaxweight = 0
% 0.42/1.12
% 0.42/1.12 maxselected = 10000000
% 0.42/1.12 maxnrclauses = 10000000
% 0.42/1.12
% 0.42/1.12 showgenerated = 0
% 0.42/1.12 showkept = 0
% 0.42/1.12 showselected = 0
% 0.42/1.12 showdeleted = 0
% 0.42/1.12 showresimp = 1
% 0.42/1.12 showstatus = 2000
% 0.42/1.12
% 0.42/1.12 prologoutput = 1
% 0.42/1.12 nrgoals = 5000000
% 0.42/1.12 totalproof = 1
% 0.42/1.12
% 0.42/1.12 Symbols occurring in the translation:
% 0.42/1.12
% 0.42/1.12 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.42/1.12 . [1, 2] (w:1, o:21, a:1, s:1, b:0),
% 0.42/1.12 ! [4, 1] (w:1, o:15, a:1, s:1, b:0),
% 0.42/1.12 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.42/1.12 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.42/1.12 equivalent [41, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.42/1.12 'is_a_theorem' [42, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.42/1.12 a [44, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.42/1.12 b [45, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.42/1.12 c [46, 0] (w:1, o:14, a:1, s:1, b:0).
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 Starting Search:
% 0.42/1.12
% 0.42/1.12 Resimplifying inuse:
% 0.42/1.12 Done
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 Bliksems!, er is een bewijs:
% 0.42/1.12 % SZS status Unsatisfiable
% 0.42/1.12 % SZS output start Refutation
% 0.42/1.12
% 0.42/1.12 clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.42/1.12 , ~( 'is_a_theorem'( X ) ) ] )
% 0.42/1.12 .
% 0.42/1.12 clause( 1, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.42/1.12 equivalent( Z, X ), equivalent( Y, Z ) ) ) ) ] )
% 0.42/1.12 .
% 0.42/1.12 clause( 2, [ ~( 'is_a_theorem'( equivalent( equivalent( a, b ), equivalent(
% 0.42/1.12 equivalent( a, c ), equivalent( c, b ) ) ) ) ) ] )
% 0.42/1.12 .
% 0.42/1.12 clause( 3, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent( equivalent(
% 0.42/1.12 equivalent( X, Y ), equivalent( equivalent( Z, X ), equivalent( Y, Z ) )
% 0.42/1.12 ), T ) ) ) ] )
% 0.42/1.12 .
% 0.42/1.12 clause( 4, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y, Z )
% 0.42/1.12 ), equivalent( equivalent( equivalent( T, Y ), equivalent( Z, T ) ), X )
% 0.42/1.12 ) ) ] )
% 0.42/1.12 .
% 0.42/1.12 clause( 5, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X,
% 0.42/1.12 equivalent( Y, Z ) ), equivalent( equivalent( T, Y ), X ) ), equivalent(
% 0.42/1.12 Z, T ) ) ) ] )
% 0.42/1.12 .
% 0.42/1.12 clause( 6, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent( equivalent(
% 0.42/1.12 equivalent( X, equivalent( Y, Z ) ), equivalent( equivalent( equivalent(
% 0.42/1.12 T, Y ), equivalent( Z, T ) ), X ) ), U ) ) ) ] )
% 0.42/1.12 .
% 0.42/1.12 clause( 7, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent( equivalent(
% 0.42/1.12 equivalent( equivalent( X, equivalent( Y, Z ) ), equivalent( equivalent(
% 0.42/1.12 T, Y ), X ) ), equivalent( Z, T ) ), U ) ) ) ] )
% 0.42/1.12 .
% 0.42/1.12 clause( 8, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.42/1.12 equivalent( Z, X ) ), equivalent( equivalent( T, equivalent( U, Y ) ),
% 0.42/1.12 equivalent( equivalent( Z, U ), T ) ) ) ) ] )
% 0.42/1.12 .
% 0.42/1.12 clause( 20, [ 'is_a_theorem'( equivalent( X, equivalent( Y, equivalent( X,
% 0.42/1.12 Y ) ) ) ) ] )
% 0.42/1.12 .
% 0.42/1.12 clause( 25, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( equivalent(
% 0.42/1.12 equivalent( X, equivalent( Y, equivalent( X, Y ) ) ), Z ) ) ) ] )
% 0.42/1.12 .
% 0.42/1.12 clause( 29, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.42/1.12 equivalent( equivalent( Z, Y ), X ) ), Z ) ) ] )
% 0.42/1.12 .
% 0.42/1.12 clause( 31, [ 'is_a_theorem'( equivalent( X, X ) ) ] )
% 0.42/1.12 .
% 0.42/1.12 clause( 36, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( equivalent(
% 0.42/1.12 equivalent( X, X ), Y ) ) ) ] )
% 0.42/1.12 .
% 0.42/1.12 clause( 41, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y, Z )
% 0.42/1.12 ), equivalent( equivalent( Z, Y ), X ) ) ) ] )
% 0.42/1.12 .
% 0.42/1.12 clause( 64, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.42/1.12 equivalent( Y, Z ) ), equivalent( Z, X ) ) ) ] )
% 0.42/1.12 .
% 0.42/1.12 clause( 80, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent(
% 0.42/1.12 equivalent( equivalent( equivalent( X, Y ), equivalent( Y, Z ) ),
% 0.42/1.12 equivalent( Z, X ) ), T ) ) ) ] )
% 0.42/1.12 .
% 0.42/1.12 clause( 1907, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.42/1.12 equivalent( X, Z ), equivalent( Z, Y ) ) ) ) ] )
% 0.42/1.12 .
% 0.42/1.12 clause( 1931, [] )
% 0.42/1.12 .
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 % SZS output end Refutation
% 0.42/1.12 found a proof!
% 0.42/1.12
% 0.42/1.12 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.42/1.12
% 0.42/1.12 initialclauses(
% 0.42/1.12 [ clause( 1933, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), ~(
% 0.42/1.12 'is_a_theorem'( X ) ), 'is_a_theorem'( Y ) ] )
% 0.42/1.12 , clause( 1934, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.42/1.12 equivalent( equivalent( Z, X ), equivalent( Y, Z ) ) ) ) ] )
% 0.42/1.12 , clause( 1935, [ ~( 'is_a_theorem'( equivalent( equivalent( a, b ),
% 0.42/1.12 equivalent( equivalent( a, c ), equivalent( c, b ) ) ) ) ) ] )
% 0.42/1.12 ] ).
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 subsumption(
% 0.42/1.12 clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.42/1.12 , ~( 'is_a_theorem'( X ) ) ] )
% 0.42/1.12 , clause( 1933, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), ~(
% 0.42/1.12 'is_a_theorem'( X ) ), 'is_a_theorem'( Y ) ] )
% 0.42/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.42/1.12 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 subsumption(
% 0.42/1.12 clause( 1, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.42/1.12 equivalent( Z, X ), equivalent( Y, Z ) ) ) ) ] )
% 0.42/1.12 , clause( 1934, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.42/1.12 equivalent( equivalent( Z, X ), equivalent( Y, Z ) ) ) ) ] )
% 0.42/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.42/1.12 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 subsumption(
% 0.42/1.12 clause( 2, [ ~( 'is_a_theorem'( equivalent( equivalent( a, b ), equivalent(
% 0.42/1.12 equivalent( a, c ), equivalent( c, b ) ) ) ) ) ] )
% 0.42/1.12 , clause( 1935, [ ~( 'is_a_theorem'( equivalent( equivalent( a, b ),
% 0.42/1.12 equivalent( equivalent( a, c ), equivalent( c, b ) ) ) ) ) ] )
% 0.42/1.12 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 resolution(
% 0.42/1.12 clause( 1937, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.42/1.12 ), equivalent( equivalent( Z, X ), equivalent( Y, Z ) ) ), T ) ) ),
% 0.42/1.12 'is_a_theorem'( T ) ] )
% 0.42/1.12 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.42/1.12 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.42/1.12 , 2, clause( 1, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.42/1.12 equivalent( equivalent( Z, X ), equivalent( Y, Z ) ) ) ) ] )
% 0.42/1.12 , 0, substitution( 0, [ :=( X, equivalent( equivalent( X, Y ), equivalent(
% 0.42/1.12 equivalent( Z, X ), equivalent( Y, Z ) ) ) ), :=( Y, T )] ),
% 0.42/1.12 substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 subsumption(
% 0.42/1.12 clause( 3, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent( equivalent(
% 0.42/1.12 equivalent( X, Y ), equivalent( equivalent( Z, X ), equivalent( Y, Z ) )
% 0.42/1.12 ), T ) ) ) ] )
% 0.42/1.12 , clause( 1937, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( X
% 0.42/1.12 , Y ), equivalent( equivalent( Z, X ), equivalent( Y, Z ) ) ), T ) ) ),
% 0.42/1.12 'is_a_theorem'( T ) ] )
% 0.42/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.42/1.12 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 resolution(
% 0.42/1.12 clause( 1938, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y, Z
% 0.42/1.12 ) ), equivalent( equivalent( equivalent( T, Y ), equivalent( Z, T ) ), X
% 0.42/1.12 ) ) ) ] )
% 0.42/1.12 , clause( 3, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent(
% 0.42/1.12 equivalent( equivalent( X, Y ), equivalent( equivalent( Z, X ),
% 0.42/1.12 equivalent( Y, Z ) ) ), T ) ) ) ] )
% 0.42/1.12 , 1, clause( 1, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.42/1.12 equivalent( equivalent( Z, X ), equivalent( Y, Z ) ) ) ) ] )
% 0.42/1.12 , 0, substitution( 0, [ :=( X, Y ), :=( Y, Z ), :=( Z, T ), :=( T,
% 0.42/1.12 equivalent( equivalent( X, equivalent( Y, Z ) ), equivalent( equivalent(
% 0.42/1.12 equivalent( T, Y ), equivalent( Z, T ) ), X ) ) )] ), substitution( 1, [
% 0.42/1.12 :=( X, equivalent( Y, Z ) ), :=( Y, equivalent( equivalent( T, Y ),
% 0.42/1.12 equivalent( Z, T ) ) ), :=( Z, X )] )).
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 subsumption(
% 0.42/1.12 clause( 4, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y, Z )
% 0.42/1.12 ), equivalent( equivalent( equivalent( T, Y ), equivalent( Z, T ) ), X )
% 0.42/1.12 ) ) ] )
% 0.42/1.12 , clause( 1938, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y
% 0.42/1.12 , Z ) ), equivalent( equivalent( equivalent( T, Y ), equivalent( Z, T ) )
% 0.42/1.12 , X ) ) ) ] )
% 0.42/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.42/1.12 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 resolution(
% 0.42/1.12 clause( 1939, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X,
% 0.42/1.12 equivalent( Y, Z ) ), equivalent( equivalent( T, Y ), X ) ), equivalent(
% 0.42/1.12 Z, T ) ) ) ] )
% 0.42/1.12 , clause( 3, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent(
% 0.42/1.12 equivalent( equivalent( X, Y ), equivalent( equivalent( Z, X ),
% 0.42/1.12 equivalent( Y, Z ) ) ), T ) ) ) ] )
% 0.42/1.12 , 1, clause( 4, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y
% 0.42/1.12 , Z ) ), equivalent( equivalent( equivalent( T, Y ), equivalent( Z, T ) )
% 0.42/1.12 , X ) ) ) ] )
% 0.42/1.12 , 0, substitution( 0, [ :=( X, Z ), :=( Y, T ), :=( Z, Y ), :=( T,
% 0.42/1.12 equivalent( equivalent( equivalent( X, equivalent( Y, Z ) ), equivalent(
% 0.42/1.12 equivalent( T, Y ), X ) ), equivalent( Z, T ) ) )] ), substitution( 1, [
% 0.42/1.12 :=( X, equivalent( Z, T ) ), :=( Y, equivalent( Y, Z ) ), :=( Z,
% 0.42/1.12 equivalent( T, Y ) ), :=( T, X )] )).
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 subsumption(
% 0.42/1.12 clause( 5, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X,
% 0.42/1.12 equivalent( Y, Z ) ), equivalent( equivalent( T, Y ), X ) ), equivalent(
% 0.42/1.12 Z, T ) ) ) ] )
% 0.42/1.12 , clause( 1939, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X,
% 0.42/1.12 equivalent( Y, Z ) ), equivalent( equivalent( T, Y ), X ) ), equivalent(
% 0.42/1.12 Z, T ) ) ) ] )
% 0.42/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.42/1.12 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 resolution(
% 0.42/1.12 clause( 1941, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( X,
% 0.42/1.12 equivalent( Y, Z ) ), equivalent( equivalent( equivalent( T, Y ),
% 0.42/1.12 equivalent( Z, T ) ), X ) ), U ) ) ), 'is_a_theorem'( U ) ] )
% 0.42/1.12 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.42/1.12 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.42/1.12 , 2, clause( 4, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y
% 0.42/1.12 , Z ) ), equivalent( equivalent( equivalent( T, Y ), equivalent( Z, T ) )
% 0.42/1.12 , X ) ) ) ] )
% 0.42/1.12 , 0, substitution( 0, [ :=( X, equivalent( equivalent( X, equivalent( Y, Z
% 0.42/1.12 ) ), equivalent( equivalent( equivalent( T, Y ), equivalent( Z, T ) ), X
% 0.42/1.12 ) ) ), :=( Y, U )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z,
% 0.42/1.12 Z ), :=( T, T )] )).
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 subsumption(
% 0.42/1.12 clause( 6, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent( equivalent(
% 0.42/1.12 equivalent( X, equivalent( Y, Z ) ), equivalent( equivalent( equivalent(
% 0.42/1.12 T, Y ), equivalent( Z, T ) ), X ) ), U ) ) ) ] )
% 0.42/1.12 , clause( 1941, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( X
% 0.42/1.12 , equivalent( Y, Z ) ), equivalent( equivalent( equivalent( T, Y ),
% 0.42/1.12 equivalent( Z, T ) ), X ) ), U ) ) ), 'is_a_theorem'( U ) ] )
% 0.42/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.42/1.12 , U )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 resolution(
% 0.42/1.12 clause( 1943, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.42/1.12 equivalent( X, equivalent( Y, Z ) ), equivalent( equivalent( T, Y ), X )
% 0.42/1.12 ), equivalent( Z, T ) ), U ) ) ), 'is_a_theorem'( U ) ] )
% 0.42/1.12 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.42/1.12 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.42/1.12 , 2, clause( 5, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X,
% 0.42/1.12 equivalent( Y, Z ) ), equivalent( equivalent( T, Y ), X ) ), equivalent(
% 0.42/1.12 Z, T ) ) ) ] )
% 0.42/1.12 , 0, substitution( 0, [ :=( X, equivalent( equivalent( equivalent( X,
% 0.42/1.12 equivalent( Y, Z ) ), equivalent( equivalent( T, Y ), X ) ), equivalent(
% 0.42/1.12 Z, T ) ) ), :=( Y, U )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ),
% 0.42/1.12 :=( Z, Z ), :=( T, T )] )).
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 subsumption(
% 0.42/1.12 clause( 7, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent( equivalent(
% 0.42/1.12 equivalent( equivalent( X, equivalent( Y, Z ) ), equivalent( equivalent(
% 0.42/1.12 T, Y ), X ) ), equivalent( Z, T ) ), U ) ) ) ] )
% 0.42/1.12 , clause( 1943, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.42/1.12 equivalent( X, equivalent( Y, Z ) ), equivalent( equivalent( T, Y ), X )
% 0.42/1.12 ), equivalent( Z, T ) ), U ) ) ), 'is_a_theorem'( U ) ] )
% 0.42/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.42/1.12 , U )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 resolution(
% 0.42/1.12 clause( 1944, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y )
% 0.42/1.12 , equivalent( Z, X ) ), equivalent( equivalent( T, equivalent( U, Y ) ),
% 0.42/1.12 equivalent( equivalent( Z, U ), T ) ) ) ) ] )
% 0.42/1.12 , clause( 7, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.42/1.12 equivalent( equivalent( equivalent( X, equivalent( Y, Z ) ), equivalent(
% 0.42/1.12 equivalent( T, Y ), X ) ), equivalent( Z, T ) ), U ) ) ) ] )
% 0.42/1.12 , 1, clause( 4, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y
% 0.42/1.12 , Z ) ), equivalent( equivalent( equivalent( T, Y ), equivalent( Z, T ) )
% 0.42/1.12 , X ) ) ) ] )
% 0.42/1.12 , 0, substitution( 0, [ :=( X, T ), :=( Y, U ), :=( Z, Y ), :=( T, Z ),
% 0.42/1.12 :=( U, equivalent( equivalent( equivalent( X, Y ), equivalent( Z, X ) ),
% 0.42/1.12 equivalent( equivalent( T, equivalent( U, Y ) ), equivalent( equivalent(
% 0.42/1.12 Z, U ), T ) ) ) )] ), substitution( 1, [ :=( X, equivalent( equivalent( T
% 0.42/1.12 , equivalent( U, Y ) ), equivalent( equivalent( Z, U ), T ) ) ), :=( Y, Y
% 0.42/1.12 ), :=( Z, Z ), :=( T, X )] )).
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 subsumption(
% 0.42/1.12 clause( 8, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.42/1.12 equivalent( Z, X ) ), equivalent( equivalent( T, equivalent( U, Y ) ),
% 0.42/1.12 equivalent( equivalent( Z, U ), T ) ) ) ) ] )
% 0.42/1.12 , clause( 1944, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.42/1.12 ), equivalent( Z, X ) ), equivalent( equivalent( T, equivalent( U, Y ) )
% 0.42/1.12 , equivalent( equivalent( Z, U ), T ) ) ) ) ] )
% 0.42/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.42/1.12 , U )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 resolution(
% 0.42/1.12 clause( 1945, [ 'is_a_theorem'( equivalent( X, equivalent( Y, equivalent( X
% 0.42/1.12 , Y ) ) ) ) ] )
% 0.42/1.12 , clause( 6, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.42/1.12 equivalent( equivalent( X, equivalent( Y, Z ) ), equivalent( equivalent(
% 0.42/1.12 equivalent( T, Y ), equivalent( Z, T ) ), X ) ), U ) ) ) ] )
% 0.42/1.12 , 1, clause( 5, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X,
% 0.42/1.12 equivalent( Y, Z ) ), equivalent( equivalent( T, Y ), X ) ), equivalent(
% 0.42/1.12 Z, T ) ) ) ] )
% 0.42/1.12 , 0, substitution( 0, [ :=( X, Z ), :=( Y, equivalent( X, Y ) ), :=( Z, X )
% 0.42/1.12 , :=( T, Y ), :=( U, equivalent( X, equivalent( Y, equivalent( X, Y ) ) )
% 0.42/1.12 )] ), substitution( 1, [ :=( X, Z ), :=( Y, equivalent( X, Y ) ), :=( Z
% 0.42/1.12 , X ), :=( T, equivalent( Y, equivalent( X, Y ) ) )] )).
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 subsumption(
% 0.42/1.12 clause( 20, [ 'is_a_theorem'( equivalent( X, equivalent( Y, equivalent( X,
% 0.42/1.12 Y ) ) ) ) ] )
% 0.42/1.12 , clause( 1945, [ 'is_a_theorem'( equivalent( X, equivalent( Y, equivalent(
% 0.42/1.12 X, Y ) ) ) ) ] )
% 0.42/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.42/1.12 )] ) ).
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 resolution(
% 0.42/1.12 clause( 1947, [ ~( 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y
% 0.42/1.12 , equivalent( X, Y ) ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.42/1.12 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.42/1.12 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.42/1.12 , 2, clause( 20, [ 'is_a_theorem'( equivalent( X, equivalent( Y, equivalent(
% 0.42/1.12 X, Y ) ) ) ) ] )
% 0.42/1.12 , 0, substitution( 0, [ :=( X, equivalent( X, equivalent( Y, equivalent( X
% 0.42/1.12 , Y ) ) ) ), :=( Y, Z )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )
% 0.42/1.12 ).
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 subsumption(
% 0.42/1.12 clause( 25, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( equivalent(
% 0.42/1.12 equivalent( X, equivalent( Y, equivalent( X, Y ) ) ), Z ) ) ) ] )
% 0.42/1.12 , clause( 1947, [ ~( 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.42/1.12 Y, equivalent( X, Y ) ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.42/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.42/1.12 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 resolution(
% 0.42/1.12 clause( 1948, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y )
% 0.42/1.12 , equivalent( equivalent( Z, Y ), X ) ), Z ) ) ] )
% 0.42/1.12 , clause( 25, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( equivalent(
% 0.42/1.12 equivalent( X, equivalent( Y, equivalent( X, Y ) ) ), Z ) ) ) ] )
% 0.42/1.12 , 1, clause( 4, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y
% 0.42/1.12 , Z ) ), equivalent( equivalent( equivalent( T, Y ), equivalent( Z, T ) )
% 0.42/1.12 , X ) ) ) ] )
% 0.42/1.12 , 0, substitution( 0, [ :=( X, Z ), :=( Y, Y ), :=( Z, equivalent(
% 0.42/1.12 equivalent( equivalent( X, Y ), equivalent( equivalent( Z, Y ), X ) ), Z
% 0.42/1.12 ) )] ), substitution( 1, [ :=( X, Z ), :=( Y, Y ), :=( Z, equivalent( Z
% 0.42/1.12 , Y ) ), :=( T, X )] )).
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 subsumption(
% 0.42/1.12 clause( 29, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.42/1.12 equivalent( equivalent( Z, Y ), X ) ), Z ) ) ] )
% 0.42/1.12 , clause( 1948, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.42/1.12 ), equivalent( equivalent( Z, Y ), X ) ), Z ) ) ] )
% 0.42/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.42/1.12 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 resolution(
% 0.42/1.12 clause( 1949, [ 'is_a_theorem'( equivalent( X, X ) ) ] )
% 0.42/1.12 , clause( 6, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.42/1.12 equivalent( equivalent( X, equivalent( Y, Z ) ), equivalent( equivalent(
% 0.42/1.12 equivalent( T, Y ), equivalent( Z, T ) ), X ) ), U ) ) ) ] )
% 0.42/1.12 , 1, clause( 29, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.42/1.12 ), equivalent( equivalent( Z, Y ), X ) ), Z ) ) ] )
% 0.42/1.12 , 0, substitution( 0, [ :=( X, Y ), :=( Y, X ), :=( Z, X ), :=( T, X ),
% 0.42/1.12 :=( U, equivalent( X, X ) )] ), substitution( 1, [ :=( X, Y ), :=( Y,
% 0.42/1.12 equivalent( X, X ) ), :=( Z, equivalent( X, X ) )] )).
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 subsumption(
% 0.42/1.12 clause( 31, [ 'is_a_theorem'( equivalent( X, X ) ) ] )
% 0.42/1.12 , clause( 1949, [ 'is_a_theorem'( equivalent( X, X ) ) ] )
% 0.42/1.12 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 resolution(
% 0.42/1.12 clause( 1951, [ ~( 'is_a_theorem'( equivalent( equivalent( X, X ), Y ) ) )
% 0.42/1.12 , 'is_a_theorem'( Y ) ] )
% 0.42/1.12 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.42/1.12 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.42/1.12 , 2, clause( 31, [ 'is_a_theorem'( equivalent( X, X ) ) ] )
% 0.42/1.12 , 0, substitution( 0, [ :=( X, equivalent( X, X ) ), :=( Y, Y )] ),
% 0.42/1.12 substitution( 1, [ :=( X, X )] )).
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 subsumption(
% 0.42/1.12 clause( 36, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( equivalent(
% 0.42/1.12 equivalent( X, X ), Y ) ) ) ] )
% 0.42/1.12 , clause( 1951, [ ~( 'is_a_theorem'( equivalent( equivalent( X, X ), Y ) )
% 0.42/1.12 ), 'is_a_theorem'( Y ) ] )
% 0.42/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.42/1.12 ), ==>( 1, 0 )] ) ).
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 resolution(
% 0.42/1.12 clause( 1952, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y, Z
% 0.42/1.12 ) ), equivalent( equivalent( Z, Y ), X ) ) ) ] )
% 0.42/1.12 , clause( 36, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( equivalent(
% 0.42/1.12 equivalent( X, X ), Y ) ) ) ] )
% 0.42/1.12 , 1, clause( 8, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.42/1.12 ), equivalent( Z, X ) ), equivalent( equivalent( T, equivalent( U, Y ) )
% 0.42/1.12 , equivalent( equivalent( Z, U ), T ) ) ) ) ] )
% 0.42/1.12 , 0, substitution( 0, [ :=( X, equivalent( Z, Z ) ), :=( Y, equivalent(
% 0.42/1.12 equivalent( X, equivalent( Y, Z ) ), equivalent( equivalent( Z, Y ), X )
% 0.42/1.12 ) )] ), substitution( 1, [ :=( X, Z ), :=( Y, Z ), :=( Z, Z ), :=( T, X
% 0.42/1.12 ), :=( U, Y )] )).
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 subsumption(
% 0.42/1.12 clause( 41, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y, Z )
% 0.42/1.12 ), equivalent( equivalent( Z, Y ), X ) ) ) ] )
% 0.42/1.12 , clause( 1952, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y
% 0.42/1.12 , Z ) ), equivalent( equivalent( Z, Y ), X ) ) ) ] )
% 0.42/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.42/1.12 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 resolution(
% 0.42/1.12 clause( 1953, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y )
% 0.42/1.12 , equivalent( Y, Z ) ), equivalent( Z, X ) ) ) ] )
% 0.42/1.12 , clause( 3, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent(
% 0.42/1.12 equivalent( equivalent( X, Y ), equivalent( equivalent( Z, X ),
% 0.42/1.12 equivalent( Y, Z ) ) ), T ) ) ) ] )
% 0.42/1.12 , 1, clause( 41, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y
% 0.42/1.12 , Z ) ), equivalent( equivalent( Z, Y ), X ) ) ) ] )
% 0.42/1.12 , 0, substitution( 0, [ :=( X, Z ), :=( Y, X ), :=( Z, Y ), :=( T,
% 0.42/1.12 equivalent( equivalent( equivalent( X, Y ), equivalent( Y, Z ) ),
% 0.42/1.12 equivalent( Z, X ) ) )] ), substitution( 1, [ :=( X, equivalent( Z, X ) )
% 0.42/1.12 , :=( Y, equivalent( Y, Z ) ), :=( Z, equivalent( X, Y ) )] )).
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 subsumption(
% 0.42/1.12 clause( 64, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.42/1.12 equivalent( Y, Z ) ), equivalent( Z, X ) ) ) ] )
% 0.42/1.12 , clause( 1953, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.42/1.12 ), equivalent( Y, Z ) ), equivalent( Z, X ) ) ) ] )
% 0.42/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.42/1.12 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 resolution(
% 0.42/1.12 clause( 1955, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.42/1.12 equivalent( X, Y ), equivalent( Y, Z ) ), equivalent( Z, X ) ), T ) ) ),
% 0.42/1.12 'is_a_theorem'( T ) ] )
% 0.42/1.12 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.42/1.12 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.42/1.12 , 2, clause( 64, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.42/1.12 ), equivalent( Y, Z ) ), equivalent( Z, X ) ) ) ] )
% 0.42/1.12 , 0, substitution( 0, [ :=( X, equivalent( equivalent( equivalent( X, Y ),
% 0.42/1.12 equivalent( Y, Z ) ), equivalent( Z, X ) ) ), :=( Y, T )] ),
% 0.42/1.12 substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 subsumption(
% 0.42/1.12 clause( 80, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent(
% 0.42/1.12 equivalent( equivalent( equivalent( X, Y ), equivalent( Y, Z ) ),
% 0.42/1.12 equivalent( Z, X ) ), T ) ) ) ] )
% 0.42/1.12 , clause( 1955, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.42/1.12 equivalent( X, Y ), equivalent( Y, Z ) ), equivalent( Z, X ) ), T ) ) ),
% 0.42/1.12 'is_a_theorem'( T ) ] )
% 0.42/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.42/1.12 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 resolution(
% 0.42/1.12 clause( 1956, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.42/1.12 equivalent( X, Z ), equivalent( Z, Y ) ) ) ) ] )
% 0.42/1.12 , clause( 80, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent(
% 0.42/1.12 equivalent( equivalent( equivalent( X, Y ), equivalent( Y, Z ) ),
% 0.42/1.12 equivalent( Z, X ) ), T ) ) ) ] )
% 0.42/1.12 , 1, clause( 41, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y
% 0.42/1.12 , Z ) ), equivalent( equivalent( Z, Y ), X ) ) ) ] )
% 0.42/1.12 , 0, substitution( 0, [ :=( X, X ), :=( Y, Z ), :=( Z, Y ), :=( T,
% 0.42/1.12 equivalent( equivalent( X, Y ), equivalent( equivalent( X, Z ),
% 0.42/1.12 equivalent( Z, Y ) ) ) )] ), substitution( 1, [ :=( X, equivalent(
% 0.42/1.12 equivalent( X, Z ), equivalent( Z, Y ) ) ), :=( Y, Y ), :=( Z, X )] )
% 0.42/1.12 ).
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 subsumption(
% 0.42/1.12 clause( 1907, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.42/1.12 equivalent( X, Z ), equivalent( Z, Y ) ) ) ) ] )
% 0.42/1.12 , clause( 1956, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.42/1.12 equivalent( equivalent( X, Z ), equivalent( Z, Y ) ) ) ) ] )
% 0.42/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.42/1.12 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 resolution(
% 0.42/1.12 clause( 1957, [] )
% 0.42/1.12 , clause( 2, [ ~( 'is_a_theorem'( equivalent( equivalent( a, b ),
% 0.42/1.12 equivalent( equivalent( a, c ), equivalent( c, b ) ) ) ) ) ] )
% 0.42/1.12 , 0, clause( 1907, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.42/1.12 equivalent( equivalent( X, Z ), equivalent( Z, Y ) ) ) ) ] )
% 0.42/1.12 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, a ), :=( Y, b ), :=(
% 0.42/1.12 Z, c )] )).
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 subsumption(
% 0.42/1.12 clause( 1931, [] )
% 0.42/1.12 , clause( 1957, [] )
% 0.42/1.12 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 end.
% 0.42/1.12
% 0.42/1.12 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.42/1.12
% 0.42/1.12 Memory use:
% 0.42/1.12
% 0.42/1.12 space for terms: 37296
% 0.42/1.12 space for clauses: 191193
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 clauses generated: 3151
% 0.42/1.12 clauses kept: 1932
% 0.42/1.12 clauses selected: 243
% 0.42/1.12 clauses deleted: 0
% 0.42/1.12 clauses inuse deleted: 0
% 0.42/1.12
% 0.42/1.12 subsentry: 1480
% 0.42/1.12 literals s-matched: 1220
% 0.42/1.12 literals matched: 1220
% 0.42/1.12 full subsumption: 0
% 0.42/1.12
% 0.42/1.12 checksum: 1749414286
% 0.42/1.12
% 0.42/1.12
% 0.42/1.12 Bliksem ended
%------------------------------------------------------------------------------