TSTP Solution File: COM004-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : COM004-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n026.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 : Fri Jul 15 00:51:00 EDT 2022
% Result : Unsatisfiable 0.71s 1.09s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : COM004-1 : TPTP v8.1.0. Released v1.1.0.
% 0.10/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n026.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 : Thu Jun 16 19:49:53 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.71/1.09 *** allocated 10000 integers for termspace/termends
% 0.71/1.09 *** allocated 10000 integers for clauses
% 0.71/1.09 *** allocated 10000 integers for justifications
% 0.71/1.09 Bliksem 1.12
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 Automatic Strategy Selection
% 0.71/1.09
% 0.71/1.09 Clauses:
% 0.71/1.09 [
% 0.71/1.09 [ 'failure_node'( 'parent_of'( X, Y ), or( Z, T ) ), ~( 'failure_node'(
% 0.71/1.09 X, or( Z, U ) ) ), ~( 'failure_node'( Y, or( T, W ) ) ), ~( contradictory(
% 0.71/1.09 U, W ) ), ~( siblings( X, Y ) ) ],
% 0.71/1.09 [ contradictory( negate( X ), X ) ],
% 0.71/1.09 [ contradictory( X, negate( X ) ) ],
% 0.71/1.09 [ siblings( 'left_child_of'( X ), 'right_child_of'( X ) ) ],
% 0.71/1.09 [ 'failure_node'( 'n_left', or( empty, atom ) ) ],
% 0.71/1.09 [ 'failure_node'( 'n_right', or( empty, negate( atom ) ) ) ],
% 0.71/1.09 [ =( 'n_left', 'left_child_of'( n ) ) ],
% 0.71/1.09 [ =( 'n_right', 'right_child_of'( n ) ) ],
% 0.71/1.09 [ ~( 'failure_node'( X, or( empty, empty ) ) ) ]
% 0.71/1.09 ] .
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 percentage equality = 0.153846, percentage horn = 1.000000
% 0.71/1.09 This is a problem with some equality
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 Options Used:
% 0.71/1.09
% 0.71/1.09 useres = 1
% 0.71/1.09 useparamod = 1
% 0.71/1.09 useeqrefl = 1
% 0.71/1.09 useeqfact = 1
% 0.71/1.09 usefactor = 1
% 0.71/1.09 usesimpsplitting = 0
% 0.71/1.09 usesimpdemod = 5
% 0.71/1.09 usesimpres = 3
% 0.71/1.09
% 0.71/1.09 resimpinuse = 1000
% 0.71/1.09 resimpclauses = 20000
% 0.71/1.09 substype = eqrewr
% 0.71/1.09 backwardsubs = 1
% 0.71/1.09 selectoldest = 5
% 0.71/1.09
% 0.71/1.09 litorderings [0] = split
% 0.71/1.09 litorderings [1] = extend the termordering, first sorting on arguments
% 0.71/1.09
% 0.71/1.09 termordering = kbo
% 0.71/1.09
% 0.71/1.09 litapriori = 0
% 0.71/1.09 termapriori = 1
% 0.71/1.09 litaposteriori = 0
% 0.71/1.09 termaposteriori = 0
% 0.71/1.09 demodaposteriori = 0
% 0.71/1.09 ordereqreflfact = 0
% 0.71/1.09
% 0.71/1.09 litselect = negord
% 0.71/1.09
% 0.71/1.09 maxweight = 15
% 0.71/1.09 maxdepth = 30000
% 0.71/1.09 maxlength = 115
% 0.71/1.09 maxnrvars = 195
% 0.71/1.09 excuselevel = 1
% 0.71/1.09 increasemaxweight = 1
% 0.71/1.09
% 0.71/1.09 maxselected = 10000000
% 0.71/1.09 maxnrclauses = 10000000
% 0.71/1.09
% 0.71/1.09 showgenerated = 0
% 0.71/1.09 showkept = 0
% 0.71/1.09 showselected = 0
% 0.71/1.09 showdeleted = 0
% 0.71/1.09 showresimp = 1
% 0.71/1.09 showstatus = 2000
% 0.71/1.09
% 0.71/1.09 prologoutput = 1
% 0.71/1.09 nrgoals = 5000000
% 0.71/1.09 totalproof = 1
% 0.71/1.09
% 0.71/1.09 Symbols occurring in the translation:
% 0.71/1.09
% 0.71/1.09 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.71/1.09 . [1, 2] (w:1, o:29, a:1, s:1, b:0),
% 0.71/1.09 ! [4, 1] (w:0, o:21, a:1, s:1, b:0),
% 0.71/1.09 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.09 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.09 'parent_of' [41, 2] (w:1, o:55, a:1, s:1, b:0),
% 0.71/1.09 or [44, 2] (w:1, o:54, a:1, s:1, b:0),
% 0.71/1.09 'failure_node' [45, 2] (w:1, o:56, a:1, s:1, b:0),
% 0.71/1.09 contradictory [48, 2] (w:1, o:57, a:1, s:1, b:0),
% 0.71/1.09 siblings [49, 2] (w:1, o:58, a:1, s:1, b:0),
% 0.71/1.09 negate [50, 1] (w:1, o:26, a:1, s:1, b:0),
% 0.71/1.09 'left_child_of' [51, 1] (w:1, o:27, a:1, s:1, b:0),
% 0.71/1.09 'right_child_of' [52, 1] (w:1, o:28, a:1, s:1, b:0),
% 0.71/1.09 'n_left' [53, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.71/1.09 empty [54, 0] (w:1, o:16, a:1, s:1, b:0),
% 0.71/1.09 atom [55, 0] (w:1, o:17, a:1, s:1, b:0),
% 0.71/1.09 'n_right' [56, 0] (w:1, o:18, a:1, s:1, b:0),
% 0.71/1.09 n [57, 0] (w:1, o:19, a:1, s:1, b:0).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 Starting Search:
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 Bliksems!, er is een bewijs:
% 0.71/1.09 % SZS status Unsatisfiable
% 0.71/1.09 % SZS output start Refutation
% 0.71/1.09
% 0.71/1.09 clause( 0, [ 'failure_node'( 'parent_of'( X, Y ), or( Z, T ) ), ~(
% 0.71/1.09 'failure_node'( X, or( Z, U ) ) ), ~( 'failure_node'( Y, or( T, W ) ) ),
% 0.71/1.09 ~( contradictory( U, W ) ), ~( siblings( X, Y ) ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 2, [ contradictory( X, negate( X ) ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 3, [ siblings( 'left_child_of'( X ), 'right_child_of'( X ) ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 4, [ 'failure_node'( 'n_left', or( empty, atom ) ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 5, [ 'failure_node'( 'n_right', or( empty, negate( atom ) ) ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 6, [ =( 'left_child_of'( n ), 'n_left' ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 7, [ =( 'right_child_of'( n ), 'n_right' ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 8, [ ~( 'failure_node'( X, or( empty, empty ) ) ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 12, [ ~( 'failure_node'( X, or( empty, Y ) ) ), ~( 'failure_node'(
% 0.71/1.09 Z, or( empty, T ) ) ), ~( contradictory( Y, T ) ), ~( siblings( X, Z ) )
% 0.71/1.09 ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 17, [ siblings( 'n_left', 'n_right' ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 26, [ ~( 'failure_node'( X, or( empty, Y ) ) ), ~( contradictory(
% 0.71/1.09 atom, Y ) ), ~( siblings( 'n_left', X ) ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 32, [ ~( siblings( 'n_left', 'n_right' ) ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 35, [] )
% 0.71/1.09 .
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 % SZS output end Refutation
% 0.71/1.09 found a proof!
% 0.71/1.09
% 0.71/1.09 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.71/1.09
% 0.71/1.09 initialclauses(
% 0.71/1.09 [ clause( 37, [ 'failure_node'( 'parent_of'( X, Y ), or( Z, T ) ), ~(
% 0.71/1.09 'failure_node'( X, or( Z, U ) ) ), ~( 'failure_node'( Y, or( T, W ) ) ),
% 0.71/1.09 ~( contradictory( U, W ) ), ~( siblings( X, Y ) ) ] )
% 0.71/1.09 , clause( 38, [ contradictory( negate( X ), X ) ] )
% 0.71/1.09 , clause( 39, [ contradictory( X, negate( X ) ) ] )
% 0.71/1.09 , clause( 40, [ siblings( 'left_child_of'( X ), 'right_child_of'( X ) ) ]
% 0.71/1.09 )
% 0.71/1.09 , clause( 41, [ 'failure_node'( 'n_left', or( empty, atom ) ) ] )
% 0.71/1.09 , clause( 42, [ 'failure_node'( 'n_right', or( empty, negate( atom ) ) ) ]
% 0.71/1.09 )
% 0.71/1.09 , clause( 43, [ =( 'n_left', 'left_child_of'( n ) ) ] )
% 0.71/1.09 , clause( 44, [ =( 'n_right', 'right_child_of'( n ) ) ] )
% 0.71/1.09 , clause( 45, [ ~( 'failure_node'( X, or( empty, empty ) ) ) ] )
% 0.71/1.09 ] ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 0, [ 'failure_node'( 'parent_of'( X, Y ), or( Z, T ) ), ~(
% 0.71/1.09 'failure_node'( X, or( Z, U ) ) ), ~( 'failure_node'( Y, or( T, W ) ) ),
% 0.71/1.09 ~( contradictory( U, W ) ), ~( siblings( X, Y ) ) ] )
% 0.71/1.09 , clause( 37, [ 'failure_node'( 'parent_of'( X, Y ), or( Z, T ) ), ~(
% 0.71/1.09 'failure_node'( X, or( Z, U ) ) ), ~( 'failure_node'( Y, or( T, W ) ) ),
% 0.71/1.09 ~( contradictory( U, W ) ), ~( siblings( X, Y ) ) ] )
% 0.71/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.71/1.09 , U ), :=( W, W )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 ), ==>( 2
% 0.71/1.09 , 2 ), ==>( 3, 3 ), ==>( 4, 4 )] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 2, [ contradictory( X, negate( X ) ) ] )
% 0.71/1.09 , clause( 39, [ contradictory( X, negate( X ) ) ] )
% 0.71/1.09 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 3, [ siblings( 'left_child_of'( X ), 'right_child_of'( X ) ) ] )
% 0.71/1.09 , clause( 40, [ siblings( 'left_child_of'( X ), 'right_child_of'( X ) ) ]
% 0.71/1.09 )
% 0.71/1.09 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 4, [ 'failure_node'( 'n_left', or( empty, atom ) ) ] )
% 0.71/1.09 , clause( 41, [ 'failure_node'( 'n_left', or( empty, atom ) ) ] )
% 0.71/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 5, [ 'failure_node'( 'n_right', or( empty, negate( atom ) ) ) ] )
% 0.71/1.09 , clause( 42, [ 'failure_node'( 'n_right', or( empty, negate( atom ) ) ) ]
% 0.71/1.09 )
% 0.71/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 eqswap(
% 0.71/1.09 clause( 52, [ =( 'left_child_of'( n ), 'n_left' ) ] )
% 0.71/1.09 , clause( 43, [ =( 'n_left', 'left_child_of'( n ) ) ] )
% 0.71/1.09 , 0, substitution( 0, [] )).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 6, [ =( 'left_child_of'( n ), 'n_left' ) ] )
% 0.71/1.09 , clause( 52, [ =( 'left_child_of'( n ), 'n_left' ) ] )
% 0.71/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 eqswap(
% 0.71/1.09 clause( 55, [ =( 'right_child_of'( n ), 'n_right' ) ] )
% 0.71/1.09 , clause( 44, [ =( 'n_right', 'right_child_of'( n ) ) ] )
% 0.71/1.09 , 0, substitution( 0, [] )).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 7, [ =( 'right_child_of'( n ), 'n_right' ) ] )
% 0.71/1.09 , clause( 55, [ =( 'right_child_of'( n ), 'n_right' ) ] )
% 0.71/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 8, [ ~( 'failure_node'( X, or( empty, empty ) ) ) ] )
% 0.71/1.09 , clause( 45, [ ~( 'failure_node'( X, or( empty, empty ) ) ) ] )
% 0.71/1.09 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 resolution(
% 0.71/1.09 clause( 59, [ ~( 'failure_node'( X, or( empty, Z ) ) ), ~( 'failure_node'(
% 0.71/1.09 Y, or( empty, T ) ) ), ~( contradictory( Z, T ) ), ~( siblings( X, Y ) )
% 0.71/1.09 ] )
% 0.71/1.09 , clause( 8, [ ~( 'failure_node'( X, or( empty, empty ) ) ) ] )
% 0.71/1.09 , 0, clause( 0, [ 'failure_node'( 'parent_of'( X, Y ), or( Z, T ) ), ~(
% 0.71/1.09 'failure_node'( X, or( Z, U ) ) ), ~( 'failure_node'( Y, or( T, W ) ) ),
% 0.71/1.09 ~( contradictory( U, W ) ), ~( siblings( X, Y ) ) ] )
% 0.71/1.09 , 0, substitution( 0, [ :=( X, 'parent_of'( X, Y ) )] ), substitution( 1, [
% 0.71/1.09 :=( X, X ), :=( Y, Y ), :=( Z, empty ), :=( T, empty ), :=( U, Z ), :=(
% 0.71/1.09 W, T )] )).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 12, [ ~( 'failure_node'( X, or( empty, Y ) ) ), ~( 'failure_node'(
% 0.71/1.09 Z, or( empty, T ) ) ), ~( contradictory( Y, T ) ), ~( siblings( X, Z ) )
% 0.71/1.09 ] )
% 0.71/1.09 , clause( 59, [ ~( 'failure_node'( X, or( empty, Z ) ) ), ~( 'failure_node'(
% 0.71/1.09 Y, or( empty, T ) ) ), ~( contradictory( Z, T ) ), ~( siblings( X, Y ) )
% 0.71/1.09 ] )
% 0.71/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Z ), :=( Z, Y ), :=( T, T )] ),
% 0.71/1.09 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 ), ==>( 2, 2 ), ==>( 3, 3 )] )
% 0.71/1.09 ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 paramod(
% 0.71/1.09 clause( 63, [ siblings( 'n_left', 'right_child_of'( n ) ) ] )
% 0.71/1.09 , clause( 6, [ =( 'left_child_of'( n ), 'n_left' ) ] )
% 0.71/1.09 , 0, clause( 3, [ siblings( 'left_child_of'( X ), 'right_child_of'( X ) ) ]
% 0.71/1.09 )
% 0.71/1.09 , 0, 1, substitution( 0, [] ), substitution( 1, [ :=( X, n )] )).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 paramod(
% 0.71/1.09 clause( 64, [ siblings( 'n_left', 'n_right' ) ] )
% 0.71/1.09 , clause( 7, [ =( 'right_child_of'( n ), 'n_right' ) ] )
% 0.71/1.09 , 0, clause( 63, [ siblings( 'n_left', 'right_child_of'( n ) ) ] )
% 0.71/1.09 , 0, 2, substitution( 0, [] ), substitution( 1, [] )).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 17, [ siblings( 'n_left', 'n_right' ) ] )
% 0.71/1.09 , clause( 64, [ siblings( 'n_left', 'n_right' ) ] )
% 0.71/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 resolution(
% 0.71/1.09 clause( 65, [ ~( 'failure_node'( X, or( empty, Y ) ) ), ~( contradictory(
% 0.71/1.09 atom, Y ) ), ~( siblings( 'n_left', X ) ) ] )
% 0.71/1.09 , clause( 12, [ ~( 'failure_node'( X, or( empty, Y ) ) ), ~( 'failure_node'(
% 0.71/1.09 Z, or( empty, T ) ) ), ~( contradictory( Y, T ) ), ~( siblings( X, Z ) )
% 0.71/1.09 ] )
% 0.71/1.09 , 0, clause( 4, [ 'failure_node'( 'n_left', or( empty, atom ) ) ] )
% 0.71/1.09 , 0, substitution( 0, [ :=( X, 'n_left' ), :=( Y, atom ), :=( Z, X ), :=( T
% 0.71/1.09 , Y )] ), substitution( 1, [] )).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 26, [ ~( 'failure_node'( X, or( empty, Y ) ) ), ~( contradictory(
% 0.71/1.09 atom, Y ) ), ~( siblings( 'n_left', X ) ) ] )
% 0.71/1.09 , clause( 65, [ ~( 'failure_node'( X, or( empty, Y ) ) ), ~( contradictory(
% 0.71/1.09 atom, Y ) ), ~( siblings( 'n_left', X ) ) ] )
% 0.71/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.09 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 resolution(
% 0.71/1.09 clause( 67, [ ~( contradictory( atom, negate( atom ) ) ), ~( siblings(
% 0.71/1.09 'n_left', 'n_right' ) ) ] )
% 0.71/1.09 , clause( 26, [ ~( 'failure_node'( X, or( empty, Y ) ) ), ~( contradictory(
% 0.71/1.09 atom, Y ) ), ~( siblings( 'n_left', X ) ) ] )
% 0.71/1.09 , 0, clause( 5, [ 'failure_node'( 'n_right', or( empty, negate( atom ) ) )
% 0.71/1.09 ] )
% 0.71/1.09 , 0, substitution( 0, [ :=( X, 'n_right' ), :=( Y, negate( atom ) )] ),
% 0.71/1.09 substitution( 1, [] )).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 resolution(
% 0.71/1.09 clause( 68, [ ~( siblings( 'n_left', 'n_right' ) ) ] )
% 0.71/1.09 , clause( 67, [ ~( contradictory( atom, negate( atom ) ) ), ~( siblings(
% 0.71/1.09 'n_left', 'n_right' ) ) ] )
% 0.71/1.09 , 0, clause( 2, [ contradictory( X, negate( X ) ) ] )
% 0.71/1.09 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, atom )] )).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 32, [ ~( siblings( 'n_left', 'n_right' ) ) ] )
% 0.71/1.09 , clause( 68, [ ~( siblings( 'n_left', 'n_right' ) ) ] )
% 0.71/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 resolution(
% 0.71/1.09 clause( 69, [] )
% 0.71/1.09 , clause( 32, [ ~( siblings( 'n_left', 'n_right' ) ) ] )
% 0.71/1.09 , 0, clause( 17, [ siblings( 'n_left', 'n_right' ) ] )
% 0.71/1.09 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 35, [] )
% 0.71/1.09 , clause( 69, [] )
% 0.71/1.09 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 end.
% 0.71/1.09
% 0.71/1.09 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.71/1.09
% 0.71/1.09 Memory use:
% 0.71/1.09
% 0.71/1.09 space for terms: 724
% 0.71/1.09 space for clauses: 1982
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 clauses generated: 101
% 0.71/1.09 clauses kept: 36
% 0.71/1.09 clauses selected: 17
% 0.71/1.09 clauses deleted: 1
% 0.71/1.09 clauses inuse deleted: 0
% 0.71/1.09
% 0.71/1.09 subsentry: 74
% 0.71/1.09 literals s-matched: 38
% 0.71/1.09 literals matched: 31
% 0.71/1.09 full subsumption: 9
% 0.71/1.09
% 0.71/1.09 checksum: 53362697
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 Bliksem ended
%------------------------------------------------------------------------------