TSTP Solution File: LCL118-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL118-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n027.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:35 EDT 2022
% Result : Unsatisfiable 0.72s 1.10s
% Output : Refutation 0.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL118-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : bliksem %s
% 0.13/0.33 % Computer : n027.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % DateTime : Sun Jul 3 06:03:54 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.72/1.10 *** allocated 10000 integers for termspace/termends
% 0.72/1.10 *** allocated 10000 integers for clauses
% 0.72/1.10 *** allocated 10000 integers for justifications
% 0.72/1.10 Bliksem 1.12
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 Automatic Strategy Selection
% 0.72/1.10
% 0.72/1.10 Clauses:
% 0.72/1.10 [
% 0.72/1.10 [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), ~( 'is_a_theorem'( X ) ),
% 0.72/1.10 'is_a_theorem'( Y ) ],
% 0.72/1.10 [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y, Z ) ),
% 0.72/1.10 equivalent( Z, equivalent( Y, X ) ) ) ) ],
% 0.72/1.10 [ ~( 'is_a_theorem'( equivalent( equivalent( a, b ), equivalent(
% 0.72/1.10 equivalent( c, b ), equivalent( c, a ) ) ) ) ) ]
% 0.72/1.10 ] .
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 percentage equality = 0.000000, percentage horn = 1.000000
% 0.72/1.10 This is a near-Horn, non-equality problem
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 Options Used:
% 0.72/1.10
% 0.72/1.10 useres = 1
% 0.72/1.10 useparamod = 0
% 0.72/1.10 useeqrefl = 0
% 0.72/1.10 useeqfact = 0
% 0.72/1.10 usefactor = 1
% 0.72/1.10 usesimpsplitting = 0
% 0.72/1.10 usesimpdemod = 0
% 0.72/1.10 usesimpres = 4
% 0.72/1.10
% 0.72/1.10 resimpinuse = 1000
% 0.72/1.10 resimpclauses = 20000
% 0.72/1.10 substype = standard
% 0.72/1.10 backwardsubs = 1
% 0.72/1.10 selectoldest = 5
% 0.72/1.10
% 0.72/1.10 litorderings [0] = split
% 0.72/1.10 litorderings [1] = liftord
% 0.72/1.10
% 0.72/1.10 termordering = none
% 0.72/1.10
% 0.72/1.10 litapriori = 1
% 0.72/1.10 termapriori = 0
% 0.72/1.10 litaposteriori = 0
% 0.72/1.10 termaposteriori = 0
% 0.72/1.10 demodaposteriori = 0
% 0.72/1.10 ordereqreflfact = 0
% 0.72/1.10
% 0.72/1.10 litselect = negative
% 0.72/1.10
% 0.72/1.10 maxweight = 30000
% 0.72/1.10 maxdepth = 30000
% 0.72/1.10 maxlength = 115
% 0.72/1.10 maxnrvars = 195
% 0.72/1.10 excuselevel = 0
% 0.72/1.10 increasemaxweight = 0
% 0.72/1.10
% 0.72/1.10 maxselected = 10000000
% 0.72/1.10 maxnrclauses = 10000000
% 0.72/1.10
% 0.72/1.10 showgenerated = 0
% 0.72/1.10 showkept = 0
% 0.72/1.10 showselected = 0
% 0.72/1.10 showdeleted = 0
% 0.72/1.10 showresimp = 1
% 0.72/1.10 showstatus = 2000
% 0.72/1.10
% 0.72/1.10 prologoutput = 1
% 0.72/1.10 nrgoals = 5000000
% 0.72/1.10 totalproof = 1
% 0.72/1.10
% 0.72/1.10 Symbols occurring in the translation:
% 0.72/1.10
% 0.72/1.10 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.72/1.10 . [1, 2] (w:1, o:21, a:1, s:1, b:0),
% 0.72/1.10 ! [4, 1] (w:1, o:15, a:1, s:1, b:0),
% 0.72/1.10 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.72/1.10 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.72/1.10 equivalent [41, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.72/1.10 'is_a_theorem' [42, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.72/1.10 a [44, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.72/1.10 b [45, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.72/1.10 c [46, 0] (w:1, o:14, a:1, s:1, b:0).
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 Starting Search:
% 0.72/1.10
% 0.72/1.10 Resimplifying inuse:
% 0.72/1.10 Done
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 Bliksems!, er is een bewijs:
% 0.72/1.10 % SZS status Unsatisfiable
% 0.72/1.10 % SZS output start Refutation
% 0.72/1.10
% 0.72/1.10 clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.72/1.10 , ~( 'is_a_theorem'( X ) ) ] )
% 0.72/1.10 .
% 0.72/1.10 clause( 1, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y, Z )
% 0.72/1.10 ), equivalent( Z, equivalent( Y, X ) ) ) ) ] )
% 0.72/1.10 .
% 0.72/1.10 clause( 2, [ ~( 'is_a_theorem'( equivalent( equivalent( a, b ), equivalent(
% 0.72/1.10 equivalent( c, b ), equivalent( c, a ) ) ) ) ) ] )
% 0.72/1.10 .
% 0.72/1.10 clause( 3, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent( equivalent(
% 0.72/1.10 equivalent( X, equivalent( Y, Z ) ), equivalent( Z, equivalent( Y, X ) )
% 0.72/1.10 ), T ) ) ) ] )
% 0.72/1.10 .
% 0.72/1.10 clause( 4, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent( Z
% 0.72/1.10 , equivalent( Y, equivalent( X, Z ) ) ) ) ) ] )
% 0.72/1.10 .
% 0.72/1.10 clause( 5, [ 'is_a_theorem'( equivalent( X, equivalent( equivalent( Y,
% 0.72/1.10 equivalent( Z, T ) ), equivalent( equivalent( T, equivalent( Z, Y ) ), X
% 0.72/1.10 ) ) ) ) ] )
% 0.72/1.10 .
% 0.72/1.10 clause( 6, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent( equivalent(
% 0.72/1.10 equivalent( X, Y ), equivalent( Z, equivalent( Y, equivalent( X, Z ) ) )
% 0.72/1.10 ), T ) ) ) ] )
% 0.72/1.10 .
% 0.72/1.10 clause( 9, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y, Z )
% 0.72/1.10 ), equivalent( equivalent( Z, equivalent( Y, X ) ), equivalent(
% 0.72/1.10 equivalent( T, U ), equivalent( W, equivalent( U, equivalent( T, W ) ) )
% 0.72/1.10 ) ) ) ) ] )
% 0.72/1.10 .
% 0.72/1.10 clause( 10, [ 'is_a_theorem'( equivalent( X, equivalent( equivalent( Y,
% 0.72/1.10 equivalent( Z, equivalent( T, Y ) ) ), equivalent( equivalent( T, Z ), X
% 0.72/1.10 ) ) ) ) ] )
% 0.72/1.10 .
% 0.72/1.10 clause( 13, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.72/1.10 equivalent( X, equivalent( equivalent( Y, equivalent( Z, equivalent( T, Y
% 0.72/1.10 ) ) ), equivalent( equivalent( T, Z ), X ) ) ), U ) ) ) ] )
% 0.72/1.10 .
% 0.72/1.10 clause( 17, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ), Z
% 0.72/1.10 ), equivalent( equivalent( T, equivalent( Y, equivalent( X, T ) ) ), Z )
% 0.72/1.10 ) ) ] )
% 0.72/1.10 .
% 0.72/1.10 clause( 20, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.72/1.10 equivalent( Y, Z ), equivalent( T, X ) ) ), equivalent( Z, equivalent( Y
% 0.72/1.10 , T ) ) ) ) ] )
% 0.72/1.10 .
% 0.72/1.10 clause( 79, [ 'is_a_theorem'( V0 ), ~( 'is_a_theorem'( equivalent(
% 0.72/1.10 equivalent( equivalent( X, equivalent( Y, Z ) ), equivalent( equivalent(
% 0.72/1.10 Z, equivalent( Y, X ) ), equivalent( equivalent( T, U ), equivalent( W,
% 0.72/1.10 equivalent( U, equivalent( T, W ) ) ) ) ) ), V0 ) ) ) ] )
% 0.72/1.10 .
% 0.72/1.10 clause( 1648, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.72/1.10 equivalent( Z, Y ), equivalent( Z, X ) ) ) ) ] )
% 0.72/1.10 .
% 0.72/1.10 clause( 1686, [] )
% 0.72/1.10 .
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 % SZS output end Refutation
% 0.72/1.10 found a proof!
% 0.72/1.10
% 0.72/1.10 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.72/1.10
% 0.72/1.10 initialclauses(
% 0.72/1.10 [ clause( 1688, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), ~(
% 0.72/1.10 'is_a_theorem'( X ) ), 'is_a_theorem'( Y ) ] )
% 0.72/1.10 , clause( 1689, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y
% 0.72/1.10 , Z ) ), equivalent( Z, equivalent( Y, X ) ) ) ) ] )
% 0.72/1.10 , clause( 1690, [ ~( 'is_a_theorem'( equivalent( equivalent( a, b ),
% 0.72/1.10 equivalent( equivalent( c, b ), equivalent( c, a ) ) ) ) ) ] )
% 0.72/1.10 ] ).
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 subsumption(
% 0.72/1.10 clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.72/1.10 , ~( 'is_a_theorem'( X ) ) ] )
% 0.72/1.10 , clause( 1688, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), ~(
% 0.72/1.10 'is_a_theorem'( X ) ), 'is_a_theorem'( Y ) ] )
% 0.72/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.72/1.10 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 subsumption(
% 0.72/1.10 clause( 1, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y, Z )
% 0.72/1.10 ), equivalent( Z, equivalent( Y, X ) ) ) ) ] )
% 0.72/1.10 , clause( 1689, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y
% 0.72/1.10 , Z ) ), equivalent( Z, equivalent( Y, X ) ) ) ) ] )
% 0.72/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.72/1.10 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 subsumption(
% 0.72/1.10 clause( 2, [ ~( 'is_a_theorem'( equivalent( equivalent( a, b ), equivalent(
% 0.72/1.10 equivalent( c, b ), equivalent( c, a ) ) ) ) ) ] )
% 0.72/1.10 , clause( 1690, [ ~( 'is_a_theorem'( equivalent( equivalent( a, b ),
% 0.72/1.10 equivalent( equivalent( c, b ), equivalent( c, a ) ) ) ) ) ] )
% 0.72/1.10 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 resolution(
% 0.72/1.10 clause( 1692, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( X,
% 0.72/1.10 equivalent( Y, Z ) ), equivalent( Z, equivalent( Y, X ) ) ), T ) ) ),
% 0.72/1.10 'is_a_theorem'( T ) ] )
% 0.72/1.10 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.72/1.10 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.72/1.10 , 2, clause( 1, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y
% 0.72/1.10 , Z ) ), equivalent( Z, equivalent( Y, X ) ) ) ) ] )
% 0.72/1.10 , 0, substitution( 0, [ :=( X, equivalent( equivalent( X, equivalent( Y, Z
% 0.72/1.10 ) ), equivalent( Z, equivalent( Y, X ) ) ) ), :=( Y, T )] ),
% 0.72/1.10 substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 subsumption(
% 0.72/1.10 clause( 3, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent( equivalent(
% 0.72/1.10 equivalent( X, equivalent( Y, Z ) ), equivalent( Z, equivalent( Y, X ) )
% 0.72/1.10 ), T ) ) ) ] )
% 0.72/1.10 , clause( 1692, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( X
% 0.72/1.10 , equivalent( Y, Z ) ), equivalent( Z, equivalent( Y, X ) ) ), T ) ) ),
% 0.72/1.10 'is_a_theorem'( T ) ] )
% 0.72/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.72/1.10 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 resolution(
% 0.72/1.10 clause( 1693, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.72/1.10 Z, equivalent( Y, equivalent( X, Z ) ) ) ) ) ] )
% 0.72/1.10 , clause( 3, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent(
% 0.72/1.10 equivalent( equivalent( X, equivalent( Y, Z ) ), equivalent( Z,
% 0.72/1.10 equivalent( Y, X ) ) ), T ) ) ) ] )
% 0.72/1.10 , 1, clause( 1, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y
% 0.72/1.10 , Z ) ), equivalent( Z, equivalent( Y, X ) ) ) ) ] )
% 0.72/1.10 , 0, substitution( 0, [ :=( X, Y ), :=( Y, X ), :=( Z, Z ), :=( T,
% 0.72/1.10 equivalent( equivalent( X, Y ), equivalent( Z, equivalent( Y, equivalent(
% 0.72/1.10 X, Z ) ) ) ) )] ), substitution( 1, [ :=( X, equivalent( Y, equivalent( X
% 0.72/1.10 , Z ) ) ), :=( Y, Z ), :=( Z, equivalent( X, Y ) )] )).
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 subsumption(
% 0.72/1.10 clause( 4, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent( Z
% 0.72/1.10 , equivalent( Y, equivalent( X, Z ) ) ) ) ) ] )
% 0.72/1.10 , clause( 1693, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.72/1.10 equivalent( Z, equivalent( Y, equivalent( X, Z ) ) ) ) ) ] )
% 0.72/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.72/1.10 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 resolution(
% 0.72/1.10 clause( 1694, [ 'is_a_theorem'( equivalent( X, equivalent( equivalent( Y,
% 0.72/1.10 equivalent( Z, T ) ), equivalent( equivalent( T, equivalent( Z, Y ) ), X
% 0.72/1.10 ) ) ) ) ] )
% 0.72/1.10 , clause( 3, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent(
% 0.72/1.10 equivalent( equivalent( X, equivalent( Y, Z ) ), equivalent( Z,
% 0.72/1.10 equivalent( Y, X ) ) ), T ) ) ) ] )
% 0.72/1.10 , 1, clause( 4, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.72/1.10 equivalent( Z, equivalent( Y, equivalent( X, Z ) ) ) ) ) ] )
% 0.72/1.10 , 0, substitution( 0, [ :=( X, T ), :=( Y, Z ), :=( Z, Y ), :=( T,
% 0.72/1.10 equivalent( X, equivalent( equivalent( Y, equivalent( Z, T ) ),
% 0.72/1.10 equivalent( equivalent( T, equivalent( Z, Y ) ), X ) ) ) )] ),
% 0.72/1.10 substitution( 1, [ :=( X, equivalent( T, equivalent( Z, Y ) ) ), :=( Y,
% 0.72/1.10 equivalent( Y, equivalent( Z, T ) ) ), :=( Z, X )] )).
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 subsumption(
% 0.72/1.10 clause( 5, [ 'is_a_theorem'( equivalent( X, equivalent( equivalent( Y,
% 0.72/1.10 equivalent( Z, T ) ), equivalent( equivalent( T, equivalent( Z, Y ) ), X
% 0.72/1.10 ) ) ) ) ] )
% 0.72/1.10 , clause( 1694, [ 'is_a_theorem'( equivalent( X, equivalent( equivalent( Y
% 0.72/1.10 , equivalent( Z, T ) ), equivalent( equivalent( T, equivalent( Z, Y ) ),
% 0.72/1.10 X ) ) ) ) ] )
% 0.72/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.72/1.10 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 resolution(
% 0.72/1.10 clause( 1696, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.72/1.10 ), equivalent( Z, equivalent( Y, equivalent( X, Z ) ) ) ), T ) ) ),
% 0.72/1.10 'is_a_theorem'( T ) ] )
% 0.72/1.10 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.72/1.10 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.72/1.10 , 2, clause( 4, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.72/1.10 equivalent( Z, equivalent( Y, equivalent( X, Z ) ) ) ) ) ] )
% 0.72/1.10 , 0, substitution( 0, [ :=( X, equivalent( equivalent( X, Y ), equivalent(
% 0.72/1.10 Z, equivalent( Y, equivalent( X, Z ) ) ) ) ), :=( Y, T )] ),
% 0.72/1.10 substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 subsumption(
% 0.72/1.10 clause( 6, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent( equivalent(
% 0.72/1.10 equivalent( X, Y ), equivalent( Z, equivalent( Y, equivalent( X, Z ) ) )
% 0.72/1.10 ), T ) ) ) ] )
% 0.72/1.10 , clause( 1696, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( X
% 0.72/1.10 , Y ), equivalent( Z, equivalent( Y, equivalent( X, Z ) ) ) ), T ) ) ),
% 0.72/1.10 'is_a_theorem'( T ) ] )
% 0.72/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.72/1.10 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 resolution(
% 0.72/1.10 clause( 1697, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y, Z
% 0.72/1.10 ) ), equivalent( equivalent( Z, equivalent( Y, X ) ), equivalent(
% 0.72/1.10 equivalent( T, U ), equivalent( W, equivalent( U, equivalent( T, W ) ) )
% 0.72/1.10 ) ) ) ) ] )
% 0.72/1.10 , clause( 6, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent(
% 0.72/1.10 equivalent( equivalent( X, Y ), equivalent( Z, equivalent( Y, equivalent(
% 0.72/1.10 X, Z ) ) ) ), T ) ) ) ] )
% 0.72/1.10 , 1, clause( 5, [ 'is_a_theorem'( equivalent( X, equivalent( equivalent( Y
% 0.72/1.10 , equivalent( Z, T ) ), equivalent( equivalent( T, equivalent( Z, Y ) ),
% 0.72/1.10 X ) ) ) ) ] )
% 0.72/1.10 , 0, substitution( 0, [ :=( X, T ), :=( Y, U ), :=( Z, W ), :=( T,
% 0.72/1.10 equivalent( equivalent( X, equivalent( Y, Z ) ), equivalent( equivalent(
% 0.72/1.10 Z, equivalent( Y, X ) ), equivalent( equivalent( T, U ), equivalent( W,
% 0.72/1.10 equivalent( U, equivalent( T, W ) ) ) ) ) ) )] ), substitution( 1, [ :=(
% 0.72/1.10 X, equivalent( equivalent( T, U ), equivalent( W, equivalent( U,
% 0.72/1.10 equivalent( T, W ) ) ) ) ), :=( Y, X ), :=( Z, Y ), :=( T, Z )] )).
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 subsumption(
% 0.72/1.10 clause( 9, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y, Z )
% 0.72/1.10 ), equivalent( equivalent( Z, equivalent( Y, X ) ), equivalent(
% 0.72/1.10 equivalent( T, U ), equivalent( W, equivalent( U, equivalent( T, W ) ) )
% 0.72/1.10 ) ) ) ) ] )
% 0.72/1.10 , clause( 1697, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y
% 0.72/1.10 , Z ) ), equivalent( equivalent( Z, equivalent( Y, X ) ), equivalent(
% 0.72/1.10 equivalent( T, U ), equivalent( W, equivalent( U, equivalent( T, W ) ) )
% 0.72/1.10 ) ) ) ) ] )
% 0.72/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.72/1.10 , U ), :=( W, W )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 resolution(
% 0.72/1.10 clause( 1698, [ 'is_a_theorem'( equivalent( X, equivalent( equivalent( Y,
% 0.72/1.10 equivalent( Z, equivalent( T, Y ) ) ), equivalent( equivalent( T, Z ), X
% 0.72/1.10 ) ) ) ) ] )
% 0.72/1.10 , clause( 6, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent(
% 0.72/1.10 equivalent( equivalent( X, Y ), equivalent( Z, equivalent( Y, equivalent(
% 0.72/1.10 X, Z ) ) ) ), T ) ) ) ] )
% 0.72/1.10 , 1, clause( 4, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.72/1.10 equivalent( Z, equivalent( Y, equivalent( X, Z ) ) ) ) ) ] )
% 0.72/1.10 , 0, substitution( 0, [ :=( X, T ), :=( Y, Z ), :=( Z, Y ), :=( T,
% 0.72/1.10 equivalent( X, equivalent( equivalent( Y, equivalent( Z, equivalent( T, Y
% 0.72/1.10 ) ) ), equivalent( equivalent( T, Z ), X ) ) ) )] ), substitution( 1, [
% 0.72/1.10 :=( X, equivalent( T, Z ) ), :=( Y, equivalent( Y, equivalent( Z,
% 0.72/1.10 equivalent( T, Y ) ) ) ), :=( Z, X )] )).
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 subsumption(
% 0.72/1.10 clause( 10, [ 'is_a_theorem'( equivalent( X, equivalent( equivalent( Y,
% 0.72/1.10 equivalent( Z, equivalent( T, Y ) ) ), equivalent( equivalent( T, Z ), X
% 0.72/1.10 ) ) ) ) ] )
% 0.72/1.10 , clause( 1698, [ 'is_a_theorem'( equivalent( X, equivalent( equivalent( Y
% 0.72/1.10 , equivalent( Z, equivalent( T, Y ) ) ), equivalent( equivalent( T, Z ),
% 0.72/1.10 X ) ) ) ) ] )
% 0.72/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.72/1.10 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 resolution(
% 0.72/1.10 clause( 1700, [ ~( 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.72/1.10 equivalent( Y, equivalent( Z, equivalent( T, Y ) ) ), equivalent(
% 0.72/1.10 equivalent( T, Z ), X ) ) ), U ) ) ), 'is_a_theorem'( U ) ] )
% 0.72/1.10 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.72/1.10 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.72/1.10 , 2, clause( 10, [ 'is_a_theorem'( equivalent( X, equivalent( equivalent( Y
% 0.72/1.10 , equivalent( Z, equivalent( T, Y ) ) ), equivalent( equivalent( T, Z ),
% 0.72/1.10 X ) ) ) ) ] )
% 0.72/1.10 , 0, substitution( 0, [ :=( X, equivalent( X, equivalent( equivalent( Y,
% 0.72/1.10 equivalent( Z, equivalent( T, Y ) ) ), equivalent( equivalent( T, Z ), X
% 0.72/1.10 ) ) ) ), :=( Y, U )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z
% 0.72/1.10 , Z ), :=( T, T )] )).
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 subsumption(
% 0.72/1.10 clause( 13, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.72/1.10 equivalent( X, equivalent( equivalent( Y, equivalent( Z, equivalent( T, Y
% 0.72/1.10 ) ) ), equivalent( equivalent( T, Z ), X ) ) ), U ) ) ) ] )
% 0.72/1.10 , clause( 1700, [ ~( 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.72/1.10 equivalent( Y, equivalent( Z, equivalent( T, Y ) ) ), equivalent(
% 0.72/1.10 equivalent( T, Z ), X ) ) ), U ) ) ), 'is_a_theorem'( U ) ] )
% 0.72/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.72/1.10 , U )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 resolution(
% 0.72/1.10 clause( 1701, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y )
% 0.72/1.10 , Z ), equivalent( equivalent( T, equivalent( Y, equivalent( X, T ) ) ),
% 0.72/1.10 Z ) ) ) ] )
% 0.72/1.10 , clause( 13, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( equivalent(
% 0.72/1.10 equivalent( X, equivalent( equivalent( Y, equivalent( Z, equivalent( T, Y
% 0.72/1.10 ) ) ), equivalent( equivalent( T, Z ), X ) ) ), U ) ) ) ] )
% 0.72/1.10 , 1, clause( 1, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y
% 0.72/1.10 , Z ) ), equivalent( Z, equivalent( Y, X ) ) ) ) ] )
% 0.72/1.10 , 0, substitution( 0, [ :=( X, Z ), :=( Y, T ), :=( Z, Y ), :=( T, X ),
% 0.72/1.10 :=( U, equivalent( equivalent( equivalent( X, Y ), Z ), equivalent(
% 0.72/1.10 equivalent( T, equivalent( Y, equivalent( X, T ) ) ), Z ) ) )] ),
% 0.72/1.10 substitution( 1, [ :=( X, Z ), :=( Y, equivalent( T, equivalent( Y,
% 0.72/1.10 equivalent( X, T ) ) ) ), :=( Z, equivalent( equivalent( X, Y ), Z ) )] )
% 0.72/1.10 ).
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 subsumption(
% 0.72/1.10 clause( 17, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ), Z
% 0.72/1.10 ), equivalent( equivalent( T, equivalent( Y, equivalent( X, T ) ) ), Z )
% 0.72/1.10 ) ) ] )
% 0.72/1.10 , clause( 1701, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.72/1.10 ), Z ), equivalent( equivalent( T, equivalent( Y, equivalent( X, T ) ) )
% 0.72/1.10 , Z ) ) ) ] )
% 0.72/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.72/1.10 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 resolution(
% 0.72/1.10 clause( 1702, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.72/1.10 equivalent( Y, Z ), equivalent( T, X ) ) ), equivalent( Z, equivalent( Y
% 0.72/1.10 , T ) ) ) ) ] )
% 0.72/1.10 , clause( 3, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent(
% 0.72/1.10 equivalent( equivalent( X, equivalent( Y, Z ) ), equivalent( Z,
% 0.72/1.10 equivalent( Y, X ) ) ), T ) ) ) ] )
% 0.72/1.10 , 1, clause( 17, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.72/1.10 ), Z ), equivalent( equivalent( T, equivalent( Y, equivalent( X, T ) ) )
% 0.72/1.10 , Z ) ) ) ] )
% 0.72/1.10 , 0, substitution( 0, [ :=( X, T ), :=( Y, Y ), :=( Z, Z ), :=( T,
% 0.72/1.10 equivalent( equivalent( X, equivalent( equivalent( Y, Z ), equivalent( T
% 0.72/1.10 , X ) ) ), equivalent( Z, equivalent( Y, T ) ) ) )] ), substitution( 1, [
% 0.72/1.10 :=( X, T ), :=( Y, equivalent( Y, Z ) ), :=( Z, equivalent( Z,
% 0.72/1.10 equivalent( Y, T ) ) ), :=( T, X )] )).
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 subsumption(
% 0.72/1.10 clause( 20, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.72/1.10 equivalent( Y, Z ), equivalent( T, X ) ) ), equivalent( Z, equivalent( Y
% 0.72/1.10 , T ) ) ) ) ] )
% 0.72/1.10 , clause( 1702, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.72/1.10 equivalent( Y, Z ), equivalent( T, X ) ) ), equivalent( Z, equivalent( Y
% 0.72/1.10 , T ) ) ) ) ] )
% 0.72/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.72/1.10 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 resolution(
% 0.72/1.10 clause( 1704, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( X,
% 0.72/1.10 equivalent( Y, Z ) ), equivalent( equivalent( Z, equivalent( Y, X ) ),
% 0.72/1.10 equivalent( equivalent( T, U ), equivalent( W, equivalent( U, equivalent(
% 0.72/1.10 T, W ) ) ) ) ) ), V0 ) ) ), 'is_a_theorem'( V0 ) ] )
% 0.72/1.10 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.72/1.10 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.72/1.10 , 2, clause( 9, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent( Y
% 0.72/1.10 , Z ) ), equivalent( equivalent( Z, equivalent( Y, X ) ), equivalent(
% 0.72/1.10 equivalent( T, U ), equivalent( W, equivalent( U, equivalent( T, W ) ) )
% 0.72/1.10 ) ) ) ) ] )
% 0.72/1.10 , 0, substitution( 0, [ :=( X, equivalent( equivalent( X, equivalent( Y, Z
% 0.72/1.10 ) ), equivalent( equivalent( Z, equivalent( Y, X ) ), equivalent(
% 0.72/1.10 equivalent( T, U ), equivalent( W, equivalent( U, equivalent( T, W ) ) )
% 0.72/1.10 ) ) ) ), :=( Y, V0 )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ), :=(
% 0.72/1.10 Z, Z ), :=( T, T ), :=( U, U ), :=( W, W )] )).
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 subsumption(
% 0.72/1.10 clause( 79, [ 'is_a_theorem'( V0 ), ~( 'is_a_theorem'( equivalent(
% 0.72/1.10 equivalent( equivalent( X, equivalent( Y, Z ) ), equivalent( equivalent(
% 0.72/1.10 Z, equivalent( Y, X ) ), equivalent( equivalent( T, U ), equivalent( W,
% 0.72/1.10 equivalent( U, equivalent( T, W ) ) ) ) ) ), V0 ) ) ) ] )
% 0.72/1.10 , clause( 1704, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( X
% 0.72/1.10 , equivalent( Y, Z ) ), equivalent( equivalent( Z, equivalent( Y, X ) ),
% 0.72/1.10 equivalent( equivalent( T, U ), equivalent( W, equivalent( U, equivalent(
% 0.72/1.10 T, W ) ) ) ) ) ), V0 ) ) ), 'is_a_theorem'( V0 ) ] )
% 0.72/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.72/1.10 , U ), :=( W, W ), :=( V0, V0 )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1
% 0.72/1.10 , 0 )] ) ).
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 resolution(
% 0.72/1.10 clause( 1705, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.72/1.10 equivalent( Z, Y ), equivalent( Z, X ) ) ) ) ] )
% 0.72/1.10 , clause( 79, [ 'is_a_theorem'( V0 ), ~( 'is_a_theorem'( equivalent(
% 0.72/1.10 equivalent( equivalent( X, equivalent( Y, Z ) ), equivalent( equivalent(
% 0.72/1.10 Z, equivalent( Y, X ) ), equivalent( equivalent( T, U ), equivalent( W,
% 0.72/1.10 equivalent( U, equivalent( T, W ) ) ) ) ) ), V0 ) ) ) ] )
% 0.72/1.10 , 1, clause( 20, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.72/1.10 equivalent( Y, Z ), equivalent( T, X ) ) ), equivalent( Z, equivalent( Y
% 0.72/1.10 , T ) ) ) ) ] )
% 0.72/1.10 , 0, substitution( 0, [ :=( X, Y ), :=( Y, X ), :=( Z, equivalent( Z, Y ) )
% 0.72/1.10 , :=( T, Z ), :=( U, X ), :=( W, Y ), :=( V0, equivalent( equivalent( X,
% 0.72/1.10 Y ), equivalent( equivalent( Z, Y ), equivalent( Z, X ) ) ) )] ),
% 0.72/1.10 substitution( 1, [ :=( X, equivalent( Y, equivalent( X, equivalent( Z, Y
% 0.72/1.10 ) ) ) ), :=( Y, equivalent( Z, Y ) ), :=( Z, equivalent( X, Y ) ), :=( T
% 0.72/1.10 , equivalent( Z, X ) )] )).
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 subsumption(
% 0.72/1.10 clause( 1648, [ 'is_a_theorem'( equivalent( equivalent( X, Y ), equivalent(
% 0.72/1.10 equivalent( Z, Y ), equivalent( Z, X ) ) ) ) ] )
% 0.72/1.10 , clause( 1705, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.72/1.10 equivalent( equivalent( Z, Y ), equivalent( Z, X ) ) ) ) ] )
% 0.72/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.72/1.10 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 resolution(
% 0.72/1.10 clause( 1706, [] )
% 0.72/1.10 , clause( 2, [ ~( 'is_a_theorem'( equivalent( equivalent( a, b ),
% 0.72/1.10 equivalent( equivalent( c, b ), equivalent( c, a ) ) ) ) ) ] )
% 0.72/1.10 , 0, clause( 1648, [ 'is_a_theorem'( equivalent( equivalent( X, Y ),
% 0.72/1.10 equivalent( equivalent( Z, Y ), equivalent( Z, X ) ) ) ) ] )
% 0.72/1.10 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, a ), :=( Y, b ), :=(
% 0.72/1.10 Z, c )] )).
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 subsumption(
% 0.72/1.10 clause( 1686, [] )
% 0.72/1.10 , clause( 1706, [] )
% 0.72/1.10 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 end.
% 0.72/1.10
% 0.72/1.10 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.72/1.10
% 0.72/1.10 Memory use:
% 0.72/1.10
% 0.72/1.10 space for terms: 38957
% 0.72/1.10 space for clauses: 172771
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 clauses generated: 2919
% 0.72/1.10 clauses kept: 1687
% 0.72/1.10 clauses selected: 258
% 0.72/1.10 clauses deleted: 17
% 0.72/1.10 clauses inuse deleted: 3
% 0.72/1.10
% 0.72/1.10 subsentry: 1525
% 0.72/1.10 literals s-matched: 1249
% 0.72/1.10 literals matched: 1249
% 0.72/1.10 full subsumption: 0
% 0.72/1.10
% 0.72/1.10 checksum: -464153421
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 Bliksem ended
%------------------------------------------------------------------------------