TSTP Solution File: GRP166-3 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : GRP166-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n023.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.84s 1.32s
% Output : Refutation 0.84s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP166-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.13 % Command : bliksem %s
% 0.13/0.35 % Computer : n023.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % DateTime : Tue Jun 14 02:15:06 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.84/1.32 *** allocated 10000 integers for termspace/termends
% 0.84/1.32 *** allocated 10000 integers for clauses
% 0.84/1.32 *** allocated 10000 integers for justifications
% 0.84/1.32 Bliksem 1.12
% 0.84/1.32
% 0.84/1.32
% 0.84/1.32 Automatic Strategy Selection
% 0.84/1.32
% 0.84/1.32 Clauses:
% 0.84/1.32 [
% 0.84/1.32 [ =( multiply( identity, X ), X ) ],
% 0.84/1.32 [ =( multiply( inverse( X ), X ), identity ) ],
% 0.84/1.32 [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply( Y, Z ) ) )
% 0.84/1.32 ],
% 0.84/1.32 [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'( Y, X ) ) ]
% 0.84/1.32 ,
% 0.84/1.32 [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X ) ) ],
% 0.84/1.32 [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.84/1.32 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ],
% 0.84/1.32 [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) ),
% 0.84/1.32 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ],
% 0.84/1.32 [ =( 'least_upper_bound'( X, X ), X ) ],
% 0.84/1.32 [ =( 'greatest_lower_bound'( X, X ), X ) ],
% 0.84/1.32 [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y ) ), X ) ]
% 0.84/1.32 ,
% 0.84/1.32 [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y ) ), X ) ]
% 0.84/1.32 ,
% 0.84/1.32 [ =( multiply( X, 'least_upper_bound'( Y, Z ) ), 'least_upper_bound'(
% 0.84/1.32 multiply( X, Y ), multiply( X, Z ) ) ) ],
% 0.84/1.32 [ =( multiply( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.84/1.32 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ],
% 0.84/1.32 [ =( multiply( 'least_upper_bound'( X, Y ), Z ), 'least_upper_bound'(
% 0.84/1.32 multiply( X, Z ), multiply( Y, Z ) ) ) ],
% 0.84/1.32 [ =( multiply( 'greatest_lower_bound'( X, Y ), Z ),
% 0.84/1.32 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ],
% 0.84/1.32 [ =( 'least_upper_bound'( a, identity ), a ) ],
% 0.84/1.32 [ =( 'least_upper_bound'( b, identity ), b ) ],
% 0.84/1.32 [ ~( =( 'least_upper_bound'( a, multiply( b, a ) ), multiply( b, a ) ) )
% 0.84/1.32 ]
% 0.84/1.32 ] .
% 0.84/1.32
% 0.84/1.32
% 0.84/1.32 percentage equality = 1.000000, percentage horn = 1.000000
% 0.84/1.32 This is a pure equality problem
% 0.84/1.32
% 0.84/1.32
% 0.84/1.32
% 0.84/1.32 Options Used:
% 0.84/1.32
% 0.84/1.32 useres = 1
% 0.84/1.32 useparamod = 1
% 0.84/1.32 useeqrefl = 1
% 0.84/1.32 useeqfact = 1
% 0.84/1.32 usefactor = 1
% 0.84/1.32 usesimpsplitting = 0
% 0.84/1.32 usesimpdemod = 5
% 0.84/1.32 usesimpres = 3
% 0.84/1.32
% 0.84/1.32 resimpinuse = 1000
% 0.84/1.32 resimpclauses = 20000
% 0.84/1.32 substype = eqrewr
% 0.84/1.32 backwardsubs = 1
% 0.84/1.32 selectoldest = 5
% 0.84/1.32
% 0.84/1.32 litorderings [0] = split
% 0.84/1.32 litorderings [1] = extend the termordering, first sorting on arguments
% 0.84/1.32
% 0.84/1.32 termordering = kbo
% 0.84/1.32
% 0.84/1.32 litapriori = 0
% 0.84/1.32 termapriori = 1
% 0.84/1.32 litaposteriori = 0
% 0.84/1.32 termaposteriori = 0
% 0.84/1.32 demodaposteriori = 0
% 0.84/1.32 ordereqreflfact = 0
% 0.84/1.32
% 0.84/1.32 litselect = negord
% 0.84/1.32
% 0.84/1.32 maxweight = 15
% 0.84/1.32 maxdepth = 30000
% 0.84/1.32 maxlength = 115
% 0.84/1.32 maxnrvars = 195
% 0.84/1.32 excuselevel = 1
% 0.84/1.32 increasemaxweight = 1
% 0.84/1.32
% 0.84/1.32 maxselected = 10000000
% 0.84/1.32 maxnrclauses = 10000000
% 0.84/1.32
% 0.84/1.32 showgenerated = 0
% 0.84/1.32 showkept = 0
% 0.84/1.32 showselected = 0
% 0.84/1.32 showdeleted = 0
% 0.84/1.32 showresimp = 1
% 0.84/1.32 showstatus = 2000
% 0.84/1.32
% 0.84/1.32 prologoutput = 1
% 0.84/1.32 nrgoals = 5000000
% 0.84/1.32 totalproof = 1
% 0.84/1.32
% 0.84/1.32 Symbols occurring in the translation:
% 0.84/1.32
% 0.84/1.32 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.84/1.32 . [1, 2] (w:1, o:21, a:1, s:1, b:0),
% 0.84/1.32 ! [4, 1] (w:0, o:15, a:1, s:1, b:0),
% 0.84/1.32 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.84/1.32 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.84/1.32 identity [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.84/1.32 multiply [41, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.84/1.32 inverse [42, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.84/1.32 'greatest_lower_bound' [45, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.84/1.32 'least_upper_bound' [46, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.84/1.32 a [47, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.84/1.32 b [48, 0] (w:1, o:14, a:1, s:1, b:0).
% 0.84/1.32
% 0.84/1.32
% 0.84/1.32 Starting Search:
% 0.84/1.32
% 0.84/1.32 Resimplifying inuse:
% 0.84/1.32 Done
% 0.84/1.32
% 0.84/1.32
% 0.84/1.32 Intermediate Status:
% 0.84/1.32 Generated: 27623
% 0.84/1.32 Kept: 2010
% 0.84/1.32 Inuse: 273
% 0.84/1.32 Deleted: 17
% 0.84/1.32 Deletedinuse: 6
% 0.84/1.32
% 0.84/1.32 Resimplifying inuse:
% 0.84/1.32 Done
% 0.84/1.32
% 0.84/1.32
% 0.84/1.32 Bliksems!, er is een bewijs:
% 0.84/1.32 % SZS status Unsatisfiable
% 0.84/1.32 % SZS output start Refutation
% 0.84/1.32
% 0.84/1.32 clause( 0, [ =( multiply( identity, X ), X ) ] )
% 0.84/1.32 .
% 0.84/1.32 clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X ) )
% 0.84/1.32 ] )
% 0.84/1.32 .
% 0.84/1.32 clause( 13, [ =( 'least_upper_bound'( multiply( X, Z ), multiply( Y, Z ) )
% 0.84/1.32 , multiply( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.84/1.32 .
% 0.84/1.32 clause( 16, [ =( 'least_upper_bound'( b, identity ), b ) ] )
% 0.84/1.32 .
% 0.84/1.32 clause( 17, [ ~( =( 'least_upper_bound'( a, multiply( b, a ) ), multiply( b
% 0.84/1.32 , a ) ) ) ] )
% 0.84/1.32 .
% 0.84/1.32 clause( 19, [ =( 'least_upper_bound'( identity, b ), b ) ] )
% 0.84/1.32 .
% 0.84/1.32 clause( 109, [ =( 'least_upper_bound'( X, multiply( Y, X ) ), multiply(
% 0.84/1.32 'least_upper_bound'( identity, Y ), X ) ) ] )
% 0.84/1.32 .
% 0.84/1.32 clause( 2292, [] )
% 0.84/1.32 .
% 0.84/1.32
% 0.84/1.32
% 0.84/1.32 % SZS output end Refutation
% 0.84/1.32 found a proof!
% 0.84/1.32
% 0.84/1.32 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.84/1.32
% 0.84/1.32 initialclauses(
% 0.84/1.32 [ clause( 2294, [ =( multiply( identity, X ), X ) ] )
% 0.84/1.32 , clause( 2295, [ =( multiply( inverse( X ), X ), identity ) ] )
% 0.84/1.32 , clause( 2296, [ =( multiply( multiply( X, Y ), Z ), multiply( X, multiply(
% 0.84/1.32 Y, Z ) ) ) ] )
% 0.84/1.32 , clause( 2297, [ =( 'greatest_lower_bound'( X, Y ), 'greatest_lower_bound'(
% 0.84/1.32 Y, X ) ) ] )
% 0.84/1.32 , clause( 2298, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X
% 0.84/1.32 ) ) ] )
% 0.84/1.32 , clause( 2299, [ =( 'greatest_lower_bound'( X, 'greatest_lower_bound'( Y,
% 0.84/1.32 Z ) ), 'greatest_lower_bound'( 'greatest_lower_bound'( X, Y ), Z ) ) ] )
% 0.84/1.32 , clause( 2300, [ =( 'least_upper_bound'( X, 'least_upper_bound'( Y, Z ) )
% 0.84/1.32 , 'least_upper_bound'( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.84/1.32 , clause( 2301, [ =( 'least_upper_bound'( X, X ), X ) ] )
% 0.84/1.32 , clause( 2302, [ =( 'greatest_lower_bound'( X, X ), X ) ] )
% 0.84/1.32 , clause( 2303, [ =( 'least_upper_bound'( X, 'greatest_lower_bound'( X, Y )
% 0.84/1.32 ), X ) ] )
% 0.84/1.32 , clause( 2304, [ =( 'greatest_lower_bound'( X, 'least_upper_bound'( X, Y )
% 0.84/1.32 ), X ) ] )
% 0.84/1.32 , clause( 2305, [ =( multiply( X, 'least_upper_bound'( Y, Z ) ),
% 0.84/1.32 'least_upper_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ] )
% 0.84/1.32 , clause( 2306, [ =( multiply( X, 'greatest_lower_bound'( Y, Z ) ),
% 0.84/1.32 'greatest_lower_bound'( multiply( X, Y ), multiply( X, Z ) ) ) ] )
% 0.84/1.32 , clause( 2307, [ =( multiply( 'least_upper_bound'( X, Y ), Z ),
% 0.84/1.32 'least_upper_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ] )
% 0.84/1.32 , clause( 2308, [ =( multiply( 'greatest_lower_bound'( X, Y ), Z ),
% 0.84/1.32 'greatest_lower_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ] )
% 0.84/1.32 , clause( 2309, [ =( 'least_upper_bound'( a, identity ), a ) ] )
% 0.84/1.32 , clause( 2310, [ =( 'least_upper_bound'( b, identity ), b ) ] )
% 0.84/1.32 , clause( 2311, [ ~( =( 'least_upper_bound'( a, multiply( b, a ) ),
% 0.84/1.32 multiply( b, a ) ) ) ] )
% 0.84/1.32 ] ).
% 0.84/1.32
% 0.84/1.32
% 0.84/1.32
% 0.84/1.32 subsumption(
% 0.84/1.32 clause( 0, [ =( multiply( identity, X ), X ) ] )
% 0.84/1.32 , clause( 2294, [ =( multiply( identity, X ), X ) ] )
% 0.84/1.32 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.84/1.32
% 0.84/1.32
% 0.84/1.32 subsumption(
% 0.84/1.32 clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X ) )
% 0.84/1.32 ] )
% 0.84/1.32 , clause( 2298, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X
% 0.84/1.32 ) ) ] )
% 0.84/1.32 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.84/1.32 )] ) ).
% 0.84/1.32
% 0.84/1.32
% 0.84/1.32 eqswap(
% 0.84/1.32 clause( 2327, [ =( 'least_upper_bound'( multiply( X, Z ), multiply( Y, Z )
% 0.84/1.32 ), multiply( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.84/1.32 , clause( 2307, [ =( multiply( 'least_upper_bound'( X, Y ), Z ),
% 0.84/1.32 'least_upper_bound'( multiply( X, Z ), multiply( Y, Z ) ) ) ] )
% 0.84/1.32 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.84/1.32
% 0.84/1.32
% 0.84/1.32 subsumption(
% 0.84/1.32 clause( 13, [ =( 'least_upper_bound'( multiply( X, Z ), multiply( Y, Z ) )
% 0.84/1.32 , multiply( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.84/1.32 , clause( 2327, [ =( 'least_upper_bound'( multiply( X, Z ), multiply( Y, Z
% 0.84/1.32 ) ), multiply( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.84/1.32 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.84/1.32 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.84/1.32
% 0.84/1.32
% 0.84/1.32 subsumption(
% 0.84/1.32 clause( 16, [ =( 'least_upper_bound'( b, identity ), b ) ] )
% 0.84/1.32 , clause( 2310, [ =( 'least_upper_bound'( b, identity ), b ) ] )
% 0.84/1.32 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.84/1.32
% 0.84/1.32
% 0.84/1.32 subsumption(
% 0.84/1.32 clause( 17, [ ~( =( 'least_upper_bound'( a, multiply( b, a ) ), multiply( b
% 0.84/1.32 , a ) ) ) ] )
% 0.84/1.32 , clause( 2311, [ ~( =( 'least_upper_bound'( a, multiply( b, a ) ),
% 0.84/1.32 multiply( b, a ) ) ) ] )
% 0.84/1.32 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.84/1.32
% 0.84/1.32
% 0.84/1.32 eqswap(
% 0.84/1.32 clause( 2359, [ =( b, 'least_upper_bound'( b, identity ) ) ] )
% 0.84/1.32 , clause( 16, [ =( 'least_upper_bound'( b, identity ), b ) ] )
% 0.84/1.32 , 0, substitution( 0, [] )).
% 0.84/1.32
% 0.84/1.32
% 0.84/1.32 paramod(
% 0.84/1.32 clause( 2360, [ =( b, 'least_upper_bound'( identity, b ) ) ] )
% 0.84/1.32 , clause( 4, [ =( 'least_upper_bound'( X, Y ), 'least_upper_bound'( Y, X )
% 0.84/1.32 ) ] )
% 0.84/1.32 , 0, clause( 2359, [ =( b, 'least_upper_bound'( b, identity ) ) ] )
% 0.84/1.32 , 0, 2, substitution( 0, [ :=( X, b ), :=( Y, identity )] ), substitution(
% 0.84/1.32 1, [] )).
% 0.84/1.32
% 0.84/1.32
% 0.84/1.32 eqswap(
% 0.84/1.32 clause( 2363, [ =( 'least_upper_bound'( identity, b ), b ) ] )
% 0.84/1.32 , clause( 2360, [ =( b, 'least_upper_bound'( identity, b ) ) ] )
% 0.84/1.32 , 0, substitution( 0, [] )).
% 0.84/1.32
% 0.84/1.32
% 0.84/1.32 subsumption(
% 0.84/1.32 clause( 19, [ =( 'least_upper_bound'( identity, b ), b ) ] )
% 0.84/1.32 , clause( 2363, [ =( 'least_upper_bound'( identity, b ), b ) ] )
% 0.84/1.32 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.84/1.32
% 0.84/1.32
% 0.84/1.32 eqswap(
% 0.84/1.32 clause( 2365, [ =( multiply( 'least_upper_bound'( X, Z ), Y ),
% 0.84/1.32 'least_upper_bound'( multiply( X, Y ), multiply( Z, Y ) ) ) ] )
% 0.84/1.32 , clause( 13, [ =( 'least_upper_bound'( multiply( X, Z ), multiply( Y, Z )
% 0.84/1.32 ), multiply( 'least_upper_bound'( X, Y ), Z ) ) ] )
% 0.84/1.32 , 0, substitution( 0, [ :=( X, X ), :=( Y, Z ), :=( Z, Y )] )).
% 0.84/1.32
% 0.84/1.32
% 0.84/1.32 paramod(
% 0.84/1.32 clause( 2366, [ =( multiply( 'least_upper_bound'( identity, X ), Y ),
% 0.84/1.32 'least_upper_bound'( Y, multiply( X, Y ) ) ) ] )
% 0.84/1.32 , clause( 0, [ =( multiply( identity, X ), X ) ] )
% 0.84/1.32 , 0, clause( 2365, [ =( multiply( 'least_upper_bound'( X, Z ), Y ),
% 0.84/1.32 'least_upper_bound'( multiply( X, Y ), multiply( Z, Y ) ) ) ] )
% 0.84/1.32 , 0, 7, substitution( 0, [ :=( X, Y )] ), substitution( 1, [ :=( X,
% 0.84/1.32 identity ), :=( Y, Y ), :=( Z, X )] )).
% 0.84/1.32
% 0.84/1.32
% 0.84/1.32 eqswap(
% 0.84/1.32 clause( 2368, [ =( 'least_upper_bound'( Y, multiply( X, Y ) ), multiply(
% 0.84/1.32 'least_upper_bound'( identity, X ), Y ) ) ] )
% 0.84/1.32 , clause( 2366, [ =( multiply( 'least_upper_bound'( identity, X ), Y ),
% 0.84/1.32 'least_upper_bound'( Y, multiply( X, Y ) ) ) ] )
% 0.84/1.32 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.84/1.32
% 0.84/1.32
% 0.84/1.32 subsumption(
% 0.84/1.32 clause( 109, [ =( 'least_upper_bound'( X, multiply( Y, X ) ), multiply(
% 0.84/1.32 'least_upper_bound'( identity, Y ), X ) ) ] )
% 0.84/1.32 , clause( 2368, [ =( 'least_upper_bound'( Y, multiply( X, Y ) ), multiply(
% 0.84/1.32 'least_upper_bound'( identity, X ), Y ) ) ] )
% 0.84/1.32 , substitution( 0, [ :=( X, Y ), :=( Y, X )] ), permutation( 0, [ ==>( 0, 0
% 0.84/1.32 )] ) ).
% 0.84/1.32
% 0.84/1.32
% 0.84/1.32 eqswap(
% 0.84/1.32 clause( 2371, [ ~( =( multiply( b, a ), 'least_upper_bound'( a, multiply( b
% 0.84/1.32 , a ) ) ) ) ] )
% 0.84/1.32 , clause( 17, [ ~( =( 'least_upper_bound'( a, multiply( b, a ) ), multiply(
% 0.84/1.32 b, a ) ) ) ] )
% 0.84/1.32 , 0, substitution( 0, [] )).
% 0.84/1.32
% 0.84/1.32
% 0.84/1.32 paramod(
% 0.84/1.32 clause( 2373, [ ~( =( multiply( b, a ), multiply( 'least_upper_bound'(
% 0.84/1.32 identity, b ), a ) ) ) ] )
% 0.84/1.32 , clause( 109, [ =( 'least_upper_bound'( X, multiply( Y, X ) ), multiply(
% 0.84/1.32 'least_upper_bound'( identity, Y ), X ) ) ] )
% 0.84/1.32 , 0, clause( 2371, [ ~( =( multiply( b, a ), 'least_upper_bound'( a,
% 0.84/1.32 multiply( b, a ) ) ) ) ] )
% 0.84/1.32 , 0, 5, substitution( 0, [ :=( X, a ), :=( Y, b )] ), substitution( 1, [] )
% 0.84/1.32 ).
% 0.84/1.32
% 0.84/1.32
% 0.84/1.32 paramod(
% 0.84/1.32 clause( 2374, [ ~( =( multiply( b, a ), multiply( b, a ) ) ) ] )
% 0.84/1.32 , clause( 19, [ =( 'least_upper_bound'( identity, b ), b ) ] )
% 0.84/1.32 , 0, clause( 2373, [ ~( =( multiply( b, a ), multiply( 'least_upper_bound'(
% 0.84/1.32 identity, b ), a ) ) ) ] )
% 0.84/1.32 , 0, 6, substitution( 0, [] ), substitution( 1, [] )).
% 0.84/1.32
% 0.84/1.32
% 0.84/1.32 eqrefl(
% 0.84/1.32 clause( 2375, [] )
% 0.84/1.32 , clause( 2374, [ ~( =( multiply( b, a ), multiply( b, a ) ) ) ] )
% 0.84/1.32 , 0, substitution( 0, [] )).
% 0.84/1.32
% 0.84/1.32
% 0.84/1.32 subsumption(
% 0.84/1.32 clause( 2292, [] )
% 0.84/1.32 , clause( 2375, [] )
% 0.84/1.32 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.84/1.32
% 0.84/1.32
% 0.84/1.32 end.
% 0.84/1.32
% 0.84/1.32 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.84/1.32
% 0.84/1.32 Memory use:
% 0.84/1.32
% 0.84/1.32 space for terms: 28595
% 0.84/1.32 space for clauses: 233155
% 0.84/1.32
% 0.84/1.32
% 0.84/1.32 clauses generated: 29524
% 0.84/1.32 clauses kept: 2293
% 0.84/1.32 clauses selected: 294
% 0.84/1.32 clauses deleted: 18
% 0.84/1.32 clauses inuse deleted: 6
% 0.84/1.32
% 0.84/1.32 subsentry: 4227
% 0.84/1.32 literals s-matched: 4055
% 0.84/1.32 literals matched: 4055
% 0.84/1.32 full subsumption: 0
% 0.84/1.32
% 0.84/1.32 checksum: -413870675
% 0.84/1.32
% 0.84/1.32
% 0.84/1.32 Bliksem ended
%------------------------------------------------------------------------------