TSTP Solution File: GRP141-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : GRP141-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n029.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:33 EDT 2022
% Result : Unsatisfiable 0.43s 1.06s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP141-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n029.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % DateTime : Tue Jun 14 02:14:40 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.43/1.06 *** allocated 10000 integers for termspace/termends
% 0.43/1.06 *** allocated 10000 integers for clauses
% 0.43/1.06 *** allocated 10000 integers for justifications
% 0.43/1.06 Bliksem 1.12
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 Automatic Strategy Selection
% 0.43/1.06
% 0.43/1.06 Clauses:
% 0.43/1.06 [
% 0.43/1.06 [ =( multiply( identity, X ), X ) ],
% 0.43/1.06 [ =( multiply( inverse( X ), X ), identity ) ],
% 0.43/1.06 [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply( Y, Z ) ) )
% 0.43/1.06 ],
% 0.43/1.06 [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y, X ) ) ]
% 0.43/1.06 ,
% 0.43/1.06 [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X ) ) ],
% 0.43/1.06 [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.43/1.06 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ],
% 0.43/1.06 [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.43/1.06 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ],
% 0.43/1.06 [ =( 'least_upper_bound'( X, X ), X ) ],
% 0.43/1.06 [ =( 'greatest_lower_bound'( X, X ), X ) ],
% 0.43/1.06 [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) ), X ) ]
% 0.43/1.06 ,
% 0.43/1.06 [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) ), X ) ]
% 0.43/1.06 ,
% 0.43/1.06 [ =( multiply( X, 'least_upper_bound'( Y, Z ) ), 'least_upper_bound'(
% 0.43/1.06 multiply( X, Y ), multiply( X, Z ) ) ) ],
% 0.43/1.06 [ =( multiply( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.43/1.06 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ],
% 0.43/1.06 [ =( multiply( 'least_upper_bound'( X, Y ), Z ), 'least_upper_bound'(
% 0.43/1.06 multiply( X, Z ), multiply( Y, Z ) ) ) ],
% 0.43/1.06 [ =( multiply( 'greatest_lower_bound'( X, Y ), Z ),
% 0.43/1.06 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ],
% 0.43/1.06 [ =( 'least_upper_bound'( a, c ), a ) ],
% 0.43/1.06 [ =( 'least_upper_bound'( b, c ), b ) ],
% 0.43/1.06 [ ~( =( 'greatest_lower_bound'( 'greatest_lower_bound'( a, b ), c ), c )
% 0.43/1.06 ) ]
% 0.43/1.06 ] .
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 percentage equality = 1.000000, percentage horn = 1.000000
% 0.43/1.06 This is a pure equality problem
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 Options Used:
% 0.43/1.06
% 0.43/1.06 useres = 1
% 0.43/1.06 useparamod = 1
% 0.43/1.06 useeqrefl = 1
% 0.43/1.06 useeqfact = 1
% 0.43/1.06 usefactor = 1
% 0.43/1.06 usesimpsplitting = 0
% 0.43/1.06 usesimpdemod = 5
% 0.43/1.06 usesimpres = 3
% 0.43/1.06
% 0.43/1.06 resimpinuse = 1000
% 0.43/1.06 resimpclauses = 20000
% 0.43/1.06 substype = eqrewr
% 0.43/1.06 backwardsubs = 1
% 0.43/1.06 selectoldest = 5
% 0.43/1.06
% 0.43/1.06 litorderings [0] = split
% 0.43/1.06 litorderings [1] = extend the termordering, first sorting on arguments
% 0.43/1.06
% 0.43/1.06 termordering = kbo
% 0.43/1.06
% 0.43/1.06 litapriori = 0
% 0.43/1.06 termapriori = 1
% 0.43/1.06 litaposteriori = 0
% 0.43/1.06 termaposteriori = 0
% 0.43/1.06 demodaposteriori = 0
% 0.43/1.06 ordereqreflfact = 0
% 0.43/1.06
% 0.43/1.06 litselect = negord
% 0.43/1.06
% 0.43/1.06 maxweight = 15
% 0.43/1.06 maxdepth = 30000
% 0.43/1.06 maxlength = 115
% 0.43/1.06 maxnrvars = 195
% 0.43/1.06 excuselevel = 1
% 0.43/1.06 increasemaxweight = 1
% 0.43/1.06
% 0.43/1.06 maxselected = 10000000
% 0.43/1.06 maxnrclauses = 10000000
% 0.43/1.06
% 0.43/1.06 showgenerated = 0
% 0.43/1.06 showkept = 0
% 0.43/1.06 showselected = 0
% 0.43/1.06 showdeleted = 0
% 0.43/1.06 showresimp = 1
% 0.43/1.06 showstatus = 2000
% 0.43/1.06
% 0.43/1.06 prologoutput = 1
% 0.43/1.06 nrgoals = 5000000
% 0.43/1.06 totalproof = 1
% 0.43/1.06
% 0.43/1.06 Symbols occurring in the translation:
% 0.43/1.06
% 0.43/1.06 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.43/1.06 . [1, 2] (w:1, o:22, a:1, s:1, b:0),
% 0.43/1.06 ! [4, 1] (w:0, o:16, a:1, s:1, b:0),
% 0.43/1.06 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.43/1.06 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.43/1.06 identity [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.43/1.06 multiply [41, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.43/1.06 inverse [42, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.43/1.06 'greatest_lower_bound' [45, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.43/1.06 'least_upper_bound' [46, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.43/1.06 a [47, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.43/1.06 c [48, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.43/1.06 b [49, 0] (w:1, o:14, a:1, s:1, b:0).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 Starting Search:
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 Bliksems!, er is een bewijs:
% 0.43/1.06 % SZS status Unsatisfiable
% 0.43/1.06 % SZS output start Refutation
% 0.43/1.06
% 0.43/1.06 clause( 3, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y,
% 0.43/1.06 X ) ) ] )
% 0.43/1.06 .
% 0.43/1.06 clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X ) )
% 0.43/1.06 ] )
% 0.43/1.06 .
% 0.43/1.06 clause( 5, [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z ) )
% 0.43/1.06 , 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.43/1.06 .
% 0.43/1.06 clause( 10, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) ),
% 0.43/1.06 X ) ] )
% 0.43/1.06 .
% 0.43/1.06 clause( 15, [ =( 'least_upper_bound'( a, c ), a ) ] )
% 0.43/1.06 .
% 0.43/1.06 clause( 16, [ =( 'least_upper_bound'( b, c ), b ) ] )
% 0.43/1.06 .
% 0.43/1.06 clause( 17, [ ~( =( 'greatest_lower_bound'( 'greatest_lower_bound'( a, b )
% 0.43/1.06 , c ), c ) ) ] )
% 0.43/1.06 .
% 0.43/1.06 clause( 18, [ =( 'least_upper_bound'( c, a ), a ) ] )
% 0.43/1.06 .
% 0.43/1.06 clause( 19, [ =( 'least_upper_bound'( c, b ), b ) ] )
% 0.43/1.06 .
% 0.43/1.06 clause( 24, [ =( 'greatest_lower_bound'( c, b ), c ) ] )
% 0.43/1.06 .
% 0.43/1.06 clause( 25, [ =( 'greatest_lower_bound'( c, a ), c ) ] )
% 0.43/1.06 .
% 0.43/1.06 clause( 27, [ =( 'greatest_lower_bound'( b, c ), c ) ] )
% 0.43/1.06 .
% 0.43/1.06 clause( 28, [ =( 'greatest_lower_bound'( a, c ), c ) ] )
% 0.43/1.06 .
% 0.43/1.06 clause( 30, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( X, b ), c
% 0.43/1.06 ), 'greatest_lower_bound'( X, c ) ) ] )
% 0.43/1.06 .
% 0.43/1.06 clause( 77, [] )
% 0.43/1.06 .
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 % SZS output end Refutation
% 0.43/1.06 found a proof!
% 0.43/1.06
% 0.43/1.06 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.43/1.06
% 0.43/1.06 initialclauses(
% 0.43/1.06 [ clause( 79, [ =( multiply( identity, X ), X ) ] )
% 0.43/1.06 , clause( 80, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.43/1.06 , clause( 81, [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply(
% 0.43/1.06 Y, Z ) ) ) ] )
% 0.43/1.06 , clause( 82, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'(
% 0.43/1.06 Y, X ) ) ] )
% 0.43/1.06 , clause( 83, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X )
% 0.43/1.06 ) ] )
% 0.43/1.06 , clause( 84, [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z
% 0.43/1.06 ) ), 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.43/1.06 , clause( 85, [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.43/1.06 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.43/1.06 , clause( 86, [ =( 'least_upper_bound'( X, X ), X ) ] )
% 0.43/1.06 , clause( 87, [ =( 'greatest_lower_bound'( X, X ), X ) ] )
% 0.43/1.06 , clause( 88, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) )
% 0.43/1.06 , X ) ] )
% 0.43/1.06 , clause( 89, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) )
% 0.43/1.06 , X ) ] )
% 0.43/1.06 , clause( 90, [ =( multiply( X, 'least_upper_bound'( Y, Z ) ),
% 0.43/1.06 'least_upper_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ] )
% 0.43/1.06 , clause( 91, [ =( multiply( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.43/1.06 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ] )
% 0.43/1.06 , clause( 92, [ =( multiply( 'least_upper_bound'( X, Y ), Z ),
% 0.43/1.06 'least_upper_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ] )
% 0.43/1.06 , clause( 93, [ =( multiply( 'greatest_lower_bound'( X, Y ), Z ),
% 0.43/1.06 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ] )
% 0.43/1.06 , clause( 94, [ =( 'least_upper_bound'( a, c ), a ) ] )
% 0.43/1.06 , clause( 95, [ =( 'least_upper_bound'( b, c ), b ) ] )
% 0.43/1.06 , clause( 96, [ ~( =( 'greatest_lower_bound'( 'greatest_lower_bound'( a, b
% 0.43/1.06 ), c ), c ) ) ] )
% 0.43/1.06 ] ).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 subsumption(
% 0.43/1.06 clause( 3, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y,
% 0.43/1.06 X ) ) ] )
% 0.43/1.06 , clause( 82, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'(
% 0.43/1.06 Y, X ) ) ] )
% 0.43/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.43/1.06 )] ) ).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 subsumption(
% 0.43/1.06 clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X ) )
% 0.43/1.06 ] )
% 0.43/1.06 , clause( 83, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X )
% 0.43/1.06 ) ] )
% 0.43/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.43/1.06 )] ) ).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 subsumption(
% 0.43/1.06 clause( 5, [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z ) )
% 0.43/1.06 , 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.43/1.06 , clause( 84, [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z
% 0.43/1.06 ) ), 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.43/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.43/1.06 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 subsumption(
% 0.43/1.06 clause( 10, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) ),
% 0.43/1.06 X ) ] )
% 0.43/1.06 , clause( 89, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) )
% 0.43/1.06 , X ) ] )
% 0.43/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.43/1.06 )] ) ).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 subsumption(
% 0.43/1.06 clause( 15, [ =( 'least_upper_bound'( a, c ), a ) ] )
% 0.43/1.06 , clause( 94, [ =( 'least_upper_bound'( a, c ), a ) ] )
% 0.43/1.06 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 subsumption(
% 0.43/1.06 clause( 16, [ =( 'least_upper_bound'( b, c ), b ) ] )
% 0.43/1.06 , clause( 95, [ =( 'least_upper_bound'( b, c ), b ) ] )
% 0.43/1.06 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 subsumption(
% 0.43/1.06 clause( 17, [ ~( =( 'greatest_lower_bound'( 'greatest_lower_bound'( a, b )
% 0.43/1.06 , c ), c ) ) ] )
% 0.43/1.06 , clause( 96, [ ~( =( 'greatest_lower_bound'( 'greatest_lower_bound'( a, b
% 0.43/1.06 ), c ), c ) ) ] )
% 0.43/1.06 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 eqswap(
% 0.43/1.06 clause( 161, [ =( a, 'least_upper_bound'( a, c ) ) ] )
% 0.43/1.06 , clause( 15, [ =( 'least_upper_bound'( a, c ), a ) ] )
% 0.43/1.06 , 0, substitution( 0, [] )).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 paramod(
% 0.43/1.06 clause( 162, [ =( a, 'least_upper_bound'( c, a ) ) ] )
% 0.43/1.06 , clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X )
% 0.43/1.06 ) ] )
% 0.43/1.06 , 0, clause( 161, [ =( a, 'least_upper_bound'( a, c ) ) ] )
% 0.43/1.06 , 0, 2, substitution( 0, [ :=( X, a ), :=( Y, c )] ), substitution( 1, [] )
% 0.43/1.06 ).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 eqswap(
% 0.43/1.06 clause( 165, [ =( 'least_upper_bound'( c, a ), a ) ] )
% 0.43/1.06 , clause( 162, [ =( a, 'least_upper_bound'( c, a ) ) ] )
% 0.43/1.06 , 0, substitution( 0, [] )).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 subsumption(
% 0.43/1.06 clause( 18, [ =( 'least_upper_bound'( c, a ), a ) ] )
% 0.43/1.06 , clause( 165, [ =( 'least_upper_bound'( c, a ), a ) ] )
% 0.43/1.06 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 eqswap(
% 0.43/1.06 clause( 166, [ =( b, 'least_upper_bound'( b, c ) ) ] )
% 0.43/1.06 , clause( 16, [ =( 'least_upper_bound'( b, c ), b ) ] )
% 0.43/1.06 , 0, substitution( 0, [] )).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 paramod(
% 0.43/1.06 clause( 167, [ =( b, 'least_upper_bound'( c, b ) ) ] )
% 0.43/1.06 , clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X )
% 0.43/1.06 ) ] )
% 0.43/1.06 , 0, clause( 166, [ =( b, 'least_upper_bound'( b, c ) ) ] )
% 0.43/1.06 , 0, 2, substitution( 0, [ :=( X, b ), :=( Y, c )] ), substitution( 1, [] )
% 0.43/1.06 ).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 eqswap(
% 0.43/1.06 clause( 170, [ =( 'least_upper_bound'( c, b ), b ) ] )
% 0.43/1.06 , clause( 167, [ =( b, 'least_upper_bound'( c, b ) ) ] )
% 0.43/1.06 , 0, substitution( 0, [] )).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 subsumption(
% 0.43/1.06 clause( 19, [ =( 'least_upper_bound'( c, b ), b ) ] )
% 0.43/1.06 , clause( 170, [ =( 'least_upper_bound'( c, b ), b ) ] )
% 0.43/1.06 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 eqswap(
% 0.43/1.06 clause( 172, [ =( X, 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y )
% 0.43/1.06 ) ) ] )
% 0.43/1.06 , clause( 10, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) )
% 0.43/1.06 , X ) ] )
% 0.43/1.06 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 paramod(
% 0.43/1.06 clause( 173, [ =( c, 'greatest_lower_bound'( c, b ) ) ] )
% 0.43/1.06 , clause( 19, [ =( 'least_upper_bound'( c, b ), b ) ] )
% 0.43/1.06 , 0, clause( 172, [ =( X, 'greatest_lower_bound'( X, 'least_upper_bound'( X
% 0.43/1.06 , Y ) ) ) ] )
% 0.43/1.06 , 0, 4, substitution( 0, [] ), substitution( 1, [ :=( X, c ), :=( Y, b )] )
% 0.43/1.06 ).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 eqswap(
% 0.43/1.06 clause( 174, [ =( 'greatest_lower_bound'( c, b ), c ) ] )
% 0.43/1.06 , clause( 173, [ =( c, 'greatest_lower_bound'( c, b ) ) ] )
% 0.43/1.06 , 0, substitution( 0, [] )).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 subsumption(
% 0.43/1.06 clause( 24, [ =( 'greatest_lower_bound'( c, b ), c ) ] )
% 0.43/1.06 , clause( 174, [ =( 'greatest_lower_bound'( c, b ), c ) ] )
% 0.43/1.06 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 eqswap(
% 0.43/1.06 clause( 176, [ =( X, 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y )
% 0.43/1.06 ) ) ] )
% 0.43/1.06 , clause( 10, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) )
% 0.43/1.06 , X ) ] )
% 0.43/1.06 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 paramod(
% 0.43/1.06 clause( 177, [ =( c, 'greatest_lower_bound'( c, a ) ) ] )
% 0.43/1.06 , clause( 18, [ =( 'least_upper_bound'( c, a ), a ) ] )
% 0.43/1.06 , 0, clause( 176, [ =( X, 'greatest_lower_bound'( X, 'least_upper_bound'( X
% 0.43/1.06 , Y ) ) ) ] )
% 0.43/1.06 , 0, 4, substitution( 0, [] ), substitution( 1, [ :=( X, c ), :=( Y, a )] )
% 0.43/1.06 ).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 eqswap(
% 0.43/1.06 clause( 178, [ =( 'greatest_lower_bound'( c, a ), c ) ] )
% 0.43/1.06 , clause( 177, [ =( c, 'greatest_lower_bound'( c, a ) ) ] )
% 0.43/1.06 , 0, substitution( 0, [] )).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 subsumption(
% 0.43/1.06 clause( 25, [ =( 'greatest_lower_bound'( c, a ), c ) ] )
% 0.43/1.06 , clause( 178, [ =( 'greatest_lower_bound'( c, a ), c ) ] )
% 0.43/1.06 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 eqswap(
% 0.43/1.06 clause( 179, [ =( c, 'greatest_lower_bound'( c, b ) ) ] )
% 0.43/1.06 , clause( 24, [ =( 'greatest_lower_bound'( c, b ), c ) ] )
% 0.43/1.06 , 0, substitution( 0, [] )).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 paramod(
% 0.43/1.06 clause( 180, [ =( c, 'greatest_lower_bound'( b, c ) ) ] )
% 0.43/1.06 , clause( 3, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y
% 0.43/1.06 , X ) ) ] )
% 0.43/1.06 , 0, clause( 179, [ =( c, 'greatest_lower_bound'( c, b ) ) ] )
% 0.43/1.06 , 0, 2, substitution( 0, [ :=( X, c ), :=( Y, b )] ), substitution( 1, [] )
% 0.43/1.06 ).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 eqswap(
% 0.43/1.06 clause( 183, [ =( 'greatest_lower_bound'( b, c ), c ) ] )
% 0.43/1.06 , clause( 180, [ =( c, 'greatest_lower_bound'( b, c ) ) ] )
% 0.43/1.06 , 0, substitution( 0, [] )).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 subsumption(
% 0.43/1.06 clause( 27, [ =( 'greatest_lower_bound'( b, c ), c ) ] )
% 0.43/1.06 , clause( 183, [ =( 'greatest_lower_bound'( b, c ), c ) ] )
% 0.43/1.06 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 eqswap(
% 0.43/1.06 clause( 184, [ =( c, 'greatest_lower_bound'( c, a ) ) ] )
% 0.43/1.06 , clause( 25, [ =( 'greatest_lower_bound'( c, a ), c ) ] )
% 0.43/1.06 , 0, substitution( 0, [] )).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 paramod(
% 0.43/1.06 clause( 185, [ =( c, 'greatest_lower_bound'( a, c ) ) ] )
% 0.43/1.06 , clause( 3, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y
% 0.43/1.06 , X ) ) ] )
% 0.43/1.06 , 0, clause( 184, [ =( c, 'greatest_lower_bound'( c, a ) ) ] )
% 0.43/1.06 , 0, 2, substitution( 0, [ :=( X, c ), :=( Y, a )] ), substitution( 1, [] )
% 0.43/1.06 ).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 eqswap(
% 0.43/1.06 clause( 188, [ =( 'greatest_lower_bound'( a, c ), c ) ] )
% 0.43/1.06 , clause( 185, [ =( c, 'greatest_lower_bound'( a, c ) ) ] )
% 0.43/1.06 , 0, substitution( 0, [] )).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 subsumption(
% 0.43/1.06 clause( 28, [ =( 'greatest_lower_bound'( a, c ), c ) ] )
% 0.43/1.06 , clause( 188, [ =( 'greatest_lower_bound'( a, c ), c ) ] )
% 0.43/1.06 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 eqswap(
% 0.43/1.06 clause( 190, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z
% 0.43/1.06 ), 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z ) ) ) ] )
% 0.43/1.06 , clause( 5, [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z )
% 0.43/1.06 ), 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.43/1.06 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 paramod(
% 0.43/1.06 clause( 192, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( X, b ), c
% 0.43/1.06 ), 'greatest_lower_bound'( X, c ) ) ] )
% 0.43/1.06 , clause( 27, [ =( 'greatest_lower_bound'( b, c ), c ) ] )
% 0.43/1.06 , 0, clause( 190, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y
% 0.43/1.06 ), Z ), 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z ) ) ) ]
% 0.43/1.06 )
% 0.43/1.06 , 0, 8, substitution( 0, [] ), substitution( 1, [ :=( X, X ), :=( Y, b ),
% 0.43/1.06 :=( Z, c )] )).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 subsumption(
% 0.43/1.06 clause( 30, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( X, b ), c
% 0.43/1.06 ), 'greatest_lower_bound'( X, c ) ) ] )
% 0.43/1.06 , clause( 192, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( X, b )
% 0.43/1.06 , c ), 'greatest_lower_bound'( X, c ) ) ] )
% 0.43/1.06 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 paramod(
% 0.43/1.06 clause( 198, [ ~( =( 'greatest_lower_bound'( a, c ), c ) ) ] )
% 0.43/1.06 , clause( 30, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( X, b ),
% 0.43/1.06 c ), 'greatest_lower_bound'( X, c ) ) ] )
% 0.43/1.06 , 0, clause( 17, [ ~( =( 'greatest_lower_bound'( 'greatest_lower_bound'( a
% 0.43/1.06 , b ), c ), c ) ) ] )
% 0.43/1.06 , 0, 2, substitution( 0, [ :=( X, a )] ), substitution( 1, [] )).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 paramod(
% 0.43/1.06 clause( 199, [ ~( =( c, c ) ) ] )
% 0.43/1.06 , clause( 28, [ =( 'greatest_lower_bound'( a, c ), c ) ] )
% 0.43/1.06 , 0, clause( 198, [ ~( =( 'greatest_lower_bound'( a, c ), c ) ) ] )
% 0.43/1.06 , 0, 2, substitution( 0, [] ), substitution( 1, [] )).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 eqrefl(
% 0.43/1.06 clause( 200, [] )
% 0.43/1.06 , clause( 199, [ ~( =( c, c ) ) ] )
% 0.43/1.06 , 0, substitution( 0, [] )).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 subsumption(
% 0.43/1.06 clause( 77, [] )
% 0.43/1.06 , clause( 200, [] )
% 0.43/1.06 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 end.
% 0.43/1.06
% 0.43/1.06 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.43/1.06
% 0.43/1.06 Memory use:
% 0.43/1.06
% 0.43/1.06 space for terms: 1126
% 0.43/1.06 space for clauses: 7963
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 clauses generated: 330
% 0.43/1.06 clauses kept: 78
% 0.43/1.06 clauses selected: 26
% 0.43/1.06 clauses deleted: 1
% 0.43/1.06 clauses inuse deleted: 0
% 0.43/1.06
% 0.43/1.06 subsentry: 537
% 0.43/1.06 literals s-matched: 266
% 0.43/1.06 literals matched: 266
% 0.43/1.06 full subsumption: 0
% 0.43/1.06
% 0.43/1.06 checksum: -477873014
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 Bliksem ended
%------------------------------------------------------------------------------