TSTP Solution File: GRP162-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : GRP162-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n026.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:39 EDT 2022
% Result : Unsatisfiable 0.48s 1.14s
% Output : Refutation 0.48s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GRP162-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.08/0.14 % Command : bliksem %s
% 0.14/0.35 % Computer : n026.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 05:21:20 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.48/1.14 *** allocated 10000 integers for termspace/termends
% 0.48/1.14 *** allocated 10000 integers for clauses
% 0.48/1.14 *** allocated 10000 integers for justifications
% 0.48/1.14 Bliksem 1.12
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14 Automatic Strategy Selection
% 0.48/1.14
% 0.48/1.14 Clauses:
% 0.48/1.14 [
% 0.48/1.14 [ =( multiply( identity, X ), X ) ],
% 0.48/1.14 [ =( multiply( inverse( X ), X ), identity ) ],
% 0.48/1.14 [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply( Y, Z ) ) )
% 0.48/1.14 ],
% 0.48/1.14 [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y, X ) ) ]
% 0.48/1.14 ,
% 0.48/1.14 [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X ) ) ],
% 0.48/1.14 [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.48/1.14 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ],
% 0.48/1.14 [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.48/1.14 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ],
% 0.48/1.14 [ =( 'least_upper_bound'( X, X ), X ) ],
% 0.48/1.14 [ =( 'greatest_lower_bound'( X, X ), X ) ],
% 0.48/1.14 [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) ), X ) ]
% 0.48/1.14 ,
% 0.48/1.14 [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) ), X ) ]
% 0.48/1.14 ,
% 0.48/1.14 [ =( multiply( X, 'least_upper_bound'( Y, Z ) ), 'least_upper_bound'(
% 0.48/1.14 multiply( X, Y ), multiply( X, Z ) ) ) ],
% 0.48/1.14 [ =( multiply( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.48/1.14 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ],
% 0.48/1.14 [ =( multiply( 'least_upper_bound'( X, Y ), Z ), 'least_upper_bound'(
% 0.48/1.14 multiply( X, Z ), multiply( Y, Z ) ) ) ],
% 0.48/1.14 [ =( multiply( 'greatest_lower_bound'( X, Y ), Z ),
% 0.48/1.14 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ],
% 0.48/1.14 [ =( 'least_upper_bound'( a, b ), b ) ],
% 0.48/1.14 [ =( 'least_upper_bound'( b, c ), c ) ],
% 0.48/1.14 [ ~( =( 'least_upper_bound'( a, c ), c ) ) ]
% 0.48/1.14 ] .
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14 percentage equality = 1.000000, percentage horn = 1.000000
% 0.48/1.14 This is a pure equality problem
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14 Options Used:
% 0.48/1.14
% 0.48/1.14 useres = 1
% 0.48/1.14 useparamod = 1
% 0.48/1.14 useeqrefl = 1
% 0.48/1.14 useeqfact = 1
% 0.48/1.14 usefactor = 1
% 0.48/1.14 usesimpsplitting = 0
% 0.48/1.14 usesimpdemod = 5
% 0.48/1.14 usesimpres = 3
% 0.48/1.14
% 0.48/1.14 resimpinuse = 1000
% 0.48/1.14 resimpclauses = 20000
% 0.48/1.14 substype = eqrewr
% 0.48/1.14 backwardsubs = 1
% 0.48/1.14 selectoldest = 5
% 0.48/1.14
% 0.48/1.14 litorderings [0] = split
% 0.48/1.14 litorderings [1] = extend the termordering, first sorting on arguments
% 0.48/1.14
% 0.48/1.14 termordering = kbo
% 0.48/1.14
% 0.48/1.14 litapriori = 0
% 0.48/1.14 termapriori = 1
% 0.48/1.14 litaposteriori = 0
% 0.48/1.14 termaposteriori = 0
% 0.48/1.14 demodaposteriori = 0
% 0.48/1.14 ordereqreflfact = 0
% 0.48/1.14
% 0.48/1.14 litselect = negord
% 0.48/1.14
% 0.48/1.14 maxweight = 15
% 0.48/1.14 maxdepth = 30000
% 0.48/1.14 maxlength = 115
% 0.48/1.14 maxnrvars = 195
% 0.48/1.14 excuselevel = 1
% 0.48/1.14 increasemaxweight = 1
% 0.48/1.14
% 0.48/1.14 maxselected = 10000000
% 0.48/1.14 maxnrclauses = 10000000
% 0.48/1.14
% 0.48/1.14 showgenerated = 0
% 0.48/1.14 showkept = 0
% 0.48/1.14 showselected = 0
% 0.48/1.14 showdeleted = 0
% 0.48/1.14 showresimp = 1
% 0.48/1.14 showstatus = 2000
% 0.48/1.14
% 0.48/1.14 prologoutput = 1
% 0.48/1.14 nrgoals = 5000000
% 0.48/1.14 totalproof = 1
% 0.48/1.14
% 0.48/1.14 Symbols occurring in the translation:
% 0.48/1.14
% 0.48/1.14 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.48/1.14 . [1, 2] (w:1, o:22, a:1, s:1, b:0),
% 0.48/1.14 ! [4, 1] (w:0, o:16, a:1, s:1, b:0),
% 0.48/1.14 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.48/1.14 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.48/1.14 identity [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.48/1.14 multiply [41, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.48/1.14 inverse [42, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.48/1.14 'greatest_lower_bound' [45, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.48/1.14 'least_upper_bound' [46, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.48/1.14 a [47, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.48/1.14 b [48, 0] (w:1, o:14, a:1, s:1, b:0),
% 0.48/1.14 c [49, 0] (w:1, o:15, a:1, s:1, b:0).
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14 Starting Search:
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14 Bliksems!, er is een bewijs:
% 0.48/1.14 % SZS status Unsatisfiable
% 0.48/1.14 % SZS output start Refutation
% 0.48/1.14
% 0.48/1.14 clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X ) )
% 0.48/1.14 ] )
% 0.48/1.14 .
% 0.48/1.14 clause( 6, [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.48/1.14 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.48/1.14 .
% 0.48/1.14 clause( 15, [ =( 'least_upper_bound'( a, b ), b ) ] )
% 0.48/1.14 .
% 0.48/1.14 clause( 16, [ =( 'least_upper_bound'( b, c ), c ) ] )
% 0.48/1.14 .
% 0.48/1.14 clause( 17, [ ~( =( 'least_upper_bound'( a, c ), c ) ) ] )
% 0.48/1.14 .
% 0.48/1.14 clause( 18, [ =( 'least_upper_bound'( b, a ), b ) ] )
% 0.48/1.14 .
% 0.48/1.14 clause( 19, [ =( 'least_upper_bound'( c, b ), c ) ] )
% 0.48/1.14 .
% 0.48/1.14 clause( 44, [ =( 'least_upper_bound'( 'least_upper_bound'( X, c ), b ),
% 0.48/1.14 'least_upper_bound'( X, c ) ) ] )
% 0.48/1.14 .
% 0.48/1.14 clause( 105, [ =( 'least_upper_bound'( 'least_upper_bound'( b, X ), c ),
% 0.48/1.14 'least_upper_bound'( X, c ) ) ] )
% 0.48/1.14 .
% 0.48/1.14 clause( 132, [ =( 'least_upper_bound'( a, c ), c ) ] )
% 0.48/1.14 .
% 0.48/1.14 clause( 133, [] )
% 0.48/1.14 .
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14 % SZS output end Refutation
% 0.48/1.14 found a proof!
% 0.48/1.14
% 0.48/1.14 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.48/1.14
% 0.48/1.14 initialclauses(
% 0.48/1.14 [ clause( 135, [ =( multiply( identity, X ), X ) ] )
% 0.48/1.14 , clause( 136, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.48/1.14 , clause( 137, [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply(
% 0.48/1.14 Y, Z ) ) ) ] )
% 0.48/1.14 , clause( 138, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'(
% 0.48/1.14 Y, X ) ) ] )
% 0.48/1.14 , clause( 139, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X
% 0.48/1.14 ) ) ] )
% 0.48/1.14 , clause( 140, [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z
% 0.48/1.14 ) ), 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.48/1.14 , clause( 141, [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.48/1.14 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.48/1.14 , clause( 142, [ =( 'least_upper_bound'( X, X ), X ) ] )
% 0.48/1.14 , clause( 143, [ =( 'greatest_lower_bound'( X, X ), X ) ] )
% 0.48/1.14 , clause( 144, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y )
% 0.48/1.14 ), X ) ] )
% 0.48/1.14 , clause( 145, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y )
% 0.48/1.14 ), X ) ] )
% 0.48/1.14 , clause( 146, [ =( multiply( X, 'least_upper_bound'( Y, Z ) ),
% 0.48/1.14 'least_upper_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ] )
% 0.48/1.14 , clause( 147, [ =( multiply( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.48/1.14 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ] )
% 0.48/1.14 , clause( 148, [ =( multiply( 'least_upper_bound'( X, Y ), Z ),
% 0.48/1.14 'least_upper_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ] )
% 0.48/1.14 , clause( 149, [ =( multiply( 'greatest_lower_bound'( X, Y ), Z ),
% 0.48/1.14 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ] )
% 0.48/1.14 , clause( 150, [ =( 'least_upper_bound'( a, b ), b ) ] )
% 0.48/1.14 , clause( 151, [ =( 'least_upper_bound'( b, c ), c ) ] )
% 0.48/1.14 , clause( 152, [ ~( =( 'least_upper_bound'( a, c ), c ) ) ] )
% 0.48/1.14 ] ).
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14 subsumption(
% 0.48/1.14 clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X ) )
% 0.48/1.14 ] )
% 0.48/1.14 , clause( 139, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X
% 0.48/1.14 ) ) ] )
% 0.48/1.14 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.48/1.14 )] ) ).
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14 subsumption(
% 0.48/1.14 clause( 6, [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.48/1.14 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.48/1.14 , clause( 141, [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.48/1.14 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.48/1.14 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.48/1.14 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14 subsumption(
% 0.48/1.14 clause( 15, [ =( 'least_upper_bound'( a, b ), b ) ] )
% 0.48/1.14 , clause( 150, [ =( 'least_upper_bound'( a, b ), b ) ] )
% 0.48/1.14 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14 subsumption(
% 0.48/1.14 clause( 16, [ =( 'least_upper_bound'( b, c ), c ) ] )
% 0.48/1.14 , clause( 151, [ =( 'least_upper_bound'( b, c ), c ) ] )
% 0.48/1.14 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14 subsumption(
% 0.48/1.14 clause( 17, [ ~( =( 'least_upper_bound'( a, c ), c ) ) ] )
% 0.48/1.14 , clause( 152, [ ~( =( 'least_upper_bound'( a, c ), c ) ) ] )
% 0.48/1.14 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14 eqswap(
% 0.48/1.14 clause( 206, [ =( b, 'least_upper_bound'( a, b ) ) ] )
% 0.48/1.14 , clause( 15, [ =( 'least_upper_bound'( a, b ), b ) ] )
% 0.48/1.14 , 0, substitution( 0, [] )).
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14 paramod(
% 0.48/1.14 clause( 207, [ =( b, 'least_upper_bound'( b, a ) ) ] )
% 0.48/1.14 , clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X )
% 0.48/1.14 ) ] )
% 0.48/1.14 , 0, clause( 206, [ =( b, 'least_upper_bound'( a, b ) ) ] )
% 0.48/1.14 , 0, 2, substitution( 0, [ :=( X, a ), :=( Y, b )] ), substitution( 1, [] )
% 0.48/1.14 ).
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14 eqswap(
% 0.48/1.14 clause( 210, [ =( 'least_upper_bound'( b, a ), b ) ] )
% 0.48/1.14 , clause( 207, [ =( b, 'least_upper_bound'( b, a ) ) ] )
% 0.48/1.14 , 0, substitution( 0, [] )).
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14 subsumption(
% 0.48/1.14 clause( 18, [ =( 'least_upper_bound'( b, a ), b ) ] )
% 0.48/1.14 , clause( 210, [ =( 'least_upper_bound'( b, a ), b ) ] )
% 0.48/1.14 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14 eqswap(
% 0.48/1.14 clause( 211, [ =( c, 'least_upper_bound'( b, c ) ) ] )
% 0.48/1.14 , clause( 16, [ =( 'least_upper_bound'( b, c ), c ) ] )
% 0.48/1.14 , 0, substitution( 0, [] )).
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14 paramod(
% 0.48/1.14 clause( 212, [ =( c, 'least_upper_bound'( c, b ) ) ] )
% 0.48/1.14 , clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X )
% 0.48/1.14 ) ] )
% 0.48/1.14 , 0, clause( 211, [ =( c, 'least_upper_bound'( b, c ) ) ] )
% 0.48/1.14 , 0, 2, substitution( 0, [ :=( X, b ), :=( Y, c )] ), substitution( 1, [] )
% 0.48/1.14 ).
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14 eqswap(
% 0.48/1.14 clause( 215, [ =( 'least_upper_bound'( c, b ), c ) ] )
% 0.48/1.14 , clause( 212, [ =( c, 'least_upper_bound'( c, b ) ) ] )
% 0.48/1.14 , 0, substitution( 0, [] )).
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14 subsumption(
% 0.48/1.14 clause( 19, [ =( 'least_upper_bound'( c, b ), c ) ] )
% 0.48/1.14 , clause( 215, [ =( 'least_upper_bound'( c, b ), c ) ] )
% 0.48/1.14 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14 eqswap(
% 0.48/1.14 clause( 217, [ =( 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ),
% 0.48/1.14 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ) ) ] )
% 0.48/1.14 , clause( 6, [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.48/1.14 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.48/1.14 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14 paramod(
% 0.48/1.14 clause( 219, [ =( 'least_upper_bound'( 'least_upper_bound'( X, c ), b ),
% 0.48/1.14 'least_upper_bound'( X, c ) ) ] )
% 0.48/1.14 , clause( 19, [ =( 'least_upper_bound'( c, b ), c ) ] )
% 0.48/1.14 , 0, clause( 217, [ =( 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z
% 0.48/1.14 ), 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ) ) ] )
% 0.48/1.14 , 0, 8, substitution( 0, [] ), substitution( 1, [ :=( X, X ), :=( Y, c ),
% 0.48/1.14 :=( Z, b )] )).
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14 subsumption(
% 0.48/1.14 clause( 44, [ =( 'least_upper_bound'( 'least_upper_bound'( X, c ), b ),
% 0.48/1.14 'least_upper_bound'( X, c ) ) ] )
% 0.48/1.14 , clause( 219, [ =( 'least_upper_bound'( 'least_upper_bound'( X, c ), b ),
% 0.48/1.14 'least_upper_bound'( X, c ) ) ] )
% 0.48/1.14 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14 eqswap(
% 0.48/1.14 clause( 222, [ =( 'least_upper_bound'( X, c ), 'least_upper_bound'(
% 0.48/1.14 'least_upper_bound'( X, c ), b ) ) ] )
% 0.48/1.14 , clause( 44, [ =( 'least_upper_bound'( 'least_upper_bound'( X, c ), b ),
% 0.48/1.14 'least_upper_bound'( X, c ) ) ] )
% 0.48/1.14 , 0, substitution( 0, [ :=( X, X )] )).
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14 paramod(
% 0.48/1.14 clause( 226, [ =( 'least_upper_bound'( X, c ), 'least_upper_bound'( b,
% 0.48/1.14 'least_upper_bound'( X, c ) ) ) ] )
% 0.48/1.14 , clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X )
% 0.48/1.14 ) ] )
% 0.48/1.14 , 0, clause( 222, [ =( 'least_upper_bound'( X, c ), 'least_upper_bound'(
% 0.48/1.14 'least_upper_bound'( X, c ), b ) ) ] )
% 0.48/1.14 , 0, 4, substitution( 0, [ :=( X, 'least_upper_bound'( X, c ) ), :=( Y, b )] )
% 0.48/1.14 , substitution( 1, [ :=( X, X )] )).
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14 paramod(
% 0.48/1.14 clause( 232, [ =( 'least_upper_bound'( X, c ), 'least_upper_bound'(
% 0.48/1.14 'least_upper_bound'( b, X ), c ) ) ] )
% 0.48/1.14 , clause( 6, [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.48/1.14 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.48/1.14 , 0, clause( 226, [ =( 'least_upper_bound'( X, c ), 'least_upper_bound'( b
% 0.48/1.14 , 'least_upper_bound'( X, c ) ) ) ] )
% 0.48/1.14 , 0, 4, substitution( 0, [ :=( X, b ), :=( Y, X ), :=( Z, c )] ),
% 0.48/1.14 substitution( 1, [ :=( X, X )] )).
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14 eqswap(
% 0.48/1.14 clause( 233, [ =( 'least_upper_bound'( 'least_upper_bound'( b, X ), c ),
% 0.48/1.14 'least_upper_bound'( X, c ) ) ] )
% 0.48/1.14 , clause( 232, [ =( 'least_upper_bound'( X, c ), 'least_upper_bound'(
% 0.48/1.14 'least_upper_bound'( b, X ), c ) ) ] )
% 0.48/1.14 , 0, substitution( 0, [ :=( X, X )] )).
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14 subsumption(
% 0.48/1.14 clause( 105, [ =( 'least_upper_bound'( 'least_upper_bound'( b, X ), c ),
% 0.48/1.14 'least_upper_bound'( X, c ) ) ] )
% 0.48/1.14 , clause( 233, [ =( 'least_upper_bound'( 'least_upper_bound'( b, X ), c ),
% 0.48/1.14 'least_upper_bound'( X, c ) ) ] )
% 0.48/1.14 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14 eqswap(
% 0.48/1.14 clause( 235, [ =( 'least_upper_bound'( X, c ), 'least_upper_bound'(
% 0.48/1.14 'least_upper_bound'( b, X ), c ) ) ] )
% 0.48/1.14 , clause( 105, [ =( 'least_upper_bound'( 'least_upper_bound'( b, X ), c ),
% 0.48/1.14 'least_upper_bound'( X, c ) ) ] )
% 0.48/1.14 , 0, substitution( 0, [ :=( X, X )] )).
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14 paramod(
% 0.48/1.14 clause( 237, [ =( 'least_upper_bound'( a, c ), 'least_upper_bound'( b, c )
% 0.48/1.14 ) ] )
% 0.48/1.14 , clause( 18, [ =( 'least_upper_bound'( b, a ), b ) ] )
% 0.48/1.14 , 0, clause( 235, [ =( 'least_upper_bound'( X, c ), 'least_upper_bound'(
% 0.48/1.14 'least_upper_bound'( b, X ), c ) ) ] )
% 0.48/1.14 , 0, 5, substitution( 0, [] ), substitution( 1, [ :=( X, a )] )).
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14 paramod(
% 0.48/1.14 clause( 238, [ =( 'least_upper_bound'( a, c ), c ) ] )
% 0.48/1.14 , clause( 16, [ =( 'least_upper_bound'( b, c ), c ) ] )
% 0.48/1.14 , 0, clause( 237, [ =( 'least_upper_bound'( a, c ), 'least_upper_bound'( b
% 0.48/1.14 , c ) ) ] )
% 0.48/1.14 , 0, 4, substitution( 0, [] ), substitution( 1, [] )).
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14 subsumption(
% 0.48/1.14 clause( 132, [ =( 'least_upper_bound'( a, c ), c ) ] )
% 0.48/1.14 , clause( 238, [ =( 'least_upper_bound'( a, c ), c ) ] )
% 0.48/1.14 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14 resolution(
% 0.48/1.14 clause( 242, [] )
% 0.48/1.14 , clause( 17, [ ~( =( 'least_upper_bound'( a, c ), c ) ) ] )
% 0.48/1.14 , 0, clause( 132, [ =( 'least_upper_bound'( a, c ), c ) ] )
% 0.48/1.14 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14 subsumption(
% 0.48/1.14 clause( 133, [] )
% 0.48/1.14 , clause( 242, [] )
% 0.48/1.14 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14 end.
% 0.48/1.14
% 0.48/1.14 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.48/1.14
% 0.48/1.14 Memory use:
% 0.48/1.14
% 0.48/1.14 space for terms: 1761
% 0.48/1.14 space for clauses: 14131
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14 clauses generated: 719
% 0.48/1.14 clauses kept: 134
% 0.48/1.14 clauses selected: 44
% 0.48/1.14 clauses deleted: 1
% 0.48/1.14 clauses inuse deleted: 0
% 0.48/1.14
% 0.48/1.14 subsentry: 621
% 0.48/1.14 literals s-matched: 271
% 0.48/1.14 literals matched: 271
% 0.48/1.14 full subsumption: 0
% 0.48/1.14
% 0.48/1.14 checksum: 1724789008
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14 Bliksem ended
%------------------------------------------------------------------------------