TSTP Solution File: GRP166-4 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : GRP166-4 : 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:41 EDT 2022
% Result : Unsatisfiable 0.83s 1.21s
% Output : Refutation 0.83s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP166-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.11/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n026.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 : Mon Jun 13 04:16:35 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.83/1.21 *** allocated 10000 integers for termspace/termends
% 0.83/1.21 *** allocated 10000 integers for clauses
% 0.83/1.21 *** allocated 10000 integers for justifications
% 0.83/1.21 Bliksem 1.12
% 0.83/1.21
% 0.83/1.21
% 0.83/1.21 Automatic Strategy Selection
% 0.83/1.21
% 0.83/1.21 Clauses:
% 0.83/1.21 [
% 0.83/1.21 [ =( multiply( identity, X ), X ) ],
% 0.83/1.21 [ =( multiply( inverse( X ), X ), identity ) ],
% 0.83/1.21 [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply( Y, Z ) ) )
% 0.83/1.21 ],
% 0.83/1.21 [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y, X ) ) ]
% 0.83/1.21 ,
% 0.83/1.21 [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X ) ) ],
% 0.83/1.21 [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.83/1.21 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ],
% 0.83/1.21 [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.83/1.21 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ],
% 0.83/1.21 [ =( 'least_upper_bound'( X, X ), X ) ],
% 0.83/1.21 [ =( 'greatest_lower_bound'( X, X ), X ) ],
% 0.83/1.21 [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) ), X ) ]
% 0.83/1.21 ,
% 0.83/1.21 [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) ), X ) ]
% 0.83/1.21 ,
% 0.83/1.21 [ =( multiply( X, 'least_upper_bound'( Y, Z ) ), 'least_upper_bound'(
% 0.83/1.21 multiply( X, Y ), multiply( X, Z ) ) ) ],
% 0.83/1.21 [ =( multiply( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.83/1.21 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ],
% 0.83/1.21 [ =( multiply( 'least_upper_bound'( X, Y ), Z ), 'least_upper_bound'(
% 0.83/1.21 multiply( X, Z ), multiply( Y, Z ) ) ) ],
% 0.83/1.21 [ =( multiply( 'greatest_lower_bound'( X, Y ), Z ),
% 0.83/1.21 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ],
% 0.83/1.21 [ =( 'greatest_lower_bound'( a, identity ), identity ) ],
% 0.83/1.21 [ =( 'greatest_lower_bound'( b, identity ), identity ) ],
% 0.83/1.21 [ ~( =( 'greatest_lower_bound'( a, multiply( b, a ) ), a ) ) ]
% 0.83/1.21 ] .
% 0.83/1.21
% 0.83/1.21
% 0.83/1.21 percentage equality = 1.000000, percentage horn = 1.000000
% 0.83/1.21 This is a pure equality problem
% 0.83/1.21
% 0.83/1.21
% 0.83/1.21
% 0.83/1.21 Options Used:
% 0.83/1.21
% 0.83/1.21 useres = 1
% 0.83/1.21 useparamod = 1
% 0.83/1.21 useeqrefl = 1
% 0.83/1.21 useeqfact = 1
% 0.83/1.21 usefactor = 1
% 0.83/1.21 usesimpsplitting = 0
% 0.83/1.21 usesimpdemod = 5
% 0.83/1.21 usesimpres = 3
% 0.83/1.21
% 0.83/1.21 resimpinuse = 1000
% 0.83/1.21 resimpclauses = 20000
% 0.83/1.21 substype = eqrewr
% 0.83/1.21 backwardsubs = 1
% 0.83/1.21 selectoldest = 5
% 0.83/1.21
% 0.83/1.21 litorderings [0] = split
% 0.83/1.21 litorderings [1] = extend the termordering, first sorting on arguments
% 0.83/1.21
% 0.83/1.21 termordering = kbo
% 0.83/1.21
% 0.83/1.21 litapriori = 0
% 0.83/1.21 termapriori = 1
% 0.83/1.21 litaposteriori = 0
% 0.83/1.21 termaposteriori = 0
% 0.83/1.21 demodaposteriori = 0
% 0.83/1.21 ordereqreflfact = 0
% 0.83/1.21
% 0.83/1.21 litselect = negord
% 0.83/1.21
% 0.83/1.21 maxweight = 15
% 0.83/1.21 maxdepth = 30000
% 0.83/1.21 maxlength = 115
% 0.83/1.21 maxnrvars = 195
% 0.83/1.21 excuselevel = 1
% 0.83/1.21 increasemaxweight = 1
% 0.83/1.21
% 0.83/1.21 maxselected = 10000000
% 0.83/1.21 maxnrclauses = 10000000
% 0.83/1.21
% 0.83/1.21 showgenerated = 0
% 0.83/1.21 showkept = 0
% 0.83/1.21 showselected = 0
% 0.83/1.21 showdeleted = 0
% 0.83/1.21 showresimp = 1
% 0.83/1.21 showstatus = 2000
% 0.83/1.21
% 0.83/1.21 prologoutput = 1
% 0.83/1.21 nrgoals = 5000000
% 0.83/1.21 totalproof = 1
% 0.83/1.21
% 0.83/1.21 Symbols occurring in the translation:
% 0.83/1.21
% 0.83/1.21 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.83/1.21 . [1, 2] (w:1, o:21, a:1, s:1, b:0),
% 0.83/1.21 ! [4, 1] (w:0, o:15, a:1, s:1, b:0),
% 0.83/1.21 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.83/1.21 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.83/1.21 identity [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.83/1.21 multiply [41, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.83/1.21 inverse [42, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.83/1.21 'greatest_lower_bound' [45, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.83/1.21 'least_upper_bound' [46, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.83/1.21 a [47, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.83/1.21 b [48, 0] (w:1, o:14, a:1, s:1, b:0).
% 0.83/1.21
% 0.83/1.21
% 0.83/1.21 Starting Search:
% 0.83/1.21
% 0.83/1.21 Resimplifying inuse:
% 0.83/1.21 Done
% 0.83/1.21
% 0.83/1.21
% 0.83/1.21 Intermediate Status:
% 0.83/1.21 Generated: 27605
% 0.83/1.21 Kept: 2084
% 0.83/1.21 Inuse: 268
% 0.83/1.21 Deleted: 19
% 0.83/1.21 Deletedinuse: 6
% 0.83/1.21
% 0.83/1.21 Resimplifying inuse:
% 0.83/1.21 Done
% 0.83/1.21
% 0.83/1.21
% 0.83/1.21 Bliksems!, er is een bewijs:
% 0.83/1.21 % SZS status Unsatisfiable
% 0.83/1.21 % SZS output start Refutation
% 0.83/1.21
% 0.83/1.21 clause( 0, [ =( multiply( identity, X ), X ) ] )
% 0.83/1.21 .
% 0.83/1.21 clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X ) )
% 0.83/1.21 ] )
% 0.83/1.21 .
% 0.83/1.21 clause( 9, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) ), X
% 0.83/1.21 ) ] )
% 0.83/1.21 .
% 0.83/1.21 clause( 10, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) ),
% 0.83/1.21 X ) ] )
% 0.83/1.21 .
% 0.83/1.21 clause( 13, [ =( 'least_upper_bound'( multiply( X, Z ), multiply( Y, Z ) )
% 0.83/1.21 , multiply( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.83/1.21 .
% 0.83/1.21 clause( 16, [ =( 'greatest_lower_bound'( b, identity ), identity ) ] )
% 0.83/1.21 .
% 0.83/1.21 clause( 17, [ ~( =( 'greatest_lower_bound'( a, multiply( b, a ) ), a ) ) ]
% 0.83/1.21 )
% 0.83/1.21 .
% 0.83/1.21 clause( 24, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( Y, X ) ),
% 0.83/1.21 X ) ] )
% 0.83/1.21 .
% 0.83/1.21 clause( 47, [ =( 'least_upper_bound'( b, identity ), b ) ] )
% 0.83/1.21 .
% 0.83/1.21 clause( 101, [ =( 'least_upper_bound'( multiply( Y, X ), X ), multiply(
% 0.83/1.21 'least_upper_bound'( Y, identity ), X ) ) ] )
% 0.83/1.21 .
% 0.83/1.21 clause( 2251, [ =( 'least_upper_bound'( multiply( b, X ), X ), multiply( b
% 0.83/1.21 , X ) ) ] )
% 0.83/1.21 .
% 0.83/1.21 clause( 2531, [ =( 'greatest_lower_bound'( X, multiply( b, X ) ), X ) ] )
% 0.83/1.21 .
% 0.83/1.21 clause( 2533, [] )
% 0.83/1.21 .
% 0.83/1.21
% 0.83/1.21
% 0.83/1.21 % SZS output end Refutation
% 0.83/1.21 found a proof!
% 0.83/1.21
% 0.83/1.21 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.83/1.21
% 0.83/1.21 initialclauses(
% 0.83/1.21 [ clause( 2535, [ =( multiply( identity, X ), X ) ] )
% 0.83/1.21 , clause( 2536, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.83/1.21 , clause( 2537, [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply(
% 0.83/1.21 Y, Z ) ) ) ] )
% 0.83/1.21 , clause( 2538, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'(
% 0.83/1.21 Y, X ) ) ] )
% 0.83/1.21 , clause( 2539, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X
% 0.83/1.21 ) ) ] )
% 0.83/1.21 , clause( 2540, [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y,
% 0.83/1.21 Z ) ), 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.83/1.21 , clause( 2541, [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) )
% 0.83/1.21 , 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.83/1.21 , clause( 2542, [ =( 'least_upper_bound'( X, X ), X ) ] )
% 0.83/1.21 , clause( 2543, [ =( 'greatest_lower_bound'( X, X ), X ) ] )
% 0.83/1.21 , clause( 2544, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y )
% 0.83/1.21 ), X ) ] )
% 0.83/1.21 , clause( 2545, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y )
% 0.83/1.21 ), X ) ] )
% 0.83/1.21 , clause( 2546, [ =( multiply( X, 'least_upper_bound'( Y, Z ) ),
% 0.83/1.21 'least_upper_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ] )
% 0.83/1.21 , clause( 2547, [ =( multiply( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.83/1.21 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ] )
% 0.83/1.21 , clause( 2548, [ =( multiply( 'least_upper_bound'( X, Y ), Z ),
% 0.83/1.21 'least_upper_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ] )
% 0.83/1.21 , clause( 2549, [ =( multiply( 'greatest_lower_bound'( X, Y ), Z ),
% 0.83/1.21 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ] )
% 0.83/1.21 , clause( 2550, [ =( 'greatest_lower_bound'( a, identity ), identity ) ] )
% 0.83/1.21 , clause( 2551, [ =( 'greatest_lower_bound'( b, identity ), identity ) ] )
% 0.83/1.21 , clause( 2552, [ ~( =( 'greatest_lower_bound'( a, multiply( b, a ) ), a )
% 0.83/1.21 ) ] )
% 0.83/1.21 ] ).
% 0.83/1.21
% 0.83/1.21
% 0.83/1.21
% 0.83/1.21 subsumption(
% 0.83/1.21 clause( 0, [ =( multiply( identity, X ), X ) ] )
% 0.83/1.21 , clause( 2535, [ =( multiply( identity, X ), X ) ] )
% 0.83/1.21 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.83/1.21
% 0.83/1.21
% 0.83/1.21 subsumption(
% 0.83/1.21 clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X ) )
% 0.83/1.21 ] )
% 0.83/1.21 , clause( 2539, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X
% 0.83/1.21 ) ) ] )
% 0.83/1.21 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.83/1.21 )] ) ).
% 0.83/1.21
% 0.83/1.21
% 0.83/1.21 subsumption(
% 0.83/1.21 clause( 9, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) ), X
% 0.83/1.21 ) ] )
% 0.83/1.21 , clause( 2544, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y )
% 0.83/1.21 ), X ) ] )
% 0.83/1.21 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.83/1.21 )] ) ).
% 0.83/1.21
% 0.83/1.21
% 0.83/1.21 subsumption(
% 0.83/1.21 clause( 10, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) ),
% 0.83/1.21 X ) ] )
% 0.83/1.21 , clause( 2545, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y )
% 0.83/1.21 ), X ) ] )
% 0.83/1.21 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.83/1.21 )] ) ).
% 0.83/1.21
% 0.83/1.21
% 0.83/1.21 eqswap(
% 0.83/1.21 clause( 2585, [ =( 'least_upper_bound'( multiply( X, Z ), multiply( Y, Z )
% 0.83/1.21 ), multiply( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.83/1.21 , clause( 2548, [ =( multiply( 'least_upper_bound'( X, Y ), Z ),
% 0.83/1.21 'least_upper_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ] )
% 0.83/1.21 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.83/1.21
% 0.83/1.21
% 0.83/1.21 subsumption(
% 0.83/1.21 clause( 13, [ =( 'least_upper_bound'( multiply( X, Z ), multiply( Y, Z ) )
% 0.83/1.21 , multiply( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.83/1.21 , clause( 2585, [ =( 'least_upper_bound'( multiply( X, Z ), multiply( Y, Z
% 0.83/1.21 ) ), multiply( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.83/1.21 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.83/1.21 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.83/1.21
% 0.83/1.21
% 0.83/1.21 subsumption(
% 0.83/1.21 clause( 16, [ =( 'greatest_lower_bound'( b, identity ), identity ) ] )
% 0.83/1.21 , clause( 2551, [ =( 'greatest_lower_bound'( b, identity ), identity ) ] )
% 0.83/1.21 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.83/1.21
% 0.83/1.21
% 0.83/1.21 subsumption(
% 0.83/1.21 clause( 17, [ ~( =( 'greatest_lower_bound'( a, multiply( b, a ) ), a ) ) ]
% 0.83/1.21 )
% 0.83/1.21 , clause( 2552, [ ~( =( 'greatest_lower_bound'( a, multiply( b, a ) ), a )
% 0.83/1.21 ) ] )
% 0.83/1.21 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.83/1.21
% 0.83/1.21
% 0.83/1.21 eqswap(
% 0.83/1.21 clause( 2617, [ =( X, 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y
% 0.83/1.21 ) ) ) ] )
% 0.83/1.21 , clause( 10, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) )
% 0.83/1.21 , X ) ] )
% 0.83/1.21 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.83/1.21
% 0.83/1.21
% 0.83/1.21 paramod(
% 0.83/1.21 clause( 2618, [ =( X, 'greatest_lower_bound'( X, 'least_upper_bound'( Y, X
% 0.83/1.21 ) ) ) ] )
% 0.83/1.21 , clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X )
% 0.83/1.21 ) ] )
% 0.83/1.21 , 0, clause( 2617, [ =( X, 'greatest_lower_bound'( X, 'least_upper_bound'(
% 0.83/1.21 X, Y ) ) ) ] )
% 0.83/1.21 , 0, 4, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [
% 0.83/1.21 :=( X, X ), :=( Y, Y )] )).
% 0.83/1.21
% 0.83/1.21
% 0.83/1.21 eqswap(
% 0.83/1.21 clause( 2621, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( Y, X ) )
% 0.83/1.21 , X ) ] )
% 0.83/1.21 , clause( 2618, [ =( X, 'greatest_lower_bound'( X, 'least_upper_bound'( Y,
% 0.83/1.21 X ) ) ) ] )
% 0.83/1.21 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.83/1.21
% 0.83/1.21
% 0.83/1.21 subsumption(
% 0.83/1.21 clause( 24, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( Y, X ) ),
% 0.83/1.21 X ) ] )
% 0.83/1.21 , clause( 2621, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( Y, X )
% 0.83/1.21 ), X ) ] )
% 0.83/1.21 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.83/1.21 )] ) ).
% 0.83/1.21
% 0.83/1.21
% 0.83/1.21 eqswap(
% 0.83/1.21 clause( 2623, [ =( X, 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y
% 0.83/1.21 ) ) ) ] )
% 0.83/1.21 , clause( 9, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) )
% 0.83/1.21 , X ) ] )
% 0.83/1.21 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.83/1.21
% 0.83/1.21
% 0.83/1.21 paramod(
% 0.83/1.21 clause( 2624, [ =( b, 'least_upper_bound'( b, identity ) ) ] )
% 0.83/1.21 , clause( 16, [ =( 'greatest_lower_bound'( b, identity ), identity ) ] )
% 0.83/1.21 , 0, clause( 2623, [ =( X, 'least_upper_bound'( X, 'greatest_lower_bound'(
% 0.83/1.21 X, Y ) ) ) ] )
% 0.83/1.21 , 0, 4, substitution( 0, [] ), substitution( 1, [ :=( X, b ), :=( Y,
% 0.83/1.21 identity )] )).
% 0.83/1.21
% 0.83/1.21
% 0.83/1.21 eqswap(
% 0.83/1.21 clause( 2625, [ =( 'least_upper_bound'( b, identity ), b ) ] )
% 0.83/1.21 , clause( 2624, [ =( b, 'least_upper_bound'( b, identity ) ) ] )
% 0.83/1.21 , 0, substitution( 0, [] )).
% 0.83/1.21
% 0.83/1.21
% 0.83/1.21 subsumption(
% 0.83/1.21 clause( 47, [ =( 'least_upper_bound'( b, identity ), b ) ] )
% 0.83/1.21 , clause( 2625, [ =( 'least_upper_bound'( b, identity ), b ) ] )
% 0.83/1.21 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.83/1.21
% 0.83/1.21
% 0.83/1.21 eqswap(
% 0.83/1.21 clause( 2627, [ =( multiply( 'least_upper_bound'( X, Z ), Y ),
% 0.83/1.21 'least_upper_bound'( multiply( X, Y ), multiply( Z, Y ) ) ) ] )
% 0.83/1.21 , clause( 13, [ =( 'least_upper_bound'( multiply( X, Z ), multiply( Y, Z )
% 0.83/1.21 ), multiply( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.83/1.21 , 0, substitution( 0, [ :=( X, X ), :=( Y, Z ), :=( Z, Y )] )).
% 0.83/1.21
% 0.83/1.21
% 0.83/1.21 paramod(
% 0.83/1.21 clause( 2629, [ =( multiply( 'least_upper_bound'( X, identity ), Y ),
% 0.83/1.21 'least_upper_bound'( multiply( X, Y ), Y ) ) ] )
% 0.83/1.21 , clause( 0, [ =( multiply( identity, X ), X ) ] )
% 0.83/1.21 , 0, clause( 2627, [ =( multiply( 'least_upper_bound'( X, Z ), Y ),
% 0.83/1.21 'least_upper_bound'( multiply( X, Y ), multiply( Z, Y ) ) ) ] )
% 0.83/1.21 , 0, 10, substitution( 0, [ :=( X, Y )] ), substitution( 1, [ :=( X, X ),
% 0.83/1.21 :=( Y, Y ), :=( Z, identity )] )).
% 0.83/1.21
% 0.83/1.21
% 0.83/1.21 eqswap(
% 0.83/1.21 clause( 2631, [ =( 'least_upper_bound'( multiply( X, Y ), Y ), multiply(
% 0.83/1.21 'least_upper_bound'( X, identity ), Y ) ) ] )
% 0.83/1.21 , clause( 2629, [ =( multiply( 'least_upper_bound'( X, identity ), Y ),
% 0.83/1.21 'least_upper_bound'( multiply( X, Y ), Y ) ) ] )
% 0.83/1.21 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.83/1.21
% 0.83/1.21
% 0.83/1.21 subsumption(
% 0.83/1.21 clause( 101, [ =( 'least_upper_bound'( multiply( Y, X ), X ), multiply(
% 0.83/1.21 'least_upper_bound'( Y, identity ), X ) ) ] )
% 0.83/1.21 , clause( 2631, [ =( 'least_upper_bound'( multiply( X, Y ), Y ), multiply(
% 0.83/1.21 'least_upper_bound'( X, identity ), Y ) ) ] )
% 0.83/1.21 , substitution( 0, [ :=( X, Y ), :=( Y, X )] ), permutation( 0, [ ==>( 0, 0
% 0.83/1.21 )] ) ).
% 0.83/1.21
% 0.83/1.21
% 0.83/1.21 eqswap(
% 0.83/1.21 clause( 2633, [ =( multiply( 'least_upper_bound'( X, identity ), Y ),
% 0.83/1.21 'least_upper_bound'( multiply( X, Y ), Y ) ) ] )
% 0.83/1.21 , clause( 101, [ =( 'least_upper_bound'( multiply( Y, X ), X ), multiply(
% 0.83/1.21 'least_upper_bound'( Y, identity ), X ) ) ] )
% 0.83/1.21 , 0, substitution( 0, [ :=( X, Y ), :=( Y, X )] )).
% 0.83/1.21
% 0.83/1.21
% 0.83/1.21 paramod(
% 0.83/1.21 clause( 2634, [ =( multiply( b, X ), 'least_upper_bound'( multiply( b, X )
% 0.83/1.21 , X ) ) ] )
% 0.83/1.21 , clause( 47, [ =( 'least_upper_bound'( b, identity ), b ) ] )
% 0.83/1.21 , 0, clause( 2633, [ =( multiply( 'least_upper_bound'( X, identity ), Y ),
% 0.83/1.21 'least_upper_bound'( multiply( X, Y ), Y ) ) ] )
% 0.83/1.21 , 0, 2, substitution( 0, [] ), substitution( 1, [ :=( X, b ), :=( Y, X )] )
% 0.83/1.21 ).
% 0.83/1.21
% 0.83/1.21
% 0.83/1.21 eqswap(
% 0.83/1.21 clause( 2635, [ =( 'least_upper_bound'( multiply( b, X ), X ), multiply( b
% 0.83/1.21 , X ) ) ] )
% 0.83/1.21 , clause( 2634, [ =( multiply( b, X ), 'least_upper_bound'( multiply( b, X
% 0.83/1.21 ), X ) ) ] )
% 0.83/1.21 , 0, substitution( 0, [ :=( X, X )] )).
% 0.83/1.21
% 0.83/1.21
% 0.83/1.21 subsumption(
% 0.83/1.21 clause( 2251, [ =( 'least_upper_bound'( multiply( b, X ), X ), multiply( b
% 0.83/1.21 , X ) ) ] )
% 0.83/1.21 , clause( 2635, [ =( 'least_upper_bound'( multiply( b, X ), X ), multiply(
% 0.83/1.21 b, X ) ) ] )
% 0.83/1.21 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.83/1.21
% 0.83/1.21
% 0.83/1.21 eqswap(
% 0.83/1.21 clause( 2637, [ =( X, 'greatest_lower_bound'( X, 'least_upper_bound'( Y, X
% 0.83/1.21 ) ) ) ] )
% 0.83/1.21 , clause( 24, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( Y, X ) )
% 0.83/1.21 , X ) ] )
% 0.83/1.21 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.83/1.21
% 0.83/1.21
% 0.83/1.21 paramod(
% 0.83/1.21 clause( 2638, [ =( X, 'greatest_lower_bound'( X, multiply( b, X ) ) ) ] )
% 0.83/1.21 , clause( 2251, [ =( 'least_upper_bound'( multiply( b, X ), X ), multiply(
% 0.83/1.21 b, X ) ) ] )
% 0.83/1.21 , 0, clause( 2637, [ =( X, 'greatest_lower_bound'( X, 'least_upper_bound'(
% 0.83/1.21 Y, X ) ) ) ] )
% 0.83/1.21 , 0, 4, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X ),
% 0.83/1.21 :=( Y, multiply( b, X ) )] )).
% 0.83/1.21
% 0.83/1.21
% 0.83/1.21 eqswap(
% 0.83/1.21 clause( 2639, [ =( 'greatest_lower_bound'( X, multiply( b, X ) ), X ) ] )
% 0.83/1.21 , clause( 2638, [ =( X, 'greatest_lower_bound'( X, multiply( b, X ) ) ) ]
% 0.83/1.21 )
% 0.83/1.21 , 0, substitution( 0, [ :=( X, X )] )).
% 0.83/1.21
% 0.83/1.21
% 0.83/1.21 subsumption(
% 0.83/1.21 clause( 2531, [ =( 'greatest_lower_bound'( X, multiply( b, X ) ), X ) ] )
% 0.83/1.21 , clause( 2639, [ =( 'greatest_lower_bound'( X, multiply( b, X ) ), X ) ]
% 0.83/1.21 )
% 0.83/1.21 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.83/1.21
% 0.83/1.21
% 0.83/1.21 eqswap(
% 0.83/1.21 clause( 2640, [ =( X, 'greatest_lower_bound'( X, multiply( b, X ) ) ) ] )
% 0.83/1.21 , clause( 2531, [ =( 'greatest_lower_bound'( X, multiply( b, X ) ), X ) ]
% 0.83/1.21 )
% 0.83/1.21 , 0, substitution( 0, [ :=( X, X )] )).
% 0.83/1.21
% 0.83/1.21
% 0.83/1.21 eqswap(
% 0.83/1.21 clause( 2641, [ ~( =( a, 'greatest_lower_bound'( a, multiply( b, a ) ) ) )
% 0.83/1.21 ] )
% 0.83/1.21 , clause( 17, [ ~( =( 'greatest_lower_bound'( a, multiply( b, a ) ), a ) )
% 0.83/1.21 ] )
% 0.83/1.21 , 0, substitution( 0, [] )).
% 0.83/1.21
% 0.83/1.21
% 0.83/1.21 resolution(
% 0.83/1.21 clause( 2642, [] )
% 0.83/1.21 , clause( 2641, [ ~( =( a, 'greatest_lower_bound'( a, multiply( b, a ) ) )
% 0.83/1.21 ) ] )
% 0.83/1.21 , 0, clause( 2640, [ =( X, 'greatest_lower_bound'( X, multiply( b, X ) ) )
% 0.83/1.21 ] )
% 0.83/1.21 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, a )] )).
% 0.83/1.21
% 0.83/1.21
% 0.83/1.21 subsumption(
% 0.83/1.21 clause( 2533, [] )
% 0.83/1.21 , clause( 2642, [] )
% 0.83/1.21 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.83/1.21
% 0.83/1.21
% 0.83/1.21 end.
% 0.83/1.21
% 0.83/1.21 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.83/1.21
% 0.83/1.21 Memory use:
% 0.83/1.21
% 0.83/1.21 space for terms: 31594
% 0.83/1.21 space for clauses: 258189
% 0.83/1.21
% 0.83/1.21
% 0.83/1.21 clauses generated: 31469
% 0.83/1.21 clauses kept: 2534
% 0.83/1.21 clauses selected: 305
% 0.83/1.21 clauses deleted: 20
% 0.83/1.21 clauses inuse deleted: 6
% 0.83/1.21
% 0.83/1.21 subsentry: 4799
% 0.83/1.21 literals s-matched: 4564
% 0.83/1.21 literals matched: 4560
% 0.83/1.21 full subsumption: 0
% 0.83/1.21
% 0.83/1.21 checksum: -239158290
% 0.83/1.21
% 0.83/1.21
% 0.83/1.21 Bliksem ended
%------------------------------------------------------------------------------