TSTP Solution File: GRP140-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : GRP140-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n019.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 : Sat Jul 16 07:35:32 EDT 2022
% Result : Unsatisfiable 0.74s 1.27s
% Output : Refutation 0.74s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GRP140-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.08/0.14 % Command : bliksem %s
% 0.14/0.35 % Computer : n019.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % DateTime : Mon Jun 13 10:11:54 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.74/1.27 *** allocated 10000 integers for termspace/termends
% 0.74/1.27 *** allocated 10000 integers for clauses
% 0.74/1.27 *** allocated 10000 integers for justifications
% 0.74/1.27 Bliksem 1.12
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 Automatic Strategy Selection
% 0.74/1.27
% 0.74/1.27 Clauses:
% 0.74/1.27 [
% 0.74/1.27 [ =( multiply( identity, X ), X ) ],
% 0.74/1.27 [ =( multiply( inverse( X ), X ), identity ) ],
% 0.74/1.27 [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply( Y, Z ) ) )
% 0.74/1.27 ],
% 0.74/1.27 [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y, X ) ) ]
% 0.74/1.27 ,
% 0.74/1.27 [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X ) ) ],
% 0.74/1.27 [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.74/1.27 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ],
% 0.74/1.27 [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.74/1.27 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ],
% 0.74/1.27 [ =( 'least_upper_bound'( X, X ), X ) ],
% 0.74/1.27 [ =( 'greatest_lower_bound'( X, X ), X ) ],
% 0.74/1.27 [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) ), X ) ]
% 0.74/1.27 ,
% 0.74/1.27 [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) ), X ) ]
% 0.74/1.27 ,
% 0.74/1.27 [ =( multiply( X, 'least_upper_bound'( Y, Z ) ), 'least_upper_bound'(
% 0.74/1.27 multiply( X, Y ), multiply( X, Z ) ) ) ],
% 0.74/1.27 [ =( multiply( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.74/1.27 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ],
% 0.74/1.27 [ =( multiply( 'least_upper_bound'( X, Y ), Z ), 'least_upper_bound'(
% 0.74/1.27 multiply( X, Z ), multiply( Y, Z ) ) ) ],
% 0.74/1.27 [ =( multiply( 'greatest_lower_bound'( X, Y ), Z ),
% 0.74/1.27 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ],
% 0.74/1.27 [ =( 'greatest_lower_bound'( a, c ), c ) ],
% 0.74/1.27 [ =( 'greatest_lower_bound'( b, c ), c ) ],
% 0.74/1.27 [ ~( =( 'least_upper_bound'( 'greatest_lower_bound'( a, b ), c ),
% 0.74/1.27 'greatest_lower_bound'( a, b ) ) ) ]
% 0.74/1.27 ] .
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 percentage equality = 1.000000, percentage horn = 1.000000
% 0.74/1.27 This is a pure equality problem
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 Options Used:
% 0.74/1.27
% 0.74/1.27 useres = 1
% 0.74/1.27 useparamod = 1
% 0.74/1.27 useeqrefl = 1
% 0.74/1.27 useeqfact = 1
% 0.74/1.27 usefactor = 1
% 0.74/1.27 usesimpsplitting = 0
% 0.74/1.27 usesimpdemod = 5
% 0.74/1.27 usesimpres = 3
% 0.74/1.27
% 0.74/1.27 resimpinuse = 1000
% 0.74/1.27 resimpclauses = 20000
% 0.74/1.27 substype = eqrewr
% 0.74/1.27 backwardsubs = 1
% 0.74/1.27 selectoldest = 5
% 0.74/1.27
% 0.74/1.27 litorderings [0] = split
% 0.74/1.27 litorderings [1] = extend the termordering, first sorting on arguments
% 0.74/1.27
% 0.74/1.27 termordering = kbo
% 0.74/1.27
% 0.74/1.27 litapriori = 0
% 0.74/1.27 termapriori = 1
% 0.74/1.27 litaposteriori = 0
% 0.74/1.27 termaposteriori = 0
% 0.74/1.27 demodaposteriori = 0
% 0.74/1.27 ordereqreflfact = 0
% 0.74/1.27
% 0.74/1.27 litselect = negord
% 0.74/1.27
% 0.74/1.27 maxweight = 15
% 0.74/1.27 maxdepth = 30000
% 0.74/1.27 maxlength = 115
% 0.74/1.27 maxnrvars = 195
% 0.74/1.27 excuselevel = 1
% 0.74/1.27 increasemaxweight = 1
% 0.74/1.27
% 0.74/1.27 maxselected = 10000000
% 0.74/1.27 maxnrclauses = 10000000
% 0.74/1.27
% 0.74/1.27 showgenerated = 0
% 0.74/1.27 showkept = 0
% 0.74/1.27 showselected = 0
% 0.74/1.27 showdeleted = 0
% 0.74/1.27 showresimp = 1
% 0.74/1.27 showstatus = 2000
% 0.74/1.27
% 0.74/1.27 prologoutput = 1
% 0.74/1.27 nrgoals = 5000000
% 0.74/1.27 totalproof = 1
% 0.74/1.27
% 0.74/1.27 Symbols occurring in the translation:
% 0.74/1.27
% 0.74/1.27 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.74/1.27 . [1, 2] (w:1, o:22, a:1, s:1, b:0),
% 0.74/1.27 ! [4, 1] (w:0, o:16, a:1, s:1, b:0),
% 0.74/1.27 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.74/1.27 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.74/1.27 identity [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.74/1.27 multiply [41, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.74/1.27 inverse [42, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.74/1.27 'greatest_lower_bound' [45, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.74/1.27 'least_upper_bound' [46, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.74/1.27 a [47, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.74/1.27 c [48, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.74/1.27 b [49, 0] (w:1, o:14, a:1, s:1, b:0).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 Starting Search:
% 0.74/1.27
% 0.74/1.27 Resimplifying inuse:
% 0.74/1.27 Done
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 Intermediate Status:
% 0.74/1.27 Generated: 28494
% 0.74/1.27 Kept: 2000
% 0.74/1.27 Inuse: 262
% 0.74/1.27 Deleted: 17
% 0.74/1.27 Deletedinuse: 6
% 0.74/1.27
% 0.74/1.27 Resimplifying inuse:
% 0.74/1.27 Done
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 Bliksems!, er is een bewijs:
% 0.74/1.27 % SZS status Unsatisfiable
% 0.74/1.27 % SZS output start Refutation
% 0.74/1.27
% 0.74/1.27 clause( 3, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y,
% 0.74/1.27 X ) ) ] )
% 0.74/1.27 .
% 0.74/1.27 clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X ) )
% 0.74/1.27 ] )
% 0.74/1.27 .
% 0.74/1.27 clause( 5, [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z ) )
% 0.74/1.27 , 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.74/1.27 .
% 0.74/1.27 clause( 6, [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.74/1.27 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.74/1.27 .
% 0.74/1.27 clause( 9, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) ), X
% 0.74/1.27 ) ] )
% 0.74/1.27 .
% 0.74/1.27 clause( 10, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) ),
% 0.74/1.27 X ) ] )
% 0.74/1.27 .
% 0.74/1.27 clause( 15, [ =( 'greatest_lower_bound'( a, c ), c ) ] )
% 0.74/1.27 .
% 0.74/1.27 clause( 16, [ =( 'greatest_lower_bound'( b, c ), c ) ] )
% 0.74/1.27 .
% 0.74/1.27 clause( 17, [ ~( =( 'least_upper_bound'( 'greatest_lower_bound'( a, b ), c
% 0.74/1.27 ), 'greatest_lower_bound'( a, b ) ) ) ] )
% 0.74/1.27 .
% 0.74/1.27 clause( 23, [ =( 'greatest_lower_bound'( 'least_upper_bound'( X, Y ), X ),
% 0.74/1.27 X ) ] )
% 0.74/1.27 .
% 0.74/1.27 clause( 25, [ =( 'greatest_lower_bound'( 'least_upper_bound'( Y, X ), X ),
% 0.74/1.27 X ) ] )
% 0.74/1.27 .
% 0.74/1.27 clause( 43, [ =( 'least_upper_bound'( 'least_upper_bound'( X, Y ), X ),
% 0.74/1.27 'least_upper_bound'( X, Y ) ) ] )
% 0.74/1.27 .
% 0.74/1.27 clause( 45, [ =( 'least_upper_bound'( 'greatest_lower_bound'( X, Y ), X ),
% 0.74/1.27 X ) ] )
% 0.74/1.27 .
% 0.74/1.27 clause( 47, [ =( 'least_upper_bound'( b, c ), b ) ] )
% 0.74/1.27 .
% 0.74/1.27 clause( 49, [ =( 'least_upper_bound'( c, b ), b ) ] )
% 0.74/1.27 .
% 0.74/1.27 clause( 60, [ =( 'least_upper_bound'( 'least_upper_bound'( X, c ), b ),
% 0.74/1.27 'least_upper_bound'( X, b ) ) ] )
% 0.74/1.27 .
% 0.74/1.27 clause( 91, [ =( 'least_upper_bound'( 'greatest_lower_bound'( c, X ), b ),
% 0.74/1.27 b ) ] )
% 0.74/1.27 .
% 0.74/1.27 clause( 97, [ =( 'least_upper_bound'( b, 'greatest_lower_bound'( c, X ) ),
% 0.74/1.27 b ) ] )
% 0.74/1.27 .
% 0.74/1.27 clause( 113, [ =( 'least_upper_bound'( b, 'greatest_lower_bound'( X, c ) )
% 0.74/1.27 , b ) ] )
% 0.74/1.27 .
% 0.74/1.27 clause( 115, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( b, X ), c
% 0.74/1.27 ), 'greatest_lower_bound'( X, c ) ) ] )
% 0.74/1.27 .
% 0.74/1.27 clause( 117, [ =( 'least_upper_bound'( 'greatest_lower_bound'( X, c ),
% 0.74/1.27 'greatest_lower_bound'( b, X ) ), 'greatest_lower_bound'( b, X ) ) ] )
% 0.74/1.27 .
% 0.74/1.27 clause( 141, [ ~( =( 'least_upper_bound'( 'greatest_lower_bound'( b, a ), c
% 0.74/1.27 ), 'greatest_lower_bound'( b, a ) ) ) ] )
% 0.74/1.27 .
% 0.74/1.27 clause( 231, [ ~( =( 'least_upper_bound'( c, 'greatest_lower_bound'( b, a )
% 0.74/1.27 ), 'greatest_lower_bound'( b, a ) ) ) ] )
% 0.74/1.27 .
% 0.74/1.27 clause( 2573, [] )
% 0.74/1.27 .
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 % SZS output end Refutation
% 0.74/1.27 found a proof!
% 0.74/1.27
% 0.74/1.27 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.74/1.27
% 0.74/1.27 initialclauses(
% 0.74/1.27 [ clause( 2575, [ =( multiply( identity, X ), X ) ] )
% 0.74/1.27 , clause( 2576, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.74/1.27 , clause( 2577, [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply(
% 0.74/1.27 Y, Z ) ) ) ] )
% 0.74/1.27 , clause( 2578, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'(
% 0.74/1.27 Y, X ) ) ] )
% 0.74/1.27 , clause( 2579, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X
% 0.74/1.27 ) ) ] )
% 0.74/1.27 , clause( 2580, [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y,
% 0.74/1.27 Z ) ), 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.74/1.27 , clause( 2581, [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) )
% 0.74/1.27 , 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.74/1.27 , clause( 2582, [ =( 'least_upper_bound'( X, X ), X ) ] )
% 0.74/1.27 , clause( 2583, [ =( 'greatest_lower_bound'( X, X ), X ) ] )
% 0.74/1.27 , clause( 2584, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y )
% 0.74/1.27 ), X ) ] )
% 0.74/1.27 , clause( 2585, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y )
% 0.74/1.27 ), X ) ] )
% 0.74/1.27 , clause( 2586, [ =( multiply( X, 'least_upper_bound'( Y, Z ) ),
% 0.74/1.27 'least_upper_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ] )
% 0.74/1.27 , clause( 2587, [ =( multiply( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.74/1.27 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ] )
% 0.74/1.27 , clause( 2588, [ =( multiply( 'least_upper_bound'( X, Y ), Z ),
% 0.74/1.27 'least_upper_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ] )
% 0.74/1.27 , clause( 2589, [ =( multiply( 'greatest_lower_bound'( X, Y ), Z ),
% 0.74/1.27 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ] )
% 0.74/1.27 , clause( 2590, [ =( 'greatest_lower_bound'( a, c ), c ) ] )
% 0.74/1.27 , clause( 2591, [ =( 'greatest_lower_bound'( b, c ), c ) ] )
% 0.74/1.27 , clause( 2592, [ ~( =( 'least_upper_bound'( 'greatest_lower_bound'( a, b )
% 0.74/1.27 , c ), 'greatest_lower_bound'( a, b ) ) ) ] )
% 0.74/1.27 ] ).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 subsumption(
% 0.74/1.27 clause( 3, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y,
% 0.74/1.27 X ) ) ] )
% 0.74/1.27 , clause( 2578, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'(
% 0.74/1.27 Y, X ) ) ] )
% 0.74/1.27 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.74/1.27 )] ) ).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 subsumption(
% 0.74/1.27 clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X ) )
% 0.74/1.27 ] )
% 0.74/1.27 , clause( 2579, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X
% 0.74/1.27 ) ) ] )
% 0.74/1.27 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.74/1.27 )] ) ).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 subsumption(
% 0.74/1.27 clause( 5, [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z ) )
% 0.74/1.27 , 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.74/1.27 , clause( 2580, [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y,
% 0.74/1.27 Z ) ), 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.74/1.27 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.74/1.27 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 subsumption(
% 0.74/1.27 clause( 6, [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.74/1.27 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.74/1.27 , clause( 2581, [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) )
% 0.74/1.27 , 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.74/1.27 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.74/1.27 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 subsumption(
% 0.74/1.27 clause( 9, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) ), X
% 0.74/1.27 ) ] )
% 0.74/1.27 , clause( 2584, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y )
% 0.74/1.27 ), X ) ] )
% 0.74/1.27 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.74/1.27 )] ) ).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 subsumption(
% 0.74/1.27 clause( 10, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) ),
% 0.74/1.27 X ) ] )
% 0.74/1.27 , clause( 2585, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y )
% 0.74/1.27 ), X ) ] )
% 0.74/1.27 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.74/1.27 )] ) ).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 subsumption(
% 0.74/1.27 clause( 15, [ =( 'greatest_lower_bound'( a, c ), c ) ] )
% 0.74/1.27 , clause( 2590, [ =( 'greatest_lower_bound'( a, c ), c ) ] )
% 0.74/1.27 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 subsumption(
% 0.74/1.27 clause( 16, [ =( 'greatest_lower_bound'( b, c ), c ) ] )
% 0.74/1.27 , clause( 2591, [ =( 'greatest_lower_bound'( b, c ), c ) ] )
% 0.74/1.27 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 subsumption(
% 0.74/1.27 clause( 17, [ ~( =( 'least_upper_bound'( 'greatest_lower_bound'( a, b ), c
% 0.74/1.27 ), 'greatest_lower_bound'( a, b ) ) ) ] )
% 0.74/1.27 , clause( 2592, [ ~( =( 'least_upper_bound'( 'greatest_lower_bound'( a, b )
% 0.74/1.27 , c ), 'greatest_lower_bound'( a, b ) ) ) ] )
% 0.74/1.27 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 eqswap(
% 0.74/1.27 clause( 2670, [ =( X, 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y
% 0.74/1.27 ) ) ) ] )
% 0.74/1.27 , clause( 10, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) )
% 0.74/1.27 , X ) ] )
% 0.74/1.27 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 paramod(
% 0.74/1.27 clause( 2671, [ =( X, 'greatest_lower_bound'( 'least_upper_bound'( X, Y ),
% 0.74/1.27 X ) ) ] )
% 0.74/1.27 , clause( 3, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y
% 0.74/1.27 , X ) ) ] )
% 0.74/1.27 , 0, clause( 2670, [ =( X, 'greatest_lower_bound'( X, 'least_upper_bound'(
% 0.74/1.27 X, Y ) ) ) ] )
% 0.74/1.27 , 0, 2, substitution( 0, [ :=( X, X ), :=( Y, 'least_upper_bound'( X, Y ) )] )
% 0.74/1.27 , substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 eqswap(
% 0.74/1.27 clause( 2674, [ =( 'greatest_lower_bound'( 'least_upper_bound'( X, Y ), X )
% 0.74/1.27 , X ) ] )
% 0.74/1.27 , clause( 2671, [ =( X, 'greatest_lower_bound'( 'least_upper_bound'( X, Y )
% 0.74/1.27 , X ) ) ] )
% 0.74/1.27 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 subsumption(
% 0.74/1.27 clause( 23, [ =( 'greatest_lower_bound'( 'least_upper_bound'( X, Y ), X ),
% 0.74/1.27 X ) ] )
% 0.74/1.27 , clause( 2674, [ =( 'greatest_lower_bound'( 'least_upper_bound'( X, Y ), X
% 0.74/1.27 ), X ) ] )
% 0.74/1.27 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.74/1.27 )] ) ).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 eqswap(
% 0.74/1.27 clause( 2675, [ =( X, 'greatest_lower_bound'( 'least_upper_bound'( X, Y ),
% 0.74/1.27 X ) ) ] )
% 0.74/1.27 , clause( 23, [ =( 'greatest_lower_bound'( 'least_upper_bound'( X, Y ), X )
% 0.74/1.27 , X ) ] )
% 0.74/1.27 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 paramod(
% 0.74/1.27 clause( 2676, [ =( X, 'greatest_lower_bound'( 'least_upper_bound'( Y, X ),
% 0.74/1.27 X ) ) ] )
% 0.74/1.27 , clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X )
% 0.74/1.27 ) ] )
% 0.74/1.27 , 0, clause( 2675, [ =( X, 'greatest_lower_bound'( 'least_upper_bound'( X,
% 0.74/1.27 Y ), X ) ) ] )
% 0.74/1.27 , 0, 3, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [
% 0.74/1.27 :=( X, X ), :=( Y, Y )] )).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 eqswap(
% 0.74/1.27 clause( 2679, [ =( 'greatest_lower_bound'( 'least_upper_bound'( Y, X ), X )
% 0.74/1.27 , X ) ] )
% 0.74/1.27 , clause( 2676, [ =( X, 'greatest_lower_bound'( 'least_upper_bound'( Y, X )
% 0.74/1.27 , X ) ) ] )
% 0.74/1.27 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 subsumption(
% 0.74/1.27 clause( 25, [ =( 'greatest_lower_bound'( 'least_upper_bound'( Y, X ), X ),
% 0.74/1.27 X ) ] )
% 0.74/1.27 , clause( 2679, [ =( 'greatest_lower_bound'( 'least_upper_bound'( Y, X ), X
% 0.74/1.27 ), X ) ] )
% 0.74/1.27 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.74/1.27 )] ) ).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 eqswap(
% 0.74/1.27 clause( 2681, [ =( X, 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y
% 0.74/1.27 ) ) ) ] )
% 0.74/1.27 , clause( 9, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) )
% 0.74/1.27 , X ) ] )
% 0.74/1.27 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 paramod(
% 0.74/1.27 clause( 2684, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'(
% 0.74/1.27 'least_upper_bound'( X, Y ), X ) ) ] )
% 0.74/1.27 , clause( 23, [ =( 'greatest_lower_bound'( 'least_upper_bound'( X, Y ), X )
% 0.74/1.27 , X ) ] )
% 0.74/1.27 , 0, clause( 2681, [ =( X, 'least_upper_bound'( X, 'greatest_lower_bound'(
% 0.74/1.27 X, Y ) ) ) ] )
% 0.74/1.27 , 0, 8, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [
% 0.74/1.27 :=( X, 'least_upper_bound'( X, Y ) ), :=( Y, X )] )).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 eqswap(
% 0.74/1.27 clause( 2685, [ =( 'least_upper_bound'( 'least_upper_bound'( X, Y ), X ),
% 0.74/1.27 'least_upper_bound'( X, Y ) ) ] )
% 0.74/1.27 , clause( 2684, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'(
% 0.74/1.27 'least_upper_bound'( X, Y ), X ) ) ] )
% 0.74/1.27 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 subsumption(
% 0.74/1.27 clause( 43, [ =( 'least_upper_bound'( 'least_upper_bound'( X, Y ), X ),
% 0.74/1.27 'least_upper_bound'( X, Y ) ) ] )
% 0.74/1.27 , clause( 2685, [ =( 'least_upper_bound'( 'least_upper_bound'( X, Y ), X )
% 0.74/1.27 , 'least_upper_bound'( X, Y ) ) ] )
% 0.74/1.27 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.74/1.27 )] ) ).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 eqswap(
% 0.74/1.27 clause( 2686, [ =( X, 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y
% 0.74/1.27 ) ) ) ] )
% 0.74/1.27 , clause( 9, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) )
% 0.74/1.27 , X ) ] )
% 0.74/1.27 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 paramod(
% 0.74/1.27 clause( 2687, [ =( X, 'least_upper_bound'( 'greatest_lower_bound'( X, Y ),
% 0.74/1.27 X ) ) ] )
% 0.74/1.27 , clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X )
% 0.74/1.27 ) ] )
% 0.74/1.27 , 0, clause( 2686, [ =( X, 'least_upper_bound'( X, 'greatest_lower_bound'(
% 0.74/1.27 X, Y ) ) ) ] )
% 0.74/1.27 , 0, 2, substitution( 0, [ :=( X, X ), :=( Y, 'greatest_lower_bound'( X, Y
% 0.74/1.27 ) )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 eqswap(
% 0.74/1.27 clause( 2690, [ =( 'least_upper_bound'( 'greatest_lower_bound'( X, Y ), X )
% 0.74/1.27 , X ) ] )
% 0.74/1.27 , clause( 2687, [ =( X, 'least_upper_bound'( 'greatest_lower_bound'( X, Y )
% 0.74/1.27 , X ) ) ] )
% 0.74/1.27 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 subsumption(
% 0.74/1.27 clause( 45, [ =( 'least_upper_bound'( 'greatest_lower_bound'( X, Y ), X ),
% 0.74/1.27 X ) ] )
% 0.74/1.27 , clause( 2690, [ =( 'least_upper_bound'( 'greatest_lower_bound'( X, Y ), X
% 0.74/1.27 ), X ) ] )
% 0.74/1.27 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.74/1.27 )] ) ).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 eqswap(
% 0.74/1.27 clause( 2692, [ =( X, 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y
% 0.74/1.27 ) ) ) ] )
% 0.74/1.27 , clause( 9, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) )
% 0.74/1.27 , X ) ] )
% 0.74/1.27 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 paramod(
% 0.74/1.27 clause( 2693, [ =( b, 'least_upper_bound'( b, c ) ) ] )
% 0.74/1.27 , clause( 16, [ =( 'greatest_lower_bound'( b, c ), c ) ] )
% 0.74/1.27 , 0, clause( 2692, [ =( X, 'least_upper_bound'( X, 'greatest_lower_bound'(
% 0.74/1.27 X, Y ) ) ) ] )
% 0.74/1.27 , 0, 4, substitution( 0, [] ), substitution( 1, [ :=( X, b ), :=( Y, c )] )
% 0.74/1.27 ).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 eqswap(
% 0.74/1.27 clause( 2694, [ =( 'least_upper_bound'( b, c ), b ) ] )
% 0.74/1.27 , clause( 2693, [ =( b, 'least_upper_bound'( b, c ) ) ] )
% 0.74/1.27 , 0, substitution( 0, [] )).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 subsumption(
% 0.74/1.27 clause( 47, [ =( 'least_upper_bound'( b, c ), b ) ] )
% 0.74/1.27 , clause( 2694, [ =( 'least_upper_bound'( b, c ), b ) ] )
% 0.74/1.27 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 eqswap(
% 0.74/1.27 clause( 2695, [ =( b, 'least_upper_bound'( b, c ) ) ] )
% 0.74/1.27 , clause( 47, [ =( 'least_upper_bound'( b, c ), b ) ] )
% 0.74/1.27 , 0, substitution( 0, [] )).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 paramod(
% 0.74/1.27 clause( 2696, [ =( b, 'least_upper_bound'( c, b ) ) ] )
% 0.74/1.27 , clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X )
% 0.74/1.27 ) ] )
% 0.74/1.27 , 0, clause( 2695, [ =( b, 'least_upper_bound'( b, c ) ) ] )
% 0.74/1.27 , 0, 2, substitution( 0, [ :=( X, b ), :=( Y, c )] ), substitution( 1, [] )
% 0.74/1.27 ).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 eqswap(
% 0.74/1.27 clause( 2699, [ =( 'least_upper_bound'( c, b ), b ) ] )
% 0.74/1.27 , clause( 2696, [ =( b, 'least_upper_bound'( c, b ) ) ] )
% 0.74/1.27 , 0, substitution( 0, [] )).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 subsumption(
% 0.74/1.27 clause( 49, [ =( 'least_upper_bound'( c, b ), b ) ] )
% 0.74/1.27 , clause( 2699, [ =( 'least_upper_bound'( c, b ), b ) ] )
% 0.74/1.27 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 eqswap(
% 0.74/1.27 clause( 2701, [ =( 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ),
% 0.74/1.27 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ) ) ] )
% 0.74/1.27 , clause( 6, [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.74/1.27 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.74/1.27 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 paramod(
% 0.74/1.27 clause( 2703, [ =( 'least_upper_bound'( 'least_upper_bound'( X, c ), b ),
% 0.74/1.27 'least_upper_bound'( X, b ) ) ] )
% 0.74/1.27 , clause( 49, [ =( 'least_upper_bound'( c, b ), b ) ] )
% 0.74/1.27 , 0, clause( 2701, [ =( 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z
% 0.74/1.27 ), 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ) ) ] )
% 0.74/1.27 , 0, 8, substitution( 0, [] ), substitution( 1, [ :=( X, X ), :=( Y, c ),
% 0.74/1.27 :=( Z, b )] )).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 subsumption(
% 0.74/1.27 clause( 60, [ =( 'least_upper_bound'( 'least_upper_bound'( X, c ), b ),
% 0.74/1.27 'least_upper_bound'( X, b ) ) ] )
% 0.74/1.27 , clause( 2703, [ =( 'least_upper_bound'( 'least_upper_bound'( X, c ), b )
% 0.74/1.27 , 'least_upper_bound'( X, b ) ) ] )
% 0.74/1.27 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 eqswap(
% 0.74/1.27 clause( 2707, [ =( 'least_upper_bound'( X, b ), 'least_upper_bound'(
% 0.74/1.27 'least_upper_bound'( X, c ), b ) ) ] )
% 0.74/1.27 , clause( 60, [ =( 'least_upper_bound'( 'least_upper_bound'( X, c ), b ),
% 0.74/1.27 'least_upper_bound'( X, b ) ) ] )
% 0.74/1.27 , 0, substitution( 0, [ :=( X, X )] )).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 paramod(
% 0.74/1.27 clause( 2710, [ =( 'least_upper_bound'( 'greatest_lower_bound'( c, X ), b )
% 0.74/1.27 , 'least_upper_bound'( c, b ) ) ] )
% 0.74/1.27 , clause( 45, [ =( 'least_upper_bound'( 'greatest_lower_bound'( X, Y ), X )
% 0.74/1.27 , X ) ] )
% 0.74/1.27 , 0, clause( 2707, [ =( 'least_upper_bound'( X, b ), 'least_upper_bound'(
% 0.74/1.27 'least_upper_bound'( X, c ), b ) ) ] )
% 0.74/1.27 , 0, 7, substitution( 0, [ :=( X, c ), :=( Y, X )] ), substitution( 1, [
% 0.74/1.27 :=( X, 'greatest_lower_bound'( c, X ) )] )).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 paramod(
% 0.74/1.27 clause( 2711, [ =( 'least_upper_bound'( 'greatest_lower_bound'( c, X ), b )
% 0.74/1.27 , b ) ] )
% 0.74/1.27 , clause( 49, [ =( 'least_upper_bound'( c, b ), b ) ] )
% 0.74/1.27 , 0, clause( 2710, [ =( 'least_upper_bound'( 'greatest_lower_bound'( c, X )
% 0.74/1.27 , b ), 'least_upper_bound'( c, b ) ) ] )
% 0.74/1.27 , 0, 6, substitution( 0, [] ), substitution( 1, [ :=( X, X )] )).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 subsumption(
% 0.74/1.27 clause( 91, [ =( 'least_upper_bound'( 'greatest_lower_bound'( c, X ), b ),
% 0.74/1.27 b ) ] )
% 0.74/1.27 , clause( 2711, [ =( 'least_upper_bound'( 'greatest_lower_bound'( c, X ), b
% 0.74/1.27 ), b ) ] )
% 0.74/1.27 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 eqswap(
% 0.74/1.27 clause( 2714, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'(
% 0.74/1.27 'least_upper_bound'( X, Y ), X ) ) ] )
% 0.74/1.27 , clause( 43, [ =( 'least_upper_bound'( 'least_upper_bound'( X, Y ), X ),
% 0.74/1.27 'least_upper_bound'( X, Y ) ) ] )
% 0.74/1.27 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 paramod(
% 0.74/1.27 clause( 2716, [ =( 'least_upper_bound'( 'greatest_lower_bound'( c, X ), b )
% 0.74/1.27 , 'least_upper_bound'( b, 'greatest_lower_bound'( c, X ) ) ) ] )
% 0.74/1.27 , clause( 91, [ =( 'least_upper_bound'( 'greatest_lower_bound'( c, X ), b )
% 0.74/1.27 , b ) ] )
% 0.74/1.27 , 0, clause( 2714, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'(
% 0.74/1.27 'least_upper_bound'( X, Y ), X ) ) ] )
% 0.74/1.27 , 0, 7, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X,
% 0.74/1.27 'greatest_lower_bound'( c, X ) ), :=( Y, b )] )).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 paramod(
% 0.74/1.27 clause( 2717, [ =( b, 'least_upper_bound'( b, 'greatest_lower_bound'( c, X
% 0.74/1.27 ) ) ) ] )
% 0.74/1.27 , clause( 91, [ =( 'least_upper_bound'( 'greatest_lower_bound'( c, X ), b )
% 0.74/1.27 , b ) ] )
% 0.74/1.27 , 0, clause( 2716, [ =( 'least_upper_bound'( 'greatest_lower_bound'( c, X )
% 0.74/1.27 , b ), 'least_upper_bound'( b, 'greatest_lower_bound'( c, X ) ) ) ] )
% 0.74/1.27 , 0, 1, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X )] )
% 0.74/1.27 ).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 eqswap(
% 0.74/1.27 clause( 2719, [ =( 'least_upper_bound'( b, 'greatest_lower_bound'( c, X ) )
% 0.74/1.27 , b ) ] )
% 0.74/1.27 , clause( 2717, [ =( b, 'least_upper_bound'( b, 'greatest_lower_bound'( c,
% 0.74/1.27 X ) ) ) ] )
% 0.74/1.27 , 0, substitution( 0, [ :=( X, X )] )).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 subsumption(
% 0.74/1.27 clause( 97, [ =( 'least_upper_bound'( b, 'greatest_lower_bound'( c, X ) ),
% 0.74/1.27 b ) ] )
% 0.74/1.27 , clause( 2719, [ =( 'least_upper_bound'( b, 'greatest_lower_bound'( c, X )
% 0.74/1.27 ), b ) ] )
% 0.74/1.27 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 eqswap(
% 0.74/1.27 clause( 2721, [ =( b, 'least_upper_bound'( b, 'greatest_lower_bound'( c, X
% 0.74/1.27 ) ) ) ] )
% 0.74/1.27 , clause( 97, [ =( 'least_upper_bound'( b, 'greatest_lower_bound'( c, X ) )
% 0.74/1.27 , b ) ] )
% 0.74/1.27 , 0, substitution( 0, [ :=( X, X )] )).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 paramod(
% 0.74/1.27 clause( 2722, [ =( b, 'least_upper_bound'( b, 'greatest_lower_bound'( X, c
% 0.74/1.27 ) ) ) ] )
% 0.74/1.27 , clause( 3, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y
% 0.74/1.27 , X ) ) ] )
% 0.74/1.27 , 0, clause( 2721, [ =( b, 'least_upper_bound'( b, 'greatest_lower_bound'(
% 0.74/1.27 c, X ) ) ) ] )
% 0.74/1.27 , 0, 4, substitution( 0, [ :=( X, c ), :=( Y, X )] ), substitution( 1, [
% 0.74/1.27 :=( X, X )] )).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 eqswap(
% 0.74/1.27 clause( 2725, [ =( 'least_upper_bound'( b, 'greatest_lower_bound'( X, c ) )
% 0.74/1.27 , b ) ] )
% 0.74/1.27 , clause( 2722, [ =( b, 'least_upper_bound'( b, 'greatest_lower_bound'( X,
% 0.74/1.27 c ) ) ) ] )
% 0.74/1.27 , 0, substitution( 0, [ :=( X, X )] )).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 subsumption(
% 0.74/1.27 clause( 113, [ =( 'least_upper_bound'( b, 'greatest_lower_bound'( X, c ) )
% 0.74/1.27 , b ) ] )
% 0.74/1.27 , clause( 2725, [ =( 'least_upper_bound'( b, 'greatest_lower_bound'( X, c )
% 0.74/1.27 ), b ) ] )
% 0.74/1.27 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 eqswap(
% 0.74/1.27 clause( 2727, [ =( Y, 'greatest_lower_bound'( 'least_upper_bound'( X, Y ),
% 0.74/1.27 Y ) ) ] )
% 0.74/1.27 , clause( 25, [ =( 'greatest_lower_bound'( 'least_upper_bound'( Y, X ), X )
% 0.74/1.27 , X ) ] )
% 0.74/1.27 , 0, substitution( 0, [ :=( X, Y ), :=( Y, X )] )).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 paramod(
% 0.74/1.27 clause( 2730, [ =( 'greatest_lower_bound'( X, c ), 'greatest_lower_bound'(
% 0.74/1.27 b, 'greatest_lower_bound'( X, c ) ) ) ] )
% 0.74/1.27 , clause( 113, [ =( 'least_upper_bound'( b, 'greatest_lower_bound'( X, c )
% 0.74/1.27 ), b ) ] )
% 0.74/1.27 , 0, clause( 2727, [ =( Y, 'greatest_lower_bound'( 'least_upper_bound'( X,
% 0.74/1.27 Y ), Y ) ) ] )
% 0.74/1.27 , 0, 5, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, b ),
% 0.74/1.27 :=( Y, 'greatest_lower_bound'( X, c ) )] )).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 paramod(
% 0.74/1.27 clause( 2731, [ =( 'greatest_lower_bound'( X, c ), 'greatest_lower_bound'(
% 0.74/1.27 'greatest_lower_bound'( b, X ), c ) ) ] )
% 0.74/1.27 , clause( 5, [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z )
% 0.74/1.27 ), 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.74/1.27 , 0, clause( 2730, [ =( 'greatest_lower_bound'( X, c ),
% 0.74/1.27 'greatest_lower_bound'( b, 'greatest_lower_bound'( X, c ) ) ) ] )
% 0.74/1.27 , 0, 4, substitution( 0, [ :=( X, b ), :=( Y, X ), :=( Z, c )] ),
% 0.74/1.27 substitution( 1, [ :=( X, X )] )).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 eqswap(
% 0.74/1.27 clause( 2732, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( b, X ),
% 0.74/1.27 c ), 'greatest_lower_bound'( X, c ) ) ] )
% 0.74/1.27 , clause( 2731, [ =( 'greatest_lower_bound'( X, c ), 'greatest_lower_bound'(
% 0.74/1.27 'greatest_lower_bound'( b, X ), c ) ) ] )
% 0.74/1.27 , 0, substitution( 0, [ :=( X, X )] )).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 subsumption(
% 0.74/1.27 clause( 115, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( b, X ), c
% 0.74/1.27 ), 'greatest_lower_bound'( X, c ) ) ] )
% 0.74/1.27 , clause( 2732, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( b, X )
% 0.74/1.27 , c ), 'greatest_lower_bound'( X, c ) ) ] )
% 0.74/1.27 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 eqswap(
% 0.74/1.27 clause( 2734, [ =( X, 'least_upper_bound'( 'greatest_lower_bound'( X, Y ),
% 0.74/1.27 X ) ) ] )
% 0.74/1.27 , clause( 45, [ =( 'least_upper_bound'( 'greatest_lower_bound'( X, Y ), X )
% 0.74/1.27 , X ) ] )
% 0.74/1.27 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 paramod(
% 0.74/1.27 clause( 2735, [ =( 'greatest_lower_bound'( b, X ), 'least_upper_bound'(
% 0.74/1.27 'greatest_lower_bound'( X, c ), 'greatest_lower_bound'( b, X ) ) ) ] )
% 0.74/1.27 , clause( 115, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( b, X )
% 0.74/1.27 , c ), 'greatest_lower_bound'( X, c ) ) ] )
% 0.74/1.27 , 0, clause( 2734, [ =( X, 'least_upper_bound'( 'greatest_lower_bound'( X,
% 0.74/1.27 Y ), X ) ) ] )
% 0.74/1.27 , 0, 5, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X,
% 0.74/1.27 'greatest_lower_bound'( b, X ) ), :=( Y, c )] )).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 eqswap(
% 0.74/1.27 clause( 2736, [ =( 'least_upper_bound'( 'greatest_lower_bound'( X, c ),
% 0.74/1.27 'greatest_lower_bound'( b, X ) ), 'greatest_lower_bound'( b, X ) ) ] )
% 0.74/1.27 , clause( 2735, [ =( 'greatest_lower_bound'( b, X ), 'least_upper_bound'(
% 0.74/1.27 'greatest_lower_bound'( X, c ), 'greatest_lower_bound'( b, X ) ) ) ] )
% 0.74/1.27 , 0, substitution( 0, [ :=( X, X )] )).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 subsumption(
% 0.74/1.27 clause( 117, [ =( 'least_upper_bound'( 'greatest_lower_bound'( X, c ),
% 0.74/1.27 'greatest_lower_bound'( b, X ) ), 'greatest_lower_bound'( b, X ) ) ] )
% 0.74/1.27 , clause( 2736, [ =( 'least_upper_bound'( 'greatest_lower_bound'( X, c ),
% 0.74/1.27 'greatest_lower_bound'( b, X ) ), 'greatest_lower_bound'( b, X ) ) ] )
% 0.74/1.27 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.27
% 0.74/1.27
% 0.74/1.27 eqswap(
% 0.74/1.27 clause( 2737, [ ~( =( 'greatest_lower_bound'( a, b ), 'least_upper_bound'(
% 0.74/1.27 'greatest_lower_bound'( a, b ), c ) ) ) ] )
% 0.74/1.27 , clause( 17, [ ~( =( 'least_upper_bound'( 'greatest_lower_bound'( a, b ),
% 0.74/1.27 c ), 'greatest_lower_bound'( a, b ) ) ) ] )
% 0.74/1.27 , 0, substitution( 0, [] )).
% 0.74/1.28
% 0.74/1.28
% 0.74/1.28 paramod(
% 0.74/1.28 clause( 2739, [ ~( =( 'greatest_lower_bound'( a, b ), 'least_upper_bound'(
% 0.74/1.28 'greatest_lower_bound'( b, a ), c ) ) ) ] )
% 0.74/1.28 , clause( 3, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y
% 0.74/1.28 , X ) ) ] )
% 0.74/1.28 , 0, clause( 2737, [ ~( =( 'greatest_lower_bound'( a, b ),
% 0.74/1.28 'least_upper_bound'( 'greatest_lower_bound'( a, b ), c ) ) ) ] )
% 0.74/1.28 , 0, 6, substitution( 0, [ :=( X, a ), :=( Y, b )] ), substitution( 1, [] )
% 0.74/1.28 ).
% 0.74/1.28
% 0.74/1.28
% 0.74/1.28 paramod(
% 0.74/1.28 clause( 2740, [ ~( =( 'greatest_lower_bound'( b, a ), 'least_upper_bound'(
% 0.74/1.28 'greatest_lower_bound'( b, a ), c ) ) ) ] )
% 0.74/1.28 , clause( 3, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y
% 0.74/1.28 , X ) ) ] )
% 0.74/1.28 , 0, clause( 2739, [ ~( =( 'greatest_lower_bound'( a, b ),
% 0.74/1.28 'least_upper_bound'( 'greatest_lower_bound'( b, a ), c ) ) ) ] )
% 0.74/1.28 , 0, 2, substitution( 0, [ :=( X, a ), :=( Y, b )] ), substitution( 1, [] )
% 0.74/1.28 ).
% 0.74/1.28
% 0.74/1.28
% 0.74/1.28 eqswap(
% 0.74/1.28 clause( 2743, [ ~( =( 'least_upper_bound'( 'greatest_lower_bound'( b, a ),
% 0.74/1.28 c ), 'greatest_lower_bound'( b, a ) ) ) ] )
% 0.74/1.28 , clause( 2740, [ ~( =( 'greatest_lower_bound'( b, a ), 'least_upper_bound'(
% 0.74/1.28 'greatest_lower_bound'( b, a ), c ) ) ) ] )
% 0.74/1.28 , 0, substitution( 0, [] )).
% 0.74/1.28
% 0.74/1.28
% 0.74/1.28 subsumption(
% 0.74/1.28 clause( 141, [ ~( =( 'least_upper_bound'( 'greatest_lower_bound'( b, a ), c
% 0.74/1.28 ), 'greatest_lower_bound'( b, a ) ) ) ] )
% 0.74/1.28 , clause( 2743, [ ~( =( 'least_upper_bound'( 'greatest_lower_bound'( b, a )
% 0.74/1.28 , c ), 'greatest_lower_bound'( b, a ) ) ) ] )
% 0.74/1.28 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.28
% 0.74/1.28
% 0.74/1.28 eqswap(
% 0.74/1.28 clause( 2746, [ ~( =( 'greatest_lower_bound'( b, a ), 'least_upper_bound'(
% 0.74/1.28 'greatest_lower_bound'( b, a ), c ) ) ) ] )
% 0.74/1.28 , clause( 141, [ ~( =( 'least_upper_bound'( 'greatest_lower_bound'( b, a )
% 0.74/1.28 , c ), 'greatest_lower_bound'( b, a ) ) ) ] )
% 0.74/1.28 , 0, substitution( 0, [] )).
% 0.74/1.28
% 0.74/1.28
% 0.74/1.28 paramod(
% 0.74/1.28 clause( 2747, [ ~( =( 'greatest_lower_bound'( b, a ), 'least_upper_bound'(
% 0.74/1.28 c, 'greatest_lower_bound'( b, a ) ) ) ) ] )
% 0.74/1.28 , clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X )
% 0.74/1.28 ) ] )
% 0.74/1.28 , 0, clause( 2746, [ ~( =( 'greatest_lower_bound'( b, a ),
% 0.74/1.28 'least_upper_bound'( 'greatest_lower_bound'( b, a ), c ) ) ) ] )
% 0.74/1.28 , 0, 5, substitution( 0, [ :=( X, 'greatest_lower_bound'( b, a ) ), :=( Y,
% 0.74/1.28 c )] ), substitution( 1, [] )).
% 0.74/1.28
% 0.74/1.28
% 0.74/1.28 eqswap(
% 0.74/1.28 clause( 2750, [ ~( =( 'least_upper_bound'( c, 'greatest_lower_bound'( b, a
% 0.74/1.28 ) ), 'greatest_lower_bound'( b, a ) ) ) ] )
% 0.74/1.28 , clause( 2747, [ ~( =( 'greatest_lower_bound'( b, a ), 'least_upper_bound'(
% 0.74/1.28 c, 'greatest_lower_bound'( b, a ) ) ) ) ] )
% 0.74/1.28 , 0, substitution( 0, [] )).
% 0.74/1.28
% 0.74/1.28
% 0.74/1.28 subsumption(
% 0.74/1.28 clause( 231, [ ~( =( 'least_upper_bound'( c, 'greatest_lower_bound'( b, a )
% 0.74/1.28 ), 'greatest_lower_bound'( b, a ) ) ) ] )
% 0.74/1.28 , clause( 2750, [ ~( =( 'least_upper_bound'( c, 'greatest_lower_bound'( b,
% 0.74/1.28 a ) ), 'greatest_lower_bound'( b, a ) ) ) ] )
% 0.74/1.28 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.28
% 0.74/1.28
% 0.74/1.28 eqswap(
% 0.74/1.28 clause( 2752, [ =( 'greatest_lower_bound'( b, X ), 'least_upper_bound'(
% 0.74/1.28 'greatest_lower_bound'( X, c ), 'greatest_lower_bound'( b, X ) ) ) ] )
% 0.74/1.28 , clause( 117, [ =( 'least_upper_bound'( 'greatest_lower_bound'( X, c ),
% 0.74/1.28 'greatest_lower_bound'( b, X ) ), 'greatest_lower_bound'( b, X ) ) ] )
% 0.74/1.28 , 0, substitution( 0, [ :=( X, X )] )).
% 0.74/1.28
% 0.74/1.28
% 0.74/1.28 eqswap(
% 0.74/1.28 clause( 2753, [ ~( =( 'greatest_lower_bound'( b, a ), 'least_upper_bound'(
% 0.74/1.28 c, 'greatest_lower_bound'( b, a ) ) ) ) ] )
% 0.74/1.28 , clause( 231, [ ~( =( 'least_upper_bound'( c, 'greatest_lower_bound'( b, a
% 0.74/1.28 ) ), 'greatest_lower_bound'( b, a ) ) ) ] )
% 0.74/1.28 , 0, substitution( 0, [] )).
% 0.74/1.28
% 0.74/1.28
% 0.74/1.28 paramod(
% 0.74/1.28 clause( 2754, [ =( 'greatest_lower_bound'( b, a ), 'least_upper_bound'( c,
% 0.74/1.28 'greatest_lower_bound'( b, a ) ) ) ] )
% 0.74/1.28 , clause( 15, [ =( 'greatest_lower_bound'( a, c ), c ) ] )
% 0.74/1.28 , 0, clause( 2752, [ =( 'greatest_lower_bound'( b, X ), 'least_upper_bound'(
% 0.74/1.28 'greatest_lower_bound'( X, c ), 'greatest_lower_bound'( b, X ) ) ) ] )
% 0.74/1.28 , 0, 5, substitution( 0, [] ), substitution( 1, [ :=( X, a )] )).
% 0.74/1.28
% 0.74/1.28
% 0.74/1.28 resolution(
% 0.74/1.28 clause( 2755, [] )
% 0.74/1.28 , clause( 2753, [ ~( =( 'greatest_lower_bound'( b, a ), 'least_upper_bound'(
% 0.74/1.28 c, 'greatest_lower_bound'( b, a ) ) ) ) ] )
% 0.74/1.28 , 0, clause( 2754, [ =( 'greatest_lower_bound'( b, a ), 'least_upper_bound'(
% 0.74/1.28 c, 'greatest_lower_bound'( b, a ) ) ) ] )
% 0.74/1.28 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.74/1.28
% 0.74/1.28
% 0.74/1.28 subsumption(
% 0.74/1.28 clause( 2573, [] )
% 0.74/1.28 , clause( 2755, [] )
% 0.74/1.28 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.74/1.28
% 0.74/1.28
% 0.74/1.28 end.
% 0.74/1.28
% 0.74/1.28 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.74/1.28
% 0.74/1.28 Memory use:
% 0.74/1.28
% 0.74/1.28 space for terms: 33413
% 0.74/1.28 space for clauses: 276428
% 0.74/1.28
% 0.74/1.28
% 0.74/1.28 clauses generated: 36844
% 0.74/1.28 clauses kept: 2574
% 0.74/1.28 clauses selected: 311
% 0.74/1.28 clauses deleted: 21
% 0.74/1.28 clauses inuse deleted: 6
% 0.74/1.28
% 0.74/1.28 subsentry: 4965
% 0.74/1.28 literals s-matched: 4521
% 0.74/1.28 literals matched: 4517
% 0.74/1.28 full subsumption: 0
% 0.74/1.28
% 0.74/1.28 checksum: 736754512
% 0.74/1.28
% 0.74/1.28
% 0.74/1.28 Bliksem ended
%------------------------------------------------------------------------------