TSTP Solution File: GRP193-2 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : GRP193-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n012.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:36:03 EDT 2022
% Result : Unsatisfiable 0.71s 1.24s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GRP193-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.04/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n012.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 09:08:40 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.71/1.24 *** allocated 10000 integers for termspace/termends
% 0.71/1.24 *** allocated 10000 integers for clauses
% 0.71/1.24 *** allocated 10000 integers for justifications
% 0.71/1.24 Bliksem 1.12
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 Automatic Strategy Selection
% 0.71/1.24
% 0.71/1.24 Clauses:
% 0.71/1.24 [
% 0.71/1.24 [ =( multiply( identity, X ), X ) ],
% 0.71/1.24 [ =( multiply( inverse( X ), X ), identity ) ],
% 0.71/1.24 [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply( Y, Z ) ) )
% 0.71/1.24 ],
% 0.71/1.24 [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y, X ) ) ]
% 0.71/1.24 ,
% 0.71/1.24 [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X ) ) ],
% 0.71/1.24 [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.71/1.24 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ],
% 0.71/1.24 [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.71/1.24 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ],
% 0.71/1.24 [ =( 'least_upper_bound'( X, X ), X ) ],
% 0.71/1.24 [ =( 'greatest_lower_bound'( X, X ), X ) ],
% 0.71/1.24 [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) ), X ) ]
% 0.71/1.24 ,
% 0.71/1.24 [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) ), X ) ]
% 0.71/1.24 ,
% 0.71/1.24 [ =( multiply( X, 'least_upper_bound'( Y, Z ) ), 'least_upper_bound'(
% 0.71/1.24 multiply( X, Y ), multiply( X, Z ) ) ) ],
% 0.71/1.24 [ =( multiply( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.71/1.24 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ],
% 0.71/1.24 [ =( multiply( 'least_upper_bound'( X, Y ), Z ), 'least_upper_bound'(
% 0.71/1.24 multiply( X, Z ), multiply( Y, Z ) ) ) ],
% 0.71/1.24 [ =( multiply( 'greatest_lower_bound'( X, Y ), Z ),
% 0.71/1.24 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ],
% 0.71/1.24 [ =( 'greatest_lower_bound'( identity, a ), identity ) ],
% 0.71/1.24 [ =( 'greatest_lower_bound'( identity, b ), identity ) ],
% 0.71/1.24 [ =( 'greatest_lower_bound'( identity, c ), identity ) ],
% 0.71/1.24 [ =( 'greatest_lower_bound'( a, b ), identity ) ],
% 0.71/1.24 [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( a, multiply( b, c )
% 0.71/1.24 ), multiply( 'greatest_lower_bound'( a, b ), 'greatest_lower_bound'( a,
% 0.71/1.24 c ) ) ), 'greatest_lower_bound'( a, multiply( b, c ) ) ) ],
% 0.71/1.24 [ ~( =( 'greatest_lower_bound'( a, multiply( b, c ) ),
% 0.71/1.24 'greatest_lower_bound'( a, c ) ) ) ]
% 0.71/1.24 ] .
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 percentage equality = 1.000000, percentage horn = 1.000000
% 0.71/1.24 This is a pure equality problem
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 Options Used:
% 0.71/1.24
% 0.71/1.24 useres = 1
% 0.71/1.24 useparamod = 1
% 0.71/1.24 useeqrefl = 1
% 0.71/1.24 useeqfact = 1
% 0.71/1.24 usefactor = 1
% 0.71/1.24 usesimpsplitting = 0
% 0.71/1.24 usesimpdemod = 5
% 0.71/1.24 usesimpres = 3
% 0.71/1.24
% 0.71/1.24 resimpinuse = 1000
% 0.71/1.24 resimpclauses = 20000
% 0.71/1.24 substype = eqrewr
% 0.71/1.24 backwardsubs = 1
% 0.71/1.24 selectoldest = 5
% 0.71/1.24
% 0.71/1.24 litorderings [0] = split
% 0.71/1.24 litorderings [1] = extend the termordering, first sorting on arguments
% 0.71/1.24
% 0.71/1.24 termordering = kbo
% 0.71/1.24
% 0.71/1.24 litapriori = 0
% 0.71/1.24 termapriori = 1
% 0.71/1.24 litaposteriori = 0
% 0.71/1.24 termaposteriori = 0
% 0.71/1.24 demodaposteriori = 0
% 0.71/1.24 ordereqreflfact = 0
% 0.71/1.24
% 0.71/1.24 litselect = negord
% 0.71/1.24
% 0.71/1.24 maxweight = 15
% 0.71/1.24 maxdepth = 30000
% 0.71/1.24 maxlength = 115
% 0.71/1.24 maxnrvars = 195
% 0.71/1.24 excuselevel = 1
% 0.71/1.24 increasemaxweight = 1
% 0.71/1.24
% 0.71/1.24 maxselected = 10000000
% 0.71/1.24 maxnrclauses = 10000000
% 0.71/1.24
% 0.71/1.24 showgenerated = 0
% 0.71/1.24 showkept = 0
% 0.71/1.24 showselected = 0
% 0.71/1.24 showdeleted = 0
% 0.71/1.24 showresimp = 1
% 0.71/1.24 showstatus = 2000
% 0.71/1.24
% 0.71/1.24 prologoutput = 1
% 0.71/1.24 nrgoals = 5000000
% 0.71/1.24 totalproof = 1
% 0.71/1.24
% 0.71/1.24 Symbols occurring in the translation:
% 0.71/1.24
% 0.71/1.24 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.71/1.24 . [1, 2] (w:1, o:22, a:1, s:1, b:0),
% 0.71/1.24 ! [4, 1] (w:0, o:16, a:1, s:1, b:0),
% 0.71/1.24 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.24 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.24 identity [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.71/1.24 multiply [41, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.71/1.24 inverse [42, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.71/1.24 'greatest_lower_bound' [45, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.71/1.24 'least_upper_bound' [46, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.71/1.24 a [47, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.71/1.24 b [48, 0] (w:1, o:14, a:1, s:1, b:0),
% 0.71/1.24 c [49, 0] (w:1, o:15, a:1, s:1, b:0).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 Starting Search:
% 0.71/1.24
% 0.71/1.24 Resimplifying inuse:
% 0.71/1.24 Done
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 Intermediate Status:
% 0.71/1.24 Generated: 23811
% 0.71/1.24 Kept: 2003
% 0.71/1.24 Inuse: 284
% 0.71/1.24 Deleted: 17
% 0.71/1.24 Deletedinuse: 6
% 0.71/1.24
% 0.71/1.24 Resimplifying inuse:
% 0.71/1.24 Done
% 0.71/1.24
% 0.71/1.24 Resimplifying inuse:
% 0.71/1.24 Done
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 Intermediate Status:
% 0.71/1.24 Generated: 41362
% 0.71/1.24 Kept: 4007
% 0.71/1.24 Inuse: 444
% 0.71/1.24 Deleted: 49
% 0.71/1.24 Deletedinuse: 6
% 0.71/1.24
% 0.71/1.24 Resimplifying inuse:
% 0.71/1.24 Done
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 Bliksems!, er is een bewijs:
% 0.71/1.24 % SZS status Unsatisfiable
% 0.71/1.24 % SZS output start Refutation
% 0.71/1.24
% 0.71/1.24 clause( 0, [ =( multiply( identity, X ), X ) ] )
% 0.71/1.24 .
% 0.71/1.24 clause( 3, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y,
% 0.71/1.24 X ) ) ] )
% 0.71/1.24 .
% 0.71/1.24 clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X ) )
% 0.71/1.24 ] )
% 0.71/1.24 .
% 0.71/1.24 clause( 5, [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z ) )
% 0.71/1.24 , 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.71/1.24 .
% 0.71/1.24 clause( 9, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) ), X
% 0.71/1.24 ) ] )
% 0.71/1.24 .
% 0.71/1.24 clause( 10, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) ),
% 0.71/1.24 X ) ] )
% 0.71/1.24 .
% 0.71/1.24 clause( 14, [ =( 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z )
% 0.71/1.24 ), multiply( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.71/1.24 .
% 0.71/1.24 clause( 16, [ =( 'greatest_lower_bound'( identity, b ), identity ) ] )
% 0.71/1.24 .
% 0.71/1.24 clause( 18, [ =( 'greatest_lower_bound'( a, b ), identity ) ] )
% 0.71/1.24 .
% 0.71/1.24 clause( 19, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'(
% 0.71/1.24 'greatest_lower_bound'( a, multiply( b, c ) ), a ), c ),
% 0.71/1.24 'greatest_lower_bound'( a, multiply( b, c ) ) ) ] )
% 0.71/1.24 .
% 0.71/1.24 clause( 20, [ ~( =( 'greatest_lower_bound'( a, multiply( b, c ) ),
% 0.71/1.24 'greatest_lower_bound'( a, c ) ) ) ] )
% 0.71/1.24 .
% 0.71/1.24 clause( 32, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z
% 0.71/1.24 ), 'greatest_lower_bound'( 'greatest_lower_bound'( Y, Z ), X ) ) ] )
% 0.71/1.24 .
% 0.71/1.24 clause( 42, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( Y, X ) ),
% 0.71/1.24 X ) ] )
% 0.71/1.24 .
% 0.71/1.24 clause( 58, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), X
% 0.71/1.24 ), 'greatest_lower_bound'( X, Y ) ) ] )
% 0.71/1.24 .
% 0.71/1.24 clause( 122, [ =( 'greatest_lower_bound'( X, multiply( Y, X ) ), multiply(
% 0.71/1.24 'greatest_lower_bound'( identity, Y ), X ) ) ] )
% 0.71/1.24 .
% 0.71/1.24 clause( 139, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( a,
% 0.71/1.24 multiply( b, c ) ), c ), 'greatest_lower_bound'( a, multiply( b, c ) ) )
% 0.71/1.24 ] )
% 0.71/1.24 .
% 0.71/1.24 clause( 295, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( Z, X ), Y
% 0.71/1.24 ), 'greatest_lower_bound'( 'greatest_lower_bound'( Y, X ), Z ) ) ] )
% 0.71/1.24 .
% 0.71/1.24 clause( 2709, [ =( 'greatest_lower_bound'( X, multiply( b, X ) ), X ) ] )
% 0.71/1.24 .
% 0.71/1.24 clause( 2767, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( Y,
% 0.71/1.24 multiply( b, X ) ), X ), 'greatest_lower_bound'( X, Y ) ) ] )
% 0.71/1.24 .
% 0.71/1.24 clause( 3259, [ =( 'greatest_lower_bound'( a, multiply( b, c ) ),
% 0.71/1.24 'greatest_lower_bound'( c, a ) ) ] )
% 0.71/1.24 .
% 0.71/1.24 clause( 4031, [ ~( =( 'greatest_lower_bound'( a, c ),
% 0.71/1.24 'greatest_lower_bound'( c, a ) ) ) ] )
% 0.71/1.24 .
% 0.71/1.24 clause( 4032, [] )
% 0.71/1.24 .
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 % SZS output end Refutation
% 0.71/1.24 found a proof!
% 0.71/1.24
% 0.71/1.24 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.71/1.24
% 0.71/1.24 initialclauses(
% 0.71/1.24 [ clause( 4034, [ =( multiply( identity, X ), X ) ] )
% 0.71/1.24 , clause( 4035, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.71/1.24 , clause( 4036, [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply(
% 0.71/1.24 Y, Z ) ) ) ] )
% 0.71/1.24 , clause( 4037, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'(
% 0.71/1.24 Y, X ) ) ] )
% 0.71/1.24 , clause( 4038, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X
% 0.71/1.24 ) ) ] )
% 0.71/1.24 , clause( 4039, [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y,
% 0.71/1.24 Z ) ), 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.71/1.24 , clause( 4040, [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) )
% 0.71/1.24 , 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.71/1.24 , clause( 4041, [ =( 'least_upper_bound'( X, X ), X ) ] )
% 0.71/1.24 , clause( 4042, [ =( 'greatest_lower_bound'( X, X ), X ) ] )
% 0.71/1.24 , clause( 4043, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y )
% 0.71/1.24 ), X ) ] )
% 0.71/1.24 , clause( 4044, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y )
% 0.71/1.24 ), X ) ] )
% 0.71/1.24 , clause( 4045, [ =( multiply( X, 'least_upper_bound'( Y, Z ) ),
% 0.71/1.24 'least_upper_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ] )
% 0.71/1.24 , clause( 4046, [ =( multiply( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.71/1.24 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ] )
% 0.71/1.24 , clause( 4047, [ =( multiply( 'least_upper_bound'( X, Y ), Z ),
% 0.71/1.24 'least_upper_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ] )
% 0.71/1.24 , clause( 4048, [ =( multiply( 'greatest_lower_bound'( X, Y ), Z ),
% 0.71/1.24 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ] )
% 0.71/1.24 , clause( 4049, [ =( 'greatest_lower_bound'( identity, a ), identity ) ] )
% 0.71/1.24 , clause( 4050, [ =( 'greatest_lower_bound'( identity, b ), identity ) ] )
% 0.71/1.24 , clause( 4051, [ =( 'greatest_lower_bound'( identity, c ), identity ) ] )
% 0.71/1.24 , clause( 4052, [ =( 'greatest_lower_bound'( a, b ), identity ) ] )
% 0.71/1.24 , clause( 4053, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( a,
% 0.71/1.24 multiply( b, c ) ), multiply( 'greatest_lower_bound'( a, b ),
% 0.71/1.24 'greatest_lower_bound'( a, c ) ) ), 'greatest_lower_bound'( a, multiply(
% 0.71/1.24 b, c ) ) ) ] )
% 0.71/1.24 , clause( 4054, [ ~( =( 'greatest_lower_bound'( a, multiply( b, c ) ),
% 0.71/1.24 'greatest_lower_bound'( a, c ) ) ) ] )
% 0.71/1.24 ] ).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 subsumption(
% 0.71/1.24 clause( 0, [ =( multiply( identity, X ), X ) ] )
% 0.71/1.24 , clause( 4034, [ =( multiply( identity, X ), X ) ] )
% 0.71/1.24 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 subsumption(
% 0.71/1.24 clause( 3, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y,
% 0.71/1.24 X ) ) ] )
% 0.71/1.24 , clause( 4037, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'(
% 0.71/1.24 Y, X ) ) ] )
% 0.71/1.24 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.24 )] ) ).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 subsumption(
% 0.71/1.24 clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X ) )
% 0.71/1.24 ] )
% 0.71/1.24 , clause( 4038, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X
% 0.71/1.24 ) ) ] )
% 0.71/1.24 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.24 )] ) ).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 subsumption(
% 0.71/1.24 clause( 5, [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z ) )
% 0.71/1.24 , 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.71/1.24 , clause( 4039, [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y,
% 0.71/1.24 Z ) ), 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.71/1.24 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.24 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 subsumption(
% 0.71/1.24 clause( 9, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) ), X
% 0.71/1.24 ) ] )
% 0.71/1.24 , clause( 4043, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y )
% 0.71/1.24 ), X ) ] )
% 0.71/1.24 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.24 )] ) ).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 subsumption(
% 0.71/1.24 clause( 10, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) ),
% 0.71/1.24 X ) ] )
% 0.71/1.24 , clause( 4044, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y )
% 0.71/1.24 ), X ) ] )
% 0.71/1.24 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.24 )] ) ).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 eqswap(
% 0.71/1.24 clause( 4095, [ =( 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z
% 0.71/1.24 ) ), multiply( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.71/1.24 , clause( 4048, [ =( multiply( 'greatest_lower_bound'( X, Y ), Z ),
% 0.71/1.24 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ] )
% 0.71/1.24 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 subsumption(
% 0.71/1.24 clause( 14, [ =( 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z )
% 0.71/1.24 ), multiply( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.71/1.24 , clause( 4095, [ =( 'greatest_lower_bound'( multiply( X, Z ), multiply( Y
% 0.71/1.24 , Z ) ), multiply( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.71/1.24 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.24 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 subsumption(
% 0.71/1.24 clause( 16, [ =( 'greatest_lower_bound'( identity, b ), identity ) ] )
% 0.71/1.24 , clause( 4050, [ =( 'greatest_lower_bound'( identity, b ), identity ) ] )
% 0.71/1.24 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 subsumption(
% 0.71/1.24 clause( 18, [ =( 'greatest_lower_bound'( a, b ), identity ) ] )
% 0.71/1.24 , clause( 4052, [ =( 'greatest_lower_bound'( a, b ), identity ) ] )
% 0.71/1.24 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 paramod(
% 0.71/1.24 clause( 4208, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( a,
% 0.71/1.24 multiply( b, c ) ), multiply( identity, 'greatest_lower_bound'( a, c ) )
% 0.71/1.24 ), 'greatest_lower_bound'( a, multiply( b, c ) ) ) ] )
% 0.71/1.24 , clause( 18, [ =( 'greatest_lower_bound'( a, b ), identity ) ] )
% 0.71/1.24 , 0, clause( 4053, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( a,
% 0.71/1.24 multiply( b, c ) ), multiply( 'greatest_lower_bound'( a, b ),
% 0.71/1.24 'greatest_lower_bound'( a, c ) ) ), 'greatest_lower_bound'( a, multiply(
% 0.71/1.24 b, c ) ) ) ] )
% 0.71/1.24 , 0, 8, substitution( 0, [] ), substitution( 1, [] )).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 paramod(
% 0.71/1.24 clause( 4209, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( a,
% 0.71/1.24 multiply( b, c ) ), 'greatest_lower_bound'( a, c ) ),
% 0.71/1.24 'greatest_lower_bound'( a, multiply( b, c ) ) ) ] )
% 0.71/1.24 , clause( 0, [ =( multiply( identity, X ), X ) ] )
% 0.71/1.24 , 0, clause( 4208, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( a,
% 0.71/1.24 multiply( b, c ) ), multiply( identity, 'greatest_lower_bound'( a, c ) )
% 0.71/1.24 ), 'greatest_lower_bound'( a, multiply( b, c ) ) ) ] )
% 0.71/1.24 , 0, 7, substitution( 0, [ :=( X, 'greatest_lower_bound'( a, c ) )] ),
% 0.71/1.24 substitution( 1, [] )).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 paramod(
% 0.71/1.24 clause( 4210, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'(
% 0.71/1.24 'greatest_lower_bound'( a, multiply( b, c ) ), a ), c ),
% 0.71/1.24 'greatest_lower_bound'( a, multiply( b, c ) ) ) ] )
% 0.71/1.24 , clause( 5, [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z )
% 0.71/1.24 ), 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.71/1.24 , 0, clause( 4209, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( a,
% 0.71/1.24 multiply( b, c ) ), 'greatest_lower_bound'( a, c ) ),
% 0.71/1.24 'greatest_lower_bound'( a, multiply( b, c ) ) ) ] )
% 0.71/1.24 , 0, 1, substitution( 0, [ :=( X, 'greatest_lower_bound'( a, multiply( b, c
% 0.71/1.24 ) ) ), :=( Y, a ), :=( Z, c )] ), substitution( 1, [] )).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 subsumption(
% 0.71/1.24 clause( 19, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'(
% 0.71/1.24 'greatest_lower_bound'( a, multiply( b, c ) ), a ), c ),
% 0.71/1.24 'greatest_lower_bound'( a, multiply( b, c ) ) ) ] )
% 0.71/1.24 , clause( 4210, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'(
% 0.71/1.24 'greatest_lower_bound'( a, multiply( b, c ) ), a ), c ),
% 0.71/1.24 'greatest_lower_bound'( a, multiply( b, c ) ) ) ] )
% 0.71/1.24 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 subsumption(
% 0.71/1.24 clause( 20, [ ~( =( 'greatest_lower_bound'( a, multiply( b, c ) ),
% 0.71/1.24 'greatest_lower_bound'( a, c ) ) ) ] )
% 0.71/1.24 , clause( 4054, [ ~( =( 'greatest_lower_bound'( a, multiply( b, c ) ),
% 0.71/1.24 'greatest_lower_bound'( a, c ) ) ) ] )
% 0.71/1.24 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 eqswap(
% 0.71/1.24 clause( 4231, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ),
% 0.71/1.24 Z ), 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z ) ) ) ] )
% 0.71/1.24 , clause( 5, [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z )
% 0.71/1.24 ), 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.71/1.24 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 paramod(
% 0.71/1.24 clause( 4234, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ),
% 0.71/1.24 Z ), 'greatest_lower_bound'( 'greatest_lower_bound'( Y, Z ), X ) ) ] )
% 0.71/1.24 , clause( 3, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y
% 0.71/1.24 , X ) ) ] )
% 0.71/1.24 , 0, clause( 4231, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( X,
% 0.71/1.24 Y ), Z ), 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z ) ) ) ]
% 0.71/1.24 )
% 0.71/1.24 , 0, 6, substitution( 0, [ :=( X, X ), :=( Y, 'greatest_lower_bound'( Y, Z
% 0.71/1.24 ) )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 subsumption(
% 0.71/1.24 clause( 32, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z
% 0.71/1.24 ), 'greatest_lower_bound'( 'greatest_lower_bound'( Y, Z ), X ) ) ] )
% 0.71/1.24 , clause( 4234, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y )
% 0.71/1.24 , Z ), 'greatest_lower_bound'( 'greatest_lower_bound'( Y, Z ), X ) ) ] )
% 0.71/1.24 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.24 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 eqswap(
% 0.71/1.24 clause( 4248, [ =( X, 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y
% 0.71/1.24 ) ) ) ] )
% 0.71/1.24 , clause( 10, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) )
% 0.71/1.24 , X ) ] )
% 0.71/1.24 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 paramod(
% 0.71/1.24 clause( 4249, [ =( X, 'greatest_lower_bound'( X, 'least_upper_bound'( Y, X
% 0.71/1.24 ) ) ) ] )
% 0.71/1.24 , clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X )
% 0.71/1.24 ) ] )
% 0.71/1.24 , 0, clause( 4248, [ =( X, 'greatest_lower_bound'( X, 'least_upper_bound'(
% 0.71/1.24 X, Y ) ) ) ] )
% 0.71/1.24 , 0, 4, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [
% 0.71/1.24 :=( X, X ), :=( Y, Y )] )).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 eqswap(
% 0.71/1.24 clause( 4252, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( Y, X ) )
% 0.71/1.24 , X ) ] )
% 0.71/1.24 , clause( 4249, [ =( X, 'greatest_lower_bound'( X, 'least_upper_bound'( Y,
% 0.71/1.24 X ) ) ) ] )
% 0.71/1.24 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 subsumption(
% 0.71/1.24 clause( 42, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( Y, X ) ),
% 0.71/1.24 X ) ] )
% 0.71/1.24 , clause( 4252, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( Y, X )
% 0.71/1.24 ), X ) ] )
% 0.71/1.24 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.24 )] ) ).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 eqswap(
% 0.71/1.24 clause( 4254, [ =( X, 'greatest_lower_bound'( X, 'least_upper_bound'( Y, X
% 0.71/1.24 ) ) ) ] )
% 0.71/1.24 , clause( 42, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( Y, X ) )
% 0.71/1.24 , X ) ] )
% 0.71/1.24 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 paramod(
% 0.71/1.24 clause( 4257, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'(
% 0.71/1.24 'greatest_lower_bound'( X, Y ), X ) ) ] )
% 0.71/1.24 , clause( 9, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) )
% 0.71/1.24 , X ) ] )
% 0.71/1.24 , 0, clause( 4254, [ =( X, 'greatest_lower_bound'( X, 'least_upper_bound'(
% 0.71/1.24 Y, X ) ) ) ] )
% 0.71/1.24 , 0, 8, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [
% 0.71/1.24 :=( X, 'greatest_lower_bound'( X, Y ) ), :=( Y, X )] )).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 eqswap(
% 0.71/1.24 clause( 4258, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ),
% 0.71/1.24 X ), 'greatest_lower_bound'( X, Y ) ) ] )
% 0.71/1.24 , clause( 4257, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'(
% 0.71/1.24 'greatest_lower_bound'( X, Y ), X ) ) ] )
% 0.71/1.24 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 subsumption(
% 0.71/1.24 clause( 58, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), X
% 0.71/1.24 ), 'greatest_lower_bound'( X, Y ) ) ] )
% 0.71/1.24 , clause( 4258, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y )
% 0.71/1.24 , X ), 'greatest_lower_bound'( X, Y ) ) ] )
% 0.71/1.24 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.24 )] ) ).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 eqswap(
% 0.71/1.24 clause( 4260, [ =( multiply( 'greatest_lower_bound'( X, Z ), Y ),
% 0.71/1.24 'greatest_lower_bound'( multiply( X, Y ), multiply( Z, Y ) ) ) ] )
% 0.71/1.24 , clause( 14, [ =( 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z
% 0.71/1.24 ) ), multiply( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.71/1.24 , 0, substitution( 0, [ :=( X, X ), :=( Y, Z ), :=( Z, Y )] )).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 paramod(
% 0.71/1.24 clause( 4261, [ =( multiply( 'greatest_lower_bound'( identity, X ), Y ),
% 0.71/1.24 'greatest_lower_bound'( Y, multiply( X, Y ) ) ) ] )
% 0.71/1.24 , clause( 0, [ =( multiply( identity, X ), X ) ] )
% 0.71/1.24 , 0, clause( 4260, [ =( multiply( 'greatest_lower_bound'( X, Z ), Y ),
% 0.71/1.24 'greatest_lower_bound'( multiply( X, Y ), multiply( Z, Y ) ) ) ] )
% 0.71/1.24 , 0, 7, substitution( 0, [ :=( X, Y )] ), substitution( 1, [ :=( X,
% 0.71/1.24 identity ), :=( Y, Y ), :=( Z, X )] )).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 eqswap(
% 0.71/1.24 clause( 4263, [ =( 'greatest_lower_bound'( Y, multiply( X, Y ) ), multiply(
% 0.71/1.24 'greatest_lower_bound'( identity, X ), Y ) ) ] )
% 0.71/1.24 , clause( 4261, [ =( multiply( 'greatest_lower_bound'( identity, X ), Y ),
% 0.71/1.24 'greatest_lower_bound'( Y, multiply( X, Y ) ) ) ] )
% 0.71/1.24 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 subsumption(
% 0.71/1.24 clause( 122, [ =( 'greatest_lower_bound'( X, multiply( Y, X ) ), multiply(
% 0.71/1.24 'greatest_lower_bound'( identity, Y ), X ) ) ] )
% 0.71/1.24 , clause( 4263, [ =( 'greatest_lower_bound'( Y, multiply( X, Y ) ),
% 0.71/1.24 multiply( 'greatest_lower_bound'( identity, X ), Y ) ) ] )
% 0.71/1.24 , substitution( 0, [ :=( X, Y ), :=( Y, X )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.24 )] ) ).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 paramod(
% 0.71/1.24 clause( 4267, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( a,
% 0.71/1.24 multiply( b, c ) ), c ), 'greatest_lower_bound'( a, multiply( b, c ) ) )
% 0.71/1.24 ] )
% 0.71/1.24 , clause( 58, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ),
% 0.71/1.24 X ), 'greatest_lower_bound'( X, Y ) ) ] )
% 0.71/1.24 , 0, clause( 19, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'(
% 0.71/1.24 'greatest_lower_bound'( a, multiply( b, c ) ), a ), c ),
% 0.71/1.24 'greatest_lower_bound'( a, multiply( b, c ) ) ) ] )
% 0.71/1.24 , 0, 2, substitution( 0, [ :=( X, a ), :=( Y, multiply( b, c ) )] ),
% 0.71/1.24 substitution( 1, [] )).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 subsumption(
% 0.71/1.24 clause( 139, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( a,
% 0.71/1.24 multiply( b, c ) ), c ), 'greatest_lower_bound'( a, multiply( b, c ) ) )
% 0.71/1.24 ] )
% 0.71/1.24 , clause( 4267, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( a,
% 0.71/1.24 multiply( b, c ) ), c ), 'greatest_lower_bound'( a, multiply( b, c ) ) )
% 0.71/1.24 ] )
% 0.71/1.24 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 eqswap(
% 0.71/1.24 clause( 4269, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( Y, Z ),
% 0.71/1.24 X ), 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.71/1.24 , clause( 32, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ),
% 0.71/1.24 Z ), 'greatest_lower_bound'( 'greatest_lower_bound'( Y, Z ), X ) ) ] )
% 0.71/1.24 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 paramod(
% 0.71/1.24 clause( 4271, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( Y, X ),
% 0.71/1.24 Z ), 'greatest_lower_bound'( 'greatest_lower_bound'( Z, X ), Y ) ) ] )
% 0.71/1.24 , clause( 3, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y
% 0.71/1.24 , X ) ) ] )
% 0.71/1.24 , 0, clause( 4269, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( Y,
% 0.71/1.24 Z ), X ), 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ]
% 0.71/1.24 )
% 0.71/1.24 , 0, 2, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [
% 0.71/1.24 :=( X, Z ), :=( Y, X ), :=( Z, Y )] )).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 subsumption(
% 0.71/1.24 clause( 295, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( Z, X ), Y
% 0.71/1.24 ), 'greatest_lower_bound'( 'greatest_lower_bound'( Y, X ), Z ) ) ] )
% 0.71/1.24 , clause( 4271, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( Y, X )
% 0.71/1.24 , Z ), 'greatest_lower_bound'( 'greatest_lower_bound'( Z, X ), Y ) ) ] )
% 0.71/1.24 , substitution( 0, [ :=( X, X ), :=( Y, Z ), :=( Z, Y )] ),
% 0.71/1.24 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 eqswap(
% 0.71/1.24 clause( 4287, [ =( multiply( 'greatest_lower_bound'( identity, Y ), X ),
% 0.71/1.24 'greatest_lower_bound'( X, multiply( Y, X ) ) ) ] )
% 0.71/1.24 , clause( 122, [ =( 'greatest_lower_bound'( X, multiply( Y, X ) ), multiply(
% 0.71/1.24 'greatest_lower_bound'( identity, Y ), X ) ) ] )
% 0.71/1.24 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 paramod(
% 0.71/1.24 clause( 4289, [ =( multiply( identity, X ), 'greatest_lower_bound'( X,
% 0.71/1.24 multiply( b, X ) ) ) ] )
% 0.71/1.24 , clause( 16, [ =( 'greatest_lower_bound'( identity, b ), identity ) ] )
% 0.71/1.24 , 0, clause( 4287, [ =( multiply( 'greatest_lower_bound'( identity, Y ), X
% 0.71/1.24 ), 'greatest_lower_bound'( X, multiply( Y, X ) ) ) ] )
% 0.71/1.24 , 0, 2, substitution( 0, [] ), substitution( 1, [ :=( X, X ), :=( Y, b )] )
% 0.71/1.24 ).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 paramod(
% 0.71/1.24 clause( 4290, [ =( X, 'greatest_lower_bound'( X, multiply( b, X ) ) ) ] )
% 0.71/1.24 , clause( 0, [ =( multiply( identity, X ), X ) ] )
% 0.71/1.24 , 0, clause( 4289, [ =( multiply( identity, X ), 'greatest_lower_bound'( X
% 0.71/1.24 , multiply( b, X ) ) ) ] )
% 0.71/1.24 , 0, 1, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X )] )
% 0.71/1.24 ).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 eqswap(
% 0.71/1.24 clause( 4291, [ =( 'greatest_lower_bound'( X, multiply( b, X ) ), X ) ] )
% 0.71/1.24 , clause( 4290, [ =( X, 'greatest_lower_bound'( X, multiply( b, X ) ) ) ]
% 0.71/1.24 )
% 0.71/1.24 , 0, substitution( 0, [ :=( X, X )] )).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 subsumption(
% 0.71/1.24 clause( 2709, [ =( 'greatest_lower_bound'( X, multiply( b, X ) ), X ) ] )
% 0.71/1.24 , clause( 4291, [ =( 'greatest_lower_bound'( X, multiply( b, X ) ), X ) ]
% 0.71/1.24 )
% 0.71/1.24 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 paramod(
% 0.71/1.24 clause( 4300, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( X,
% 0.71/1.24 multiply( b, Y ) ), Y ), 'greatest_lower_bound'( Y, X ) ) ] )
% 0.71/1.24 , clause( 2709, [ =( 'greatest_lower_bound'( X, multiply( b, X ) ), X ) ]
% 0.71/1.24 )
% 0.71/1.24 , 0, clause( 295, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( Z, X
% 0.71/1.24 ), Y ), 'greatest_lower_bound'( 'greatest_lower_bound'( Y, X ), Z ) ) ]
% 0.71/1.24 )
% 0.71/1.24 , 0, 9, substitution( 0, [ :=( X, Y )] ), substitution( 1, [ :=( X,
% 0.71/1.24 multiply( b, Y ) ), :=( Y, Y ), :=( Z, X )] )).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 subsumption(
% 0.71/1.24 clause( 2767, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( Y,
% 0.71/1.24 multiply( b, X ) ), X ), 'greatest_lower_bound'( X, Y ) ) ] )
% 0.71/1.24 , clause( 4300, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( X,
% 0.71/1.24 multiply( b, Y ) ), Y ), 'greatest_lower_bound'( Y, X ) ) ] )
% 0.71/1.24 , substitution( 0, [ :=( X, Y ), :=( Y, X )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.24 )] ) ).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 paramod(
% 0.71/1.24 clause( 4303, [ =( 'greatest_lower_bound'( c, a ), 'greatest_lower_bound'(
% 0.71/1.24 a, multiply( b, c ) ) ) ] )
% 0.71/1.24 , clause( 2767, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( Y,
% 0.71/1.24 multiply( b, X ) ), X ), 'greatest_lower_bound'( X, Y ) ) ] )
% 0.71/1.24 , 0, clause( 139, [ =( 'greatest_lower_bound'( 'greatest_lower_bound'( a,
% 0.71/1.24 multiply( b, c ) ), c ), 'greatest_lower_bound'( a, multiply( b, c ) ) )
% 0.71/1.24 ] )
% 0.71/1.24 , 0, 1, substitution( 0, [ :=( X, c ), :=( Y, a )] ), substitution( 1, [] )
% 0.71/1.24 ).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 eqswap(
% 0.71/1.24 clause( 4304, [ =( 'greatest_lower_bound'( a, multiply( b, c ) ),
% 0.71/1.24 'greatest_lower_bound'( c, a ) ) ] )
% 0.71/1.24 , clause( 4303, [ =( 'greatest_lower_bound'( c, a ), 'greatest_lower_bound'(
% 0.71/1.24 a, multiply( b, c ) ) ) ] )
% 0.71/1.24 , 0, substitution( 0, [] )).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 subsumption(
% 0.71/1.24 clause( 3259, [ =( 'greatest_lower_bound'( a, multiply( b, c ) ),
% 0.71/1.24 'greatest_lower_bound'( c, a ) ) ] )
% 0.71/1.24 , clause( 4304, [ =( 'greatest_lower_bound'( a, multiply( b, c ) ),
% 0.71/1.24 'greatest_lower_bound'( c, a ) ) ] )
% 0.71/1.24 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 paramod(
% 0.71/1.24 clause( 4307, [ ~( =( 'greatest_lower_bound'( c, a ),
% 0.71/1.24 'greatest_lower_bound'( a, c ) ) ) ] )
% 0.71/1.24 , clause( 3259, [ =( 'greatest_lower_bound'( a, multiply( b, c ) ),
% 0.71/1.24 'greatest_lower_bound'( c, a ) ) ] )
% 0.71/1.24 , 0, clause( 20, [ ~( =( 'greatest_lower_bound'( a, multiply( b, c ) ),
% 0.71/1.24 'greatest_lower_bound'( a, c ) ) ) ] )
% 0.71/1.24 , 0, 2, substitution( 0, [] ), substitution( 1, [] )).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 eqswap(
% 0.71/1.24 clause( 4308, [ ~( =( 'greatest_lower_bound'( a, c ),
% 0.71/1.24 'greatest_lower_bound'( c, a ) ) ) ] )
% 0.71/1.24 , clause( 4307, [ ~( =( 'greatest_lower_bound'( c, a ),
% 0.71/1.24 'greatest_lower_bound'( a, c ) ) ) ] )
% 0.71/1.24 , 0, substitution( 0, [] )).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 subsumption(
% 0.71/1.24 clause( 4031, [ ~( =( 'greatest_lower_bound'( a, c ),
% 0.71/1.24 'greatest_lower_bound'( c, a ) ) ) ] )
% 0.71/1.24 , clause( 4308, [ ~( =( 'greatest_lower_bound'( a, c ),
% 0.71/1.24 'greatest_lower_bound'( c, a ) ) ) ] )
% 0.71/1.24 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 eqswap(
% 0.71/1.24 clause( 4309, [ ~( =( 'greatest_lower_bound'( c, a ),
% 0.71/1.24 'greatest_lower_bound'( a, c ) ) ) ] )
% 0.71/1.24 , clause( 4031, [ ~( =( 'greatest_lower_bound'( a, c ),
% 0.71/1.24 'greatest_lower_bound'( c, a ) ) ) ] )
% 0.71/1.24 , 0, substitution( 0, [] )).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 paramod(
% 0.71/1.24 clause( 4311, [ ~( =( 'greatest_lower_bound'( c, a ),
% 0.71/1.24 'greatest_lower_bound'( c, a ) ) ) ] )
% 0.71/1.24 , clause( 3, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y
% 0.71/1.24 , X ) ) ] )
% 0.71/1.24 , 0, clause( 4309, [ ~( =( 'greatest_lower_bound'( c, a ),
% 0.71/1.24 'greatest_lower_bound'( a, c ) ) ) ] )
% 0.71/1.24 , 0, 5, substitution( 0, [ :=( X, a ), :=( Y, c )] ), substitution( 1, [] )
% 0.71/1.24 ).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 eqrefl(
% 0.71/1.24 clause( 4314, [] )
% 0.71/1.24 , clause( 4311, [ ~( =( 'greatest_lower_bound'( c, a ),
% 0.71/1.24 'greatest_lower_bound'( c, a ) ) ) ] )
% 0.71/1.24 , 0, substitution( 0, [] )).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 subsumption(
% 0.71/1.24 clause( 4032, [] )
% 0.71/1.24 , clause( 4314, [] )
% 0.71/1.24 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 end.
% 0.71/1.24
% 0.71/1.24 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.71/1.24
% 0.71/1.24 Memory use:
% 0.71/1.24
% 0.71/1.24 space for terms: 48274
% 0.71/1.24 space for clauses: 390736
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 clauses generated: 41763
% 0.71/1.24 clauses kept: 4033
% 0.71/1.24 clauses selected: 449
% 0.71/1.24 clauses deleted: 51
% 0.71/1.24 clauses inuse deleted: 7
% 0.71/1.24
% 0.71/1.24 subsentry: 5725
% 0.71/1.24 literals s-matched: 4492
% 0.71/1.24 literals matched: 4289
% 0.71/1.24 full subsumption: 0
% 0.71/1.24
% 0.71/1.24 checksum: -150354217
% 0.71/1.24
% 0.71/1.24
% 0.71/1.24 Bliksem ended
%------------------------------------------------------------------------------