TSTP Solution File: KRS001-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : KRS001-1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n027.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 : Sun Jul 17 02:41:54 EDT 2022
% Result : Unsatisfiable 0.42s 1.06s
% Output : Refutation 0.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : KRS001-1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n027.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 7 16:02:10 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.42/1.06 *** allocated 10000 integers for termspace/termends
% 0.42/1.06 *** allocated 10000 integers for clauses
% 0.42/1.06 *** allocated 10000 integers for justifications
% 0.42/1.06 Bliksem 1.12
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 Automatic Strategy Selection
% 0.42/1.06
% 0.42/1.06 Clauses:
% 0.42/1.06 [
% 0.42/1.06 [ e( exist ) ],
% 0.42/1.06 [ r2least( X ), ~( c( X ) ) ],
% 0.42/1.06 [ c( X ), ~( r2least( X ) ) ],
% 0.42/1.06 [ ~( r2least( X ) ), ~( equalish( u1r2( X ), u1r1( X ) ) ) ],
% 0.42/1.06 [ r( X, u1r1( X ) ), ~( r2least( X ) ) ],
% 0.42/1.06 [ r( X, u1r2( X ) ), ~( r2least( X ) ) ],
% 0.42/1.06 [ r2least( X ), equalish( Y, Z ), ~( r( X, Y ) ), ~( r( X, Z ) ) ],
% 0.42/1.06 [ r1most( X ), ~( d( X ) ) ],
% 0.42/1.06 [ d( X ), ~( r1most( X ) ) ],
% 0.42/1.06 [ equalish( X, Y ), ~( r1most( Z ) ), ~( r( Z, X ) ), ~( r( Z, Y ) ) ]
% 0.42/1.06 ,
% 0.42/1.06 [ r1most( X ), ~( equalish( u3r2( X ), u3r1( X ) ) ) ],
% 0.42/1.06 [ r1most( X ), r( X, u3r1( X ) ) ],
% 0.42/1.06 [ r1most( X ), r( X, u3r2( X ) ) ],
% 0.42/1.06 [ d( X ), ~( e( X ) ) ],
% 0.42/1.06 [ c( X ), ~( e( X ) ) ],
% 0.42/1.06 [ e( X ), ~( c( X ) ), ~( d( X ) ) ]
% 0.42/1.06 ] .
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 percentage equality = 0.000000, percentage horn = 0.812500
% 0.42/1.06 This a non-horn, non-equality problem
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 Options Used:
% 0.42/1.06
% 0.42/1.06 useres = 1
% 0.42/1.06 useparamod = 0
% 0.42/1.06 useeqrefl = 0
% 0.42/1.06 useeqfact = 0
% 0.42/1.06 usefactor = 1
% 0.42/1.06 usesimpsplitting = 0
% 0.42/1.06 usesimpdemod = 0
% 0.42/1.06 usesimpres = 3
% 0.42/1.06
% 0.42/1.06 resimpinuse = 1000
% 0.42/1.06 resimpclauses = 20000
% 0.42/1.06 substype = standard
% 0.42/1.06 backwardsubs = 1
% 0.42/1.06 selectoldest = 5
% 0.42/1.06
% 0.42/1.06 litorderings [0] = split
% 0.42/1.06 litorderings [1] = liftord
% 0.42/1.06
% 0.42/1.06 termordering = none
% 0.42/1.06
% 0.42/1.06 litapriori = 1
% 0.42/1.06 termapriori = 0
% 0.42/1.06 litaposteriori = 0
% 0.42/1.06 termaposteriori = 0
% 0.42/1.06 demodaposteriori = 0
% 0.42/1.06 ordereqreflfact = 0
% 0.42/1.06
% 0.42/1.06 litselect = none
% 0.42/1.06
% 0.42/1.06 maxweight = 15
% 0.42/1.06 maxdepth = 30000
% 0.42/1.06 maxlength = 115
% 0.42/1.06 maxnrvars = 195
% 0.42/1.06 excuselevel = 1
% 0.42/1.06 increasemaxweight = 1
% 0.42/1.06
% 0.42/1.06 maxselected = 10000000
% 0.42/1.06 maxnrclauses = 10000000
% 0.42/1.06
% 0.42/1.06 showgenerated = 0
% 0.42/1.06 showkept = 0
% 0.42/1.06 showselected = 0
% 0.42/1.06 showdeleted = 0
% 0.42/1.06 showresimp = 1
% 0.42/1.06 showstatus = 2000
% 0.42/1.06
% 0.42/1.06 prologoutput = 1
% 0.42/1.06 nrgoals = 5000000
% 0.42/1.06 totalproof = 1
% 0.42/1.06
% 0.42/1.06 Symbols occurring in the translation:
% 0.42/1.06
% 0.42/1.06 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.42/1.06 . [1, 2] (w:1, o:27, a:1, s:1, b:0),
% 0.42/1.06 ! [4, 1] (w:0, o:13, a:1, s:1, b:0),
% 0.42/1.06 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.42/1.06 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.42/1.06 exist [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.42/1.06 e [40, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.42/1.06 r2least [42, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.42/1.06 c [43, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.42/1.06 u1r2 [44, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.42/1.06 u1r1 [45, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.42/1.06 equalish [46, 2] (w:1, o:52, a:1, s:1, b:0),
% 0.42/1.06 r [47, 2] (w:1, o:53, a:1, s:1, b:0),
% 0.42/1.06 r1most [50, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.42/1.06 d [51, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.42/1.06 u3r2 [52, 1] (w:1, o:26, a:1, s:1, b:0),
% 0.42/1.06 u3r1 [53, 1] (w:1, o:25, a:1, s:1, b:0).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 Starting Search:
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 Bliksems!, er is een bewijs:
% 0.42/1.06 % SZS status Unsatisfiable
% 0.42/1.06 % SZS output start Refutation
% 0.42/1.06
% 0.42/1.06 clause( 0, [ e( exist ) ] )
% 0.42/1.06 .
% 0.42/1.06 clause( 1, [ r2least( X ), ~( c( X ) ) ] )
% 0.42/1.06 .
% 0.42/1.06 clause( 3, [ ~( r2least( X ) ), ~( equalish( u1r2( X ), u1r1( X ) ) ) ] )
% 0.42/1.06 .
% 0.42/1.06 clause( 4, [ ~( r2least( X ) ), r( X, u1r1( X ) ) ] )
% 0.42/1.06 .
% 0.42/1.06 clause( 5, [ ~( r2least( X ) ), r( X, u1r2( X ) ) ] )
% 0.42/1.06 .
% 0.42/1.06 clause( 7, [ ~( d( X ) ), r1most( X ) ] )
% 0.42/1.06 .
% 0.42/1.06 clause( 9, [ ~( r1most( Z ) ), equalish( X, Y ), ~( r( Z, Y ) ), ~( r( Z, X
% 0.42/1.06 ) ) ] )
% 0.42/1.06 .
% 0.42/1.06 clause( 13, [ d( X ), ~( e( X ) ) ] )
% 0.42/1.06 .
% 0.42/1.06 clause( 14, [ ~( e( X ) ), c( X ) ] )
% 0.42/1.06 .
% 0.42/1.06 clause( 19, [ ~( e( X ) ), r2least( X ) ] )
% 0.42/1.06 .
% 0.42/1.06 clause( 29, [ ~( r1most( X ) ), equalish( Y, u1r1( X ) ), ~( r2least( X ) )
% 0.42/1.06 , ~( r( X, Y ) ) ] )
% 0.42/1.06 .
% 0.42/1.06 clause( 34, [ ~( r1most( X ) ), ~( r2least( X ) ) ] )
% 0.42/1.06 .
% 0.42/1.06 clause( 35, [ ~( e( X ) ), ~( r1most( X ) ) ] )
% 0.42/1.06 .
% 0.42/1.06 clause( 36, [ ~( e( X ) ) ] )
% 0.42/1.06 .
% 0.42/1.06 clause( 37, [] )
% 0.42/1.06 .
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 % SZS output end Refutation
% 0.42/1.06 found a proof!
% 0.42/1.06
% 0.42/1.06 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.42/1.06
% 0.42/1.06 initialclauses(
% 0.42/1.06 [ clause( 39, [ e( exist ) ] )
% 0.42/1.06 , clause( 40, [ r2least( X ), ~( c( X ) ) ] )
% 0.42/1.06 , clause( 41, [ c( X ), ~( r2least( X ) ) ] )
% 0.42/1.06 , clause( 42, [ ~( r2least( X ) ), ~( equalish( u1r2( X ), u1r1( X ) ) ) ]
% 0.42/1.06 )
% 0.42/1.06 , clause( 43, [ r( X, u1r1( X ) ), ~( r2least( X ) ) ] )
% 0.42/1.06 , clause( 44, [ r( X, u1r2( X ) ), ~( r2least( X ) ) ] )
% 0.42/1.06 , clause( 45, [ r2least( X ), equalish( Y, Z ), ~( r( X, Y ) ), ~( r( X, Z
% 0.42/1.06 ) ) ] )
% 0.42/1.06 , clause( 46, [ r1most( X ), ~( d( X ) ) ] )
% 0.42/1.06 , clause( 47, [ d( X ), ~( r1most( X ) ) ] )
% 0.42/1.06 , clause( 48, [ equalish( X, Y ), ~( r1most( Z ) ), ~( r( Z, X ) ), ~( r( Z
% 0.42/1.06 , Y ) ) ] )
% 0.42/1.06 , clause( 49, [ r1most( X ), ~( equalish( u3r2( X ), u3r1( X ) ) ) ] )
% 0.42/1.06 , clause( 50, [ r1most( X ), r( X, u3r1( X ) ) ] )
% 0.42/1.06 , clause( 51, [ r1most( X ), r( X, u3r2( X ) ) ] )
% 0.42/1.06 , clause( 52, [ d( X ), ~( e( X ) ) ] )
% 0.42/1.06 , clause( 53, [ c( X ), ~( e( X ) ) ] )
% 0.42/1.06 , clause( 54, [ e( X ), ~( c( X ) ), ~( d( X ) ) ] )
% 0.42/1.06 ] ).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 subsumption(
% 0.42/1.06 clause( 0, [ e( exist ) ] )
% 0.42/1.06 , clause( 39, [ e( exist ) ] )
% 0.42/1.06 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 subsumption(
% 0.42/1.06 clause( 1, [ r2least( X ), ~( c( X ) ) ] )
% 0.42/1.06 , clause( 40, [ r2least( X ), ~( c( X ) ) ] )
% 0.42/1.06 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.42/1.06 1 )] ) ).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 subsumption(
% 0.42/1.06 clause( 3, [ ~( r2least( X ) ), ~( equalish( u1r2( X ), u1r1( X ) ) ) ] )
% 0.42/1.06 , clause( 42, [ ~( r2least( X ) ), ~( equalish( u1r2( X ), u1r1( X ) ) ) ]
% 0.42/1.06 )
% 0.42/1.06 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.42/1.06 1 )] ) ).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 subsumption(
% 0.42/1.06 clause( 4, [ ~( r2least( X ) ), r( X, u1r1( X ) ) ] )
% 0.42/1.06 , clause( 43, [ r( X, u1r1( X ) ), ~( r2least( X ) ) ] )
% 0.42/1.06 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.42/1.06 0 )] ) ).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 subsumption(
% 0.42/1.06 clause( 5, [ ~( r2least( X ) ), r( X, u1r2( X ) ) ] )
% 0.42/1.06 , clause( 44, [ r( X, u1r2( X ) ), ~( r2least( X ) ) ] )
% 0.42/1.06 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.42/1.06 0 )] ) ).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 subsumption(
% 0.42/1.06 clause( 7, [ ~( d( X ) ), r1most( X ) ] )
% 0.42/1.06 , clause( 46, [ r1most( X ), ~( d( X ) ) ] )
% 0.42/1.06 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.42/1.06 0 )] ) ).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 subsumption(
% 0.42/1.06 clause( 9, [ ~( r1most( Z ) ), equalish( X, Y ), ~( r( Z, Y ) ), ~( r( Z, X
% 0.42/1.06 ) ) ] )
% 0.42/1.06 , clause( 48, [ equalish( X, Y ), ~( r1most( Z ) ), ~( r( Z, X ) ), ~( r( Z
% 0.42/1.06 , Y ) ) ] )
% 0.42/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.42/1.06 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 ), ==>( 2, 3 ), ==>( 3, 2 )] )
% 0.42/1.06 ).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 subsumption(
% 0.42/1.06 clause( 13, [ d( X ), ~( e( X ) ) ] )
% 0.42/1.06 , clause( 52, [ d( X ), ~( e( X ) ) ] )
% 0.42/1.06 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.42/1.06 1 )] ) ).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 subsumption(
% 0.42/1.06 clause( 14, [ ~( e( X ) ), c( X ) ] )
% 0.42/1.06 , clause( 53, [ c( X ), ~( e( X ) ) ] )
% 0.42/1.06 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.42/1.06 0 )] ) ).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 resolution(
% 0.42/1.06 clause( 62, [ r2least( X ), ~( e( X ) ) ] )
% 0.42/1.06 , clause( 1, [ r2least( X ), ~( c( X ) ) ] )
% 0.42/1.06 , 1, clause( 14, [ ~( e( X ) ), c( X ) ] )
% 0.42/1.06 , 1, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X )] )
% 0.42/1.06 ).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 subsumption(
% 0.42/1.06 clause( 19, [ ~( e( X ) ), r2least( X ) ] )
% 0.42/1.06 , clause( 62, [ r2least( X ), ~( e( X ) ) ] )
% 0.42/1.06 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.42/1.06 0 )] ) ).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 resolution(
% 0.42/1.06 clause( 63, [ ~( r1most( X ) ), equalish( Y, u1r1( X ) ), ~( r( X, Y ) ),
% 0.42/1.06 ~( r2least( X ) ) ] )
% 0.42/1.06 , clause( 9, [ ~( r1most( Z ) ), equalish( X, Y ), ~( r( Z, Y ) ), ~( r( Z
% 0.42/1.06 , X ) ) ] )
% 0.42/1.06 , 2, clause( 4, [ ~( r2least( X ) ), r( X, u1r1( X ) ) ] )
% 0.42/1.06 , 1, substitution( 0, [ :=( X, Y ), :=( Y, u1r1( X ) ), :=( Z, X )] ),
% 0.42/1.06 substitution( 1, [ :=( X, X )] )).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 subsumption(
% 0.42/1.06 clause( 29, [ ~( r1most( X ) ), equalish( Y, u1r1( X ) ), ~( r2least( X ) )
% 0.42/1.06 , ~( r( X, Y ) ) ] )
% 0.42/1.06 , clause( 63, [ ~( r1most( X ) ), equalish( Y, u1r1( X ) ), ~( r( X, Y ) )
% 0.42/1.06 , ~( r2least( X ) ) ] )
% 0.42/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.42/1.06 ), ==>( 1, 1 ), ==>( 2, 3 ), ==>( 3, 2 )] ) ).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 resolution(
% 0.42/1.06 clause( 65, [ ~( r1most( X ) ), equalish( u1r2( X ), u1r1( X ) ), ~(
% 0.42/1.06 r2least( X ) ), ~( r2least( X ) ) ] )
% 0.42/1.06 , clause( 29, [ ~( r1most( X ) ), equalish( Y, u1r1( X ) ), ~( r2least( X )
% 0.42/1.06 ), ~( r( X, Y ) ) ] )
% 0.42/1.06 , 3, clause( 5, [ ~( r2least( X ) ), r( X, u1r2( X ) ) ] )
% 0.42/1.06 , 1, substitution( 0, [ :=( X, X ), :=( Y, u1r2( X ) )] ), substitution( 1
% 0.42/1.06 , [ :=( X, X )] )).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 resolution(
% 0.42/1.06 clause( 67, [ ~( r2least( X ) ), ~( r1most( X ) ), ~( r2least( X ) ), ~(
% 0.42/1.06 r2least( X ) ) ] )
% 0.42/1.06 , clause( 3, [ ~( r2least( X ) ), ~( equalish( u1r2( X ), u1r1( X ) ) ) ]
% 0.42/1.06 )
% 0.42/1.06 , 1, clause( 65, [ ~( r1most( X ) ), equalish( u1r2( X ), u1r1( X ) ), ~(
% 0.42/1.06 r2least( X ) ), ~( r2least( X ) ) ] )
% 0.42/1.06 , 1, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X )] )
% 0.42/1.06 ).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 factor(
% 0.42/1.06 clause( 68, [ ~( r2least( X ) ), ~( r1most( X ) ), ~( r2least( X ) ) ] )
% 0.42/1.06 , clause( 67, [ ~( r2least( X ) ), ~( r1most( X ) ), ~( r2least( X ) ), ~(
% 0.42/1.06 r2least( X ) ) ] )
% 0.42/1.06 , 0, 2, substitution( 0, [ :=( X, X )] )).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 factor(
% 0.42/1.06 clause( 69, [ ~( r2least( X ) ), ~( r1most( X ) ) ] )
% 0.42/1.06 , clause( 68, [ ~( r2least( X ) ), ~( r1most( X ) ), ~( r2least( X ) ) ] )
% 0.42/1.06 , 0, 2, substitution( 0, [ :=( X, X )] )).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 subsumption(
% 0.42/1.06 clause( 34, [ ~( r1most( X ) ), ~( r2least( X ) ) ] )
% 0.42/1.06 , clause( 69, [ ~( r2least( X ) ), ~( r1most( X ) ) ] )
% 0.42/1.06 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.42/1.06 0 )] ) ).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 resolution(
% 0.42/1.06 clause( 70, [ ~( r1most( X ) ), ~( e( X ) ) ] )
% 0.42/1.06 , clause( 34, [ ~( r1most( X ) ), ~( r2least( X ) ) ] )
% 0.42/1.06 , 1, clause( 19, [ ~( e( X ) ), r2least( X ) ] )
% 0.42/1.06 , 1, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X )] )
% 0.42/1.06 ).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 subsumption(
% 0.42/1.06 clause( 35, [ ~( e( X ) ), ~( r1most( X ) ) ] )
% 0.42/1.06 , clause( 70, [ ~( r1most( X ) ), ~( e( X ) ) ] )
% 0.42/1.06 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.42/1.06 0 )] ) ).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 resolution(
% 0.42/1.06 clause( 71, [ ~( e( X ) ), ~( d( X ) ) ] )
% 0.42/1.06 , clause( 35, [ ~( e( X ) ), ~( r1most( X ) ) ] )
% 0.42/1.06 , 1, clause( 7, [ ~( d( X ) ), r1most( X ) ] )
% 0.42/1.06 , 1, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X )] )
% 0.42/1.06 ).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 resolution(
% 0.42/1.06 clause( 72, [ ~( e( X ) ), ~( e( X ) ) ] )
% 0.42/1.06 , clause( 71, [ ~( e( X ) ), ~( d( X ) ) ] )
% 0.42/1.06 , 1, clause( 13, [ d( X ), ~( e( X ) ) ] )
% 0.42/1.06 , 0, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X )] )
% 0.42/1.06 ).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 factor(
% 0.42/1.06 clause( 73, [ ~( e( X ) ) ] )
% 0.42/1.06 , clause( 72, [ ~( e( X ) ), ~( e( X ) ) ] )
% 0.42/1.06 , 0, 1, substitution( 0, [ :=( X, X )] )).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 subsumption(
% 0.42/1.06 clause( 36, [ ~( e( X ) ) ] )
% 0.42/1.06 , clause( 73, [ ~( e( X ) ) ] )
% 0.42/1.06 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 resolution(
% 0.42/1.06 clause( 74, [] )
% 0.42/1.06 , clause( 36, [ ~( e( X ) ) ] )
% 0.42/1.06 , 0, clause( 0, [ e( exist ) ] )
% 0.42/1.06 , 0, substitution( 0, [ :=( X, exist )] ), substitution( 1, [] )).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 subsumption(
% 0.42/1.06 clause( 37, [] )
% 0.42/1.06 , clause( 74, [] )
% 0.42/1.06 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 end.
% 0.42/1.06
% 0.42/1.06 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.42/1.06
% 0.42/1.06 Memory use:
% 0.42/1.06
% 0.42/1.06 space for terms: 638
% 0.42/1.06 space for clauses: 1991
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 clauses generated: 62
% 0.42/1.06 clauses kept: 38
% 0.42/1.06 clauses selected: 31
% 0.42/1.06 clauses deleted: 1
% 0.42/1.06 clauses inuse deleted: 0
% 0.42/1.06
% 0.42/1.06 subsentry: 41
% 0.42/1.06 literals s-matched: 31
% 0.42/1.06 literals matched: 17
% 0.42/1.06 full subsumption: 0
% 0.42/1.06
% 0.42/1.06 checksum: 13410256
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 Bliksem ended
%------------------------------------------------------------------------------