%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : GRP192-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n006.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.43s 1.08s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP192-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.13 % Command : bliksem %s
% 0.12/0.34 % Computer : n006.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % DateTime : Tue Jun 14 06:33:26 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.43/1.08 *** allocated 10000 integers for termspace/termends
% 0.43/1.08 *** allocated 10000 integers for clauses
% 0.43/1.08 *** allocated 10000 integers for justifications
% 0.43/1.08 Bliksem 1.12
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 Automatic Strategy Selection
% 0.43/1.08
% 0.43/1.08 Clauses:
% 0.43/1.08 [
% 0.43/1.08 [ =( multiply( identity, X ), X ) ],
% 0.43/1.08 [ =( multiply( inverse( X ), X ), identity ) ],
% 0.43/1.08 [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply( Y, Z ) ) )
% 0.43/1.08 ],
% 0.43/1.08 [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y, X ) ) ]
% 0.43/1.08 ,
% 0.43/1.08 [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X ) ) ],
% 0.43/1.08 [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.43/1.08 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ],
% 0.43/1.08 [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.43/1.08 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ],
% 0.43/1.08 [ =( 'least_upper_bound'( X, X ), X ) ],
% 0.43/1.08 [ =( 'greatest_lower_bound'( X, X ), X ) ],
% 0.43/1.08 [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) ), X ) ]
% 0.43/1.08 ,
% 0.43/1.08 [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) ), X ) ]
% 0.43/1.08 ,
% 0.43/1.08 [ =( multiply( X, 'least_upper_bound'( Y, Z ) ), 'least_upper_bound'(
% 0.43/1.08 multiply( X, Y ), multiply( X, Z ) ) ) ],
% 0.43/1.08 [ =( multiply( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.43/1.08 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ],
% 0.43/1.08 [ =( multiply( 'least_upper_bound'( X, Y ), Z ), 'least_upper_bound'(
% 0.43/1.08 multiply( X, Z ), multiply( Y, Z ) ) ) ],
% 0.43/1.08 [ =( multiply( 'greatest_lower_bound'( X, Y ), Z ),
% 0.43/1.08 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ],
% 0.43/1.08 [ =( 'least_upper_bound'( identity, X ), X ) ],
% 0.43/1.08 [ ~( =( multiply( a, b ), multiply( b, a ) ) ) ]
% 0.43/1.08 ] .
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 percentage equality = 1.000000, percentage horn = 1.000000
% 0.43/1.08 This is a pure equality problem
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 Options Used:
% 0.43/1.08
% 0.43/1.08 useres = 1
% 0.43/1.08 useparamod = 1
% 0.43/1.08 useeqrefl = 1
% 0.43/1.08 useeqfact = 1
% 0.43/1.08 usefactor = 1
% 0.43/1.08 usesimpsplitting = 0
% 0.43/1.08 usesimpdemod = 5
% 0.43/1.08 usesimpres = 3
% 0.43/1.08
% 0.43/1.08 resimpinuse = 1000
% 0.43/1.08 resimpclauses = 20000
% 0.43/1.08 substype = eqrewr
% 0.43/1.08 backwardsubs = 1
% 0.43/1.08 selectoldest = 5
% 0.43/1.08
% 0.43/1.08 litorderings [0] = split
% 0.43/1.08 litorderings [1] = extend the termordering, first sorting on arguments
% 0.43/1.08
% 0.43/1.08 termordering = kbo
% 0.43/1.08
% 0.43/1.08 litapriori = 0
% 0.43/1.08 termapriori = 1
% 0.43/1.08 litaposteriori = 0
% 0.43/1.08 termaposteriori = 0
% 0.43/1.08 demodaposteriori = 0
% 0.43/1.08 ordereqreflfact = 0
% 0.43/1.08
% 0.43/1.08 litselect = negord
% 0.43/1.08
% 0.43/1.08 maxweight = 15
% 0.43/1.08 maxdepth = 30000
% 0.43/1.08 maxlength = 115
% 0.43/1.08 maxnrvars = 195
% 0.43/1.08 excuselevel = 1
% 0.43/1.08 increasemaxweight = 1
% 0.43/1.08
% 0.43/1.08 maxselected = 10000000
% 0.43/1.08 maxnrclauses = 10000000
% 0.43/1.08
% 0.43/1.08 showgenerated = 0
% 0.43/1.08 showkept = 0
% 0.43/1.08 showselected = 0
% 0.43/1.08 showdeleted = 0
% 0.43/1.08 showresimp = 1
% 0.43/1.08 showstatus = 2000
% 0.43/1.08
% 0.43/1.08 prologoutput = 1
% 0.43/1.08 nrgoals = 5000000
% 0.43/1.08 totalproof = 1
% 0.43/1.08
% 0.43/1.08 Symbols occurring in the translation:
% 0.43/1.08
% 0.43/1.08 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.43/1.08 . [1, 2] (w:1, o:21, a:1, s:1, b:0),
% 0.43/1.08 ! [4, 1] (w:0, o:15, a:1, s:1, b:0),
% 0.43/1.08 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.43/1.08 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.43/1.08 identity [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.43/1.08 multiply [41, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.43/1.08 inverse [42, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.43/1.08 'greatest_lower_bound' [45, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.43/1.08 'least_upper_bound' [46, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.43/1.08 a [47, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.43/1.08 b [48, 0] (w:1, o:14, a:1, s:1, b:0).
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 Starting Search:
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 Bliksems!, er is een bewijs:
% 0.43/1.08 % SZS status Unsatisfiable
% 0.43/1.08 % SZS output start Refutation
% 0.43/1.08
% 0.43/1.08 clause( 0, [ =( multiply( identity, X ), X ) ] )
% 0.43/1.08 .
% 0.43/1.08 clause( 1, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.43/1.08 .
% 0.43/1.08 clause( 3, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y,
% 0.43/1.08 X ) ) ] )
% 0.43/1.08 .
% 0.43/1.08 clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X ) )
% 0.43/1.08 ] )
% 0.43/1.08 .
% 0.43/1.08 clause( 10, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) ),
% 0.43/1.08 X ) ] )
% 0.43/1.08 .
% 0.43/1.08 clause( 12, [ =( 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z )
% 0.43/1.08 ), multiply( X, 'greatest_lower_bound'( Y, Z ) ) ) ] )
% 0.43/1.08 .
% 0.43/1.08 clause( 13, [ =( 'least_upper_bound'( multiply( X, Z ), multiply( Y, Z ) )
% 0.43/1.08 , multiply( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.43/1.08 .
% 0.43/1.08 clause( 15, [ =( 'least_upper_bound'( identity, X ), X ) ] )
% 0.43/1.08 .
% 0.43/1.08 clause( 16, [ ~( =( multiply( a, b ), multiply( b, a ) ) ) ] )
% 0.43/1.08 .
% 0.43/1.08 clause( 20, [ =( 'least_upper_bound'( X, identity ), X ) ] )
% 0.43/1.08 .
% 0.43/1.08 clause( 26, [ =( 'greatest_lower_bound'( 'least_upper_bound'( X, Y ), X ),
% 0.43/1.08 X ) ] )
% 0.43/1.08 .
% 0.43/1.08 clause( 28, [ =( 'greatest_lower_bound'( identity, X ), identity ) ] )
% 0.43/1.08 .
% 0.43/1.08 clause( 76, [ =( multiply( inverse( X ), 'greatest_lower_bound'( X, Y ) ),
% 0.43/1.08 identity ) ] )
% 0.43/1.08 .
% 0.43/1.08 clause( 84, [ =( multiply( inverse( 'least_upper_bound'( X, Y ) ), X ),
% 0.43/1.08 identity ) ] )
% 0.43/1.08 .
% 0.43/1.08 clause( 114, [ =( 'least_upper_bound'( X, multiply( Y, X ) ), multiply( Y,
% 0.43/1.08 X ) ) ] )
% 0.43/1.08 .
% 0.43/1.08 clause( 128, [ =( X, identity ) ] )
% 0.43/1.08 .
% 0.43/1.08 clause( 132, [ =( Y, X ) ] )
% 0.43/1.08 .
% 0.43/1.08 clause( 138, [ ~( =( multiply( a, X ), multiply( X, a ) ) ) ] )
% 0.43/1.08 .
% 0.43/1.08 clause( 139, [] )
% 0.43/1.08 .
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 % SZS output end Refutation
% 0.43/1.08 found a proof!
% 0.43/1.08
% 0.43/1.08 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.43/1.08
% 0.43/1.08 initialclauses(
% 0.43/1.08 [ clause( 141, [ =( multiply( identity, X ), X ) ] )
% 0.43/1.08 , clause( 142, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.43/1.08 , clause( 143, [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply(
% 0.43/1.08 Y, Z ) ) ) ] )
% 0.43/1.08 , clause( 144, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'(
% 0.43/1.08 Y, X ) ) ] )
% 0.43/1.08 , clause( 145, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X
% 0.43/1.08 ) ) ] )
% 0.43/1.08 , clause( 146, [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z
% 0.43/1.08 ) ), 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.43/1.08 , clause( 147, [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.43/1.08 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.43/1.08 , clause( 148, [ =( 'least_upper_bound'( X, X ), X ) ] )
% 0.43/1.08 , clause( 149, [ =( 'greatest_lower_bound'( X, X ), X ) ] )
% 0.43/1.08 , clause( 150, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y )
% 0.43/1.08 ), X ) ] )
% 0.43/1.08 , clause( 151, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y )
% 0.43/1.08 ), X ) ] )
% 0.43/1.08 , clause( 152, [ =( multiply( X, 'least_upper_bound'( Y, Z ) ),
% 0.43/1.08 'least_upper_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ] )
% 0.43/1.08 , clause( 153, [ =( multiply( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.43/1.08 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ] )
% 0.43/1.08 , clause( 154, [ =( multiply( 'least_upper_bound'( X, Y ), Z ),
% 0.43/1.08 'least_upper_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ] )
% 0.43/1.08 , clause( 155, [ =( multiply( 'greatest_lower_bound'( X, Y ), Z ),
% 0.43/1.08 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ] )
% 0.43/1.08 , clause( 156, [ =( 'least_upper_bound'( identity, X ), X ) ] )
% 0.43/1.08 , clause( 157, [ ~( =( multiply( a, b ), multiply( b, a ) ) ) ] )
% 0.43/1.08 ] ).
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 subsumption(
% 0.43/1.08 clause( 0, [ =( multiply( identity, X ), X ) ] )
% 0.43/1.08 , clause( 141, [ =( multiply( identity, X ), X ) ] )
% 0.43/1.08 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 subsumption(
% 0.43/1.08 clause( 1, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.43/1.08 , clause( 142, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.43/1.08 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 subsumption(
% 0.43/1.08 clause( 3, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y,
% 0.43/1.08 X ) ) ] )
% 0.43/1.08 , clause( 144, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'(
% 0.43/1.08 Y, X ) ) ] )
% 0.43/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.43/1.08 )] ) ).
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 subsumption(
% 0.43/1.08 clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X ) )
% 0.43/1.08 ] )
% 0.43/1.08 , clause( 145, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X
% 0.43/1.08 ) ) ] )
% 0.43/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.43/1.08 )] ) ).
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 subsumption(
% 0.43/1.08 clause( 10, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) ),
% 0.43/1.08 X ) ] )
% 0.43/1.08 , clause( 151, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y )
% 0.43/1.08 ), X ) ] )
% 0.43/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.43/1.08 )] ) ).
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 eqswap(
% 0.43/1.08 clause( 186, [ =( 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z
% 0.43/1.08 ) ), multiply( X, 'greatest_lower_bound'( Y, Z ) ) ) ] )
% 0.43/1.08 , clause( 153, [ =( multiply( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.43/1.08 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ] )
% 0.43/1.08 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 subsumption(
% 0.43/1.08 clause( 12, [ =( 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z )
% 0.43/1.08 ), multiply( X, 'greatest_lower_bound'( Y, Z ) ) ) ] )
% 0.43/1.08 , clause( 186, [ =( 'greatest_lower_bound'( multiply( X, Y ), multiply( X,
% 0.43/1.08 Z ) ), multiply( X, 'greatest_lower_bound'( Y, Z ) ) ) ] )
% 0.43/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.43/1.08 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 eqswap(
% 0.43/1.08 clause( 198, [ =( 'least_upper_bound'( multiply( X, Z ), multiply( Y, Z ) )
% 0.43/1.08 , multiply( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.43/1.08 , clause( 154, [ =( multiply( 'least_upper_bound'( X, Y ), Z ),
% 0.43/1.08 'least_upper_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ] )
% 0.43/1.08 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 subsumption(
% 0.43/1.08 clause( 13, [ =( 'least_upper_bound'( multiply( X, Z ), multiply( Y, Z ) )
% 0.43/1.08 , multiply( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.43/1.08 , clause( 198, [ =( 'least_upper_bound'( multiply( X, Z ), multiply( Y, Z )
% 0.43/1.08 ), multiply( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.43/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.43/1.08 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 subsumption(
% 0.43/1.08 clause( 15, [ =( 'least_upper_bound'( identity, X ), X ) ] )
% 0.43/1.08 , clause( 156, [ =( 'least_upper_bound'( identity, X ), X ) ] )
% 0.43/1.08 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 subsumption(
% 0.43/1.08 clause( 16, [ ~( =( multiply( a, b ), multiply( b, a ) ) ) ] )
% 0.43/1.08 , clause( 157, [ ~( =( multiply( a, b ), multiply( b, a ) ) ) ] )
% 0.43/1.08 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 eqswap(
% 0.43/1.08 clause( 228, [ =( X, 'least_upper_bound'( identity, X ) ) ] )
% 0.43/1.08 , clause( 15, [ =( 'least_upper_bound'( identity, X ), X ) ] )
% 0.43/1.08 , 0, substitution( 0, [ :=( X, X )] )).
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 paramod(
% 0.43/1.08 clause( 229, [ =( X, 'least_upper_bound'( X, identity ) ) ] )
% 0.43/1.08 , clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X )
% 0.43/1.08 ) ] )
% 0.43/1.08 , 0, clause( 228, [ =( X, 'least_upper_bound'( identity, X ) ) ] )
% 0.43/1.08 , 0, 2, substitution( 0, [ :=( X, identity ), :=( Y, X )] ), substitution(
% 0.43/1.08 1, [ :=( X, X )] )).
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 eqswap(
% 0.43/1.08 clause( 232, [ =( 'least_upper_bound'( X, identity ), X ) ] )
% 0.43/1.08 , clause( 229, [ =( X, 'least_upper_bound'( X, identity ) ) ] )
% 0.43/1.08 , 0, substitution( 0, [ :=( X, X )] )).
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 subsumption(
% 0.43/1.08 clause( 20, [ =( 'least_upper_bound'( X, identity ), X ) ] )
% 0.43/1.08 , clause( 232, [ =( 'least_upper_bound'( X, identity ), X ) ] )
% 0.43/1.08 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 eqswap(
% 0.43/1.08 clause( 233, [ =( X, 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y )
% 0.43/1.08 ) ) ] )
% 0.43/1.08 , clause( 10, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) )
% 0.43/1.08 , X ) ] )
% 0.43/1.08 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 paramod(
% 0.43/1.08 clause( 234, [ =( X, 'greatest_lower_bound'( 'least_upper_bound'( X, Y ), X
% 0.43/1.08 ) ) ] )
% 0.43/1.08 , clause( 3, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y
% 0.43/1.08 , X ) ) ] )
% 0.43/1.08 , 0, clause( 233, [ =( X, 'greatest_lower_bound'( X, 'least_upper_bound'( X
% 0.43/1.08 , Y ) ) ) ] )
% 0.43/1.08 , 0, 2, substitution( 0, [ :=( X, X ), :=( Y, 'least_upper_bound'( X, Y ) )] )
% 0.43/1.08 , substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 eqswap(
% 0.43/1.08 clause( 237, [ =( 'greatest_lower_bound'( 'least_upper_bound'( X, Y ), X )
% 0.43/1.08 , X ) ] )
% 0.43/1.08 , clause( 234, [ =( X, 'greatest_lower_bound'( 'least_upper_bound'( X, Y )
% 0.43/1.08 , X ) ) ] )
% 0.43/1.08 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 subsumption(
% 0.43/1.08 clause( 26, [ =( 'greatest_lower_bound'( 'least_upper_bound'( X, Y ), X ),
% 0.43/1.08 X ) ] )
% 0.43/1.08 , clause( 237, [ =( 'greatest_lower_bound'( 'least_upper_bound'( X, Y ), X
% 0.43/1.08 ), X ) ] )
% 0.43/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.43/1.08 )] ) ).
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 eqswap(
% 0.43/1.08 clause( 239, [ =( X, 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y )
% 0.43/1.08 ) ) ] )
% 0.43/1.08 , clause( 10, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) )
% 0.43/1.08 , X ) ] )
% 0.43/1.08 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 paramod(
% 0.43/1.08 clause( 240, [ =( identity, 'greatest_lower_bound'( identity, X ) ) ] )
% 0.43/1.08 , clause( 15, [ =( 'least_upper_bound'( identity, X ), X ) ] )
% 0.43/1.08 , 0, clause( 239, [ =( X, 'greatest_lower_bound'( X, 'least_upper_bound'( X
% 0.43/1.08 , Y ) ) ) ] )
% 0.43/1.08 , 0, 4, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X,
% 0.43/1.08 identity ), :=( Y, X )] )).
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 eqswap(
% 0.43/1.08 clause( 241, [ =( 'greatest_lower_bound'( identity, X ), identity ) ] )
% 0.43/1.08 , clause( 240, [ =( identity, 'greatest_lower_bound'( identity, X ) ) ] )
% 0.43/1.08 , 0, substitution( 0, [ :=( X, X )] )).
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 subsumption(
% 0.43/1.08 clause( 28, [ =( 'greatest_lower_bound'( identity, X ), identity ) ] )
% 0.43/1.08 , clause( 241, [ =( 'greatest_lower_bound'( identity, X ), identity ) ] )
% 0.43/1.08 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 eqswap(
% 0.43/1.08 clause( 243, [ =( multiply( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.43/1.08 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ] )
% 0.43/1.08 , clause( 12, [ =( 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z
% 0.43/1.08 ) ), multiply( X, 'greatest_lower_bound'( Y, Z ) ) ) ] )
% 0.43/1.08 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 paramod(
% 0.43/1.08 clause( 246, [ =( multiply( inverse( X ), 'greatest_lower_bound'( X, Y ) )
% 0.43/1.08 , 'greatest_lower_bound'( identity, multiply( inverse( X ), Y ) ) ) ] )
% 0.43/1.08 , clause( 1, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.43/1.08 , 0, clause( 243, [ =( multiply( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.43/1.08 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ] )
% 0.43/1.08 , 0, 8, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, inverse(
% 0.43/1.08 X ) ), :=( Y, X ), :=( Z, Y )] )).
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 paramod(
% 0.43/1.08 clause( 248, [ =( multiply( inverse( X ), 'greatest_lower_bound'( X, Y ) )
% 0.43/1.08 , identity ) ] )
% 0.43/1.08 , clause( 28, [ =( 'greatest_lower_bound'( identity, X ), identity ) ] )
% 0.43/1.08 , 0, clause( 246, [ =( multiply( inverse( X ), 'greatest_lower_bound'( X, Y
% 0.43/1.08 ) ), 'greatest_lower_bound'( identity, multiply( inverse( X ), Y ) ) ) ]
% 0.43/1.08 )
% 0.43/1.08 , 0, 7, substitution( 0, [ :=( X, multiply( inverse( X ), Y ) )] ),
% 0.43/1.08 substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 subsumption(
% 0.43/1.08 clause( 76, [ =( multiply( inverse( X ), 'greatest_lower_bound'( X, Y ) ),
% 0.43/1.08 identity ) ] )
% 0.43/1.08 , clause( 248, [ =( multiply( inverse( X ), 'greatest_lower_bound'( X, Y )
% 0.43/1.08 ), identity ) ] )
% 0.43/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.43/1.08 )] ) ).
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 eqswap(
% 0.43/1.08 clause( 251, [ =( identity, multiply( inverse( X ), 'greatest_lower_bound'(
% 0.43/1.08 X, Y ) ) ) ] )
% 0.43/1.08 , clause( 76, [ =( multiply( inverse( X ), 'greatest_lower_bound'( X, Y ) )
% 0.43/1.08 , identity ) ] )
% 0.43/1.08 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 paramod(
% 0.43/1.08 clause( 252, [ =( identity, multiply( inverse( 'least_upper_bound'( X, Y )
% 0.43/1.08 ), X ) ) ] )
% 0.43/1.08 , clause( 26, [ =( 'greatest_lower_bound'( 'least_upper_bound'( X, Y ), X )
% 0.43/1.08 , X ) ] )
% 0.43/1.08 , 0, clause( 251, [ =( identity, multiply( inverse( X ),
% 0.43/1.08 'greatest_lower_bound'( X, Y ) ) ) ] )
% 0.43/1.08 , 0, 7, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [
% 0.43/1.08 :=( X, 'least_upper_bound'( X, Y ) ), :=( Y, X )] )).
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 eqswap(
% 0.43/1.08 clause( 253, [ =( multiply( inverse( 'least_upper_bound'( X, Y ) ), X ),
% 0.43/1.08 identity ) ] )
% 0.43/1.08 , clause( 252, [ =( identity, multiply( inverse( 'least_upper_bound'( X, Y
% 0.43/1.08 ) ), X ) ) ] )
% 0.43/1.08 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 subsumption(
% 0.43/1.08 clause( 84, [ =( multiply( inverse( 'least_upper_bound'( X, Y ) ), X ),
% 0.43/1.08 identity ) ] )
% 0.43/1.08 , clause( 253, [ =( multiply( inverse( 'least_upper_bound'( X, Y ) ), X ),
% 0.43/1.08 identity ) ] )
% 0.43/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.43/1.08 )] ) ).
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 eqswap(
% 0.43/1.08 clause( 255, [ =( multiply( 'least_upper_bound'( X, Z ), Y ),
% 0.43/1.08 'least_upper_bound'( multiply( X, Y ), multiply( Z, Y ) ) ) ] )
% 0.43/1.08 , clause( 13, [ =( 'least_upper_bound'( multiply( X, Z ), multiply( Y, Z )
% 0.43/1.08 ), multiply( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.43/1.08 , 0, substitution( 0, [ :=( X, X ), :=( Y, Z ), :=( Z, Y )] )).
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 paramod(
% 0.43/1.08 clause( 257, [ =( multiply( 'least_upper_bound'( identity, X ), Y ),
% 0.43/1.08 'least_upper_bound'( Y, multiply( X, Y ) ) ) ] )
% 0.43/1.08 , clause( 0, [ =( multiply( identity, X ), X ) ] )
% 0.43/1.08 , 0, clause( 255, [ =( multiply( 'least_upper_bound'( X, Z ), Y ),
% 0.43/1.08 'least_upper_bound'( multiply( X, Y ), multiply( Z, Y ) ) ) ] )
% 0.43/1.08 , 0, 7, substitution( 0, [ :=( X, Y )] ), substitution( 1, [ :=( X,
% 0.43/1.08 identity ), :=( Y, Y ), :=( Z, X )] )).
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 paramod(
% 0.43/1.08 clause( 259, [ =( multiply( X, Y ), 'least_upper_bound'( Y, multiply( X, Y
% 0.43/1.08 ) ) ) ] )
% 0.43/1.08 , clause( 15, [ =( 'least_upper_bound'( identity, X ), X ) ] )
% 0.43/1.08 , 0, clause( 257, [ =( multiply( 'least_upper_bound'( identity, X ), Y ),
% 0.43/1.08 'least_upper_bound'( Y, multiply( X, Y ) ) ) ] )
% 0.43/1.08 , 0, 2, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X ),
% 0.43/1.08 :=( Y, Y )] )).
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 eqswap(
% 0.43/1.08 clause( 260, [ =( 'least_upper_bound'( Y, multiply( X, Y ) ), multiply( X,
% 0.43/1.08 Y ) ) ] )
% 0.43/1.08 , clause( 259, [ =( multiply( X, Y ), 'least_upper_bound'( Y, multiply( X,
% 0.43/1.08 Y ) ) ) ] )
% 0.43/1.08 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 subsumption(
% 0.43/1.08 clause( 114, [ =( 'least_upper_bound'( X, multiply( Y, X ) ), multiply( Y,
% 0.43/1.08 X ) ) ] )
% 0.43/1.08 , clause( 260, [ =( 'least_upper_bound'( Y, multiply( X, Y ) ), multiply( X
% 0.43/1.08 , Y ) ) ] )
% 0.43/1.08 , substitution( 0, [ :=( X, Y ), :=( Y, X )] ), permutation( 0, [ ==>( 0, 0
% 0.43/1.08 )] ) ).
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 eqswap(
% 0.43/1.08 clause( 262, [ =( multiply( Y, X ), 'least_upper_bound'( X, multiply( Y, X
% 0.43/1.08 ) ) ) ] )
% 0.43/1.08 , clause( 114, [ =( 'least_upper_bound'( X, multiply( Y, X ) ), multiply( Y
% 0.43/1.08 , X ) ) ] )
% 0.43/1.08 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.43/1.09
% 0.43/1.09
% 0.43/1.09 paramod(
% 0.43/1.09 clause( 266, [ =( multiply( inverse( 'least_upper_bound'( X, Y ) ), X ),
% 0.43/1.09 'least_upper_bound'( X, identity ) ) ] )
% 0.43/1.09 , clause( 84, [ =( multiply( inverse( 'least_upper_bound'( X, Y ) ), X ),
% 0.43/1.09 identity ) ] )
% 0.43/1.09 , 0, clause( 262, [ =( multiply( Y, X ), 'least_upper_bound'( X, multiply(
% 0.43/1.09 Y, X ) ) ) ] )
% 0.43/1.09 , 0, 9, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [
% 0.43/1.09 :=( X, X ), :=( Y, inverse( 'least_upper_bound'( X, Y ) ) )] )).
% 0.43/1.09
% 0.43/1.09
% 0.43/1.09 paramod(
% 0.43/1.09 clause( 267, [ =( identity, 'least_upper_bound'( X, identity ) ) ] )
% 0.43/1.09 , clause( 84, [ =( multiply( inverse( 'least_upper_bound'( X, Y ) ), X ),
% 0.43/1.09 identity ) ] )
% 0.43/1.09 , 0, clause( 266, [ =( multiply( inverse( 'least_upper_bound'( X, Y ) ), X
% 0.43/1.09 ), 'least_upper_bound'( X, identity ) ) ] )
% 0.43/1.09 , 0, 1, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [
% 0.43/1.09 :=( X, X ), :=( Y, Y )] )).
% 0.43/1.09
% 0.43/1.09
% 0.43/1.09 paramod(
% 0.43/1.09 clause( 270, [ =( identity, X ) ] )
% 0.43/1.09 , clause( 20, [ =( 'least_upper_bound'( X, identity ), X ) ] )
% 0.43/1.09 , 0, clause( 267, [ =( identity, 'least_upper_bound'( X, identity ) ) ] )
% 0.43/1.09 , 0, 2, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X )] )
% 0.43/1.09 ).
% 0.43/1.09
% 0.43/1.09
% 0.43/1.09 eqswap(
% 0.43/1.09 clause( 271, [ =( X, identity ) ] )
% 0.43/1.09 , clause( 270, [ =( identity, X ) ] )
% 0.43/1.09 , 0, substitution( 0, [ :=( X, X )] )).
% 0.43/1.09
% 0.43/1.09
% 0.43/1.09 subsumption(
% 0.43/1.09 clause( 128, [ =( X, identity ) ] )
% 0.43/1.09 , clause( 271, [ =( X, identity ) ] )
% 0.43/1.09 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.09
% 0.43/1.09
% 0.43/1.09 eqswap(
% 0.43/1.09 clause( 272, [ =( identity, X ) ] )
% 0.43/1.09 , clause( 128, [ =( X, identity ) ] )
% 0.43/1.09 , 0, substitution( 0, [ :=( X, X )] )).
% 0.43/1.09
% 0.43/1.09
% 0.43/1.09 eqswap(
% 0.43/1.09 clause( 273, [ =( identity, X ) ] )
% 0.43/1.09 , clause( 128, [ =( X, identity ) ] )
% 0.43/1.09 , 0, substitution( 0, [ :=( X, X )] )).
% 0.43/1.09
% 0.43/1.09
% 0.43/1.09 paramod(
% 0.43/1.09 clause( 274, [ =( Y, X ) ] )
% 0.43/1.09 , clause( 272, [ =( identity, X ) ] )
% 0.43/1.09 , 0, clause( 273, [ =( identity, X ) ] )
% 0.43/1.09 , 0, 1, substitution( 0, [ :=( X, Y )] ), substitution( 1, [ :=( X, X )] )
% 0.43/1.09 ).
% 0.43/1.09
% 0.43/1.09
% 0.43/1.09 subsumption(
% 0.43/1.09 clause( 132, [ =( Y, X ) ] )
% 0.43/1.09 , clause( 274, [ =( Y, X ) ] )
% 0.43/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.43/1.09 )] ) ).
% 0.43/1.09
% 0.43/1.09
% 0.43/1.09 eqswap(
% 0.43/1.09 clause( 275, [ ~( =( multiply( b, a ), multiply( a, b ) ) ) ] )
% 0.43/1.09 , clause( 16, [ ~( =( multiply( a, b ), multiply( b, a ) ) ) ] )
% 0.43/1.09 , 0, substitution( 0, [] )).
% 0.43/1.09
% 0.43/1.09
% 0.43/1.09 paramod(
% 0.43/1.09 clause( 279, [ ~( =( multiply( b, a ), X ) ) ] )
% 0.43/1.09 , clause( 132, [ =( Y, X ) ] )
% 0.43/1.09 , 0, clause( 275, [ ~( =( multiply( b, a ), multiply( a, b ) ) ) ] )
% 0.43/1.09 , 0, 5, substitution( 0, [ :=( X, X ), :=( Y, multiply( a, b ) )] ),
% 0.43/1.09 substitution( 1, [] )).
% 0.43/1.09
% 0.43/1.09
% 0.43/1.09 paramod(
% 0.43/1.09 clause( 280, [ ~( =( Y, X ) ) ] )
% 0.43/1.09 , clause( 132, [ =( Y, X ) ] )
% 0.43/1.09 , 0, clause( 279, [ ~( =( multiply( b, a ), X ) ) ] )
% 0.43/1.09 , 0, 2, substitution( 0, [ :=( X, Y ), :=( Y, multiply( b, a ) )] ),
% 0.43/1.09 substitution( 1, [ :=( X, X )] )).
% 0.43/1.09
% 0.43/1.09
% 0.43/1.09 subsumption(
% 0.43/1.09 clause( 138, [ ~( =( multiply( a, X ), multiply( X, a ) ) ) ] )
% 0.43/1.09 , clause( 280, [ ~( =( Y, X ) ) ] )
% 0.43/1.09 , substitution( 0, [ :=( X, multiply( X, a ) ), :=( Y, multiply( a, X ) )] )
% 0.43/1.09 , permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.09
% 0.43/1.09
% 0.43/1.09 eqswap(
% 0.43/1.09 clause( 281, [ ~( =( multiply( X, a ), multiply( a, X ) ) ) ] )
% 0.43/1.09 , clause( 138, [ ~( =( multiply( a, X ), multiply( X, a ) ) ) ] )
% 0.43/1.09 , 0, substitution( 0, [ :=( X, X )] )).
% 0.43/1.09
% 0.43/1.09
% 0.43/1.09 eqrefl(
% 0.43/1.09 clause( 282, [] )
% 0.43/1.09 , clause( 281, [ ~( =( multiply( X, a ), multiply( a, X ) ) ) ] )
% 0.43/1.09 , 0, substitution( 0, [ :=( X, a )] )).
% 0.43/1.09
% 0.43/1.09
% 0.43/1.09 subsumption(
% 0.43/1.09 clause( 139, [] )
% 0.43/1.09 , clause( 282, [] )
% 0.43/1.09 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.43/1.09
% 0.43/1.09
% 0.43/1.09 end.
% 0.43/1.09
% 0.43/1.09 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.43/1.09
% 0.43/1.09 Memory use:
% 0.43/1.09
% 0.43/1.09 space for terms: 1836
% 0.43/1.09 space for clauses: 14563
% 0.43/1.09
% 0.43/1.09
% 0.43/1.09 clauses generated: 780
% 0.43/1.09 clauses kept: 140
% 0.43/1.09 clauses selected: 35
% 0.43/1.09 clauses deleted: 0
% 0.43/1.09 clauses inuse deleted: 0
% 0.43/1.09
% 0.43/1.09 subsentry: 874
% 0.43/1.09 literals s-matched: 531
% 0.43/1.09 literals matched: 531
% 0.43/1.09 full subsumption: 0
% 0.43/1.09
% 0.43/1.09 checksum: -1374318940
% 0.43/1.09
% 0.43/1.09
% 0.43/1.09 Bliksem ended
%------------------------------------------------------------------------------