TSTP Solution File: LCL130-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL130-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n008.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:46 EDT 2022
% Result : Unsatisfiable 0.66s 1.06s
% Output : Refutation 0.66s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL130-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n008.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 : Mon Jul 4 04:37:23 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.66/1.06 *** allocated 10000 integers for termspace/termends
% 0.66/1.06 *** allocated 10000 integers for clauses
% 0.66/1.06 *** allocated 10000 integers for justifications
% 0.66/1.06 Bliksem 1.12
% 0.66/1.06
% 0.66/1.06
% 0.66/1.06 Automatic Strategy Selection
% 0.66/1.06
% 0.66/1.06 Clauses:
% 0.66/1.06 [
% 0.66/1.06 [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), ~( 'is_a_theorem'( X ) ),
% 0.66/1.06 'is_a_theorem'( Y ) ],
% 0.66/1.06 [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( equivalent( Y,
% 0.66/1.06 Z ), equivalent( equivalent( Y, T ), equivalent( Z, T ) ) ) ), X ) ) ]
% 0.66/1.06 ,
% 0.66/1.06 [ ~( 'is_a_theorem'( equivalent( a, equivalent( a, equivalent(
% 0.66/1.06 equivalent( b, c ), equivalent( equivalent( b, e ), equivalent( c, e ) )
% 0.66/1.06 ) ) ) ) ) ]
% 0.66/1.06 ] .
% 0.66/1.06
% 0.66/1.06
% 0.66/1.06 percentage equality = 0.000000, percentage horn = 1.000000
% 0.66/1.06 This is a near-Horn, non-equality problem
% 0.66/1.06
% 0.66/1.06
% 0.66/1.06 Options Used:
% 0.66/1.06
% 0.66/1.06 useres = 1
% 0.66/1.06 useparamod = 0
% 0.66/1.06 useeqrefl = 0
% 0.66/1.06 useeqfact = 0
% 0.66/1.06 usefactor = 1
% 0.66/1.06 usesimpsplitting = 0
% 0.66/1.06 usesimpdemod = 0
% 0.66/1.06 usesimpres = 4
% 0.66/1.06
% 0.66/1.06 resimpinuse = 1000
% 0.66/1.06 resimpclauses = 20000
% 0.66/1.06 substype = standard
% 0.66/1.06 backwardsubs = 1
% 0.66/1.06 selectoldest = 5
% 0.66/1.06
% 0.66/1.06 litorderings [0] = split
% 0.66/1.06 litorderings [1] = liftord
% 0.66/1.06
% 0.66/1.06 termordering = none
% 0.66/1.06
% 0.66/1.06 litapriori = 1
% 0.66/1.06 termapriori = 0
% 0.66/1.06 litaposteriori = 0
% 0.66/1.06 termaposteriori = 0
% 0.66/1.06 demodaposteriori = 0
% 0.66/1.06 ordereqreflfact = 0
% 0.66/1.06
% 0.66/1.06 litselect = negative
% 0.66/1.06
% 0.66/1.06 maxweight = 30000
% 0.66/1.06 maxdepth = 30000
% 0.66/1.06 maxlength = 115
% 0.66/1.06 maxnrvars = 195
% 0.66/1.06 excuselevel = 0
% 0.66/1.06 increasemaxweight = 0
% 0.66/1.06
% 0.66/1.06 maxselected = 10000000
% 0.66/1.06 maxnrclauses = 10000000
% 0.66/1.06
% 0.66/1.06 showgenerated = 0
% 0.66/1.06 showkept = 0
% 0.66/1.06 showselected = 0
% 0.66/1.06 showdeleted = 0
% 0.66/1.06 showresimp = 1
% 0.66/1.06 showstatus = 2000
% 0.66/1.06
% 0.66/1.06 prologoutput = 1
% 0.66/1.06 nrgoals = 5000000
% 0.66/1.06 totalproof = 1
% 0.66/1.06
% 0.66/1.06 Symbols occurring in the translation:
% 0.66/1.06
% 0.66/1.06 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.66/1.06 . [1, 2] (w:1, o:23, a:1, s:1, b:0),
% 0.66/1.06 ! [4, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.66/1.06 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.66/1.06 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.66/1.06 equivalent [41, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.66/1.06 'is_a_theorem' [42, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.66/1.06 a [45, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.66/1.06 b [46, 0] (w:1, o:14, a:1, s:1, b:0),
% 0.66/1.06 c [47, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.66/1.06 e [48, 0] (w:1, o:16, a:1, s:1, b:0).
% 0.66/1.06
% 0.66/1.06
% 0.66/1.06 Starting Search:
% 0.66/1.06
% 0.66/1.06
% 0.66/1.06 Bliksems!, er is een bewijs:
% 0.66/1.06 % SZS status Unsatisfiable
% 0.66/1.06 % SZS output start Refutation
% 0.66/1.06
% 0.66/1.06 clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.66/1.06 , ~( 'is_a_theorem'( X ) ) ] )
% 0.66/1.06 .
% 0.66/1.06 clause( 1, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.66/1.06 equivalent( Y, Z ), equivalent( equivalent( Y, T ), equivalent( Z, T ) )
% 0.66/1.06 ) ), X ) ) ] )
% 0.66/1.06 .
% 0.66/1.06 clause( 2, [ ~( 'is_a_theorem'( equivalent( a, equivalent( a, equivalent(
% 0.66/1.06 equivalent( b, c ), equivalent( equivalent( b, e ), equivalent( c, e ) )
% 0.66/1.06 ) ) ) ) ) ] )
% 0.66/1.06 .
% 0.66/1.06 clause( 3, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent( equivalent(
% 0.66/1.06 equivalent( X, equivalent( equivalent( Y, Z ), equivalent( equivalent( Y
% 0.66/1.06 , T ), equivalent( Z, T ) ) ) ), X ), U ) ) ) ] )
% 0.66/1.06 .
% 0.66/1.06 clause( 4, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.66/1.06 equivalent( equivalent( X, Z ), equivalent( Y, Z ) ) ), equivalent(
% 0.66/1.06 equivalent( T, U ), equivalent( equivalent( T, W ), equivalent( U, W ) )
% 0.66/1.06 ) ) ) ] )
% 0.66/1.06 .
% 0.66/1.06 clause( 5, [ 'is_a_theorem'( V0 ), ~( 'is_a_theorem'( equivalent(
% 0.66/1.06 equivalent( equivalent( equivalent( X, Y ), equivalent( equivalent( X, Z
% 0.66/1.06 ), equivalent( Y, Z ) ) ), equivalent( equivalent( T, U ), equivalent(
% 0.66/1.06 equivalent( T, W ), equivalent( U, W ) ) ) ), V0 ) ) ) ] )
% 0.66/1.06 .
% 0.66/1.06 clause( 6, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.66/1.06 equivalent( X, Z ), equivalent( Y, Z ) ) ) ) ] )
% 0.66/1.06 .
% 0.66/1.06 clause( 8, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X,
% 0.66/1.06 equivalent( equivalent( Y, Z ), equivalent( equivalent( Y, T ),
% 0.66/1.06 equivalent( Z, T ) ) ) ), U ), equivalent( X, U ) ) ) ] )
% 0.66/1.06 .
% 0.66/1.06 clause( 26, [ 'is_a_theorem'( equivalent( X, X ) ) ] )
% 0.66/1.06 .
% 0.66/1.06 clause( 28, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( equivalent(
% 0.66/1.06 equivalent( X, X ), Y ) ) ) ] )
% 0.66/1.06 .
% 0.66/1.06 clause( 29, [ 'is_a_theorem'( equivalent( X, equivalent( X, equivalent(
% 0.66/1.06 equivalent( Y, Z ), equivalent( equivalent( Y, T ), equivalent( Z, T ) )
% 0.66/1.06 ) ) ) ) ] )
% 0.66/1.06 .
% 0.66/1.06 clause( 36, [] )
% 0.66/1.06 .
% 0.66/1.06
% 0.66/1.06
% 0.66/1.06 % SZS output end Refutation
% 0.66/1.06 found a proof!
% 0.66/1.06
% 0.66/1.06 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.66/1.06
% 0.66/1.06 initialclauses(
% 0.66/1.06 [ clause( 38, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), ~(
% 0.66/1.06 'is_a_theorem'( X ) ), 'is_a_theorem'( Y ) ] )
% 0.66/1.06 , clause( 39, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.66/1.06 equivalent( Y, Z ), equivalent( equivalent( Y, T ), equivalent( Z, T ) )
% 0.66/1.06 ) ), X ) ) ] )
% 0.66/1.06 , clause( 40, [ ~( 'is_a_theorem'( equivalent( a, equivalent( a, equivalent(
% 0.66/1.06 equivalent( b, c ), equivalent( equivalent( b, e ), equivalent( c, e ) )
% 0.66/1.06 ) ) ) ) ) ] )
% 0.66/1.06 ] ).
% 0.66/1.06
% 0.66/1.06
% 0.66/1.06
% 0.66/1.06 subsumption(
% 0.66/1.06 clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.66/1.06 , ~( 'is_a_theorem'( X ) ) ] )
% 0.66/1.06 , clause( 38, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), ~(
% 0.66/1.06 'is_a_theorem'( X ) ), 'is_a_theorem'( Y ) ] )
% 0.66/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.66/1.06 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.66/1.06
% 0.66/1.06
% 0.66/1.06 subsumption(
% 0.66/1.06 clause( 1, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.66/1.07 equivalent( Y, Z ), equivalent( equivalent( Y, T ), equivalent( Z, T ) )
% 0.66/1.07 ) ), X ) ) ] )
% 0.66/1.07 , clause( 39, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.66/1.07 equivalent( Y, Z ), equivalent( equivalent( Y, T ), equivalent( Z, T ) )
% 0.66/1.07 ) ), X ) ) ] )
% 0.66/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.66/1.07 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 subsumption(
% 0.66/1.07 clause( 2, [ ~( 'is_a_theorem'( equivalent( a, equivalent( a, equivalent(
% 0.66/1.07 equivalent( b, c ), equivalent( equivalent( b, e ), equivalent( c, e ) )
% 0.66/1.07 ) ) ) ) ) ] )
% 0.66/1.07 , clause( 40, [ ~( 'is_a_theorem'( equivalent( a, equivalent( a, equivalent(
% 0.66/1.07 equivalent( b, c ), equivalent( equivalent( b, e ), equivalent( c, e ) )
% 0.66/1.07 ) ) ) ) ) ] )
% 0.66/1.07 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 resolution(
% 0.66/1.07 clause( 42, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( X,
% 0.66/1.07 equivalent( equivalent( Y, Z ), equivalent( equivalent( Y, T ),
% 0.66/1.07 equivalent( Z, T ) ) ) ), X ), U ) ) ), 'is_a_theorem'( U ) ] )
% 0.66/1.07 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.66/1.07 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.66/1.07 , 2, clause( 1, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.66/1.07 equivalent( Y, Z ), equivalent( equivalent( Y, T ), equivalent( Z, T ) )
% 0.66/1.07 ) ), X ) ) ] )
% 0.66/1.07 , 0, substitution( 0, [ :=( X, equivalent( equivalent( X, equivalent(
% 0.66/1.07 equivalent( Y, Z ), equivalent( equivalent( Y, T ), equivalent( Z, T ) )
% 0.66/1.07 ) ), X ) ), :=( Y, U )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ),
% 0.66/1.07 :=( Z, Z ), :=( T, T )] )).
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 subsumption(
% 0.66/1.07 clause( 3, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent( equivalent(
% 0.66/1.07 equivalent( X, equivalent( equivalent( Y, Z ), equivalent( equivalent( Y
% 0.66/1.07 , T ), equivalent( Z, T ) ) ) ), X ), U ) ) ) ] )
% 0.66/1.07 , clause( 42, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( X,
% 0.66/1.07 equivalent( equivalent( Y, Z ), equivalent( equivalent( Y, T ),
% 0.66/1.07 equivalent( Z, T ) ) ) ), X ), U ) ) ), 'is_a_theorem'( U ) ] )
% 0.66/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.66/1.07 , U )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 resolution(
% 0.66/1.07 clause( 43, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.66/1.07 equivalent( equivalent( X, Z ), equivalent( Y, Z ) ) ), equivalent(
% 0.66/1.07 equivalent( T, U ), equivalent( equivalent( T, W ), equivalent( U, W ) )
% 0.66/1.07 ) ) ) ] )
% 0.66/1.07 , clause( 3, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.66/1.07 equivalent( equivalent( X, equivalent( equivalent( Y, Z ), equivalent(
% 0.66/1.07 equivalent( Y, T ), equivalent( Z, T ) ) ) ), X ), U ) ) ) ] )
% 0.66/1.07 , 1, clause( 1, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.66/1.07 equivalent( Y, Z ), equivalent( equivalent( Y, T ), equivalent( Z, T ) )
% 0.66/1.07 ) ), X ) ) ] )
% 0.66/1.07 , 0, substitution( 0, [ :=( X, equivalent( equivalent( X, Y ), equivalent(
% 0.66/1.07 equivalent( X, Z ), equivalent( Y, Z ) ) ) ), :=( Y, T ), :=( Z, U ),
% 0.66/1.07 :=( T, W ), :=( U, equivalent( equivalent( equivalent( X, Y ), equivalent(
% 0.66/1.07 equivalent( X, Z ), equivalent( Y, Z ) ) ), equivalent( equivalent( T, U
% 0.66/1.07 ), equivalent( equivalent( T, W ), equivalent( U, W ) ) ) ) )] ),
% 0.66/1.07 substitution( 1, [ :=( X, equivalent( equivalent( equivalent( X, Y ),
% 0.66/1.07 equivalent( equivalent( X, Z ), equivalent( Y, Z ) ) ), equivalent(
% 0.66/1.07 equivalent( T, U ), equivalent( equivalent( T, W ), equivalent( U, W ) )
% 0.66/1.07 ) ) ), :=( Y, X ), :=( Z, Y ), :=( T, Z )] )).
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 subsumption(
% 0.66/1.07 clause( 4, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.66/1.07 equivalent( equivalent( X, Z ), equivalent( Y, Z ) ) ), equivalent(
% 0.66/1.07 equivalent( T, U ), equivalent( equivalent( T, W ), equivalent( U, W ) )
% 0.66/1.07 ) ) ) ] )
% 0.66/1.07 , clause( 43, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y )
% 0.66/1.07 , equivalent( equivalent( X, Z ), equivalent( Y, Z ) ) ), equivalent(
% 0.66/1.07 equivalent( T, U ), equivalent( equivalent( T, W ), equivalent( U, W ) )
% 0.66/1.07 ) ) ) ] )
% 0.66/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.66/1.07 , U ), :=( W, W )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 resolution(
% 0.66/1.07 clause( 45, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.66/1.07 equivalent( X, Y ), equivalent( equivalent( X, Z ), equivalent( Y, Z ) )
% 0.66/1.07 ), equivalent( equivalent( T, U ), equivalent( equivalent( T, W ),
% 0.66/1.07 equivalent( U, W ) ) ) ), V0 ) ) ), 'is_a_theorem'( V0 ) ] )
% 0.66/1.07 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.66/1.07 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.66/1.07 , 2, clause( 4, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.66/1.07 ), equivalent( equivalent( X, Z ), equivalent( Y, Z ) ) ), equivalent(
% 0.66/1.07 equivalent( T, U ), equivalent( equivalent( T, W ), equivalent( U, W ) )
% 0.66/1.07 ) ) ) ] )
% 0.66/1.07 , 0, substitution( 0, [ :=( X, equivalent( equivalent( equivalent( X, Y ),
% 0.66/1.07 equivalent( equivalent( X, Z ), equivalent( Y, Z ) ) ), equivalent(
% 0.66/1.07 equivalent( T, U ), equivalent( equivalent( T, W ), equivalent( U, W ) )
% 0.66/1.07 ) ) ), :=( Y, V0 )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z
% 0.66/1.07 , Z ), :=( T, T ), :=( U, U ), :=( W, W )] )).
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 subsumption(
% 0.66/1.07 clause( 5, [ 'is_a_theorem'( V0 ), ~( 'is_a_theorem'( equivalent(
% 0.66/1.07 equivalent( equivalent( equivalent( X, Y ), equivalent( equivalent( X, Z
% 0.66/1.07 ), equivalent( Y, Z ) ) ), equivalent( equivalent( T, U ), equivalent(
% 0.66/1.07 equivalent( T, W ), equivalent( U, W ) ) ) ), V0 ) ) ) ] )
% 0.66/1.07 , clause( 45, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.66/1.07 equivalent( X, Y ), equivalent( equivalent( X, Z ), equivalent( Y, Z ) )
% 0.66/1.07 ), equivalent( equivalent( T, U ), equivalent( equivalent( T, W ),
% 0.66/1.07 equivalent( U, W ) ) ) ), V0 ) ) ), 'is_a_theorem'( V0 ) ] )
% 0.66/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.66/1.07 , U ), :=( W, W ), :=( V0, V0 )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1
% 0.66/1.07 , 0 )] ) ).
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 resolution(
% 0.66/1.07 clause( 46, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.66/1.07 equivalent( X, Z ), equivalent( Y, Z ) ) ) ) ] )
% 0.66/1.07 , clause( 5, [ 'is_a_theorem'( V0 ), ~( 'is_a_theorem'( equivalent(
% 0.66/1.07 equivalent( equivalent( equivalent( X, Y ), equivalent( equivalent( X, Z
% 0.66/1.07 ), equivalent( Y, Z ) ) ), equivalent( equivalent( T, U ), equivalent(
% 0.66/1.07 equivalent( T, W ), equivalent( U, W ) ) ) ), V0 ) ) ) ] )
% 0.66/1.07 , 1, clause( 1, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.66/1.07 equivalent( Y, Z ), equivalent( equivalent( Y, T ), equivalent( Z, T ) )
% 0.66/1.07 ) ), X ) ) ] )
% 0.66/1.07 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ),
% 0.66/1.07 :=( U, U ), :=( W, W ), :=( V0, equivalent( equivalent( X, Y ),
% 0.66/1.07 equivalent( equivalent( X, Z ), equivalent( Y, Z ) ) ) )] ),
% 0.66/1.07 substitution( 1, [ :=( X, equivalent( equivalent( X, Y ), equivalent(
% 0.66/1.07 equivalent( X, Z ), equivalent( Y, Z ) ) ) ), :=( Y, T ), :=( Z, U ),
% 0.66/1.07 :=( T, W )] )).
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 subsumption(
% 0.66/1.07 clause( 6, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.66/1.07 equivalent( X, Z ), equivalent( Y, Z ) ) ) ) ] )
% 0.66/1.07 , clause( 46, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.66/1.07 equivalent( X, Z ), equivalent( Y, Z ) ) ) ) ] )
% 0.66/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.66/1.07 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 resolution(
% 0.66/1.07 clause( 47, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X,
% 0.66/1.07 equivalent( equivalent( Y, Z ), equivalent( equivalent( Y, T ),
% 0.66/1.07 equivalent( Z, T ) ) ) ), U ), equivalent( X, U ) ) ) ] )
% 0.66/1.07 , clause( 3, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.66/1.07 equivalent( equivalent( X, equivalent( equivalent( Y, Z ), equivalent(
% 0.66/1.07 equivalent( Y, T ), equivalent( Z, T ) ) ) ), X ), U ) ) ) ] )
% 0.66/1.07 , 1, clause( 6, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.66/1.07 equivalent( equivalent( X, Z ), equivalent( Y, Z ) ) ) ) ] )
% 0.66/1.07 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ),
% 0.66/1.07 :=( U, equivalent( equivalent( equivalent( X, equivalent( equivalent( Y,
% 0.66/1.07 Z ), equivalent( equivalent( Y, T ), equivalent( Z, T ) ) ) ), U ),
% 0.66/1.07 equivalent( X, U ) ) )] ), substitution( 1, [ :=( X, equivalent( X,
% 0.66/1.07 equivalent( equivalent( Y, Z ), equivalent( equivalent( Y, T ),
% 0.66/1.07 equivalent( Z, T ) ) ) ) ), :=( Y, X ), :=( Z, U )] )).
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 subsumption(
% 0.66/1.07 clause( 8, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X,
% 0.66/1.07 equivalent( equivalent( Y, Z ), equivalent( equivalent( Y, T ),
% 0.66/1.07 equivalent( Z, T ) ) ) ), U ), equivalent( X, U ) ) ) ] )
% 0.66/1.07 , clause( 47, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X,
% 0.66/1.07 equivalent( equivalent( Y, Z ), equivalent( equivalent( Y, T ),
% 0.66/1.07 equivalent( Z, T ) ) ) ), U ), equivalent( X, U ) ) ) ] )
% 0.66/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.66/1.07 , U )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 resolution(
% 0.66/1.07 clause( 48, [ 'is_a_theorem'( equivalent( X, X ) ) ] )
% 0.66/1.07 , clause( 3, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.66/1.07 equivalent( equivalent( X, equivalent( equivalent( Y, Z ), equivalent(
% 0.66/1.07 equivalent( Y, T ), equivalent( Z, T ) ) ) ), X ), U ) ) ) ] )
% 0.66/1.07 , 1, clause( 8, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X,
% 0.66/1.07 equivalent( equivalent( Y, Z ), equivalent( equivalent( Y, T ),
% 0.66/1.07 equivalent( Z, T ) ) ) ), U ), equivalent( X, U ) ) ) ] )
% 0.66/1.07 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ),
% 0.66/1.07 :=( U, equivalent( X, X ) )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )
% 0.66/1.07 , :=( Z, Z ), :=( T, T ), :=( U, X )] )).
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 subsumption(
% 0.66/1.07 clause( 26, [ 'is_a_theorem'( equivalent( X, X ) ) ] )
% 0.66/1.07 , clause( 48, [ 'is_a_theorem'( equivalent( X, X ) ) ] )
% 0.66/1.07 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 resolution(
% 0.66/1.07 clause( 50, [ ~( 'is_a_theorem'( equivalent( equivalent( X, X ), Y ) ) ),
% 0.66/1.07 'is_a_theorem'( Y ) ] )
% 0.66/1.07 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.66/1.07 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.66/1.07 , 2, clause( 26, [ 'is_a_theorem'( equivalent( X, X ) ) ] )
% 0.66/1.07 , 0, substitution( 0, [ :=( X, equivalent( X, X ) ), :=( Y, Y )] ),
% 0.66/1.07 substitution( 1, [ :=( X, X )] )).
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 subsumption(
% 0.66/1.07 clause( 28, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( equivalent(
% 0.66/1.07 equivalent( X, X ), Y ) ) ) ] )
% 0.66/1.07 , clause( 50, [ ~( 'is_a_theorem'( equivalent( equivalent( X, X ), Y ) ) )
% 0.66/1.07 , 'is_a_theorem'( Y ) ] )
% 0.66/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.66/1.07 ), ==>( 1, 0 )] ) ).
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 resolution(
% 0.66/1.07 clause( 51, [ 'is_a_theorem'( equivalent( X, equivalent( X, equivalent(
% 0.66/1.07 equivalent( Y, Z ), equivalent( equivalent( Y, T ), equivalent( Z, T ) )
% 0.66/1.07 ) ) ) ) ] )
% 0.66/1.07 , clause( 28, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( equivalent(
% 0.66/1.07 equivalent( X, X ), Y ) ) ) ] )
% 0.66/1.07 , 1, clause( 8, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X,
% 0.66/1.07 equivalent( equivalent( Y, Z ), equivalent( equivalent( Y, T ),
% 0.66/1.07 equivalent( Z, T ) ) ) ), U ), equivalent( X, U ) ) ) ] )
% 0.66/1.07 , 0, substitution( 0, [ :=( X, equivalent( X, equivalent( equivalent( Y, Z
% 0.66/1.07 ), equivalent( equivalent( Y, T ), equivalent( Z, T ) ) ) ) ), :=( Y,
% 0.66/1.07 equivalent( X, equivalent( X, equivalent( equivalent( Y, Z ), equivalent(
% 0.66/1.07 equivalent( Y, T ), equivalent( Z, T ) ) ) ) ) )] ), substitution( 1, [
% 0.66/1.07 :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U, equivalent( X,
% 0.66/1.07 equivalent( equivalent( Y, Z ), equivalent( equivalent( Y, T ),
% 0.66/1.07 equivalent( Z, T ) ) ) ) )] )).
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 subsumption(
% 0.66/1.07 clause( 29, [ 'is_a_theorem'( equivalent( X, equivalent( X, equivalent(
% 0.66/1.07 equivalent( Y, Z ), equivalent( equivalent( Y, T ), equivalent( Z, T ) )
% 0.66/1.07 ) ) ) ) ] )
% 0.66/1.07 , clause( 51, [ 'is_a_theorem'( equivalent( X, equivalent( X, equivalent(
% 0.66/1.07 equivalent( Y, Z ), equivalent( equivalent( Y, T ), equivalent( Z, T ) )
% 0.66/1.07 ) ) ) ) ] )
% 0.66/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.66/1.07 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 resolution(
% 0.66/1.07 clause( 52, [] )
% 0.66/1.07 , clause( 2, [ ~( 'is_a_theorem'( equivalent( a, equivalent( a, equivalent(
% 0.66/1.07 equivalent( b, c ), equivalent( equivalent( b, e ), equivalent( c, e ) )
% 0.66/1.07 ) ) ) ) ) ] )
% 0.66/1.07 , 0, clause( 29, [ 'is_a_theorem'( equivalent( X, equivalent( X, equivalent(
% 0.66/1.07 equivalent( Y, Z ), equivalent( equivalent( Y, T ), equivalent( Z, T ) )
% 0.66/1.07 ) ) ) ) ] )
% 0.66/1.07 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, a ), :=( Y, b ), :=(
% 0.66/1.07 Z, c ), :=( T, e )] )).
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 subsumption(
% 0.66/1.07 clause( 36, [] )
% 0.66/1.07 , clause( 52, [] )
% 0.66/1.07 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 end.
% 0.66/1.07
% 0.66/1.07 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.66/1.07
% 0.66/1.07 Memory use:
% 0.66/1.07
% 0.66/1.07 space for terms: 809
% 0.66/1.07 space for clauses: 4933
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 clauses generated: 72
% 0.66/1.07 clauses kept: 37
% 0.66/1.07 clauses selected: 21
% 0.66/1.07 clauses deleted: 1
% 0.66/1.07 clauses inuse deleted: 0
% 0.66/1.07
% 0.66/1.07 subsentry: 58
% 0.66/1.07 literals s-matched: 37
% 0.66/1.07 literals matched: 37
% 0.66/1.07 full subsumption: 0
% 0.66/1.07
% 0.66/1.07 checksum: -619216841
% 0.66/1.07
% 0.66/1.07
% 0.66/1.07 Bliksem ended
%------------------------------------------------------------------------------