TSTP Solution File: GRP710-10 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : GRP710-10 : TPTP v8.1.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n017.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:39:11 EDT 2022
% Result : Unsatisfiable 0.47s 1.13s
% Output : Refutation 0.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP710-10 : TPTP v8.1.0. Released v8.1.0.
% 0.07/0.14 % Command : bliksem %s
% 0.14/0.35 % Computer : n017.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % DateTime : Tue Jun 14 12:17:39 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.47/1.13 *** allocated 10000 integers for termspace/termends
% 0.47/1.13 *** allocated 10000 integers for clauses
% 0.47/1.13 *** allocated 10000 integers for justifications
% 0.47/1.13 Bliksem 1.12
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 Automatic Strategy Selection
% 0.47/1.13
% 0.47/1.13 Clauses:
% 0.47/1.13 [
% 0.47/1.13 [ =( mult( X, unit ), X ) ],
% 0.47/1.13 [ =( mult( unit, X ), X ) ],
% 0.47/1.13 [ =( mult( X, mult( Y, mult( Y, Z ) ) ), mult( mult( mult( X, Y ), Y ),
% 0.47/1.13 Z ) ) ],
% 0.47/1.13 [ =( mult( X, i( X ) ), unit ) ],
% 0.47/1.13 [ =( mult( i( X ), X ), unit ) ],
% 0.47/1.13 [ ~( =( mult( x0, X ), x1 ) ) ]
% 0.47/1.13 ] .
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 percentage equality = 1.000000, percentage horn = 1.000000
% 0.47/1.13 This is a pure equality problem
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 Options Used:
% 0.47/1.13
% 0.47/1.13 useres = 1
% 0.47/1.13 useparamod = 1
% 0.47/1.13 useeqrefl = 1
% 0.47/1.13 useeqfact = 1
% 0.47/1.13 usefactor = 1
% 0.47/1.13 usesimpsplitting = 0
% 0.47/1.13 usesimpdemod = 5
% 0.47/1.13 usesimpres = 3
% 0.47/1.13
% 0.47/1.13 resimpinuse = 1000
% 0.47/1.13 resimpclauses = 20000
% 0.47/1.13 substype = eqrewr
% 0.47/1.13 backwardsubs = 1
% 0.47/1.13 selectoldest = 5
% 0.47/1.13
% 0.47/1.13 litorderings [0] = split
% 0.47/1.13 litorderings [1] = extend the termordering, first sorting on arguments
% 0.47/1.13
% 0.47/1.13 termordering = kbo
% 0.47/1.13
% 0.47/1.13 litapriori = 0
% 0.47/1.13 termapriori = 1
% 0.47/1.13 litaposteriori = 0
% 0.47/1.13 termaposteriori = 0
% 0.47/1.13 demodaposteriori = 0
% 0.47/1.13 ordereqreflfact = 0
% 0.47/1.13
% 0.47/1.13 litselect = negord
% 0.47/1.13
% 0.47/1.13 maxweight = 15
% 0.47/1.13 maxdepth = 30000
% 0.47/1.13 maxlength = 115
% 0.47/1.13 maxnrvars = 195
% 0.47/1.13 excuselevel = 1
% 0.47/1.13 increasemaxweight = 1
% 0.47/1.13
% 0.47/1.13 maxselected = 10000000
% 0.47/1.13 maxnrclauses = 10000000
% 0.47/1.13
% 0.47/1.13 showgenerated = 0
% 0.47/1.13 showkept = 0
% 0.47/1.13 showselected = 0
% 0.47/1.13 showdeleted = 0
% 0.47/1.13 showresimp = 1
% 0.47/1.13 showstatus = 2000
% 0.47/1.13
% 0.47/1.13 prologoutput = 1
% 0.47/1.13 nrgoals = 5000000
% 0.47/1.13 totalproof = 1
% 0.47/1.13
% 0.47/1.13 Symbols occurring in the translation:
% 0.47/1.13
% 0.47/1.13 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.47/1.13 . [1, 2] (w:1, o:22, a:1, s:1, b:0),
% 0.47/1.13 ! [4, 1] (w:0, o:16, a:1, s:1, b:0),
% 0.47/1.13 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.47/1.13 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.47/1.13 unit [40, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.47/1.13 mult [41, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.47/1.13 i [44, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.47/1.13 x0 [45, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.47/1.13 x1 [47, 0] (w:1, o:15, a:1, s:1, b:0).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 Starting Search:
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 Bliksems!, er is een bewijs:
% 0.47/1.13 % SZS status Unsatisfiable
% 0.47/1.13 % SZS output start Refutation
% 0.47/1.13
% 0.47/1.13 clause( 0, [ =( mult( X, unit ), X ) ] )
% 0.47/1.13 .
% 0.47/1.13 clause( 1, [ =( mult( unit, X ), X ) ] )
% 0.47/1.13 .
% 0.47/1.13 clause( 2, [ =( mult( X, mult( Y, mult( Y, Z ) ) ), mult( mult( mult( X, Y
% 0.47/1.13 ), Y ), Z ) ) ] )
% 0.47/1.13 .
% 0.47/1.13 clause( 3, [ =( mult( X, i( X ) ), unit ) ] )
% 0.47/1.13 .
% 0.47/1.13 clause( 5, [ ~( =( mult( x0, X ), x1 ) ) ] )
% 0.47/1.13 .
% 0.47/1.13 clause( 13, [ =( mult( X, mult( X, Y ) ), mult( mult( X, X ), Y ) ) ] )
% 0.47/1.13 .
% 0.47/1.13 clause( 50, [ =( mult( mult( X, X ), i( X ) ), X ) ] )
% 0.47/1.13 .
% 0.47/1.13 clause( 52, [ ~( =( mult( mult( x0, x0 ), X ), x1 ) ) ] )
% 0.47/1.13 .
% 0.47/1.13 clause( 58, [ ~( =( mult( mult( mult( mult( x0, x0 ), X ), X ), Y ), x1 ) )
% 0.47/1.13 ] )
% 0.47/1.13 .
% 0.47/1.13 clause( 92, [ ~( =( X, x1 ) ) ] )
% 0.47/1.13 .
% 0.47/1.13 clause( 93, [] )
% 0.47/1.13 .
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 % SZS output end Refutation
% 0.47/1.13 found a proof!
% 0.47/1.13
% 0.47/1.13 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.47/1.13
% 0.47/1.13 initialclauses(
% 0.47/1.13 [ clause( 95, [ =( mult( X, unit ), X ) ] )
% 0.47/1.13 , clause( 96, [ =( mult( unit, X ), X ) ] )
% 0.47/1.13 , clause( 97, [ =( mult( X, mult( Y, mult( Y, Z ) ) ), mult( mult( mult( X
% 0.47/1.13 , Y ), Y ), Z ) ) ] )
% 0.47/1.13 , clause( 98, [ =( mult( X, i( X ) ), unit ) ] )
% 0.47/1.13 , clause( 99, [ =( mult( i( X ), X ), unit ) ] )
% 0.47/1.13 , clause( 100, [ ~( =( mult( x0, X ), x1 ) ) ] )
% 0.47/1.13 ] ).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 subsumption(
% 0.47/1.13 clause( 0, [ =( mult( X, unit ), X ) ] )
% 0.47/1.13 , clause( 95, [ =( mult( X, unit ), X ) ] )
% 0.47/1.13 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 subsumption(
% 0.47/1.13 clause( 1, [ =( mult( unit, X ), X ) ] )
% 0.47/1.13 , clause( 96, [ =( mult( unit, X ), X ) ] )
% 0.47/1.13 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 subsumption(
% 0.47/1.13 clause( 2, [ =( mult( X, mult( Y, mult( Y, Z ) ) ), mult( mult( mult( X, Y
% 0.47/1.13 ), Y ), Z ) ) ] )
% 0.47/1.13 , clause( 97, [ =( mult( X, mult( Y, mult( Y, Z ) ) ), mult( mult( mult( X
% 0.47/1.13 , Y ), Y ), Z ) ) ] )
% 0.47/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.47/1.13 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 subsumption(
% 0.47/1.13 clause( 3, [ =( mult( X, i( X ) ), unit ) ] )
% 0.47/1.13 , clause( 98, [ =( mult( X, i( X ) ), unit ) ] )
% 0.47/1.13 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 subsumption(
% 0.47/1.13 clause( 5, [ ~( =( mult( x0, X ), x1 ) ) ] )
% 0.47/1.13 , clause( 100, [ ~( =( mult( x0, X ), x1 ) ) ] )
% 0.47/1.13 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 eqswap(
% 0.47/1.13 clause( 117, [ =( mult( mult( mult( X, Y ), Y ), Z ), mult( X, mult( Y,
% 0.47/1.13 mult( Y, Z ) ) ) ) ] )
% 0.47/1.13 , clause( 2, [ =( mult( X, mult( Y, mult( Y, Z ) ) ), mult( mult( mult( X,
% 0.47/1.13 Y ), Y ), Z ) ) ] )
% 0.47/1.13 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 paramod(
% 0.47/1.13 clause( 121, [ =( mult( mult( mult( unit, X ), X ), Y ), mult( X, mult( X,
% 0.47/1.13 Y ) ) ) ] )
% 0.47/1.13 , clause( 1, [ =( mult( unit, X ), X ) ] )
% 0.47/1.13 , 0, clause( 117, [ =( mult( mult( mult( X, Y ), Y ), Z ), mult( X, mult( Y
% 0.47/1.13 , mult( Y, Z ) ) ) ) ] )
% 0.47/1.13 , 0, 8, substitution( 0, [ :=( X, mult( X, mult( X, Y ) ) )] ),
% 0.47/1.13 substitution( 1, [ :=( X, unit ), :=( Y, X ), :=( Z, Y )] )).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 paramod(
% 0.47/1.13 clause( 127, [ =( mult( mult( X, X ), Y ), mult( X, mult( X, Y ) ) ) ] )
% 0.47/1.13 , clause( 1, [ =( mult( unit, X ), X ) ] )
% 0.47/1.13 , 0, clause( 121, [ =( mult( mult( mult( unit, X ), X ), Y ), mult( X, mult(
% 0.47/1.13 X, Y ) ) ) ] )
% 0.47/1.13 , 0, 3, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X ),
% 0.47/1.13 :=( Y, Y )] )).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 eqswap(
% 0.47/1.13 clause( 128, [ =( mult( X, mult( X, Y ) ), mult( mult( X, X ), Y ) ) ] )
% 0.47/1.13 , clause( 127, [ =( mult( mult( X, X ), Y ), mult( X, mult( X, Y ) ) ) ] )
% 0.47/1.13 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 subsumption(
% 0.47/1.13 clause( 13, [ =( mult( X, mult( X, Y ) ), mult( mult( X, X ), Y ) ) ] )
% 0.47/1.13 , clause( 128, [ =( mult( X, mult( X, Y ) ), mult( mult( X, X ), Y ) ) ] )
% 0.47/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.47/1.13 )] ) ).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 eqswap(
% 0.47/1.13 clause( 130, [ =( mult( mult( X, X ), Y ), mult( X, mult( X, Y ) ) ) ] )
% 0.47/1.13 , clause( 13, [ =( mult( X, mult( X, Y ) ), mult( mult( X, X ), Y ) ) ] )
% 0.47/1.13 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 paramod(
% 0.47/1.13 clause( 133, [ =( mult( mult( X, X ), i( X ) ), mult( X, unit ) ) ] )
% 0.47/1.13 , clause( 3, [ =( mult( X, i( X ) ), unit ) ] )
% 0.47/1.13 , 0, clause( 130, [ =( mult( mult( X, X ), Y ), mult( X, mult( X, Y ) ) ) ]
% 0.47/1.13 )
% 0.47/1.13 , 0, 9, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X ),
% 0.47/1.13 :=( Y, i( X ) )] )).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 paramod(
% 0.47/1.13 clause( 134, [ =( mult( mult( X, X ), i( X ) ), X ) ] )
% 0.47/1.13 , clause( 0, [ =( mult( X, unit ), X ) ] )
% 0.47/1.13 , 0, clause( 133, [ =( mult( mult( X, X ), i( X ) ), mult( X, unit ) ) ] )
% 0.47/1.13 , 0, 7, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X )] )
% 0.47/1.13 ).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 subsumption(
% 0.47/1.13 clause( 50, [ =( mult( mult( X, X ), i( X ) ), X ) ] )
% 0.47/1.13 , clause( 134, [ =( mult( mult( X, X ), i( X ) ), X ) ] )
% 0.47/1.13 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 eqswap(
% 0.47/1.13 clause( 137, [ ~( =( x1, mult( x0, X ) ) ) ] )
% 0.47/1.13 , clause( 5, [ ~( =( mult( x0, X ), x1 ) ) ] )
% 0.47/1.13 , 0, substitution( 0, [ :=( X, X )] )).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 paramod(
% 0.47/1.13 clause( 138, [ ~( =( x1, mult( mult( x0, x0 ), X ) ) ) ] )
% 0.47/1.13 , clause( 13, [ =( mult( X, mult( X, Y ) ), mult( mult( X, X ), Y ) ) ] )
% 0.47/1.13 , 0, clause( 137, [ ~( =( x1, mult( x0, X ) ) ) ] )
% 0.47/1.13 , 0, 3, substitution( 0, [ :=( X, x0 ), :=( Y, X )] ), substitution( 1, [
% 0.47/1.13 :=( X, mult( x0, X ) )] )).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 eqswap(
% 0.47/1.13 clause( 139, [ ~( =( mult( mult( x0, x0 ), X ), x1 ) ) ] )
% 0.47/1.13 , clause( 138, [ ~( =( x1, mult( mult( x0, x0 ), X ) ) ) ] )
% 0.47/1.13 , 0, substitution( 0, [ :=( X, X )] )).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 subsumption(
% 0.47/1.13 clause( 52, [ ~( =( mult( mult( x0, x0 ), X ), x1 ) ) ] )
% 0.47/1.13 , clause( 139, [ ~( =( mult( mult( x0, x0 ), X ), x1 ) ) ] )
% 0.47/1.13 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 eqswap(
% 0.47/1.13 clause( 141, [ ~( =( x1, mult( mult( x0, x0 ), X ) ) ) ] )
% 0.47/1.13 , clause( 52, [ ~( =( mult( mult( x0, x0 ), X ), x1 ) ) ] )
% 0.47/1.13 , 0, substitution( 0, [ :=( X, X )] )).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 paramod(
% 0.47/1.13 clause( 142, [ ~( =( x1, mult( mult( mult( mult( x0, x0 ), X ), X ), Y ) )
% 0.47/1.13 ) ] )
% 0.47/1.13 , clause( 2, [ =( mult( X, mult( Y, mult( Y, Z ) ) ), mult( mult( mult( X,
% 0.47/1.13 Y ), Y ), Z ) ) ] )
% 0.47/1.13 , 0, clause( 141, [ ~( =( x1, mult( mult( x0, x0 ), X ) ) ) ] )
% 0.47/1.13 , 0, 3, substitution( 0, [ :=( X, mult( x0, x0 ) ), :=( Y, X ), :=( Z, Y )] )
% 0.47/1.13 , substitution( 1, [ :=( X, mult( X, mult( X, Y ) ) )] )).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 eqswap(
% 0.47/1.13 clause( 143, [ ~( =( mult( mult( mult( mult( x0, x0 ), X ), X ), Y ), x1 )
% 0.47/1.13 ) ] )
% 0.47/1.13 , clause( 142, [ ~( =( x1, mult( mult( mult( mult( x0, x0 ), X ), X ), Y )
% 0.47/1.13 ) ) ] )
% 0.47/1.13 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 subsumption(
% 0.47/1.13 clause( 58, [ ~( =( mult( mult( mult( mult( x0, x0 ), X ), X ), Y ), x1 ) )
% 0.47/1.13 ] )
% 0.47/1.13 , clause( 143, [ ~( =( mult( mult( mult( mult( x0, x0 ), X ), X ), Y ), x1
% 0.47/1.13 ) ) ] )
% 0.47/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.47/1.13 )] ) ).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 eqswap(
% 0.47/1.13 clause( 145, [ ~( =( x1, mult( mult( mult( mult( x0, x0 ), X ), X ), Y ) )
% 0.47/1.13 ) ] )
% 0.47/1.13 , clause( 58, [ ~( =( mult( mult( mult( mult( x0, x0 ), X ), X ), Y ), x1 )
% 0.47/1.13 ) ] )
% 0.47/1.13 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 paramod(
% 0.47/1.13 clause( 148, [ ~( =( x1, mult( mult( x0, i( x0 ) ), X ) ) ) ] )
% 0.47/1.13 , clause( 50, [ =( mult( mult( X, X ), i( X ) ), X ) ] )
% 0.47/1.13 , 0, clause( 145, [ ~( =( x1, mult( mult( mult( mult( x0, x0 ), X ), X ), Y
% 0.47/1.13 ) ) ) ] )
% 0.47/1.13 , 0, 5, substitution( 0, [ :=( X, x0 )] ), substitution( 1, [ :=( X, i( x0
% 0.47/1.13 ) ), :=( Y, X )] )).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 paramod(
% 0.47/1.13 clause( 149, [ ~( =( x1, mult( unit, X ) ) ) ] )
% 0.47/1.13 , clause( 3, [ =( mult( X, i( X ) ), unit ) ] )
% 0.47/1.13 , 0, clause( 148, [ ~( =( x1, mult( mult( x0, i( x0 ) ), X ) ) ) ] )
% 0.47/1.13 , 0, 4, substitution( 0, [ :=( X, x0 )] ), substitution( 1, [ :=( X, X )] )
% 0.47/1.13 ).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 paramod(
% 0.47/1.13 clause( 150, [ ~( =( x1, X ) ) ] )
% 0.47/1.13 , clause( 1, [ =( mult( unit, X ), X ) ] )
% 0.47/1.13 , 0, clause( 149, [ ~( =( x1, mult( unit, X ) ) ) ] )
% 0.47/1.13 , 0, 3, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X )] )
% 0.47/1.13 ).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 eqswap(
% 0.47/1.13 clause( 151, [ ~( =( X, x1 ) ) ] )
% 0.47/1.13 , clause( 150, [ ~( =( x1, X ) ) ] )
% 0.47/1.13 , 0, substitution( 0, [ :=( X, X )] )).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 subsumption(
% 0.47/1.13 clause( 92, [ ~( =( X, x1 ) ) ] )
% 0.47/1.13 , clause( 151, [ ~( =( X, x1 ) ) ] )
% 0.47/1.13 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 eqswap(
% 0.47/1.13 clause( 152, [ ~( =( x1, X ) ) ] )
% 0.47/1.13 , clause( 92, [ ~( =( X, x1 ) ) ] )
% 0.47/1.13 , 0, substitution( 0, [ :=( X, X )] )).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 eqrefl(
% 0.47/1.13 clause( 153, [] )
% 0.47/1.13 , clause( 152, [ ~( =( x1, X ) ) ] )
% 0.47/1.13 , 0, substitution( 0, [ :=( X, x1 )] )).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 subsumption(
% 0.47/1.13 clause( 93, [] )
% 0.47/1.13 , clause( 153, [] )
% 0.47/1.13 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 end.
% 0.47/1.13
% 0.47/1.13 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.47/1.13
% 0.47/1.13 Memory use:
% 0.47/1.13
% 0.47/1.13 space for terms: 1209
% 0.47/1.13 space for clauses: 8511
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 clauses generated: 600
% 0.47/1.13 clauses kept: 94
% 0.47/1.13 clauses selected: 43
% 0.47/1.13 clauses deleted: 2
% 0.47/1.13 clauses inuse deleted: 0
% 0.47/1.13
% 0.47/1.13 subsentry: 290
% 0.47/1.13 literals s-matched: 188
% 0.47/1.13 literals matched: 188
% 0.47/1.13 full subsumption: 0
% 0.47/1.13
% 0.47/1.13 checksum: 942930367
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 Bliksem ended
%------------------------------------------------------------------------------