TSTP Solution File: LCL098-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL098-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n021.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:17 EDT 2022
% Result : Unsatisfiable 0.43s 1.07s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL098-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n021.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 20:54:17 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.43/1.07 *** allocated 10000 integers for termspace/termends
% 0.43/1.07 *** allocated 10000 integers for clauses
% 0.43/1.07 *** allocated 10000 integers for justifications
% 0.43/1.07 Bliksem 1.12
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 Automatic Strategy Selection
% 0.43/1.07
% 0.43/1.07 Clauses:
% 0.43/1.07 [
% 0.43/1.07 [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), ~( 'is_a_theorem'( X ) ),
% 0.43/1.07 'is_a_theorem'( Y ) ],
% 0.43/1.07 [ 'is_a_theorem'( equivalent( equivalent( equivalent( equivalent(
% 0.43/1.07 equivalent( equivalent( X, Y ), equivalent( X, Z ) ), T ), equivalent(
% 0.43/1.07 equivalent( Y, Z ), T ) ), U ), U ) ) ],
% 0.43/1.07 [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( equivalent( a,
% 0.43/1.07 b ), c ), e ), equivalent( equivalent( equivalent( a, falsehood ), c ),
% 0.43/1.07 equivalent( equivalent( b, falsehood ), e ) ) ) ) ) ]
% 0.43/1.07 ] .
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 percentage equality = 0.000000, percentage horn = 1.000000
% 0.43/1.07 This is a near-Horn, non-equality problem
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 Options Used:
% 0.43/1.07
% 0.43/1.07 useres = 1
% 0.43/1.07 useparamod = 0
% 0.43/1.07 useeqrefl = 0
% 0.43/1.07 useeqfact = 0
% 0.43/1.07 usefactor = 1
% 0.43/1.07 usesimpsplitting = 0
% 0.43/1.07 usesimpdemod = 0
% 0.43/1.07 usesimpres = 4
% 0.43/1.07
% 0.43/1.07 resimpinuse = 1000
% 0.43/1.07 resimpclauses = 20000
% 0.43/1.07 substype = standard
% 0.43/1.07 backwardsubs = 1
% 0.43/1.07 selectoldest = 5
% 0.43/1.07
% 0.43/1.07 litorderings [0] = split
% 0.43/1.07 litorderings [1] = liftord
% 0.43/1.07
% 0.43/1.07 termordering = none
% 0.43/1.07
% 0.43/1.07 litapriori = 1
% 0.43/1.07 termapriori = 0
% 0.43/1.07 litaposteriori = 0
% 0.43/1.07 termaposteriori = 0
% 0.43/1.07 demodaposteriori = 0
% 0.43/1.07 ordereqreflfact = 0
% 0.43/1.07
% 0.43/1.07 litselect = negative
% 0.43/1.07
% 0.43/1.07 maxweight = 30000
% 0.43/1.07 maxdepth = 30000
% 0.43/1.07 maxlength = 115
% 0.43/1.07 maxnrvars = 195
% 0.43/1.07 excuselevel = 0
% 0.43/1.07 increasemaxweight = 0
% 0.43/1.07
% 0.43/1.07 maxselected = 10000000
% 0.43/1.07 maxnrclauses = 10000000
% 0.43/1.07
% 0.43/1.07 showgenerated = 0
% 0.43/1.07 showkept = 0
% 0.43/1.07 showselected = 0
% 0.43/1.07 showdeleted = 0
% 0.43/1.07 showresimp = 1
% 0.43/1.07 showstatus = 2000
% 0.43/1.07
% 0.43/1.07 prologoutput = 1
% 0.43/1.07 nrgoals = 5000000
% 0.43/1.07 totalproof = 1
% 0.43/1.07
% 0.43/1.07 Symbols occurring in the translation:
% 0.43/1.07
% 0.43/1.07 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.43/1.07 . [1, 2] (w:1, o:25, a:1, s:1, b:0),
% 0.43/1.07 ! [4, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.43/1.07 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.43/1.07 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.43/1.07 equivalent [41, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.43/1.07 'is_a_theorem' [42, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.43/1.07 a [46, 0] (w:1, o:14, a:1, s:1, b:0),
% 0.43/1.07 b [47, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.43/1.07 c [48, 0] (w:1, o:16, a:1, s:1, b:0),
% 0.43/1.07 e [49, 0] (w:1, o:17, a:1, s:1, b:0),
% 0.43/1.07 falsehood [50, 0] (w:1, o:18, a:1, s:1, b:0).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 Starting Search:
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 Bliksems!, er is een bewijs:
% 0.43/1.07 % SZS status Unsatisfiable
% 0.43/1.07 % SZS output start Refutation
% 0.43/1.07
% 0.43/1.07 clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.43/1.07 , ~( 'is_a_theorem'( X ) ) ] )
% 0.43/1.07 .
% 0.43/1.07 clause( 1, [ 'is_a_theorem'( equivalent( equivalent( equivalent( equivalent(
% 0.43/1.07 equivalent( equivalent( X, Y ), equivalent( X, Z ) ), T ), equivalent(
% 0.43/1.07 equivalent( Y, Z ), T ) ), U ), U ) ) ] )
% 0.43/1.07 .
% 0.43/1.07 clause( 2, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.43/1.07 equivalent( a, b ), c ), e ), equivalent( equivalent( equivalent( a,
% 0.43/1.07 falsehood ), c ), equivalent( equivalent( b, falsehood ), e ) ) ) ) ) ]
% 0.43/1.07 )
% 0.43/1.07 .
% 0.43/1.07 clause( 3, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( equivalent( equivalent(
% 0.43/1.07 equivalent( equivalent( equivalent( equivalent( equivalent( X, Y ),
% 0.43/1.07 equivalent( X, Z ) ), T ), equivalent( equivalent( Y, Z ), T ) ), U ), U
% 0.43/1.07 ), W ) ) ) ] )
% 0.43/1.07 .
% 0.43/1.07 clause( 4, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ), Z
% 0.43/1.07 ), equivalent( equivalent( T, Y ), equivalent( equivalent( X, T ), Z ) )
% 0.43/1.07 ) ) ] )
% 0.43/1.07 .
% 0.43/1.07 clause( 6, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent( equivalent(
% 0.43/1.07 equivalent( equivalent( X, Y ), Z ), equivalent( equivalent( T, Y ),
% 0.43/1.07 equivalent( equivalent( X, T ), Z ) ) ), U ) ) ) ] )
% 0.43/1.07 .
% 0.43/1.07 clause( 11, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.43/1.07 equivalent( equivalent( equivalent( Z, T ), equivalent( Z, U ) ), X ),
% 0.43/1.07 equivalent( equivalent( T, U ), Y ) ) ) ) ] )
% 0.43/1.07 .
% 0.43/1.07 clause( 16, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.43/1.07 equivalent( X, Y ), equivalent( X, Z ) ), equivalent( equivalent(
% 0.43/1.07 equivalent( equivalent( equivalent( T, U ), equivalent( T, W ) ), V0 ),
% 0.43/1.07 equivalent( equivalent( U, W ), V0 ) ), V1 ) ), equivalent( equivalent( Y
% 0.43/1.07 , Z ), V1 ) ) ) ] )
% 0.43/1.07 .
% 0.43/1.07 clause( 17, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( equivalent(
% 0.43/1.07 equivalent( equivalent( X, Y ), equivalent( equivalent( equivalent(
% 0.43/1.07 equivalent( Z, T ), equivalent( Z, U ) ), X ), equivalent( equivalent( T
% 0.43/1.07 , U ), Y ) ) ), W ) ) ) ] )
% 0.43/1.07 .
% 0.43/1.07 clause( 271, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.43/1.07 equivalent( X, Y ), Z ), T ), equivalent( equivalent( equivalent( X, U )
% 0.43/1.07 , Z ), equivalent( equivalent( Y, U ), T ) ) ) ) ] )
% 0.43/1.07 .
% 0.43/1.07 clause( 277, [] )
% 0.43/1.07 .
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 % SZS output end Refutation
% 0.43/1.07 found a proof!
% 0.43/1.07
% 0.43/1.07 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.43/1.07
% 0.43/1.07 initialclauses(
% 0.43/1.07 [ clause( 279, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), ~(
% 0.43/1.07 'is_a_theorem'( X ) ), 'is_a_theorem'( Y ) ] )
% 0.43/1.07 , clause( 280, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.43/1.07 equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z ) ), T ),
% 0.43/1.07 equivalent( equivalent( Y, Z ), T ) ), U ), U ) ) ] )
% 0.43/1.07 , clause( 281, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.43/1.07 equivalent( a, b ), c ), e ), equivalent( equivalent( equivalent( a,
% 0.43/1.07 falsehood ), c ), equivalent( equivalent( b, falsehood ), e ) ) ) ) ) ]
% 0.43/1.07 )
% 0.43/1.07 ] ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.43/1.07 , ~( 'is_a_theorem'( X ) ) ] )
% 0.43/1.07 , clause( 279, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), ~(
% 0.43/1.07 'is_a_theorem'( X ) ), 'is_a_theorem'( Y ) ] )
% 0.43/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.43/1.07 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 1, [ 'is_a_theorem'( equivalent( equivalent( equivalent( equivalent(
% 0.43/1.07 equivalent( equivalent( X, Y ), equivalent( X, Z ) ), T ), equivalent(
% 0.43/1.07 equivalent( Y, Z ), T ) ), U ), U ) ) ] )
% 0.43/1.07 , clause( 280, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.43/1.07 equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z ) ), T ),
% 0.43/1.07 equivalent( equivalent( Y, Z ), T ) ), U ), U ) ) ] )
% 0.43/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.43/1.07 , U )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 2, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.43/1.07 equivalent( a, b ), c ), e ), equivalent( equivalent( equivalent( a,
% 0.43/1.07 falsehood ), c ), equivalent( equivalent( b, falsehood ), e ) ) ) ) ) ]
% 0.43/1.07 )
% 0.43/1.07 , clause( 281, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.43/1.07 equivalent( a, b ), c ), e ), equivalent( equivalent( equivalent( a,
% 0.43/1.07 falsehood ), c ), equivalent( equivalent( b, falsehood ), e ) ) ) ) ) ]
% 0.43/1.07 )
% 0.43/1.07 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 resolution(
% 0.43/1.07 clause( 283, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.43/1.07 equivalent( equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z
% 0.43/1.07 ) ), T ), equivalent( equivalent( Y, Z ), T ) ), U ), U ), W ) ) ),
% 0.43/1.07 'is_a_theorem'( W ) ] )
% 0.43/1.07 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.43/1.07 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.43/1.07 , 2, clause( 1, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.43/1.07 equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z ) ), T ),
% 0.43/1.07 equivalent( equivalent( Y, Z ), T ) ), U ), U ) ) ] )
% 0.43/1.07 , 0, substitution( 0, [ :=( X, equivalent( equivalent( equivalent(
% 0.43/1.07 equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z ) ), T ),
% 0.43/1.07 equivalent( equivalent( Y, Z ), T ) ), U ), U ) ), :=( Y, W )] ),
% 0.43/1.07 substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.43/1.07 , U )] )).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 3, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( equivalent( equivalent(
% 0.43/1.07 equivalent( equivalent( equivalent( equivalent( equivalent( X, Y ),
% 0.43/1.07 equivalent( X, Z ) ), T ), equivalent( equivalent( Y, Z ), T ) ), U ), U
% 0.43/1.07 ), W ) ) ) ] )
% 0.43/1.07 , clause( 283, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.43/1.07 equivalent( equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z
% 0.43/1.07 ) ), T ), equivalent( equivalent( Y, Z ), T ) ), U ), U ), W ) ) ),
% 0.43/1.07 'is_a_theorem'( W ) ] )
% 0.43/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.43/1.07 , U ), :=( W, W )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 resolution(
% 0.43/1.07 clause( 284, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ),
% 0.43/1.07 Z ), equivalent( equivalent( T, Y ), equivalent( equivalent( X, T ), Z )
% 0.43/1.07 ) ) ) ] )
% 0.43/1.07 , clause( 3, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( equivalent(
% 0.43/1.07 equivalent( equivalent( equivalent( equivalent( equivalent( equivalent( X
% 0.43/1.07 , Y ), equivalent( X, Z ) ), T ), equivalent( equivalent( Y, Z ), T ) ),
% 0.43/1.07 U ), U ), W ) ) ) ] )
% 0.43/1.07 , 1, clause( 1, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.43/1.07 equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z ) ), T ),
% 0.43/1.07 equivalent( equivalent( Y, Z ), T ) ), U ), U ) ) ] )
% 0.43/1.07 , 0, substitution( 0, [ :=( X, X ), :=( Y, T ), :=( Z, Y ), :=( T,
% 0.43/1.07 equivalent( equivalent( X, T ), Z ) ), :=( U, equivalent( equivalent(
% 0.43/1.07 equivalent( X, Y ), Z ), equivalent( equivalent( T, Y ), equivalent(
% 0.43/1.07 equivalent( X, T ), Z ) ) ) ), :=( W, equivalent( equivalent( equivalent(
% 0.43/1.07 X, Y ), Z ), equivalent( equivalent( T, Y ), equivalent( equivalent( X, T
% 0.43/1.07 ), Z ) ) ) )] ), substitution( 1, [ :=( X, equivalent( X, T ) ), :=( Y,
% 0.43/1.07 equivalent( X, Y ) ), :=( Z, Z ), :=( T, equivalent( equivalent( T, Y ),
% 0.43/1.07 equivalent( equivalent( X, T ), Z ) ) ), :=( U, equivalent( equivalent(
% 0.43/1.07 equivalent( X, Y ), Z ), equivalent( equivalent( T, Y ), equivalent(
% 0.43/1.07 equivalent( X, T ), Z ) ) ) )] )).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 4, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ), Z
% 0.43/1.07 ), equivalent( equivalent( T, Y ), equivalent( equivalent( X, T ), Z ) )
% 0.43/1.07 ) ) ] )
% 0.43/1.07 , clause( 284, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y )
% 0.43/1.07 , Z ), equivalent( equivalent( T, Y ), equivalent( equivalent( X, T ), Z
% 0.43/1.07 ) ) ) ) ] )
% 0.43/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.43/1.07 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 resolution(
% 0.43/1.07 clause( 286, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.43/1.07 equivalent( X, Y ), Z ), equivalent( equivalent( T, Y ), equivalent(
% 0.43/1.07 equivalent( X, T ), Z ) ) ), U ) ) ), 'is_a_theorem'( U ) ] )
% 0.43/1.07 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.43/1.07 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.43/1.07 , 2, clause( 4, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.43/1.07 ), Z ), equivalent( equivalent( T, Y ), equivalent( equivalent( X, T ),
% 0.43/1.07 Z ) ) ) ) ] )
% 0.43/1.07 , 0, substitution( 0, [ :=( X, equivalent( equivalent( equivalent( X, Y ),
% 0.43/1.07 Z ), equivalent( equivalent( T, Y ), equivalent( equivalent( X, T ), Z )
% 0.43/1.07 ) ) ), :=( Y, U )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z,
% 0.43/1.07 Z ), :=( T, T )] )).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 6, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent( equivalent(
% 0.43/1.07 equivalent( equivalent( X, Y ), Z ), equivalent( equivalent( T, Y ),
% 0.43/1.07 equivalent( equivalent( X, T ), Z ) ) ), U ) ) ) ] )
% 0.43/1.07 , clause( 286, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.43/1.07 equivalent( X, Y ), Z ), equivalent( equivalent( T, Y ), equivalent(
% 0.43/1.07 equivalent( X, T ), Z ) ) ), U ) ) ), 'is_a_theorem'( U ) ] )
% 0.43/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.43/1.07 , U )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 resolution(
% 0.43/1.07 clause( 287, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.43/1.07 equivalent( equivalent( equivalent( Z, T ), equivalent( Z, U ) ), X ),
% 0.43/1.07 equivalent( equivalent( T, U ), Y ) ) ) ) ] )
% 0.43/1.07 , clause( 6, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.43/1.07 equivalent( equivalent( equivalent( X, Y ), Z ), equivalent( equivalent(
% 0.43/1.07 T, Y ), equivalent( equivalent( X, T ), Z ) ) ), U ) ) ) ] )
% 0.43/1.07 , 1, clause( 1, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.43/1.07 equivalent( equivalent( equivalent( X, Y ), equivalent( X, Z ) ), T ),
% 0.43/1.07 equivalent( equivalent( Y, Z ), T ) ), U ), U ) ) ] )
% 0.43/1.07 , 0, substitution( 0, [ :=( X, equivalent( equivalent( Z, T ), equivalent(
% 0.43/1.07 Z, U ) ) ), :=( Y, Y ), :=( Z, equivalent( equivalent( T, U ), Y ) ),
% 0.43/1.07 :=( T, X ), :=( U, equivalent( equivalent( X, Y ), equivalent( equivalent(
% 0.43/1.07 equivalent( equivalent( Z, T ), equivalent( Z, U ) ), X ), equivalent(
% 0.43/1.07 equivalent( T, U ), Y ) ) ) )] ), substitution( 1, [ :=( X, Z ), :=( Y, T
% 0.43/1.07 ), :=( Z, U ), :=( T, Y ), :=( U, equivalent( equivalent( X, Y ),
% 0.43/1.07 equivalent( equivalent( equivalent( equivalent( Z, T ), equivalent( Z, U
% 0.43/1.07 ) ), X ), equivalent( equivalent( T, U ), Y ) ) ) )] )).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 11, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.43/1.07 equivalent( equivalent( equivalent( Z, T ), equivalent( Z, U ) ), X ),
% 0.43/1.07 equivalent( equivalent( T, U ), Y ) ) ) ) ] )
% 0.43/1.07 , clause( 287, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.43/1.07 equivalent( equivalent( equivalent( Z, T ), equivalent( Z, U ) ), X ),
% 0.43/1.07 equivalent( equivalent( T, U ), Y ) ) ) ) ] )
% 0.43/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.43/1.07 , U )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 resolution(
% 0.43/1.07 clause( 288, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.43/1.07 equivalent( X, Y ), equivalent( X, Z ) ), equivalent( equivalent(
% 0.43/1.07 equivalent( equivalent( equivalent( T, U ), equivalent( T, W ) ), V0 ),
% 0.43/1.07 equivalent( equivalent( U, W ), V0 ) ), V1 ) ), equivalent( equivalent( Y
% 0.43/1.07 , Z ), V1 ) ) ) ] )
% 0.43/1.07 , clause( 3, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( equivalent(
% 0.43/1.07 equivalent( equivalent( equivalent( equivalent( equivalent( equivalent( X
% 0.43/1.07 , Y ), equivalent( X, Z ) ), T ), equivalent( equivalent( Y, Z ), T ) ),
% 0.43/1.07 U ), U ), W ) ) ) ] )
% 0.43/1.07 , 1, clause( 11, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.43/1.07 equivalent( equivalent( equivalent( equivalent( Z, T ), equivalent( Z, U
% 0.43/1.07 ) ), X ), equivalent( equivalent( T, U ), Y ) ) ) ) ] )
% 0.43/1.07 , 0, substitution( 0, [ :=( X, T ), :=( Y, U ), :=( Z, W ), :=( T, V0 ),
% 0.43/1.07 :=( U, V1 ), :=( W, equivalent( equivalent( equivalent( equivalent( X, Y
% 0.43/1.07 ), equivalent( X, Z ) ), equivalent( equivalent( equivalent( equivalent(
% 0.43/1.07 equivalent( T, U ), equivalent( T, W ) ), V0 ), equivalent( equivalent( U
% 0.43/1.07 , W ), V0 ) ), V1 ) ), equivalent( equivalent( Y, Z ), V1 ) ) )] ),
% 0.43/1.07 substitution( 1, [ :=( X, equivalent( equivalent( equivalent( equivalent(
% 0.43/1.07 equivalent( T, U ), equivalent( T, W ) ), V0 ), equivalent( equivalent( U
% 0.43/1.07 , W ), V0 ) ), V1 ) ), :=( Y, V1 ), :=( Z, X ), :=( T, Y ), :=( U, Z )] )
% 0.43/1.07 ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 16, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.43/1.07 equivalent( X, Y ), equivalent( X, Z ) ), equivalent( equivalent(
% 0.43/1.07 equivalent( equivalent( equivalent( T, U ), equivalent( T, W ) ), V0 ),
% 0.43/1.07 equivalent( equivalent( U, W ), V0 ) ), V1 ) ), equivalent( equivalent( Y
% 0.43/1.07 , Z ), V1 ) ) ) ] )
% 0.43/1.07 , clause( 288, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.43/1.07 equivalent( X, Y ), equivalent( X, Z ) ), equivalent( equivalent(
% 0.43/1.07 equivalent( equivalent( equivalent( T, U ), equivalent( T, W ) ), V0 ),
% 0.43/1.07 equivalent( equivalent( U, W ), V0 ) ), V1 ) ), equivalent( equivalent( Y
% 0.43/1.07 , Z ), V1 ) ) ) ] )
% 0.43/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.43/1.07 , U ), :=( W, W ), :=( V0, V0 ), :=( V1, V1 )] ), permutation( 0, [ ==>(
% 0.43/1.07 0, 0 )] ) ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 resolution(
% 0.43/1.07 clause( 290, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.43/1.07 ), equivalent( equivalent( equivalent( equivalent( Z, T ), equivalent( Z
% 0.43/1.07 , U ) ), X ), equivalent( equivalent( T, U ), Y ) ) ), W ) ) ),
% 0.43/1.07 'is_a_theorem'( W ) ] )
% 0.43/1.07 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.43/1.07 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.43/1.07 , 2, clause( 11, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.43/1.07 equivalent( equivalent( equivalent( equivalent( Z, T ), equivalent( Z, U
% 0.43/1.07 ) ), X ), equivalent( equivalent( T, U ), Y ) ) ) ) ] )
% 0.43/1.07 , 0, substitution( 0, [ :=( X, equivalent( equivalent( X, Y ), equivalent(
% 0.43/1.07 equivalent( equivalent( equivalent( Z, T ), equivalent( Z, U ) ), X ),
% 0.43/1.07 equivalent( equivalent( T, U ), Y ) ) ) ), :=( Y, W )] ), substitution( 1
% 0.43/1.07 , [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U, U )] )).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 17, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( equivalent(
% 0.43/1.07 equivalent( equivalent( X, Y ), equivalent( equivalent( equivalent(
% 0.43/1.07 equivalent( Z, T ), equivalent( Z, U ) ), X ), equivalent( equivalent( T
% 0.43/1.07 , U ), Y ) ) ), W ) ) ) ] )
% 0.43/1.07 , clause( 290, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( X,
% 0.43/1.07 Y ), equivalent( equivalent( equivalent( equivalent( Z, T ), equivalent(
% 0.43/1.07 Z, U ) ), X ), equivalent( equivalent( T, U ), Y ) ) ), W ) ) ),
% 0.43/1.07 'is_a_theorem'( W ) ] )
% 0.43/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.43/1.07 , U ), :=( W, W )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 resolution(
% 0.43/1.07 clause( 291, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.43/1.07 equivalent( X, Y ), Z ), T ), equivalent( equivalent( equivalent( X, U )
% 0.43/1.07 , Z ), equivalent( equivalent( Y, U ), T ) ) ) ) ] )
% 0.43/1.07 , clause( 17, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( equivalent(
% 0.43/1.07 equivalent( equivalent( X, Y ), equivalent( equivalent( equivalent(
% 0.43/1.07 equivalent( Z, T ), equivalent( Z, U ) ), X ), equivalent( equivalent( T
% 0.43/1.07 , U ), Y ) ) ), W ) ) ) ] )
% 0.43/1.07 , 1, clause( 16, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.43/1.07 equivalent( X, Y ), equivalent( X, Z ) ), equivalent( equivalent(
% 0.43/1.07 equivalent( equivalent( equivalent( T, U ), equivalent( T, W ) ), V0 ),
% 0.43/1.07 equivalent( equivalent( U, W ), V0 ) ), V1 ) ), equivalent( equivalent( Y
% 0.43/1.07 , Z ), V1 ) ) ) ] )
% 0.43/1.07 , 0, substitution( 0, [ :=( X, equivalent( equivalent( Y, U ), equivalent(
% 0.43/1.07 equivalent( X, Y ), Z ) ) ), :=( Y, equivalent( equivalent( Y, U ), T ) )
% 0.43/1.07 , :=( Z, equivalent( X, Y ) ), :=( T, equivalent( X, U ) ), :=( U, Z ),
% 0.43/1.07 :=( W, equivalent( equivalent( equivalent( equivalent( X, Y ), Z ), T ),
% 0.43/1.07 equivalent( equivalent( equivalent( X, U ), Z ), equivalent( equivalent(
% 0.43/1.07 Y, U ), T ) ) ) )] ), substitution( 1, [ :=( X, equivalent( Y, U ) ),
% 0.43/1.07 :=( Y, equivalent( equivalent( X, Y ), Z ) ), :=( Z, T ), :=( T, X ),
% 0.43/1.07 :=( U, Y ), :=( W, U ), :=( V0, equivalent( equivalent( X, Y ), Z ) ),
% 0.43/1.07 :=( V1, equivalent( equivalent( equivalent( X, U ), Z ), equivalent(
% 0.43/1.07 equivalent( Y, U ), T ) ) )] )).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 271, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.43/1.07 equivalent( X, Y ), Z ), T ), equivalent( equivalent( equivalent( X, U )
% 0.43/1.07 , Z ), equivalent( equivalent( Y, U ), T ) ) ) ) ] )
% 0.43/1.07 , clause( 291, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.43/1.07 equivalent( X, Y ), Z ), T ), equivalent( equivalent( equivalent( X, U )
% 0.43/1.07 , Z ), equivalent( equivalent( Y, U ), T ) ) ) ) ] )
% 0.43/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.43/1.07 , U )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 resolution(
% 0.43/1.07 clause( 292, [] )
% 0.43/1.07 , clause( 2, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.43/1.07 equivalent( a, b ), c ), e ), equivalent( equivalent( equivalent( a,
% 0.43/1.07 falsehood ), c ), equivalent( equivalent( b, falsehood ), e ) ) ) ) ) ]
% 0.43/1.07 )
% 0.43/1.07 , 0, clause( 271, [ 'is_a_theorem'( equivalent( equivalent( equivalent(
% 0.43/1.07 equivalent( X, Y ), Z ), T ), equivalent( equivalent( equivalent( X, U )
% 0.43/1.07 , Z ), equivalent( equivalent( Y, U ), T ) ) ) ) ] )
% 0.43/1.07 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, a ), :=( Y, b ), :=(
% 0.43/1.07 Z, c ), :=( T, e ), :=( U, falsehood )] )).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 277, [] )
% 0.43/1.07 , clause( 292, [] )
% 0.43/1.07 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 end.
% 0.43/1.07
% 0.43/1.07 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.43/1.07
% 0.43/1.07 Memory use:
% 0.43/1.07
% 0.43/1.07 space for terms: 8609
% 0.43/1.07 space for clauses: 45876
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 clauses generated: 307
% 0.43/1.07 clauses kept: 278
% 0.43/1.07 clauses selected: 47
% 0.43/1.07 clauses deleted: 0
% 0.43/1.07 clauses inuse deleted: 0
% 0.43/1.07
% 0.43/1.07 subsentry: 76
% 0.43/1.07 literals s-matched: 29
% 0.43/1.07 literals matched: 29
% 0.43/1.07 full subsumption: 0
% 0.43/1.07
% 0.43/1.07 checksum: -1448842993
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 Bliksem ended
%------------------------------------------------------------------------------