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