TSTP Solution File: GRP138-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : GRP138-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 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 : Sat Jul 16 07:35:32 EDT 2022
% Result : Unsatisfiable 0.87s 1.24s
% Output : Refutation 0.87s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP138-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.13 % Command : bliksem %s
% 0.14/0.34 % Computer : n027.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % DateTime : Mon Jun 13 20:56:47 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.87/1.24 *** allocated 10000 integers for termspace/termends
% 0.87/1.24 *** allocated 10000 integers for clauses
% 0.87/1.24 *** allocated 10000 integers for justifications
% 0.87/1.24 Bliksem 1.12
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 Automatic Strategy Selection
% 0.87/1.24
% 0.87/1.24 Clauses:
% 0.87/1.24 [
% 0.87/1.24 [ =( multiply( identity, X ), X ) ],
% 0.87/1.24 [ =( multiply( inverse( X ), X ), identity ) ],
% 0.87/1.24 [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply( Y, Z ) ) )
% 0.87/1.24 ],
% 0.87/1.24 [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y, X ) ) ]
% 0.87/1.24 ,
% 0.87/1.24 [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X ) ) ],
% 0.87/1.24 [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.87/1.24 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ],
% 0.87/1.24 [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.87/1.24 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ],
% 0.87/1.24 [ =( 'least_upper_bound'( X, X ), X ) ],
% 0.87/1.24 [ =( 'greatest_lower_bound'( X, X ), X ) ],
% 0.87/1.24 [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) ), X ) ]
% 0.87/1.24 ,
% 0.87/1.24 [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) ), X ) ]
% 0.87/1.24 ,
% 0.87/1.24 [ =( multiply( X, 'least_upper_bound'( Y, Z ) ), 'least_upper_bound'(
% 0.87/1.24 multiply( X, Y ), multiply( X, Z ) ) ) ],
% 0.87/1.24 [ =( multiply( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.87/1.24 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ],
% 0.87/1.24 [ =( multiply( 'least_upper_bound'( X, Y ), Z ), 'least_upper_bound'(
% 0.87/1.24 multiply( X, Z ), multiply( Y, Z ) ) ) ],
% 0.87/1.24 [ =( multiply( 'greatest_lower_bound'( X, Y ), Z ),
% 0.87/1.24 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ],
% 0.87/1.24 [ =( 'least_upper_bound'( a, c ), a ) ],
% 0.87/1.24 [ =( 'least_upper_bound'( b, c ), b ) ],
% 0.87/1.24 [ ~( =( 'least_upper_bound'( 'greatest_lower_bound'( a, b ), c ),
% 0.87/1.24 'greatest_lower_bound'( a, b ) ) ) ]
% 0.87/1.24 ] .
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 percentage equality = 1.000000, percentage horn = 1.000000
% 0.87/1.24 This is a pure equality problem
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 Options Used:
% 0.87/1.24
% 0.87/1.24 useres = 1
% 0.87/1.24 useparamod = 1
% 0.87/1.24 useeqrefl = 1
% 0.87/1.24 useeqfact = 1
% 0.87/1.24 usefactor = 1
% 0.87/1.24 usesimpsplitting = 0
% 0.87/1.24 usesimpdemod = 5
% 0.87/1.24 usesimpres = 3
% 0.87/1.24
% 0.87/1.24 resimpinuse = 1000
% 0.87/1.24 resimpclauses = 20000
% 0.87/1.24 substype = eqrewr
% 0.87/1.24 backwardsubs = 1
% 0.87/1.24 selectoldest = 5
% 0.87/1.24
% 0.87/1.24 litorderings [0] = split
% 0.87/1.24 litorderings [1] = extend the termordering, first sorting on arguments
% 0.87/1.24
% 0.87/1.24 termordering = kbo
% 0.87/1.24
% 0.87/1.24 litapriori = 0
% 0.87/1.24 termapriori = 1
% 0.87/1.24 litaposteriori = 0
% 0.87/1.24 termaposteriori = 0
% 0.87/1.24 demodaposteriori = 0
% 0.87/1.24 ordereqreflfact = 0
% 0.87/1.24
% 0.87/1.24 litselect = negord
% 0.87/1.24
% 0.87/1.24 maxweight = 15
% 0.87/1.24 maxdepth = 30000
% 0.87/1.24 maxlength = 115
% 0.87/1.24 maxnrvars = 195
% 0.87/1.24 excuselevel = 1
% 0.87/1.24 increasemaxweight = 1
% 0.87/1.24
% 0.87/1.24 maxselected = 10000000
% 0.87/1.24 maxnrclauses = 10000000
% 0.87/1.24
% 0.87/1.24 showgenerated = 0
% 0.87/1.24 showkept = 0
% 0.87/1.24 showselected = 0
% 0.87/1.24 showdeleted = 0
% 0.87/1.24 showresimp = 1
% 0.87/1.24 showstatus = 2000
% 0.87/1.24
% 0.87/1.24 prologoutput = 1
% 0.87/1.24 nrgoals = 5000000
% 0.87/1.24 totalproof = 1
% 0.87/1.24
% 0.87/1.24 Symbols occurring in the translation:
% 0.87/1.24
% 0.87/1.24 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.87/1.24 . [1, 2] (w:1, o:22, a:1, s:1, b:0),
% 0.87/1.24 ! [4, 1] (w:0, o:16, a:1, s:1, b:0),
% 0.87/1.24 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.87/1.24 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.87/1.24 identity [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.87/1.24 multiply [41, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.87/1.24 inverse [42, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.87/1.24 'greatest_lower_bound' [45, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.87/1.24 'least_upper_bound' [46, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.87/1.24 a [47, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.87/1.24 c [48, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.87/1.24 b [49, 0] (w:1, o:14, a:1, s:1, b:0).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 Starting Search:
% 0.87/1.24
% 0.87/1.24 Resimplifying inuse:
% 0.87/1.24 Done
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 Intermediate Status:
% 0.87/1.24 Generated: 28539
% 0.87/1.24 Kept: 2004
% 0.87/1.24 Inuse: 263
% 0.87/1.24 Deleted: 13
% 0.87/1.24 Deletedinuse: 6
% 0.87/1.24
% 0.87/1.24 Resimplifying inuse:
% 0.87/1.24 Done
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 Bliksems!, er is een bewijs:
% 0.87/1.24 % SZS status Unsatisfiable
% 0.87/1.24 % SZS output start Refutation
% 0.87/1.24
% 0.87/1.24 clause( 3, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y,
% 0.87/1.24 X ) ) ] )
% 0.87/1.24 .
% 0.87/1.24 clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X ) )
% 0.87/1.24 ] )
% 0.87/1.24 .
% 0.87/1.24 clause( 5, [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z ) )
% 0.87/1.24 , 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.87/1.24 .
% 0.87/1.24 clause( 6, [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.87/1.24 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.87/1.24 .
% 0.87/1.24 clause( 9, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) ), X
% 0.87/1.24 ) ] )
% 0.87/1.24 .
% 0.87/1.24 clause( 10, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) ),
% 0.87/1.24 X ) ] )
% 0.87/1.24 .
% 0.87/1.24 clause( 15, [ =( 'least_upper_bound'( a, c ), a ) ] )
% 0.87/1.24 .
% 0.87/1.24 clause( 16, [ =( 'least_upper_bound'( b, c ), b ) ] )
% 0.87/1.24 .
% 0.87/1.24 clause( 17, [ ~( =( 'least_upper_bound'( 'greatest_lower_bound'( a, b ), c
% 0.87/1.24 ), 'greatest_lower_bound'( a, b ) ) ) ] )
% 0.87/1.24 .
% 0.87/1.24 clause( 18, [ =( 'least_upper_bound'( c, a ), a ) ] )
% 0.87/1.24 .
% 0.87/1.24 clause( 19, [ =( 'least_upper_bound'( c, b ), b ) ] )
% 0.87/1.24 .
% 0.87/1.24 clause( 23, [ =( 'greatest_lower_bound'( 'least_upper_bound'( X, Y ), X ),
% 0.87/1.24 X ) ] )
% 0.87/1.24 .
% 0.87/1.24 clause( 25, [ =( 'greatest_lower_bound'( c, a ), c ) ] )
% 0.87/1.24 .
% 0.87/1.24 clause( 28, [ =( 'greatest_lower_bound'( a, c ), c ) ] )
% 0.87/1.24 .
% 0.87/1.24 clause( 40, [ =( 'greatest_lower_bound'( 'least_upper_bound'( Y, X ), X ),
% 0.87/1.24 X ) ] )
% 0.87/1.24 .
% 0.87/1.24 clause( 48, [ =( 'least_upper_bound'( 'least_upper_bound'( X, c ), b ),
% 0.87/1.24 'least_upper_bound'( X, b ) ) ] )
% 0.87/1.24 .
% 0.87/1.24 clause( 58, [ =( 'least_upper_bound'( 'least_upper_bound'( X, Y ), X ),
% 0.87/1.24 'least_upper_bound'( X, Y ) ) ] )
% 0.87/1.24 .
% 0.87/1.24 clause( 61, [ =( 'least_upper_bound'( 'greatest_lower_bound'( X, Y ), X ),
% 0.87/1.24 X ) ] )
% 0.87/1.24 .
% 0.87/1.24 clause( 91, [ =( 'least_upper_bound'( 'greatest_lower_bound'( c, X ), b ),
% 0.87/1.24 b ) ] )
% 0.87/1.24 .
% 0.87/1.24 clause( 97, [ =( 'least_upper_bound'( b, 'greatest_lower_bound'( c, X ) ),
% 0.87/1.24 b ) ] )
% 0.87/1.24 .
% 0.87/1.24 clause( 113, [ =( 'least_upper_bound'( b, 'greatest_lower_bound'( X, c ) )
% 0.87/1.24 , b ) ] )
% 0.87/1.24 .
% 0.87/1.24 clause( 115, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( b, X ), c
% 0.87/1.24 ), 'greatest_lower_bound'( X, c ) ) ] )
% 0.87/1.24 .
% 0.87/1.24 clause( 117, [ =( 'least_upper_bound'( 'greatest_lower_bound'( X, c ),
% 0.87/1.24 'greatest_lower_bound'( b, X ) ), 'greatest_lower_bound'( b, X ) ) ] )
% 0.87/1.24 .
% 0.87/1.24 clause( 141, [ ~( =( 'least_upper_bound'( 'greatest_lower_bound'( b, a ), c
% 0.87/1.24 ), 'greatest_lower_bound'( b, a ) ) ) ] )
% 0.87/1.24 .
% 0.87/1.24 clause( 214, [ ~( =( 'least_upper_bound'( c, 'greatest_lower_bound'( b, a )
% 0.87/1.24 ), 'greatest_lower_bound'( b, a ) ) ) ] )
% 0.87/1.24 .
% 0.87/1.24 clause( 2692, [] )
% 0.87/1.24 .
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 % SZS output end Refutation
% 0.87/1.24 found a proof!
% 0.87/1.24
% 0.87/1.24 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.87/1.24
% 0.87/1.24 initialclauses(
% 0.87/1.24 [ clause( 2694, [ =( multiply( identity, X ), X ) ] )
% 0.87/1.24 , clause( 2695, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.87/1.24 , clause( 2696, [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply(
% 0.87/1.24 Y, Z ) ) ) ] )
% 0.87/1.24 , clause( 2697, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'(
% 0.87/1.24 Y, X ) ) ] )
% 0.87/1.24 , clause( 2698, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X
% 0.87/1.24 ) ) ] )
% 0.87/1.24 , clause( 2699, [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y,
% 0.87/1.24 Z ) ), 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.87/1.24 , clause( 2700, [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) )
% 0.87/1.24 , 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.87/1.24 , clause( 2701, [ =( 'least_upper_bound'( X, X ), X ) ] )
% 0.87/1.24 , clause( 2702, [ =( 'greatest_lower_bound'( X, X ), X ) ] )
% 0.87/1.24 , clause( 2703, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y )
% 0.87/1.24 ), X ) ] )
% 0.87/1.24 , clause( 2704, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y )
% 0.87/1.24 ), X ) ] )
% 0.87/1.24 , clause( 2705, [ =( multiply( X, 'least_upper_bound'( Y, Z ) ),
% 0.87/1.24 'least_upper_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ] )
% 0.87/1.24 , clause( 2706, [ =( multiply( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.87/1.24 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ] )
% 0.87/1.24 , clause( 2707, [ =( multiply( 'least_upper_bound'( X, Y ), Z ),
% 0.87/1.24 'least_upper_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ] )
% 0.87/1.24 , clause( 2708, [ =( multiply( 'greatest_lower_bound'( X, Y ), Z ),
% 0.87/1.24 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ] )
% 0.87/1.24 , clause( 2709, [ =( 'least_upper_bound'( a, c ), a ) ] )
% 0.87/1.24 , clause( 2710, [ =( 'least_upper_bound'( b, c ), b ) ] )
% 0.87/1.24 , clause( 2711, [ ~( =( 'least_upper_bound'( 'greatest_lower_bound'( a, b )
% 0.87/1.24 , c ), 'greatest_lower_bound'( a, b ) ) ) ] )
% 0.87/1.24 ] ).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 subsumption(
% 0.87/1.24 clause( 3, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y,
% 0.87/1.24 X ) ) ] )
% 0.87/1.24 , clause( 2697, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'(
% 0.87/1.24 Y, X ) ) ] )
% 0.87/1.24 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.87/1.24 )] ) ).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 subsumption(
% 0.87/1.24 clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X ) )
% 0.87/1.24 ] )
% 0.87/1.24 , clause( 2698, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X
% 0.87/1.24 ) ) ] )
% 0.87/1.24 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.87/1.24 )] ) ).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 subsumption(
% 0.87/1.24 clause( 5, [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z ) )
% 0.87/1.24 , 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.87/1.24 , clause( 2699, [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y,
% 0.87/1.24 Z ) ), 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.87/1.24 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.87/1.24 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 subsumption(
% 0.87/1.24 clause( 6, [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.87/1.24 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.87/1.24 , clause( 2700, [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) )
% 0.87/1.24 , 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.87/1.24 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.87/1.24 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 subsumption(
% 0.87/1.24 clause( 9, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) ), X
% 0.87/1.24 ) ] )
% 0.87/1.24 , clause( 2703, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y )
% 0.87/1.24 ), X ) ] )
% 0.87/1.24 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.87/1.24 )] ) ).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 subsumption(
% 0.87/1.24 clause( 10, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) ),
% 0.87/1.24 X ) ] )
% 0.87/1.24 , clause( 2704, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y )
% 0.87/1.24 ), X ) ] )
% 0.87/1.24 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.87/1.24 )] ) ).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 subsumption(
% 0.87/1.24 clause( 15, [ =( 'least_upper_bound'( a, c ), a ) ] )
% 0.87/1.24 , clause( 2709, [ =( 'least_upper_bound'( a, c ), a ) ] )
% 0.87/1.24 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 subsumption(
% 0.87/1.24 clause( 16, [ =( 'least_upper_bound'( b, c ), b ) ] )
% 0.87/1.24 , clause( 2710, [ =( 'least_upper_bound'( b, c ), b ) ] )
% 0.87/1.24 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 subsumption(
% 0.87/1.24 clause( 17, [ ~( =( 'least_upper_bound'( 'greatest_lower_bound'( a, b ), c
% 0.87/1.24 ), 'greatest_lower_bound'( a, b ) ) ) ] )
% 0.87/1.24 , clause( 2711, [ ~( =( 'least_upper_bound'( 'greatest_lower_bound'( a, b )
% 0.87/1.24 , c ), 'greatest_lower_bound'( a, b ) ) ) ] )
% 0.87/1.24 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 eqswap(
% 0.87/1.24 clause( 2789, [ =( a, 'least_upper_bound'( a, c ) ) ] )
% 0.87/1.24 , clause( 15, [ =( 'least_upper_bound'( a, c ), a ) ] )
% 0.87/1.24 , 0, substitution( 0, [] )).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 paramod(
% 0.87/1.24 clause( 2790, [ =( a, 'least_upper_bound'( c, a ) ) ] )
% 0.87/1.24 , clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X )
% 0.87/1.24 ) ] )
% 0.87/1.24 , 0, clause( 2789, [ =( a, 'least_upper_bound'( a, c ) ) ] )
% 0.87/1.24 , 0, 2, substitution( 0, [ :=( X, a ), :=( Y, c )] ), substitution( 1, [] )
% 0.87/1.24 ).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 eqswap(
% 0.87/1.24 clause( 2793, [ =( 'least_upper_bound'( c, a ), a ) ] )
% 0.87/1.24 , clause( 2790, [ =( a, 'least_upper_bound'( c, a ) ) ] )
% 0.87/1.24 , 0, substitution( 0, [] )).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 subsumption(
% 0.87/1.24 clause( 18, [ =( 'least_upper_bound'( c, a ), a ) ] )
% 0.87/1.24 , clause( 2793, [ =( 'least_upper_bound'( c, a ), a ) ] )
% 0.87/1.24 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 eqswap(
% 0.87/1.24 clause( 2794, [ =( b, 'least_upper_bound'( b, c ) ) ] )
% 0.87/1.24 , clause( 16, [ =( 'least_upper_bound'( b, c ), b ) ] )
% 0.87/1.24 , 0, substitution( 0, [] )).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 paramod(
% 0.87/1.24 clause( 2795, [ =( b, 'least_upper_bound'( c, b ) ) ] )
% 0.87/1.24 , clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X )
% 0.87/1.24 ) ] )
% 0.87/1.24 , 0, clause( 2794, [ =( b, 'least_upper_bound'( b, c ) ) ] )
% 0.87/1.24 , 0, 2, substitution( 0, [ :=( X, b ), :=( Y, c )] ), substitution( 1, [] )
% 0.87/1.24 ).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 eqswap(
% 0.87/1.24 clause( 2798, [ =( 'least_upper_bound'( c, b ), b ) ] )
% 0.87/1.24 , clause( 2795, [ =( b, 'least_upper_bound'( c, b ) ) ] )
% 0.87/1.24 , 0, substitution( 0, [] )).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 subsumption(
% 0.87/1.24 clause( 19, [ =( 'least_upper_bound'( c, b ), b ) ] )
% 0.87/1.24 , clause( 2798, [ =( 'least_upper_bound'( c, b ), b ) ] )
% 0.87/1.24 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 eqswap(
% 0.87/1.24 clause( 2799, [ =( X, 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y
% 0.87/1.24 ) ) ) ] )
% 0.87/1.24 , clause( 10, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) )
% 0.87/1.24 , X ) ] )
% 0.87/1.24 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 paramod(
% 0.87/1.24 clause( 2800, [ =( X, 'greatest_lower_bound'( 'least_upper_bound'( X, Y ),
% 0.87/1.24 X ) ) ] )
% 0.87/1.24 , clause( 3, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y
% 0.87/1.24 , X ) ) ] )
% 0.87/1.24 , 0, clause( 2799, [ =( X, 'greatest_lower_bound'( X, 'least_upper_bound'(
% 0.87/1.24 X, Y ) ) ) ] )
% 0.87/1.24 , 0, 2, substitution( 0, [ :=( X, X ), :=( Y, 'least_upper_bound'( X, Y ) )] )
% 0.87/1.24 , substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 eqswap(
% 0.87/1.24 clause( 2803, [ =( 'greatest_lower_bound'( 'least_upper_bound'( X, Y ), X )
% 0.87/1.24 , X ) ] )
% 0.87/1.24 , clause( 2800, [ =( X, 'greatest_lower_bound'( 'least_upper_bound'( X, Y )
% 0.87/1.24 , X ) ) ] )
% 0.87/1.24 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 subsumption(
% 0.87/1.24 clause( 23, [ =( 'greatest_lower_bound'( 'least_upper_bound'( X, Y ), X ),
% 0.87/1.24 X ) ] )
% 0.87/1.24 , clause( 2803, [ =( 'greatest_lower_bound'( 'least_upper_bound'( X, Y ), X
% 0.87/1.24 ), X ) ] )
% 0.87/1.24 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.87/1.24 )] ) ).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 eqswap(
% 0.87/1.24 clause( 2805, [ =( X, 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y
% 0.87/1.24 ) ) ) ] )
% 0.87/1.24 , clause( 10, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) )
% 0.87/1.24 , X ) ] )
% 0.87/1.24 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 paramod(
% 0.87/1.24 clause( 2806, [ =( c, 'greatest_lower_bound'( c, a ) ) ] )
% 0.87/1.24 , clause( 18, [ =( 'least_upper_bound'( c, a ), a ) ] )
% 0.87/1.24 , 0, clause( 2805, [ =( X, 'greatest_lower_bound'( X, 'least_upper_bound'(
% 0.87/1.24 X, Y ) ) ) ] )
% 0.87/1.24 , 0, 4, substitution( 0, [] ), substitution( 1, [ :=( X, c ), :=( Y, a )] )
% 0.87/1.24 ).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 eqswap(
% 0.87/1.24 clause( 2807, [ =( 'greatest_lower_bound'( c, a ), c ) ] )
% 0.87/1.24 , clause( 2806, [ =( c, 'greatest_lower_bound'( c, a ) ) ] )
% 0.87/1.24 , 0, substitution( 0, [] )).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 subsumption(
% 0.87/1.24 clause( 25, [ =( 'greatest_lower_bound'( c, a ), c ) ] )
% 0.87/1.24 , clause( 2807, [ =( 'greatest_lower_bound'( c, a ), c ) ] )
% 0.87/1.24 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 eqswap(
% 0.87/1.24 clause( 2808, [ =( c, 'greatest_lower_bound'( c, a ) ) ] )
% 0.87/1.24 , clause( 25, [ =( 'greatest_lower_bound'( c, a ), c ) ] )
% 0.87/1.24 , 0, substitution( 0, [] )).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 paramod(
% 0.87/1.24 clause( 2809, [ =( c, 'greatest_lower_bound'( a, c ) ) ] )
% 0.87/1.24 , clause( 3, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y
% 0.87/1.24 , X ) ) ] )
% 0.87/1.24 , 0, clause( 2808, [ =( c, 'greatest_lower_bound'( c, a ) ) ] )
% 0.87/1.24 , 0, 2, substitution( 0, [ :=( X, c ), :=( Y, a )] ), substitution( 1, [] )
% 0.87/1.24 ).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 eqswap(
% 0.87/1.24 clause( 2812, [ =( 'greatest_lower_bound'( a, c ), c ) ] )
% 0.87/1.24 , clause( 2809, [ =( c, 'greatest_lower_bound'( a, c ) ) ] )
% 0.87/1.24 , 0, substitution( 0, [] )).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 subsumption(
% 0.87/1.24 clause( 28, [ =( 'greatest_lower_bound'( a, c ), c ) ] )
% 0.87/1.24 , clause( 2812, [ =( 'greatest_lower_bound'( a, c ), c ) ] )
% 0.87/1.24 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 eqswap(
% 0.87/1.24 clause( 2813, [ =( X, 'greatest_lower_bound'( 'least_upper_bound'( X, Y ),
% 0.87/1.24 X ) ) ] )
% 0.87/1.24 , clause( 23, [ =( 'greatest_lower_bound'( 'least_upper_bound'( X, Y ), X )
% 0.87/1.24 , X ) ] )
% 0.87/1.24 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 paramod(
% 0.87/1.24 clause( 2814, [ =( X, 'greatest_lower_bound'( 'least_upper_bound'( Y, X ),
% 0.87/1.24 X ) ) ] )
% 0.87/1.24 , clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X )
% 0.87/1.24 ) ] )
% 0.87/1.24 , 0, clause( 2813, [ =( X, 'greatest_lower_bound'( 'least_upper_bound'( X,
% 0.87/1.24 Y ), X ) ) ] )
% 0.87/1.24 , 0, 3, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [
% 0.87/1.24 :=( X, X ), :=( Y, Y )] )).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 eqswap(
% 0.87/1.24 clause( 2817, [ =( 'greatest_lower_bound'( 'least_upper_bound'( Y, X ), X )
% 0.87/1.24 , X ) ] )
% 0.87/1.24 , clause( 2814, [ =( X, 'greatest_lower_bound'( 'least_upper_bound'( Y, X )
% 0.87/1.24 , X ) ) ] )
% 0.87/1.24 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 subsumption(
% 0.87/1.24 clause( 40, [ =( 'greatest_lower_bound'( 'least_upper_bound'( Y, X ), X ),
% 0.87/1.24 X ) ] )
% 0.87/1.24 , clause( 2817, [ =( 'greatest_lower_bound'( 'least_upper_bound'( Y, X ), X
% 0.87/1.24 ), X ) ] )
% 0.87/1.24 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.87/1.24 )] ) ).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 eqswap(
% 0.87/1.24 clause( 2819, [ =( 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ),
% 0.87/1.24 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ) ) ] )
% 0.87/1.24 , clause( 6, [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.87/1.24 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.87/1.24 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 paramod(
% 0.87/1.24 clause( 2821, [ =( 'least_upper_bound'( 'least_upper_bound'( X, c ), b ),
% 0.87/1.24 'least_upper_bound'( X, b ) ) ] )
% 0.87/1.24 , clause( 19, [ =( 'least_upper_bound'( c, b ), b ) ] )
% 0.87/1.24 , 0, clause( 2819, [ =( 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z
% 0.87/1.24 ), 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ) ) ] )
% 0.87/1.24 , 0, 8, substitution( 0, [] ), substitution( 1, [ :=( X, X ), :=( Y, c ),
% 0.87/1.24 :=( Z, b )] )).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 subsumption(
% 0.87/1.24 clause( 48, [ =( 'least_upper_bound'( 'least_upper_bound'( X, c ), b ),
% 0.87/1.24 'least_upper_bound'( X, b ) ) ] )
% 0.87/1.24 , clause( 2821, [ =( 'least_upper_bound'( 'least_upper_bound'( X, c ), b )
% 0.87/1.24 , 'least_upper_bound'( X, b ) ) ] )
% 0.87/1.24 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 eqswap(
% 0.87/1.24 clause( 2825, [ =( X, 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y
% 0.87/1.24 ) ) ) ] )
% 0.87/1.24 , clause( 9, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) )
% 0.87/1.24 , X ) ] )
% 0.87/1.24 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 paramod(
% 0.87/1.24 clause( 2828, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'(
% 0.87/1.24 'least_upper_bound'( X, Y ), X ) ) ] )
% 0.87/1.24 , clause( 23, [ =( 'greatest_lower_bound'( 'least_upper_bound'( X, Y ), X )
% 0.87/1.24 , X ) ] )
% 0.87/1.24 , 0, clause( 2825, [ =( X, 'least_upper_bound'( X, 'greatest_lower_bound'(
% 0.87/1.24 X, Y ) ) ) ] )
% 0.87/1.24 , 0, 8, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [
% 0.87/1.24 :=( X, 'least_upper_bound'( X, Y ) ), :=( Y, X )] )).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 eqswap(
% 0.87/1.24 clause( 2829, [ =( 'least_upper_bound'( 'least_upper_bound'( X, Y ), X ),
% 0.87/1.24 'least_upper_bound'( X, Y ) ) ] )
% 0.87/1.24 , clause( 2828, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'(
% 0.87/1.24 'least_upper_bound'( X, Y ), X ) ) ] )
% 0.87/1.24 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 subsumption(
% 0.87/1.24 clause( 58, [ =( 'least_upper_bound'( 'least_upper_bound'( X, Y ), X ),
% 0.87/1.24 'least_upper_bound'( X, Y ) ) ] )
% 0.87/1.24 , clause( 2829, [ =( 'least_upper_bound'( 'least_upper_bound'( X, Y ), X )
% 0.87/1.24 , 'least_upper_bound'( X, Y ) ) ] )
% 0.87/1.24 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.87/1.24 )] ) ).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 eqswap(
% 0.87/1.24 clause( 2830, [ =( X, 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y
% 0.87/1.24 ) ) ) ] )
% 0.87/1.24 , clause( 9, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) )
% 0.87/1.24 , X ) ] )
% 0.87/1.24 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 paramod(
% 0.87/1.24 clause( 2831, [ =( X, 'least_upper_bound'( 'greatest_lower_bound'( X, Y ),
% 0.87/1.24 X ) ) ] )
% 0.87/1.24 , clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X )
% 0.87/1.24 ) ] )
% 0.87/1.24 , 0, clause( 2830, [ =( X, 'least_upper_bound'( X, 'greatest_lower_bound'(
% 0.87/1.24 X, Y ) ) ) ] )
% 0.87/1.24 , 0, 2, substitution( 0, [ :=( X, X ), :=( Y, 'greatest_lower_bound'( X, Y
% 0.87/1.24 ) )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 eqswap(
% 0.87/1.24 clause( 2834, [ =( 'least_upper_bound'( 'greatest_lower_bound'( X, Y ), X )
% 0.87/1.24 , X ) ] )
% 0.87/1.24 , clause( 2831, [ =( X, 'least_upper_bound'( 'greatest_lower_bound'( X, Y )
% 0.87/1.24 , X ) ) ] )
% 0.87/1.24 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 subsumption(
% 0.87/1.24 clause( 61, [ =( 'least_upper_bound'( 'greatest_lower_bound'( X, Y ), X ),
% 0.87/1.24 X ) ] )
% 0.87/1.24 , clause( 2834, [ =( 'least_upper_bound'( 'greatest_lower_bound'( X, Y ), X
% 0.87/1.24 ), X ) ] )
% 0.87/1.24 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.87/1.24 )] ) ).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 eqswap(
% 0.87/1.24 clause( 2836, [ =( 'least_upper_bound'( X, b ), 'least_upper_bound'(
% 0.87/1.24 'least_upper_bound'( X, c ), b ) ) ] )
% 0.87/1.24 , clause( 48, [ =( 'least_upper_bound'( 'least_upper_bound'( X, c ), b ),
% 0.87/1.24 'least_upper_bound'( X, b ) ) ] )
% 0.87/1.24 , 0, substitution( 0, [ :=( X, X )] )).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 paramod(
% 0.87/1.24 clause( 2839, [ =( 'least_upper_bound'( 'greatest_lower_bound'( c, X ), b )
% 0.87/1.24 , 'least_upper_bound'( c, b ) ) ] )
% 0.87/1.24 , clause( 61, [ =( 'least_upper_bound'( 'greatest_lower_bound'( X, Y ), X )
% 0.87/1.24 , X ) ] )
% 0.87/1.24 , 0, clause( 2836, [ =( 'least_upper_bound'( X, b ), 'least_upper_bound'(
% 0.87/1.24 'least_upper_bound'( X, c ), b ) ) ] )
% 0.87/1.24 , 0, 7, substitution( 0, [ :=( X, c ), :=( Y, X )] ), substitution( 1, [
% 0.87/1.24 :=( X, 'greatest_lower_bound'( c, X ) )] )).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 paramod(
% 0.87/1.24 clause( 2840, [ =( 'least_upper_bound'( 'greatest_lower_bound'( c, X ), b )
% 0.87/1.24 , b ) ] )
% 0.87/1.24 , clause( 19, [ =( 'least_upper_bound'( c, b ), b ) ] )
% 0.87/1.24 , 0, clause( 2839, [ =( 'least_upper_bound'( 'greatest_lower_bound'( c, X )
% 0.87/1.24 , b ), 'least_upper_bound'( c, b ) ) ] )
% 0.87/1.24 , 0, 6, substitution( 0, [] ), substitution( 1, [ :=( X, X )] )).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 subsumption(
% 0.87/1.24 clause( 91, [ =( 'least_upper_bound'( 'greatest_lower_bound'( c, X ), b ),
% 0.87/1.24 b ) ] )
% 0.87/1.24 , clause( 2840, [ =( 'least_upper_bound'( 'greatest_lower_bound'( c, X ), b
% 0.87/1.24 ), b ) ] )
% 0.87/1.24 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 eqswap(
% 0.87/1.24 clause( 2843, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'(
% 0.87/1.24 'least_upper_bound'( X, Y ), X ) ) ] )
% 0.87/1.24 , clause( 58, [ =( 'least_upper_bound'( 'least_upper_bound'( X, Y ), X ),
% 0.87/1.24 'least_upper_bound'( X, Y ) ) ] )
% 0.87/1.24 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 paramod(
% 0.87/1.24 clause( 2845, [ =( 'least_upper_bound'( 'greatest_lower_bound'( c, X ), b )
% 0.87/1.24 , 'least_upper_bound'( b, 'greatest_lower_bound'( c, X ) ) ) ] )
% 0.87/1.24 , clause( 91, [ =( 'least_upper_bound'( 'greatest_lower_bound'( c, X ), b )
% 0.87/1.24 , b ) ] )
% 0.87/1.24 , 0, clause( 2843, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'(
% 0.87/1.24 'least_upper_bound'( X, Y ), X ) ) ] )
% 0.87/1.24 , 0, 7, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X,
% 0.87/1.24 'greatest_lower_bound'( c, X ) ), :=( Y, b )] )).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 paramod(
% 0.87/1.24 clause( 2846, [ =( b, 'least_upper_bound'( b, 'greatest_lower_bound'( c, X
% 0.87/1.24 ) ) ) ] )
% 0.87/1.24 , clause( 91, [ =( 'least_upper_bound'( 'greatest_lower_bound'( c, X ), b )
% 0.87/1.24 , b ) ] )
% 0.87/1.24 , 0, clause( 2845, [ =( 'least_upper_bound'( 'greatest_lower_bound'( c, X )
% 0.87/1.24 , b ), 'least_upper_bound'( b, 'greatest_lower_bound'( c, X ) ) ) ] )
% 0.87/1.24 , 0, 1, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X )] )
% 0.87/1.24 ).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 eqswap(
% 0.87/1.24 clause( 2848, [ =( 'least_upper_bound'( b, 'greatest_lower_bound'( c, X ) )
% 0.87/1.24 , b ) ] )
% 0.87/1.24 , clause( 2846, [ =( b, 'least_upper_bound'( b, 'greatest_lower_bound'( c,
% 0.87/1.24 X ) ) ) ] )
% 0.87/1.24 , 0, substitution( 0, [ :=( X, X )] )).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 subsumption(
% 0.87/1.24 clause( 97, [ =( 'least_upper_bound'( b, 'greatest_lower_bound'( c, X ) ),
% 0.87/1.24 b ) ] )
% 0.87/1.24 , clause( 2848, [ =( 'least_upper_bound'( b, 'greatest_lower_bound'( c, X )
% 0.87/1.24 ), b ) ] )
% 0.87/1.24 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 eqswap(
% 0.87/1.24 clause( 2850, [ =( b, 'least_upper_bound'( b, 'greatest_lower_bound'( c, X
% 0.87/1.24 ) ) ) ] )
% 0.87/1.24 , clause( 97, [ =( 'least_upper_bound'( b, 'greatest_lower_bound'( c, X ) )
% 0.87/1.24 , b ) ] )
% 0.87/1.24 , 0, substitution( 0, [ :=( X, X )] )).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 paramod(
% 0.87/1.24 clause( 2851, [ =( b, 'least_upper_bound'( b, 'greatest_lower_bound'( X, c
% 0.87/1.24 ) ) ) ] )
% 0.87/1.24 , clause( 3, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y
% 0.87/1.24 , X ) ) ] )
% 0.87/1.24 , 0, clause( 2850, [ =( b, 'least_upper_bound'( b, 'greatest_lower_bound'(
% 0.87/1.24 c, X ) ) ) ] )
% 0.87/1.24 , 0, 4, substitution( 0, [ :=( X, c ), :=( Y, X )] ), substitution( 1, [
% 0.87/1.24 :=( X, X )] )).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 eqswap(
% 0.87/1.24 clause( 2854, [ =( 'least_upper_bound'( b, 'greatest_lower_bound'( X, c ) )
% 0.87/1.24 , b ) ] )
% 0.87/1.24 , clause( 2851, [ =( b, 'least_upper_bound'( b, 'greatest_lower_bound'( X,
% 0.87/1.24 c ) ) ) ] )
% 0.87/1.24 , 0, substitution( 0, [ :=( X, X )] )).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 subsumption(
% 0.87/1.24 clause( 113, [ =( 'least_upper_bound'( b, 'greatest_lower_bound'( X, c ) )
% 0.87/1.24 , b ) ] )
% 0.87/1.24 , clause( 2854, [ =( 'least_upper_bound'( b, 'greatest_lower_bound'( X, c )
% 0.87/1.24 ), b ) ] )
% 0.87/1.24 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 eqswap(
% 0.87/1.24 clause( 2856, [ =( Y, 'greatest_lower_bound'( 'least_upper_bound'( X, Y ),
% 0.87/1.24 Y ) ) ] )
% 0.87/1.24 , clause( 40, [ =( 'greatest_lower_bound'( 'least_upper_bound'( Y, X ), X )
% 0.87/1.24 , X ) ] )
% 0.87/1.24 , 0, substitution( 0, [ :=( X, Y ), :=( Y, X )] )).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 paramod(
% 0.87/1.24 clause( 2859, [ =( 'greatest_lower_bound'( X, c ), 'greatest_lower_bound'(
% 0.87/1.24 b, 'greatest_lower_bound'( X, c ) ) ) ] )
% 0.87/1.24 , clause( 113, [ =( 'least_upper_bound'( b, 'greatest_lower_bound'( X, c )
% 0.87/1.24 ), b ) ] )
% 0.87/1.24 , 0, clause( 2856, [ =( Y, 'greatest_lower_bound'( 'least_upper_bound'( X,
% 0.87/1.24 Y ), Y ) ) ] )
% 0.87/1.24 , 0, 5, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, b ),
% 0.87/1.24 :=( Y, 'greatest_lower_bound'( X, c ) )] )).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 paramod(
% 0.87/1.24 clause( 2860, [ =( 'greatest_lower_bound'( X, c ), 'greatest_lower_bound'(
% 0.87/1.24 'greatest_lower_bound'( b, X ), c ) ) ] )
% 0.87/1.24 , clause( 5, [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z )
% 0.87/1.24 ), 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.87/1.24 , 0, clause( 2859, [ =( 'greatest_lower_bound'( X, c ),
% 0.87/1.24 'greatest_lower_bound'( b, 'greatest_lower_bound'( X, c ) ) ) ] )
% 0.87/1.24 , 0, 4, substitution( 0, [ :=( X, b ), :=( Y, X ), :=( Z, c )] ),
% 0.87/1.24 substitution( 1, [ :=( X, X )] )).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 eqswap(
% 0.87/1.24 clause( 2861, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( b, X ),
% 0.87/1.24 c ), 'greatest_lower_bound'( X, c ) ) ] )
% 0.87/1.24 , clause( 2860, [ =( 'greatest_lower_bound'( X, c ), 'greatest_lower_bound'(
% 0.87/1.24 'greatest_lower_bound'( b, X ), c ) ) ] )
% 0.87/1.24 , 0, substitution( 0, [ :=( X, X )] )).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 subsumption(
% 0.87/1.24 clause( 115, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( b, X ), c
% 0.87/1.24 ), 'greatest_lower_bound'( X, c ) ) ] )
% 0.87/1.24 , clause( 2861, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( b, X )
% 0.87/1.24 , c ), 'greatest_lower_bound'( X, c ) ) ] )
% 0.87/1.24 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 eqswap(
% 0.87/1.24 clause( 2863, [ =( X, 'least_upper_bound'( 'greatest_lower_bound'( X, Y ),
% 0.87/1.24 X ) ) ] )
% 0.87/1.24 , clause( 61, [ =( 'least_upper_bound'( 'greatest_lower_bound'( X, Y ), X )
% 0.87/1.24 , X ) ] )
% 0.87/1.24 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 paramod(
% 0.87/1.24 clause( 2864, [ =( 'greatest_lower_bound'( b, X ), 'least_upper_bound'(
% 0.87/1.24 'greatest_lower_bound'( X, c ), 'greatest_lower_bound'( b, X ) ) ) ] )
% 0.87/1.24 , clause( 115, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( b, X )
% 0.87/1.24 , c ), 'greatest_lower_bound'( X, c ) ) ] )
% 0.87/1.24 , 0, clause( 2863, [ =( X, 'least_upper_bound'( 'greatest_lower_bound'( X,
% 0.87/1.24 Y ), X ) ) ] )
% 0.87/1.24 , 0, 5, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X,
% 0.87/1.24 'greatest_lower_bound'( b, X ) ), :=( Y, c )] )).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 eqswap(
% 0.87/1.24 clause( 2865, [ =( 'least_upper_bound'( 'greatest_lower_bound'( X, c ),
% 0.87/1.24 'greatest_lower_bound'( b, X ) ), 'greatest_lower_bound'( b, X ) ) ] )
% 0.87/1.24 , clause( 2864, [ =( 'greatest_lower_bound'( b, X ), 'least_upper_bound'(
% 0.87/1.24 'greatest_lower_bound'( X, c ), 'greatest_lower_bound'( b, X ) ) ) ] )
% 0.87/1.24 , 0, substitution( 0, [ :=( X, X )] )).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 subsumption(
% 0.87/1.24 clause( 117, [ =( 'least_upper_bound'( 'greatest_lower_bound'( X, c ),
% 0.87/1.24 'greatest_lower_bound'( b, X ) ), 'greatest_lower_bound'( b, X ) ) ] )
% 0.87/1.24 , clause( 2865, [ =( 'least_upper_bound'( 'greatest_lower_bound'( X, c ),
% 0.87/1.24 'greatest_lower_bound'( b, X ) ), 'greatest_lower_bound'( b, X ) ) ] )
% 0.87/1.24 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 eqswap(
% 0.87/1.24 clause( 2866, [ ~( =( 'greatest_lower_bound'( a, b ), 'least_upper_bound'(
% 0.87/1.24 'greatest_lower_bound'( a, b ), c ) ) ) ] )
% 0.87/1.24 , clause( 17, [ ~( =( 'least_upper_bound'( 'greatest_lower_bound'( a, b ),
% 0.87/1.24 c ), 'greatest_lower_bound'( a, b ) ) ) ] )
% 0.87/1.24 , 0, substitution( 0, [] )).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 paramod(
% 0.87/1.24 clause( 2868, [ ~( =( 'greatest_lower_bound'( a, b ), 'least_upper_bound'(
% 0.87/1.24 'greatest_lower_bound'( b, a ), c ) ) ) ] )
% 0.87/1.24 , clause( 3, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y
% 0.87/1.24 , X ) ) ] )
% 0.87/1.24 , 0, clause( 2866, [ ~( =( 'greatest_lower_bound'( a, b ),
% 0.87/1.24 'least_upper_bound'( 'greatest_lower_bound'( a, b ), c ) ) ) ] )
% 0.87/1.24 , 0, 6, substitution( 0, [ :=( X, a ), :=( Y, b )] ), substitution( 1, [] )
% 0.87/1.24 ).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 paramod(
% 0.87/1.24 clause( 2869, [ ~( =( 'greatest_lower_bound'( b, a ), 'least_upper_bound'(
% 0.87/1.24 'greatest_lower_bound'( b, a ), c ) ) ) ] )
% 0.87/1.24 , clause( 3, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y
% 0.87/1.24 , X ) ) ] )
% 0.87/1.24 , 0, clause( 2868, [ ~( =( 'greatest_lower_bound'( a, b ),
% 0.87/1.24 'least_upper_bound'( 'greatest_lower_bound'( b, a ), c ) ) ) ] )
% 0.87/1.24 , 0, 2, substitution( 0, [ :=( X, a ), :=( Y, b )] ), substitution( 1, [] )
% 0.87/1.24 ).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 eqswap(
% 0.87/1.24 clause( 2872, [ ~( =( 'least_upper_bound'( 'greatest_lower_bound'( b, a ),
% 0.87/1.24 c ), 'greatest_lower_bound'( b, a ) ) ) ] )
% 0.87/1.24 , clause( 2869, [ ~( =( 'greatest_lower_bound'( b, a ), 'least_upper_bound'(
% 0.87/1.24 'greatest_lower_bound'( b, a ), c ) ) ) ] )
% 0.87/1.24 , 0, substitution( 0, [] )).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 subsumption(
% 0.87/1.24 clause( 141, [ ~( =( 'least_upper_bound'( 'greatest_lower_bound'( b, a ), c
% 0.87/1.24 ), 'greatest_lower_bound'( b, a ) ) ) ] )
% 0.87/1.24 , clause( 2872, [ ~( =( 'least_upper_bound'( 'greatest_lower_bound'( b, a )
% 0.87/1.24 , c ), 'greatest_lower_bound'( b, a ) ) ) ] )
% 0.87/1.24 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 eqswap(
% 0.87/1.24 clause( 2875, [ ~( =( 'greatest_lower_bound'( b, a ), 'least_upper_bound'(
% 0.87/1.24 'greatest_lower_bound'( b, a ), c ) ) ) ] )
% 0.87/1.24 , clause( 141, [ ~( =( 'least_upper_bound'( 'greatest_lower_bound'( b, a )
% 0.87/1.24 , c ), 'greatest_lower_bound'( b, a ) ) ) ] )
% 0.87/1.24 , 0, substitution( 0, [] )).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 paramod(
% 0.87/1.24 clause( 2876, [ ~( =( 'greatest_lower_bound'( b, a ), 'least_upper_bound'(
% 0.87/1.24 c, 'greatest_lower_bound'( b, a ) ) ) ) ] )
% 0.87/1.24 , clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X )
% 0.87/1.24 ) ] )
% 0.87/1.24 , 0, clause( 2875, [ ~( =( 'greatest_lower_bound'( b, a ),
% 0.87/1.24 'least_upper_bound'( 'greatest_lower_bound'( b, a ), c ) ) ) ] )
% 0.87/1.24 , 0, 5, substitution( 0, [ :=( X, 'greatest_lower_bound'( b, a ) ), :=( Y,
% 0.87/1.24 c )] ), substitution( 1, [] )).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 eqswap(
% 0.87/1.24 clause( 2879, [ ~( =( 'least_upper_bound'( c, 'greatest_lower_bound'( b, a
% 0.87/1.24 ) ), 'greatest_lower_bound'( b, a ) ) ) ] )
% 0.87/1.24 , clause( 2876, [ ~( =( 'greatest_lower_bound'( b, a ), 'least_upper_bound'(
% 0.87/1.24 c, 'greatest_lower_bound'( b, a ) ) ) ) ] )
% 0.87/1.24 , 0, substitution( 0, [] )).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 subsumption(
% 0.87/1.24 clause( 214, [ ~( =( 'least_upper_bound'( c, 'greatest_lower_bound'( b, a )
% 0.87/1.24 ), 'greatest_lower_bound'( b, a ) ) ) ] )
% 0.87/1.24 , clause( 2879, [ ~( =( 'least_upper_bound'( c, 'greatest_lower_bound'( b,
% 0.87/1.24 a ) ), 'greatest_lower_bound'( b, a ) ) ) ] )
% 0.87/1.24 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 eqswap(
% 0.87/1.24 clause( 2881, [ =( 'greatest_lower_bound'( b, X ), 'least_upper_bound'(
% 0.87/1.24 'greatest_lower_bound'( X, c ), 'greatest_lower_bound'( b, X ) ) ) ] )
% 0.87/1.24 , clause( 117, [ =( 'least_upper_bound'( 'greatest_lower_bound'( X, c ),
% 0.87/1.24 'greatest_lower_bound'( b, X ) ), 'greatest_lower_bound'( b, X ) ) ] )
% 0.87/1.24 , 0, substitution( 0, [ :=( X, X )] )).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 eqswap(
% 0.87/1.24 clause( 2882, [ ~( =( 'greatest_lower_bound'( b, a ), 'least_upper_bound'(
% 0.87/1.24 c, 'greatest_lower_bound'( b, a ) ) ) ) ] )
% 0.87/1.24 , clause( 214, [ ~( =( 'least_upper_bound'( c, 'greatest_lower_bound'( b, a
% 0.87/1.24 ) ), 'greatest_lower_bound'( b, a ) ) ) ] )
% 0.87/1.24 , 0, substitution( 0, [] )).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 paramod(
% 0.87/1.24 clause( 2883, [ =( 'greatest_lower_bound'( b, a ), 'least_upper_bound'( c,
% 0.87/1.24 'greatest_lower_bound'( b, a ) ) ) ] )
% 0.87/1.24 , clause( 28, [ =( 'greatest_lower_bound'( a, c ), c ) ] )
% 0.87/1.24 , 0, clause( 2881, [ =( 'greatest_lower_bound'( b, X ), 'least_upper_bound'(
% 0.87/1.24 'greatest_lower_bound'( X, c ), 'greatest_lower_bound'( b, X ) ) ) ] )
% 0.87/1.24 , 0, 5, substitution( 0, [] ), substitution( 1, [ :=( X, a )] )).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 resolution(
% 0.87/1.24 clause( 2884, [] )
% 0.87/1.24 , clause( 2882, [ ~( =( 'greatest_lower_bound'( b, a ), 'least_upper_bound'(
% 0.87/1.24 c, 'greatest_lower_bound'( b, a ) ) ) ) ] )
% 0.87/1.24 , 0, clause( 2883, [ =( 'greatest_lower_bound'( b, a ), 'least_upper_bound'(
% 0.87/1.24 c, 'greatest_lower_bound'( b, a ) ) ) ] )
% 0.87/1.24 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 subsumption(
% 0.87/1.24 clause( 2692, [] )
% 0.87/1.24 , clause( 2884, [] )
% 0.87/1.24 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 end.
% 0.87/1.24
% 0.87/1.24 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.87/1.24
% 0.87/1.24 Memory use:
% 0.87/1.24
% 0.87/1.24 space for terms: 34970
% 0.87/1.24 space for clauses: 288897
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 clauses generated: 38963
% 0.87/1.24 clauses kept: 2693
% 0.87/1.24 clauses selected: 323
% 0.87/1.24 clauses deleted: 19
% 0.87/1.24 clauses inuse deleted: 6
% 0.87/1.24
% 0.87/1.24 subsentry: 5075
% 0.87/1.24 literals s-matched: 4607
% 0.87/1.24 literals matched: 4603
% 0.87/1.24 full subsumption: 0
% 0.87/1.24
% 0.87/1.24 checksum: -1908298261
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 Bliksem ended
%------------------------------------------------------------------------------